Available since: 1.2.0
Time complexity: O(log(N)) where N is the number of elements in the sorted set.
Increments the score of
member in the sorted set stored at
member does not exist in the sorted set, it is added with
its score (as if its previous score was
key does not exist, a new sorted set with the specified
member as its
sole member is created.
An error is returned when
key exists but does not hold a sorted set.
score value should be the string representation of a numeric value, and
accepts double precision floating point numbers.
It is possible to provide a negative value to decrement the score.
Bulk string reply: the new score of
member (a double precision floating point
number), represented as string.