mod_redis

Enum ConnectionWrapper

Source 
pub enum ConnectionWrapper {
    Single(ConnectionManager),
    Cluster(ClusterConnection),
}

Variants§

§

Single(ConnectionManager)

§

Cluster(ClusterConnection)

Implementations§

Source§

impl ConnectionWrapper

Source

pub async fn ping(&mut self) -> Result<()>

Trait Implementations§

Source§

impl ConnectionLike for ConnectionWrapper

Source§

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

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
§

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

§

fn get<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the value of a key. If key is a vec this becomes an MGET (if using TypedCommands, you should specifically use mget to get the correct return type. Redis Docs
§

fn mget<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get values of keys Redis Docs
§

fn keys<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Gets all keys matching pattern Redis Docs
§

fn set<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the string value of a key. Redis Docs
§

fn set_options<'a, K, V, RV>( &'a mut self, key: K, value: V, options: SetOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the string value of a key with options. Redis Docs
§

fn set_multiple<'a, K, V, RV>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn mset<'a, K, V, RV>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sets multiple keys to their values. Redis Docs
§

fn set_ex<'a, K, V, RV>( &'a mut self, key: K, value: V, seconds: u64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the value and expiration of a key. Redis Docs
§

fn pset_ex<'a, K, V, RV>( &'a mut self, key: K, value: V, milliseconds: u64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn set_nx<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn mset_nx<'a, K, V, RV>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn getset<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn getrange<'a, K, RV>( &'a mut self, key: K, from: isize, to: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, 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. Redis returns an empty string if the key doesn’t exist, not Nil Redis Docs
§

fn setrange<'a, K, V, RV>( &'a mut self, key: K, offset: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn del<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Delete one or more keys. Returns the number of keys deleted. Redis Docs
§

fn exists<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Determine if a key exists. Redis Docs
§

fn key_type<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Determine the type of key. Redis Docs
§

fn expire<'a, K, RV>( &'a mut self, key: K, seconds: i64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set a key’s time to live in seconds. Returns whether expiration was set. Redis Docs
§

fn expire_at<'a, K, RV>( &'a mut self, key: K, ts: i64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the expiration for a key as a UNIX timestamp. Returns whether expiration was set. Redis Docs
§

fn pexpire<'a, K, RV>( &'a mut self, key: K, ms: i64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set a key’s time to live in milliseconds. Returns whether expiration was set. Redis Docs
§

fn pexpire_at<'a, K, RV>( &'a mut self, key: K, ts: i64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the expiration for a key as a UNIX timestamp in milliseconds. Returns whether expiration was set. Redis Docs
§

fn expire_time<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the absolute Unix expiration timestamp in seconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
§

fn pexpire_time<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the absolute Unix expiration timestamp in milliseconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
§

fn persist<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Remove the expiration from a key. Returns whether a timeout was removed. Redis Docs
§

fn ttl<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the time to live for a key in seconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
§

fn pttl<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the time to live for a key in milliseconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
§

fn get_ex<'a, K, RV>( &'a mut self, key: K, expire_at: Expiry, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the value of a key and set expiration Redis Docs
§

fn get_del<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the value of a key and delete it Redis Docs
§

fn copy<'a, KSrc, KDst, Db, RV>( &'a mut self, source: KSrc, destination: KDst, options: CopyOptions<Db>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where KSrc: ToRedisArgs + Send + Sync + 'a, KDst: ToRedisArgs + Send + Sync + 'a, Db: ToString + Send + Sync + 'a, RV: FromRedisValue,

Copy the value from one key to another, returning whether the copy was successful. Redis Docs
§

fn rename<'a, K, N, RV>( &'a mut self, key: K, new_key: N, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Rename a key. Errors if key does not exist. Redis Docs
§

fn rename_nx<'a, K, N, RV>( &'a mut self, key: K, new_key: N, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Rename a key, only if the new key does not exist. Errors if key does not exist. Returns whether the key was renamed, or false if the new key already exists. Redis Docs
Unlink one or more keys. This is a non-blocking version of DEL. Returns number of keys unlinked. Redis Docs
§

fn append<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Append a value to a key. Returns length of string after operation. Redis Docs
§

fn incr<'a, K, V, RV>( &'a mut self, key: K, delta: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type. If the key does not exist, it is set to 0 before performing the operation.
§

fn decr<'a, K, V, RV>( &'a mut self, key: K, delta: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Decrement the numeric value of a key by the given amount. If the key does not exist, it is set to 0 before performing the operation. Redis Docs
§

fn setbit<'a, K, RV>( &'a mut self, key: K, offset: usize, value: bool, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sets or clears the bit at offset in the string value stored at key. Returns the original bit value stored at offset. Redis Docs
§

fn getbit<'a, K, RV>( &'a mut self, key: K, offset: usize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn bitcount<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Count set bits in a string. Returns 0 if key does not exist. Redis Docs
§

fn bitcount_range<'a, K, RV>( &'a mut self, key: K, start: usize, end: usize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Count set bits in a string in a range. Returns 0 if key does not exist. Redis Docs
§

fn bit_and<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
§

fn bit_or<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
§

fn bit_xor<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
§

fn bit_not<'a, D, S, RV>( &'a mut self, dstkey: D, srckey: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
§

fn bit_diff<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

DIFF(X, Y1, Y2, …)
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
§

fn bit_diff1<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

DIFF1(X, Y1, Y2, …) (Relative complement difference)
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§

fn bit_and_or<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

ANDOR(X, Y1, Y2, …)
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§

fn bit_one<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

ONE(X, Y1, Y2, …)
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
§

fn strlen<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the length of the value stored in a key. 0 if key does not exist. Redis Docs
§

fn hget<'a, K, F, RV>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn hmget<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Gets multiple fields from a hash. Redis Docs
§

fn hget_ex<'a, K, F, RV>( &'a mut self, key: K, fields: F, expire_at: Expiry, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the value of one or more fields of a given hash key, and optionally set their expiration Redis Docs
§

fn hdel<'a, K, F, RV>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Deletes a single (or multiple) fields from a hash. Returns number of fields deleted. Redis Docs
§

fn hget_del<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get and delete the value of one or more fields of a given hash key Redis Docs
§

fn hset<'a, K, F, V, RV>( &'a mut self, key: K, field: F, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sets a single field in a hash. Returns number of fields added. Redis Docs
§

fn hset_ex<'a, K, F, V, RV>( &'a mut self, key: K, hash_field_expiration_options: &'a HashFieldExpirationOptions, fields_values: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the value of one or more fields of a given hash key, and optionally set their expiration Redis Docs
§

fn hset_nx<'a, K, F, V, RV>( &'a mut self, key: K, field: F, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sets a single field in a hash if it does not exist. Returns whether the field was added. Redis Docs
§

fn hset_multiple<'a, K, F, V, RV>( &'a mut self, key: K, items: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sets multiple fields in a hash. Redis Docs
§

fn hincr<'a, K, F, D, RV>( &'a mut self, key: K, field: F, delta: D, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Increments a value. Returns the new value of the field after incrementation.
§

fn hexists<'a, K, F, RV>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Checks if a field in a hash exists. Redis Docs
§

fn httl<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get one or more fields’ TTL in seconds. Redis Docs
§

fn hpttl<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get one or more fields’ TTL in milliseconds. Redis Docs
§

fn hexpire<'a, K, F, RV>( &'a mut self, key: K, seconds: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set one or more fields’ time to live in seconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with 0 seconds. Errors if provided key exists but is not a hash. Redis Docs
§

fn hexpire_at<'a, K, F, RV>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the expiration for one or more fields as a UNIX timestamp in seconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with a time in the past. Errors if provided key exists but is not a hash. Redis Docs
§

fn hexpire_time<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns the absolute Unix expiration timestamp in seconds. Redis Docs
§

fn hpersist<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Remove the expiration from a key. Returns 1 if the expiration was removed. Redis Docs
§

fn hpexpire<'a, K, F, RV>( &'a mut self, key: K, milliseconds: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set one or more fields’ time to live in milliseconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with 0 seconds. Errors if provided key exists but is not a hash. Redis Docs
§

fn hpexpire_at<'a, K, F, RV>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the expiration for one or more fields as a UNIX timestamp in milliseconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with a time in the past. Errors if provided key exists but is not a hash. Redis Docs
§

fn hpexpire_time<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns the absolute Unix expiration timestamp in seconds. Redis Docs
§

fn hkeys<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Gets all the keys in a hash. Redis Docs
§

fn hvals<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Gets all the values in a hash. Redis Docs
§

fn hgetall<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Gets all the fields and values in a hash. Redis Docs
§

fn hlen<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Gets the length of a hash. Returns 0 if key does not exist. Redis Docs
§

fn blmove<'a, S, D, RV>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn blmpop<'a, K, RV>( &'a mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn blpop<'a, K, RV>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn brpop<'a, K, RV>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn brpoplpush<'a, S, D, RV>( &'a mut self, srckey: S, dstkey: D, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn lindex<'a, K, RV>( &'a mut self, key: K, index: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get an element from a list by its index. Redis Docs
§

fn linsert_before<'a, K, P, V, RV>( &'a mut self, key: K, pivot: P, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Insert an element before another element in a list. Redis Docs
§

fn linsert_after<'a, K, P, V, RV>( &'a mut self, key: K, pivot: P, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Insert an element after another element in a list. Redis Docs
§

fn llen<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns the length of the list stored at key. Redis Docs
§

fn lmove<'a, S, D, RV>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn lmpop<'a, K, RV>( &'a mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn lpop<'a, K, RV>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn lpos<'a, K, V, RV>( &'a mut self, key: K, value: V, options: LposOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn lpush<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn lpush_exists<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn lrange<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns the specified elements of the list stored at key. Redis Docs
§

fn lrem<'a, K, V, RV>( &'a mut self, key: K, count: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn ltrim<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn lset<'a, K, V, RV>( &'a mut self, key: K, index: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sets the list element at index to value Redis Docs
§

fn ping<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Sends a ping to the server Redis Docs
§

fn ping_message<'a, K, RV>( &'a mut self, message: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sends a ping with a message to the server Redis Docs
§

fn rpop<'a, K, RV>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn rpoplpush<'a, K, D, RV>( &'a mut self, key: K, dstkey: D, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn rpush<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn rpush_exists<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn sadd<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Add one or more members to a set. Redis Docs
§

fn scard<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the number of members in a set. Redis Docs
§

fn sdiff<'a, K, RV>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Subtract multiple sets. Redis Docs
§

fn sdiffstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn sinter<'a, K, RV>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Intersect multiple sets. Redis Docs
§

fn sinterstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn sismember<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Determine if a given value is a member of a set. Redis Docs
§

fn smismember<'a, K, M, RV>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Determine if given values are members of a set. Redis Docs
§

fn smembers<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get all the members in a set. Redis Docs
§

fn smove<'a, S, D, M, RV>( &'a mut self, srckey: S, dstkey: D, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Move a member from one set to another. Redis Docs
§

fn spop<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Remove and return a random member from a set. Redis Docs
§

fn srandmember<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get one random member from a set. Redis Docs
§

fn srandmember_multiple<'a, K, RV>( &'a mut self, key: K, count: usize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get multiple random members from a set. Redis Docs
§

fn srem<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Remove one or more members from a set. Redis Docs
§

fn sunion<'a, K, RV>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Add multiple sets. Redis Docs
§

fn sunionstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zadd<'a, K, S, M, RV>( &'a mut self, key: K, member: M, score: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zadd_multiple<'a, K, S, M, RV>( &'a mut self, key: K, items: &'a [(S, M)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zadd_options<'a, K, S, M, RV>( &'a mut self, key: K, member: M, score: S, options: &'a SortedSetAddOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zadd_multiple_options<'a, K, S, M, RV>( &'a mut self, key: K, items: &'a [(S, M)], options: &'a SortedSetAddOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zcard<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the number of members in a sorted set. Redis Docs
§

fn zcount<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zincr<'a, K, M, D, RV>( &'a mut self, key: K, member: M, delta: D, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zinterstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zinterstore_min<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zinterstore_max<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zinterstore_weights<'a, D, K, W, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zinterstore_min_weights<'a, D, K, W, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zinterstore_max_weights<'a, D, K, W, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zlexcount<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn bzpopmax<'a, K, RV>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zpopmax<'a, K, RV>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn bzpopmin<'a, K, RV>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zpopmin<'a, K, RV>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn bzmpop_max<'a, K, RV>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zmpop_max<'a, K, RV>( &'a mut self, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn bzmpop_min<'a, K, RV>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zmpop_min<'a, K, RV>( &'a mut self, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zrandmember<'a, K, RV>( &'a mut self, key: K, count: Option<isize>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrandmember_withscores<'a, K, RV>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrange<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrange_withscores<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrangebylex<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrangebylex_limit<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrevrangebylex<'a, K, MM, M, RV>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrevrangebylex_limit<'a, K, MM, M, RV>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrangebyscore<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrangebyscore_withscores<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrangebyscore_limit<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrangebyscore_limit_withscores<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrank<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Determine the index of a member in a sorted set. Redis Docs
§

fn zrem<'a, K, M, RV>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Remove one or more members from a sorted set. Redis Docs
§

fn zrembylex<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zremrangebyrank<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrembyscore<'a, K, M, MM, RV>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrevrange<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Return a range of members in a sorted set, by index, ordered from high to low. Redis Docs
§

fn zrevrange_withscores<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrevrangebyscore<'a, K, MM, M, RV>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrevrangebyscore_withscores<'a, K, MM, M, RV>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrevrangebyscore_limit<'a, K, MM, M, RV>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrevrangebyscore_limit_withscores<'a, K, MM, M, RV>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zrevrank<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zscore<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zscore_multiple<'a, K, M, RV>( &'a mut self, key: K, members: &'a [M], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zunionstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zunionstore_min<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zunionstore_max<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn zunionstore_weights<'a, D, K, W, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zunionstore_min_weights<'a, D, K, W, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn zunionstore_max_weights<'a, D, K, W, RV>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, 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. Redis Docs
§

fn pfadd<'a, K, E, RV>( &'a mut self, key: K, element: E, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Adds the specified elements to the specified HyperLogLog. Redis Docs
§

fn pfcount<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn pfmerge<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Merge N different HyperLogLogs into a single one. Redis Docs
§

fn publish<'a, K, E, RV>( &'a mut self, channel: K, message: E, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Posts a message to the given channel. Redis Docs
§

fn spublish<'a, K, E, RV>( &'a mut self, channel: K, message: E, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Posts a message to the given sharded channel. Redis Docs
§

fn object_encoding<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns the encoding of a key. Redis Docs
§

fn object_idletime<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn object_freq<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns the logarithmic access frequency counter of a key. Redis Docs
§

fn object_refcount<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns the reference count of a key. Redis Docs
§

fn client_getname<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Returns the name of the current connection as set by CLIENT SETNAME. Redis Docs
§

fn client_id<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Returns the ID of the current connection. Redis Docs
§

fn client_setname<'a, K, RV>( &'a mut self, connection_name: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Command assigns a name to the current connection. Redis Docs
§

fn acl_load<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

When Redis is configured to use an ACL file (with the aclfile configuration option), this command will reload the ACLs from the file, replacing all the current ACL rules with the ones defined in the file. Redis Docs
§

fn acl_save<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

When Redis is configured to use an ACL file (with the aclfile configuration option), this command will save the currently defined ACLs from the server memory to the ACL file. Redis Docs
§

fn acl_list<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Shows the currently active ACL rules in the Redis server. Redis Docs
§

fn acl_users<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Shows a list of all the usernames of the currently configured users in the Redis ACL system. Redis Docs
§

fn acl_getuser<'a, K, RV>( &'a mut self, username: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns all the rules defined for an existing ACL user. Redis Docs
§

fn acl_setuser<'a, K, RV>( &'a mut self, username: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Creates an ACL user without any privilege. Redis Docs
§

fn acl_setuser_rules<'a, K, RV>( &'a mut self, username: K, rules: &'a [Rule], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Creates an ACL user with the specified rules or modify the rules of an existing user. Redis Docs
§

fn acl_deluser<'a, K, RV>( &'a mut self, usernames: &'a [K], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Delete all the specified ACL users and terminate all the connections that are authenticated with such users. Redis Docs
§

fn acl_dryrun<'a, K, C, A, RV>( &'a mut self, username: K, command: C, args: A, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, A: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Simulate the execution of a given command by a given user. Redis Docs
§

fn acl_cat<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Shows the available ACL categories. Redis Docs
§

fn acl_cat_categoryname<'a, K, RV>( &'a mut self, categoryname: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Shows all the Redis commands in the specified category. Redis Docs
§

fn acl_genpass<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Generates a 256-bits password starting from /dev/urandom if available. Redis Docs
§

fn acl_genpass_bits<'a, RV>( &'a mut self, bits: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Generates a 1-to-1024-bits password starting from /dev/urandom if available. Redis Docs
§

fn acl_whoami<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Returns the username the current connection is authenticated with. Redis Docs
§

fn acl_log<'a, RV>( &'a mut self, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Shows a list of recent ACL security events Redis Docs
§

fn acl_log_reset<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Clears the ACL log. Redis Docs
§

fn acl_help<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Returns a helpful text describing the different subcommands. Redis Docs
§

fn geo_add<'a, K, M, RV>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Adds the specified geospatial items to the specified key. Read more
§

fn geo_dist<'a, K, M1, M2, RV>( &'a mut self, key: K, member1: M1, member2: M2, unit: Unit, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M1: ToRedisArgs + Send + Sync + 'a, M2: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Return the distance between two members in the geospatial index represented by the sorted set. Read more
§

fn geo_hash<'a, K, M, RV>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Return valid Geohash strings representing the position of one or more members of the geospatial index represented by the sorted set at key. Read more
§

fn geo_pos<'a, K, M, RV>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Return the positions of all the specified members of the geospatial index represented by the sorted set at key. Read more
§

fn geo_radius<'a, K, RV>( &'a mut self, key: K, longitude: f64, latitude: f64, radius: f64, unit: Unit, options: RadiusOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Return the members of a sorted set populated with geospatial information using geo_add, which are within the borders of the area specified with the center location and the maximum distance from the center (the radius). Read more
§

fn geo_radius_by_member<'a, K, M, RV>( &'a mut self, key: K, member: M, radius: f64, unit: Unit, options: RadiusOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Retrieve members selected by distance with the center of member. The member itself is always contained in the results. Redis Docs
§

fn xack<'a, K, G, I, RV>( &'a mut self, key: K, group: G, ids: &'a [I], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, I: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Ack pending stream messages checked out by a consumer. Read more
§

fn xadd<'a, K, ID, F, V, RV>( &'a mut self, key: K, id: ID, items: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Add a stream message by key. Use * as the id for the current timestamp. Read more
§

fn xadd_map<'a, K, ID, BTM, RV>( &'a mut self, key: K, id: ID, map: BTM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, BTM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

BTreeMap variant for adding a stream message by key. Use * as the id for the current timestamp. Read more
§

fn xadd_options<'a, K, ID, I, RV>( &'a mut self, key: K, id: ID, items: I, options: &'a StreamAddOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, I: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Add a stream message with options. Read more
§

fn xadd_maxlen<'a, K, ID, F, V, RV>( &'a mut self, key: K, maxlen: StreamMaxlen, id: ID, items: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Add a stream message while capping the stream at a maxlength. Read more
§

fn xadd_maxlen_map<'a, K, ID, BTM, RV>( &'a mut self, key: K, maxlen: StreamMaxlen, id: ID, map: BTM, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, BTM: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

BTreeMap variant for adding a stream message while capping the stream at a maxlength. Read more
§

fn xautoclaim_options<'a, K, G, C, MIT, S, RV>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, start: S, options: StreamAutoClaimOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Perform a combined xpending and xclaim flow. Read more
§

fn xclaim<'a, K, G, C, MIT, ID, RV>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, ids: &'a [ID], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Claim pending, unacked messages, after some period of time, currently checked out by another consumer. Read more
§

fn xclaim_options<'a, K, G, C, MIT, ID, RV>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, ids: &'a [ID], options: StreamClaimOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This is the optional arguments version for claiming unacked, pending messages currently checked out by another consumer. Read more
§

fn xdel<'a, K, ID, RV>( &'a mut self, key: K, ids: &'a [ID], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Deletes a list of ids for a given stream key. Read more
§

fn xdel_ex<'a, K, ID, RV>( &'a mut self, key: K, ids: &'a [ID], options: StreamDeletionPolicy, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

An extension of the Streams XDEL command that provides finer control over how message entries are deleted with respect to consumer groups.
§

fn xack_del<'a, K, G, ID, RV>( &'a mut self, key: K, group: G, ids: &'a [ID], options: StreamDeletionPolicy, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

A combination of XACK and XDEL that acknowledges and attempts to delete a list of ids for a given stream key and consumer group.
§

fn xgroup_create<'a, K, G, ID, RV>( &'a mut self, key: K, group: G, id: ID, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This command is used for creating a consumer group. It expects the stream key to already exist. Otherwise, use xgroup_create_mkstream if it doesn’t. The id is the starting message id all consumers should read from. Use $ If you want all consumers to read from the last message added to stream. Read more
§

fn xgroup_createconsumer<'a, K, G, C, RV>( &'a mut self, key: K, group: G, consumer: C, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This creates a consumer explicitly (vs implicit via XREADGROUP) for given stream `key. Read more
§

fn xgroup_create_mkstream<'a, K, G, ID, RV>( &'a mut self, key: K, group: G, id: ID, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This is the alternate version for creating a consumer group which makes the stream if it doesn’t exist. Read more
§

fn xgroup_setid<'a, K, G, ID, RV>( &'a mut self, key: K, group: G, id: ID, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Alter which id you want consumers to begin reading from an existing consumer group. Read more
§

fn xgroup_destroy<'a, K, G, RV>( &'a mut self, key: K, group: G, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Destroy an existing consumer group for a given stream key Read more
§

fn xgroup_delconsumer<'a, K, G, C, RV>( &'a mut self, key: K, group: G, consumer: C, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This deletes a consumer from an existing consumer group for given stream `key. Read more
§

fn xinfo_consumers<'a, K, G, RV>( &'a mut self, key: K, group: G, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This returns all info details about which consumers have read messages for given consumer group. Take note of the StreamInfoConsumersReply return type. Read more
§

fn xinfo_groups<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns all consumer groups created for a given stream key. Take note of the StreamInfoGroupsReply return type. Read more
§

fn xinfo_stream<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns info about high-level stream details (first & last message id, length, number of groups, etc.) Take note of the StreamInfoStreamReply return type. Read more
§

fn xlen<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns the number of messages for a given stream key. Read more
§

fn xpending<'a, K, G, RV>( &'a mut self, key: K, group: G, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This is a basic version of making XPENDING command calls which only passes a stream key and consumer group and it returns details about which consumers have pending messages that haven’t been acked. Read more
§

fn xpending_count<'a, K, G, S, E, C, RV>( &'a mut self, key: K, group: G, start: S, end: E, count: C, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This XPENDING version returns a list of all messages over the range. You can use this for paginating pending messages (but without the message HashMap). Read more
§

fn xpending_consumer_count<'a, K, G, S, E, C, CN, RV>( &'a mut self, key: K, group: G, start: S, end: E, count: C, consumer: CN, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, CN: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

An alternate version of xpending_count which filters by consumer name. Read more
§

fn xrange<'a, K, S, E, RV>( &'a mut self, key: K, start: S, end: E, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Returns a range of messages in a given stream key. Read more
§

fn xrange_all<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

A helper method for automatically returning all messages in a stream by key. Use with caution! Read more
§

fn xrange_count<'a, K, S, E, C, RV>( &'a mut self, key: K, start: S, end: E, count: C, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

A method for paginating a stream by key. Read more
§

fn xread<'a, K, ID, RV>( &'a mut self, keys: &'a [K], ids: &'a [ID], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Read a list of ids for each stream key. This is the basic form of reading streams. For more advanced control, like blocking, limiting, or reading by consumer group, see xread_options. Read more
§

fn xread_options<'a, K, ID, RV>( &'a mut self, keys: &'a [K], ids: &'a [ID], options: &'a StreamReadOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

This method handles setting optional arguments for XREAD or XREADGROUP Redis commands. Read more
§

fn xrevrange<'a, K, E, S, RV>( &'a mut self, key: K, end: E, start: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn xrevrange_all<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn xrevrange_count<'a, K, E, S, C, RV>( &'a mut self, key: K, end: E, start: S, count: C, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

fn xtrim<'a, K, RV>( &'a mut self, key: K, maxlen: StreamMaxlen, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Trim a stream key to a MAXLEN count. Read more
§

fn xtrim_options<'a, K, RV>( &'a mut self, key: K, options: &'a StreamTrimOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Trim a stream key with full options Read more
§

fn load_script<'a, RV>( &'a mut self, script: &'a Script, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Load a script. Read more
§

fn invoke_script<'a, RV>( &'a mut self, invocation: &'a ScriptInvocation<'a>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Invoke a prepared script. Read more
§

fn flushall<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Deletes all the keys of all databases Read more
§

fn flushall_options<'a, RV>( &'a mut self, options: &'a FlushAllOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Deletes all the keys of all databases with options Read more
§

fn flushdb<'a, RV>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Deletes all the keys of the current database Read more
§

fn flushdb_options<'a, RV>( &'a mut self, options: &'a FlushAllOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Deletes all the keys of the current database with options Read more
§

fn scan<RV>( &mut self, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where RV: FromRedisValue,

Incrementally iterate the keys space.
§

fn scan_options<RV>( &mut self, opts: ScanOptions, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where RV: FromRedisValue,

Incrementally iterate the keys space with options.
§

fn scan_match<P, RV>( &mut self, pattern: P, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate the keys space for keys matching a pattern.
§

fn hscan<K, RV>( &mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate hash fields and associated values.
§

fn hscan_match<K, P, RV>( &mut self, key: K, pattern: P, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

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

fn sscan<K, RV>( &mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate set elements.
§

fn sscan_match<K, P, RV>( &mut self, key: K, pattern: P, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate set elements for elements matching a pattern.
§

fn zscan<K, RV>( &mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate sorted set elements.
§

fn zscan_match<K, P, RV>( &mut self, key: K, pattern: P, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

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

impl<T> AsyncTypedCommands for T
where T: ConnectionLike + Send + Sync,

§

fn get<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the value of a key. If key is a vec this becomes an MGET (if using TypedCommands, you should specifically use mget to get the correct return type. Redis Docs
§

fn mget<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<Option<String>>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get values of keys Redis Docs
§

fn keys<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Gets all keys matching pattern Redis Docs
§

fn set<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Set the string value of a key. Redis Docs
§

fn set_options<'a, K, V>( &'a mut self, key: K, value: V, options: SetOptions, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Set the string value of a key with options. Redis Docs
§

fn set_multiple<'a, K, V>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn mset<'a, K, V>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets multiple keys to their values. Redis Docs
§

fn set_ex<'a, K, V>( &'a mut self, key: K, value: V, seconds: u64, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Set the value and expiration of a key. Redis Docs
§

fn pset_ex<'a, K, V>( &'a mut self, key: K, value: V, milliseconds: u64, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn set_nx<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn mset_nx<'a, K, V>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn getset<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn getrange<'a, K>( &'a mut self, key: K, from: isize, to: isize, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value. Redis returns an empty string if the key doesn’t exist, not Nil Redis Docs
§

fn setrange<'a, K, V>( &'a mut self, key: K, offset: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn del<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Delete one or more keys. Returns the number of keys deleted. Redis Docs
§

fn exists<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Determine if a key exists. Redis Docs
§

fn key_type<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<ValueType, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Determine the type of key. Redis Docs
§

fn expire<'a, K>( &'a mut self, key: K, seconds: i64, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Set a key’s time to live in seconds. Returns whether expiration was set. Redis Docs
§

fn expire_at<'a, K>( &'a mut self, key: K, ts: i64, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Set the expiration for a key as a UNIX timestamp. Returns whether expiration was set. Redis Docs
§

fn pexpire<'a, K>( &'a mut self, key: K, ms: i64, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Set a key’s time to live in milliseconds. Returns whether expiration was set. Redis Docs
§

fn pexpire_at<'a, K>( &'a mut self, key: K, ts: i64, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Set the expiration for a key as a UNIX timestamp in milliseconds. Returns whether expiration was set. Redis Docs
§

fn expire_time<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the absolute Unix expiration timestamp in seconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
§

fn pexpire_time<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the absolute Unix expiration timestamp in milliseconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
§

fn persist<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Remove the expiration from a key. Returns whether a timeout was removed. Redis Docs
§

fn ttl<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the time to live for a key in seconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
§

fn pttl<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the time to live for a key in milliseconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
§

fn get_ex<'a, K>( &'a mut self, key: K, expire_at: Expiry, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the value of a key and set expiration Redis Docs
§

fn get_del<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the value of a key and delete it Redis Docs
§

fn copy<'a, KSrc, KDst, Db>( &'a mut self, source: KSrc, destination: KDst, options: CopyOptions<Db>, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where KSrc: ToRedisArgs + Send + Sync + 'a, KDst: ToRedisArgs + Send + Sync + 'a, Db: ToString + Send + Sync + 'a,

Copy the value from one key to another, returning whether the copy was successful. Redis Docs
§

fn rename<'a, K, N>( &'a mut self, key: K, new_key: N, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a,

Rename a key. Errors if key does not exist. Redis Docs
§

fn rename_nx<'a, K, N>( &'a mut self, key: K, new_key: N, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a,

Rename a key, only if the new key does not exist. Errors if key does not exist. Returns whether the key was renamed, or false if the new key already exists. Redis Docs
Unlink one or more keys. This is a non-blocking version of DEL. Returns number of keys unlinked. Redis Docs
§

fn append<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Append a value to a key. Returns length of string after operation. Redis Docs
§

fn incr<'a, K, V>( &'a mut self, key: K, delta: V, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type. If the key does not exist, it is set to 0 before performing the operation.
§

fn decr<'a, K, V>( &'a mut self, key: K, delta: V, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Decrement the numeric value of a key by the given amount. If the key does not exist, it is set to 0 before performing the operation. Redis Docs
§

fn setbit<'a, K>( &'a mut self, key: K, offset: usize, value: bool, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Sets or clears the bit at offset in the string value stored at key. Returns the original bit value stored at offset. Redis Docs
§

fn getbit<'a, K>( &'a mut self, key: K, offset: usize, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn bitcount<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Count set bits in a string. Returns 0 if key does not exist. Redis Docs
§

fn bitcount_range<'a, K>( &'a mut self, key: K, start: usize, end: usize, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Count set bits in a string in a range. Returns 0 if key does not exist. Redis Docs
§

fn bit_and<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
§

fn bit_or<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
§

fn bit_xor<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
§

fn bit_not<'a, D, S>( &'a mut self, dstkey: D, srckey: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
§

fn bit_diff<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

DIFF(X, Y1, Y2, …)
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
§

fn bit_diff1<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

DIFF1(X, Y1, Y2, …) (Relative complement difference)
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§

fn bit_and_or<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

ANDOR(X, Y1, Y2, …)
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§

fn bit_one<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

ONE(X, Y1, Y2, …)
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
§

fn strlen<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the length of the value stored in a key. 0 if key does not exist. Redis Docs
§

fn hget<'a, K, F>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

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

fn hmget<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Gets multiple fields from a hash. Redis Docs
§

fn hget_ex<'a, K, F>( &'a mut self, key: K, fields: F, expire_at: Expiry, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Get the value of one or more fields of a given hash key, and optionally set their expiration Redis Docs
§

fn hdel<'a, K, F>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Deletes a single (or multiple) fields from a hash. Returns number of fields deleted. Redis Docs
§

fn hget_del<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<Option<String>>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Get and delete the value of one or more fields of a given hash key Redis Docs
§

fn hset<'a, K, F, V>( &'a mut self, key: K, field: F, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets a single field in a hash. Returns number of fields added. Redis Docs
§

fn hset_ex<'a, K, F, V>( &'a mut self, key: K, hash_field_expiration_options: &'a HashFieldExpirationOptions, fields_values: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Set the value of one or more fields of a given hash key, and optionally set their expiration Redis Docs
§

fn hset_nx<'a, K, F, V>( &'a mut self, key: K, field: F, value: V, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets a single field in a hash if it does not exist. Returns whether the field was added. Redis Docs
§

fn hset_multiple<'a, K, F, V>( &'a mut self, key: K, items: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets multiple fields in a hash. Redis Docs
§

fn hincr<'a, K, F, D>( &'a mut self, key: K, field: F, delta: D, ) -> Pin<Box<dyn Future<Output = Result<f64, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a,

Increments a value. Returns the new value of the field after incrementation.
§

fn hexists<'a, K, F>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Checks if a field in a hash exists. Redis Docs
§

fn httl<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Get one or more fields’ TTL in seconds. Redis Docs
§

fn hpttl<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Get one or more fields’ TTL in milliseconds. Redis Docs
§

fn hexpire<'a, K, F>( &'a mut self, key: K, seconds: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Set one or more fields’ time to live in seconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with 0 seconds. Errors if provided key exists but is not a hash. Redis Docs
§

fn hexpire_at<'a, K, F>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Set the expiration for one or more fields as a UNIX timestamp in seconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with a time in the past. Errors if provided key exists but is not a hash. Redis Docs
§

fn hexpire_time<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Returns the absolute Unix expiration timestamp in seconds. Redis Docs
§

fn hpersist<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Remove the expiration from a key. Returns 1 if the expiration was removed. Redis Docs
§

fn hpexpire<'a, K, F>( &'a mut self, key: K, milliseconds: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Set one or more fields’ time to live in milliseconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with 0 seconds. Errors if provided key exists but is not a hash. Redis Docs
§

fn hpexpire_at<'a, K, F>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Set the expiration for one or more fields as a UNIX timestamp in milliseconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with a time in the past. Errors if provided key exists but is not a hash. Redis Docs
§

fn hpexpire_time<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Returns the absolute Unix expiration timestamp in seconds. Redis Docs
§

fn hkeys<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Gets all the keys in a hash. Redis Docs
§

fn hvals<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Gets all the values in a hash. Redis Docs
§

fn hgetall<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<HashMap<String, String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Gets all the fields and values in a hash. Redis Docs
§

fn hlen<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Gets the length of a hash. Returns 0 if key does not exist. Redis Docs
§

fn blmove<'a, S, D>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a,

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

fn blmpop<'a, K>( &'a mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn blpop<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn brpop<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn brpoplpush<'a, S, D>( &'a mut self, srckey: S, dstkey: D, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a,

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

fn lindex<'a, K>( &'a mut self, key: K, index: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get an element from a list by its index. Redis Docs
§

fn linsert_before<'a, K, P, V>( &'a mut self, key: K, pivot: P, value: V, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Insert an element before another element in a list. Redis Docs
§

fn linsert_after<'a, K, P, V>( &'a mut self, key: K, pivot: P, value: V, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Insert an element after another element in a list. Redis Docs
§

fn llen<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns the length of the list stored at key. Redis Docs
§

fn lmove<'a, S, D>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
where S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a,

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

fn lmpop<'a, K>( &'a mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<String>)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn lpop<'a, RV, K>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue, K: ToRedisArgs + Send + Sync + 'a,

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

fn lpos<'a, RV, K, V>( &'a mut self, key: K, value: V, options: LposOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn lpush<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn lpush_exists<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn lrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns the specified elements of the list stored at key. Redis Docs
§

fn lrem<'a, K, V>( &'a mut self, key: K, count: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn ltrim<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn lset<'a, K, V>( &'a mut self, key: K, index: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets the list element at index to value Redis Docs
§

fn ping<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>

Sends a ping to the server Redis Docs
§

fn ping_message<'a, K>( &'a mut self, message: K, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Sends a ping with a message to the server Redis Docs
§

fn rpop<'a, RV, K>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue, K: ToRedisArgs + Send + Sync + 'a,

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

fn rpoplpush<'a, K, D>( &'a mut self, key: K, dstkey: D, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a,

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

fn rpush<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn rpush_exists<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn sadd<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Add one or more members to a set. Redis Docs
§

fn scard<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the number of members in a set. Redis Docs
§

fn sdiff<'a, K>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Subtract multiple sets. Redis Docs
§

fn sdiffstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn sinter<'a, K>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Intersect multiple sets. Redis Docs
§

fn sinterstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn sismember<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Determine if a given value is a member of a set. Redis Docs
§

fn smismember<'a, K, M>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<bool>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Determine if given values are members of a set. Redis Docs
§

fn smembers<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get all the members in a set. Redis Docs
§

fn smove<'a, S, D, M>( &'a mut self, srckey: S, dstkey: D, member: M, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Move a member from one set to another. Redis Docs
§

fn spop<'a, RV, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue, K: ToRedisArgs + Send + Sync + 'a,

Remove and return a random member from a set. Redis Docs
§

fn srandmember<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get one random member from a set. Redis Docs
§

fn srandmember_multiple<'a, K>( &'a mut self, key: K, count: usize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get multiple random members from a set. Redis Docs
§

fn srem<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Remove one or more members from a set. Redis Docs
§

fn sunion<'a, K>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Add multiple sets. Redis Docs
§

fn sunionstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zadd<'a, K, S, M>( &'a mut self, key: K, member: M, score: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zadd_multiple<'a, K, S, M>( &'a mut self, key: K, items: &'a [(S, M)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zadd_options<'a, K, S, M>( &'a mut self, key: K, member: M, score: S, options: &'a SortedSetAddOptions, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zadd_multiple_options<'a, K, S, M>( &'a mut self, key: K, items: &'a [(S, M)], options: &'a SortedSetAddOptions, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zcard<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get the number of members in a sorted set. Redis Docs
§

fn zcount<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zincr<'a, K, M, D>( &'a mut self, key: K, member: M, delta: D, ) -> Pin<Box<dyn Future<Output = Result<f64, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
§

fn zinterstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zinterstore_min<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zinterstore_max<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zinterstore_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

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

fn zinterstore_min_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

[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. Redis Docs
§

fn zinterstore_max_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

[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. Redis Docs
§

fn zlexcount<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn bzpopmax<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, String, f64)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn zpopmax<'a, K>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn bzpopmin<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, String, f64)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn zpopmin<'a, K>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn bzmpop_max<'a, K>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
§

fn zmpop_max<'a, K>( &'a mut self, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
§

fn bzmpop_min<'a, K>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
§

fn zmpop_min<'a, K>( &'a mut self, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
§

fn zrandmember<'a, RV, K>( &'a mut self, key: K, count: Option<isize>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue, K: ToRedisArgs + Send + Sync + 'a,

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

fn zrandmember_withscores<'a, RV, K>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue, K: ToRedisArgs + Send + Sync + 'a,

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

fn zrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn zrange_withscores<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<(String, f64)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn zrangebylex<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zrangebylex_limit<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zrevrangebylex<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zrevrangebylex_limit<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zrangebyscore<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zrangebyscore_withscores<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<Vec<(String, usize)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zrangebyscore_limit<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zrangebyscore_limit_withscores<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<(String, usize)>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zrank<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Determine the index of a member in a sorted set. Redis Docs
§

fn zrem<'a, K, M>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Remove one or more members from a sorted set. Redis Docs
§

fn zrembylex<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zremrangebyrank<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn zrembyscore<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a,

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

fn zrevrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Return a range of members in a sorted set, by index, ordered from high to low. Redis Docs
§

fn zrevrange_withscores<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn zrevrangebyscore<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zrevrangebyscore_withscores<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zrevrangebyscore_limit<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zrevrangebyscore_limit_withscores<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zrevrank<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zscore<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<Option<f64>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zscore_multiple<'a, K, M>( &'a mut self, key: K, members: &'a [M], ) -> Pin<Box<dyn Future<Output = Result<Option<Vec<f64>>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zunionstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zunionstore_min<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zunionstore_max<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zunionstore_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

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

fn zunionstore_min_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

[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. Redis Docs
§

fn zunionstore_max_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

[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. Redis Docs
§

fn pfadd<'a, K, E>( &'a mut self, key: K, element: E, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a,

Adds the specified elements to the specified HyperLogLog. Redis Docs
§

fn pfcount<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn pfmerge<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Merge N different HyperLogLogs into a single one. Redis Docs
§

fn publish<'a, K, E>( &'a mut self, channel: K, message: E, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a,

Posts a message to the given channel. Redis Docs
§

fn spublish<'a, K, E>( &'a mut self, channel: K, message: E, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a,

Posts a message to the given sharded channel. Redis Docs
§

fn object_encoding<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns the encoding of a key. Redis Docs
§

fn object_idletime<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn object_freq<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns the logarithmic access frequency counter of a key. Redis Docs
§

fn object_refcount<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns the reference count of a key. Redis Docs
§

fn client_getname<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>

Returns the name of the current connection as set by CLIENT SETNAME. Redis Docs
§

fn client_id<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>

Returns the ID of the current connection. Redis Docs
§

fn client_setname<'a, K>( &'a mut self, connection_name: K, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Command assigns a name to the current connection. Redis Docs
§

fn acl_load<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>

When Redis is configured to use an ACL file (with the aclfile configuration option), this command will reload the ACLs from the file, replacing all the current ACL rules with the ones defined in the file. Redis Docs
§

fn acl_save<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>

When Redis is configured to use an ACL file (with the aclfile configuration option), this command will save the currently defined ACLs from the server memory to the ACL file. Redis Docs
§

fn acl_list<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>

Shows the currently active ACL rules in the Redis server. Redis Docs
§

fn acl_users<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>

Shows a list of all the usernames of the currently configured users in the Redis ACL system. Redis Docs
§

fn acl_getuser<'a, K>( &'a mut self, username: K, ) -> Pin<Box<dyn Future<Output = Result<Option<AclInfo>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns all the rules defined for an existing ACL user. Redis Docs
§

fn acl_setuser<'a, K>( &'a mut self, username: K, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Creates an ACL user without any privilege. Redis Docs
§

fn acl_setuser_rules<'a, K>( &'a mut self, username: K, rules: &'a [Rule], ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Creates an ACL user with the specified rules or modify the rules of an existing user. Redis Docs
§

fn acl_deluser<'a, K>( &'a mut self, usernames: &'a [K], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Delete all the specified ACL users and terminate all the connections that are authenticated with such users. Redis Docs
§

fn acl_dryrun<'a, K, C, A>( &'a mut self, username: K, command: C, args: A, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, A: ToRedisArgs + Send + Sync + 'a,

Simulate the execution of a given command by a given user. Redis Docs
§

fn acl_cat<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>

Shows the available ACL categories. Redis Docs
§

fn acl_cat_categoryname<'a, K>( &'a mut self, categoryname: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Shows all the Redis commands in the specified category. Redis Docs
§

fn acl_genpass<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>

Generates a 256-bits password starting from /dev/urandom if available. Redis Docs
§

fn acl_genpass_bits<'a>( &'a mut self, bits: isize, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>

Generates a 1-to-1024-bits password starting from /dev/urandom if available. Redis Docs
§

fn acl_whoami<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>

Returns the username the current connection is authenticated with. Redis Docs
§

fn acl_log<'a>( &'a mut self, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>

Shows a list of recent ACL security events Redis Docs
§

fn acl_log_reset<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>

Clears the ACL log. Redis Docs
§

fn acl_help<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>

Returns a helpful text describing the different subcommands. Redis Docs
§

fn geo_add<'a, K, M>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Adds the specified geospatial items to the specified key. Read more
§

fn geo_dist<'a, K, M1, M2>( &'a mut self, key: K, member1: M1, member2: M2, unit: Unit, ) -> Pin<Box<dyn Future<Output = Result<Option<f64>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M1: ToRedisArgs + Send + Sync + 'a, M2: ToRedisArgs + Send + Sync + 'a,

Return the distance between two members in the geospatial index represented by the sorted set. Read more
§

fn geo_hash<'a, K, M>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Return valid Geohash strings representing the position of one or more members of the geospatial index represented by the sorted set at key. Read more
§

fn geo_pos<'a, K, M>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<Option<Coord<f64>>>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Return the positions of all the specified members of the geospatial index represented by the sorted set at key. Read more
§

fn geo_radius<'a, K>( &'a mut self, key: K, longitude: f64, latitude: f64, radius: f64, unit: Unit, options: RadiusOptions, ) -> Pin<Box<dyn Future<Output = Result<Vec<RadiusSearchResult>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Return the members of a sorted set populated with geospatial information using geo_add, which are within the borders of the area specified with the center location and the maximum distance from the center (the radius). Read more
§

fn geo_radius_by_member<'a, K, M>( &'a mut self, key: K, member: M, radius: f64, unit: Unit, options: RadiusOptions, ) -> Pin<Box<dyn Future<Output = Result<Vec<RadiusSearchResult>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Retrieve members selected by distance with the center of member. The member itself is always contained in the results. Redis Docs
§

fn xack<'a, K, G, I>( &'a mut self, key: K, group: G, ids: &'a [I], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, I: ToRedisArgs + Send + Sync + 'a,

Ack pending stream messages checked out by a consumer. Read more
§

fn xadd<'a, K, ID, F, V>( &'a mut self, key: K, id: ID, items: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Add a stream message by key. Use * as the id for the current timestamp. Read more
§

fn xadd_map<'a, K, ID, BTM>( &'a mut self, key: K, id: ID, map: BTM, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, BTM: ToRedisArgs + Send + Sync + 'a,

BTreeMap variant for adding a stream message by key. Use * as the id for the current timestamp. Read more
§

fn xadd_options<'a, K, ID, I>( &'a mut self, key: K, id: ID, items: I, options: &'a StreamAddOptions, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, I: ToRedisArgs + Send + Sync + 'a,

Add a stream message with options. Read more
§

fn xadd_maxlen<'a, K, ID, F, V>( &'a mut self, key: K, maxlen: StreamMaxlen, id: ID, items: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Add a stream message while capping the stream at a maxlength. Read more
§

fn xadd_maxlen_map<'a, K, ID, BTM>( &'a mut self, key: K, maxlen: StreamMaxlen, id: ID, map: BTM, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, BTM: ToRedisArgs + Send + Sync + 'a,

BTreeMap variant for adding a stream message while capping the stream at a maxlength. Read more
§

fn xautoclaim_options<'a, K, G, C, MIT, S>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, start: S, options: StreamAutoClaimOptions, ) -> Pin<Box<dyn Future<Output = Result<StreamAutoClaimReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Perform a combined xpending and xclaim flow. Read more
§

fn xclaim<'a, K, G, C, MIT, ID>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, ids: &'a [ID], ) -> Pin<Box<dyn Future<Output = Result<StreamClaimReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

Claim pending, unacked messages, after some period of time, currently checked out by another consumer. Read more
§

fn xclaim_options<'a, RV, K, G, C, MIT, ID>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, ids: &'a [ID], options: StreamClaimOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

This is the optional arguments version for claiming unacked, pending messages currently checked out by another consumer. Read more
§

fn xdel<'a, K, ID>( &'a mut self, key: K, ids: &'a [ID], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

Deletes a list of ids for a given stream key. Read more
§

fn xdel_ex<'a, K, ID>( &'a mut self, key: K, ids: &'a [ID], options: StreamDeletionPolicy, ) -> Pin<Box<dyn Future<Output = Result<Vec<XDelExStatusCode>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

An extension of the Streams XDEL command that provides finer control over how message entries are deleted with respect to consumer groups.
§

fn xack_del<'a, K, G, ID>( &'a mut self, key: K, group: G, ids: &'a [ID], options: StreamDeletionPolicy, ) -> Pin<Box<dyn Future<Output = Result<Vec<XAckDelStatusCode>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

A combination of XACK and XDEL that acknowledges and attempts to delete a list of ids for a given stream key and consumer group.
§

fn xgroup_create<'a, K, G, ID>( &'a mut self, key: K, group: G, id: ID, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

This command is used for creating a consumer group. It expects the stream key to already exist. Otherwise, use xgroup_create_mkstream if it doesn’t. The id is the starting message id all consumers should read from. Use $ If you want all consumers to read from the last message added to stream. Read more
§

fn xgroup_createconsumer<'a, K, G, C>( &'a mut self, key: K, group: G, consumer: C, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a,

This creates a consumer explicitly (vs implicit via XREADGROUP) for given stream `key. Read more
§

fn xgroup_create_mkstream<'a, K, G, ID>( &'a mut self, key: K, group: G, id: ID, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

This is the alternate version for creating a consumer group which makes the stream if it doesn’t exist. Read more
§

fn xgroup_setid<'a, K, G, ID>( &'a mut self, key: K, group: G, id: ID, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

Alter which id you want consumers to begin reading from an existing consumer group. Read more
§

fn xgroup_destroy<'a, K, G>( &'a mut self, key: K, group: G, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a,

Destroy an existing consumer group for a given stream key Read more
§

fn xgroup_delconsumer<'a, K, G, C>( &'a mut self, key: K, group: G, consumer: C, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a,

This deletes a consumer from an existing consumer group for given stream `key. Read more
§

fn xinfo_consumers<'a, K, G>( &'a mut self, key: K, group: G, ) -> Pin<Box<dyn Future<Output = Result<StreamInfoConsumersReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a,

This returns all info details about which consumers have read messages for given consumer group. Take note of the StreamInfoConsumersReply return type. Read more
§

fn xinfo_groups<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<StreamInfoGroupsReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns all consumer groups created for a given stream key. Take note of the StreamInfoGroupsReply return type. Read more
§

fn xinfo_stream<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<StreamInfoStreamReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns info about high-level stream details (first & last message id, length, number of groups, etc.) Take note of the StreamInfoStreamReply return type. Read more
§

fn xlen<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Returns the number of messages for a given stream key. Read more
§

fn xpending<'a, K, G>( &'a mut self, key: K, group: G, ) -> Pin<Box<dyn Future<Output = Result<StreamPendingReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a,

This is a basic version of making XPENDING command calls which only passes a stream key and consumer group and it returns details about which consumers have pending messages that haven’t been acked. Read more
§

fn xpending_count<'a, K, G, S, E, C>( &'a mut self, key: K, group: G, start: S, end: E, count: C, ) -> Pin<Box<dyn Future<Output = Result<StreamPendingCountReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a,

This XPENDING version returns a list of all messages over the range. You can use this for paginating pending messages (but without the message HashMap). Read more
§

fn xpending_consumer_count<'a, K, G, S, E, C, CN>( &'a mut self, key: K, group: G, start: S, end: E, count: C, consumer: CN, ) -> Pin<Box<dyn Future<Output = Result<StreamPendingCountReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, CN: ToRedisArgs + Send + Sync + 'a,

An alternate version of xpending_count which filters by consumer name. Read more
§

fn xrange<'a, K, S, E>( &'a mut self, key: K, start: S, end: E, ) -> Pin<Box<dyn Future<Output = Result<StreamRangeReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a,

Returns a range of messages in a given stream key. Read more
§

fn xrange_all<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<StreamRangeReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

A helper method for automatically returning all messages in a stream by key. Use with caution! Read more
§

fn xrange_count<'a, K, S, E, C>( &'a mut self, key: K, start: S, end: E, count: C, ) -> Pin<Box<dyn Future<Output = Result<StreamRangeReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a,

A method for paginating a stream by key. Read more
§

fn xread<'a, K, ID>( &'a mut self, keys: &'a [K], ids: &'a [ID], ) -> Pin<Box<dyn Future<Output = Result<Option<StreamReadReply>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

Read a list of ids for each stream key. This is the basic form of reading streams. For more advanced control, like blocking, limiting, or reading by consumer group, see xread_options. Read more
§

fn xread_options<'a, K, ID>( &'a mut self, keys: &'a [K], ids: &'a [ID], options: &'a StreamReadOptions, ) -> Pin<Box<dyn Future<Output = Result<Option<StreamReadReply>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a,

This method handles setting optional arguments for XREAD or XREADGROUP Redis commands. Read more
§

fn xrevrange<'a, K, E, S>( &'a mut self, key: K, end: E, start: S, ) -> Pin<Box<dyn Future<Output = Result<StreamRangeReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

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

fn xrevrange_all<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<StreamRangeReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn xrevrange_count<'a, K, E, S, C>( &'a mut self, key: K, end: E, start: S, count: C, ) -> Pin<Box<dyn Future<Output = Result<StreamRangeReply, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a,

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

fn xtrim<'a, K>( &'a mut self, key: K, maxlen: StreamMaxlen, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Trim a stream key to a MAXLEN count. Read more
§

fn xtrim_options<'a, K>( &'a mut self, key: K, options: &'a StreamTrimOptions, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Trim a stream key with full options Read more
§

fn load_script<'a, RV>( &'a mut self, script: &'a Script, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Load a script. Read more
§

fn invoke_script<'a, RV>( &'a mut self, invocation: &'a ScriptInvocation<'a>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
where RV: FromRedisValue,

Invoke a prepared script. Read more
§

fn flushall<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>

Deletes all the keys of all databases Read more
§

fn flushall_options<'a>( &'a mut self, options: &'a FlushAllOptions, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>

Deletes all the keys of all databases with options Read more
§

fn flushdb<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>

Deletes all the keys of the current database Read more
§

fn flushdb_options<'a>( &'a mut self, options: &'a FlushAllOptions, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>

Deletes all the keys of the current database with options Read more
§

fn scan<RV>( &mut self, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where RV: FromRedisValue,

Incrementally iterate the keys space.
§

fn scan_options<RV>( &mut self, opts: ScanOptions, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where RV: FromRedisValue,

Incrementally iterate the keys space with options.
§

fn scan_match<P, RV>( &mut self, pattern: P, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate the keys space for keys matching a pattern.
§

fn hscan<K, RV>( &mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate hash fields and associated values.
§

fn hscan_match<K, P, RV>( &mut self, key: K, pattern: P, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

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

fn sscan<K, RV>( &mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate set elements.
§

fn sscan_match<K, P, RV>( &mut self, key: K, pattern: P, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate set elements for elements matching a pattern.
§

fn zscan<K, RV>( &mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate sorted set elements.
§

fn zscan_match<K, P, RV>( &mut self, key: K, pattern: P, ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

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

fn get_int<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<isize>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get a value from Redis and convert it to an Option<isize>.
§

fn mget_ints<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<Option<isize>>, RedisError>> + Send + 'a>>
where K: ToRedisArgs + Send + Sync + 'a,

Get values from Redis and convert them to Option<isize>s.
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> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
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.
§

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

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

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

§

impl<T> MaybeSend for T
where T: Send,