 Usage:

BZPOPMIN key [ key ... ] timeout
 Complexity:
 O(log(N)) with N being the number of elements in the sorted set.
 Since:
 5.0.0
BZPOPMIN
is the blocking variant of the sorted set ZPOPMIN
primitive.
It is the blocking version because it blocks the connection when there are no members to pop from any of the given sorted sets. A member with the lowest score is popped from first sorted set that is nonempty, with the given keys being checked in the order that they are given.
The timeout
argument is interpreted as a double value specifying the maximum
number of seconds to block. A timeout of zero can be used to block indefinitely.
See the BLPOP documentation for the exact semantics, since BZPOPMIN
is
identical to BLPOP
with the only difference being the data structure being
popped from.
Examples
127.0.0.1:6379> DEL zset1 zset2
(integer) 0
127.0.0.1:6379> ZADD zset1 0 a 1 b 2 c
(integer) 3
127.0.0.1:6379> BZPOPMIN zset1 zset2 0
1) "zset1"
2) "a"
3) "0"
History
Version  Change 

6.0.0 
