Struct sessions_redis::Client
source · [−]pub struct Client { /* private fields */ }Expand description
The client type.
Implementations
sourceimpl Client
impl Client
The client acts as connector to the redis server. By itself it does not do much other than providing a convenient way to fetch a connection from it. In the future the plan is to provide a connection pool in the client.
When opening a client a URL in the following format should be used:
redis://host:port/dbExample usage::
let client = redis::Client::open("redis://127.0.0.1/").unwrap();
let con = client.get_connection().unwrap();sourcepub fn open<T>(params: T) -> Result<Client, RedisError> where
T: IntoConnectionInfo,
pub fn open<T>(params: T) -> Result<Client, RedisError> where
T: IntoConnectionInfo,
Connects to a redis server and returns a client. This does not actually open a connection yet but it does perform some basic checks on the URL that might make the operation fail.
sourcepub fn get_connection(&self) -> Result<Connection, RedisError>
pub fn get_connection(&self) -> Result<Connection, RedisError>
Instructs the client to actually connect to redis and returns a connection object. The connection object can be used to send commands to the server. This can fail with a variety of errors (like unreachable host) so it’s important that you handle those errors.
sourcepub fn get_connection_with_timeout(
&self,
timeout: Duration
) -> Result<Connection, RedisError>
pub fn get_connection_with_timeout(
&self,
timeout: Duration
) -> Result<Connection, RedisError>
Instructs the client to actually connect to redis with specified timeout and returns a connection object. The connection object can be used to send commands to the server. This can fail with a variety of errors (like unreachable host) so it’s important that you handle those errors.
sourcepub fn get_connection_info(&self) -> &ConnectionInfo
pub fn get_connection_info(&self) -> &ConnectionInfo
Returns a reference of client connection info object.
sourceimpl Client
impl Client
To enable async support you need to chose one of the supported runtimes and active its
corresponding feature: tokio-comp or async-std-comp
sourcepub async fn get_async_connection(
&self
) -> Result<Connection<Pin<Box<dyn AsyncStream + Sync + Send + 'static, Global>>>, RedisError>
pub async fn get_async_connection(
&self
) -> Result<Connection<Pin<Box<dyn AsyncStream + Sync + Send + 'static, Global>>>, RedisError>
Returns an async connection from the client.
sourcepub async fn get_tokio_connection(
&self
) -> Result<Connection<Pin<Box<dyn AsyncStream + Sync + Send + 'static, Global>>>, RedisError>
pub async fn get_tokio_connection(
&self
) -> Result<Connection<Pin<Box<dyn AsyncStream + Sync + Send + 'static, Global>>>, RedisError>
Returns an async connection from the client.
sourcepub async fn get_multiplexed_async_connection(
&self
) -> Result<MultiplexedConnection, RedisError>
pub async fn get_multiplexed_async_connection(
&self
) -> Result<MultiplexedConnection, RedisError>
Returns an async connection from the client.
sourcepub async fn get_multiplexed_tokio_connection(
&self
) -> Result<MultiplexedConnection, RedisError>
pub async fn get_multiplexed_tokio_connection(
&self
) -> Result<MultiplexedConnection, RedisError>
Returns an async multiplexed connection from the client.
A multiplexed connection can be cloned, allowing requests to be be sent concurrently on the same underlying connection (tcp/unix socket).
sourcepub async fn create_multiplexed_tokio_connection(
&self
) -> Result<(MultiplexedConnection, impl Future<Output = ()>), RedisError>
pub async fn create_multiplexed_tokio_connection(
&self
) -> Result<(MultiplexedConnection, impl Future<Output = ()>), RedisError>
Returns an async multiplexed connection from the client and a future which must be polled
to drive any requests submitted to it (see get_multiplexed_tokio_connection).
A multiplexed connection can be cloned, allowing requests to be be sent concurrently on the same underlying connection (tcp/unix socket).
sourcepub async fn get_tokio_connection_manager(
&self
) -> Result<ConnectionManager, RedisError>
pub async fn get_tokio_connection_manager(
&self
) -> Result<ConnectionManager, RedisError>
Returns an async ConnectionManager from the client.
The connection manager wraps a
MultiplexedConnection. If a command to that
connection fails with a connection error, then a new connection is
established in the background and the error is returned to the caller.
This means that on connection loss at least one command will fail, but
the connection will be re-established automatically if possible. Please
refer to the ConnectionManager docs for
detailed reconnecting behavior.
A connection manager can be cloned, allowing requests to be be sent concurrently on the same underlying connection (tcp/unix socket).
Trait Implementations
sourceimpl ConnectionLike for Client
impl ConnectionLike for Client
sourcefn req_packed_command(&mut self, cmd: &[u8]) -> Result<Value, RedisError>
fn req_packed_command(&mut self, cmd: &[u8]) -> Result<Value, RedisError>
Sends an already encoded (packed) command into the TCP socket and reads the single response from it. Read more
sourcefn req_packed_commands(
&mut self,
cmd: &[u8],
offset: usize,
count: usize
) -> Result<Vec<Value, Global>, RedisError>
fn req_packed_commands(
&mut self,
cmd: &[u8],
offset: usize,
count: usize
) -> Result<Vec<Value, Global>, RedisError>
Sends multiple already encoded (packed) command into the TCP socket
and reads count responses from it. This is used to implement
pipelining. Read more
sourcefn get_db(&self) -> i64
fn get_db(&self) -> i64
Returns the database this connection is bound to. Note that this information might be unreliable because it’s initially cached and also might be incorrect if the connection like object is not actually connected. Read more
sourcefn check_connection(&mut self) -> bool
fn check_connection(&mut self) -> bool
Check that all connections it has are available (PING internally).
sourcefn req_command(&mut self, cmd: &Cmd) -> Result<Value, RedisError>
fn req_command(&mut self, cmd: &Cmd) -> Result<Value, RedisError>
Sends a Cmd into the TCP socket and reads a single response from it.
Auto Trait Implementations
impl RefUnwindSafe for Client
impl Send for Client
impl Sync for Client
impl Unpin for Client
impl UnwindSafe for Client
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Commands for T where
T: ConnectionLike,
impl<T> Commands for T where
T: ConnectionLike,
sourcefn get<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn get<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get the value of a key. If key is a vec this becomes an MGET.
sourcefn keys<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn keys<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Gets all keys matching pattern
sourcefn set<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn set<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Set the string value of a key.
sourcefn set_multiple<K, V, RV>(
&mut self,
items: &'a [(K, V)]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn set_multiple<K, V, RV>(
&mut self,
items: &'a [(K, V)]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Sets multiple keys to their values.
sourcefn set_ex<K, V, RV>(
&mut self,
key: K,
value: V,
seconds: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn set_ex<K, V, RV>(
&mut self,
key: K,
value: V,
seconds: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Set the value and expiration of a key.
sourcefn pset_ex<K, V, RV>(
&mut self,
key: K,
value: V,
milliseconds: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn pset_ex<K, V, RV>(
&mut self,
key: K,
value: V,
milliseconds: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Set the value and expiration in milliseconds of a key.
sourcefn set_nx<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn set_nx<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Set the value of a key, only if the key does not exist
sourcefn mset_nx<K, V, RV>(&mut self, items: &'a [(K, V)]) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn mset_nx<K, V, RV>(&mut self, items: &'a [(K, V)]) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Sets multiple keys to their values failing if at least one already exists.
sourcefn getset<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn getset<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Set the string value of a key and return its old value.
sourcefn getrange<K, RV>(
&mut self,
key: K,
from: isize,
to: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn getrange<K, RV>(
&mut self,
key: K,
from: isize,
to: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
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.
sourcefn setrange<K, V, RV>(
&mut self,
key: K,
offset: isize,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn setrange<K, V, RV>(
&mut self,
key: K,
offset: isize,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Overwrite the part of the value stored in key at the specified offset.
sourcefn del<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn del<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Delete one or more keys.
sourcefn exists<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn exists<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Determine if a key exists.
sourcefn expire<K, RV>(&mut self, key: K, seconds: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn expire<K, RV>(&mut self, key: K, seconds: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Set a key’s time to live in seconds.
sourcefn expire_at<K, RV>(&mut self, key: K, ts: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn expire_at<K, RV>(&mut self, key: K, ts: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Set the expiration for a key as a UNIX timestamp.
sourcefn pexpire<K, RV>(&mut self, key: K, ms: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn pexpire<K, RV>(&mut self, key: K, ms: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Set a key’s time to live in milliseconds.
sourcefn pexpire_at<K, RV>(&mut self, key: K, ts: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn pexpire_at<K, RV>(&mut self, key: K, ts: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Set the expiration for a key as a UNIX timestamp in milliseconds.
sourcefn persist<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn persist<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Remove the expiration from a key.
sourcefn ttl<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn ttl<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get the expiration time of a key.
sourcefn pttl<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn pttl<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get the expiration time of a key in milliseconds.
sourcefn rename<K, RV>(&mut self, key: K, new_key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn rename<K, RV>(&mut self, key: K, new_key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Rename a key.
sourcefn rename_nx<K, RV>(&mut self, key: K, new_key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn rename_nx<K, RV>(&mut self, key: K, new_key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Rename a key, only if the new key does not exist.
sourcefn unlink<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn unlink<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Unlink one or more keys.
sourcefn append<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn append<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Append a value to a key.
sourcefn incr<K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn incr<K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Increment the numeric value of a key by the given amount. This
issues a INCRBY or INCRBYFLOAT depending on the type. Read more
sourcefn decr<K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn decr<K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Decrement the numeric value of a key by the given amount.
sourcefn setbit<K, RV>(
&mut self,
key: K,
offset: usize,
value: bool
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn setbit<K, RV>(
&mut self,
key: K,
offset: usize,
value: bool
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Sets or clears the bit at offset in the string value stored at key.
sourcefn getbit<K, RV>(&mut self, key: K, offset: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn getbit<K, RV>(&mut self, key: K, offset: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Returns the bit value at offset in the string value stored at key.
sourcefn bitcount<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn bitcount<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Count set bits in a string.
sourcefn bitcount_range<K, RV>(
&mut self,
key: K,
start: usize,
end: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn bitcount_range<K, RV>(
&mut self,
key: K,
start: usize,
end: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Count set bits in a string in a range.
sourcefn bit_and<K, RV>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn bit_and<K, RV>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Read more
sourcefn bit_or<K, RV>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn bit_or<K, RV>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Read more
sourcefn bit_xor<K, RV>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn bit_xor<K, RV>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Read more
sourcefn bit_not<K, RV>(&mut self, dstkey: K, srckey: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn bit_not<K, RV>(&mut self, dstkey: K, srckey: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Read more
sourcefn strlen<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn strlen<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get the length of the value stored in a key.
sourcefn hget<K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
fn hget<K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
Gets a single (or multiple) fields from a hash.
sourcefn hdel<K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
fn hdel<K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
Deletes a single (or multiple) fields from a hash.
sourcefn hset<K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn hset<K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Sets a single field in a hash.
sourcefn hset_nx<K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn hset_nx<K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Sets a single field in a hash if it does not exist.
sourcefn hset_multiple<K, F, V, RV>(
&mut self,
key: K,
items: &'a [(F, V)]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn hset_multiple<K, F, V, RV>(
&mut self,
key: K,
items: &'a [(F, V)]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Sets a multiple fields in a hash.
sourcefn hincr<K, F, D, RV>(
&mut self,
key: K,
field: F,
delta: D
) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
D: ToRedisArgs,
RV: FromRedisValue,
fn hincr<K, F, D, RV>(
&mut self,
key: K,
field: F,
delta: D
) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
D: ToRedisArgs,
RV: FromRedisValue,
Increments a value.
sourcefn hexists<K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
fn hexists<K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError> where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
Checks if a field in a hash exists.
sourcefn hkeys<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn hkeys<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Gets all the keys in a hash.
sourcefn hvals<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn hvals<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Gets all the values in a hash.
sourcefn hgetall<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn hgetall<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Gets all the fields and values in a hash.
sourcefn hlen<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn hlen<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Gets the length of a hash.
sourcefn blmove<K, RV>(
&mut self,
srckey: K,
dstkey: K,
src_dir: Direction,
dst_dir: Direction,
timeout: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn blmove<K, RV>(
&mut self,
srckey: K,
dstkey: K,
src_dir: Direction,
dst_dir: Direction,
timeout: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Pop an element from a list, push it to another list and return it; or block until one is available Read more
sourcefn blmpop<K, RV>(
&mut self,
timeout: usize,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn blmpop<K, RV>(
&mut self,
timeout: usize,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
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. Read more
sourcefn blpop<K, RV>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn blpop<K, RV>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Remove and get the first element in a list, or block until one is available.
sourcefn brpop<K, RV>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn brpop<K, RV>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Remove and get the last element in a list, or block until one is available.
sourcefn brpoplpush<K, RV>(
&mut self,
srckey: K,
dstkey: K,
timeout: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn brpoplpush<K, RV>(
&mut self,
srckey: K,
dstkey: K,
timeout: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Pop a value from a list, push it to another list and return it; or block until one is available. Read more
sourcefn lindex<K, RV>(&mut self, key: K, index: isize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn lindex<K, RV>(&mut self, key: K, index: isize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get an element from a list by its index.
sourcefn linsert_before<K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn linsert_before<K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Insert an element before another element in a list.
sourcefn linsert_after<K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn linsert_after<K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Insert an element after another element in a list.
sourcefn llen<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn llen<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Returns the length of the list stored at key.
sourcefn lmove<K, RV>(
&mut self,
srckey: K,
dstkey: K,
src_dir: Direction,
dst_dir: Direction
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn lmove<K, RV>(
&mut self,
srckey: K,
dstkey: K,
src_dir: Direction,
dst_dir: Direction
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Pop an element a list, push it to another list and return it
sourcefn lmpop<K, RV>(
&mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn lmpop<K, RV>(
&mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Pops count elements from the first non-empty list key from the list of
provided key names. Read more
sourcefn lpop<K, RV>(
&mut self,
key: K,
count: Option<NonZeroUsize>
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn lpop<K, RV>(
&mut self,
key: K,
count: Option<NonZeroUsize>
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Removes and returns the up to count first elements of the list stored at key. Read more
sourcefn lpos<K, V, RV>(
&mut self,
key: K,
value: V,
options: LposOptions
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lpos<K, V, RV>(
&mut self,
key: K,
value: V,
options: LposOptions
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Returns the index of the first matching value of the list stored at key.
sourcefn lpush<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lpush<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Insert all the specified values at the head of the list stored at key.
sourcefn lpush_exists<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lpush_exists<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Inserts a value at the head of the list stored at key, only if key already exists and holds a list. Read more
sourcefn lrange<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn lrange<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Returns the specified elements of the list stored at key.
sourcefn lrem<K, V, RV>(
&mut self,
key: K,
count: isize,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lrem<K, V, RV>(
&mut self,
key: K,
count: isize,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Removes the first count occurrences of elements equal to value from the list stored at key. Read more
sourcefn ltrim<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn ltrim<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Trim an existing list so that it will contain only the specified range of elements specified. Read more
sourcefn lset<K, V, RV>(
&mut self,
key: K,
index: isize,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lset<K, V, RV>(
&mut self,
key: K,
index: isize,
value: V
) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Sets the list element at index to value
sourcefn rpop<K, RV>(
&mut self,
key: K,
count: Option<NonZeroUsize>
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn rpop<K, RV>(
&mut self,
key: K,
count: Option<NonZeroUsize>
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Removes and returns the up to count last elements of the list stored at key Read more
sourcefn rpoplpush<K, RV>(&mut self, key: K, dstkey: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn rpoplpush<K, RV>(&mut self, key: K, dstkey: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Pop a value from a list, push it to another list and return it.
sourcefn rpush<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn rpush<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Insert all the specified values at the tail of the list stored at key.
sourcefn rpush_exists<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn rpush_exists<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError> where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
Inserts value at the tail of the list stored at key, only if key already exists and holds a list. Read more
sourcefn sadd<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn sadd<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Add one or more members to a set.
sourcefn scard<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn scard<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get the number of members in a set.
sourcefn sdiff<K, RV>(&mut self, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn sdiff<K, RV>(&mut self, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Subtract multiple sets.
sourcefn sdiffstore<K, RV>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn sdiffstore<K, RV>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Subtract multiple sets and store the resulting set in a key.
sourcefn sinter<K, RV>(&mut self, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn sinter<K, RV>(&mut self, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Intersect multiple sets.
sourcefn sinterstore<K, RV>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn sinterstore<K, RV>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Intersect multiple sets and store the resulting set in a key.
sourcefn sismember<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn sismember<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Determine if a given value is a member of a set.
sourcefn smembers<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn smembers<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get all the members in a set.
sourcefn smove<K, M, RV>(
&mut self,
srckey: K,
dstkey: K,
member: M
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn smove<K, M, RV>(
&mut self,
srckey: K,
dstkey: K,
member: M
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Move a member from one set to another.
sourcefn spop<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn spop<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Remove and return a random member from a set.
sourcefn srandmember<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn srandmember<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get one random member from a set.
sourcefn srandmember_multiple<K, RV>(
&mut self,
key: K,
count: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn srandmember_multiple<K, RV>(
&mut self,
key: K,
count: usize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get multiple random members from a set.
sourcefn srem<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn srem<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Remove one or more members from a set.
sourcefn sunion<K, RV>(&mut self, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn sunion<K, RV>(&mut self, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Add multiple sets.
sourcefn sunionstore<K, RV>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn sunionstore<K, RV>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Add multiple sets and store the resulting set in a key.
sourcefn zadd<K, S, M, RV>(
&mut self,
key: K,
member: M,
score: S
) -> Result<RV, RedisError> where
K: ToRedisArgs,
S: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zadd<K, S, M, RV>(
&mut self,
key: K,
member: M,
score: S
) -> Result<RV, RedisError> where
K: ToRedisArgs,
S: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Add one member to a sorted set, or update its score if it already exists.
sourcefn zadd_multiple<K, S, M, RV>(
&mut self,
key: K,
items: &'a [(S, M)]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
S: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zadd_multiple<K, S, M, RV>(
&mut self,
key: K,
items: &'a [(S, M)]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
S: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Add multiple members to a sorted set, or update its score if it already exists.
sourcefn zcard<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zcard<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Get the number of members in a sorted set.
sourcefn zcount<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zcount<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Count the members in a sorted set with scores within the given values.
sourcefn zincr<K, M, D, RV>(
&mut self,
key: K,
member: M,
delta: D
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
D: ToRedisArgs,
RV: FromRedisValue,
fn zincr<K, M, D, RV>(
&mut self,
key: K,
member: M,
delta: D
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
D: ToRedisArgs,
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. Read more
sourcefn zinterstore<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Intersect multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more
sourcefn zinterstore_min<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_min<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Intersect multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more
sourcefn zinterstore_max<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_max<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more
sourcefn zlexcount<K, L, RV>(
&mut self,
key: K,
min: L,
max: L
) -> Result<RV, RedisError> where
K: ToRedisArgs,
L: ToRedisArgs,
RV: FromRedisValue,
fn zlexcount<K, L, RV>(
&mut self,
key: K,
min: L,
max: L
) -> Result<RV, RedisError> where
K: ToRedisArgs,
L: ToRedisArgs,
RV: FromRedisValue,
Count the number of members in a sorted set between a given lexicographical range.
sourcefn zpopmax<K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zpopmax<K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Removes and returns up to count members with the highest scores in a sorted set
sourcefn zpopmin<K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zpopmin<K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Removes and returns up to count members with the lowest scores in a sorted set
sourcefn zrandmember<K, RV>(
&mut self,
key: K,
count: Option<isize>
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrandmember<K, RV>(
&mut self,
key: K,
count: Option<isize>
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Return up to count random members in a sorted set (or 1 if count == None)
sourcefn zrandmember_withscores<K, RV>(
&mut self,
key: K,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrandmember_withscores<K, RV>(
&mut self,
key: K,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Return up to count random members in a sorted set with scores
sourcefn zrange<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrange<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by index
sourcefn zrange_withscores<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrange_withscores<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by index with scores.
sourcefn zrangebylex<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zrangebylex<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical range.
sourcefn zrangebylex_limit<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zrangebylex_limit<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more
sourcefn zrevrangebylex<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrevrangebylex<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical range.
sourcefn zrevrangebylex_limit<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrevrangebylex_limit<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more
sourcefn zrangebyscore<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zrangebyscore<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by score.
sourcefn zrangebyscore_withscores<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zrangebyscore_withscores<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with scores.
sourcefn zrangebyscore_limit<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zrangebyscore_limit<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit.
sourcefn zrangebyscore_limit_withscores<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zrangebyscore_limit_withscores<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit with scores.
sourcefn zrank<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrank<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Determine the index of a member in a sorted set.
sourcefn zrem<K, M, RV>(&mut self, key: K, members: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrem<K, M, RV>(&mut self, key: K, members: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Remove one or more members from a sorted set.
sourcefn zrembylex<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zrembylex<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Remove all members in a sorted set between the given lexicographical range.
sourcefn zremrangebyrank<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zremrangebyrank<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Remove all members in a sorted set within the given indexes.
sourcefn zrembyscore<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
fn zrembyscore<K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
MM: ToRedisArgs,
RV: FromRedisValue,
Remove all members in a sorted set within the given scores.
sourcefn zrevrange<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrevrange<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more
sourcefn zrevrange_withscores<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrevrange_withscores<K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more
sourcefn zrevrangebyscore<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrevrangebyscore<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by score.
sourcefn zrevrangebyscore_withscores<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrevrangebyscore_withscores<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with scores.
sourcefn zrevrangebyscore_limit<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrevrangebyscore_limit<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit.
sourcefn zrevrangebyscore_limit_withscores<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrevrangebyscore_limit_withscores<K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError> where
K: ToRedisArgs,
MM: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Return a range of members in a sorted set, by score with limit with scores.
sourcefn zrevrank<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrevrank<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Determine the index of a member in a sorted set, with scores ordered from high to low.
sourcefn zscore<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zscore<K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Get the score associated with the given member in a sorted set.
sourcefn zscore_multiple<K, M, RV>(
&mut self,
key: K,
members: &'a [M]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zscore_multiple<K, M, RV>(
&mut self,
key: K,
members: &'a [M]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
Get the scores associated with multiple members in a sorted set.
sourcefn zunionstore<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Unions multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more
sourcefn zunionstore_min<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_min<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Unions multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more
sourcefn zunionstore_max<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_max<K, RV>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more
sourcefn pfadd<K, E, RV>(&mut self, key: K, element: E) -> Result<RV, RedisError> where
K: ToRedisArgs,
E: ToRedisArgs,
RV: FromRedisValue,
fn pfadd<K, E, RV>(&mut self, key: K, element: E) -> Result<RV, RedisError> where
K: ToRedisArgs,
E: ToRedisArgs,
RV: FromRedisValue,
Adds the specified elements to the specified HyperLogLog.
sourcefn pfcount<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn pfcount<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s). Read more
sourcefn pfmerge<K, RV>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn pfmerge<K, RV>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Merge N different HyperLogLogs into a single one.
sourcefn publish<K, E, RV>(
&mut self,
channel: K,
message: E
) -> Result<RV, RedisError> where
K: ToRedisArgs,
E: ToRedisArgs,
RV: FromRedisValue,
fn publish<K, E, RV>(
&mut self,
channel: K,
message: E
) -> Result<RV, RedisError> where
K: ToRedisArgs,
E: ToRedisArgs,
RV: FromRedisValue,
Posts a message to the given channel.
sourcefn xrevrange_all<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn xrevrange_all<K, RV>(&mut self, key: K) -> Result<RV, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
This is the reverse version of xrange_all.
The same rules apply for start and end here. Read more
sourcefn scan<RV>(&mut self) -> Result<Iter<'_, RV>, RedisError> where
RV: FromRedisValue,
fn scan<RV>(&mut self) -> Result<Iter<'_, RV>, RedisError> where
RV: FromRedisValue,
Incrementally iterate the keys space.
sourcefn scan_match<P, RV>(&mut self, pattern: P) -> Result<Iter<'_, RV>, RedisError> where
P: ToRedisArgs,
RV: FromRedisValue,
fn scan_match<P, RV>(&mut self, pattern: P) -> Result<Iter<'_, RV>, RedisError> where
P: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate the keys space for keys matching a pattern.
sourcefn hscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn hscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate hash fields and associated values.
sourcefn hscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
RV: FromRedisValue,
fn hscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate hash fields and associated values for field names matching a pattern. Read more
sourcefn sscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn sscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate set elements.
sourcefn sscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
RV: FromRedisValue,
fn sscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate set elements for elements matching a pattern.
sourcefn zscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
fn zscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate sorted set elements.
sourcefn zscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
RV: FromRedisValue,
fn zscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError> where
K: ToRedisArgs,
P: ToRedisArgs,
RV: FromRedisValue,
Incrementally iterate sorted set elements for elements matching a pattern.
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T> WithSubscriber for T
impl<T> WithSubscriber for T
sourcefn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,
Attaches the provided Subscriber to this type, returning a
WithDispatch wrapper. Read more
sourcefn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
Attaches the current default Subscriber to this type, returning a
WithDispatch wrapper. Read more