Struct td_rredis::Pipeline
[−]
[src]
pub struct Pipeline { /* fields omitted */ }
Represents a redis command pipeline.
Methods
impl Pipeline
[src]
A pipeline allows you to send multiple commands in one go to the redis server. API wise it's very similar to just using a command but it allows multiple commands to be chained and some features such as iteration are not available.
Basic example:
let ((k1, k2),) : ((i32, i32),) = td_rredis::pipe() .cmd("SET").arg("key_1").arg(42).ignore() .cmd("SET").arg("key_2").arg(43).ignore() .cmd("MGET").arg(&["key_1", "key_2"]).query(&con).unwrap();
As you can see with cmd
you can start a new command. By default
each command produces a value but for some you can ignore them by
calling ignore
on the command. That way it will be skipped in the
return value which is useful for SET
commands and others, which
do not have a useful return value.
fn new() -> Pipeline
Creates an empty pipeline. For consistency with the cmd
api a pipe
function is provided as alias.
fn cmd(&mut self, name: &str) -> &mut Pipeline
Starts a new command. Functions such as arg
then become
available to add more arguments to that command.
fn add_command(&mut self, cmd: &Cmd) -> &mut Pipeline
Adds a command to the pipeline.
fn arg<T: ToRedisArgs>(&mut self, arg: T) -> &mut Pipeline
Adds an argument to the last started command. This works similar
to the arg
method of the Cmd
object.
Note that this function fails the task if executed on an empty pipeline.
fn ignore(&mut self) -> &mut Pipeline
Instructs the pipeline to ignore the return value of this command. It will still be ensured that it is not an error, but any successful result is just thrown away. This makes result processing through tuples much easier because you do not need to handle all the items you do not care about.
Note that this function fails the task if executed on an empty pipeline.
fn atomic(&mut self) -> &mut Pipeline
This enables atomic mode. In atomic mode the whole pipeline is
enclosed in MULTI
/EXEC
. From the user's point of view nothing
changes however. This is easier than using MULTI
/EXEC
yourself
as the format does not change.
let (k1, k2) : (i32, i32) = td_rredis::pipe() .atomic() .cmd("GET").arg("key_1") .cmd("GET").arg("key_2").query(&con).unwrap();
fn query<T: FromRedisValue>(&self, con: &ConnectionLike) -> RedisResult<T>
Executes the pipeline and fetches the return values. Since most pipelines return different types it's recommended to use tuple matching to process the results:
let (k1, k2) : (i32, i32) = td_rredis::pipe() .cmd("SET").arg("key_1").arg(42).ignore() .cmd("SET").arg("key_2").arg(43).ignore() .cmd("GET").arg("key_1") .cmd("GET").arg("key_2").query(&con).unwrap();
fn query_cluster<T: FromRedisValue>(&self,
cluster: &mut Cluster)
-> RedisResult<T>
cluster: &mut Cluster)
-> RedisResult<T>
fn execute(&self, con: &ConnectionLike)
This is a shortcut to query()
that does not return a value and
will fail the task if the query of the pipeline fails.
This is equivalent to a call of query like this:
let _ : () = td_rredis::pipe().cmd("PING").query(&con).unwrap();
fn get_slot(&self) -> u16
Trait Implementations
impl PipelineCommands for Pipeline
[src]
fn perform(&mut self, cmd: &Cmd) -> &mut Pipeline
fn get<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Get the value of a key. If key is a vec this becomes an MGET
.
fn set<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V)
-> &mut Self
key: K,
value: V)
-> &mut Self
Set the string value of a key.
fn set_multiple<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
items: &[(K, V)])
-> &mut Self
items: &[(K, V)])
-> &mut Self
Sets multiple keys to their values.
fn set_ex<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V,
seconds: usize)
-> &mut Self
key: K,
value: V,
seconds: usize)
-> &mut Self
Set the value and expiration of a key.
fn set_nx<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V)
-> &mut Self
key: K,
value: V)
-> &mut Self
Set the value of a key, only if the key does not exist
fn mset_nx<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
items: &[(K, V)])
-> &mut Self
items: &[(K, V)])
-> &mut Self
Sets multiple keys to their values failing if at least one already exists.
fn getset<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V)
-> &mut Self
key: K,
value: V)
-> &mut Self
Set the string value of a key and return its old value.
fn del<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Delete one or more keys.
fn exists<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Determine if a key exists.
fn expire<'a, K: ToRedisArgs>(&mut self, key: K, seconds: usize) -> &mut Self
Set a key's time to live in seconds.
fn expire_at<'a, K: ToRedisArgs>(&mut self, key: K, ts: usize) -> &mut Self
Set the expiration for a key as a UNIX timestamp.
fn pexpire<'a, K: ToRedisArgs>(&mut self, key: K, ms: usize) -> &mut Self
Set a key's time to live in milliseconds.
fn pexpire_at<'a, K: ToRedisArgs>(&mut self, key: K, ts: usize) -> &mut Self
Set the expiration for a key as a UNIX timestamp in milliseconds.
fn persist<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Remove the expiration from a key.
fn rename<'a, K: ToRedisArgs>(&mut self, key: K, new_key: K) -> &mut Self
Rename a key.
fn rename_nx<'a, K: ToRedisArgs>(&mut self, key: K, new_key: K) -> &mut Self
Rename a key, only if the new key does not exist.
fn append<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V)
-> &mut Self
key: K,
value: V)
-> &mut Self
Append a value to a key.
fn incr<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
delta: V)
-> &mut Self
key: K,
delta: V)
-> &mut Self
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<'a, K: ToRedisArgs>(&mut self,
key: K,
offset: usize,
value: bool)
-> &mut Self
key: K,
offset: usize,
value: bool)
-> &mut Self
Sets or clears the bit at offset in the string value stored at key.
fn getbit<'a, K: ToRedisArgs>(&mut self, key: K, offset: usize) -> &mut Self
Returns the bit value at offset in the string value stored at key.
fn bitcount<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Count set bits in a string.
fn bitcount_range<'a, K: ToRedisArgs>(&mut self,
key: K,
start: usize,
end: usize)
-> &mut Self
key: K,
start: usize,
end: usize)
-> &mut Self
Count set bits in a string in a range.
fn bit_and<'a, K: ToRedisArgs>(&mut self, dstkey: K, srckeys: K) -> &mut Self
Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Read more
fn bit_or<'a, K: ToRedisArgs>(&mut self, dstkey: K, srckeys: K) -> &mut Self
Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Read more
fn bit_xor<'a, K: ToRedisArgs>(&mut self, dstkey: K, srckeys: K) -> &mut Self
Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Read more
fn bit_not<'a, K: ToRedisArgs>(&mut self, dstkey: K, srckey: K) -> &mut Self
Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Read more
fn strlen<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Get the length of the value stored in a key.
fn hget<'a, K: ToRedisArgs, F: ToRedisArgs>(&mut self,
key: K,
field: F)
-> &mut Self
key: K,
field: F)
-> &mut Self
Gets a single (or multiple) fields from a hash.
fn hdel<'a, K: ToRedisArgs, F: ToRedisArgs>(&mut self,
key: K,
field: F)
-> &mut Self
key: K,
field: F)
-> &mut Self
Deletes a single (or multiple) fields from a hash.
fn hset<'a, K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
field: F,
value: V)
-> &mut Self
key: K,
field: F,
value: V)
-> &mut Self
Sets a single field in a hash.
fn hset_nx<'a, K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
field: F,
value: V)
-> &mut Self
key: K,
field: F,
value: V)
-> &mut Self
Sets a single field in a hash if it does not exist.
fn hset_multiple<'a, K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
items: &[(F, V)])
-> &mut Self
key: K,
items: &[(F, V)])
-> &mut Self
Sets a multiple fields in a hash.
fn hincr<'a, K: ToRedisArgs, F: ToRedisArgs, D: ToRedisArgs>(&mut self,
key: K,
field: F,
delta: D)
-> &mut Self
key: K,
field: F,
delta: D)
-> &mut Self
Increments a value.
fn hexists<'a, K: ToRedisArgs, F: ToRedisArgs>(&mut self,
key: K,
field: F)
-> &mut Self
key: K,
field: F)
-> &mut Self
Checks if a field in a hash exists.
fn hkeys<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Gets all the keys in a hash.
fn hvals<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Gets all the values in a hash.
fn hgetall<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Gets all the fields and values in a hash.
fn hlen<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Gets the length of a hash.
fn blpop<'a, K: ToRedisArgs>(&mut self, key: K, timeout: usize) -> &mut Self
Remove and get the first element in a list, or block until one is available.
fn brpop<'a, K: ToRedisArgs>(&mut self, key: K, timeout: usize) -> &mut Self
Remove and get the last element in a list, or block until one is available.
fn brpoplpush<'a, K: ToRedisArgs>(&mut self,
srckey: K,
dstkey: K,
timeout: usize)
-> &mut Self
srckey: K,
dstkey: K,
timeout: usize)
-> &mut Self
Pop a value from a list, push it to another list and return it; or block until one is available. Read more
fn lindex<'a, K: ToRedisArgs>(&mut self, key: K, index: isize) -> &mut Self
Get an element from a list by its index.
fn linsert_before<'a, K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
pivot: P,
value: V)
-> &mut Self
key: K,
pivot: P,
value: V)
-> &mut Self
Insert an element before another element in a list.
fn linsert_after<'a, K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
pivot: P,
value: V)
-> &mut Self
key: K,
pivot: P,
value: V)
-> &mut Self
Insert an element after another element in a list.
fn llen<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Returns the length of the list stored at key.
fn lpop<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Removes and returns the first element of the list stored at key.
fn lpush<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V)
-> &mut Self
key: K,
value: V)
-> &mut Self
Insert all the specified values at the head of the list stored at key.
fn lpush_exists<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V)
-> &mut Self
key: K,
value: V)
-> &mut Self
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<'a, K: ToRedisArgs>(&mut self,
key: K,
start: isize,
stop: isize)
-> &mut Self
key: K,
start: isize,
stop: isize)
-> &mut Self
Returns the specified elements of the list stored at key.
fn lrem<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
count: isize,
value: V)
-> &mut Self
key: K,
count: isize,
value: V)
-> &mut Self
Removes the first count occurrences of elements equal to value from the list stored at key. Read more
fn ltrim<'a, K: ToRedisArgs>(&mut self,
key: K,
start: isize,
stop: isize)
-> &mut Self
key: K,
start: isize,
stop: isize)
-> &mut Self
Trim an existing list so that it will contain only the specified range of elements specified. Read more
fn rpop<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Removes and returns the last element of the list stored at key.
fn rpoplpush<'a, K: ToRedisArgs>(&mut self, key: K, dstkey: K) -> &mut Self
Pop a value from a list, push it to another list and return it.
fn rpush<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V)
-> &mut Self
key: K,
value: V)
-> &mut Self
Insert all the specified values at the tail of the list stored at key.
fn rpush_exists<'a, K: ToRedisArgs, V: ToRedisArgs>(&mut self,
key: K,
value: V)
-> &mut Self
key: K,
value: V)
-> &mut Self
Inserts value at the tail of the list stored at key, only if key already exists and holds a list. Read more
fn sadd<'a, K: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
member: M)
-> &mut Self
key: K,
member: M)
-> &mut Self
Add one or more members to a set.
fn scard<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Get the number of members in a set.
fn sdiff<'a, K: ToRedisArgs>(&mut self, keys: K) -> &mut Self
Subtract multiple sets.
fn sdiffstore<'a, K: ToRedisArgs>(&mut self, dstkey: K, keys: K) -> &mut Self
Subtract multiple sets and store the resulting set in a key.
fn sinter<'a, K: ToRedisArgs>(&mut self, keys: K) -> &mut Self
Intersect multiple sets.
fn sdinterstore<'a, K: ToRedisArgs>(&mut self, dstkey: K, keys: K) -> &mut Self
Intersect multiple sets and store the resulting set in a key.
fn sismember<'a, K: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
member: M)
-> &mut Self
key: K,
member: M)
-> &mut Self
Determine if a given value is a member of a set.
fn smembers<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Get all the members in a set.
fn smove<'a, K: ToRedisArgs, M: ToRedisArgs>(&mut self,
srckey: K,
dstkey: K,
member: M)
-> &mut Self
srckey: K,
dstkey: K,
member: M)
-> &mut Self
Move a member from one set to another.
fn spop<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Remove and return a random member from a set.
fn srandmember<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Get one random member from a set.
fn srandmember_multiple<'a, K: ToRedisArgs>(&mut self,
key: K,
count: usize)
-> &mut Self
key: K,
count: usize)
-> &mut Self
Get multiple random members from a set.
fn srem<'a, K: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
member: M)
-> &mut Self
key: K,
member: M)
-> &mut Self
Remove one or more members from a set.
fn sunion<'a, K: ToRedisArgs>(&mut self, keys: K) -> &mut Self
Add multiple sets.
fn sunionstore<'a, K: ToRedisArgs>(&mut self, dstkey: K, keys: K) -> &mut Self
Add multiple sets and store the resulting set in a key.
fn zadd<'a, K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
member: M,
score: S)
-> &mut Self
key: K,
member: M,
score: S)
-> &mut Self
Add one member to a sorted set, or update its score if it already exists.
fn zadd_multiple<'a, K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
items: &[(S, M)])
-> &mut Self
key: K,
items: &[(S, M)])
-> &mut Self
Add multiple members to a sorted set, or update its score if it already exists.
fn zcard<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Get the number of members in a sorted set.
fn zcount<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM)
-> &mut Self
key: K,
min: M,
max: MM)
-> &mut Self
Count the members in a sorted set with scores within the given values.
fn zincr<'a, K: ToRedisArgs, M: ToRedisArgs, D: ToRedisArgs>(&mut self,
key: K,
member: M,
delta: D)
-> &mut Self
key: K,
member: M,
delta: D)
-> &mut Self
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<'a, K: ToRedisArgs>(&mut self,
dstkey: K,
keys: &[K])
-> &mut Self
dstkey: K,
keys: &[K])
-> &mut Self
Intersect multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more
fn zinterstore_min<'a, K: ToRedisArgs>(&mut self,
dstkey: K,
keys: &[K])
-> &mut Self
dstkey: K,
keys: &[K])
-> &mut Self
Intersect multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more
fn zinterstore_max<'a, K: ToRedisArgs>(&mut self,
dstkey: K,
keys: &[K])
-> &mut Self
dstkey: K,
keys: &[K])
-> &mut Self
Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more
fn zlexcount<'a, K: ToRedisArgs, L: ToRedisArgs>(&mut self,
key: K,
min: L,
max: L)
-> &mut Self
key: K,
min: L,
max: L)
-> &mut Self
Count the number of members in a sorted set between a given lexicographical range.
fn zrange<'a, K: ToRedisArgs>(&mut self,
key: K,
start: isize,
stop: isize)
-> &mut Self
key: K,
start: isize,
stop: isize)
-> &mut Self
Return a range of members in a sorted set, by index
fn zrange_withscores<'a, K: ToRedisArgs>(&mut self,
key: K,
start: isize,
stop: isize)
-> &mut Self
key: K,
start: isize,
stop: isize)
-> &mut Self
Return a range of members in a sorted set, by index with scores.
fn zrangebylex<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM)
-> &mut Self
key: K,
min: M,
max: MM)
-> &mut Self
Return a range of members in a sorted set, by lexicographical range.
fn zrangebylex_limit<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> &mut Self
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> &mut Self
Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more
fn zrevrangebylex<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
max: MM,
min: M)
-> &mut Self
key: K,
max: MM,
min: M)
-> &mut Self
Return a range of members in a sorted set, by lexicographical range.
fn zrevrangebylex_limit<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> &mut Self
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> &mut Self
Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more
fn zrangebyscore<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM)
-> &mut Self
key: K,
min: M,
max: MM)
-> &mut Self
Return a range of members in a sorted set, by score.
fn zrangebyscore_withscores<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM)
-> &mut Self
key: K,
min: M,
max: MM)
-> &mut Self
Return a range of members in a sorted set, by score with scores.
fn zrangebyscore_limit<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> &mut Self
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> &mut Self
Return a range of members in a sorted set, by score with limit.
fn zrangebyscore_limit_withscores<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> &mut Self
key: K,
min: M,
max: MM,
offset: isize,
count: isize)
-> &mut Self
Return a range of members in a sorted set, by score with limit with scores.
fn zrank<'a, K: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
member: M)
-> &mut Self
key: K,
member: M)
-> &mut Self
Determine the index of a member in a sorted set.
fn zrem<'a, K: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
members: M)
-> &mut Self
key: K,
members: M)
-> &mut Self
Remove one or more members from a sorted set.
fn zrembylex<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM)
-> &mut Self
key: K,
min: M,
max: MM)
-> &mut Self
Remove all members in a sorted set between the given lexicographical range.
fn zrembyrank<'a, K: ToRedisArgs>(&mut self,
key: K,
start: isize,
stop: isize)
-> &mut Self
key: K,
start: isize,
stop: isize)
-> &mut Self
Remove all members in a sorted set within the given indexes.
fn zrembyscore<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(&mut self,
key: K,
min: M,
max: MM)
-> &mut Self
key: K,
min: M,
max: MM)
-> &mut Self
Remove all members in a sorted set within the given scores.
fn zrevrange<'a, K: ToRedisArgs>(&mut self,
key: K,
start: isize,
stop: isize)
-> &mut Self
key: K,
start: isize,
stop: isize)
-> &mut Self
Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more
fn zrevrange_withscores<'a, K: ToRedisArgs>(&mut self,
key: K,
start: isize,
stop: isize)
-> &mut Self
key: K,
start: isize,
stop: isize)
-> &mut Self
Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more
fn zrevrangebyscore<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
max: MM,
min: M)
-> &mut Self
key: K,
max: MM,
min: M)
-> &mut Self
Return a range of members in a sorted set, by score.
fn zrevrangebyscore_withscores<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
max: MM,
min: M)
-> &mut Self
key: K,
max: MM,
min: M)
-> &mut Self
Return a range of members in a sorted set, by score with scores.
fn zrevrangebyscore_limit<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> &mut Self
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> &mut Self
Return a range of members in a sorted set, by score with limit.
fn zrevrangebyscore_limit_withscores<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> &mut Self
key: K,
max: MM,
min: M,
offset: isize,
count: isize)
-> &mut Self
Return a range of members in a sorted set, by score with limit with scores.
fn zrevrank<'a, K: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
member: M)
-> &mut Self
key: K,
member: M)
-> &mut Self
Determine the index of a member in a sorted set, with scores ordered from high to low.
fn zscore<'a, K: ToRedisArgs, M: ToRedisArgs>(&mut self,
key: K,
member: M)
-> &mut Self
key: K,
member: M)
-> &mut Self
Get the score associated with the given member in a sorted set.
fn zunionstore<'a, K: ToRedisArgs>(&mut self,
dstkey: K,
keys: &[K])
-> &mut Self
dstkey: K,
keys: &[K])
-> &mut Self
Unions multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more
fn zunionstore_min<'a, K: ToRedisArgs>(&mut self,
dstkey: K,
keys: &[K])
-> &mut Self
dstkey: K,
keys: &[K])
-> &mut Self
Unions multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more
fn zunionstore_max<'a, K: ToRedisArgs>(&mut self,
dstkey: K,
keys: &[K])
-> &mut Self
dstkey: K,
keys: &[K])
-> &mut Self
Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more
fn pfadd<'a, K: ToRedisArgs, E: ToRedisArgs>(&mut self,
key: K,
element: E)
-> &mut Self
key: K,
element: E)
-> &mut Self
Adds the specified elements to the specified HyperLogLog.
fn pfcount<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self
Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s). Read more
fn pfmerge<'a, K: ToRedisArgs>(&mut self, dstkey: K, srckeys: K) -> &mut Self
Merge N different HyperLogLogs into a single one.