ZREMRANGEBYRANK key start stop
Available since: 2.0.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 rank between start
and stop.
Both start and stop are 0 -based indexes with 0 being the element with
the lowest score.
These indexes can be negative numbers, where they indicate offsets starting at
the element with the highest score.
For example: -1 is the element with the highest score, -2 the element with
the second highest score and so forth.
Return
Integer reply: the number of elements removed.