pub enum AsyncRedisConnection {
Cluster(CustomClusterConnection),
Single(CustomSingleConnection),
}Expand description
A connection to either a single Redis instance or a Redis cluster.
This enum provides a unified interface for Redis operations, abstracting away the
differences between single-instance and cluster connections. It implements the
[redis::aio::ConnectionLike] trait, allowing it to be used with Redis commands
regardless of the underlying connection type.
Variants§
Cluster(CustomClusterConnection)
A connection to a Redis cluster.
Single(CustomSingleConnection)
A connection to a single Redis instance.
Trait Implementations§
Source§impl ConnectionLike for AsyncRedisConnection
impl ConnectionLike for AsyncRedisConnection
Source§fn req_packed_command<'a>(&'a mut self, cmd: &'a Cmd) -> RedisFuture<'a, Value>
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.
Auto Trait Implementations§
impl Freeze for AsyncRedisConnection
impl !RefUnwindSafe for AsyncRedisConnection
impl Send for AsyncRedisConnection
impl Sync for AsyncRedisConnection
impl Unpin for AsyncRedisConnection
impl !UnwindSafe for AsyncRedisConnection
Blanket Implementations§
§impl<T> AsyncCommands for T
impl<T> AsyncCommands for T
§fn get<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn get<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the value of a key. If key is a vec this becomes an
MGET (if using TypedCommands, you should specifically use mget to get the correct return type.
Redis Docs§fn mget<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn mget<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get values of keys
Redis Docs
§fn keys<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn keys<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Gets all keys matching pattern
Redis Docs
§fn set<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn set<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the string value of a key.
Redis Docs
§fn set_options<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
options: SetOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Set the string value of a key with options.
Redis Docs
§fn mset<'a, K, V, RV>(
&'a mut self,
items: &'a [(K, V)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn mset<'a, K, V, RV>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Sets multiple keys to their values.
Redis Docs
§fn set_ex<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
seconds: u64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn set_ex<'a, K, V, RV>( &'a mut self, key: K, value: V, seconds: u64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the value and expiration of a key.
Redis Docs
§fn pset_ex<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
milliseconds: u64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pset_ex<'a, K, V, RV>( &'a mut self, key: K, value: V, milliseconds: u64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the value and expiration in milliseconds of a key.
Redis Docs
§fn set_nx<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn set_nx<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the value of a key, only if the key does not exist
Redis Docs
§fn mset_nx<'a, K, V, RV>(
&'a mut self,
items: &'a [(K, V)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn mset_nx<'a, K, V, RV>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Sets multiple keys to their values failing if at least one already exists.
Redis Docs
§fn mset_ex<'a, K, V, RV>(
&'a mut self,
items: &'a [(K, V)],
options: MSetOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn mset_ex<'a, K, V, RV>( &'a mut self, items: &'a [(K, V)], options: MSetOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Sets the given keys to their respective values.
This command is an extension of the MSETNX that adds expiration and XX options.
Redis Docs
§fn getset<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn getset<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the string value of a key and return its old value.
Redis Docs
§fn getrange<'a, K, RV>(
&'a mut self,
key: K,
from: isize,
to: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn getrange<'a, K, RV>( &'a mut self, key: K, from: isize, to: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.
Redis returns an empty string if the key doesn’t exist, not Nil
Redis Docs
§fn setrange<'a, K, V, RV>(
&'a mut self,
key: K,
offset: isize,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Overwrite the part of the value stored in key at the specified offset.
Redis Docs
§fn del<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn del<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Delete one or more keys.
Returns the number of keys deleted.
Redis Docs
§fn del_ex<'a, K, RV>(
&'a mut self,
key: K,
value_comparison: ValueComparison,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn del_ex<'a, K, RV>( &'a mut self, key: K, value_comparison: ValueComparison, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Conditionally removes the specified key. A key is ignored if it does not exist.
IFEQ
match-value - Delete the key only if its value is equal to match-value
IFNE match-value - Delete the key only if its value is not equal to match-value
IFDEQ match-digest - Delete the key only if the digest of its value is equal to match-digest
IFDNE match-digest - Delete the key only if the digest of its value is not equal to match-digest
Redis Docs§fn digest<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn digest<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the hex signature of the value stored in the specified key.
For the digest, Redis will use XXH3
Redis Docs
§fn exists<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn exists<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Determine if a key exists.
Redis Docs
§fn key_type<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn key_type<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Determine the type of key.
Redis Docs
§fn expire<'a, K, RV>(
&'a mut self,
key: K,
seconds: i64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn expire<'a, K, RV>( &'a mut self, key: K, seconds: i64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set a key’s time to live in seconds.
Returns whether expiration was set.
Redis Docs
§fn expire_at<'a, K, RV>(
&'a mut self,
key: K,
ts: i64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn expire_at<'a, K, RV>( &'a mut self, key: K, ts: i64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the expiration for a key as a UNIX timestamp.
Returns whether expiration was set.
Redis Docs
§fn pexpire<'a, K, RV>(
&'a mut self,
key: K,
ms: i64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pexpire<'a, K, RV>( &'a mut self, key: K, ms: i64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set a key’s time to live in milliseconds.
Returns whether expiration was set.
Redis Docs
§fn pexpire_at<'a, K, RV>(
&'a mut self,
key: K,
ts: i64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pexpire_at<'a, K, RV>( &'a mut self, key: K, ts: i64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the expiration for a key as a UNIX timestamp in milliseconds.
Returns whether expiration was set.
Redis Docs
§fn expire_time<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn expire_time<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the absolute Unix expiration timestamp in seconds.
Returns
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn pexpire_time<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pexpire_time<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the absolute Unix expiration timestamp in milliseconds.
Returns
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn persist<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn persist<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove the expiration from a key.
Returns whether a timeout was removed.
Redis Docs
§fn ttl<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn ttl<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the time to live for a key in seconds.
Returns
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn pttl<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pttl<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the time to live for a key in milliseconds.
Returns
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn get_ex<'a, K, RV>(
&'a mut self,
key: K,
expire_at: Expiry,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn get_ex<'a, K, RV>( &'a mut self, key: K, expire_at: Expiry, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the value of a key and set expiration
Redis Docs
§fn get_del<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn get_del<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the value of a key and delete it
Redis Docs
§fn copy<'a, KSrc, KDst, Db, RV>(
&'a mut self,
source: KSrc,
destination: KDst,
options: CopyOptions<Db>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn copy<'a, KSrc, KDst, Db, RV>( &'a mut self, source: KSrc, destination: KDst, options: CopyOptions<Db>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Copy the value from one key to another, returning whether the copy was successful.
Redis Docs
§fn rename<'a, K, N, RV>(
&'a mut self,
key: K,
new_key: N,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn rename<'a, K, N, RV>( &'a mut self, key: K, new_key: N, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Rename a key.
Errors if key does not exist.
Redis Docs
§fn rename_nx<'a, K, N, RV>(
&'a mut self,
key: K,
new_key: N,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Rename a key, only if the new key does not exist.
Errors if key does not exist.
Returns whether the key was renamed, or false if the new key already exists.
Redis Docs
§fn unlink<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn unlink<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Unlink one or more keys. This is a non-blocking version of
DEL.
Returns number of keys unlinked.
Redis Docs§fn append<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn append<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Append a value to a key.
Returns length of string after operation.
Redis Docs
§fn incr<'a, K, V, RV>(
&'a mut self,
key: K,
delta: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn incr<'a, K, V, RV>( &'a mut self, key: K, delta: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Increment the numeric value of a key by the given amount. This
issues a
INCRBY or INCRBYFLOAT depending on the type.
If the key does not exist, it is set to 0 before performing the operation.§fn decr<'a, K, V, RV>(
&'a mut self,
key: K,
delta: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn decr<'a, K, V, RV>( &'a mut self, key: K, delta: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Decrement the numeric value of a key by the given amount.
If the key does not exist, it is set to 0 before performing the operation.
Redis Docs
§fn setbit<'a, K, RV>(
&'a mut self,
key: K,
offset: usize,
value: bool,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn setbit<'a, K, RV>( &'a mut self, key: K, offset: usize, value: bool, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Sets or clears the bit at offset in the string value stored at key.
Returns the original bit value stored at offset.
Redis Docs
§fn getbit<'a, K, RV>(
&'a mut self,
key: K,
offset: usize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn getbit<'a, K, RV>( &'a mut self, key: K, offset: usize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the bit value at offset in the string value stored at key.
Redis Docs
§fn bitcount<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bitcount<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Count set bits in a string.
Returns 0 if key does not exist.
Redis Docs
§fn bitcount_range<'a, K, RV>(
&'a mut self,
key: K,
start: usize,
end: usize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Count set bits in a string in a range.
Returns 0 if key does not exist.
Redis Docs
§fn bit_and<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bit_and<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Perform a bitwise AND between multiple keys (containing string values)
and store the result in the destination key.
Returns size of destination string after operation.
Redis Docs
§fn bit_or<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bit_or<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Perform a bitwise OR between multiple keys (containing string values)
and store the result in the destination key.
Returns size of destination string after operation.
Redis Docs
§fn bit_xor<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bit_xor<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Perform a bitwise XOR between multiple keys (containing string values)
and store the result in the destination key.
Returns size of destination string after operation.
Redis Docs
§fn bit_not<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckey: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bit_not<'a, D, S, RV>( &'a mut self, dstkey: D, srckey: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Perform a bitwise NOT of the key (containing string values)
and store the result in the destination key.
Returns size of destination string after operation.
Redis Docs
§fn bit_diff<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bit_diff<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
DIFF(X, Y1, Y2, …)
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_diff1<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bit_diff1<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
DIFF1(X, Y1, Y2, …) (Relative complement difference)
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_and_or<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bit_and_or<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
ANDOR(X, Y1, Y2, …)
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_one<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bit_one<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
ONE(X, Y1, Y2, …)
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
§fn strlen<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn strlen<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the length of the value stored in a key.
0 if key does not exist.
Redis Docs
§fn hget<'a, K, F, RV>(
&'a mut self,
key: K,
field: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hget<'a, K, F, RV>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Gets a single (or multiple) fields from a hash.
§fn hmget<'a, K, F, RV>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hmget<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Gets multiple fields from a hash.
Redis Docs
§fn hget_ex<'a, K, F, RV>(
&'a mut self,
key: K,
fields: F,
expire_at: Expiry,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hget_ex<'a, K, F, RV>( &'a mut self, key: K, fields: F, expire_at: Expiry, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the value of one or more fields of a given hash key, and optionally set their expiration
Redis Docs
§fn hdel<'a, K, F, RV>(
&'a mut self,
key: K,
field: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hdel<'a, K, F, RV>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Deletes a single (or multiple) fields from a hash.
Returns number of fields deleted.
Redis Docs
§fn hget_del<'a, K, F, RV>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hget_del<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get and delete the value of one or more fields of a given hash key
Redis Docs
§fn hset<'a, K, F, V, RV>(
&'a mut self,
key: K,
field: F,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Sets a single field in a hash.
Returns number of fields added.
Redis Docs
§fn hset_ex<'a, K, F, V, RV>(
&'a mut self,
key: K,
hash_field_expiration_options: &'a HashFieldExpirationOptions,
fields_values: &'a [(F, V)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hset_ex<'a, K, F, V, RV>( &'a mut self, key: K, hash_field_expiration_options: &'a HashFieldExpirationOptions, fields_values: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the value of one or more fields of a given hash key, and optionally set their expiration
Redis Docs
§fn hset_nx<'a, K, F, V, RV>(
&'a mut self,
key: K,
field: F,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Sets a single field in a hash if it does not exist.
Returns whether the field was added.
Redis Docs
§fn hset_multiple<'a, K, F, V, RV>(
&'a mut self,
key: K,
items: &'a [(F, V)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Sets multiple fields in a hash.
Redis Docs
§fn hincr<'a, K, F, D, RV>(
&'a mut self,
key: K,
field: F,
delta: D,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Increments a value.
Returns the new value of the field after incrementation.
§fn hexists<'a, K, F, RV>(
&'a mut self,
key: K,
field: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hexists<'a, K, F, RV>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Checks if a field in a hash exists.
Redis Docs
§fn httl<'a, K, F, RV>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn httl<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get one or more fields’ TTL in seconds.
Redis Docs
§fn hpttl<'a, K, F, RV>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hpttl<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get one or more fields’ TTL in milliseconds.
Redis Docs
§fn hexpire<'a, K, F, RV>(
&'a mut self,
key: K,
seconds: i64,
opt: ExpireOption,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hexpire<'a, K, F, RV>( &'a mut self, key: K, seconds: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set one or more fields’ time to live in seconds.
Returns an array where each element corresponds to the field at the same index in the fields argument.
Each element of the array is either:
0 if the specified condition has not been met.
1 if the expiration time was updated.
2 if called with 0 seconds.
Errors if provided key exists but is not a hash.
Redis Docs
§fn hexpire_at<'a, K, F, RV>(
&'a mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hexpire_at<'a, K, F, RV>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the expiration for one or more fields as a UNIX timestamp in seconds.
Returns an array where each element corresponds to the field at the same index in the fields argument.
Each element of the array is either:
0 if the specified condition has not been met.
1 if the expiration time was updated.
2 if called with a time in the past.
Errors if provided key exists but is not a hash.
Redis Docs
§fn hexpire_time<'a, K, F, RV>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hexpire_time<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the absolute Unix expiration timestamp in seconds.
Redis Docs
§fn hpersist<'a, K, F, RV>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hpersist<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove the expiration from a key.
Returns 1 if the expiration was removed.
Redis Docs
§fn hpexpire<'a, K, F, RV>(
&'a mut self,
key: K,
milliseconds: i64,
opt: ExpireOption,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hpexpire<'a, K, F, RV>( &'a mut self, key: K, milliseconds: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set one or more fields’ time to live in milliseconds.
Returns an array where each element corresponds to the field at the same index in the fields argument.
Each element of the array is either:
0 if the specified condition has not been met.
1 if the expiration time was updated.
2 if called with 0 seconds.
Errors if provided key exists but is not a hash.
Redis Docs
§fn hpexpire_at<'a, K, F, RV>(
&'a mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hpexpire_at<'a, K, F, RV>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Set the expiration for one or more fields as a UNIX timestamp in milliseconds.
Returns an array where each element corresponds to the field at the same index in the fields argument.
Each element of the array is either:
0 if the specified condition has not been met.
1 if the expiration time was updated.
2 if called with a time in the past.
Errors if provided key exists but is not a hash.
Redis Docs
§fn hpexpire_time<'a, K, F, RV>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hpexpire_time<'a, K, F, RV>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the absolute Unix expiration timestamp in seconds.
Redis Docs
§fn hkeys<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hkeys<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Gets all the keys in a hash.
Redis Docs
§fn hvals<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hvals<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Gets all the values in a hash.
Redis Docs
§fn hgetall<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hgetall<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Gets all the fields and values in a hash.
Redis Docs
§fn hlen<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn hlen<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Gets the length of a hash.
Returns 0 if key does not exist.
Redis Docs
§fn blmove<'a, S, D, RV>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn blmove<'a, S, D, RV>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Pop an element from a list, push it to another list
and return it; or block until one is available
Redis Docs
§fn blmpop<'a, K, RV>(
&'a mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn blmpop<'a, K, RV>( &'a mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Pops
count elements from the first non-empty list key from the list of
provided key names; or blocks until one is available.
Redis Docs§fn blpop<'a, K, RV>(
&'a mut self,
key: K,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn blpop<'a, K, RV>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove and get the first element in a list, or block until one is available.
Redis Docs
§fn brpop<'a, K, RV>(
&'a mut self,
key: K,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn brpop<'a, K, RV>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove and get the last element in a list, or block until one is available.
Redis Docs
§fn brpoplpush<'a, S, D, RV>(
&'a mut self,
srckey: S,
dstkey: D,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn brpoplpush<'a, S, D, RV>( &'a mut self, srckey: S, dstkey: D, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Pop a value from a list, push it to another list and return it;
or block until one is available.
Redis Docs
§fn lindex<'a, K, RV>(
&'a mut self,
key: K,
index: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn lindex<'a, K, RV>( &'a mut self, key: K, index: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get an element from a list by its index.
Redis Docs
§fn linsert_before<'a, K, P, V, RV>(
&'a mut self,
key: K,
pivot: P,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Insert an element before another element in a list.
Redis Docs
§fn linsert_after<'a, K, P, V, RV>(
&'a mut self,
key: K,
pivot: P,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Insert an element after another element in a list.
Redis Docs
§fn llen<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn llen<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the length of the list stored at key.
Redis Docs
§fn lmove<'a, S, D, RV>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Pop an element a list, push it to another list and return it
Redis Docs
§fn lmpop<'a, K, RV>(
&'a mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Pops
count elements from the first non-empty list key from the list of
provided key names.
Redis Docs§fn lpop<'a, K, RV>(
&'a mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn lpop<'a, K, RV>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
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>>
Returns the index of the first matching value of the list stored at key.
Redis Docs
§fn lpush<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn lpush<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Insert all the specified values at the head of the list stored at key.
Redis Docs
§fn lpush_exists<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn lpush_exists<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Inserts a value at the head of the list stored at key, only if key
already exists and holds a list.
Redis Docs
§fn lrange<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn lrange<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the specified elements of the list stored at key.
Redis Docs
§fn lrem<'a, K, V, RV>(
&'a mut self,
key: K,
count: isize,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Removes the first count occurrences of elements equal to value
from the list stored at key.
Redis Docs
§fn ltrim<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn ltrim<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Trim an existing list so that it will contain only the specified
range of elements specified.
Redis Docs
§fn lset<'a, K, V, RV>(
&'a mut self,
key: K,
index: isize,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Sets the list element at index to value
Redis Docs
§fn ping<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn ping<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Sends a ping to the server
Redis Docs
§fn ping_message<'a, K, RV>(
&'a mut self,
message: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn ping_message<'a, K, RV>( &'a mut self, message: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Sends a ping with a message to the server
Redis Docs
§fn rpop<'a, K, RV>(
&'a mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn rpop<'a, K, RV>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
fn rpoplpush<'a, K, D, RV>( &'a mut self, key: K, dstkey: D, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Pop a value from a list, push it to another list and return it.
Redis Docs
§fn rpush<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn rpush<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Insert all the specified values at the tail of the list stored at key.
Redis Docs
§fn rpush_exists<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn rpush_exists<'a, K, V, RV>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Inserts value at the tail of the list stored at key, only if key
already exists and holds a list.
Redis Docs
§fn sadd<'a, K, M, RV>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn sadd<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Add one or more members to a set.
Redis Docs
§fn scard<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn scard<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the number of members in a set.
Redis Docs
§fn sdiff<'a, K, RV>(
&'a mut self,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn sdiff<'a, K, RV>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Subtract multiple sets.
Redis Docs
§fn sdiffstore<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn sdiffstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Subtract multiple sets and store the resulting set in a key.
Redis Docs
§fn sinter<'a, K, RV>(
&'a mut self,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn sinter<'a, K, RV>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Intersect multiple sets.
Redis Docs
§fn sinterstore<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn sinterstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Intersect multiple sets and store the resulting set in a key.
Redis Docs
§fn sismember<'a, K, M, RV>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn sismember<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Determine if a given value is a member of a set.
Redis Docs
§fn smismember<'a, K, M, RV>(
&'a mut self,
key: K,
members: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn smismember<'a, K, M, RV>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Determine if given values are members of a set.
Redis Docs
§fn smembers<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn smembers<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get all the members in a set.
Redis Docs
§fn smove<'a, S, D, M, RV>(
&'a mut self,
srckey: S,
dstkey: D,
member: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Move a member from one set to another.
Redis Docs
§fn spop<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn spop<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove and return a random member from a set.
Redis Docs
§fn srandmember<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn srandmember<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get one random member from a set.
Redis Docs
§fn srandmember_multiple<'a, K, RV>(
&'a mut self,
key: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn srandmember_multiple<'a, K, RV>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get multiple random members from a set.
Redis Docs
§fn srem<'a, K, M, RV>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn srem<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove one or more members from a set.
Redis Docs
§fn sunion<'a, K, RV>(
&'a mut self,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn sunion<'a, K, RV>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Add multiple sets.
Redis Docs
§fn sunionstore<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn sunionstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Add multiple sets and store the resulting set in a key.
Redis Docs
§fn zadd<'a, K, S, M, RV>(
&'a mut self,
key: K,
member: M,
score: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Add one member to a sorted set, or update its score if it already exists.
Redis Docs
§fn zadd_multiple<'a, K, S, M, RV>(
&'a mut self,
key: K,
items: &'a [(S, M)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Add multiple members to a sorted set, or update its score if it already exists.
Redis Docs
§fn zadd_options<'a, K, S, M, RV>(
&'a mut self,
key: K,
member: M,
score: S,
options: &'a SortedSetAddOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zadd_options<'a, K, S, M, RV>( &'a mut self, key: K, member: M, score: S, options: &'a SortedSetAddOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Add one member to a sorted set, or update its score if it already exists.
Redis Docs
§fn zadd_multiple_options<'a, K, S, M, RV>(
&'a mut self,
key: K,
items: &'a [(S, M)],
options: &'a SortedSetAddOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zadd_multiple_options<'a, K, S, M, RV>( &'a mut self, key: K, items: &'a [(S, M)], options: &'a SortedSetAddOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Add multiple members to a sorted set, or update its score if it already exists.
Redis Docs
§fn zcard<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zcard<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the number of members in a sorted set.
Redis Docs
§fn zcount<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Count the members in a sorted set with scores within the given values.
Redis Docs
§fn zincr<'a, K, M, D, RV>(
&'a mut self,
key: K,
member: M,
delta: D,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Increments the member in a sorted set at key by delta.
If the member does not exist, it is added with delta as its score.
Redis Docs
§fn zinterstore<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zinterstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using SUM as aggregation function.
Redis Docs
§fn zinterstore_min<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zinterstore_min<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
Redis Docs
§fn zinterstore_max<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zinterstore_max<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
Redis Docs
§fn zinterstore_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
[
Commands::zinterstore], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zinterstore_min_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
[
Commands::zinterstore_min], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zinterstore_max_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
[
Commands::zinterstore_max], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zlexcount<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Count the number of members in a sorted set between a given lexicographical range.
Redis Docs
§fn bzpopmax<'a, K, RV>(
&'a mut self,
key: K,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bzpopmax<'a, K, RV>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns the member with the highest score in a sorted set.
Blocks until a member is available otherwise.
Redis Docs
§fn zpopmax<'a, K, RV>(
&'a mut self,
key: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zpopmax<'a, K, RV>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns up to count members with the highest scores in a sorted set
Redis Docs
§fn bzpopmin<'a, K, RV>(
&'a mut self,
key: K,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bzpopmin<'a, K, RV>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns the member with the lowest score in a sorted set.
Blocks until a member is available otherwise.
Redis Docs
§fn zpopmin<'a, K, RV>(
&'a mut self,
key: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zpopmin<'a, K, RV>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns up to count members with the lowest scores in a sorted set
Redis Docs
§fn bzmpop_max<'a, K, RV>(
&'a mut self,
timeout: f64,
keys: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bzmpop_max<'a, K, RV>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns up to count members with the highest scores,
from the first non-empty sorted set in the provided list of key names.
Blocks until a member is available otherwise.
Redis Docs
§fn zmpop_max<'a, K, RV>(
&'a mut self,
keys: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zmpop_max<'a, K, RV>( &'a mut self, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns up to count members with the highest scores,
from the first non-empty sorted set in the provided list of key names.
Redis Docs
§fn bzmpop_min<'a, K, RV>(
&'a mut self,
timeout: f64,
keys: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn bzmpop_min<'a, K, RV>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns up to count members with the lowest scores,
from the first non-empty sorted set in the provided list of key names.
Blocks until a member is available otherwise.
Redis Docs
§fn zmpop_min<'a, K, RV>(
&'a mut self,
keys: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zmpop_min<'a, K, RV>( &'a mut self, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns up to count members with the lowest scores,
from the first non-empty sorted set in the provided list of key names.
Redis Docs
§fn zrandmember<'a, K, RV>(
&'a mut self,
key: K,
count: Option<isize>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrandmember<'a, K, RV>( &'a mut self, key: K, count: Option<isize>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Return up to count random members in a sorted set (or 1 if
count == None)
Redis Docs§fn zrandmember_withscores<'a, K, RV>(
&'a mut self,
key: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrandmember_withscores<'a, K, RV>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Return up to count random members in a sorted set with scores
Redis Docs
§fn zrange<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrange<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by index
Redis Docs
§fn zrange_withscores<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by index with scores.
Redis Docs
§fn zrangebylex<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by lexicographical range.
Redis Docs
§fn zrangebylex_limit<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
Redis Docs
§fn zrevrangebylex<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by lexicographical range.
Redis Docs
§fn zrevrangebylex_limit<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
Redis Docs
§fn zrangebyscore<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by score.
Redis Docs
§fn zrangebyscore_withscores<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by score with scores.
Redis Docs
§fn zrangebyscore_limit<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by score with limit.
Redis Docs
§fn zrangebyscore_limit_withscores<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by score with limit with scores.
Redis Docs
§fn zrank<'a, K, M, RV>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrank<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Determine the index of a member in a sorted set.
Redis Docs
§fn zrem<'a, K, M, RV>(
&'a mut self,
key: K,
members: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrem<'a, K, M, RV>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove one or more members from a sorted set.
Redis Docs
§fn zrembylex<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Remove all members in a sorted set between the given lexicographical range.
Redis Docs
§fn zremrangebyrank<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zremrangebyrank<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove all members in a sorted set within the given indexes.
Redis Docs
§fn zrembyscore<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Remove all members in a sorted set within the given scores.
Redis Docs
§fn zrevrange<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrevrange<'a, K, RV>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by index,
ordered from high to low.
Redis Docs
§fn zrevrange_withscores<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by index, with scores
ordered from high to low.
Redis Docs
§fn zrevrangebyscore<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by score.
Redis Docs
§fn zrevrangebyscore_withscores<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by score with scores.
Redis Docs
§fn zrevrangebyscore_limit<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by score with limit.
Redis Docs
§fn zrevrangebyscore_limit_withscores<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Return a range of members in a sorted set, by score with limit with scores.
Redis Docs
§fn zrevrank<'a, K, M, RV>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrevrank<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Determine the index of a member in a sorted set, with scores ordered from high to low.
Redis Docs
§fn zscore<'a, K, M, RV>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zscore<'a, K, M, RV>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the score associated with the given member in a sorted set.
Redis Docs
§fn zscore_multiple<'a, K, M, RV>(
&'a mut self,
key: K,
members: &'a [M],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
Get the scores associated with multiple members in a sorted set.
Redis Docs
§fn zunionstore<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zunionstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Unions multiple sorted sets and store the resulting sorted set in
a new key using SUM as aggregation function.
Redis Docs
§fn zunionstore_min<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zunionstore_min<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Unions multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
Redis Docs
§fn zunionstore_max<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zunionstore_max<'a, D, K, RV>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Unions multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
Redis Docs
§fn zunionstore_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
[
Commands::zunionstore], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zunionstore_min_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
[
Commands::zunionstore_min], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zunionstore_max_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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>>
[
Commands::zunionstore_max], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn pfadd<'a, K, E, RV>(
&'a mut self,
key: K,
element: E,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pfadd<'a, K, E, RV>( &'a mut self, key: K, element: E, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Adds the specified elements to the specified HyperLogLog.
Redis Docs
§fn pfcount<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pfcount<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Return the approximated cardinality of the set(s) observed by the
HyperLogLog at key(s).
Redis Docs
§fn pfmerge<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pfmerge<'a, D, S, RV>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Merge N different HyperLogLogs into a single one.
Redis Docs
§fn publish<'a, K, E, RV>(
&'a mut self,
channel: K,
message: E,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn publish<'a, K, E, RV>( &'a mut self, channel: K, message: E, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Posts a message to the given channel.
Redis Docs
§fn spublish<'a, K, E, RV>(
&'a mut self,
channel: K,
message: E,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn spublish<'a, K, E, RV>( &'a mut self, channel: K, message: E, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Posts a message to the given sharded channel.
Redis Docs
§fn object_encoding<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn object_encoding<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the encoding of a key.
Redis Docs
§fn object_idletime<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn object_idletime<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the time in seconds since the last access of a key.
Redis Docs
§fn object_freq<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn object_freq<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the logarithmic access frequency counter of a key.
Redis Docs
§fn object_refcount<'a, K, RV>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn object_refcount<'a, K, RV>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the reference count of a key.
Redis Docs
§fn client_getname<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn client_getname<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Returns the name of the current connection as set by CLIENT SETNAME.
Redis Docs
§fn client_id<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn client_id<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Returns the ID of the current connection.
Redis Docs
§fn client_setname<'a, K, RV>(
&'a mut self,
connection_name: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn client_setname<'a, K, RV>( &'a mut self, connection_name: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Command assigns a name to the current connection.
Redis Docs
§fn load_script<'a, RV>(
&'a mut self,
script: &'a Script,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn load_script<'a, RV>(
&'a mut self,
script: &'a Script,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Load a script. Read more
§fn invoke_script<'a, RV>(
&'a mut self,
invocation: &'a ScriptInvocation<'a>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn invoke_script<'a, RV>(
&'a mut self,
invocation: &'a ScriptInvocation<'a>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Invoke a prepared script. Read more
§fn flushall<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn flushall<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Deletes all the keys of all databases Read more
§fn flushall_options<'a, RV>(
&'a mut self,
options: &'a FlushAllOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn flushall_options<'a, RV>(
&'a mut self,
options: &'a FlushAllOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Deletes all the keys of all databases with options Read more
§fn flushdb<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn flushdb<'a, RV>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Deletes all the keys of the current database Read more
§fn flushdb_options<'a, RV>(
&'a mut self,
options: &'a FlushAllOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn flushdb_options<'a, RV>(
&'a mut self,
options: &'a FlushAllOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Deletes all the keys of the current database with options Read more
§fn scan<RV>(
&mut self,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
RV: FromRedisValue,
fn scan<RV>(
&mut self,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
RV: FromRedisValue,
Incrementally iterate the keys space.
§fn scan_options<RV>(
&mut self,
opts: ScanOptions,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
RV: FromRedisValue,
fn scan_options<RV>(
&mut self,
opts: ScanOptions,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
RV: FromRedisValue,
Incrementally iterate the keys space with options.
§fn scan_match<P, RV>(
&mut self,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
P: ToSingleRedisArg,
RV: FromRedisValue,
fn scan_match<P, RV>(
&mut self,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
P: ToSingleRedisArg,
RV: FromRedisValue,
Incrementally iterate the keys space for keys matching a pattern.
§fn hscan<K, RV>(
&mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn hscan<K, RV>(
&mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
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: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
fn hscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
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: ToSingleRedisArg,
RV: FromRedisValue,
fn sscan<K, RV>(
&mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
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: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
fn sscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
Incrementally iterate set elements for elements matching a pattern.
§impl<T> AsyncTypedCommands for T
impl<T> AsyncTypedCommands for T
§fn get<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn get<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Get the value of a key. If key is a vec this becomes an
MGET (if using TypedCommands, you should specifically use mget to get the correct return type.
Redis Docs§fn mget<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Vec<Option<String>>, RedisError>> + Send + 'a>>
fn mget<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<Option<String>>, RedisError>> + Send + 'a>>
Get values of keys
Redis Docs
§fn keys<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn keys<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Gets all keys matching pattern
Redis Docs
§fn set<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn set<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Set the string value of a key.
Redis Docs
§fn set_options<'a, K, V>(
&'a mut self,
key: K,
value: V,
options: SetOptions,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn set_options<'a, K, V>( &'a mut self, key: K, value: V, options: SetOptions, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Set the string value of a key with options.
Redis Docs
§fn mset<'a, K, V>(
&'a mut self,
items: &'a [(K, V)],
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn mset<'a, K, V>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Sets multiple keys to their values.
Redis Docs
§fn set_ex<'a, K, V>(
&'a mut self,
key: K,
value: V,
seconds: u64,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn set_ex<'a, K, V>( &'a mut self, key: K, value: V, seconds: u64, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Set the value and expiration of a key.
Redis Docs
§fn pset_ex<'a, K, V>(
&'a mut self,
key: K,
value: V,
milliseconds: u64,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn pset_ex<'a, K, V>( &'a mut self, key: K, value: V, milliseconds: u64, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Set the value and expiration in milliseconds of a key.
Redis Docs
§fn set_nx<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn set_nx<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Set the value of a key, only if the key does not exist
Redis Docs
§fn mset_nx<'a, K, V>(
&'a mut self,
items: &'a [(K, V)],
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn mset_nx<'a, K, V>( &'a mut self, items: &'a [(K, V)], ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Sets multiple keys to their values failing if at least one already exists.
Redis Docs
§fn mset_ex<'a, K, V>(
&'a mut self,
items: &'a [(K, V)],
options: MSetOptions,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn mset_ex<'a, K, V>( &'a mut self, items: &'a [(K, V)], options: MSetOptions, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Sets the given keys to their respective values.
This command is an extension of the MSETNX that adds expiration and XX options.
Redis Docs
§fn getset<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn getset<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Set the string value of a key and return its old value.
Redis Docs
§fn getrange<'a, K>(
&'a mut self,
key: K,
from: isize,
to: isize,
) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
fn getrange<'a, K>( &'a mut self, key: K, from: isize, to: isize, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.
Redis returns an empty string if the key doesn’t exist, not Nil
Redis Docs
§fn setrange<'a, K, V>(
&'a mut self,
key: K,
offset: isize,
value: V,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn setrange<'a, K, V>( &'a mut self, key: K, offset: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Overwrite the part of the value stored in key at the specified offset.
Redis Docs
§fn del<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn del<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Delete one or more keys.
Returns the number of keys deleted.
Redis Docs
§fn del_ex<'a, K>(
&'a mut self,
key: K,
value_comparison: ValueComparison,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn del_ex<'a, K>( &'a mut self, key: K, value_comparison: ValueComparison, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Conditionally removes the specified key. A key is ignored if it does not exist.
IFEQ
match-value - Delete the key only if its value is equal to match-value
IFNE match-value - Delete the key only if its value is not equal to match-value
IFDEQ match-digest - Delete the key only if the digest of its value is equal to match-digest
IFDNE match-digest - Delete the key only if the digest of its value is not equal to match-digest
Redis Docs§fn digest<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn digest<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Get the hex signature of the value stored in the specified key.
For the digest, Redis will use XXH3
Redis Docs
§fn exists<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn exists<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Determine if a key exists.
Redis Docs
§fn key_type<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<ValueType, RedisError>> + Send + 'a>>
fn key_type<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<ValueType, RedisError>> + Send + 'a>>
Determine the type of key.
Redis Docs
§fn expire<'a, K>(
&'a mut self,
key: K,
seconds: i64,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn expire<'a, K>( &'a mut self, key: K, seconds: i64, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Set a key’s time to live in seconds.
Returns whether expiration was set.
Redis Docs
§fn expire_at<'a, K>(
&'a mut self,
key: K,
ts: i64,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn expire_at<'a, K>( &'a mut self, key: K, ts: i64, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Set the expiration for a key as a UNIX timestamp.
Returns whether expiration was set.
Redis Docs
§fn pexpire<'a, K>(
&'a mut self,
key: K,
ms: i64,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn pexpire<'a, K>( &'a mut self, key: K, ms: i64, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Set a key’s time to live in milliseconds.
Returns whether expiration was set.
Redis Docs
§fn pexpire_at<'a, K>(
&'a mut self,
key: K,
ts: i64,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn pexpire_at<'a, K>( &'a mut self, key: K, ts: i64, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Set the expiration for a key as a UNIX timestamp in milliseconds.
Returns whether expiration was set.
Redis Docs
§fn expire_time<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
fn expire_time<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
Get the absolute Unix expiration timestamp in seconds.
Returns
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn pexpire_time<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
fn pexpire_time<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
Get the absolute Unix expiration timestamp in milliseconds.
Returns
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn persist<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn persist<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Remove the expiration from a key.
Returns whether a timeout was removed.
Redis Docs
§fn ttl<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
fn ttl<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
Get the time to live for a key in seconds.
Returns
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn pttl<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
fn pttl<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<IntegerReplyOrNoOp, RedisError>> + Send + 'a>>
Get the time to live for a key in milliseconds.
Returns
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn get_ex<'a, K>(
&'a mut self,
key: K,
expire_at: Expiry,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn get_ex<'a, K>( &'a mut self, key: K, expire_at: Expiry, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Get the value of a key and set expiration
Redis Docs
§fn get_del<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn get_del<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Get the value of a key and delete it
Redis Docs
§fn copy<'a, KSrc, KDst, Db>(
&'a mut self,
source: KSrc,
destination: KDst,
options: CopyOptions<Db>,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn copy<'a, KSrc, KDst, Db>( &'a mut self, source: KSrc, destination: KDst, options: CopyOptions<Db>, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Copy the value from one key to another, returning whether the copy was successful.
Redis Docs
§fn rename<'a, K, N>(
&'a mut self,
key: K,
new_key: N,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn rename<'a, K, N>( &'a mut self, key: K, new_key: N, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Rename a key.
Errors if key does not exist.
Redis Docs
§fn rename_nx<'a, K, N>(
&'a mut self,
key: K,
new_key: N,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn rename_nx<'a, K, N>( &'a mut self, key: K, new_key: N, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Rename a key, only if the new key does not exist.
Errors if key does not exist.
Returns whether the key was renamed, or false if the new key already exists.
Redis Docs
§fn unlink<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn unlink<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Unlink one or more keys. This is a non-blocking version of
DEL.
Returns number of keys unlinked.
Redis Docs§fn append<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn append<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Append a value to a key.
Returns length of string after operation.
Redis Docs
§fn incr<'a, K, V>(
&'a mut self,
key: K,
delta: V,
) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
fn incr<'a, K, V>( &'a mut self, key: K, delta: V, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
Increment the numeric value of a key by the given amount. This
issues a
INCRBY or INCRBYFLOAT depending on the type.
If the key does not exist, it is set to 0 before performing the operation.§fn decr<'a, K, V>(
&'a mut self,
key: K,
delta: V,
) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
fn decr<'a, K, V>( &'a mut self, key: K, delta: V, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
Decrement the numeric value of a key by the given amount.
If the key does not exist, it is set to 0 before performing the operation.
Redis Docs
§fn setbit<'a, K>(
&'a mut self,
key: K,
offset: usize,
value: bool,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn setbit<'a, K>( &'a mut self, key: K, offset: usize, value: bool, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Sets or clears the bit at offset in the string value stored at key.
Returns the original bit value stored at offset.
Redis Docs
§fn getbit<'a, K>(
&'a mut self,
key: K,
offset: usize,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn getbit<'a, K>( &'a mut self, key: K, offset: usize, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Returns the bit value at offset in the string value stored at key.
Redis Docs
§fn bitcount<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bitcount<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Count set bits in a string.
Returns 0 if key does not exist.
Redis Docs
§fn bitcount_range<'a, K>(
&'a mut self,
key: K,
start: usize,
end: usize,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bitcount_range<'a, K>( &'a mut self, key: K, start: usize, end: usize, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Count set bits in a string in a range.
Returns 0 if key does not exist.
Redis Docs
§fn bit_and<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bit_and<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Perform a bitwise AND between multiple keys (containing string values)
and store the result in the destination key.
Returns size of destination string after operation.
Redis Docs
§fn bit_or<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bit_or<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Perform a bitwise OR between multiple keys (containing string values)
and store the result in the destination key.
Returns size of destination string after operation.
Redis Docs
§fn bit_xor<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bit_xor<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Perform a bitwise XOR between multiple keys (containing string values)
and store the result in the destination key.
Returns size of destination string after operation.
Redis Docs
§fn bit_not<'a, D, S>(
&'a mut self,
dstkey: D,
srckey: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bit_not<'a, D, S>( &'a mut self, dstkey: D, srckey: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Perform a bitwise NOT of the key (containing string values)
and store the result in the destination key.
Returns size of destination string after operation.
Redis Docs
§fn bit_diff<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bit_diff<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
DIFF(X, Y1, Y2, …)
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_diff1<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bit_diff1<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
DIFF1(X, Y1, Y2, …) (Relative complement difference)
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_and_or<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bit_and_or<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
ANDOR(X, Y1, Y2, …)
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_one<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn bit_one<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
ONE(X, Y1, Y2, …)
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
§fn strlen<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn strlen<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Get the length of the value stored in a key.
0 if key does not exist.
Redis Docs
§fn hget<'a, K, F>(
&'a mut self,
key: K,
field: F,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn hget<'a, K, F>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Gets a single (or multiple) fields from a hash.
§fn hmget<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn hmget<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Gets multiple fields from a hash.
Redis Docs
§fn hget_ex<'a, K, F>(
&'a mut self,
key: K,
fields: F,
expire_at: Expiry,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn hget_ex<'a, K, F>( &'a mut self, key: K, fields: F, expire_at: Expiry, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Get the value of one or more fields of a given hash key, and optionally set their expiration
Redis Docs
§fn hdel<'a, K, F>(
&'a mut self,
key: K,
field: F,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn hdel<'a, K, F>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Deletes a single (or multiple) fields from a hash.
Returns number of fields deleted.
Redis Docs
§fn hget_del<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<Option<String>>, RedisError>> + Send + 'a>>
fn hget_del<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<Option<String>>, RedisError>> + Send + 'a>>
Get and delete the value of one or more fields of a given hash key
Redis Docs
§fn hset<'a, K, F, V>(
&'a mut self,
key: K,
field: F,
value: V,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn hset<'a, K, F, V>( &'a mut self, key: K, field: F, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Sets a single field in a hash.
Returns number of fields added.
Redis Docs
§fn hset_ex<'a, K, F, V>(
&'a mut self,
key: K,
hash_field_expiration_options: &'a HashFieldExpirationOptions,
fields_values: &'a [(F, V)],
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn hset_ex<'a, K, F, V>( &'a mut self, key: K, hash_field_expiration_options: &'a HashFieldExpirationOptions, fields_values: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Set the value of one or more fields of a given hash key, and optionally set their expiration
Redis Docs
§fn hset_nx<'a, K, F, V>(
&'a mut self,
key: K,
field: F,
value: V,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn hset_nx<'a, K, F, V>( &'a mut self, key: K, field: F, value: V, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Sets a single field in a hash if it does not exist.
Returns whether the field was added.
Redis Docs
§fn hset_multiple<'a, K, F, V>(
&'a mut self,
key: K,
items: &'a [(F, V)],
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn hset_multiple<'a, K, F, V>( &'a mut self, key: K, items: &'a [(F, V)], ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Sets multiple fields in a hash.
Redis Docs
§fn hincr<'a, K, F, D>(
&'a mut self,
key: K,
field: F,
delta: D,
) -> Pin<Box<dyn Future<Output = Result<f64, RedisError>> + Send + 'a>>
fn hincr<'a, K, F, D>( &'a mut self, key: K, field: F, delta: D, ) -> Pin<Box<dyn Future<Output = Result<f64, RedisError>> + Send + 'a>>
Increments a value.
Returns the new value of the field after incrementation.
§fn hexists<'a, K, F>(
&'a mut self,
key: K,
field: F,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn hexists<'a, K, F>( &'a mut self, key: K, field: F, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Checks if a field in a hash exists.
Redis Docs
§fn httl<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn httl<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Get one or more fields’ TTL in seconds.
Redis Docs
§fn hpttl<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn hpttl<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Get one or more fields’ TTL in milliseconds.
Redis Docs
§fn hexpire<'a, K, F>(
&'a mut self,
key: K,
seconds: i64,
opt: ExpireOption,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn hexpire<'a, K, F>( &'a mut self, key: K, seconds: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Set one or more fields’ time to live in seconds.
Returns an array where each element corresponds to the field at the same index in the fields argument.
Each element of the array is either:
0 if the specified condition has not been met.
1 if the expiration time was updated.
2 if called with 0 seconds.
Errors if provided key exists but is not a hash.
Redis Docs
§fn hexpire_at<'a, K, F>(
&'a mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn hexpire_at<'a, K, F>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Set the expiration for one or more fields as a UNIX timestamp in seconds.
Returns an array where each element corresponds to the field at the same index in the fields argument.
Each element of the array is either:
0 if the specified condition has not been met.
1 if the expiration time was updated.
2 if called with a time in the past.
Errors if provided key exists but is not a hash.
Redis Docs
§fn hexpire_time<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn hexpire_time<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Returns the absolute Unix expiration timestamp in seconds.
Redis Docs
§fn hpersist<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn hpersist<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Remove the expiration from a key.
Returns 1 if the expiration was removed.
Redis Docs
§fn hpexpire<'a, K, F>(
&'a mut self,
key: K,
milliseconds: i64,
opt: ExpireOption,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn hpexpire<'a, K, F>( &'a mut self, key: K, milliseconds: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Set one or more fields’ time to live in milliseconds.
Returns an array where each element corresponds to the field at the same index in the fields argument.
Each element of the array is either:
0 if the specified condition has not been met.
1 if the expiration time was updated.
2 if called with 0 seconds.
Errors if provided key exists but is not a hash.
Redis Docs
§fn hpexpire_at<'a, K, F>(
&'a mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn hpexpire_at<'a, K, F>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Set the expiration for one or more fields as a UNIX timestamp in milliseconds.
Returns an array where each element corresponds to the field at the same index in the fields argument.
Each element of the array is either:
0 if the specified condition has not been met.
1 if the expiration time was updated.
2 if called with a time in the past.
Errors if provided key exists but is not a hash.
Redis Docs
§fn hpexpire_time<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
fn hpexpire_time<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Pin<Box<dyn Future<Output = Result<Vec<IntegerReplyOrNoOp>, RedisError>> + Send + 'a>>
Returns the absolute Unix expiration timestamp in seconds.
Redis Docs
§fn hkeys<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn hkeys<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Gets all the keys in a hash.
Redis Docs
§fn hvals<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn hvals<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Gets all the values in a hash.
Redis Docs
§fn hgetall<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<HashMap<String, String>, RedisError>> + Send + 'a>>
fn hgetall<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<HashMap<String, String>, RedisError>> + Send + 'a>>
Gets all the fields and values in a hash.
Redis Docs
§fn hlen<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn hlen<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Gets the length of a hash.
Returns 0 if key does not exist.
Redis Docs
§fn blmove<'a, S, D>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn blmove<'a, S, D>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Pop an element from a list, push it to another list
and return it; or block until one is available
Redis Docs
§fn blmpop<'a, K>(
&'a mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
fn blmpop<'a, K>( &'a mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
Pops
count elements from the first non-empty list key from the list of
provided key names; or blocks until one is available.
Redis Docs§fn blpop<'a, K>(
&'a mut self,
key: K,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
fn blpop<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
Remove and get the first element in a list, or block until one is available.
Redis Docs
§fn brpop<'a, K>(
&'a mut self,
key: K,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
fn brpop<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<[String; 2]>, RedisError>> + Send + 'a>>
Remove and get the last element in a list, or block until one is available.
Redis Docs
§fn brpoplpush<'a, S, D>(
&'a mut self,
srckey: S,
dstkey: D,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn brpoplpush<'a, S, D>( &'a mut self, srckey: S, dstkey: D, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Pop a value from a list, push it to another list and return it;
or block until one is available.
Redis Docs
§fn lindex<'a, K>(
&'a mut self,
key: K,
index: isize,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn lindex<'a, K>( &'a mut self, key: K, index: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Get an element from a list by its index.
Redis Docs
§fn linsert_before<'a, K, P, V>(
&'a mut self,
key: K,
pivot: P,
value: V,
) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
fn linsert_before<'a, K, P, V>( &'a mut self, key: K, pivot: P, value: V, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
Insert an element before another element in a list.
Redis Docs
§fn linsert_after<'a, K, P, V>(
&'a mut self,
key: K,
pivot: P,
value: V,
) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
fn linsert_after<'a, K, P, V>( &'a mut self, key: K, pivot: P, value: V, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
Insert an element after another element in a list.
Redis Docs
§fn llen<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn llen<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Returns the length of the list stored at key.
Redis Docs
§fn lmove<'a, S, D>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
fn lmove<'a, S, D>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
Pop an element a list, push it to another list and return it
Redis Docs
§fn lmpop<'a, K>(
&'a mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<String>)>, RedisError>> + Send + 'a>>
fn lmpop<'a, K>( &'a mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<String>)>, RedisError>> + Send + 'a>>
Pops
count elements from the first non-empty list key from the list of
provided key names.
Redis Docs§fn lpop<'a, RV, K>(
&'a mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn lpop<'a, RV, K>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns the up to
count first elements of the list stored at key. Read more§fn lpos<'a, RV, K, V>(
&'a mut self,
key: K,
value: V,
options: LposOptions,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn lpos<'a, RV, K, V>( &'a mut self, key: K, value: V, options: LposOptions, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Returns the index of the first matching value of the list stored at key.
Redis Docs
§fn lpush<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn lpush<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Insert all the specified values at the head of the list stored at key.
Redis Docs
§fn lpush_exists<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn lpush_exists<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Inserts a value at the head of the list stored at key, only if key
already exists and holds a list.
Redis Docs
§fn lrange<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn lrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Returns the specified elements of the list stored at key.
Redis Docs
§fn lrem<'a, K, V>(
&'a mut self,
key: K,
count: isize,
value: V,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn lrem<'a, K, V>( &'a mut self, key: K, count: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Removes the first count occurrences of elements equal to value
from the list stored at key.
Redis Docs
§fn ltrim<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn ltrim<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Trim an existing list so that it will contain only the specified
range of elements specified.
Redis Docs
§fn lset<'a, K, V>(
&'a mut self,
key: K,
index: isize,
value: V,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn lset<'a, K, V>( &'a mut self, key: K, index: isize, value: V, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Sets the list element at index to value
Redis Docs
§fn ping<'a>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
fn ping<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
Sends a ping to the server
Redis Docs
§fn ping_message<'a, K>(
&'a mut self,
message: K,
) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
fn ping_message<'a, K>( &'a mut self, message: K, ) -> Pin<Box<dyn Future<Output = Result<String, RedisError>> + Send + 'a>>
Sends a ping with a message to the server
Redis Docs
§fn rpop<'a, RV, K>(
&'a mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn rpop<'a, RV, K>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Removes and returns the up to
count last elements of the list stored at key Read more§fn rpoplpush<'a, K, D>(
&'a mut self,
key: K,
dstkey: D,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn rpoplpush<'a, K, D>( &'a mut self, key: K, dstkey: D, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Pop a value from a list, push it to another list and return it.
Redis Docs
§fn rpush<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn rpush<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Insert all the specified values at the tail of the list stored at key.
Redis Docs
§fn rpush_exists<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn rpush_exists<'a, K, V>( &'a mut self, key: K, value: V, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Inserts value at the tail of the list stored at key, only if key
already exists and holds a list.
Redis Docs
§fn sadd<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn sadd<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Add one or more members to a set.
Redis Docs
§fn scard<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn scard<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Get the number of members in a set.
Redis Docs
§fn sdiff<'a, K>(
&'a mut self,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
fn sdiff<'a, K>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
Subtract multiple sets.
Redis Docs
§fn sdiffstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn sdiffstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Subtract multiple sets and store the resulting set in a key.
Redis Docs
§fn sinter<'a, K>(
&'a mut self,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
fn sinter<'a, K>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
Intersect multiple sets.
Redis Docs
§fn sinterstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn sinterstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Intersect multiple sets and store the resulting set in a key.
Redis Docs
§fn sismember<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn sismember<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Determine if a given value is a member of a set.
Redis Docs
§fn smismember<'a, K, M>(
&'a mut self,
key: K,
members: M,
) -> Pin<Box<dyn Future<Output = Result<Vec<bool>, RedisError>> + Send + 'a>>
fn smismember<'a, K, M>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<bool>, RedisError>> + Send + 'a>>
Determine if given values are members of a set.
Redis Docs
§fn smembers<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
fn smembers<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
Get all the members in a set.
Redis Docs
§fn smove<'a, S, D, M>(
&'a mut self,
srckey: S,
dstkey: D,
member: M,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn smove<'a, S, D, M>( &'a mut self, srckey: S, dstkey: D, member: M, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Move a member from one set to another.
Redis Docs
§fn spop<'a, RV, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn spop<'a, RV, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Remove and return a random member from a set.
Redis Docs
§fn srandmember<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn srandmember<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Get one random member from a set.
Redis Docs
§fn srandmember_multiple<'a, K>(
&'a mut self,
key: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn srandmember_multiple<'a, K>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Get multiple random members from a set.
Redis Docs
§fn srem<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn srem<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Remove one or more members from a set.
Redis Docs
§fn sunion<'a, K>(
&'a mut self,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
fn sunion<'a, K>( &'a mut self, keys: K, ) -> Pin<Box<dyn Future<Output = Result<HashSet<String>, RedisError>> + Send + 'a>>
Add multiple sets.
Redis Docs
§fn sunionstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn sunionstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Add multiple sets and store the resulting set in a key.
Redis Docs
§fn zadd<'a, K, S, M>(
&'a mut self,
key: K,
member: M,
score: S,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zadd<'a, K, S, M>( &'a mut self, key: K, member: M, score: S, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Add one member to a sorted set, or update its score if it already exists.
Redis Docs
§fn zadd_multiple<'a, K, S, M>(
&'a mut self,
key: K,
items: &'a [(S, M)],
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zadd_multiple<'a, K, S, M>( &'a mut self, key: K, items: &'a [(S, M)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Add multiple members to a sorted set, or update its score if it already exists.
Redis Docs
§fn zadd_options<'a, K, S, M>(
&'a mut self,
key: K,
member: M,
score: S,
options: &'a SortedSetAddOptions,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zadd_options<'a, K, S, M>( &'a mut self, key: K, member: M, score: S, options: &'a SortedSetAddOptions, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Add one member to a sorted set, or update its score if it already exists.
Redis Docs
§fn zadd_multiple_options<'a, K, S, M>(
&'a mut self,
key: K,
items: &'a [(S, M)],
options: &'a SortedSetAddOptions,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zadd_multiple_options<'a, K, S, M>( &'a mut self, key: K, items: &'a [(S, M)], options: &'a SortedSetAddOptions, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Add multiple members to a sorted set, or update its score if it already exists.
Redis Docs
§fn zcard<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zcard<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Get the number of members in a sorted set.
Redis Docs
§fn zcount<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zcount<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Count the members in a sorted set with scores within the given values.
Redis Docs
§fn zincr<'a, K, M, D>(
&'a mut self,
key: K,
member: M,
delta: D,
) -> Pin<Box<dyn Future<Output = Result<f64, RedisError>> + Send + 'a>>
fn zincr<'a, K, M, D>( &'a mut self, key: K, member: M, delta: D, ) -> Pin<Box<dyn Future<Output = Result<f64, RedisError>> + Send + 'a>>
Increments the member in a sorted set at key by delta.
If the member does not exist, it is added with delta as its score.
Redis Docs
§fn zinterstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zinterstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using SUM as aggregation function.
Redis Docs
§fn zinterstore_min<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zinterstore_min<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
Redis Docs
§fn zinterstore_max<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zinterstore_max<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
Redis Docs
§fn zinterstore_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zinterstore_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
[
Commands::zinterstore], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zinterstore_min_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zinterstore_min_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
[
Commands::zinterstore_min], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zinterstore_max_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zinterstore_max_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
[
Commands::zinterstore_max], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zlexcount<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zlexcount<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Count the number of members in a sorted set between a given lexicographical range.
Redis Docs
§fn bzpopmax<'a, K>(
&'a mut self,
key: K,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<Option<(String, String, f64)>, RedisError>> + Send + 'a>>
fn bzpopmax<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, String, f64)>, RedisError>> + Send + 'a>>
Removes and returns the member with the highest score in a sorted set.
Blocks until a member is available otherwise.
Redis Docs
§fn zpopmax<'a, K>(
&'a mut self,
key: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zpopmax<'a, K>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Removes and returns up to count members with the highest scores in a sorted set
Redis Docs
§fn bzpopmin<'a, K>(
&'a mut self,
key: K,
timeout: f64,
) -> Pin<Box<dyn Future<Output = Result<Option<(String, String, f64)>, RedisError>> + Send + 'a>>
fn bzpopmin<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, String, f64)>, RedisError>> + Send + 'a>>
Removes and returns the member with the lowest score in a sorted set.
Blocks until a member is available otherwise.
Redis Docs
§fn zpopmin<'a, K>(
&'a mut self,
key: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zpopmin<'a, K>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Removes and returns up to count members with the lowest scores in a sorted set
Redis Docs
§fn bzmpop_max<'a, K>(
&'a mut self,
timeout: f64,
keys: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
fn bzmpop_max<'a, K>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
Removes and returns up to count members with the highest scores,
from the first non-empty sorted set in the provided list of key names.
Blocks until a member is available otherwise.
Redis Docs
§fn zmpop_max<'a, K>(
&'a mut self,
keys: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
fn zmpop_max<'a, K>( &'a mut self, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
Removes and returns up to count members with the highest scores,
from the first non-empty sorted set in the provided list of key names.
Redis Docs
§fn bzmpop_min<'a, K>(
&'a mut self,
timeout: f64,
keys: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
fn bzmpop_min<'a, K>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
Removes and returns up to count members with the lowest scores,
from the first non-empty sorted set in the provided list of key names.
Blocks until a member is available otherwise.
Redis Docs
§fn zmpop_min<'a, K>(
&'a mut self,
keys: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
fn zmpop_min<'a, K>( &'a mut self, keys: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Option<(String, Vec<(String, f64)>)>, RedisError>> + Send + 'a>>
Removes and returns up to count members with the lowest scores,
from the first non-empty sorted set in the provided list of key names.
Redis Docs
§fn zrandmember<'a, RV, K>(
&'a mut self,
key: K,
count: Option<isize>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrandmember<'a, RV, K>( &'a mut self, key: K, count: Option<isize>, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Return up to count random members in a sorted set (or 1 if
count == None)
Redis Docs§fn zrandmember_withscores<'a, RV, K>(
&'a mut self,
key: K,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zrandmember_withscores<'a, RV, K>( &'a mut self, key: K, count: isize, ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Return up to count random members in a sorted set with scores
Redis Docs
§fn zrange<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by index
Redis Docs
§fn zrange_withscores<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<(String, f64)>, RedisError>> + Send + 'a>>
fn zrange_withscores<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<(String, f64)>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by index with scores.
Redis Docs
§fn zrangebylex<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrangebylex<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by lexicographical range.
Redis Docs
§fn zrangebylex_limit<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrangebylex_limit<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
Redis Docs
§fn zrevrangebylex<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrevrangebylex<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by lexicographical range.
Redis Docs
§fn zrevrangebylex_limit<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrevrangebylex_limit<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
Redis Docs
§fn zrangebyscore<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrangebyscore<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by score.
Redis Docs
§fn zrangebyscore_withscores<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<Vec<(String, usize)>, RedisError>> + Send + 'a>>
fn zrangebyscore_withscores<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<Vec<(String, usize)>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by score with scores.
Redis Docs
§fn zrangebyscore_limit<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrangebyscore_limit<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by score with limit.
Redis Docs
§fn zrangebyscore_limit_withscores<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<(String, usize)>, RedisError>> + Send + 'a>>
fn zrangebyscore_limit_withscores<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<(String, usize)>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by score with limit with scores.
Redis Docs
§fn zrank<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
fn zrank<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
Determine the index of a member in a sorted set.
Redis Docs
§fn zrem<'a, K, M>(
&'a mut self,
key: K,
members: M,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zrem<'a, K, M>( &'a mut self, key: K, members: M, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Remove one or more members from a sorted set.
Redis Docs
§fn zrembylex<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zrembylex<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Remove all members in a sorted set between the given lexicographical range.
Redis Docs
§fn zremrangebyrank<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zremrangebyrank<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Remove all members in a sorted set within the given indexes.
Redis Docs
§fn zrembyscore<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zrembyscore<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Remove all members in a sorted set within the given scores.
Redis Docs
§fn zrevrange<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrevrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by index,
ordered from high to low.
Redis Docs
§fn zrevrange_withscores<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrevrange_withscores<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by index, with scores
ordered from high to low.
Redis Docs
§fn zrevrangebyscore<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrevrangebyscore<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by score.
Redis Docs
§fn zrevrangebyscore_withscores<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrevrangebyscore_withscores<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by score with scores.
Redis Docs
§fn zrevrangebyscore_limit<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrevrangebyscore_limit<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by score with limit.
Redis Docs
§fn zrevrangebyscore_limit_withscores<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
fn zrevrangebyscore_limit_withscores<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, RedisError>> + Send + 'a>>
Return a range of members in a sorted set, by score with limit with scores.
Redis Docs
§fn zrevrank<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
fn zrevrank<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
Determine the index of a member in a sorted set, with scores ordered from high to low.
Redis Docs
§fn zscore<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Pin<Box<dyn Future<Output = Result<Option<f64>, RedisError>> + Send + 'a>>
fn zscore<'a, K, M>( &'a mut self, key: K, member: M, ) -> Pin<Box<dyn Future<Output = Result<Option<f64>, RedisError>> + Send + 'a>>
Get the score associated with the given member in a sorted set.
Redis Docs
§fn zscore_multiple<'a, K, M>(
&'a mut self,
key: K,
members: &'a [M],
) -> Pin<Box<dyn Future<Output = Result<Option<Vec<f64>>, RedisError>> + Send + 'a>>
fn zscore_multiple<'a, K, M>( &'a mut self, key: K, members: &'a [M], ) -> Pin<Box<dyn Future<Output = Result<Option<Vec<f64>>, RedisError>> + Send + 'a>>
Get the scores associated with multiple members in a sorted set.
Redis Docs
§fn zunionstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zunionstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Unions multiple sorted sets and store the resulting sorted set in
a new key using SUM as aggregation function.
Redis Docs
§fn zunionstore_min<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zunionstore_min<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Unions multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
Redis Docs
§fn zunionstore_max<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zunionstore_max<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Unions multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
Redis Docs
§fn zunionstore_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zunionstore_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
[
Commands::zunionstore], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zunionstore_min_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zunionstore_min_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
[
Commands::zunionstore_min], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zunionstore_max_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn zunionstore_max_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
[
Commands::zunionstore_max], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn pfadd<'a, K, E>(
&'a mut self,
key: K,
element: E,
) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
fn pfadd<'a, K, E>( &'a mut self, key: K, element: E, ) -> Pin<Box<dyn Future<Output = Result<bool, RedisError>> + Send + 'a>>
Adds the specified elements to the specified HyperLogLog.
Redis Docs
§fn pfcount<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn pfcount<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Return the approximated cardinality of the set(s) observed by the
HyperLogLog at key(s).
Redis Docs
§fn pfmerge<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn pfmerge<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Merge N different HyperLogLogs into a single one.
Redis Docs
§fn publish<'a, K, E>(
&'a mut self,
channel: K,
message: E,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn publish<'a, K, E>( &'a mut self, channel: K, message: E, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Posts a message to the given channel.
Redis Docs
§fn spublish<'a, K, E>(
&'a mut self,
channel: K,
message: E,
) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
fn spublish<'a, K, E>( &'a mut self, channel: K, message: E, ) -> Pin<Box<dyn Future<Output = Result<usize, RedisError>> + Send + 'a>>
Posts a message to the given sharded channel.
Redis Docs
§fn object_encoding<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn object_encoding<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Returns the encoding of a key.
Redis Docs
§fn object_idletime<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
fn object_idletime<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
Returns the time in seconds since the last access of a key.
Redis Docs
§fn object_freq<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
fn object_freq<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
Returns the logarithmic access frequency counter of a key.
Redis Docs
§fn object_refcount<'a, K>(
&'a mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
fn object_refcount<'a, K>( &'a mut self, key: K, ) -> Pin<Box<dyn Future<Output = Result<Option<usize>, RedisError>> + Send + 'a>>
Returns the reference count of a key.
Redis Docs
§fn client_getname<'a>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
fn client_getname<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<Option<String>, RedisError>> + Send + 'a>>
Returns the name of the current connection as set by CLIENT SETNAME.
Redis Docs
§fn client_id<'a>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
fn client_id<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<isize, RedisError>> + Send + 'a>>
Returns the ID of the current connection.
Redis Docs
§fn client_setname<'a, K>(
&'a mut self,
connection_name: K,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn client_setname<'a, K>( &'a mut self, connection_name: K, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Command assigns a name to the current connection.
Redis Docs
§fn load_script<'a, RV>(
&'a mut self,
script: &'a Script,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn load_script<'a, RV>(
&'a mut self,
script: &'a Script,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Load a script. Read more
§fn invoke_script<'a, RV>(
&'a mut self,
invocation: &'a ScriptInvocation<'a>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
fn invoke_script<'a, RV>(
&'a mut self,
invocation: &'a ScriptInvocation<'a>,
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
RV: FromRedisValue,
Invoke a prepared script. Read more
§fn flushall<'a>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn flushall<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Deletes all the keys of all databases Read more
§fn flushall_options<'a>(
&'a mut self,
options: &'a FlushAllOptions,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn flushall_options<'a>( &'a mut self, options: &'a FlushAllOptions, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Deletes all the keys of all databases with options Read more
§fn flushdb<'a>(
&'a mut self,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn flushdb<'a>( &'a mut self, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Deletes all the keys of the current database Read more
§fn flushdb_options<'a>(
&'a mut self,
options: &'a FlushAllOptions,
) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
fn flushdb_options<'a>( &'a mut self, options: &'a FlushAllOptions, ) -> Pin<Box<dyn Future<Output = Result<(), RedisError>> + Send + 'a>>
Deletes all the keys of the current database with options Read more
§fn scan<RV>(
&mut self,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
RV: FromRedisValue,
fn scan<RV>(
&mut self,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
RV: FromRedisValue,
Incrementally iterate the keys space.
§fn scan_options<RV>(
&mut self,
opts: ScanOptions,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
RV: FromRedisValue,
fn scan_options<RV>(
&mut self,
opts: ScanOptions,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
RV: FromRedisValue,
Incrementally iterate the keys space with options.
§fn scan_match<P, RV>(
&mut self,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
P: ToSingleRedisArg,
RV: FromRedisValue,
fn scan_match<P, RV>(
&mut self,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
P: ToSingleRedisArg,
RV: FromRedisValue,
Incrementally iterate the keys space for keys matching a pattern.
§fn hscan<K, RV>(
&mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn hscan<K, RV>(
&mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
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: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
fn hscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
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: ToSingleRedisArg,
RV: FromRedisValue,
fn sscan<K, RV>(
&mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
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: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
fn sscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
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: ToSingleRedisArg,
RV: FromRedisValue,
fn zscan<K, RV>(
&mut self,
key: K,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
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: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
fn zscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
Incrementally iterate sorted set elements for elements matching a pattern.
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more