Struct redis::aio::MultiplexedConnection
source · pub struct MultiplexedConnection { /* private fields */ }
Available on crate feature
aio
only.Expand description
A connection object which can be cloned, allowing requests to be be sent concurrently on the same underlying connection (tcp/unix socket).
Implementations§
source§impl MultiplexedConnection
impl MultiplexedConnection
sourcepub async fn new<C>(
connection_info: &RedisConnectionInfo,
stream: C
) -> RedisResult<(Self, impl Future<Output = ()>)>
pub async fn new<C>( connection_info: &RedisConnectionInfo, stream: C ) -> RedisResult<(Self, impl Future<Output = ()>)>
Constructs a new MultiplexedConnection
out of a AsyncRead + AsyncWrite
object
and a ConnectionInfo
sourcepub async fn new_with_response_timeout<C>(
connection_info: &RedisConnectionInfo,
stream: C,
response_timeout: Duration
) -> RedisResult<(Self, impl Future<Output = ()>)>
pub async fn new_with_response_timeout<C>( connection_info: &RedisConnectionInfo, stream: C, response_timeout: Duration ) -> RedisResult<(Self, impl Future<Output = ()>)>
Constructs a new MultiplexedConnection
out of a AsyncRead + AsyncWrite
object
and a ConnectionInfo
. The new object will wait on operations for the given response_timeout
.
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) -> RedisResult<Value>
pub async fn send_packed_command(&mut self, cmd: &Cmd) -> RedisResult<Value>
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
) -> RedisResult<Vec<Value>>
pub async fn send_packed_commands( &mut self, cmd: &Pipeline, offset: usize, count: usize ) -> RedisResult<Vec<Value>>
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 Clone for MultiplexedConnection
impl Clone for MultiplexedConnection
source§fn clone(&self) -> MultiplexedConnection
fn clone(&self) -> MultiplexedConnection
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Connect for MultiplexedConnection
impl Connect for MultiplexedConnection
source§fn connect<'a, T>(
info: T,
response_timeout: Duration,
connection_timeout: Duration
) -> RedisFuture<'a, MultiplexedConnection>where
T: IntoConnectionInfo + Send + 'a,
fn connect<'a, T>(
info: T,
response_timeout: Duration,
connection_timeout: Duration
) -> RedisFuture<'a, MultiplexedConnection>where
T: IntoConnectionInfo + Send + 'a,
Connect to a node, returning handle for command execution.
source§impl ConnectionLike for MultiplexedConnection
impl ConnectionLike for MultiplexedConnection
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 MultiplexedConnection
impl !RefUnwindSafe for MultiplexedConnection
impl Send for MultiplexedConnection
impl Sync for MultiplexedConnection
impl Unpin for MultiplexedConnection
impl !UnwindSafe for MultiplexedConnection
Blanket Implementations§
source§impl<T> AsyncCommands for Twhere
T: ConnectionLike + Send,
impl<T> AsyncCommands for Twhere
T: ConnectionLike + Send,
source§fn get<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn get<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the value of a key. If key is a vec this becomes an
MGET
.source§fn mget<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn mget<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get values of keys
source§fn keys<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn keys<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Gets all keys matching pattern
source§fn set<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn set<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set the string value of a key.
source§fn set_options<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V,
options: SetOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn set_options<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V,
options: SetOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set the string value of a key with options.
source§fn set_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
items: &'a [(K, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn set_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
items: &'a [(K, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
👎Deprecated since 0.22.4: Renamed to mset() to reflect Redis name
Sets multiple keys to their values.
source§fn mset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
items: &'a [(K, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn mset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
items: &'a [(K, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Sets multiple keys to their values.
source§fn set_ex<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V,
seconds: u64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn set_ex<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V,
seconds: u64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set the value and expiration of a key.
source§fn pset_ex<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V,
milliseconds: u64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn pset_ex<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V,
milliseconds: u64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set the value and expiration in milliseconds of a key.
source§fn set_nx<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn set_nx<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set the value of a key, only if the key does not exist
source§fn mset_nx<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
items: &'a [(K, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn mset_nx<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
items: &'a [(K, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Sets multiple keys to their values failing if at least one already exists.
source§fn getset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn getset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set the string value of a key and return its old value.
source§fn getrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
from: isize,
to: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn getrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
from: isize,
to: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.
source§fn setrange<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
offset: isize,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn setrange<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
offset: isize,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Overwrite the part of the value stored in key at the specified offset.
source§fn del<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn del<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Delete one or more keys.
source§fn exists<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn exists<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Determine if a key exists.
source§fn key_type<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn key_type<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Determine the type of a key.
source§fn expire<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
seconds: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn expire<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
seconds: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set a key’s time to live in seconds.
source§fn expire_at<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
ts: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn expire_at<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
ts: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set the expiration for a key as a UNIX timestamp.
source§fn pexpire<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
ms: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn pexpire<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
ms: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set a key’s time to live in milliseconds.
source§fn pexpire_at<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
ts: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn pexpire_at<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
ts: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Set the expiration for a key as a UNIX timestamp in milliseconds.
source§fn persist<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn persist<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove the expiration from a key.
source§fn ttl<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn ttl<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the expiration time of a key.
source§fn pttl<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn pttl<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the expiration time of a key in milliseconds.
source§fn get_ex<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
expire_at: Expiry
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn get_ex<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
expire_at: Expiry
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the value of a key and set expiration
source§fn get_del<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn get_del<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the value of a key and delete it
source§fn rename<'a, K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
new_key: N
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn rename<'a, K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
new_key: N
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Rename a key.
source§fn rename_nx<'a, K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
new_key: N
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn rename_nx<'a, K: ToRedisArgs + Send + Sync + 'a, N: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
new_key: N
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Rename a key, only if the new key does not exist.
source§fn unlink<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn unlink<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Unlink one or more keys.
source§fn append<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn append<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Append a value to a key.
source§fn incr<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
delta: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn incr<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
delta: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Increment the numeric value of a key by the given amount. This
issues a
INCRBY
or INCRBYFLOAT
depending on the type.source§fn decr<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
delta: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn decr<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
delta: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Decrement the numeric value of a key by the given amount.
source§fn setbit<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
offset: usize,
value: bool
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn setbit<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
offset: usize,
value: bool
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Sets or clears the bit at offset in the string value stored at key.
source§fn getbit<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
offset: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn getbit<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
offset: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Returns the bit value at offset in the string value stored at key.
source§fn bitcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bitcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Count set bits in a string.
source§fn bitcount_range<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: usize,
end: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bitcount_range<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: usize,
end: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Count set bits in a string in a range.
source§fn bit_and<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bit_and<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Perform a bitwise AND between multiple keys (containing string values)
and store the result in the destination key.
source§fn bit_or<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bit_or<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Perform a bitwise OR between multiple keys (containing string values)
and store the result in the destination key.
source§fn bit_xor<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bit_xor<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Perform a bitwise XOR between multiple keys (containing string values)
and store the result in the destination key.
source§fn bit_not<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckey: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bit_not<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckey: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Perform a bitwise NOT of the key (containing string values)
and store the result in the destination key.
source§fn strlen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn strlen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the length of the value stored in a key.
source§fn hget<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hget<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Gets a single (or multiple) fields from a hash.
source§fn hdel<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hdel<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Deletes a single (or multiple) fields from a hash.
source§fn hset<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hset<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Sets a single field in a hash.
source§fn hset_nx<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hset_nx<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Sets a single field in a hash if it does not exist.
source§fn hset_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
items: &'a [(F, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hset_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
items: &'a [(F, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Sets a multiple fields in a hash.
source§fn hincr<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F,
delta: D
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hincr<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F,
delta: D
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Increments a value.
source§fn hexists<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hexists<'a, K: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
field: F
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Checks if a field in a hash exists.
source§fn hkeys<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hkeys<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Gets all the keys in a hash.
source§fn hvals<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hvals<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Gets all the values in a hash.
source§fn hgetall<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hgetall<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Gets all the fields and values in a hash.
source§fn hlen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn hlen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Gets the length of a hash.
source§fn blmove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn blmove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Pop an element from a list, push it to another list
and return it; or block until one is available
source§fn blmpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn blmpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Pops
count
elements from the first non-empty list key from the list of
provided key names; or blocks until one is available.source§fn blpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn blpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove and get the first element in a list, or block until one is available.
source§fn brpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn brpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove and get the last element in a list, or block until one is available.
source§fn brpoplpush<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
srckey: S,
dstkey: D,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn brpoplpush<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
srckey: S,
dstkey: D,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Pop a value from a list, push it to another list and return it;
or block until one is available.
source§fn lindex<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
index: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lindex<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
index: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get an element from a list by its index.
source§fn linsert_before<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
pivot: P,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn linsert_before<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
pivot: P,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Insert an element before another element in a list.
source§fn linsert_after<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
pivot: P,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn linsert_after<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
pivot: P,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Insert an element after another element in a list.
source§fn llen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn llen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Returns the length of the list stored at key.
source§fn lmove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lmove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Pop an element a list, push it to another list and return it
source§fn lmpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lmpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Pops
count
elements from the first non-empty list key from the list of
provided key names.source§fn lpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: Option<NonZeroUsize>
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: Option<NonZeroUsize>
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes and returns the up to
count
first elements of the list stored at key. Read moresource§fn lpos<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V,
options: LposOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lpos<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V,
options: LposOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Returns the index of the first matching value of the list stored at key.
source§fn lpush<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lpush<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Insert all the specified values at the head of the list stored at key.
source§fn lpush_exists<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lpush_exists<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Inserts a value at the head of the list stored at key, only if key
already exists and holds a list.
source§fn lrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Returns the specified elements of the list stored at key.
source§fn lrem<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: isize,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lrem<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: isize,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes the first count occurrences of elements equal to value
from the list stored at key.
source§fn ltrim<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn ltrim<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Trim an existing list so that it will contain only the specified
range of elements specified.
source§fn lset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
index: isize,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn lset<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
index: isize,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Sets the list element at index to value
source§fn rpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: Option<NonZeroUsize>
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn rpop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: Option<NonZeroUsize>
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes and returns the up to
count
last elements of the list stored at key Read moresource§fn rpoplpush<'a, K: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
dstkey: D
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn rpoplpush<'a, K: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
dstkey: D
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Pop a value from a list, push it to another list and return it.
source§fn rpush<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn rpush<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Insert all the specified values at the tail of the list stored at key.
source§fn rpush_exists<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn rpush_exists<'a, K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Inserts value at the tail of the list stored at key, only if key
already exists and holds a list.
source§fn sadd<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn sadd<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Add one or more members to a set.
source§fn scard<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn scard<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the number of members in a set.
source§fn sdiff<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn sdiff<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Subtract multiple sets.
source§fn sdiffstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn sdiffstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Subtract multiple sets and store the resulting set in a key.
source§fn sinter<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn sinter<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Intersect multiple sets.
source§fn sinterstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn sinterstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Intersect multiple sets and store the resulting set in a key.
source§fn sismember<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn sismember<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Determine if a given value is a member of a set.
source§fn smismember<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn smismember<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Determine if given values are members of a set.
source§fn smembers<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn smembers<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get all the members in a set.
source§fn smove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
srckey: S,
dstkey: D,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn smove<'a, S: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
srckey: S,
dstkey: D,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Move a member from one set to another.
source§fn spop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn spop<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove and return a random member from a set.
source§fn srandmember<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn srandmember<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get one random member from a set.
source§fn srandmember_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn srandmember_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: usize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get multiple random members from a set.
source§fn srem<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn srem<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove one or more members from a set.
source§fn sunion<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn sunion<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Add multiple sets.
source§fn sunionstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn sunionstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Add multiple sets and store the resulting set in a key.
source§fn zadd<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M,
score: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zadd<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M,
score: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Add one member to a sorted set, or update its score if it already exists.
source§fn zadd_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
items: &'a [(S, M)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zadd_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
items: &'a [(S, M)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Add multiple members to a sorted set, or update its score if it already exists.
source§fn zcard<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zcard<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the number of members in a sorted set.
source§fn zcount<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zcount<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Count the members in a sorted set with scores within the given values.
source§fn zincr<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M,
delta: D
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zincr<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, D: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M,
delta: D
) -> RedisFuture<'a, RV>where
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: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zinterstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Intersect multiple sorted sets and store the resulting sorted set in
a new key using SUM as aggregation function.
source§fn zinterstore_min<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zinterstore_min<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
source§fn zinterstore_max<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zinterstore_max<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
source§fn zinterstore_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zinterstore_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
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: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zinterstore_min_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
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: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zinterstore_max_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
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: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zlexcount<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Count the number of members in a sorted set between a given lexicographical range.
source§fn bzpopmax<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bzpopmax<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
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: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zpopmax<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes and returns up to count members with the highest scores in a sorted set
source§fn bzpopmin<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bzpopmin<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
timeout: f64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
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: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zpopmin<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes and returns up to count members with the lowest scores in a sorted set
source§fn bzmpop_max<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
timeout: f64,
keys: &'a [K],
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bzmpop_max<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
timeout: f64,
keys: &'a [K],
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes and returns up to count members with the highest scores,
from the first non-empty sorted set in the provided list of key names.
Blocks until a member is available otherwise.
source§fn zmpop_max<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: &'a [K],
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zmpop_max<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: &'a [K],
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes and returns up to count members with the highest scores,
from the first non-empty sorted set in the provided list of key names.
source§fn bzmpop_min<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
timeout: f64,
keys: &'a [K],
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn bzmpop_min<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
timeout: f64,
keys: &'a [K],
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes and returns up to count members with the lowest scores,
from the first non-empty sorted set in the provided list of key names.
Blocks until a member is available otherwise.
source§fn zmpop_min<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: &'a [K],
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zmpop_min<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: &'a [K],
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Removes and returns up to count members with the lowest scores,
from the first non-empty sorted set in the provided list of key names.
source§fn zrandmember<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: Option<isize>
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrandmember<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: Option<isize>
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return up to count random members in a sorted set (or 1 if
count == None
)source§fn zrandmember_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrandmember_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return up to count random members in a sorted set with scores
source§fn zrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by index
source§fn zrange_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrange_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by index with scores.
source§fn zrangebylex<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrangebylex<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical range.
source§fn zrangebylex_limit<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrangebylex_limit<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
source§fn zrevrangebylex<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrangebylex<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical range.
source§fn zrevrangebylex_limit<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrangebylex_limit<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
source§fn zrangebyscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrangebyscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by score.
source§fn zrangebyscore_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrangebyscore_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by score with scores.
source§fn zrangebyscore_limit<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrangebyscore_limit<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit.
source§fn zrangebyscore_limit_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrangebyscore_limit_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit with scores.
source§fn zrank<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrank<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Determine the index of a member in a sorted set.
source§fn zrem<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrem<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove one or more members from a sorted set.
source§fn zrembylex<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrembylex<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove all members in a sorted set between the given lexicographical range.
source§fn zremrangebyrank<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zremrangebyrank<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove all members in a sorted set within the given indexes.
source§fn zrembyscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrembyscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
min: M,
max: MM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Remove all members in a sorted set within the given scores.
source§fn zrevrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrange<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by index, with scores
ordered from high to low.
source§fn zrevrange_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrange_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: isize,
stop: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by index, with scores
ordered from high to low.
source§fn zrevrangebyscore<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrangebyscore<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by score.
source§fn zrevrangebyscore_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrangebyscore_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by score with scores.
source§fn zrevrangebyscore_limit<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrangebyscore_limit<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit.
source§fn zrevrangebyscore_limit_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrangebyscore_limit_withscores<'a, K: ToRedisArgs + Send + Sync + 'a, MM: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit with scores.
source§fn zrevrank<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zrevrank<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Determine the index of a member in a sorted set, with scores ordered from high to low.
source§fn zscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zscore<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the score associated with the given member in a sorted set.
source§fn zscore_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: &'a [M]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zscore_multiple<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: &'a [M]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Get the scores associated with multiple members in a sorted set.
source§fn zunionstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zunionstore<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Unions multiple sorted sets and store the resulting sorted set in
a new key using SUM as aggregation function.
source§fn zunionstore_min<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zunionstore_min<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Unions multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
source§fn zunionstore_max<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zunionstore_max<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Unions multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
source§fn zunionstore_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zunionstore_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
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: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zunionstore_min_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
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: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn zunionstore_max_weights<'a, D: ToRedisArgs + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> RedisFuture<'a, RV>where
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: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
element: E
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn pfadd<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
element: E
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Adds the specified elements to the specified HyperLogLog.
source§fn pfcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn pfcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Return the approximated cardinality of the set(s) observed by the
HyperLogLog at key(s).
source§fn pfmerge<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn pfmerge<'a, D: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
dstkey: D,
srckeys: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Merge N different HyperLogLogs into a single one.
source§fn publish<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
channel: K,
message: E
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn publish<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
channel: K,
message: E
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Posts a message to the given channel.
source§fn object_encoding<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn object_encoding<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Returns the encoding of a key.
source§fn object_idletime<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn object_idletime<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Returns the time in seconds since the last access of a key.
source§fn object_freq<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn object_freq<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Returns the logarithmic access frequency counter of a key.
source§fn object_refcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn object_refcount<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Returns the reference count of a key.
source§fn acl_load<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_load<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.When Redis is configured to use an ACL file (with the aclfile
configuration option), this command will reload the ACLs from the file,
replacing all the current ACL rules with the ones defined in the file.
source§fn acl_save<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_save<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.When Redis is configured to use an ACL file (with the aclfile
configuration option), this command will save the currently defined
ACLs from the server memory to the ACL file.
source§fn acl_list<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_list<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Shows the currently active ACL rules in the Redis server.
source§fn acl_users<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_users<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Shows a list of all the usernames of the currently configured users in
the Redis ACL system.
source§fn acl_getuser<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
username: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_getuser<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
username: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Returns all the rules defined for an existing ACL user.
source§fn acl_setuser<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
username: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_setuser<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
username: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Creates an ACL user without any privilege.
source§fn acl_setuser_rules<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
username: K,
rules: &'a [Rule]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_setuser_rules<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
username: K,
rules: &'a [Rule]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Creates an ACL user with the specified rules or modify the rules of
an existing user.
source§fn acl_deluser<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
usernames: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_deluser<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
usernames: &'a [K]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Delete all the specified ACL users and terminate all the connections
that are authenticated with such users.
source§fn acl_cat<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_cat<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Shows the available ACL categories.
source§fn acl_cat_categoryname<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
categoryname: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_cat_categoryname<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
categoryname: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Shows all the Redis commands in the specified category.
source§fn acl_genpass<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_genpass<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Generates a 256-bits password starting from /dev/urandom if available.
source§fn acl_genpass_bits<'a, RV>(&'a mut self, bits: isize) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_genpass_bits<'a, RV>(&'a mut self, bits: isize) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Generates a 1-to-1024-bits password starting from /dev/urandom if available.
source§fn acl_whoami<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_whoami<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Returns the username the current connection is authenticated with.
source§fn acl_log<'a, RV>(&'a mut self, count: isize) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_log<'a, RV>(&'a mut self, count: isize) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Shows a list of recent ACL security events
source§fn acl_log_reset<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_log_reset<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Clears the ACL log.
source§fn acl_help<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn acl_help<'a, RV>(&'a mut self) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
acl
only.Returns a helpful text describing the different subcommands.
source§fn geo_add<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn geo_add<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
geospatial
only.Adds the specified geospatial items to the specified key. Read more
source§fn geo_dist<'a, K: ToRedisArgs + Send + Sync + 'a, M1: ToRedisArgs + Send + Sync + 'a, M2: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member1: M1,
member2: M2,
unit: Unit
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn geo_dist<'a, K: ToRedisArgs + Send + Sync + 'a, M1: ToRedisArgs + Send + Sync + 'a, M2: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member1: M1,
member2: M2,
unit: Unit
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
geospatial
only.Return the distance between two members in the geospatial index
represented by the sorted set. Read more
source§fn geo_hash<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn geo_hash<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
geospatial
only.source§fn geo_pos<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn geo_pos<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
members: M
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
geospatial
only.Return the positions of all the specified members of the geospatial
index represented by the sorted set at key. Read more
source§fn geo_radius<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
longitude: f64,
latitude: f64,
radius: f64,
unit: Unit,
options: RadiusOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn geo_radius<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
longitude: f64,
latitude: f64,
radius: f64,
unit: Unit,
options: RadiusOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
geospatial
only.source§fn geo_radius_by_member<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M,
radius: f64,
unit: Unit,
options: RadiusOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn geo_radius_by_member<'a, K: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
member: M,
radius: f64,
unit: Unit,
options: RadiusOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
geospatial
only.Retrieve members selected by distance with the center of
member
. The
member itself is always contained in the results.source§fn xack<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, I: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
ids: &'a [I]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xack<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, I: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
ids: &'a [I]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Ack pending stream messages checked out by a consumer. Read more
source§fn xadd<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
id: ID,
items: &'a [(F, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xadd<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
id: ID,
items: &'a [(F, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xadd_map<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, BTM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
id: ID,
map: BTM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xadd_map<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, BTM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
id: ID,
map: BTM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.BTreeMap variant for adding a stream message by
key
.
Use *
as the id
for the current timestamp. Read moresource§fn xadd_maxlen<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
items: &'a [(F, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xadd_maxlen<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
items: &'a [(F, V)]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Add a stream message while capping the stream at a maxlength. Read more
source§fn xadd_maxlen_map<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, BTM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
map: BTM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xadd_maxlen_map<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, BTM: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
map: BTM
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.BTreeMap variant for adding a stream message while capping the stream at a maxlength. Read more
source§fn xclaim<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xclaim<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Claim pending, unacked messages, after some period of time,
currently checked out by another consumer. Read more
source§fn xclaim_options<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID],
options: StreamClaimOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xclaim_options<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, MIT: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID],
options: StreamClaimOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.This is the optional arguments version for claiming unacked, pending messages
currently checked out by another consumer. Read more
source§fn xdel<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
ids: &'a [ID]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xdel<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
ids: &'a [ID]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xgroup_create<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
id: ID
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xgroup_create<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
id: ID
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.This command is used for creating a consumer
group
. It expects the stream key
to already exist. Otherwise, use xgroup_create_mkstream
if it doesn’t.
The id
is the starting message id all consumers should read from. Use $
If you want
all consumers to read from the last message added to stream. Read moresource§fn xgroup_create_mkstream<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
id: ID
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xgroup_create_mkstream<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
id: ID
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.This is the alternate version for creating a consumer
group
which makes the stream if it doesn’t exist. Read moresource§fn xgroup_setid<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
id: ID
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xgroup_setid<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
id: ID
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xgroup_destroy<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xgroup_destroy<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xgroup_delconsumer<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
consumer: C
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xgroup_delconsumer<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
consumer: C
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xinfo_consumers<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xinfo_consumers<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.This returns all info details about
which consumers have read messages for given consumer
group
.
Take note of the StreamInfoConsumersReply return type. Read moresource§fn xinfo_groups<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xinfo_groups<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Returns all consumer
group
s created for a given stream key
.
Take note of the StreamInfoGroupsReply return type. Read moresource§fn xinfo_stream<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xinfo_stream<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Returns info about high-level stream details
(first & last message
id
, length, number of groups, etc.)
Take note of the StreamInfoStreamReply return type. Read moresource§fn xlen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xlen<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Returns the number of messages for a given stream
key
. Read moresource§fn xpending<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xpending<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.This is a basic version of making XPENDING command calls which only
passes a stream
key
and consumer group
and it
returns details about which consumers have pending messages
that haven’t been acked. Read moresource§fn xpending_count<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
start: S,
end: E,
count: C
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xpending_count<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
start: S,
end: E,
count: C
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.This XPENDING version returns a list of all messages over the range.
You can use this for paginating pending messages (but without the message HashMap). Read more
source§fn xpending_consumer_count<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, CN: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
start: S,
end: E,
count: C,
consumer: CN
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xpending_consumer_count<'a, K: ToRedisArgs + Send + Sync + 'a, G: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, CN: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
group: G,
start: S,
end: E,
count: C,
consumer: CN
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xrange<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: S,
end: E
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xrange<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: S,
end: E
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Returns a range of messages in a given stream
key
. Read moresource§fn xrange_all<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xrange_all<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.A helper method for automatically returning all messages in a stream by
key
.
Use with caution! Read moresource§fn xrange_count<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: S,
end: E,
count: C
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xrange_count<'a, K: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
start: S,
end: E,
count: C
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.A method for paginating a stream by
key
. Read moresource§fn xread<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: &'a [K],
ids: &'a [ID]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xread<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: &'a [K],
ids: &'a [ID]
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Read a list of
id
s for each stream key
.
This is the basic form of reading streams.
For more advanced control, like blocking, limiting, or reading by consumer group
,
see xread_options
. Read moresource§fn xread_options<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: &'a [K],
ids: &'a [ID],
options: &'a StreamReadOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xread_options<'a, K: ToRedisArgs + Send + Sync + 'a, ID: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
keys: &'a [K],
ids: &'a [ID],
options: &'a StreamReadOptions
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xrevrange<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
end: E,
start: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xrevrange<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
end: E,
start: S
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xrevrange_all<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xrevrange_all<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
source§fn xrevrange_count<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
end: E,
start: S,
count: C
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xrevrange_count<'a, K: ToRedisArgs + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, C: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
end: E,
start: S,
count: C
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.source§fn xtrim<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
maxlen: StreamMaxlen
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn xtrim<'a, K: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
maxlen: StreamMaxlen
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
streams
only.Trim a stream
key
to a MAXLEN count. Read moresource§fn scan<RV: FromRedisValue>(&mut self) -> RedisFuture<'_, AsyncIter<'_, RV>>
fn scan<RV: FromRedisValue>(&mut self) -> RedisFuture<'_, AsyncIter<'_, RV>>
Incrementally iterate the keys space.
source§fn scan_match<P: ToRedisArgs, RV: FromRedisValue>(
&mut self,
pattern: P
) -> RedisFuture<'_, AsyncIter<'_, RV>>
fn scan_match<P: ToRedisArgs, RV: FromRedisValue>( &mut self, pattern: P ) -> RedisFuture<'_, AsyncIter<'_, RV>>
Incrementally iterate set elements for elements matching a pattern.
source§fn hscan<K: ToRedisArgs, RV: FromRedisValue>(
&mut self,
key: K
) -> RedisFuture<'_, AsyncIter<'_, RV>>
fn hscan<K: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K ) -> RedisFuture<'_, AsyncIter<'_, RV>>
Incrementally iterate hash fields and associated values.
source§fn hscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>(
&mut self,
key: K,
pattern: P
) -> RedisFuture<'_, AsyncIter<'_, RV>>
fn hscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, pattern: P ) -> RedisFuture<'_, AsyncIter<'_, RV>>
Incrementally iterate hash fields and associated values for
field names matching a pattern.
source§fn sscan<K: ToRedisArgs, RV: FromRedisValue>(
&mut self,
key: K
) -> RedisFuture<'_, AsyncIter<'_, RV>>
fn sscan<K: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K ) -> RedisFuture<'_, AsyncIter<'_, RV>>
Incrementally iterate set elements.
source§fn sscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>(
&mut self,
key: K,
pattern: P
) -> RedisFuture<'_, AsyncIter<'_, RV>>
fn sscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, pattern: P ) -> RedisFuture<'_, AsyncIter<'_, RV>>
Incrementally iterate set elements for elements matching a pattern.
source§fn zscan<K: ToRedisArgs, RV: FromRedisValue>(
&mut self,
key: K
) -> RedisFuture<'_, AsyncIter<'_, RV>>
fn zscan<K: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K ) -> RedisFuture<'_, AsyncIter<'_, RV>>
Incrementally iterate sorted set elements.
source§fn zscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>(
&mut self,
key: K,
pattern: P
) -> RedisFuture<'_, AsyncIter<'_, RV>>
fn zscan_match<K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue>( &mut self, key: K, pattern: P ) -> RedisFuture<'_, AsyncIter<'_, RV>>
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
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> JsonAsyncCommands for Twhere
T: ConnectionLike + Send,
impl<T> JsonAsyncCommands for Twhere
T: ConnectionLike + Send,
source§fn json_arr_append<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: &'a V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_arr_append<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: &'a V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Append the JSON
value
to the array at path
after the last element in it.source§fn json_arr_index<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: &'a V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_arr_index<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: &'a V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Index array at
path
, returns first occurance of value
source§fn json_arr_index_ss<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: &'a V,
start: &'a isize,
stop: &'a isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_arr_index_ss<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: &'a V,
start: &'a isize,
stop: &'a isize
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Same as
json_arr_index
except takes a start
and a stop
value, setting these to 0
will mean
they make no effect on the query Read moresource§fn json_arr_insert<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
index: i64,
value: &'a V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_arr_insert<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
index: i64,
value: &'a V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.source§fn json_arr_len<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_arr_len<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Reports the length of the JSON Array at
path
in key
.source§fn json_arr_pop<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
index: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_arr_pop<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
index: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Removes and returns an element from the
index
in the array. Read moresource§fn json_arr_trim<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
start: i64,
stop: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_arr_trim<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
start: i64,
stop: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Trims an array so that it contains only the specified inclusive range of elements. Read more
source§fn json_clear<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_clear<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Clears container values (Arrays/Objects), and sets numeric values to 0.
source§fn json_del<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_del<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Deletes a value at
path
.source§fn json_get<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_get<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Gets JSON Value(s) at
path
. Read moresource§fn json_num_incr_by<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_num_incr_by<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: i64
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Increments the number value stored at
path
by number
.source§fn json_obj_keys<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_obj_keys<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Returns the keys in the object that’s referenced by
path
.source§fn json_obj_len<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_obj_len<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Reports the number of keys in the JSON Object at
path
in key
.source§fn json_set<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: &'a V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_set<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: Serialize + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: &'a V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Sets the JSON Value at
path
in key
.source§fn json_str_append<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_str_append<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P,
value: V
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Appends the
json-string
values to the string at path
.source§fn json_str_len<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_str_len<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Reports the length of the JSON String at
path
in key
.source§fn json_toggle<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_toggle<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Toggle a
boolean
value stored at path
.source§fn json_type<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
fn json_type<'a, K: ToRedisArgs + Send + Sync + 'a, P: ToRedisArgs + Send + Sync + 'a, RV>(
&'a mut self,
key: K,
path: P
) -> RedisFuture<'a, RV>where
RV: FromRedisValue,
Available on crate feature
json
only.Reports the type of JSON value at
path
.