Available since: 5.0.0
Time complexity: O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.
Removes and returns up to
count members with the highest scores in the sorted
set stored at
When left unspecified, the default value for
count is 1. Specifying a
value that is higher than the sorted set's cardinality will not produce an
error. When returning multiple elements, the one with the highest score will
be the first, followed by the elements with lower scores.
Array reply: list of popped elements and scores.