Struct deadpool_redis::Connection
source · pub struct Connection { /* private fields */ }Expand description
Wrapper around redis::aio::MultiplexedConnection.
This structure implements redis::aio::ConnectionLike and can therefore
be used just like a regular redis::aio::MultiplexedConnection.
Implementations§
source§impl Connection
impl Connection
sourcepub fn take(this: Self) -> MultiplexedConnection
pub fn take(this: Self) -> MultiplexedConnection
Takes this Connection from its Pool permanently.
This reduces the size of the Pool.
Methods from Deref<Target = MultiplexedConnection>§
sourcepub fn set_response_timeout(&mut self, timeout: Duration)
pub fn set_response_timeout(&mut self, timeout: Duration)
Sets the time that the multiplexer will wait for responses on operations before failing.
sourcepub async fn send_packed_command(
&mut self,
cmd: &Cmd
) -> Result<Value, RedisError>
pub async fn send_packed_command( &mut self, cmd: &Cmd ) -> Result<Value, RedisError>
Sends an already encoded (packed) command into the TCP socket and reads the single response from it.
sourcepub async fn send_packed_commands(
&mut self,
cmd: &Pipeline,
offset: usize,
count: usize
) -> Result<Vec<Value>, RedisError>
pub async fn send_packed_commands( &mut self, cmd: &Pipeline, offset: usize, count: usize ) -> Result<Vec<Value>, RedisError>
Sends multiple already encoded (packed) command into the TCP socket
and reads count responses from it. This is used to implement
pipelining.
Trait Implementations§
source§impl AsMut<MultiplexedConnection> for Connection
impl AsMut<MultiplexedConnection> for Connection
source§fn as_mut(&mut self) -> &mut MultiplexedConnection
fn as_mut(&mut self) -> &mut MultiplexedConnection
Converts this type into a mutable reference of the (usually inferred) input type.
source§impl AsRef<MultiplexedConnection> for Connection
impl AsRef<MultiplexedConnection> for Connection
source§fn as_ref(&self) -> &MultiplexedConnection
fn as_ref(&self) -> &MultiplexedConnection
Converts this type into a shared reference of the (usually inferred) input type.
source§impl ConnectionLike for Connection
impl ConnectionLike for Connection
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.
source§impl Deref for Connection
impl Deref for Connection
§type Target = MultiplexedConnection
type Target = MultiplexedConnection
The resulting type after dereferencing.
source§fn deref(&self) -> &MultiplexedConnection
fn deref(&self) -> &MultiplexedConnection
Dereferences the value.
source§impl DerefMut for Connection
impl DerefMut for Connection
source§fn deref_mut(&mut self) -> &mut MultiplexedConnection
fn deref_mut(&mut self) -> &mut MultiplexedConnection
Mutably dereferences the value.
Auto Trait Implementations§
impl Freeze for Connection
impl !RefUnwindSafe for Connection
impl Send for Connection
impl Sync for Connection
impl Unpin for Connection
impl !UnwindSafe for Connection
Blanket Implementations§
source§impl<T> AsyncCommands for Twhere
T: ConnectionLike + Send,
impl<T> AsyncCommands for Twhere
T: ConnectionLike + Send,
source§fn get<'a, K, RV>(
&'a mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.source§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
source§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
source§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.
source§fn set_options<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
options: SetOptions
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn set_multiple<'a, K, V, RV>(
&'a mut self,
items: &'a [(K, V)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn set_multiple<'a, K, V, RV>( &'a mut self, items: &'a [(K, V)] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
👎Deprecated since 0.22.4: Renamed to mset() to reflect Redis name
Sets multiple keys to their values.
source§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.
source§fn set_ex<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
seconds: u64
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn pset_ex<'a, K, V, RV>(
&'a mut self,
key: K,
value: V,
milliseconds: u64
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn set_nx<'a, K, V, RV>(
&'a mut self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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
source§fn mset_nx<'a, K, V, RV>(
&'a mut self,
items: &'a [(K, V)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§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.
source§fn getrange<'a, K, RV>(
&'a mut self,
key: K,
from: isize,
to: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn setrange<'a, K, V, RV>(
&'a mut self,
key: K,
offset: isize,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§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.
source§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.
source§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 a key.
source§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.
source§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.
source§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.
source§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.
source§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.
source§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 expiration time of a key.
source§fn pttl<'a, K, RV>(
&'a mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn pttl<'a, K, RV>( &'a mut self, key: K ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get the expiration time of a key in milliseconds.
source§fn get_ex<'a, K, RV>(
&'a mut self,
key: K,
expire_at: Expiry
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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
source§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
source§fn rename<'a, K, N, RV>(
&'a mut self,
key: K,
new_key: N
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn rename_nx<'a, K, N, RV>(
&'a mut self,
key: K,
new_key: N
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§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.
source§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.
source§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.source§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.
source§fn setbit<'a, K, RV>(
&'a mut self,
key: K,
offset: usize,
value: bool
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§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.
source§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.
source§fn bitcount_range<'a, K, RV>(
&'a mut self,
key: K,
start: usize,
end: usize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn bit_and<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn bit_or<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn bit_xor<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn bit_not<'a, D, S, RV>(
&'a mut self,
dstkey: D,
srckey: S
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§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.
source§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.
source§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.
source§fn hset<'a, K, F, V, RV>(
&'a mut self,
key: K,
field: F,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
F: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn hset<'a, K, F, V, RV>(
&'a mut self,
key: K,
field: F,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
F: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Sets a single field in a hash.
source§fn hset_nx<'a, K, F, V, RV>(
&'a mut self,
key: K,
field: F,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
F: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn hset_nx<'a, K, F, V, RV>(
&'a mut self,
key: K,
field: F,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
F: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Sets a single field in a hash if it does not exist.
source§fn hset_multiple<'a, K, F, V, RV>(
&'a mut self,
key: K,
items: &'a [(F, V)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
F: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn hset_multiple<'a, K, F, V, RV>(
&'a mut self,
key: K,
items: &'a [(F, V)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
F: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Sets a multiple fields in a hash.
source§fn hincr<'a, K, F, D, RV>(
&'a mut self,
key: K,
field: F,
delta: D
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
F: ToRedisArgs + Send + Sync + 'a,
D: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn hincr<'a, K, F, D, RV>(
&'a mut self,
key: K,
field: F,
delta: D
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
F: ToRedisArgs + Send + Sync + 'a,
D: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Increments a value.
source§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.
source§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.
source§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.
source§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.
source§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.
source§fn blmove<'a, S, D, RV>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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
source§fn blmpop<'a, K, RV>(
&'a mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.source§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.
source§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.
source§fn brpoplpush<'a, S, D, RV>(
&'a mut self,
srckey: S,
dstkey: D,
timeout: f64
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§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.
source§fn linsert_before<'a, K, P, V, RV>(
&'a mut self,
key: K,
pivot: P,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
P: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn linsert_before<'a, K, P, V, RV>(
&'a mut self,
key: K,
pivot: P,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
P: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Insert an element before another element in a list.
source§fn linsert_after<'a, K, P, V, RV>(
&'a mut self,
key: K,
pivot: P,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
P: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn linsert_after<'a, K, P, V, RV>(
&'a mut self,
key: K,
pivot: P,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
P: ToRedisArgs + Send + Sync + 'a,
V: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Insert an element after another element in a list.
source§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.
source§fn lmove<'a, S, D, RV>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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
source§fn lmpop<'a, K, RV>(
&'a mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.source§fn lpop<'a, K, RV>(
&'a mut self,
key: K,
count: Option<NonZero<usize>>
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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 moresource§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.
source§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.
source§fn lpush_exists<'a, K, V, RV>(
&'a mut self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn lrange<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn lrem<'a, K, V, RV>(
&'a mut self,
key: K,
count: isize,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn ltrim<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn lset<'a, K, V, RV>(
&'a mut self,
key: K,
index: isize,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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
source§fn rpop<'a, K, RV>(
&'a mut self,
key: K,
count: Option<NonZero<usize>>
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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 moresource§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.
source§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.
source§fn rpush_exists<'a, K, V, RV>(
&'a mut self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§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.
source§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.
source§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.
source§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.
source§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.
source§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.
source§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.
source§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.
source§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.
source§fn smove<'a, S, D, M, RV>(
&'a mut self,
srckey: S,
dstkey: D,
member: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
S: ToRedisArgs + Send + Sync + 'a,
D: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn smove<'a, S, D, M, RV>(
&'a mut self,
srckey: S,
dstkey: D,
member: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
S: ToRedisArgs + Send + Sync + 'a,
D: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Move a member from one set to another.
source§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.
source§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.
source§fn srandmember_multiple<'a, K, RV>(
&'a mut self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn srandmember_multiple<'a, K, RV>( &'a mut self, key: K, count: usize ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Get multiple random members from a set.
source§fn srem<'a, K, M, RV>(
&'a mut self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§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.
source§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.
source§fn zadd<'a, K, S, M, RV>(
&'a mut self,
key: K,
member: M,
score: S
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
S: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zadd<'a, K, S, M, RV>(
&'a mut self,
key: K,
member: M,
score: S
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
S: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Add one member to a sorted set, or update its score if it already exists.
source§fn zadd_multiple<'a, K, S, M, RV>(
&'a mut self,
key: K,
items: &'a [(S, M)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
S: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zadd_multiple<'a, K, S, M, RV>(
&'a mut self,
key: K,
items: &'a [(S, M)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
S: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Add multiple members to a sorted set, or update its score if it already exists.
source§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.
source§fn zcount<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zcount<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Count the members in a sorted set with scores within the given values.
source§fn zincr<'a, K, M, D, RV>(
&'a mut self,
key: K,
member: M,
delta: D
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
D: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zincr<'a, K, M, D, RV>(
&'a mut self,
key: K,
member: M,
delta: D
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
D: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Increments the member in a sorted set at key by delta.
If the member does not exist, it is added with delta as its score.
source§fn zinterstore<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zinterstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [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.
source§fn zinterstore_min<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zinterstore_min<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
source§fn zinterstore_max<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zinterstore_max<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
source§fn zinterstore_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zinterstore_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Commands::zinterstore, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zinterstore_min_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zinterstore_min_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Commands::zinterstore_min, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zinterstore_max_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zinterstore_max_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Commands::zinterstore_max, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zlexcount<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zlexcount<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Count the number of members in a sorted set between a given lexicographical range.
source§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.
source§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
source§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.
source§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
source§fn bzmpop_max<'a, K, RV>(
&'a mut self,
timeout: f64,
keys: &'a [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: &'a [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.
source§fn zmpop_max<'a, K, RV>(
&'a mut self,
keys: &'a [K],
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zmpop_max<'a, K, RV>( &'a mut self, keys: &'a [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.
source§fn bzmpop_min<'a, K, RV>(
&'a mut self,
timeout: f64,
keys: &'a [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: &'a [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.
source§fn zmpop_min<'a, K, RV>(
&'a mut self,
keys: &'a [K],
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zmpop_min<'a, K, RV>( &'a mut self, keys: &'a [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.
source§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)source§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
source§fn zrange<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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
source§fn zrange_withscores<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn zrangebylex<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrangebylex<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical range.
source§fn zrangebylex_limit<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrangebylex_limit<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
source§fn zrevrangebylex<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrevrangebylex<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical range.
source§fn zrevrangebylex_limit<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrevrangebylex_limit<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
source§fn zrangebyscore<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrangebyscore<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by score.
source§fn zrangebyscore_withscores<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrangebyscore_withscores<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with scores.
source§fn zrangebyscore_limit<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrangebyscore_limit<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit.
source§fn zrangebyscore_limit_withscores<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrangebyscore_limit_withscores<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit with scores.
source§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.
source§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.
source§fn zrembylex<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrembylex<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Remove all members in a sorted set between the given lexicographical range.
source§fn zremrangebyrank<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn zrembyscore<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrembyscore<'a, K, M, MM, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Remove all members in a sorted set within the given scores.
source§fn zrevrange<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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, with scores
ordered from high to low.
source§fn zrevrange_withscores<'a, K, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn zrevrangebyscore<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrevrangebyscore<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by score.
source§fn zrevrangebyscore_withscores<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrevrangebyscore_withscores<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with scores.
source§fn zrevrangebyscore_limit<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrevrangebyscore_limit<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit.
source§fn zrevrangebyscore_limit_withscores<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zrevrangebyscore_limit_withscores<'a, K, MM, M, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
K: ToRedisArgs + Send + Sync + 'a,
MM: ToRedisArgs + Send + Sync + 'a,
M: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit with scores.
source§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.
source§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.
source§fn zscore_multiple<'a, K, M, RV>(
&'a mut self,
key: K,
members: &'a [M]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
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.
source§fn zunionstore<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zunionstore<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [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.
source§fn zunionstore_min<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zunionstore_min<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Unions multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
source§fn zunionstore_max<'a, D, K, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn zunionstore_max<'a, D, K, RV>( &'a mut self, dstkey: D, keys: &'a [K] ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
Unions multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
source§fn zunionstore_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zunionstore_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Commands::zunionstore, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zunionstore_min_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zunionstore_min_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Commands::zunionstore_min, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zunionstore_max_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
fn zunionstore_max_weights<'a, D, K, W, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>where
D: ToRedisArgs + Send + Sync + 'a,
K: ToRedisArgs + Send + Sync + 'a,
W: ToRedisArgs + Send + Sync + 'a,
RV: FromRedisValue,
Commands::zunionstore_max, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§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.
source§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).
source§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.
source§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.
source§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.
source§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.
source§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.
source§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.
source§fn xrevrange_all<'a, K, RV>(
&'a mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
fn xrevrange_all<'a, K, RV>( &'a mut self, key: K ) -> Pin<Box<dyn Future<Output = Result<RV, RedisError>> + Send + 'a>>
source§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.
source§fn scan_match<P, RV>(
&mut self,
pattern: P
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
P: ToRedisArgs,
RV: FromRedisValue,
fn scan_match<P, RV>(
&mut self,
pattern: P
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
P: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate set elements for elements matching a pattern.
source§fn hscan<K, RV>(
&mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hscan<K, RV>(
&mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate hash fields and associated values.
source§fn hscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
fn hscan_match<K, P, RV>( &mut self, key: K, pattern: P ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
Incrementally iterate hash fields and associated values for
field names matching a pattern.
source§fn sscan<K, RV>(
&mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sscan<K, RV>(
&mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate set elements.
source§fn sscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
fn sscan_match<K, P, RV>( &mut self, key: K, pattern: P ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
Incrementally iterate set elements for elements matching a pattern.
source§fn zscan<K, RV>(
&mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zscan<K, RV>(
&mut self,
key: K
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>where
K: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate sorted set elements.
source§fn zscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
fn zscan_match<K, P, RV>( &mut self, key: K, pattern: P ) -> Pin<Box<dyn Future<Output = Result<AsyncIter<'_, RV>, RedisError>> + Send + '_>>
Incrementally iterate sorted set elements for elements matching a pattern.
source§impl<T> 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