ZREM
ZREM key member [member ...]
- Group
- Sorted set
- Complexity
- O(M*log(N)) where M is the number of members removed and N is the size of the sorted set
- Arity
- -3 (at least 3 words, counting the command name)
- Flags
- write, fast
- Keys
- first 1, last 1, step 1
- HotKV Cloud
- All plans
- On-Premise
- no license needed
ZREM removes each member from the sorted set stored at key. Members that
are not present are ignored. When the last member is removed, the key is
deleted.
Return value
Section titled “Return value”| Case | RESP2 | RESP3 |
|---|---|---|
| Success | Integer: the number of members removed | Same |
| Key does not exist | Integer 0 |
Same |
ZREM replies with a WRONGTYPE error if key holds a value that is not a
sorted set.
Examples
Section titled “Examples”127.0.0.1:6379> ZADD board 100 "alice" 90 "bob"(integer) 2127.0.0.1:6379> ZREM board "bob" "nobody"(integer) 1127.0.0.1:6379> ZRANGE board 0 -11) "alice"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.