redis::aio

Struct ConnectionManager

source 
pub struct ConnectionManager { /* private fields */ }
Expand description

A ConnectionManager is a proxy that wraps a multiplexed connection and automatically reconnects to the server when necessary.

Like the MultiplexedConnection, this manager can be cloned, allowing requests to be be sent concurrently on the same underlying connection (tcp/unix socket).

§Behavior

  • When creating an instance of the ConnectionManager, an initial connection will be established and awaited. Connection errors will be returned directly.
  • When a command sent to the server fails with an error that represents a “connection dropped” condition, that error will be passed on to the user, but it will trigger a reconnection in the background.
  • The reconnect code will atomically swap the current (dead) connection with a future that will eventually resolve to a MultiplexedConnection or to a RedisError
  • All commands that are issued after the reconnect process has been initiated, will have to await the connection future.
  • If reconnecting fails, all pending commands will be failed as well. A new reconnection attempt will be triggered if the error is an I/O error.

Implementations§

source§

impl ConnectionManager

source

pub async fn new(client: Client) -> RedisResult<Self>

Connect to the server and store the connection inside the returned ConnectionManager.

This requires the connection-manager feature, which will also pull in the Tokio executor.

source

pub async fn new_with_backoff( client: Client, exponent_base: u64, factor: u64, number_of_retries: usize, ) -> RedisResult<Self>

Connect to the server and store the connection inside the returned ConnectionManager.

This requires the connection-manager feature, which will also pull in the Tokio executor.

In case of reconnection issues, the manager will retry reconnection number_of_retries times, with an exponentially increasing delay, calculated as rand(0 .. factor * (exponent_base ^ current-try)).

source

pub async fn new_with_backoff_and_timeouts( client: Client, exponent_base: u64, factor: u64, number_of_retries: usize, response_timeout: Duration, connection_timeout: Duration, ) -> RedisResult<Self>

Connect to the server and store the connection inside the returned ConnectionManager.

This requires the connection-manager feature, which will also pull in the Tokio executor.

In case of reconnection issues, the manager will retry reconnection number_of_retries times, with an exponentially increasing delay, calculated as rand(0 .. factor * (exponent_base ^ current-try)).

The new connection will timeout operations after response_timeout has passed. Each connection attempt to the server will timeout after connection_timeout.

source

pub async fn send_packed_command(&mut self, cmd: &Cmd) -> RedisResult<Value>

Sends an already encoded (packed) command into the TCP socket and reads the single response from it.

source

pub async fn send_packed_commands( &mut self, cmd: &Pipeline, offset: usize, count: usize, ) -> RedisResult<Vec<Value>>

Sends multiple already encoded (packed) command into the TCP socket and reads count responses from it. This is used to implement pipelining.

Trait Implementations§

source§

impl Clone for ConnectionManager

source§

fn clone(&self) -> ConnectionManager

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl ConnectionLike for ConnectionManager

source§

fn req_packed_command<'a>(&'a mut self, cmd: &'a Cmd) -> RedisFuture<'a, Value>

Sends an already encoded (packed) command into the TCP socket and reads the single response from it.
source§

fn get_db(&self) -> i64

Returns the database this connection is bound to. Note that this information might be unreliable because it’s initially cached and also might be incorrect if the connection like object is not actually connected.

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> AsyncCommands for T
where T: ConnectionLike + Send,

source§

fn get<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn mget<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get values of keys
source§

fn keys<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Gets all keys matching pattern
source§

fn set<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Set the string value of a key.
source§

fn set_options<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, options: SetOptions, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Set the string value of a key with options.
source§

fn set_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, items: &'a [(K, V)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

👎Deprecated since 0.22.4: Renamed to mset() to reflect Redis name
Sets multiple keys to their values.
source§

fn mset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, items: &'a [(K, V)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Sets multiple keys to their values.
source§

fn set_ex<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, seconds: u64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Set the value and expiration of a key.
source§

fn pset_ex<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, milliseconds: u64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Set the value and expiration in milliseconds of a key.
source§

fn set_nx<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn mset_nx<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, items: &'a [(K, V)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn getset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn getrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, from: isize, to: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn setrange<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, offset: isize, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn del<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Delete one or more keys.
source§

fn exists<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Determine if a key exists.
source§

fn key_type<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Determine the type of a key.
source§

fn expire<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, seconds: i64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Set a key’s time to live in seconds.
source§

fn expire_at<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ts: i64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Set the expiration for a key as a UNIX timestamp.
source§

fn pexpire<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ms: i64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Set a key’s time to live in milliseconds.
source§

fn pexpire_at<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ts: i64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn persist<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Remove the expiration from a key.
source§

fn ttl<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get the expiration time of a key.
source§

fn pttl<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get the expiration time of a key in milliseconds.
source§

fn get_ex<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, expire_at: Expiry, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get the value of a key and set expiration
source§

fn get_del<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get the value of a key and delete it
source§

fn rename<'a, K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, new_key: N, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Rename a key.
source§

fn rename_nx<'a, K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, new_key: N, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Rename a key, only if the new key does not exist.
Unlink one or more keys.
source§

fn append<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Append a value to a key.
source§

fn incr<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, delta: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type.
source§

fn decr<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, delta: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn setbit<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, offset: usize, value: bool, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn getbit<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, offset: usize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn bitcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Count set bits in a string.
source§

fn bitcount_range<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, start: usize, end: usize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Count set bits in a string in a range.
source§

fn bit_and<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn bit_or<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn bit_xor<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn bit_not<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, srckey: S, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn strlen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get the length of the value stored in a key.
source§

fn hget<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, field: F, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn hdel<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, field: F, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn hset<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, field: F, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Sets a single field in a hash.
source§

fn hset_nx<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, field: F, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn hset_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, items: &'a [(F, V)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Sets a multiple fields in a hash.
source§

fn hincr<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, field: F, delta: D, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Increments a value.
source§

fn hexists<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, field: F, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Checks if a field in a hash exists.
source§

fn hkeys<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Gets all the keys in a hash.
source§

fn hvals<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Gets all the values in a hash.
source§

fn hgetall<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Gets all the fields and values in a hash.
source§

fn hlen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Gets the length of a hash.
source§

fn blmove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn blmpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn blpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, timeout: f64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn brpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, timeout: f64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn brpoplpush<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, srckey: S, dstkey: D, timeout: f64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn lindex<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, index: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get an element from a list by its index.
source§

fn linsert_before<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, pivot: P, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Insert an element before another element in a list.
source§

fn linsert_after<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, pivot: P, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Insert an element after another element in a list.
source§

fn llen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Returns the length of the list stored at key.
source§

fn lmove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn lmpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn lpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, count: Option<NonZeroUsize>, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Removes and returns the up to count first elements of the list stored at key. Read more
source§

fn lpos<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, options: LposOptions, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn lpush<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn lpush_exists<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Inserts a value at the head of the list stored at key, only if key already exists and holds a list.
source§

fn lrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Returns the specified elements of the list stored at key.
source§

fn lrem<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, count: isize, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn ltrim<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Trim an existing list so that it will contain only the specified range of elements specified.
source§

fn lset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, index: isize, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Sets the list element at index to value
source§

fn rpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, count: Option<NonZeroUsize>, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Removes and returns the up to count last elements of the list stored at key Read more
source§

fn rpoplpush<'a, K: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, dstkey: D, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn rpush<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn rpush_exists<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, value: V, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Inserts value at the tail of the list stored at key, only if key already exists and holds a list.
source§

fn sadd<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, member: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Add one or more members to a set.
source§

fn scard<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get the number of members in a set.
source§

fn sdiff<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, keys: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Subtract multiple sets.
source§

fn sdiffstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn sinter<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, keys: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Intersect multiple sets.
source§

fn sinterstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn sismember<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, member: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn smismember<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, members: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Determine if given values are members of a set.
source§

fn smembers<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get all the members in a set.
source§

fn smove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, srckey: S, dstkey: D, member: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Move a member from one set to another.
source§

fn spop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Remove and return a random member from a set.
source§

fn srandmember<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get one random member from a set.
source§

fn srandmember_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, count: usize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get multiple random members from a set.
source§

fn srem<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, member: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Remove one or more members from a set.
source§

fn sunion<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, keys: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Add multiple sets.
source§

fn sunionstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zadd<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, member: M, score: S, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Add one member to a sorted set, or update its score if it already exists.
source§

fn zadd_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, items: &'a [(S, M)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zcard<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Get the number of members in a sorted set.
source§

fn zcount<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zincr<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, member: M, delta: D, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn zinterstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [K], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zinterstore_min<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [K], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zinterstore_max<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [K], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zinterstore_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zinterstore_min_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn zinterstore_max_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn zlexcount<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn bzpopmax<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, timeout: f64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zpopmax<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn bzpopmin<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, timeout: f64, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zpopmin<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn bzmpop_max<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, timeout: f64, keys: &'a [K], count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn zmpop_max<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, keys: &'a [K], count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn bzmpop_min<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, timeout: f64, keys: &'a [K], count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn zmpop_min<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, keys: &'a [K], count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn zrandmember<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, count: Option<isize>, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrandmember_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrange_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrangebylex<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrangebylex_limit<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range with offset and limit.
source§

fn zrevrangebylex<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, max: MM, min: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrevrangebylex_limit<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range with offset and limit.
source§

fn zrangebyscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrangebyscore_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrangebyscore_limit<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrangebyscore_limit_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrank<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, member: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Determine the index of a member in a sorted set.
source§

fn zrem<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, members: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Remove one or more members from a sorted set.
source§

fn zrembylex<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zremrangebyrank<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrembyscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, min: M, max: MM, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrevrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Return a range of members in a sorted set, by index, with scores ordered from high to low.
source§

fn zrevrange_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Return a range of members in a sorted set, by index, with scores ordered from high to low.
source§

fn zrevrangebyscore<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, max: MM, min: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrevrangebyscore_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, max: MM, min: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrevrangebyscore_limit<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrevrangebyscore_limit_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zrevrank<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, member: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Determine the index of a member in a sorted set, with scores ordered from high to low.
source§

fn zscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, member: M, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zscore_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, members: &'a [M], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zunionstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [K], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zunionstore_min<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [K], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zunionstore_max<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [K], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zunionstore_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn zunionstore_min_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn zunionstore_max_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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.
source§

fn pfadd<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, element: E, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Adds the specified elements to the specified HyperLogLog.
source§

fn pfcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn pfmerge<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Merge N different HyperLogLogs into a single one.
source§

fn publish<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, channel: K, message: E, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Posts a message to the given channel.
source§

fn object_encoding<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Returns the encoding of a key.
source§

fn object_idletime<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn object_freq<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Returns the logarithmic access frequency counter of a key.
source§

fn object_refcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

Returns the reference count of a key.
source§

fn xrevrange_all<'a, K: ToRedisArgs + Send + Sync + 'a, RV>( &'a mut self, key: K, ) -> RedisFuture<'a, RV>
where RV: FromRedisValue,

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

fn scan<RV: FromRedisValue>(&mut self) -> RedisFuture<'_, AsyncIter<'_, RV>>

Incrementally iterate the keys space.
source§

fn scan_match<P: ToRedisArgs, RV: FromRedisValue>( &mut self, pattern: P, ) -> RedisFuture<'_, AsyncIter<'_, RV>>

Incrementally iterate set elements for elements matching a pattern.
source§

fn hscan<K: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, ) -> RedisFuture<'_, AsyncIter<'_, RV>>

Incrementally iterate hash fields and associated values.
source§

fn hscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, pattern: P, ) -> RedisFuture<'_, AsyncIter<'_, RV>>

Incrementally iterate hash fields and associated values for field names matching a pattern.
source§

fn sscan<K: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, ) -> RedisFuture<'_, AsyncIter<'_, RV>>

Incrementally iterate set elements.
source§

fn sscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, pattern: P, ) -> RedisFuture<'_, AsyncIter<'_, RV>>

Incrementally iterate set elements for elements matching a pattern.
source§

fn zscan<K: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, ) -> RedisFuture<'_, AsyncIter<'_, RV>>

Incrementally iterate sorted set elements.
source§

fn zscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, pattern: P, ) -> RedisFuture<'_, AsyncIter<'_, RV>>

Incrementally iterate sorted set elements for elements matching a pattern.
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for T
where T: Clone,

source§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T