Struct ConnectionManager

Source
pub struct ConnectionManager(/* private fields */);
Expand description

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

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

§Behavior

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

Implementations§

Source§

impl ConnectionManager

Source

pub async fn new(client: Client) -> Result<ConnectionManager, RedisError>

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

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

Source

pub async fn new_with_backoff( client: Client, exponent_base: u64, factor: u64, number_of_retries: usize, ) -> Result<ConnectionManager, RedisError>

👎Deprecated: Use new_with_config

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

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

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

Source

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

👎Deprecated: Use new_with_config

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

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

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

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

Source

pub async fn new_with_config( client: Client, config: ConnectionManagerConfig, ) -> Result<ConnectionManager, RedisError>

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

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

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

Apply a maximum delay. No retry delay will be longer than this ConnectionManagerConfig.max_delay` .

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

Source

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

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

Source

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

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

Source

pub async fn subscribe( &mut self, channel_name: impl ToRedisArgs, ) -> Result<(), RedisError>

Subscribes to a new channel(s).

Updates from the sender will be sent on the push sender that was passed to the manager. If the manager was configured without a push sender, the connection won’t be able to pass messages back to the user.

This method is only available when the connection is using RESP3 protocol, and will return an error otherwise. It should be noted that unless ConnectionManagerConfig::set_automatic_resubscription was called, the subscription will be removed on a disconnect and must be re-subscribed.

let client = redis::Client::open("redis://127.0.0.1/?protocol=resp3").unwrap();
let (tx, mut rx) = tokio::sync::mpsc::unbounded_channel();
let config = redis::aio::ConnectionManagerConfig::new().set_push_sender(tx);
let mut con = client.get_connection_manager_with_config(config).await?;
con.psubscribe("channel*_1").await?;
con.psubscribe(&["channel*_2", "channel*_3"]).await?;
Source

pub async fn unsubscribe( &mut self, channel_name: impl ToRedisArgs, ) -> Result<(), RedisError>

Unsubscribes from channel(s).

This method is only available when the connection is using RESP3 protocol, and will return an error otherwise.

Source

pub async fn psubscribe( &mut self, channel_pattern: impl ToRedisArgs, ) -> Result<(), RedisError>

Subscribes to new channel(s) with pattern(s).

Updates from the sender will be sent on the push sender that was passed to the manager. If the manager was configured without a push sender, the manager won’t be able to pass messages back to the user.

This method is only available when the connection is using RESP3 protocol, and will return an error otherwise. It should be noted that unless ConnectionManagerConfig::set_automatic_resubscription was called, the subscription will be removed on a disconnect and must be re-subscribed.

let client = redis::Client::open("redis://127.0.0.1/?protocol=resp3").unwrap();
let (tx, mut rx) = tokio::sync::mpsc::unbounded_channel();
let config = redis::aio::ConnectionManagerConfig::new().set_push_sender(tx);
let mut con = client.get_connection_manager_with_config(config).await?;
con.psubscribe("channel*_1").await?;
con.psubscribe(&["channel*_2", "channel*_3"]).await?;
Source

pub async fn punsubscribe( &mut self, channel_pattern: impl ToRedisArgs, ) -> Result<(), RedisError>

Unsubscribes from channel pattern(s).

This method is only available when the connection is using RESP3 protocol, and will return an error otherwise.

Trait Implementations§

Source§

impl Clone for ConnectionManager

Source§

fn clone(&self) -> ConnectionManager

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl ConnectionLike for ConnectionManager

Source§

fn req_packed_command<'a>( &'a mut self, cmd: &'a Cmd, ) -> Pin<Box<dyn Future<Output = Result<Value, RedisError>> + Send + 'a>>

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

fn get_db(&self) -> i64

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

Auto Trait Implementations§

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

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
Source§

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
Source§

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
Source§

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
Source§

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 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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

Incrementally iterate the keys space.
Source§

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

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

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

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

Incrementally iterate hash fields and associated values.
Source§

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

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

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

Incrementally iterate set elements.
Source§

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

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

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

Incrementally iterate sorted set elements.
Source§

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

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

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

Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

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
Source§

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
Source§

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
Source§

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
Source§

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 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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

Sends a ping to the server Redis Docs
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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
Source§

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

Deletes all the keys of all databases Read more
Source§

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
Source§

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
Source§

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
Source§

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

Incrementally iterate the keys space.
Source§

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

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

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

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

Incrementally iterate hash fields and associated values.
Source§

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

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

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

Incrementally iterate set elements.
Source§

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

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

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

Incrementally iterate sorted set elements.
Source§

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

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

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

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

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

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

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

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

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

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

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

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

Source§

type Error = Infallible

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

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

Performs the conversion.
Source§

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

Source§

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

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

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

Performs the conversion.
Source§

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

Source§

fn vzip(self) -> V

Source§

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