ZREVRANGEBYLEX key max min [LIMIT offset count]

Available since 2.8.9.

Time complexity: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).

When all the elements in a sorted set are inserted with the same score, in order to force lexicographical ordering, this command returns all the elements in the sorted set at key with a value between max and min.

Apart from the reversed ordering, ZREVRANGEBYLEX is similar to ZRANGEBYLEX.

*Return value

Array reply: list of elements in the specified score range.

*Examples

redis> ZADD myzset 0 a 0 b 0 c 0 d 0 e 0 f 0 g 

  1. (integer) 7

redis> ZREVRANGEBYLEX myzset [c - 

  1. 1) "c"
  2. 2) "b"
  3. 3) "a"

redis> ZREVRANGEBYLEX myzset (c - 

  1. 1) "b"
  2. 2) "a"

redis> ZREVRANGEBYLEX myzset (g [aaa 

  1. 1) "f"
  2. 2) "e"
  3. 3) "d"
  4. 4) "c"
  5. 5) "b"
redis>