Struct l337_redis::AsyncConnection

source · 
pub struct AsyncConnection {
    pub conn: MultiplexedConnection,
    /* private fields */
}

Fields§

§conn: MultiplexedConnection

Trait Implementations§

source§

impl AsMut<MultiplexedConnection> for AsyncConnection

source§

fn as_mut(&mut self) -> &mut MultiplexedConnection

Converts this type into a mutable reference of the (usually inferred) input type.
source§

impl AsRef<MultiplexedConnection> for AsyncConnection

source§

fn as_ref(&self) -> &MultiplexedConnection

Converts this type into a shared reference of the (usually inferred) input type.
source§

impl ConnectionLike for AsyncConnection

source§

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

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

fn req_packed_commands<'a>( &'a mut self, cmd: &'a Pipeline, offset: usize, count: usize ) -> RedisFuture<'a, Vec<Value>>

Sends multiple already encoded (packed) command into the TCP socket and reads count responses from it. This is used to implement pipelining.
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.
source§

impl Deref for AsyncConnection

§

type Target = MultiplexedConnection

The resulting type after dereferencing.
source§

fn deref(&self) -> &Self::Target

Dereferences the value.
source§

impl DerefMut for AsyncConnection

source§

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.
source§

impl Drop for AsyncConnection

source§

fn drop(&mut self)

Executes the destructor for this type. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

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

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

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

Get values of keys
source§

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

Gets all keys matching pattern
source§

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

Set the string value of a key.
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sets multiple keys to their values.
source§

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, Global>>where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the value and expiration of a key.
source§

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, Global>>where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Set the value and expiration in milliseconds of a key.
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, Global>>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
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, Global>>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.
source§

fn getset<'a, K, V, RV>( &'a mut self, key: K, value: V ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>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.
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, Global>>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.
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, Global>>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.
source§

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

Delete one or more keys.
source§

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

Determine if a key exists.
source§

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

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

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

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

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

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

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

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

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

Remove the expiration from a key.
source§

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

Get the expiration time of a key.
source§

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

Get the expiration time of a key in milliseconds.
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Get the value of a key and set expiration
source§

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

Get the value of a key and delete it
source§

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

Rename a key.
source§

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

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

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

Append a value to a key.
source§

fn incr<'a, K, V, RV>( &'a mut self, key: K, delta: V ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>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.
source§

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

Decrement the numeric value of a key by the given amount.
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

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

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

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

Count set bits in a string.
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Deletes a single (or multiple) fields from a hash.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Increments a value.
source§

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

Checks if a field in a hash exists.
source§

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

Gets all the keys in a hash.
source§

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

Gets all the values in a hash.
source§

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

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

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

Gets the length of a hash.
source§

fn blmove<'a, K, RV>( &'a mut self, srckey: K, dstkey: K, src_dir: Direction, dst_dir: Direction, timeout: usize ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>where K: 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
source§

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

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

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

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

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

fn brpoplpush<'a, K, RV>( &'a mut self, srckey: K, dstkey: K, timeout: usize ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>where K: 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.
source§

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

Get an element from a list by its index.
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, Global>>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.
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, Global>>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.
source§

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

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

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

Pop an element a list, push it to another list and return it
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, Global>>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.
source§

fn lpop<'a, K, RV>( &'a mut self, key: K, count: Option<NonZeroUsize> ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>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, Global>>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.
source§

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

Returns the specified elements of the list stored at key.
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, Global>>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.
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Trim an existing list so that it will contain only the specified range of elements specified.
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Sets the list element at index to value
source§

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

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

fn rpush<'a, K, V, RV>( &'a mut self, key: K, value: V ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>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.
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, Global>>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.
source§

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

Add one or more members to a set.
source§

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

Get the number of members in a set.
source§

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

Subtract multiple sets.
source§

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

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

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

Intersect multiple sets.
source§

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

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

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

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

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

Get all the members in a set.
source§

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

Move a member from one set to another.
source§

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

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

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

Get one random member from a set.
source§

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

Get multiple random members from a set.
source§

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

Remove one or more members from a set.
source§

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

Add multiple sets.
source§

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

Add multiple sets and store the resulting set in a key.
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, Global>>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.
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, Global>>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.
source§

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

Get the number of members in a sorted set.
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, Global>>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.
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, Global>>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.
source§

fn zinterstore<'a, K, RV>( &'a mut self, dstkey: K, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>where 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.
source§

fn zinterstore_min<'a, K, RV>( &'a mut self, dstkey: K, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>where 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.
source§

fn zinterstore_max<'a, K, RV>( &'a mut self, dstkey: K, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>where 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.
source§

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Return up to count random members in a sorted set with scores
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Return a range of members in a sorted set, by index
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Return a range of members in a sorted set, by index with scores.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
source§

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

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

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

Remove one or more members from a sorted set.
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, Global>>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.
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, Global>>where K: ToRedisArgs + Send + Sync + 'a, RV: FromRedisValue,

Remove all members in a sorted set within the given indexes.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
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, Global>>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.
source§

fn zrevrank<'a, K, M, RV>( &'a mut self, key: K, member: M ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>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.
source§

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

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

fn zunionstore<'a, K, RV>( &'a mut self, dstkey: K, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>where 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.
source§

fn zunionstore_min<'a, K, RV>( &'a mut self, dstkey: K, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>where 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.
source§

fn zunionstore_max<'a, K, RV>( &'a mut self, dstkey: K, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>where 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.
source§

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

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

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

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

Adds the specified elements to the specified HyperLogLog.
source§

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

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

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

Merge N different HyperLogLogs into a single one.
source§

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

Posts a message to the given channel.
source§

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

Returns the encoding of a key.
source§

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

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

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

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

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

Returns the reference count of a key.
source§

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

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

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

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

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

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

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

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

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

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

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

Creates an ACL user without any privilege.
source§

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

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

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

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

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

Shows the available ACL categories.
source§

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

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

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

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

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

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

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

Returns the username the current connection is authenticated with.
source§

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

Shows a list of recent ACL security events
source§

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

Clears the ACL log.
source§

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

Returns a helpful text describing the different subcommands.
source§

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn xrevrange_all<'a, K, RV>( &'a mut self, key: K ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a, Global>>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
source§

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

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

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

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

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

Incrementally iterate the keys space.
source§

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

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

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

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, Global>>where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

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, Global>>where K: ToRedisArgs, RV: FromRedisValue,

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, Global>>where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

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, Global>>where K: ToRedisArgs, RV: FromRedisValue,

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, Global>>where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

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

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

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

const: unstable · source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · 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 Twhere U: From<T>,

const: unstable · 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, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

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

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
const: unstable · source§

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

Performs the conversion.
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