Struct sessions_redis::Client
source · pub struct Client { /* private fields */ }Expand description
The client type.
Implementations§
source§impl 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/db
Example 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.
source§impl 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
) -> impl Future<Output = Result<Connection<Pin<Box<dyn AsyncStream + Send + Sync + 'static, Global>>>, RedisError>>
pub async fn get_async_connection( &self ) -> impl Future<Output = Result<Connection<Pin<Box<dyn AsyncStream + Send + Sync + 'static, Global>>>, RedisError>>
Returns an async connection from the client.
sourcepub async fn get_tokio_connection(
&self
) -> impl Future<Output = Result<Connection<Pin<Box<dyn AsyncStream + Send + Sync + 'static, Global>>>, RedisError>>
pub async fn get_tokio_connection( &self ) -> impl Future<Output = Result<Connection<Pin<Box<dyn AsyncStream + Send + Sync + 'static, Global>>>, RedisError>>
Returns an async connection from the client.
sourcepub async fn get_multiplexed_async_connection(
&self
) -> impl Future<Output = Result<MultiplexedConnection, RedisError>>
pub async fn get_multiplexed_async_connection( &self ) -> impl Future<Output = Result<MultiplexedConnection, RedisError>>
Returns an async connection from the client.
sourcepub async fn get_multiplexed_tokio_connection(
&self
) -> impl Future<Output = Result<MultiplexedConnection, RedisError>>
pub async fn get_multiplexed_tokio_connection( &self ) -> impl Future<Output = 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
) -> impl Future<Output = Result<(MultiplexedConnection, impl Future<Output = ()>), RedisError>>
pub async fn create_multiplexed_tokio_connection( &self ) -> impl Future<Output = 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
) -> impl Future<Output = Result<ConnectionManager, RedisError>>
pub async fn get_tokio_connection_manager( &self ) -> impl Future<Output = 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§
source§impl ConnectionLike for Client
impl ConnectionLike for Client
source§fn req_packed_command(&mut self, cmd: &[u8]) -> Result<Value, RedisError>
fn req_packed_command(&mut self, cmd: &[u8]) -> Result<Value, RedisError>
source§fn 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>
count responses from it. This is used to implement
pipelining.source§fn get_db(&self) -> i64
fn get_db(&self) -> i64
source§fn check_connection(&mut self) -> bool
fn check_connection(&mut self) -> bool
PING internally).source§fn req_command(&mut self, cmd: &Cmd) -> Result<Value, RedisError>
fn req_command(&mut self, cmd: &Cmd) -> Result<Value, RedisError>
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§
source§impl<T> Commands for Twhere
T: ConnectionLike,
impl<T> Commands for Twhere T: ConnectionLike,
source§fn get<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn get<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
MGET.source§fn mget<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn mget<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn keys<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn keys<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn set<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn set<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn set_multiple<K, V, RV, 'a>(
&mut self,
items: &'a [(K, V)]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn set_multiple<K, V, RV, 'a>( &mut self, items: &'a [(K, V)] ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn set_ex<K, V, RV, 'a>(
&mut self,
key: K,
value: V,
seconds: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn set_ex<K, V, RV, 'a>( &mut self, key: K, value: V, seconds: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn pset_ex<K, V, RV, 'a>(
&mut self,
key: K,
value: V,
milliseconds: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn pset_ex<K, V, RV, 'a>( &mut self, key: K, value: V, milliseconds: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn set_nx<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn set_nx<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn mset_nx<K, V, RV, 'a>(
&mut self,
items: &'a [(K, V)]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn mset_nx<K, V, RV, 'a>( &mut self, items: &'a [(K, V)] ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn getset<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn getset<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn getrange<K, RV, 'a>(
&mut self,
key: K,
from: isize,
to: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn getrange<K, RV, 'a>( &mut self, key: K, from: isize, to: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn setrange<K, V, RV, 'a>(
&mut self,
key: K,
offset: isize,
value: V
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn setrange<K, V, RV, 'a>( &mut self, key: K, offset: isize, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn del<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn del<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn exists<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn exists<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn expire<K, RV, 'a>(&mut self, key: K, seconds: usize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn expire<K, RV, 'a>(&mut self, key: K, seconds: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn expire_at<K, RV, 'a>(&mut self, key: K, ts: usize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn expire_at<K, RV, 'a>(&mut self, key: K, ts: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn pexpire<K, RV, 'a>(&mut self, key: K, ms: usize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn pexpire<K, RV, 'a>(&mut self, key: K, ms: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn pexpire_at<K, RV, 'a>(&mut self, key: K, ts: usize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn pexpire_at<K, RV, 'a>(&mut self, key: K, ts: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn persist<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn persist<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn ttl<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn ttl<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn pttl<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn pttl<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn get_ex<K, RV, 'a>(
&mut self,
key: K,
expire_at: Expiry
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn get_ex<K, RV, 'a>( &mut self, key: K, expire_at: Expiry ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn get_del<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn get_del<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn rename<K, RV, 'a>(&mut self, key: K, new_key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn rename<K, RV, 'a>(&mut self, key: K, new_key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn rename_nx<K, RV, 'a>(&mut self, key: K, new_key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn rename_nx<K, RV, 'a>(&mut self, key: K, new_key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn unlink<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn unlink<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn append<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn append<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn incr<K, V, RV, 'a>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn incr<K, V, RV, 'a>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
INCRBY or INCRBYFLOAT depending on the type.source§fn decr<K, V, RV, 'a>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn decr<K, V, RV, 'a>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn setbit<K, RV, 'a>(
&mut self,
key: K,
offset: usize,
value: bool
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn setbit<K, RV, 'a>( &mut self, key: K, offset: usize, value: bool ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn getbit<K, RV, 'a>(&mut self, key: K, offset: usize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn getbit<K, RV, 'a>(&mut self, key: K, offset: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn bitcount<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bitcount<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn bitcount_range<K, RV, 'a>(
&mut self,
key: K,
start: usize,
end: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bitcount_range<K, RV, 'a>( &mut self, key: K, start: usize, end: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn bit_and<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bit_and<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn bit_or<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bit_or<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn bit_xor<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bit_xor<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn bit_not<K, RV, 'a>(&mut self, dstkey: K, srckey: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bit_not<K, RV, 'a>(&mut self, dstkey: K, srckey: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn strlen<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn strlen<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn hget<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
fn hget<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,
source§fn hdel<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
fn hdel<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,
source§fn hset<K, F, V, RV, 'a>(
&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, 'a>( &mut self, key: K, field: F, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn hset_nx<K, F, V, RV, 'a>(
&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, 'a>( &mut self, key: K, field: F, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn hset_multiple<K, F, V, RV, 'a>(
&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, 'a>( &mut self, key: K, items: &'a [(F, V)] ) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn hincr<K, F, D, RV, 'a>(
&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, 'a>( &mut self, key: K, field: F, delta: D ) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, D: ToRedisArgs, RV: FromRedisValue,
source§fn hexists<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToRedisArgs,
F: ToRedisArgs,
RV: FromRedisValue,
fn hexists<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,
source§fn hkeys<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hkeys<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn hvals<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hvals<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn hgetall<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hgetall<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn hlen<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn hlen<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn blmove<K, RV, 'a>(
&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, 'a>( &mut self, srckey: K, dstkey: K, src_dir: Direction, dst_dir: Direction, timeout: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn blmpop<K, RV, 'a>(
&mut self,
timeout: usize,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn blmpop<K, RV, 'a>( &mut self, timeout: usize, numkeys: usize, key: K, dir: Direction, count: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
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<K, RV, 'a>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn blpop<K, RV, 'a>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn brpop<K, RV, 'a>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn brpop<K, RV, 'a>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn brpoplpush<K, RV, 'a>(
&mut self,
srckey: K,
dstkey: K,
timeout: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn brpoplpush<K, RV, 'a>( &mut self, srckey: K, dstkey: K, timeout: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn lindex<K, RV, 'a>(&mut self, key: K, index: isize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lindex<K, RV, 'a>(&mut self, key: K, index: isize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn linsert_before<K, P, V, RV, 'a>(
&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, 'a>( &mut self, key: K, pivot: P, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn linsert_after<K, P, V, RV, 'a>(
&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, 'a>( &mut self, key: K, pivot: P, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn llen<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn llen<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn lmove<K, RV, 'a>(
&mut self,
srckey: K,
dstkey: K,
src_dir: Direction,
dst_dir: Direction
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lmove<K, RV, 'a>( &mut self, srckey: K, dstkey: K, src_dir: Direction, dst_dir: Direction ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn lmpop<K, RV, 'a>(
&mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lmpop<K, RV, 'a>( &mut self, numkeys: usize, key: K, dir: Direction, count: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
count elements from the first non-empty list key from the list of
provided key names.source§fn lpop<K, RV, 'a>(
&mut self,
key: K,
count: Option<NonZeroUsize>
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lpop<K, RV, 'a>( &mut self, key: K, count: Option<NonZeroUsize> ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
count first elements of the list stored at key. Read moresource§fn lpos<K, V, RV, 'a>(
&mut self,
key: K,
value: V,
options: LposOptions
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lpos<K, V, RV, 'a>( &mut self, key: K, value: V, options: LposOptions ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn lpush<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lpush<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn lpush_exists<K, V, RV, 'a>(
&mut self,
key: K,
value: V
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lpush_exists<K, V, RV, 'a>( &mut self, key: K, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn lrange<K, RV, 'a>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lrange<K, RV, 'a>( &mut self, key: K, start: isize, stop: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn lrem<K, V, RV, 'a>(
&mut self,
key: K,
count: isize,
value: V
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lrem<K, V, RV, 'a>( &mut self, key: K, count: isize, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn ltrim<K, RV, 'a>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn ltrim<K, RV, 'a>( &mut self, key: K, start: isize, stop: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn lset<K, V, RV, 'a>(
&mut self,
key: K,
index: isize,
value: V
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn lset<K, V, RV, 'a>( &mut self, key: K, index: isize, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn rpop<K, RV, 'a>(
&mut self,
key: K,
count: Option<NonZeroUsize>
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn rpop<K, RV, 'a>( &mut self, key: K, count: Option<NonZeroUsize> ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
count last elements of the list stored at key Read moresource§fn rpoplpush<K, RV, 'a>(&mut self, key: K, dstkey: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn rpoplpush<K, RV, 'a>(&mut self, key: K, dstkey: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn rpush<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn rpush<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn rpush_exists<K, V, RV, 'a>(
&mut self,
key: K,
value: V
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn rpush_exists<K, V, RV, 'a>( &mut self, key: K, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,
source§fn sadd<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn sadd<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn scard<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn scard<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn sdiff<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sdiff<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn sdiffstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sdiffstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn sinter<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sinter<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn sinterstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sinterstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn sismember<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn sismember<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn smembers<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn smembers<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn smove<K, M, RV, 'a>(
&mut self,
srckey: K,
dstkey: K,
member: M
) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn smove<K, M, RV, 'a>( &mut self, srckey: K, dstkey: K, member: M ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn spop<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn spop<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn srandmember<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn srandmember<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn srandmember_multiple<K, RV, 'a>(
&mut self,
key: K,
count: usize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn srandmember_multiple<K, RV, 'a>( &mut self, key: K, count: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn srem<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn srem<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn sunion<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sunion<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn sunionstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sunionstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zadd<K, S, M, RV, 'a>(
&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, 'a>( &mut self, key: K, member: M, score: S ) -> Result<RV, RedisError>where K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zadd_multiple<K, S, M, RV, 'a>(
&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, 'a>( &mut self, key: K, items: &'a [(S, M)] ) -> Result<RV, RedisError>where K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zcard<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zcard<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zcount<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zincr<K, M, D, RV, 'a>(
&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, 'a>( &mut self, key: K, member: M, delta: D ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, D: ToRedisArgs, RV: FromRedisValue,
source§fn zinterstore<K, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zinterstore_min<K, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_min<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zinterstore_max<K, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_max<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zinterstore_weights<K, W, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_weights<K, W, RV, 'a>( &mut self, dstkey: K, keys: &'a [(K, W)] ) -> Result<RV, RedisError>where K: ToRedisArgs, W: ToRedisArgs, RV: FromRedisValue,
Commands::zinterstore, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zinterstore_min_weights<K, W, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_min_weights<K, W, RV, 'a>( &mut self, dstkey: K, keys: &'a [(K, W)] ) -> Result<RV, RedisError>where K: ToRedisArgs, W: ToRedisArgs, RV: FromRedisValue,
Commands::zinterstore_min, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zinterstore_max_weights<K, W, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_max_weights<K, W, RV, 'a>( &mut self, dstkey: K, keys: &'a [(K, W)] ) -> Result<RV, RedisError>where K: ToRedisArgs, W: ToRedisArgs, RV: FromRedisValue,
Commands::zinterstore_max, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zlexcount<K, L, RV, 'a>(
&mut self,
key: K,
min: L,
max: L
) -> Result<RV, RedisError>where
K: ToRedisArgs,
L: ToRedisArgs,
RV: FromRedisValue,
fn zlexcount<K, L, RV, 'a>( &mut self, key: K, min: L, max: L ) -> Result<RV, RedisError>where K: ToRedisArgs, L: ToRedisArgs, RV: FromRedisValue,
source§fn zpopmax<K, RV, 'a>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zpopmax<K, RV, 'a>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zpopmin<K, RV, 'a>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zpopmin<K, RV, 'a>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zmpop_max<K, RV, 'a>(
&mut self,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zmpop_max<K, RV, 'a>( &mut self, keys: &'a [K], count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zmpop_min<K, RV, 'a>(
&mut self,
keys: &'a [K],
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zmpop_min<K, RV, 'a>( &mut self, keys: &'a [K], count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zrandmember<K, RV, 'a>(
&mut self,
key: K,
count: Option<isize>
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrandmember<K, RV, 'a>( &mut self, key: K, count: Option<isize> ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
count == None)source§fn zrandmember_withscores<K, RV, 'a>(
&mut self,
key: K,
count: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrandmember_withscores<K, RV, 'a>( &mut self, key: K, count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zrange<K, RV, 'a>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrange<K, RV, 'a>( &mut self, key: K, start: isize, stop: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zrange_withscores<K, RV, 'a>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrange_withscores<K, RV, 'a>( &mut self, key: K, start: isize, stop: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zrangebylex<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zrangebylex_limit<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM, offset: isize, count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrangebylex<K, MM, M, RV, 'a>(
&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, 'a>( &mut self, key: K, max: MM, min: M ) -> Result<RV, RedisError>where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrangebylex_limit<K, MM, M, RV, 'a>(
&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, 'a>( &mut self, key: K, max: MM, min: M, offset: isize, count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zrangebyscore<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zrangebyscore_withscores<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zrangebyscore_limit<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM, offset: isize, count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zrangebyscore_limit_withscores<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM, offset: isize, count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zrank<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrank<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zrem<K, M, RV, 'a>(&mut self, key: K, members: M) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrem<K, M, RV, 'a>(&mut self, key: K, members: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zrembylex<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zremrangebyrank<K, RV, 'a>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zremrangebyrank<K, RV, 'a>( &mut self, key: K, start: isize, stop: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zrembyscore<K, M, MM, RV, 'a>(
&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, 'a>( &mut self, key: K, min: M, max: MM ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrange<K, RV, 'a>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrevrange<K, RV, 'a>( &mut self, key: K, start: isize, stop: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrange_withscores<K, RV, 'a>(
&mut self,
key: K,
start: isize,
stop: isize
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zrevrange_withscores<K, RV, 'a>( &mut self, key: K, start: isize, stop: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrangebyscore<K, MM, M, RV, 'a>(
&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, 'a>( &mut self, key: K, max: MM, min: M ) -> Result<RV, RedisError>where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrangebyscore_withscores<K, MM, M, RV, 'a>(
&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, 'a>( &mut self, key: K, max: MM, min: M ) -> Result<RV, RedisError>where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrangebyscore_limit<K, MM, M, RV, 'a>(
&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, 'a>( &mut self, key: K, max: MM, min: M, offset: isize, count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrangebyscore_limit_withscores<K, MM, M, RV, 'a>(
&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, 'a>( &mut self, key: K, max: MM, min: M, offset: isize, count: isize ) -> Result<RV, RedisError>where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zrevrank<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrevrank<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zscore<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zscore<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zscore_multiple<K, M, RV, 'a>(
&mut self,
key: K,
members: &'a [M]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zscore_multiple<K, M, RV, 'a>( &mut self, key: K, members: &'a [M] ) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,
source§fn zunionstore<K, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zunionstore_min<K, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_min<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zunionstore_max<K, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [K]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_max<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,
source§fn zunionstore_weights<K, W, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_weights<K, W, RV, 'a>( &mut self, dstkey: K, keys: &'a [(K, W)] ) -> Result<RV, RedisError>where K: ToRedisArgs, W: ToRedisArgs, RV: FromRedisValue,
Commands::zunionstore, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zunionstore_min_weights<K, W, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_min_weights<K, W, RV, 'a>( &mut self, dstkey: K, keys: &'a [(K, W)] ) -> Result<RV, RedisError>where K: ToRedisArgs, W: ToRedisArgs, RV: FromRedisValue,
Commands::zunionstore_min, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.source§fn zunionstore_max_weights<K, W, RV, 'a>(
&mut self,
dstkey: K,
keys: &'a [(K, W)]
) -> Result<RV, RedisError>where
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_max_weights<K, W, RV, 'a>( &mut self, dstkey: K, keys: &'a [(K, W)] ) -> Result<RV, RedisError>where K: ToRedisArgs, W: ToRedisArgs, RV: FromRedisValue,
Commands::zunionstore_max, but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.