ZREMRANGEBYLEX key min max
- Available since:
- Time complexity:
- O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.
- ACL categories:
When all the elements in a sorted set are inserted with the same score, in order to force lexicographical ordering, this command removes all elements in the sorted set stored at
key between the lexicographical range specified by
The meaning of
max are the same of the
ZRANGEBYLEX command. Similarly, this command actually removes the same elements that
ZRANGEBYLEX would return if called with the same
Integer reply: the number of elements removed.