Struct ncryptf::deadpool_redis::redis::aio::MultiplexedConnection

pub struct MultiplexedConnection { /* private fields */ }
Expand description

A connection object which can be cloned, allowing requests to be be sent concurrently on the same underlying connection (tcp/unix socket).

Implementations§

§

impl MultiplexedConnection

pub async fn new<C>( connection_info: &RedisConnectionInfo, stream: C ) -> Result<(MultiplexedConnection, impl Future<Output = ()>), RedisError>
where C: Unpin + AsyncRead + AsyncWrite + Send + 'static,

Constructs a new MultiplexedConnection out of a AsyncRead + AsyncWrite object and a ConnectionInfo

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.

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.

Trait Implementations§

§

impl Clone for MultiplexedConnection

§

fn clone(&self) -> MultiplexedConnection

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

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

Performs copy-assignment from source. Read more
§

impl ConnectionLike for MultiplexedConnection

§

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

fn req_packed_commands<'a>( &'a mut self, cmd: &'a Pipeline, offset: usize, count: usize ) -> Pin<Box<dyn Future<Output = Result<Vec<Value>, RedisError>> + Send + 'a>>

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

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

impl Debug for MultiplexedConnection

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

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

§

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

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
§

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
§

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

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

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

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

fn set_ex<'a, K, V, RV>( &'a mut self, key: K, value: V, seconds: usize ) -> 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.
§

fn pset_ex<'a, K, V, RV>( &'a mut self, key: K, value: V, milliseconds: usize ) -> 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.
§

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
§

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

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

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

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

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

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

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 a key.
§

fn expire<'a, K, RV>( &'a mut self, key: K, seconds: usize ) -> 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.
§

fn expire_at<'a, K, RV>( &'a mut self, key: K, ts: usize ) -> 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.
§

fn pexpire<'a, K, RV>( &'a mut self, key: K, ms: usize ) -> 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.
§

fn pexpire_at<'a, K, RV>( &'a mut self, key: K, ts: usize ) -> 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.
§

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

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 expiration time of a key.
§

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 expiration time of a key in milliseconds.
§

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
§

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
§

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

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.
Unlink one or more keys.
§

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 a multiple fields in a hash.
§

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

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

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

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

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

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

fn blmove<'a, S, D, RV>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: usize ) -> 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
§

fn blmpop<'a, K, RV>( &'a mut self, timeout: usize, 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.
§

fn blpop<'a, K, RV>( &'a mut self, key: K, timeout: usize ) -> 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.
§

fn brpop<'a, K, RV>( &'a mut self, key: K, timeout: usize ) -> 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.
§

fn brpoplpush<'a, S, D, RV>( &'a mut self, srckey: S, dstkey: D, timeout: usize ) -> 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.
§

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

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

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

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

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
§

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

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

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

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

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

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

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

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

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

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

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
§

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn zinterstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [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.
§

fn zinterstore_min<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [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.
§

fn zinterstore_max<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [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.
§

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

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

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

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

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
§

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
§

fn zmpop_max<'a, K, RV>( &'a mut self, keys: &'a [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.
§

fn zmpop_min<'a, K, RV>( &'a mut self, keys: &'a [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.
§

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

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
§

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
§

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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, with scores ordered from high to low.
§

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

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

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

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

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

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

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

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

fn zunionstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [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.
§

fn zunionstore_min<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [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.
§

fn zunionstore_max<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [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.
§

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Incrementally iterate the keys space.
§

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

Incrementally iterate set elements for elements matching a pattern.
§

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

Incrementally iterate hash fields and associated values.
§

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

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

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

Incrementally iterate set elements.
§

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

Incrementally iterate set elements for elements matching a pattern.
§

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

Incrementally iterate sorted set elements.
§

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

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

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

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

source§

fn into(self) -> U

Calls U::from(self).

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

§

impl<T> IntoCollection<T> for T

§

fn into_collection<A>(self) -> SmallVec<A>
where A: Array<Item = T>,

Converts self into a collection.
§

fn mapped<U, F, A>(self, f: F) -> SmallVec<A>
where F: FnMut(T) -> U, A: Array<Item = U>,

§

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

§

fn fg(&self, value: Color) -> Painted<&T>

Returns a styled value derived from self with the foreground set to value.

This method should be used rarely. Instead, prefer to use color-specific builder methods like red() and green(), which have the same functionality but are pithier.

Example

Set foreground color to white using fg():

use yansi::{Paint, Color};

painted.fg(Color::White);

Set foreground color to white using white().

use yansi::Paint;

painted.white();
§

fn primary(&self) -> Painted<&T>

Returns self with the fg() set to [Color::Primary].

Example
println!("{}", value.primary());
§

fn fixed(&self, color: u8) -> Painted<&T>

Returns self with the fg() set to [Color::Fixed].

Example
println!("{}", value.fixed(color));
§

fn rgb(&self, r: u8, g: u8, b: u8) -> Painted<&T>

Returns self with the fg() set to [Color::Rgb].

Example
println!("{}", value.rgb(r, g, b));
§

fn black(&self) -> Painted<&T>

Returns self with the fg() set to [Color::Black].

Example
println!("{}", value.black());
§

fn red(&self) -> Painted<&T>

Returns self with the fg() set to [Color::Red].

Example
println!("{}", value.red());
§

fn green(&self) -> Painted<&T>

Returns self with the fg() set to [Color::Green].

Example
println!("{}", value.green());
§

fn yellow(&self) -> Painted<&T>

Returns self with the fg() set to [Color::Yellow].

Example
println!("{}", value.yellow());
§

fn blue(&self) -> Painted<&T>

Returns self with the fg() set to [Color::Blue].

Example
println!("{}", value.blue());
§

fn magenta(&self) -> Painted<&T>

Returns self with the fg() set to [Color::Magenta].

Example
println!("{}", value.magenta());
§

fn cyan(&self) -> Painted<&T>

Returns self with the fg() set to [Color::Cyan].

Example
println!("{}", value.cyan());
§

fn white(&self) -> Painted<&T>

Returns self with the fg() set to [Color::White].

Example
println!("{}", value.white());
§

fn bright_black(&self) -> Painted<&T>

Returns self with the fg() set to [Color::BrightBlack].

Example
println!("{}", value.bright_black());
§

fn bright_red(&self) -> Painted<&T>

Returns self with the fg() set to [Color::BrightRed].

Example
println!("{}", value.bright_red());
§

fn bright_green(&self) -> Painted<&T>

Returns self with the fg() set to [Color::BrightGreen].

Example
println!("{}", value.bright_green());
§

fn bright_yellow(&self) -> Painted<&T>

Returns self with the fg() set to [Color::BrightYellow].

Example
println!("{}", value.bright_yellow());
§

fn bright_blue(&self) -> Painted<&T>

Returns self with the fg() set to [Color::BrightBlue].

Example
println!("{}", value.bright_blue());
§

fn bright_magenta(&self) -> Painted<&T>

Returns self with the fg() set to [Color::BrightMagenta].

Example
println!("{}", value.bright_magenta());
§

fn bright_cyan(&self) -> Painted<&T>

Returns self with the fg() set to [Color::BrightCyan].

Example
println!("{}", value.bright_cyan());
§

fn bright_white(&self) -> Painted<&T>

Returns self with the fg() set to [Color::BrightWhite].

Example
println!("{}", value.bright_white());
§

fn bg(&self, value: Color) -> Painted<&T>

Returns a styled value derived from self with the background set to value.

This method should be used rarely. Instead, prefer to use color-specific builder methods like on_red() and on_green(), which have the same functionality but are pithier.

Example

Set background color to red using fg():

use yansi::{Paint, Color};

painted.bg(Color::Red);

Set background color to red using on_red().

use yansi::Paint;

painted.on_red();
§

fn on_primary(&self) -> Painted<&T>

Returns self with the bg() set to [Color::Primary].

Example
println!("{}", value.on_primary());
§

fn on_fixed(&self, color: u8) -> Painted<&T>

Returns self with the bg() set to [Color::Fixed].

Example
println!("{}", value.on_fixed(color));
§

fn on_rgb(&self, r: u8, g: u8, b: u8) -> Painted<&T>

Returns self with the bg() set to [Color::Rgb].

Example
println!("{}", value.on_rgb(r, g, b));
§

fn on_black(&self) -> Painted<&T>

Returns self with the bg() set to [Color::Black].

Example
println!("{}", value.on_black());
§

fn on_red(&self) -> Painted<&T>

Returns self with the bg() set to [Color::Red].

Example
println!("{}", value.on_red());
§

fn on_green(&self) -> Painted<&T>

Returns self with the bg() set to [Color::Green].

Example
println!("{}", value.on_green());
§

fn on_yellow(&self) -> Painted<&T>

Returns self with the bg() set to [Color::Yellow].

Example
println!("{}", value.on_yellow());
§

fn on_blue(&self) -> Painted<&T>

Returns self with the bg() set to [Color::Blue].

Example
println!("{}", value.on_blue());
§

fn on_magenta(&self) -> Painted<&T>

Returns self with the bg() set to [Color::Magenta].

Example
println!("{}", value.on_magenta());
§

fn on_cyan(&self) -> Painted<&T>

Returns self with the bg() set to [Color::Cyan].

Example
println!("{}", value.on_cyan());
§

fn on_white(&self) -> Painted<&T>

Returns self with the bg() set to [Color::White].

Example
println!("{}", value.on_white());
§

fn on_bright_black(&self) -> Painted<&T>

Returns self with the bg() set to [Color::BrightBlack].

Example
println!("{}", value.on_bright_black());
§

fn on_bright_red(&self) -> Painted<&T>

Returns self with the bg() set to [Color::BrightRed].

Example
println!("{}", value.on_bright_red());
§

fn on_bright_green(&self) -> Painted<&T>

Returns self with the bg() set to [Color::BrightGreen].

Example
println!("{}", value.on_bright_green());
§

fn on_bright_yellow(&self) -> Painted<&T>

Returns self with the bg() set to [Color::BrightYellow].

Example
println!("{}", value.on_bright_yellow());
§

fn on_bright_blue(&self) -> Painted<&T>

Returns self with the bg() set to [Color::BrightBlue].

Example
println!("{}", value.on_bright_blue());
§

fn on_bright_magenta(&self) -> Painted<&T>

Returns self with the bg() set to [Color::BrightMagenta].

Example
println!("{}", value.on_bright_magenta());
§

fn on_bright_cyan(&self) -> Painted<&T>

Returns self with the bg() set to [Color::BrightCyan].

Example
println!("{}", value.on_bright_cyan());
§

fn on_bright_white(&self) -> Painted<&T>

Returns self with the bg() set to [Color::BrightWhite].

Example
println!("{}", value.on_bright_white());
§

fn attr(&self, value: Attribute) -> Painted<&T>

Enables the styling [Attribute] value.

This method should be used rarely. Instead, prefer to use attribute-specific builder methods like bold() and underline(), which have the same functionality but are pithier.

Example

Make text bold using attr():

use yansi::{Paint, Attribute};

painted.attr(Attribute::Bold);

Make text bold using using bold().

use yansi::Paint;

painted.bold();
§

fn bold(&self) -> Painted<&T>

Returns self with the attr() set to [Attribute::Bold].

Example
println!("{}", value.bold());
§

fn dim(&self) -> Painted<&T>

Returns self with the attr() set to [Attribute::Dim].

Example
println!("{}", value.dim());
§

fn italic(&self) -> Painted<&T>

Returns self with the attr() set to [Attribute::Italic].

Example
println!("{}", value.italic());
§

fn underline(&self) -> Painted<&T>

Returns self with the attr() set to [Attribute::Underline].

Example
println!("{}", value.underline());

Returns self with the attr() set to [Attribute::Blink].

Example
println!("{}", value.blink());

Returns self with the attr() set to [Attribute::RapidBlink].

Example
println!("{}", value.rapid_blink());
§

fn invert(&self) -> Painted<&T>

Returns self with the attr() set to [Attribute::Invert].

Example
println!("{}", value.invert());
§

fn conceal(&self) -> Painted<&T>

Returns self with the attr() set to [Attribute::Conceal].

Example
println!("{}", value.conceal());
§

fn strike(&self) -> Painted<&T>

Returns self with the attr() set to [Attribute::Strike].

Example
println!("{}", value.strike());
§

fn quirk(&self, value: Quirk) -> Painted<&T>

Enables the yansi [Quirk] value.

This method should be used rarely. Instead, prefer to use quirk-specific builder methods like mask() and wrap(), which have the same functionality but are pithier.

Example

Enable wrapping using .quirk():

use yansi::{Paint, Quirk};

painted.quirk(Quirk::Wrap);

Enable wrapping using wrap().

use yansi::Paint;

painted.wrap();
§

fn mask(&self) -> Painted<&T>

Returns self with the quirk() set to [Quirk::Mask].

Example
println!("{}", value.mask());
§

fn wrap(&self) -> Painted<&T>

Returns self with the quirk() set to [Quirk::Wrap].

Example
println!("{}", value.wrap());
§

fn linger(&self) -> Painted<&T>

Returns self with the quirk() set to [Quirk::Linger].

Example
println!("{}", value.linger());
§

fn clear(&self) -> Painted<&T>

Returns self with the quirk() set to [Quirk::Clear].

Example
println!("{}", value.clear());
§

fn bright(&self) -> Painted<&T>

Returns self with the quirk() set to [Quirk::Bright].

Example
println!("{}", value.bright());
§

fn on_bright(&self) -> Painted<&T>

Returns self with the quirk() set to [Quirk::OnBright].

Example
println!("{}", value.on_bright());
§

fn whenever(&self, value: Condition) -> Painted<&T>

Conditionally enable styling based on whether the [Condition] value applies. Replaces any previous condition.

See the crate level docs for more details.

Example

Enable styling painted only when both stdout and stderr are TTYs:

use yansi::{Paint, Condition};

painted.red().on_yellow().whenever(Condition::STDOUTERR_ARE_TTY);
§

fn new(self) -> Painted<Self>
where Self: Sized,

Create a new [Painted] with a default [Style]. Read more
§

fn paint<S>(&self, style: S) -> Painted<&Self>
where S: Into<Style>,

Apply a style wholesale to self. Any previous style is replaced. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

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

§

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>,

§

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>,

§

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

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

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

Performs the conversion.
§

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

§

fn vzip(self) -> V

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more