Scores are 64-bit floats. Members are unique within a sorted set; adding an existing member does not create a duplicate — it updates that member’s score instead.
ZADD
Adds one or more members to the sorted set stored atkey, each with an associated score. If a member already exists its score is updated. If key does not exist, a new sorted set is created.
Syntax: ZADD key score member [score member ...]
ZREM
Removes one or more members from the sorted set stored atkey. Members that are not present are silently ignored.
Syntax: ZREM key member [member ...]
ZSCORE
Returns the score ofmember in the sorted set stored at key, as a bulk string.
Syntax: ZSCORE key member
ZCARD
Returns the number of members in the sorted set stored atkey.
Syntax: ZCARD key
0 if the key does not exist.
ZRANGE
Returns members of the sorted set stored atkey, ordered ascending by score. Indices are zero-based; negative indices count from the end (-1 is the highest-scored member). Optionally interleaves each member with its score when WITHSCORES is specified.
Syntax: ZRANGE key start stop [WITHSCORES]
WITHSCORES, the array is twice as long, alternating member and score strings.
ZRANGEBYSCORE
Returns all members of the sorted set stored atkey whose score falls between min and max (both inclusive). Use -inf and +inf for unbounded ranges. Optionally includes scores with WITHSCORES.
Syntax: ZRANGEBYSCORE key min max [WITHSCORES]
WITHSCORES, scores are interleaved after each member name.