ZREM

Usage:
ZREM key member [ member ...]
Complexity:
O(M*log(N)) with N being the number of elements in the sorted set and M the number of elements to be removed.
Since:
1.2.0

Removes the specified members from the sorted set stored at key. Non existing members are ignored.

An error is returned when key exists and does not hold a sorted set.

Examples

ZADD myzset 1 "one"
ZADD myzset 2 "two"
ZADD myzset 3 "three"
ZREM myzset "two"
ZRANGE myzset 0 -1 WITHSCORES

History

Version Change
2.4.0 Accepts multiple elements.