SDIFF

Syntax

  1. SDIFF key [key ...]

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

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

For example:

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

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

Return

Array reply: list with members of the resulting set.

Examples

  1. dragonfly> SADD key1 "a"
  2. (integer) 1
  3. dragonfly> SADD key1 "b"
  4. (integer) 1
  5. dragonfly> SADD key1 "c"
  6. (integer) 1
  7. dragonfly> SADD key2 "c"
  8. (integer) 1
  9. dragonfly> SADD key2 "d"
  10. (integer) 1
  11. dragonfly> SADD key2 "e"
  12. (integer) 1
  13. dragonfly> SDIFF key1 key2
  14. 1) "b"
  15. 2) "a"