Struct Cmd

pub struct Cmd { /* private fields */ }

Represents redis commands.

Implementations

impl Cmd

A command acts as a builder interface to creating encoded redis requests. This allows you to easiy assemble a packed command by chaining arguments together.

Basic example:

redis::Cmd::new().arg("SET").arg("my_key").arg(42);

There is also a helper function called cmd which makes it a tiny bit shorter:

redis::cmd("SET").arg("my_key").arg(42);

Because Rust currently does not have an ideal system for lifetimes of temporaries, sometimes you need to hold on to the initially generated command:

let mut cmd = redis::cmd("SMEMBERS");
let mut iter : redis::Iter<i32> = cmd.arg("my_set").clone().iter(&mut con).unwrap();

pub fn new() -> Cmd

Creates a new empty command.

pub fn with_capacity(arg_count: usize, size_of_data: usize) -> Cmd

Creates a new empty command, with at least the requested capcity.

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

Appends an argument to the command. The argument passed must be a type that implements ToRedisArgs. Most primitive types as well as vectors of primitive types implement it.

For instance all of the following are valid:

redis::cmd("SET").arg(&["my_key", "my_value"]);
redis::cmd("SET").arg("my_key").arg(42);
redis::cmd("SET").arg("my_key").arg(b"my_value");

pub fn cursor_arg(&mut self, cursor: u64) -> &mut Cmd

Works similar to arg but adds a cursor argument. This is always an integer and also flips the command implementation to support a different mode for the iterators where the iterator will ask for another batch of items when the local data is exhausted.

let mut cmd = redis::cmd("SSCAN");
let mut iter : redis::Iter<isize> =
    cmd.arg("my_set").cursor_arg(0).clone().iter(&mut con).unwrap();
for x in iter {
    // do something with the item
}

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

Returns the packed command as a byte vector.

pub fn in_scan_mode(&self) -> bool

Returns true if the command is in scan mode.

pub fn query<T: FromRedisValue>( &self, con: &mut dyn ConnectionLike, ) -> RedisResult<T>

Sends the command as query to the connection and converts the result to the target redis value. This is the general way how you can retrieve data.

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

where C: ConnectionLike,

Async version of query.

pub fn iter<T: FromRedisValue>( self, con: &mut dyn ConnectionLike, ) -> RedisResult<Iter<'_, T>>

Similar to query() but returns an iterator over the items of the bulk result or iterator. In normal mode this is not in any way more efficient than just querying into a Vec<T> as it’s internally implemented as buffering into a vector. This however is useful when cursor_arg was used in which case the iterator will query for more items until the server side cursor is exhausted.

This is useful for commands such as SSCAN, SCAN and others.

One speciality of this function is that it will check if the response looks like a cursor or not and always just looks at the payload. This way you can use the function the same for responses in the format of KEYS (just a list) as well as SSCAN (which returns a tuple of cursor and list).

pub async fn iter_async<'a, T: FromRedisValue + 'a>( self, con: &'a mut (dyn AsyncConnection + Send), ) -> RedisResult<AsyncIter<'a, T>>

Similar to iter() but returns an AsyncIter over the items of the bulk result or iterator. A futures::Stream is implemented on AsyncIter. In normal mode this is not in any way more efficient than just querying into a Vec<T> as it’s internally implemented as buffering into a vector. This however is useful when cursor_arg was used in which case the stream will query for more items until the server side cursor is exhausted.

This is useful for commands such as SSCAN, SCAN and others in async contexts.

One speciality of this function is that it will check if the response looks like a cursor or not and always just looks at the payload. This way you can use the function the same for responses in the format of KEYS (just a list) as well as SSCAN (which returns a tuple of cursor and list).

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 fails because of an error. This is mainly useful in examples and for simple commands like setting keys.

This is equivalent to a call of query like this:

let _ : () = redis::cmd("PING").query(&mut con).unwrap();

pub fn args_iter(&self) -> impl Clone + ExactSizeIterator<Item = Arg<&[u8]>>

Returns an iterator over the arguments in this command (including the command name itself)

impl Cmd

pub fn get<'a, K: ToRedisArgs>(key: K) -> Self

Get the value of a key. If key is a vec this becomes an MGET.

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

Get values of keys

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

Gets all keys matching pattern

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

Set the string value of a key.

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

Set the string value of a key with options.

pub fn set_multiple<'a, K: ToRedisArgs, V: ToRedisArgs>( items: &'a [(K, V)], ) -> 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>(items: &'a [(K, V)]) -> Self

Sets multiple keys to their values.

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

Set the value and expiration of a key.

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

Set the value and expiration in milliseconds of a key.

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

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

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

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

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

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

pub fn getrange<'a, K: ToRedisArgs>(key: K, from: isize, to: isize) -> 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>( key: K, offset: isize, value: V, ) -> Self

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

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

Delete one or more keys.

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

Determine if a key exists.

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

Determine the type of a key.

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

Set a key’s time to live in seconds.

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

Set the expiration for a key as a UNIX timestamp.

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

Set a key’s time to live in milliseconds.

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

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

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

Remove the expiration from a key.

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

Get the expiration time of a key.

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

Get the expiration time of a key in milliseconds.

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

Get the value of a key and set expiration

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

Get the value of a key and delete it

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

Rename a key.

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

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

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

Unlink one or more keys.

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

Append a value to a key.

pub fn incr<'a, K: ToRedisArgs, V: ToRedisArgs>(key: K, delta: V) -> 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>(key: K, delta: V) -> Self

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

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

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

pub fn getbit<'a, K: ToRedisArgs>(key: K, offset: usize) -> Self

Returns the bit value at offset in the string value stored at key.

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

Count set bits in a string.

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

Count set bits in a string in a range.

pub fn bit_and<'a, D: ToRedisArgs, S: ToRedisArgs>( dstkey: D, srckeys: S, ) -> 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>(dstkey: D, srckeys: S) -> 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>( dstkey: D, srckeys: S, ) -> 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>(dstkey: D, srckey: S) -> 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>(key: K) -> Self

Get the length of the value stored in a key.

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

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

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

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

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

Sets a single field in a hash.

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

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

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

Sets a multiple fields in a hash.

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

Increments a value.

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

Checks if a field in a hash exists.

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

Gets all the keys in a hash.

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

Gets all the values in a hash.

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

Gets all the fields and values in a hash.

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

Gets the length of a hash.

pub fn blmove<'a, S: ToRedisArgs, D: ToRedisArgs>( srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> 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>( timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> 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>(key: K, timeout: f64) -> Self

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

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

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

pub fn brpoplpush<'a, S: ToRedisArgs, D: ToRedisArgs>( srckey: S, dstkey: D, timeout: f64, ) -> 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>(key: K, index: isize) -> Self

Get an element from a list by its index.

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

Insert an element before another element in a list.

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

Insert an element after another element in a list.

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

Returns the length of the list stored at key.

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

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

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

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

pub fn lpop<'a, K: ToRedisArgs>(key: K, count: Option<NonZeroUsize>) -> 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>( key: K, value: V, options: LposOptions, ) -> Self

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

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

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

pub fn lpush_exists<'a, K: ToRedisArgs, V: ToRedisArgs>( key: K, value: V, ) -> 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>(key: K, start: isize, stop: isize) -> Self

Returns the specified elements of the list stored at key.

pub fn lrem<'a, K: ToRedisArgs, V: ToRedisArgs>( key: K, count: isize, value: V, ) -> Self

Removes the first count occurrences of elements equal to value from the list stored at key.

pub fn ltrim<'a, K: ToRedisArgs>(key: K, start: isize, stop: isize) -> 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>( key: K, index: isize, value: V, ) -> Self

Sets the list element at index to value

pub fn rpop<'a, K: ToRedisArgs>(key: K, count: Option<NonZeroUsize>) -> 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>(key: K, dstkey: D) -> Self

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

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

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

pub fn rpush_exists<'a, K: ToRedisArgs, V: ToRedisArgs>( key: K, value: V, ) -> 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>(key: K, member: M) -> Self

Add one or more members to a set.

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

Get the number of members in a set.

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

Subtract multiple sets.

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

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

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

Intersect multiple sets.

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

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

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

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

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

Determine if given values are members of a set.

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

Get all the members in a set.

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

Move a member from one set to another.

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

Remove and return a random member from a set.

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

Get one random member from a set.

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

Get multiple random members from a set.

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

Remove one or more members from a set.

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

Add multiple sets.

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

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

pub fn zadd<'a, K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs>( key: K, member: M, score: S, ) -> 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>( key: K, items: &'a [(S, M)], ) -> Self

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

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

Get the number of members in a sorted set.

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

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

pub fn zincr<'a, K: ToRedisArgs, M: ToRedisArgs, D: ToRedisArgs>( key: K, member: M, delta: D, ) -> 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>( dstkey: D, keys: &'a [K], ) -> 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>( dstkey: D, keys: &'a [K], ) -> 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>( dstkey: D, keys: &'a [K], ) -> 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>( dstkey: D, keys: &'a [(K, W)], ) -> 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>( dstkey: D, keys: &'a [(K, W)], ) -> 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>( dstkey: D, keys: &'a [(K, W)], ) -> 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>( key: K, min: M, max: MM, ) -> Self

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

pub fn bzpopmax<'a, K: ToRedisArgs>(key: K, timeout: f64) -> 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>(key: K, count: isize) -> Self

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

pub fn bzpopmin<'a, K: ToRedisArgs>(key: K, timeout: f64) -> 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>(key: K, count: isize) -> Self

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

pub fn bzmpop_max<'a, K: ToRedisArgs>( timeout: f64, keys: &'a [K], count: isize, ) -> 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>(keys: &'a [K], count: isize) -> 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>( timeout: f64, keys: &'a [K], count: isize, ) -> 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>(keys: &'a [K], count: isize) -> 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>(key: K, count: Option<isize>) -> Self

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

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

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

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

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

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

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

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

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

pub fn zrangebylex_limit<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( key: K, min: M, max: MM, offset: isize, count: isize, ) -> 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>( key: K, max: MM, min: M, ) -> Self

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

pub fn zrevrangebylex_limit<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>( key: K, max: MM, min: M, offset: isize, count: isize, ) -> 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>( key: K, min: M, max: MM, ) -> Self

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

pub fn zrangebyscore_withscores<'a, K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>( key: K, min: M, max: MM, ) -> 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>( key: K, min: M, max: MM, offset: isize, count: isize, ) -> 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>( key: K, min: M, max: MM, offset: isize, count: isize, ) -> Self

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

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

Determine the index of a member in a sorted set.

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

Remove one or more members from a sorted set.

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

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

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

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

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

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

pub fn zrevrange<'a, K: ToRedisArgs>(key: K, start: isize, stop: isize) -> 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>( key: K, start: isize, stop: isize, ) -> 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>( key: K, max: MM, min: M, ) -> Self

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

pub fn zrevrangebyscore_withscores<'a, K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>( key: K, max: MM, min: M, ) -> 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>( key: K, max: MM, min: M, offset: isize, count: isize, ) -> 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>( key: K, max: MM, min: M, offset: isize, count: isize, ) -> Self

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

pub fn zrevrank<'a, K: ToRedisArgs, M: ToRedisArgs>(key: K, member: M) -> 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>(key: K, member: M) -> Self

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

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

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

pub fn zunionstore<'a, D: ToRedisArgs, K: ToRedisArgs>( dstkey: D, keys: &'a [K], ) -> 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>( dstkey: D, keys: &'a [K], ) -> 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>( dstkey: D, keys: &'a [K], ) -> 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>( dstkey: D, keys: &'a [(K, W)], ) -> 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>( dstkey: D, keys: &'a [(K, W)], ) -> 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>( dstkey: D, keys: &'a [(K, W)], ) -> 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>(key: K, element: E) -> Self

Adds the specified elements to the specified HyperLogLog.

pub fn pfcount<'a, K: ToRedisArgs>(key: K) -> Self

Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).

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

Merge N different HyperLogLogs into a single one.

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

Posts a message to the given channel.

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

Returns the encoding of a key.

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

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

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

Returns the logarithmic access frequency counter of a key.

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

Returns the reference count of a key.

pub fn xrevrange_all<'a, K: ToRedisArgs>(key: K) -> 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 Cmd

fn clone(&self) -> Cmd

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Default for Cmd

fn default() -> Cmd

Returns the “default value” for a type.

impl RedisWrite for Cmd

fn write_arg(&mut self, arg: &[u8])

Accepts a serialized redis command.

fn write_arg_fmt(&mut self, arg: impl Display)

Accepts a serialized redis command.