ZREMRANGEBYLEX key min max

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 removed by the operation.

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 min and max.

The meaning of min and max are the same of the ZRANGEBYLEX command. Similarly, this command actually returns the same elements that ZRANGEBYLEX would return if called with the same min and max arguments.

*Return value

Integer reply: the number of elements removed.

*Examples

redis> ZADD myzset 0 aaaa 0 b 0 c 0 d 0 e 

  1. (integer) 5

redis> ZADD myzset 0 foo 0 zap 0 zip 0 ALPHA 0 alpha 

  1. (integer) 5

redis> ZRANGE myzset 0 -1 

  1. 1) "ALPHA"
  2.  2) "aaaa"
  3.  3) "alpha"
  4.  4) "b"
  5.  5) "c"
  6.  6) "d"
  7.  7) "e"
  8.  8) "foo"
  9.  9) "zap"
  10. 10) "zip"

redis> ZREMRANGEBYLEX myzset [alpha [omega 

  1. (integer) 6

redis> ZRANGE myzset 0 -1 

  1. 1) "ALPHA"
  2. 2) "aaaa"
  3. 3) "zap"
  4. 4) "zip"
redis>