Struct Pipeline

pub struct Pipeline { /* private fields */ }

Represents a redis command pipeline.

Implementations

impl Pipeline

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),) = redis::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(&mut 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.

pub fn new() -> Pipeline

Creates an empty pipeline. For consistency with the cmd api a pipe function is provided as alias.

pub fn with_capacity(capacity: usize) -> Pipeline

Creates an empty pipeline with pre-allocated capacity.

pub 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) = redis::pipe()
    .atomic()
    .cmd("GET").arg("key_1")
    .cmd("GET").arg("key_2").query(&mut con).unwrap();

pub fn get_packed_pipeline(&self) -> Vec<u8>

Returns the encoded pipeline commands.

pub fn query<T: FromRedisValue>( &self, con: &mut dyn 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) = redis::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(&mut con).unwrap();

NOTE: A Pipeline object may be reused after query() with all the commands as were inserted to them. In order to clear a Pipeline object with minimal memory released/allocated, it is necessary to call the clear() before inserting new commands.

pub async fn query_async<C, T: FromRedisValue>( &self, con: &mut C, ) -> RedisResult<T>

where C: ConnectionLike,

Async version of query.

pub fn execute(&self, con: &mut dyn 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 _ : () = redis::pipe().cmd("PING").query(&mut con).unwrap();

NOTE: A Pipeline object may be reused after query() with all the commands as were inserted to them. In order to clear a Pipeline object with minimal memory released/allocated, it is necessary to call the clear() before inserting new commands.

impl Pipeline

pub fn add_command(&mut self, cmd: Cmd) -> &mut Self

Adds a command to the cluster pipeline.

pub fn cmd(&mut self, name: &str) -> &mut Self

Starts a new command. Functions such as arg then become available to add more arguments to that command.

pub fn cmd_iter(&self) -> impl Iterator<Item = &Cmd>

Returns an iterator over all the commands currently in this pipeline

pub fn ignore(&mut self) -> &mut Self

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.

pub fn arg<T: ToRedisArgs>(&mut self, arg: T) -> &mut Self

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.

pub fn clear(&mut self)

Clear a pipeline object’s internal data structure.

This allows reusing a pipeline object as a clear object while performing a minimal amount of memory released/reallocated.

impl Pipeline

Implements common redis commands for pipelines. Unlike the regular commands trait, this returns the pipeline rather than a result directly. Other than that it works the same however.

pub 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.

pub fn mget<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get values of keys

pub fn keys<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets all keys matching pattern

pub fn set<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, ) -> &mut Self

Set the string value of a key.

pub fn set_options<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, options: SetOptions, ) -> &mut Self

Set the string value of a key with options.

pub fn set_multiple<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, items: &'a [(K, V)], ) -> &mut Self

👎Deprecated since 0.22.4: Renamed to mset() to reflect Redis name

Sets multiple keys to their values.

pub fn mset<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, items: &'a [(K, V)], ) -> &mut Self

Sets multiple keys to their values.

pub fn set_ex<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, seconds: u64, ) -> &mut Self

Set the value and expiration of a key.

pub fn pset_ex<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, milliseconds: u64, ) -> &mut Self

Set the value and expiration in milliseconds of a key.

pub fn set_nx<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, ) -> &mut Self

Set the value of a key, only if the key does not exist

pub fn mset_nx<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, items: &'a [(K, V)], ) -> &mut Self

Sets multiple keys to their values failing if at least one already exists.

pub fn getset<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, ) -> &mut Self

Set the string value of a key and return its old value.

pub fn getrange<'a, K: ToRedisArgs>( &mut self, key: K, from: isize, to: isize, ) -> &mut Self

Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.

pub fn setrange<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, offset: isize, value: V, ) -> &mut Self

Overwrite the part of the value stored in key at the specified offset.

pub fn del<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Delete one or more keys.

pub fn exists<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Determine if a key exists.

pub fn key_type<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Determine the type of a key.

pub fn expire<'a, K: ToRedisArgs>(&mut self, key: K, seconds: i64) -> &mut Self

Set a key’s time to live in seconds.

pub fn expire_at<'a, K: ToRedisArgs>(&mut self, key: K, ts: i64) -> &mut Self

Set the expiration for a key as a UNIX timestamp.

pub fn pexpire<'a, K: ToRedisArgs>(&mut self, key: K, ms: i64) -> &mut Self

Set a key’s time to live in milliseconds.

pub fn pexpire_at<'a, K: ToRedisArgs>(&mut self, key: K, ts: i64) -> &mut Self

Set the expiration for a key as a UNIX timestamp in milliseconds.

pub fn persist<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Remove the expiration from a key.

pub fn ttl<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the expiration time of a key.

pub fn pttl<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the expiration time of a key in milliseconds.

pub fn get_ex<'a, K: ToRedisArgs>( &mut self, key: K, expire_at: Expiry, ) -> &mut Self

Get the value of a key and set expiration

pub fn get_del<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the value of a key and delete it

pub fn rename<'a, K: ToRedisArgs, N: ToRedisArgs>( &mut self, key: K, new_key: N, ) -> &mut Self

Rename a key.

pub fn rename_nx<'a, K: ToRedisArgs, N: ToRedisArgs>( &mut self, key: K, new_key: N, ) -> &mut Self

Rename a key, only if the new key does not exist.

pub fn unlink<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Unlink one or more keys.

pub fn append<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, ) -> &mut Self

Append a value to a key.

pub fn incr<'a, K: ToRedisArgs, V: ToRedisArgs>( &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.

pub fn decr<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, delta: V, ) -> &mut Self

Decrement the numeric value of a key by the given amount.

pub fn setbit<'a, K: ToRedisArgs>( &mut self, key: K, offset: usize, value: bool, ) -> &mut Self

Sets or clears the bit at offset in the string value stored at key.

pub 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.

pub fn bitcount<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Count set bits in a string.

pub fn bitcount_range<'a, K: ToRedisArgs>( &mut self, key: K, start: usize, end: usize, ) -> &mut Self

Count set bits in a string in a range.

pub fn bit_and<'a, D: ToRedisArgs, S: ToRedisArgs>( &mut self, dstkey: D, srckeys: S, ) -> &mut Self

Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key.

pub fn bit_or<'a, D: ToRedisArgs, S: ToRedisArgs>( &mut self, dstkey: D, srckeys: S, ) -> &mut Self

Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key.

pub fn bit_xor<'a, D: ToRedisArgs, S: ToRedisArgs>( &mut self, dstkey: D, srckeys: S, ) -> &mut Self

Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key.

pub fn bit_not<'a, D: ToRedisArgs, S: ToRedisArgs>( &mut self, dstkey: D, srckey: S, ) -> &mut Self

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key.

pub fn strlen<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the length of the value stored in a key.

pub fn hget<'a, K: ToRedisArgs, F: ToRedisArgs>( &mut self, key: K, field: F, ) -> &mut Self

Gets a single (or multiple) fields from a hash.

pub fn hdel<'a, K: ToRedisArgs, F: ToRedisArgs>( &mut self, key: K, field: F, ) -> &mut Self

Deletes a single (or multiple) fields from a hash.

pub fn hset<'a, K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, field: F, value: V, ) -> &mut Self

Sets a single field in a hash.

pub fn hset_nx<'a, K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, field: F, value: V, ) -> &mut Self

Sets a single field in a hash if it does not exist.

pub fn hset_multiple<'a, K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, items: &'a [(F, V)], ) -> &mut Self

Sets a multiple fields in a hash.

pub fn hincr<'a, K: ToRedisArgs, F: ToRedisArgs, D: ToRedisArgs>( &mut self, key: K, field: F, delta: D, ) -> &mut Self

Increments a value.

pub fn hexists<'a, K: ToRedisArgs, F: ToRedisArgs>( &mut self, key: K, field: F, ) -> &mut Self

Checks if a field in a hash exists.

pub fn hkeys<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets all the keys in a hash.

pub fn hvals<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets all the values in a hash.

pub fn hgetall<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets all the fields and values in a hash.

pub fn hlen<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets the length of a hash.

pub fn blmove<'a, S: ToRedisArgs, D: ToRedisArgs>( &mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> &mut Self

Pop an element from a list, push it to another list and return it; or block until one is available

pub fn blmpop<'a, K: ToRedisArgs>( &mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> &mut Self

Pops count elements from the first non-empty list key from the list of provided key names; or blocks until one is available.

pub fn blpop<'a, K: ToRedisArgs>(&mut self, key: K, timeout: f64) -> &mut Self

Remove and get the first element in a list, or block until one is available.

pub fn brpop<'a, K: ToRedisArgs>(&mut self, key: K, timeout: f64) -> &mut Self

Remove and get the last element in a list, or block until one is available.

pub fn brpoplpush<'a, S: ToRedisArgs, D: ToRedisArgs>( &mut self, srckey: S, dstkey: D, timeout: f64, ) -> &mut Self

Pop a value from a list, push it to another list and return it; or block until one is available.

pub fn lindex<'a, K: ToRedisArgs>(&mut self, key: K, index: isize) -> &mut Self

Get an element from a list by its index.

pub fn linsert_before<'a, K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, pivot: P, value: V, ) -> &mut Self

Insert an element before another element in a list.

pub fn linsert_after<'a, K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, pivot: P, value: V, ) -> &mut Self

Insert an element after another element in a list.

pub fn llen<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Returns the length of the list stored at key.

pub fn lmove<'a, S: ToRedisArgs, D: ToRedisArgs>( &mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, ) -> &mut Self

Pop an element a list, push it to another list and return it

pub fn lmpop<'a, K: ToRedisArgs>( &mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> &mut Self

Pops count elements from the first non-empty list key from the list of provided key names.

pub fn lpop<'a, K: ToRedisArgs>( &mut self, key: K, count: Option<NonZeroUsize>, ) -> &mut Self

Removes and returns the up to count first elements of the list stored at key.

If count is not specified, then defaults to first element.

pub fn lpos<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, options: LposOptions, ) -> &mut Self

Returns the index of the first matching value of the list stored at key.

pub fn lpush<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, ) -> &mut Self

Insert all the specified values at the head of the list stored at key.

pub fn lpush_exists<'a, K: ToRedisArgs, V: ToRedisArgs>( &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.

pub fn lrange<'a, K: ToRedisArgs>( &mut self, key: K, start: isize, stop: isize, ) -> &mut Self

Returns the specified elements of the list stored at key.

pub fn lrem<'a, K: ToRedisArgs, V: ToRedisArgs>( &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.

pub fn ltrim<'a, K: ToRedisArgs>( &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.

pub fn lset<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, index: isize, value: V, ) -> &mut Self

Sets the list element at index to value

pub fn rpop<'a, K: ToRedisArgs>( &mut self, key: K, count: Option<NonZeroUsize>, ) -> &mut Self

Removes and returns the up to count last elements of the list stored at key

If count is not specified, then defaults to last element.

pub fn rpoplpush<'a, K: ToRedisArgs, D: ToRedisArgs>( &mut self, key: K, dstkey: D, ) -> &mut Self

Pop a value from a list, push it to another list and return it.

pub fn rpush<'a, K: ToRedisArgs, V: ToRedisArgs>( &mut self, key: K, value: V, ) -> &mut Self

Insert all the specified values at the tail of the list stored at key.

pub fn rpush_exists<'a, K: ToRedisArgs, V: ToRedisArgs>( &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.

pub fn sadd<'a, K: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, member: M, ) -> &mut Self

Add one or more members to a set.

pub fn scard<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the number of members in a set.

pub fn sdiff<'a, K: ToRedisArgs>(&mut self, keys: K) -> &mut Self

Subtract multiple sets.

pub fn sdiffstore<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: K, ) -> &mut Self

Subtract multiple sets and store the resulting set in a key.

pub fn sinter<'a, K: ToRedisArgs>(&mut self, keys: K) -> &mut Self

Intersect multiple sets.

pub fn sinterstore<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: K, ) -> &mut Self

Intersect multiple sets and store the resulting set in a key.

pub fn sismember<'a, K: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, member: M, ) -> &mut Self

Determine if a given value is a member of a set.

pub fn smismember<'a, K: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, members: M, ) -> &mut Self

Determine if given values are members of a set.

pub fn smembers<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get all the members in a set.

pub fn smove<'a, S: ToRedisArgs, D: ToRedisArgs, M: ToRedisArgs>( &mut self, srckey: S, dstkey: D, member: M, ) -> &mut Self

Move a member from one set to another.

pub fn spop<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Remove and return a random member from a set.

pub fn srandmember<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get one random member from a set.

pub fn srandmember_multiple<'a, K: ToRedisArgs>( &mut self, key: K, count: usize, ) -> &mut Self

Get multiple random members from a set.

pub fn srem<'a, K: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, member: M, ) -> &mut Self

Remove one or more members from a set.

pub fn sunion<'a, K: ToRedisArgs>(&mut self, keys: K) -> &mut Self

Add multiple sets.

pub fn sunionstore<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: K, ) -> &mut Self

Add multiple sets and store the resulting set in a key.

pub fn zadd<'a, K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs>( &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.

pub fn zadd_multiple<'a, K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, items: &'a [(S, M)], ) -> &mut Self

Add multiple members to a sorted set, or update its score if it already exists.

pub fn zcard<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the number of members in a sorted set.

pub fn zcount<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &mut self, key: K, min: M, max: MM, ) -> &mut Self

Count the members in a sorted set with scores within the given values.

pub fn zincr<'a, K: ToRedisArgs, M: ToRedisArgs, D: ToRedisArgs>( &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.

pub fn zinterstore<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [K], ) -> &mut Self

Intersect multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function.

pub fn zinterstore_min<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [K], ) -> &mut Self

Intersect multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function.

pub fn zinterstore_max<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [K], ) -> &mut Self

Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function.

pub fn zinterstore_weights<'a, D: ToRedisArgs, K: ToRedisArgs, W: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> &mut Self

Commands::zinterstore, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.

pub fn zinterstore_min_weights<'a, D: ToRedisArgs, K: ToRedisArgs, W: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> &mut Self

Commands::zinterstore_min, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.

pub fn zinterstore_max_weights<'a, D: ToRedisArgs, K: ToRedisArgs, W: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> &mut Self

Commands::zinterstore_max, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.

pub fn zlexcount<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &mut self, key: K, min: M, max: MM, ) -> &mut Self

Count the number of members in a sorted set between a given lexicographical range.

pub fn bzpopmax<'a, K: ToRedisArgs>( &mut self, key: K, timeout: f64, ) -> &mut Self

Removes and returns the member with the highest score in a sorted set. Blocks until a member is available otherwise.

pub fn zpopmax<'a, K: ToRedisArgs>(&mut self, key: K, count: isize) -> &mut Self

Removes and returns up to count members with the highest scores in a sorted set

pub fn bzpopmin<'a, K: ToRedisArgs>( &mut self, key: K, timeout: f64, ) -> &mut Self

Removes and returns the member with the lowest score in a sorted set. Blocks until a member is available otherwise.

pub fn zpopmin<'a, K: ToRedisArgs>(&mut self, key: K, count: isize) -> &mut Self

Removes and returns up to count members with the lowest scores in a sorted set

pub fn bzmpop_max<'a, K: ToRedisArgs>( &mut self, timeout: f64, keys: &'a [K], count: isize, ) -> &mut Self

Removes and returns up to count members with the highest scores, from the first non-empty sorted set in the provided list of key names. Blocks until a member is available otherwise.

pub fn zmpop_max<'a, K: ToRedisArgs>( &mut self, keys: &'a [K], count: isize, ) -> &mut Self

Removes and returns up to count members with the highest scores, from the first non-empty sorted set in the provided list of key names.

pub fn bzmpop_min<'a, K: ToRedisArgs>( &mut self, timeout: f64, keys: &'a [K], count: isize, ) -> &mut Self

Removes and returns up to count members with the lowest scores, from the first non-empty sorted set in the provided list of key names. Blocks until a member is available otherwise.

pub fn zmpop_min<'a, K: ToRedisArgs>( &mut self, keys: &'a [K], count: isize, ) -> &mut Self

Removes and returns up to count members with the lowest scores, from the first non-empty sorted set in the provided list of key names.

pub fn zrandmember<'a, K: ToRedisArgs>( &mut self, key: K, count: Option<isize>, ) -> &mut Self

Return up to count random members in a sorted set (or 1 if count == None)

pub fn zrandmember_withscores<'a, K: ToRedisArgs>( &mut self, key: K, count: isize, ) -> &mut Self

Return up to count random members in a sorted set with scores

pub fn zrange<'a, K: ToRedisArgs>( &mut self, key: K, start: isize, stop: isize, ) -> &mut Self

Return a range of members in a sorted set, by index

pub fn zrange_withscores<'a, K: ToRedisArgs>( &mut self, key: K, start: isize, stop: isize, ) -> &mut Self

Return a range of members in a sorted set, by index with scores.

pub fn zrangebylex<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &mut self, key: K, min: M, max: MM, ) -> &mut Self

Return a range of members in a sorted set, by lexicographical range.

pub fn zrangebylex_limit<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &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.

pub fn zrevrangebylex<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, max: MM, min: M, ) -> &mut Self

Return a range of members in a sorted set, by lexicographical range.

pub fn zrevrangebylex_limit<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>( &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.

pub fn zrangebyscore<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &mut self, key: K, min: M, max: MM, ) -> &mut Self

Return a range of members in a sorted set, by score.

pub fn zrangebyscore_withscores<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &mut self, key: K, min: M, max: MM, ) -> &mut Self

Return a range of members in a sorted set, by score with scores.

pub fn zrangebyscore_limit<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &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.

pub 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

Return a range of members in a sorted set, by score with limit with scores.

pub fn zrank<'a, K: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, member: M, ) -> &mut Self

Determine the index of a member in a sorted set.

pub fn zrem<'a, K: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, members: M, ) -> &mut Self

Remove one or more members from a sorted set.

pub fn zrembylex<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &mut self, key: K, min: M, max: MM, ) -> &mut Self

Remove all members in a sorted set between the given lexicographical range.

pub fn zremrangebyrank<'a, K: ToRedisArgs>( &mut self, key: K, start: isize, stop: isize, ) -> &mut Self

Remove all members in a sorted set within the given indexes.

pub fn zrembyscore<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( &mut self, key: K, min: M, max: MM, ) -> &mut Self

Remove all members in a sorted set within the given scores.

pub fn zrevrange<'a, K: ToRedisArgs>( &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.

pub fn zrevrange_withscores<'a, K: ToRedisArgs>( &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.

pub fn zrevrangebyscore<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, max: MM, min: M, ) -> &mut Self

Return a range of members in a sorted set, by score.

pub fn zrevrangebyscore_withscores<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, max: MM, min: M, ) -> &mut Self

Return a range of members in a sorted set, by score with scores.

pub fn zrevrangebyscore_limit<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>( &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.

pub 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

Return a range of members in a sorted set, by score with limit with scores.

pub fn zrevrank<'a, K: ToRedisArgs, M: ToRedisArgs>( &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.

pub fn zscore<'a, K: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, member: M, ) -> &mut Self

Get the score associated with the given member in a sorted set.

pub fn zscore_multiple<'a, K: ToRedisArgs, M: ToRedisArgs>( &mut self, key: K, members: &'a [M], ) -> &mut Self

Get the scores associated with multiple members in a sorted set.

pub fn zunionstore<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [K], ) -> &mut Self

Unions multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function.

pub fn zunionstore_min<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [K], ) -> &mut Self

Unions multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function.

pub fn zunionstore_max<'a, D: ToRedisArgs, K: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [K], ) -> &mut Self

Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function.

pub fn zunionstore_weights<'a, D: ToRedisArgs, K: ToRedisArgs, W: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> &mut Self

Commands::zunionstore, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.

pub fn zunionstore_min_weights<'a, D: ToRedisArgs, K: ToRedisArgs, W: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> &mut Self

Commands::zunionstore_min, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.

pub fn zunionstore_max_weights<'a, D: ToRedisArgs, K: ToRedisArgs, W: ToRedisArgs>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> &mut Self

Commands::zunionstore_max, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.

pub fn pfadd<'a, K: ToRedisArgs, E: ToRedisArgs>( &mut self, key: K, element: E, ) -> &mut Self

Adds the specified elements to the specified HyperLogLog.

pub 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).

pub fn pfmerge<'a, D: ToRedisArgs, S: ToRedisArgs>( &mut self, dstkey: D, srckeys: S, ) -> &mut Self

Merge N different HyperLogLogs into a single one.

pub fn publish<'a, K: ToRedisArgs, E: ToRedisArgs>( &mut self, channel: K, message: E, ) -> &mut Self

Posts a message to the given channel.

pub fn object_encoding<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Returns the encoding of a key.

pub fn object_idletime<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Returns the time in seconds since the last access of a key.

pub fn object_freq<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Returns the logarithmic access frequency counter of a key.

pub fn object_refcount<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Returns the reference count of a key.

pub fn xrevrange_all<'a, K: ToRedisArgs>(&mut self, key: K) -> &mut Self

This is the reverse version of xrange_all. The same rules apply for start and end here.

XREVRANGE key + -

Trait Implementations

impl Clone for Pipeline

fn clone(&self) -> Pipeline

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Default for Pipeline

fn default() -> Self

Returns the “default value” for a type.