修改本页

Redis 命令 客户端 文档 社区 下载 问题 支持 许可

SINTER key [key …]

相关命令

始于1.0.0可用。

时间复杂度: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.

Returns the members of the set resulting from the intersection of all the given sets.

For example:

  1. key1 = {a,b,c,d}
  2. key2 = {c}
  3. key3 = {a,c,e}
  4. SINTER key1 key2 key3 = {c}

Keys that do not exist are considered to be empty sets. With one of the keys being an empty set, the resulting set is also empty (since set intersection with an empty set always results in an empty set).

返回值

Array reply: list with members of the resulting set.

例子

redis> SADD key1 "a"

  1. (integer) 1

redis> SADD key1 "b"

  1. (integer) 1

redis> SADD key1 "c"

  1. (integer) 1

redis> SADD key2 "c"

  1. (integer) 1

redis> SADD key2 "d"

  1. (integer) 1

redis> SADD key2 "e"

  1. (integer) 1

redis> SINTER key1 key2

  1. 1) "c"
redis>

Comments powered by Disqus

This website is open source software developed by Citrusbyte.

The Redis logo was designed by Carlos Prioglio. See more credits.

Sponsored by Redis Support