Available since: 1.2.0
Time complexity: O(M*log(N)) with N being the number of elements in the sorted set and M the number of elements to be removed.
Removes the specified members from the sorted set stored at
Non existing members are ignored.
An error is returned when
key exists and does not hold a sorted set.
Integer reply, specifically: