Available since: 2.8.9
Time complexity: O(log(N)) with N being the number of elements in the sorted set.
When all the elements in a sorted set are inserted with the same score, in order to force lexicographical ordering, this command returns the number of elements in the sorted set at
key with a value between
max arguments have the same meaning as described for
Note: the command has a complexity of just O(log(N)) because it uses elements ranks (see
ZRANK) to get an idea of the range. Because of this there is no need to do a work proportional to the size of the range.
Integer reply: the number of elements in the specified score range.