ZINCRBY
ZINCRBY key increment member
- Available since:
- 1.2.0
- Time complexity:
- O(log(N)) where N is the number of elements in the sorted set.
- ACL categories:
-
@write
,@sortedset
,@fast
,
Increments the score of member
in the sorted set stored at key
by
increment
.
If member
does not exist in the sorted set, it is added with increment
as
its score (as if its previous score was 0.0
).
If 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.
The 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.