ZDIFFSTORE
ZDIFFSTORE destination numkeys key [key ...]
- Group
- Sorted set
- Complexity
- O(L+(N-K)log(N)) worst case, where L is the total number of input members, N the size of the first set and K the size of the result
- Arity
- -4 (at least 4 words, counting the command name)
- Flags
- write
- Keys
- first 1, last 1, step 1
- HotKV Cloud
- All plans
- On-Premise
- no license needed
ZDIFFSTORE computes the same difference as ZDIFF and
stores it, with each member’s score from the first set, as a sorted set at
destination, replacing whatever was there. If the result is empty,
destination is deleted. The inputs are read and the result written as one
atomic step.
Return value
Section titled “Return value”| Case | RESP2 | RESP3 |
|---|---|---|
| Success | Integer: the number of members in the stored sorted set | Same |
Errors:
ERR value is not an integer or out of rangeifnumkeysis not an integer, andERR at least 1 input key is needed for 'zdiffstore' commandif it is below 1.ERR syntax errorif the number of keys does not matchnumkeys(extra arguments included).WRONGTYPEif a key holds something other than a sorted set or a set.
Examples
Section titled “Examples”127.0.0.1:6379> ZADD all 1 "a" 2 "b" 3 "c"(integer) 3127.0.0.1:6379> ZADD done 9 "b"(integer) 1127.0.0.1:6379> ZDIFFSTORE todo 2 all done(integer) 2127.0.0.1:6379> ZRANGE todo 0 -1 WITHSCORES1) "a"2) "1"3) "c"4) "3"Compatibility
Section titled “Compatibility”Same as Redis 7.4 and Valkey 8.
See also
Section titled “See also”Was this page helpful?
Thanks for the feedback.