Available since: 7.0.0
Time complexity: O(K) + O(N*log(M)) where K is the number of provided keys, N being the number of elements in the sorted set, and M being the number of elements popped.
ACL categories:
@write
@sortedset
@slow
Pops one or more elements, that are member-score pairs, from the first non-empty sorted set in the provided list of key names.
ZMPOP
and BZMPOP
are similar to the following, more limited, commands:
ZPOPMIN
or ZPOPMAX
which take only one key, and can return multiple elements.BZPOPMIN
or BZPOPMAX
which take multiple keys, but return only one element from just one key.See BZMPOP
for the blocking variant of this command.
When the MIN
modifier is used, the elements popped are those with the lowest scores from the first non-empty sorted set. The MAX
modifier causes elements with the highest scores to be popped.
The optional COUNT
can be used to specify the number of elements to pop, and is set to 1 by default.
The number of popped elements is the minimum from the sorted set's cardinality and COUNT
's value.
Array reply: specifically:
nil
when no element could be popped.