pub struct Worker<T> { /* private fields */ }Expand description
Represents a generic Worker that can be in many different states
Implementations§
source§impl<S, P> Worker<Ready<S, P>>
impl<S, P> Worker<Ready<S, P>>
sourcepub fn with_executor<E, J>(self, executor: E) -> Worker<Context<E>>where
S: Service<Request<J>> + Send + 'static + Clone,
P: Backend<Request<J>> + 'static,
J: Send + 'static + Sync,
<S as Service<Request<J>>>::Future: Send,
<S as Service<Request<J>>>::Response: 'static,
<S as Service<Request<J>>>::Error: Send + Sync + 'static + Into<Box<dyn Error + Sync + Send>>,
<P as Backend<Request<J>>>::Stream: Unpin + Send + 'static,
E: Executor + Clone + Send + 'static + Sync,
pub fn with_executor<E, J>(self, executor: E) -> Worker<Context<E>>where
S: Service<Request<J>> + Send + 'static + Clone,
P: Backend<Request<J>> + 'static,
J: Send + 'static + Sync,
<S as Service<Request<J>>>::Future: Send,
<S as Service<Request<J>>>::Response: 'static,
<S as Service<Request<J>>>::Error: Send + Sync + 'static + Into<Box<dyn Error + Sync + Send>>,
<P as Backend<Request<J>>>::Stream: Unpin + Send + 'static,
E: Executor + Clone + Send + 'static + Sync,
Start a worker with a custom executor
sourcepub fn with_monitor<E, J>(self, monitor: &Monitor<E>) -> Worker<Context<E>>where
S: Service<Request<J>> + Send + 'static + Clone,
P: Backend<Request<J>> + 'static,
J: Send + 'static + Sync,
<S as Service<Request<J>>>::Future: Send,
<S as Service<Request<J>>>::Response: 'static,
<S as Service<Request<J>>>::Error: Send + Sync + 'static + Into<Box<dyn Error + Sync + Send>>,
<P as Backend<Request<J>>>::Stream: Unpin + Send + 'static,
E: Executor + Clone + Send + 'static + Sync,
pub fn with_monitor<E, J>(self, monitor: &Monitor<E>) -> Worker<Context<E>>where
S: Service<Request<J>> + Send + 'static + Clone,
P: Backend<Request<J>> + 'static,
J: Send + 'static + Sync,
<S as Service<Request<J>>>::Future: Send,
<S as Service<Request<J>>>::Response: 'static,
<S as Service<Request<J>>>::Error: Send + Sync + 'static + Into<Box<dyn Error + Sync + Send>>,
<P as Backend<Request<J>>>::Stream: Unpin + Send + 'static,
E: Executor + Clone + Send + 'static + Sync,
Run as a monitored worker
sourcepub fn with_monitor_instances<E, J>(
self,
instances: usize,
monitor: &Monitor<E>
) -> Vec<Worker<Context<E>>>where
S: Service<Request<J>> + Send + 'static + Clone,
P: Backend<Request<J>> + 'static,
J: Send + 'static + Sync,
<S as Service<Request<J>>>::Future: Send,
<S as Service<Request<J>>>::Response: 'static,
<S as Service<Request<J>>>::Error: Send + Sync + 'static + Into<Box<dyn Error + Sync + Send>>,
<P as Backend<Request<J>>>::Stream: Unpin + Send + 'static,
E: Executor + Clone + Send + 'static + Sync,
pub fn with_monitor_instances<E, J>(
self,
instances: usize,
monitor: &Monitor<E>
) -> Vec<Worker<Context<E>>>where
S: Service<Request<J>> + Send + 'static + Clone,
P: Backend<Request<J>> + 'static,
J: Send + 'static + Sync,
<S as Service<Request<J>>>::Future: Send,
<S as Service<Request<J>>>::Response: 'static,
<S as Service<Request<J>>>::Error: Send + Sync + 'static + Into<Box<dyn Error + Sync + Send>>,
<P as Backend<Request<J>>>::Stream: Unpin + Send + 'static,
E: Executor + Clone + Send + 'static + Sync,
Run a specified amounts of instances
sourcepub fn with_executor_instances<E, J>(
self,
instances: usize,
executor: E
) -> Vec<Worker<Context<E>>>where
S: Service<Request<J>> + Send + 'static + Clone,
P: Backend<Request<J>> + 'static,
J: Send + 'static + Sync,
<S as Service<Request<J>>>::Future: Send,
<S as Service<Request<J>>>::Response: 'static,
<S as Service<Request<J>>>::Error: Send + Sync + 'static + Into<Box<dyn Error + Sync + Send>>,
<P as Backend<Request<J>>>::Stream: Unpin + Send + 'static,
E: Executor + Clone + Send + 'static + Sync,
pub fn with_executor_instances<E, J>(
self,
instances: usize,
executor: E
) -> Vec<Worker<Context<E>>>where
S: Service<Request<J>> + Send + 'static + Clone,
P: Backend<Request<J>> + 'static,
J: Send + 'static + Sync,
<S as Service<Request<J>>>::Future: Send,
<S as Service<Request<J>>>::Response: 'static,
<S as Service<Request<J>>>::Error: Send + Sync + 'static + Into<Box<dyn Error + Sync + Send>>,
<P as Backend<Request<J>>>::Stream: Unpin + Send + 'static,
E: Executor + Clone + Send + 'static + Sync,
Run specified worker instances via a specific executor
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for Worker<T>where
T: Freeze,
impl<T> RefUnwindSafe for Worker<T>where
T: RefUnwindSafe,
impl<T> Send for Worker<T>where
T: Send,
impl<T> Sync for Worker<T>where
T: Sync,
impl<T> Unpin for Worker<T>where
T: Unpin,
impl<T> UnwindSafe for Worker<T>where
T: UnwindSafe,
Blanket Implementations§
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> Commands for Twhere
T: ConnectionLike,
impl<T> Commands for Twhere
T: ConnectionLike,
source§fn get<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn get<'a, 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.source§fn mget<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn mget<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get values of keys
source§fn keys<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn keys<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Gets all keys matching pattern
source§fn set<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
fn set<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
Set the string value of a key.
source§fn set_options<'a, K, V, RV>(
&mut self,
key: K,
value: V,
options: SetOptions
) -> Result<RV, RedisError>
fn set_options<'a, K, V, RV>( &mut self, key: K, value: V, options: SetOptions ) -> Result<RV, RedisError>
Set the string value of a key with options.
source§fn set_multiple<'a, K, V, RV>(
&mut self,
items: &'a [(K, V)]
) -> Result<RV, RedisError>
fn set_multiple<'a, K, V, RV>( &mut self, items: &'a [(K, V)] ) -> Result<RV, RedisError>
👎Deprecated since 0.22.4: Renamed to mset() to reflect Redis name
Sets multiple keys to their values.
source§fn mset<'a, K, V, RV>(&mut self, items: &'a [(K, V)]) -> Result<RV, RedisError>
fn mset<'a, K, V, RV>(&mut self, items: &'a [(K, V)]) -> Result<RV, RedisError>
Sets multiple keys to their values.
source§fn set_ex<'a, K, V, RV>(
&mut self,
key: K,
value: V,
seconds: u64
) -> Result<RV, RedisError>
fn set_ex<'a, K, V, RV>( &mut self, key: K, value: V, seconds: u64 ) -> Result<RV, RedisError>
Set the value and expiration of a key.
source§fn pset_ex<'a, K, V, RV>(
&mut self,
key: K,
value: V,
milliseconds: u64
) -> Result<RV, RedisError>
fn pset_ex<'a, K, V, RV>( &mut self, key: K, value: V, milliseconds: u64 ) -> Result<RV, RedisError>
Set the value and expiration in milliseconds of a key.
source§fn set_nx<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
fn set_nx<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
Set the value of a key, only if the key does not exist
source§fn mset_nx<'a, K, V, RV>(
&mut self,
items: &'a [(K, V)]
) -> Result<RV, RedisError>
fn mset_nx<'a, K, V, RV>( &mut self, items: &'a [(K, V)] ) -> Result<RV, RedisError>
Sets multiple keys to their values failing if at least one already exists.
source§fn getset<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
fn getset<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
Set the string value of a key and return its old value.
source§fn getrange<'a, K, RV>(
&mut self,
key: K,
from: isize,
to: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn getrange<'a, 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.
source§fn setrange<'a, K, V, RV>(
&mut self,
key: K,
offset: isize,
value: V
) -> Result<RV, RedisError>
fn setrange<'a, K, V, RV>( &mut self, key: K, offset: isize, value: V ) -> Result<RV, RedisError>
Overwrite the part of the value stored in key at the specified offset.
source§fn del<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn del<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Delete one or more keys.
source§fn exists<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn exists<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Determine if a key exists.
source§fn key_type<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn key_type<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Determine the type of a key.
source§fn expire<'a, K, RV>(&mut self, key: K, seconds: i64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn expire<'a, K, RV>(&mut self, key: K, seconds: i64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Set a key’s time to live in seconds.
source§fn expire_at<'a, K, RV>(&mut self, key: K, ts: i64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn expire_at<'a, K, RV>(&mut self, key: K, ts: i64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Set the expiration for a key as a UNIX timestamp.
source§fn pexpire<'a, K, RV>(&mut self, key: K, ms: i64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn pexpire<'a, K, RV>(&mut self, key: K, ms: i64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Set a key’s time to live in milliseconds.
source§fn pexpire_at<'a, K, RV>(&mut self, key: K, ts: i64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn pexpire_at<'a, K, RV>(&mut self, key: K, ts: i64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Set the expiration for a key as a UNIX timestamp in milliseconds.
source§fn persist<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn persist<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Remove the expiration from a key.
source§fn ttl<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn ttl<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get the expiration time of a key.
source§fn pttl<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn pttl<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get the expiration time of a key in milliseconds.
source§fn get_ex<'a, K, RV>(
&mut self,
key: K,
expire_at: Expiry
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn get_ex<'a, K, RV>(
&mut self,
key: K,
expire_at: Expiry
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get the value of a key and set expiration
source§fn get_del<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn get_del<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get the value of a key and delete it
source§fn rename<'a, K, N, RV>(&mut self, key: K, new_key: N) -> Result<RV, RedisError>
fn rename<'a, K, N, RV>(&mut self, key: K, new_key: N) -> Result<RV, RedisError>
Rename a key.
source§fn rename_nx<'a, K, N, RV>(
&mut self,
key: K,
new_key: N
) -> Result<RV, RedisError>
fn rename_nx<'a, K, N, RV>( &mut self, key: K, new_key: N ) -> Result<RV, RedisError>
Rename a key, only if the new key does not exist.
source§fn unlink<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn unlink<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Unlink one or more keys.
source§fn append<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
fn append<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
Append a value to a key.
source§fn incr<'a, K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>
fn incr<'a, K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>
Increment the numeric value of a key by the given amount. This
issues a
INCRBY or INCRBYFLOAT depending on the type.source§fn decr<'a, K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>
fn decr<'a, K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>
Decrement the numeric value of a key by the given amount.
source§fn setbit<'a, K, RV>(
&mut self,
key: K,
offset: usize,
value: bool
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn setbit<'a, 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.
source§fn getbit<'a, K, RV>(&mut self, key: K, offset: usize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn getbit<'a, 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.
source§fn bitcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bitcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Count set bits in a string.
source§fn bitcount_range<'a, K, RV>(
&mut self,
key: K,
start: usize,
end: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bitcount_range<'a, 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.
source§fn bit_and<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S
) -> Result<RV, RedisError>
fn bit_and<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S ) -> Result<RV, RedisError>
Perform a bitwise AND between multiple keys (containing string values)
and store the result in the destination key.
source§fn bit_or<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S
) -> Result<RV, RedisError>
fn bit_or<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S ) -> Result<RV, RedisError>
Perform a bitwise OR between multiple keys (containing string values)
and store the result in the destination key.
source§fn bit_xor<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S
) -> Result<RV, RedisError>
fn bit_xor<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S ) -> Result<RV, RedisError>
Perform a bitwise XOR between multiple keys (containing string values)
and store the result in the destination key.
source§fn bit_not<'a, D, S, RV>(
&mut self,
dstkey: D,
srckey: S
) -> Result<RV, RedisError>
fn bit_not<'a, D, S, RV>( &mut self, dstkey: D, srckey: S ) -> Result<RV, RedisError>
Perform a bitwise NOT of the key (containing string values)
and store the result in the destination key.
source§fn strlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn strlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get the length of the value stored in a key.
source§fn hget<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>
fn hget<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>
Gets a single (or multiple) fields from a hash.
source§fn hdel<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>
fn hdel<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>
Deletes a single (or multiple) fields from a hash.
source§fn hset<'a, K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V
) -> Result<RV, RedisError>
fn hset<'a, K, F, V, RV>( &mut self, key: K, field: F, value: V ) -> Result<RV, RedisError>
Sets a single field in a hash.
source§fn hset_nx<'a, K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V
) -> Result<RV, RedisError>
fn hset_nx<'a, K, F, V, RV>( &mut self, key: K, field: F, value: V ) -> Result<RV, RedisError>
Sets a single field in a hash if it does not exist.
source§fn hset_multiple<'a, K, F, V, RV>(
&mut self,
key: K,
items: &'a [(F, V)]
) -> Result<RV, RedisError>
fn hset_multiple<'a, K, F, V, RV>( &mut self, key: K, items: &'a [(F, V)] ) -> Result<RV, RedisError>
Sets a multiple fields in a hash.
source§fn hincr<'a, K, F, D, RV>(
&mut self,
key: K,
field: F,
delta: D
) -> Result<RV, RedisError>
fn hincr<'a, K, F, D, RV>( &mut self, key: K, field: F, delta: D ) -> Result<RV, RedisError>
Increments a value.
source§fn hexists<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>
fn hexists<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>
Checks if a field in a hash exists.
source§fn hkeys<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hkeys<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Gets all the keys in a hash.
source§fn hvals<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hvals<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Gets all the values in a hash.
source§fn hgetall<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hgetall<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Gets all the fields and values in a hash.
source§fn hlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Gets the length of a hash.
source§fn blmove<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64
) -> Result<RV, RedisError>
fn blmove<'a, S, D, RV>( &mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64 ) -> Result<RV, RedisError>
Pop an element from a list, push it to another list
and return it; or block until one is available
source§fn blmpop<'a, K, RV>(
&mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn blmpop<'a, K, RV>(
&mut self,
timeout: f64,
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.source§fn blpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn blpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Remove and get the first element in a list, or block until one is available.
source§fn brpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn brpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Remove and get the last element in a list, or block until one is available.
source§fn brpoplpush<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
timeout: f64
) -> Result<RV, RedisError>
fn brpoplpush<'a, S, D, RV>( &mut self, srckey: S, dstkey: D, timeout: f64 ) -> Result<RV, RedisError>
Pop a value from a list, push it to another list and return it;
or block until one is available.
source§fn lindex<'a, K, RV>(&mut self, key: K, index: isize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lindex<'a, 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.
source§fn linsert_before<'a, K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V
) -> Result<RV, RedisError>
fn linsert_before<'a, K, P, V, RV>( &mut self, key: K, pivot: P, value: V ) -> Result<RV, RedisError>
Insert an element before another element in a list.
source§fn linsert_after<'a, K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V
) -> Result<RV, RedisError>
fn linsert_after<'a, K, P, V, RV>( &mut self, key: K, pivot: P, value: V ) -> Result<RV, RedisError>
Insert an element after another element in a list.
source§fn llen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn llen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Returns the length of the list stored at key.
source§fn lmove<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction
) -> Result<RV, RedisError>
fn lmove<'a, S, D, RV>( &mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction ) -> Result<RV, RedisError>
Pop an element a list, push it to another list and return it
source§fn lmpop<'a, K, RV>(
&mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lmpop<'a, 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.source§fn lpop<'a, K, RV>(
&mut self,
key: K,
count: Option<NonZero<usize>>
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lpop<'a, K, RV>(
&mut self,
key: K,
count: Option<NonZero<usize>>
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Removes and returns the up to
count first elements of the list stored at key. Read moresource§fn lpos<'a, K, V, RV>(
&mut self,
key: K,
value: V,
options: LposOptions
) -> Result<RV, RedisError>
fn lpos<'a, K, V, RV>( &mut self, key: K, value: V, options: LposOptions ) -> Result<RV, RedisError>
Returns the index of the first matching value of the list stored at key.
source§fn lpush<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
fn lpush<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
Insert all the specified values at the head of the list stored at key.
source§fn lpush_exists<'a, K, V, RV>(
&mut self,
key: K,
value: V
) -> Result<RV, RedisError>
fn lpush_exists<'a, K, V, RV>( &mut self, key: K, value: V ) -> Result<RV, RedisError>
Inserts a value at the head of the list stored at key, only if key
already exists and holds a list.
source§fn lrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lrange<'a, 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.
source§fn lrem<'a, K, V, RV>(
&mut self,
key: K,
count: isize,
value: V
) -> Result<RV, RedisError>
fn lrem<'a, K, V, RV>( &mut self, key: K, count: isize, value: V ) -> Result<RV, RedisError>
Removes the first count occurrences of elements equal to value
from the list stored at key.
source§fn ltrim<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn ltrim<'a, 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.
source§fn lset<'a, K, V, RV>(
&mut self,
key: K,
index: isize,
value: V
) -> Result<RV, RedisError>
fn lset<'a, K, V, RV>( &mut self, key: K, index: isize, value: V ) -> Result<RV, RedisError>
Sets the list element at index to value
source§fn rpop<'a, K, RV>(
&mut self,
key: K,
count: Option<NonZero<usize>>
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn rpop<'a, K, RV>(
&mut self,
key: K,
count: Option<NonZero<usize>>
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Removes and returns the up to
count last elements of the list stored at key Read moresource§fn rpoplpush<'a, K, D, RV>(
&mut self,
key: K,
dstkey: D
) -> Result<RV, RedisError>
fn rpoplpush<'a, K, D, RV>( &mut self, key: K, dstkey: D ) -> Result<RV, RedisError>
Pop a value from a list, push it to another list and return it.
source§fn rpush<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
fn rpush<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
Insert all the specified values at the tail of the list stored at key.
source§fn rpush_exists<'a, K, V, RV>(
&mut self,
key: K,
value: V
) -> Result<RV, RedisError>
fn rpush_exists<'a, K, V, RV>( &mut self, key: K, value: V ) -> Result<RV, RedisError>
Inserts value at the tail of the list stored at key, only if key
already exists and holds a list.
source§fn sadd<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>
fn sadd<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>
Add one or more members to a set.
source§fn scard<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn scard<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get the number of members in a set.
source§fn sdiff<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sdiff<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Subtract multiple sets.
source§fn sdiffstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K
) -> Result<RV, RedisError>
fn sdiffstore<'a, D, K, RV>( &mut self, dstkey: D, keys: K ) -> Result<RV, RedisError>
Subtract multiple sets and store the resulting set in a key.
source§fn sinter<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sinter<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Intersect multiple sets.
source§fn sinterstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K
) -> Result<RV, RedisError>
fn sinterstore<'a, D, K, RV>( &mut self, dstkey: D, keys: K ) -> Result<RV, RedisError>
Intersect multiple sets and store the resulting set in a key.
source§fn sismember<'a, K, M, RV>(
&mut self,
key: K,
member: M
) -> Result<RV, RedisError>
fn sismember<'a, K, M, RV>( &mut self, key: K, member: M ) -> Result<RV, RedisError>
Determine if a given value is a member of a set.
source§fn smismember<'a, K, M, RV>(
&mut self,
key: K,
members: M
) -> Result<RV, RedisError>
fn smismember<'a, K, M, RV>( &mut self, key: K, members: M ) -> Result<RV, RedisError>
Determine if given values are members of a set.
source§fn smembers<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn smembers<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get all the members in a set.
source§fn smove<'a, S, D, M, RV>(
&mut self,
srckey: S,
dstkey: D,
member: M
) -> Result<RV, RedisError>
fn smove<'a, S, D, M, RV>( &mut self, srckey: S, dstkey: D, member: M ) -> Result<RV, RedisError>
Move a member from one set to another.
source§fn spop<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn spop<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Remove and return a random member from a set.
source§fn srandmember<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn srandmember<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get one random member from a set.
source§fn srandmember_multiple<'a, K, RV>(
&mut self,
key: K,
count: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn srandmember_multiple<'a, K, RV>(
&mut self,
key: K,
count: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get multiple random members from a set.
source§fn srem<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>
fn srem<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>
Remove one or more members from a set.
source§fn sunion<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sunion<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Add multiple sets.
source§fn sunionstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K
) -> Result<RV, RedisError>
fn sunionstore<'a, D, K, RV>( &mut self, dstkey: D, keys: K ) -> Result<RV, RedisError>
Add multiple sets and store the resulting set in a key.
source§fn zadd<'a, K, S, M, RV>(
&mut self,
key: K,
member: M,
score: S
) -> Result<RV, RedisError>
fn zadd<'a, K, S, M, RV>( &mut self, key: K, member: M, score: S ) -> Result<RV, RedisError>
Add one member to a sorted set, or update its score if it already exists.
source§fn zadd_multiple<'a, K, S, M, RV>(
&mut self,
key: K,
items: &'a [(S, M)]
) -> Result<RV, RedisError>
fn zadd_multiple<'a, K, S, M, RV>( &mut self, key: K, items: &'a [(S, M)] ) -> Result<RV, RedisError>
Add multiple members to a sorted set, or update its score if it already exists.
source§fn zcard<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zcard<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Get the number of members in a sorted set.
source§fn zcount<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError>
fn zcount<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>
Count the members in a sorted set with scores within the given values.
source§fn zincr<'a, K, M, D, RV>(
&mut self,
key: K,
member: M,
delta: D
) -> Result<RV, RedisError>
fn zincr<'a, K, M, D, RV>( &mut self, key: K, member: M, delta: D ) -> Result<RV, RedisError>
Increments the member in a sorted set at key by delta.
If the member does not exist, it is added with delta as its score.
source§fn zinterstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: &'a [K]
) -> Result<RV, RedisError>
fn zinterstore<'a, D, K, RV>( &mut self, dstkey: D, keys: &'a [K] ) -> Result<RV, RedisError>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using SUM as aggregation function.
source§fn zinterstore_min<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: &'a [K]
) -> Result<RV, RedisError>
fn zinterstore_min<'a, D, K, RV>( &mut self, dstkey: D, keys: &'a [K] ) -> Result<RV, RedisError>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
source§fn zinterstore_max<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: &'a [K]
) -> Result<RV, RedisError>
fn zinterstore_max<'a, D, K, RV>( &mut self, dstkey: D, keys: &'a [K] ) -> Result<RV, RedisError>
Intersect multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
source§fn zinterstore_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>
fn zinterstore_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)] ) -> Result<RV, RedisError>
Commands::zinterstore, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zinterstore_min_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>
fn zinterstore_min_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)] ) -> Result<RV, RedisError>
Commands::zinterstore_min, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zinterstore_max_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>
fn zinterstore_max_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)] ) -> Result<RV, RedisError>
Commands::zinterstore_max, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zlexcount<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError>
fn zlexcount<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>
Count the number of members in a sorted set between a given lexicographical range.
source§fn bzpopmax<'a, K, RV>(
&mut self,
key: K,
timeout: f64
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bzpopmax<'a, K, RV>(
&mut self,
key: K,
timeout: f64
) -> Result<RV, RedisError>where
K: ToRedisArgs,
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, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zpopmax<'a, 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
source§fn bzpopmin<'a, K, RV>(
&mut self,
key: K,
timeout: f64
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bzpopmin<'a, K, RV>(
&mut self,
key: K,
timeout: f64
) -> Result<RV, RedisError>where
K: ToRedisArgs,
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, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zpopmin<'a, 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
source§fn bzmpop_max<'a, K, RV>(
&mut self,
timeout: f64,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bzmpop_max<'a, K, RV>(
&mut self,
timeout: f64,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
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, RV>(
&mut self,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zmpop_max<'a, K, RV>(
&mut self,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
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, RV>(
&mut self,
timeout: f64,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bzmpop_min<'a, K, RV>(
&mut self,
timeout: f64,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
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, RV>(
&mut self,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zmpop_min<'a, K, RV>(
&mut self,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Removes and returns up to count members with the lowest scores,
from the first non-empty sorted set in the provided list of key names.
source§fn zrandmember<'a, K, RV>(
&mut self,
key: K,
count: Option<isize>
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrandmember<'a, 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)source§fn zrandmember_withscores<'a, K, RV>(
&mut self,
key: K,
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrandmember_withscores<'a, 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
source§fn zrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrange<'a, 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
source§fn zrange_withscores<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrange_withscores<'a, 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.
source§fn zrangebylex<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError>
fn zrangebylex<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by lexicographical range.
source§fn zrangebylex_limit<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError>
fn zrangebylex_limit<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, offset: isize, count: isize ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
source§fn zrevrangebylex<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError>
fn zrevrangebylex<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by lexicographical range.
source§fn zrevrangebylex_limit<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError>
fn zrevrangebylex_limit<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M, offset: isize, count: isize ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by lexicographical
range with offset and limit.
source§fn zrangebyscore<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError>
fn zrangebyscore<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by score.
source§fn zrangebyscore_withscores<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError>
fn zrangebyscore_withscores<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by score with scores.
source§fn zrangebyscore_limit<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError>
fn zrangebyscore_limit<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, offset: isize, count: isize ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by score with limit.
source§fn zrangebyscore_limit_withscores<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize
) -> Result<RV, RedisError>
fn zrangebyscore_limit_withscores<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, offset: isize, count: isize ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by score with limit with scores.
source§fn zrank<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>
fn zrank<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>
Determine the index of a member in a sorted set.
source§fn zrem<'a, K, M, RV>(&mut self, key: K, members: M) -> Result<RV, RedisError>
fn zrem<'a, K, M, RV>(&mut self, key: K, members: M) -> Result<RV, RedisError>
Remove one or more members from a sorted set.
source§fn zrembylex<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError>
fn zrembylex<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>
Remove all members in a sorted set between the given lexicographical range.
source§fn zremrangebyrank<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zremrangebyrank<'a, 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.
source§fn zrembyscore<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM
) -> Result<RV, RedisError>
fn zrembyscore<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>
Remove all members in a sorted set within the given scores.
source§fn zrevrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrevrange<'a, 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.
source§fn zrevrange_withscores<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrevrange_withscores<'a, 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.
source§fn zrevrangebyscore<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError>
fn zrevrangebyscore<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by score.
source§fn zrevrangebyscore_withscores<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M
) -> Result<RV, RedisError>
fn zrevrangebyscore_withscores<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by score with scores.
source§fn zrevrangebyscore_limit<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError>
fn zrevrangebyscore_limit<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M, offset: isize, count: isize ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by score with limit.
source§fn zrevrangebyscore_limit_withscores<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize
) -> Result<RV, RedisError>
fn zrevrangebyscore_limit_withscores<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M, offset: isize, count: isize ) -> Result<RV, RedisError>
Return a range of members in a sorted set, by score with limit with scores.
source§fn zrevrank<'a, K, M, RV>(
&mut self,
key: K,
member: M
) -> Result<RV, RedisError>
fn zrevrank<'a, K, M, RV>( &mut self, key: K, member: M ) -> Result<RV, RedisError>
Determine the index of a member in a sorted set, with scores ordered from high to low.
source§fn zscore<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>
fn zscore<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>
Get the score associated with the given member in a sorted set.
source§fn zscore_multiple<'a, K, M, RV>(
&mut self,
key: K,
members: &'a [M]
) -> Result<RV, RedisError>
fn zscore_multiple<'a, K, M, RV>( &mut self, key: K, members: &'a [M] ) -> Result<RV, RedisError>
Get the scores associated with multiple members in a sorted set.
source§fn zunionstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: &'a [K]
) -> Result<RV, RedisError>
fn zunionstore<'a, D, K, RV>( &mut self, dstkey: D, keys: &'a [K] ) -> Result<RV, RedisError>
Unions multiple sorted sets and store the resulting sorted set in
a new key using SUM as aggregation function.
source§fn zunionstore_min<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: &'a [K]
) -> Result<RV, RedisError>
fn zunionstore_min<'a, D, K, RV>( &mut self, dstkey: D, keys: &'a [K] ) -> Result<RV, RedisError>
Unions multiple sorted sets and store the resulting sorted set in
a new key using MIN as aggregation function.
source§fn zunionstore_max<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: &'a [K]
) -> Result<RV, RedisError>
fn zunionstore_max<'a, D, K, RV>( &mut self, dstkey: D, keys: &'a [K] ) -> Result<RV, RedisError>
Unions multiple sorted sets and store the resulting sorted set in
a new key using MAX as aggregation function.
source§fn zunionstore_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>
fn zunionstore_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)] ) -> Result<RV, RedisError>
Commands::zunionstore, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zunionstore_min_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>
fn zunionstore_min_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)] ) -> Result<RV, RedisError>
Commands::zunionstore_min, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zunionstore_max_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>
fn zunionstore_max_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)] ) -> Result<RV, RedisError>
Commands::zunionstore_max, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn pfadd<'a, K, E, RV>(&mut self, key: K, element: E) -> Result<RV, RedisError>
fn pfadd<'a, K, E, RV>(&mut self, key: K, element: E) -> Result<RV, RedisError>
Adds the specified elements to the specified HyperLogLog.
source§fn pfcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn pfcount<'a, 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).
source§fn pfmerge<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S
) -> Result<RV, RedisError>
fn pfmerge<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S ) -> Result<RV, RedisError>
Merge N different HyperLogLogs into a single one.
source§fn publish<'a, K, E, RV>(
&mut self,
channel: K,
message: E
) -> Result<RV, RedisError>
fn publish<'a, K, E, RV>( &mut self, channel: K, message: E ) -> Result<RV, RedisError>
Posts a message to the given channel.
source§fn object_encoding<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn object_encoding<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Returns the encoding of a key.
source§fn object_idletime<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn object_idletime<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Returns the time in seconds since the last access of a key.
source§fn object_freq<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn object_freq<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Returns the logarithmic access frequency counter of a key.
source§fn object_refcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn object_refcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
Returns the reference count of a key.
source§fn xrevrange_all<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn xrevrange_all<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
source§fn 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.
source§fn 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.
source§fn 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.
source§fn hscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError>
fn hscan_match<K, P, RV>( &mut self, key: K, pattern: P ) -> Result<Iter<'_, RV>, RedisError>
Incrementally iterate hash fields and associated values for
field names matching a pattern.
source§fn 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.
source§fn sscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError>
fn sscan_match<K, P, RV>( &mut self, key: K, pattern: P ) -> Result<Iter<'_, RV>, RedisError>
Incrementally iterate set elements for elements matching a pattern.
source§fn 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.
source§fn zscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P
) -> Result<Iter<'_, RV>, RedisError>
fn zscan_match<K, P, RV>( &mut self, key: K, pattern: P ) -> Result<Iter<'_, RV>, RedisError>
Incrementally iterate sorted set elements for elements matching a pattern.
source§impl<C, T> ConnectionLike for Twhere
C: ConnectionLike,
T: DerefMut<Target = C>,
impl<C, T> ConnectionLike for Twhere
C: ConnectionLike,
T: DerefMut<Target = C>,
source§fn 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.
fn req_packed_commands( &mut self, cmd: &[u8], offset: usize, count: usize ) -> Result<Vec<Value>, RedisError>
source§fn 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.
source§fn 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.
fn supports_pipelining(&self) -> bool
source§fn check_connection(&mut self) -> bool
fn check_connection(&mut self) -> bool
Check that all connections it has are available (
PING internally).source§impl<T, A> DynAccess<T> for A
impl<T, A> DynAccess<T> for A
source§fn load(&self) -> DynGuard<T>
fn load(&self) -> DynGuard<T>
The equivalent of
Access::load.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> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more