"summary":"Pop an element from a list, push it to another list and return it; or block until one is available",
"summary":"Pops an element from a list, pushes it to another list and returns it. Block until an element is available otherwise. Deletes the list if the last element was popped.",
"summary":"Remove and return members with scores in a sorted set or block until one is available",
"summary":"Removes and returns a member by score from one or more sorted sets. Blocks until a member is available otherwise. Deletes the sorted set if the last element was popped.",
"complexity":"O(K) + O(M*log(N)) 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.",
"complexity":"O(K) + O(M*log(N)) 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.",
"summary":"Remove and return the member with the highest score from one or more sorted sets, or block until one is available",
"summary":"Removes and returns the member with the highest score from one or more sorted sets. Blocks until a member available otherwise. Deletes the sorted set if the last element was popped.",
"complexity":"O(log(N)) with N being the number of elements in the sorted set.",
"complexity":"O(log(N)) with N being the number of elements in the sorted set.",
"summary":"Remove and return the member with the lowest score from one or more sorted sets, or block until one is available",
"summary":"Removes and returns the member with the lowest score from one or more sorted sets. Blocks until a member is available otherwise. Deletes the sorted set if the last element was popped.",
"complexity":"O(log(N)) with N being the number of elements in the sorted set.",
"complexity":"O(log(N)) with N being the number of elements in the sorted set.",