Available since: 1.2.0
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:
@write
@sortedset
@slow
Removes all elements in the sorted set stored at key
with a score between
min
and max
(inclusive).
Integer reply: the number of elements removed.