Struct sessions_redis::Client

source ·
pub struct Client { /* private fields */ }
Expand description

The client type.

Implementations§

source§

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();
source

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.

source

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.

source

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.

source

pub fn get_connection_info(&self) -> &ConnectionInfo

Returns a reference of client connection info object.

source§

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

source

pub async fn get_async_connection( &self ) -> impl Future<Output = Result<Connection<Pin<Box<dyn AsyncStream + Sync + Send + 'static, Global>>>, RedisError>>

Returns an async connection from the client.

source

pub async fn get_tokio_connection( &self ) -> impl Future<Output = Result<Connection<Pin<Box<dyn AsyncStream + Sync + Send + 'static, Global>>>, RedisError>>

Returns an async connection from the client.

source

pub async fn get_multiplexed_async_connection( &self ) -> impl Future<Output = Result<MultiplexedConnection, RedisError>>

Returns an async connection from the client.

source

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).

source

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).

source

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 Clone for Client

source§

fn clone(&self) -> Client

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl ConnectionLike for Client

source§

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.
source§

fn req_packed_commands( &mut self, cmd: &[u8], offset: usize, count: usize ) -> Result<Vec<Value, Global>, RedisError>

Sends multiple already encoded (packed) command into the TCP socket and reads count responses from it. This is used to implement pipelining.
source§

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.
source§

fn check_connection(&mut self) -> bool

Check that all connections it has are available (PING internally).
source§

fn is_open(&self) -> bool

Returns the connection status. Read more
source§

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§

impl Debug for Client

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

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,

Get the value of a key. If key is a vec this becomes an MGET.
source§

fn mget<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Get values of keys
source§

fn keys<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Gets all keys matching pattern
source§

fn set<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Set the string value of a key.
source§

fn set_multiple<K, V, RV, 'a>( &mut self, items: &'a [(K, V)] ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Sets multiple keys to their values.
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,

Set the value and expiration of a key.
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,

Set the value and expiration in milliseconds of a key.
source§

fn set_nx<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Set the value of a key, only if the key does not exist
source§

fn mset_nx<K, V, RV, 'a>( &mut self, items: &'a [(K, V)] ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Sets multiple keys to their values failing if at least one already exists.
source§

fn getset<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Set the string value of a key and return its old value.
source§

fn getrange<K, RV, 'a>( &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<K, V, RV, 'a>( &mut self, key: K, offset: isize, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Overwrite the part of the value stored in key at the specified offset.
source§

fn del<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Delete one or more keys.
source§

fn exists<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Determine if a key exists.
source§

fn expire<K, RV, 'a>(&mut self, key: K, seconds: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Set a key’s time to live in seconds.
source§

fn expire_at<K, RV, 'a>(&mut self, key: K, ts: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Set the expiration for a key as a UNIX timestamp.
source§

fn pexpire<K, RV, 'a>(&mut self, key: K, ms: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Set a key’s time to live in milliseconds.
source§

fn pexpire_at<K, RV, 'a>(&mut self, key: K, ts: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Set the expiration for a key as a UNIX timestamp in milliseconds.
source§

fn persist<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Remove the expiration from a key.
source§

fn ttl<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Get the expiration time of a key.
source§

fn pttl<K, RV, 'a>(&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<K, RV, 'a>( &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<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Get the value of a key and delete it
source§

fn rename<K, RV, 'a>(&mut self, key: K, new_key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Rename a key.
source§

fn rename_nx<K, RV, 'a>(&mut self, key: K, new_key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Rename a key, only if the new key does not exist.
Unlink one or more keys.
source§

fn append<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Append a value to a key.
source§

fn incr<K, V, RV, 'a>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type.
source§

fn decr<K, V, RV, 'a>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Decrement the numeric value of a key by the given amount.
source§

fn setbit<K, RV, 'a>( &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<K, RV, 'a>(&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<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Count set bits in a string.
source§

fn bitcount_range<K, RV, 'a>( &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<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key.
source§

fn bit_or<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key.
source§

fn bit_xor<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key.
source§

fn bit_not<K, RV, 'a>(&mut self, dstkey: K, srckey: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key.
source§

fn strlen<K, RV, 'a>(&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<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,

Gets a single (or multiple) fields from a hash.
source§

fn hdel<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,

Deletes a single (or multiple) fields from a hash.
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,

Sets a single field in a hash.
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,

Sets a single field in a hash if it does not exist.
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,

Sets a multiple fields in a hash.
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,

Increments a value.
source§

fn hexists<K, F, RV, 'a>(&mut self, key: K, field: F) -> Result<RV, RedisError>where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,

Checks if a field in a hash exists.
source§

fn hkeys<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Gets all the keys in a hash.
source§

fn hvals<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Gets all the values in a hash.
source§

fn hgetall<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Gets all the fields and values in a hash.
source§

fn hlen<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Gets the length of a hash.
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,

Pop an element from a list, push it to another list and return it; or block until one is available
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,

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<K, RV, 'a>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Remove and get the first element in a list, or block until one is available.
source§

fn brpop<K, RV, 'a>(&mut self, key: K, timeout: usize) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Remove and get the last element in a list, or block until one is available.
source§

fn brpoplpush<K, RV, 'a>( &mut self, srckey: K, dstkey: K, timeout: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Pop a value from a list, push it to another list and return it; or block until one is available.
source§

fn lindex<K, RV, 'a>(&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<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,

Insert an element before another element in a list.
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,

Insert an element after another element in a list.
source§

fn llen<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Returns the length of the list stored at key.
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,

Pop an element a list, push it to another list and return it
source§

fn lmpop<K, RV, 'a>( &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<K, RV, 'a>( &mut self, key: K, count: Option<NonZeroUsize> ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Removes and returns the up to count first elements of the list stored at key. Read more
source§

fn lpos<K, V, RV, 'a>( &mut self, key: K, value: V, options: LposOptions ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Returns the index of the first matching value of the list stored at key.
source§

fn lpush<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Insert all the specified values at the head of the list stored at key.
source§

fn lpush_exists<K, V, RV, 'a>( &mut self, key: K, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Inserts a value at the head of the list stored at key, only if key already exists and holds a list.
source§

fn lrange<K, RV, 'a>( &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<K, V, RV, 'a>( &mut self, key: K, count: isize, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Removes the first count occurrences of elements equal to value from the list stored at key.
source§

fn ltrim<K, RV, 'a>( &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<K, V, RV, 'a>( &mut self, key: K, index: isize, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Sets the list element at index to value
source§

fn rpop<K, RV, 'a>( &mut self, key: K, count: Option<NonZeroUsize> ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Removes and returns the up to count last elements of the list stored at key Read more
source§

fn rpoplpush<K, RV, 'a>(&mut self, key: K, dstkey: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Pop a value from a list, push it to another list and return it.
source§

fn rpush<K, V, RV, 'a>(&mut self, key: K, value: V) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Insert all the specified values at the tail of the list stored at key.
source§

fn rpush_exists<K, V, RV, 'a>( &mut self, key: K, value: V ) -> Result<RV, RedisError>where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Inserts value at the tail of the list stored at key, only if key already exists and holds a list.
source§

fn sadd<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Add one or more members to a set.
source§

fn scard<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Get the number of members in a set.
source§

fn sdiff<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Subtract multiple sets.
source§

fn sdiffstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Subtract multiple sets and store the resulting set in a key.
source§

fn sinter<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sets.
source§

fn sinterstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sets and store the resulting set in a key.
source§

fn sismember<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Determine if a given value is a member of a set.
source§

fn smembers<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Get all the members in a set.
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,

Move a member from one set to another.
source§

fn spop<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Remove and return a random member from a set.
source§

fn srandmember<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Get one random member from a set.
source§

fn srandmember_multiple<K, RV, 'a>( &mut self, key: K, count: usize ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Get multiple random members from a set.
source§

fn srem<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Remove one or more members from a set.
source§

fn sunion<K, RV, 'a>(&mut self, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Add multiple sets.
source§

fn sunionstore<K, RV, 'a>(&mut self, dstkey: K, keys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Add multiple sets and store the resulting set in a key.
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,

Add one member to a sorted set, or update its score if it already exists.
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,

Add multiple members to a sorted set, or update its score if it already exists.
source§

fn zcard<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Get the number of members in a sorted set.
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,

Count the members in a sorted set with scores within the given values.
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,

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<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function.
source§

fn zinterstore_min<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function.
source§

fn zinterstore_max<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function.
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,

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,

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,

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,

Count the number of members in a sorted set between a given lexicographical range.
source§

fn zpopmax<K, RV, 'a>(&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 zpopmin<K, RV, 'a>(&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 zmpop_max<K, RV, 'a>( &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 zmpop_min<K, RV, 'a>( &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<K, RV, 'a>( &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<K, RV, 'a>( &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<K, RV, 'a>( &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<K, RV, 'a>( &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<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,

Return a range of members in a sorted set, by lexicographical range.
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,

Return a range of members in a sorted set, by lexicographical range with offset and limit.
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,

Return a range of members in a sorted set, by lexicographical range.
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,

Return a range of members in a sorted set, by lexicographical range with offset and limit.
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,

Return a range of members in a sorted set, by score.
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,

Return a range of members in a sorted set, by score with scores.
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,

Return a range of members in a sorted set, by score with limit.
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,

Return a range of members in a sorted set, by score with limit with scores.
source§

fn zrank<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Determine the index of a member in a sorted set.
source§

fn zrem<K, M, RV, 'a>(&mut self, key: K, members: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Remove one or more members from a sorted set.
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,

Remove all members in a sorted set between the given lexicographical range.
source§

fn zremrangebyrank<K, RV, 'a>( &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<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,

Remove all members in a sorted set within the given scores.
source§

fn zrevrange<K, RV, 'a>( &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<K, RV, 'a>( &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<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,

Return a range of members in a sorted set, by score.
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,

Return a range of members in a sorted set, by score with scores.
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,

Return a range of members in a sorted set, by score with limit.
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,

Return a range of members in a sorted set, by score with limit with scores.
source§

fn zrevrank<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Determine the index of a member in a sorted set, with scores ordered from high to low.
source§

fn zscore<K, M, RV, 'a>(&mut self, key: K, member: M) -> Result<RV, RedisError>where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Get the score associated with the given member in a sorted set.
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,

Get the scores associated with multiple members in a sorted set.
source§

fn zunionstore<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Unions multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function.
source§

fn zunionstore_min<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Unions multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function.
source§

fn zunionstore_max<K, RV, 'a>( &mut self, dstkey: K, keys: &'a [K] ) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function.
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,

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,

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,

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<K, E, RV, 'a>(&mut self, key: K, element: E) -> Result<RV, RedisError>where K: ToRedisArgs, E: ToRedisArgs, RV: FromRedisValue,

Adds the specified elements to the specified HyperLogLog.
source§

fn pfcount<K, RV, 'a>(&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<K, RV, 'a>(&mut self, dstkey: K, srckeys: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Merge N different HyperLogLogs into a single one.
source§

fn publish<K, E, RV, 'a>( &mut self, channel: K, message: E ) -> Result<RV, RedisError>where K: ToRedisArgs, E: ToRedisArgs, RV: FromRedisValue,

Posts a message to the given channel.
source§

fn object_encoding<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Returns the encoding of a key.
source§

fn object_idletime<K, RV, 'a>(&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<K, RV, 'a>(&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<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

Returns the reference count of a key.
source§

fn xrevrange_all<K, RV, 'a>(&mut self, key: K) -> Result<RV, RedisError>where K: ToRedisArgs, RV: FromRedisValue,

This is the reverse version of xrange_all. The same rules apply for start and end here. Read more
source§

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,

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,

Incrementally iterate hash fields and associated values.
source§

fn hscan_match<K, P, RV>( &mut self, key: K, pattern: P ) -> Result<Iter<'_, RV>, RedisError>where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate hash fields and associated values for field names matching a pattern.
source§

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>where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

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,

Incrementally iterate sorted set elements.
source§

fn zscan_match<K, P, RV>( &mut self, key: K, pattern: P ) -> Result<Iter<'_, RV>, RedisError>where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate sorted set elements for elements matching a pattern.
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more