Struct td_rredis::Connection
[−]
[src]
pub struct Connection { /* fields omitted */ }
Represents a stateful redis TCP connection.
Methods
impl Connection
[src]
fn new(addr: &ConnectionInfo) -> RedisResult<BufReader<TcpStream>>
fn send_bytes(&self, bytes: &[u8]) -> RedisResult<Value>
fn read_response(&self) -> RedisResult<Value>
fn get_connection_fd(&self) -> i32
fn is_work(&self) -> bool
fn try_clone(&self) -> RedisResult<Connection>
Trait Implementations
impl Debug for Connection
[src]
impl Commands for Connection
[src]
fn get<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Get the value of a key. If key is a vec this becomes an MGET
.
fn set<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V)
-> RedisResult<RV>
key: K,
value: V)
-> RedisResult<RV>
Set the string value of a key.
fn set_multiple<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
items: &[(K, V)])
-> RedisResult<RV>
items: &[(K, V)])
-> RedisResult<RV>
Sets multiple keys to their values.
fn set_ex<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V,
seconds: usize)
-> RedisResult<RV>
key: K,
value: V,
seconds: usize)
-> RedisResult<RV>
Set the value and expiration of a key.
fn set_nx<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V)
-> RedisResult<RV>
key: K,
value: V)
-> RedisResult<RV>
Set the value of a key, only if the key does not exist
fn mset_nx<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
items: &[(K, V)])
-> RedisResult<RV>
items: &[(K, V)])
-> RedisResult<RV>
Sets multiple keys to their values failing if at least one already exists.
fn getset<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V)
-> RedisResult<RV>
key: K,
value: V)
-> RedisResult<RV>
Set the string value of a key and return its old value.
fn del<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Delete one or more keys.
fn exists<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Determine if a key exists.
fn expire<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
seconds: usize)
-> RedisResult<RV>
key: K,
seconds: usize)
-> RedisResult<RV>
Set a key's time to live in seconds.
fn expire_at<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
ts: usize)
-> RedisResult<RV>
key: K,
ts: usize)
-> RedisResult<RV>
Set the expiration for a key as a UNIX timestamp.
fn pexpire<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
ms: usize)
-> RedisResult<RV>
key: K,
ms: usize)
-> RedisResult<RV>
Set a key's time to live in milliseconds.
fn pexpire_at<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
ts: usize)
-> RedisResult<RV>
key: K,
ts: usize)
-> RedisResult<RV>
Set the expiration for a key as a UNIX timestamp in milliseconds.
fn persist<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Remove the expiration from a key.
fn rename<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
new_key: K)
-> RedisResult<RV>
key: K,
new_key: K)
-> RedisResult<RV>
Rename a key.
fn rename_nx<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
new_key: K)
-> RedisResult<RV>
key: K,
new_key: K)
-> RedisResult<RV>
Rename a key, only if the new key does not exist.
fn append<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V)
-> RedisResult<RV>
key: K,
value: V)
-> RedisResult<RV>
Append a value to a key.
fn incr<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
delta: V)
-> RedisResult<RV>
key: K,
delta: V)
-> RedisResult<RV>
Increment the numeric value of a key by the given amount. This issues a INCRBY
or INCRBYFLOAT
depending on the type. Read more
fn setbit<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
offset: usize,
value: bool)
-> RedisResult<RV>
key: K,
offset: usize,
value: bool)
-> RedisResult<RV>
Sets or clears the bit at offset in the string value stored at key.
fn getbit<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
offset: usize)
-> RedisResult<RV>
key: K,
offset: usize)
-> RedisResult<RV>
Returns the bit value at offset in the string value stored at key.
fn bitcount<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K)
-> RedisResult<RV>
key: K)
-> RedisResult<RV>
Count set bits in a string.
fn bitcount_range<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
start: usize,
end: usize)
-> RedisResult<RV>
key: K,
start: usize,
end: usize)
-> RedisResult<RV>
Count set bits in a string in a range.
fn bit_and<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
srckeys: K)
-> RedisResult<RV>
dstkey: K,
srckeys: K)
-> RedisResult<RV>
Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Read more
fn bit_or<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
srckeys: K)
-> RedisResult<RV>
dstkey: K,
srckeys: K)
-> RedisResult<RV>
Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Read more
fn bit_xor<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
srckeys: K)
-> RedisResult<RV>
dstkey: K,
srckeys: K)
-> RedisResult<RV>
Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Read more
fn bit_not<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
srckey: K)
-> RedisResult<RV>
dstkey: K,
srckey: K)
-> RedisResult<RV>
Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Read more
fn strlen<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Get the length of the value stored in a key.
fn hget<K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
field: F)
-> RedisResult<RV>
key: K,
field: F)
-> RedisResult<RV>
Gets a single (or multiple) fields from a hash.
fn hdel<K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
field: F)
-> RedisResult<RV>
key: K,
field: F)
-> RedisResult<RV>
Deletes a single (or multiple) fields from a hash.
fn hset<K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
field: F,
value: V)
-> RedisResult<RV>
key: K,
field: F,
value: V)
-> RedisResult<RV>
Sets a single field in a hash.
fn hset_nx<K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
field: F,
value: V)
-> RedisResult<RV>
key: K,
field: F,
value: V)
-> RedisResult<RV>
Sets a single field in a hash if it does not exist.
fn hset_multiple<K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
items: &[(F, V)])
-> RedisResult<RV>
key: K,
items: &[(F, V)])
-> RedisResult<RV>
Sets a multiple fields in a hash.
fn hincr<K: ToRedisArgs, F: ToRedisArgs, D: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
field: F,
delta: D)
-> RedisResult<RV>
key: K,
field: F,
delta: D)
-> RedisResult<RV>
Increments a value.
fn hexists<K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
field: F)
-> RedisResult<RV>
key: K,
field: F)
-> RedisResult<RV>
Checks if a field in a hash exists.
fn hkeys<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Gets all the keys in a hash.
fn hvals<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Gets all the values in a hash.
fn hgetall<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Gets all the fields and values in a hash.
fn hlen<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Gets the length of a hash.
fn blpop<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
timeout: usize)
-> RedisResult<RV>
key: K,
timeout: usize)
-> RedisResult<RV>
Remove and get the first element in a list, or block until one is available.
fn brpop<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
timeout: usize)
-> RedisResult<RV>
key: K,
timeout: usize)
-> RedisResult<RV>
Remove and get the last element in a list, or block until one is available.
fn brpoplpush<K: ToRedisArgs, RV: FromRedisValue>(&self,
srckey: K,
dstkey: K,
timeout: usize)
-> RedisResult<RV>
srckey: K,
dstkey: K,
timeout: usize)
-> RedisResult<RV>
Pop a value from a list, push it to another list and return it; or block until one is available. Read more
fn lindex<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
index: isize)
-> RedisResult<RV>
key: K,
index: isize)
-> RedisResult<RV>
Get an element from a list by its index.
fn linsert_before<K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
pivot: P,
value: V)
-> RedisResult<RV>
key: K,
pivot: P,
value: V)
-> RedisResult<RV>
Insert an element before another element in a list.
fn linsert_after<K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
pivot: P,
value: V)
-> RedisResult<RV>
key: K,
pivot: P,
value: V)
-> RedisResult<RV>
Insert an element after another element in a list.
fn llen<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Returns the length of the list stored at key.
fn lpop<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Removes and returns the first element of the list stored at key.
fn lpush<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V)
-> RedisResult<RV>
key: K,
value: V)
-> RedisResult<RV>
Insert all the specified values at the head of the list stored at key.
fn lpush_exists<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V)
-> RedisResult<RV>
key: K,
value: V)
-> RedisResult<RV>
Inserts a value at the head of the list stored at key, only if key already exists and holds a list. Read more
fn lrange<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
Returns the specified elements of the list stored at key.
fn lrem<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
count: isize,
value: V)
-> RedisResult<RV>
key: K,
count: isize,
value: V)
-> RedisResult<RV>
Removes the first count occurrences of elements equal to value from the list stored at key. Read more
fn ltrim<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
Trim an existing list so that it will contain only the specified range of elements specified. Read more
fn rpop<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Removes and returns the last element of the list stored at key.
fn rpoplpush<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
dstkey: K)
-> RedisResult<RV>
key: K,
dstkey: K)
-> RedisResult<RV>
Pop a value from a list, push it to another list and return it.
fn rpush<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V)
-> RedisResult<RV>
key: K,
value: V)
-> RedisResult<RV>
Insert all the specified values at the tail of the list stored at key.
fn rpush_exists<K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
value: V)
-> RedisResult<RV>
key: K,
value: V)
-> RedisResult<RV>
Inserts value at the tail of the list stored at key, only if key already exists and holds a list. Read more
fn sadd<K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
member: M)
-> RedisResult<RV>
key: K,
member: M)
-> RedisResult<RV>
Add one or more members to a set.
fn scard<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Get the number of members in a set.
fn sdiff<K: ToRedisArgs, RV: FromRedisValue>(&self, keys: K) -> RedisResult<RV>
Subtract multiple sets.
fn sdiffstore<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: K)
-> RedisResult<RV>
dstkey: K,
keys: K)
-> RedisResult<RV>
Subtract multiple sets and store the resulting set in a key.
fn sinter<K: ToRedisArgs, RV: FromRedisValue>(&self, keys: K) -> RedisResult<RV>
Intersect multiple sets.
fn sdinterstore<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: K)
-> RedisResult<RV>
dstkey: K,
keys: K)
-> RedisResult<RV>
Intersect multiple sets and store the resulting set in a key.
fn sismember<K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
member: M)
-> RedisResult<RV>
key: K,
member: M)
-> RedisResult<RV>
Determine if a given value is a member of a set.
fn smembers<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K)
-> RedisResult<RV>
key: K)
-> RedisResult<RV>
Get all the members in a set.
fn smove<K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
srckey: K,
dstkey: K,
member: M)
-> RedisResult<RV>
srckey: K,
dstkey: K,
member: M)
-> RedisResult<RV>
Move a member from one set to another.
fn spop<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Remove and return a random member from a set.
fn srandmember<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K)
-> RedisResult<RV>
key: K)
-> RedisResult<RV>
Get one random member from a set.
fn srandmember_multiple<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
count: usize)
-> RedisResult<RV>
key: K,
count: usize)
-> RedisResult<RV>
Get multiple random members from a set.
fn srem<K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
member: M)
-> RedisResult<RV>
key: K,
member: M)
-> RedisResult<RV>
Remove one or more members from a set.
fn sunion<K: ToRedisArgs, RV: FromRedisValue>(&self, keys: K) -> RedisResult<RV>
Add multiple sets.
fn sunionstore<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: K)
-> RedisResult<RV>
dstkey: K,
keys: K)
-> RedisResult<RV>
Add multiple sets and store the resulting set in a key.
fn zadd<K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
member: M,
score: S)
-> RedisResult<RV>
key: K,
member: M,
score: S)
-> RedisResult<RV>
Add one member to a sorted set, or update its score if it already exists.
fn zadd_multiple<K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
items: &[(S, M)])
-> RedisResult<RV>
key: K,
items: &[(S, M)])
-> RedisResult<RV>
Add multiple members to a sorted set, or update its score if it already exists.
fn zcard<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Get the number of members in a sorted set.
fn zcount<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM)
-> RedisResult<RV>
key: K,
min: M,
max: MM)
-> RedisResult<RV>
Count the members in a sorted set with scores within the given values.
fn zincr<K: ToRedisArgs, M: ToRedisArgs, D: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
member: M,
delta: D)
-> RedisResult<RV>
key: K,
member: M,
delta: D)
-> RedisResult<RV>
Increments the member in a sorted set at key by delta. If the member does not exist, it is added with delta as its score. Read more
fn zinterstore<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: &[K])
-> RedisResult<RV>
dstkey: K,
keys: &[K])
-> RedisResult<RV>
Intersect multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more
fn zinterstore_min<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: &[K])
-> RedisResult<RV>
dstkey: K,
keys: &[K])
-> RedisResult<RV>
Intersect multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more
fn zinterstore_max<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: &[K])
-> RedisResult<RV>
dstkey: K,
keys: &[K])
-> RedisResult<RV>
Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more
fn zlexcount<K: ToRedisArgs, L: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: L,
max: L)
-> RedisResult<RV>
key: K,
min: L,
max: L)
-> RedisResult<RV>
Count the number of members in a sorted set between a given lexicographical range.
fn zrange<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by index
fn zrange_withscores<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by index with scores.
fn zrangebylex<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM)
-> RedisResult<RV>
key: K,
min: M,
max: MM)
-> RedisResult<RV>
Return a range of members in a sorted set, by lexicographical range.
fn zrangebylex_limit<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> RedisResult<RV>
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more
fn zrevrangebylex<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
max: MM,
min: M)
-> RedisResult<RV>
key: K,
max: MM,
min: M)
-> RedisResult<RV>
Return a range of members in a sorted set, by lexicographical range.
fn zrevrangebylex_limit<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> RedisResult<RV>
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more
fn zrangebyscore<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM)
-> RedisResult<RV>
key: K,
min: M,
max: MM)
-> RedisResult<RV>
Return a range of members in a sorted set, by score.
fn zrangebyscore_withscores<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM)
-> RedisResult<RV>
key: K,
min: M,
max: MM)
-> RedisResult<RV>
Return a range of members in a sorted set, by score with scores.
fn zrangebyscore_limit<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> RedisResult<RV>
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by score with limit.
fn zrangebyscore_limit_withscores<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> RedisResult<RV>
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by score with limit with scores.
fn zrank<K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
member: M)
-> RedisResult<RV>
key: K,
member: M)
-> RedisResult<RV>
Determine the index of a member in a sorted set.
fn zrem<K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
members: M)
-> RedisResult<RV>
key: K,
members: M)
-> RedisResult<RV>
Remove one or more members from a sorted set.
fn zrembylex<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM)
-> RedisResult<RV>
key: K,
min: M,
max: MM)
-> RedisResult<RV>
Remove all members in a sorted set between the given lexicographical range.
fn zrembyrank<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
Remove all members in a sorted set within the given indexes.
fn zrembyscore<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
min: M,
max: MM)
-> RedisResult<RV>
key: K,
min: M,
max: MM)
-> RedisResult<RV>
Remove all members in a sorted set within the given scores.
fn zrevrange<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more
fn zrevrange_withscores<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
key: K,
start: isize,
stop: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more
fn zrevrangebyscore<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
max: MM,
min: M)
-> RedisResult<RV>
key: K,
max: MM,
min: M)
-> RedisResult<RV>
Return a range of members in a sorted set, by score.
fn zrevrangebyscore_withscores<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
max: MM,
min: M)
-> RedisResult<RV>
key: K,
max: MM,
min: M)
-> RedisResult<RV>
Return a range of members in a sorted set, by score with scores.
fn zrevrangebyscore_limit<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> RedisResult<RV>
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by score with limit.
fn zrevrangebyscore_limit_withscores<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> RedisResult<RV>
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> RedisResult<RV>
Return a range of members in a sorted set, by score with limit with scores.
fn zrevrank<K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
member: M)
-> RedisResult<RV>
key: K,
member: M)
-> RedisResult<RV>
Determine the index of a member in a sorted set, with scores ordered from high to low.
fn zscore<K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
member: M)
-> RedisResult<RV>
key: K,
member: M)
-> RedisResult<RV>
Get the score associated with the given member in a sorted set.
fn zunionstore<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: &[K])
-> RedisResult<RV>
dstkey: K,
keys: &[K])
-> RedisResult<RV>
Unions multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more
fn zunionstore_min<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: &[K])
-> RedisResult<RV>
dstkey: K,
keys: &[K])
-> RedisResult<RV>
Unions multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more
fn zunionstore_max<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
keys: &[K])
-> RedisResult<RV>
dstkey: K,
keys: &[K])
-> RedisResult<RV>
Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more
fn pfadd<K: ToRedisArgs, E: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
element: E)
-> RedisResult<RV>
key: K,
element: E)
-> RedisResult<RV>
Adds the specified elements to the specified HyperLogLog.
fn pfcount<K: ToRedisArgs, RV: FromRedisValue>(&self, key: K) -> RedisResult<RV>
Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s). Read more
fn pfmerge<K: ToRedisArgs, RV: FromRedisValue>(&self,
dstkey: K,
srckeys: K)
-> RedisResult<RV>
dstkey: K,
srckeys: K)
-> RedisResult<RV>
Merge N different HyperLogLogs into a single one.
fn scan<RV: FromRedisValue>(&self) -> RedisResult<Iter<RV>>
Incrementally iterate the keys space.
fn scan_match<P: ToRedisArgs, RV: FromRedisValue>(&self,
pattern: P)
-> RedisResult<Iter<RV>>
pattern: P)
-> RedisResult<Iter<RV>>
Incrementally iterate the keys space for keys matching a pattern.
fn hscan<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K)
-> RedisResult<Iter<RV>>
key: K)
-> RedisResult<Iter<RV>>
Incrementally iterate hash fields and associated values.
fn hscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
pattern: P)
-> RedisResult<Iter<RV>>
key: K,
pattern: P)
-> RedisResult<Iter<RV>>
Incrementally iterate hash fields and associated values for field names matching a pattern. Read more
fn sscan<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K)
-> RedisResult<Iter<RV>>
key: K)
-> RedisResult<Iter<RV>>
Incrementally iterate set elements.
fn sscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
pattern: P)
-> RedisResult<Iter<RV>>
key: K,
pattern: P)
-> RedisResult<Iter<RV>>
Incrementally iterate set elements for elements matching a pattern.
fn zscan<K: ToRedisArgs, RV: FromRedisValue>(&self,
key: K)
-> RedisResult<Iter<RV>>
key: K)
-> RedisResult<Iter<RV>>
Incrementally iterate sorted set elements.
fn zscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>(&self,
key: K,
pattern: P)
-> RedisResult<Iter<RV>>
key: K,
pattern: P)
-> RedisResult<Iter<RV>>
Incrementally iterate sorted set elements for elements matching a pattern.