SDIFF

SDIFF key [key ...]

Available since:

1.0.0

Time complexity:

O(N) where N is the total number of elements in all given sets.

ACL categories:

@read, @set, @slow,

Returns the members of the set resulting from the difference between the first set and all the successive sets.

For example:

key1 = {a,b,c,d}
key2 = {c}
key3 = {a,c,e}
SDIFF key1 key2 key3 = {b,d}

Keys that do not exist are considered to be empty sets.

Examples

redis> SADD key1 "a"
"1743633896470-0"
redis> SADD key1 "b"
"1743633896471-0"
redis> SADD key1 "c"
"1743633896471-1"
redis> SADD key2 "c"
"1743633896472-0"
redis> SADD key2 "d"
"1743633896472-1"
redis> SADD key2 "e"
(integer) 5
redis> SDIFF key1 key2
1) 1) "1743633896470-0"
   2) 1) "name"
      2) "Virginia"
      3) "surname"
      4) "Woolf"
2) 1) "1743633896471-0"
   2) 1) "name"
      2) "Jane"
      3) "surname"
      4) "Austen"

RESP2 Reply

RESP3 Reply