ZDIFFSTORE destination numkeys key [key ...]

Available since: 6.2.0

Time complexity: O(L + (N-K)log(N)) worst case where L is the total number of elements in all the sets, N is the size of the first set, and K is the size of the result set.

ACL categories: @write @sortedset @slow

Computes the difference between the first and all successive input sorted sets and stores the result in destination. The total number of input keys is specified by numkeys.

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

If destination already exists, it is overwritten.

@return

@integer-reply: the number of elements in the resulting sorted set at destination.

@examples

redis> ZADD zset1 1 "one"
TBD
redis> ZADD zset1 2 "two"
TBD
redis> ZADD zset1 3 "three"
TBD
redis> ZADD zset2 1 "one"
TBD
redis> ZADD zset2 2 "two"
TBD
redis> ZDIFFSTORE out 2 zset1 zset2
TBD
redis> ZRANGE out 0 -1 WITHSCORES