Skip to main content

Query

autumn_web::extract

Struct Query 

Source 
pub struct Query<T>(pub T);
Expand description

Deserialize URL query string parameters.

Wraps axum::extract::Query so query parse failures use Autumn’s Problem Details error contract.

Tuple Fields§

§0: T

Trait Implementations§

Source§

impl<T> AsValidatable for Query<T>

Source§

type Inner = T

The inner type to validate.
Source§

fn as_validatable(&self) -> &T

Returns a reference to the inner type to validate.
Source§

impl<T: Clone> Clone for Query<T>

Source§

fn clone(&self) -> Query<T>

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<T: Copy> Copy for Query<T>

Source§

impl<T: Debug> Debug for Query<T>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<T: Default> Default for Query<T>

Source§

fn default() -> Query<T>

Returns the “default value” for a type. Read more
Source§

impl<T> Deref for Query<T>

Source§

type Target = T

The resulting type after dereferencing.
Source§

fn deref(&self) -> &Self::Target

Dereferences the value.
Source§

impl<T> DerefMut for Query<T>

Source§

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.
Source§

impl<S, T> FromRequestParts<S> for Query<T>
where S: Send + Sync, Query<T>: FromRequestParts<S, Rejection = QueryRejection>,

Source§

type Rejection = AutumnError

If the extractor fails it’ll use this “rejection” type. A rejection is a kind of error that can be converted into a response.
Source§

async fn from_request_parts( parts: &mut Parts, state: &S, ) -> Result<Self, Self::Rejection>

Perform the extraction.

Auto Trait Implementations§

§

impl<T> Freeze for Query<T>
where T: Freeze,

§

impl<T> RefUnwindSafe for Query<T>
where T: RefUnwindSafe,

§

impl<T> Send for Query<T>
where T: Send,

§

impl<T> Sync for Query<T>
where T: Sync,

§

impl<T> Unpin for Query<T>
where T: Unpin,

§

impl<T> UnsafeUnpin for Query<T>
where T: UnsafeUnpin,

§

impl<T> UnwindSafe for Query<T>
where T: UnwindSafe,

Blanket Implementations§

Source§

impl<T, A, P> Access<T> for P
where A: Access<T> + ?Sized, P: Deref<Target = A>,

Source§

type Guard = <A as Access<T>>::Guard

A guard object containing the value and keeping it alive. Read more
Source§

fn load(&self) -> <P as Access<T>>::Guard

The loading method. Read more
Source§

impl<T> AggregateExpressionMethods for T

Source§

fn aggregate_distinct(self) -> Self::Output
where Self: DistinctDsl,

DISTINCT modifier for aggregate functions Read more
Source§

fn aggregate_all(self) -> Self::Output
where Self: AllDsl,

ALL modifier for aggregate functions Read more
Source§

fn aggregate_filter<P>(self, f: P) -> Self::Output
where P: AsExpression<Bool>, Self: FilterDsl<<P as AsExpression<Bool>>::Expression>,

Add an aggregate function filter Read more
Source§

fn aggregate_order<O>(self, o: O) -> Self::Output
where Self: OrderAggregateDsl<O>,

Add an aggregate function order Read more
Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<C> AsyncConnection for C
where C: DerefMut + Send, <C as Deref>::Target: AsyncConnection,

Source§

type TransactionManager = PoolTransactionManager<<<C as Deref>::Target as AsyncConnection>::TransactionManager>

Source§

async fn establish(_database_url: &str) -> Result<C, ConnectionError>

Establishes a new connection to the database Read more
Source§

fn transaction_state( &mut self, ) -> &mut <<C as AsyncConnection>::TransactionManager as TransactionManager<C>>::TransactionStateData

Source§

async fn begin_test_transaction(&mut self) -> Result<(), Error>

Creates a transaction that will never be committed. This is useful for tests. Panics if called while inside of a transaction or if called with a connection containing a broken transaction
Source§

fn instrumentation(&mut self) -> &mut (dyn Instrumentation + 'static)

Source§

fn set_instrumentation(&mut self, instrumentation: impl Instrumentation)

Set a specific Instrumentation implementation for this connection
Source§

fn set_prepared_statement_cache_size(&mut self, size: CacheSize)

Set the prepared statement cache size to CacheSize for this connection
Source§

fn transaction<'a, 'conn, R, E, F>( &'conn mut self, callback: F, ) -> Pin<Box<dyn Future<Output = Result<R, E>> + Send + 'conn>>
where 'a: 'conn, F: for<'r> FnOnce(&'r mut Self) -> Pin<Box<dyn ScopedFuture<'a, 'r, PhantomData<&'r &'a ()>, Output = Result<R, E>> + Send + 'r>> + Send + 'a, E: From<Error> + Send + 'a, R: Send + 'a,

Executes the given function inside of a database transaction Read more
Source§

fn test_transaction<'conn, 'a, R, E, F>( &'conn mut self, f: F, ) -> impl Future<Output = R> + Send + 'conn
where 'a: 'conn, F: for<'r> FnOnce(&'r mut Self) -> Pin<Box<dyn ScopedFuture<'a, 'r, PhantomData<&'r &'a ()>, Output = Result<R, E>> + Send + 'r>> + Send + 'a, E: Debug + Send + 'a, R: Send + 'a,

Executes the given function inside a transaction, but does not commit it. Panics if the given function returns an error. Read more
Source§

impl<C> AsyncConnectionCore for C
where C: DerefMut + Send, <C as Deref>::Target: AsyncConnectionCore,

Source§

type ExecuteFuture<'conn, 'query> = <<C as Deref>::Target as AsyncConnectionCore>::ExecuteFuture<'conn, 'query>

The future returned by AsyncConnection::execute
Source§

type LoadFuture<'conn, 'query> = <<C as Deref>::Target as AsyncConnectionCore>::LoadFuture<'conn, 'query>

The future returned by AsyncConnection::load
Source§

type Stream<'conn, 'query> = <<C as Deref>::Target as AsyncConnectionCore>::Stream<'conn, 'query>

The inner stream returned by AsyncConnection::load
Source§

type Row<'conn, 'query> = <<C as Deref>::Target as AsyncConnectionCore>::Row<'conn, 'query>

The row type used by the stream returned by AsyncConnection::load
Source§

type Backend = <<C as Deref>::Target as AsyncConnectionCore>::Backend

The backend this type connects to
Source§

fn load<'conn, 'query, T>( &'conn mut self, source: T, ) -> <C as AsyncConnectionCore>::LoadFuture<'conn, 'query>
where T: AsQuery + 'query, <T as AsQuery>::Query: QueryFragment<<C as AsyncConnectionCore>::Backend> + QueryId + 'query,

Source§

fn execute_returning_count<'conn, 'query, T>( &'conn mut self, source: T, ) -> <C as AsyncConnectionCore>::ExecuteFuture<'conn, 'query>
where T: QueryFragment<<C as AsyncConnectionCore>::Backend> + QueryId + 'query,

Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> Commands for T
where T: ConnectionLike,

Source§

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

Get the value of a key. If key is a vec this becomes an MGET (if using TypedCommands, you should specifically use mget to get the correct return type. Redis Docs
Source§

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

Get values of keys Redis Docs
Source§

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

Gets all keys matching pattern Redis Docs
Source§

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

Set the string value of a key. Redis Docs
Source§

fn set_options<'a, K, V, RV>( &mut self, key: K, value: V, options: SetOptions, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Set the string value of a key with options. Redis Docs
Source§

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

Sets multiple keys to their values. Redis Docs
Source§

fn set_ex<'a, K, V, RV>( &mut self, key: K, value: V, seconds: u64, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Set the value and expiration of a key. Redis Docs
Source§

fn pset_ex<'a, K, V, RV>( &mut self, key: K, value: V, milliseconds: u64, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Set the value and expiration in milliseconds of a key. Redis Docs
Source§

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

Set the value of a key, only if the key does not exist Redis Docs
Source§

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

Sets multiple keys to their values failing if at least one already exists. Redis Docs
Source§

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

Sets the given keys to their respective values. This command is an extension of the MSETNX that adds expiration and XX options. Redis Docs
Source§

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

Set the string value of a key and return its old value. Redis Docs
Source§

fn getrange<'a, K, RV>( &mut self, key: K, from: isize, to: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, 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. Redis returns an empty string if the key doesn’t exist, not Nil Redis Docs
Source§

fn setrange<'a, K, V, RV>( &mut self, key: K, offset: isize, value: V, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Overwrite the part of the value stored in key at the specified offset. Redis Docs
Source§

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

Delete one or more keys. Returns the number of keys deleted. Redis Docs
Source§

fn del_ex<'a, K, RV>( &mut self, key: K, value_comparison: ValueComparison, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Conditionally removes the specified key. A key is ignored if it does not exist. IFEQ match-value - Delete the key only if its value is equal to match-value IFNE match-value - Delete the key only if its value is not equal to match-value IFDEQ match-digest - Delete the key only if the digest of its value is equal to match-digest IFDNE match-digest - Delete the key only if the digest of its value is not equal to match-digest Redis Docs
Source§

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

Get the hex signature of the value stored in the specified key. For the digest, Redis will use XXH3 Redis Docs
Source§

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

Determine if a key exists. Redis Docs
Source§

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

Determine the type of key. Redis Docs
Source§

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

Set a key’s time to live in seconds. Returns whether expiration was set. Redis Docs
Source§

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

Set the expiration for a key as a UNIX timestamp. Returns whether expiration was set. Redis Docs
Source§

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

Set a key’s time to live in milliseconds. Returns whether expiration was set. Redis Docs
Source§

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

Set the expiration for a key as a UNIX timestamp in milliseconds. Returns whether expiration was set. Redis Docs
Source§

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

Get the absolute Unix expiration timestamp in seconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
Source§

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

Get the absolute Unix expiration timestamp in milliseconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
Source§

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

Remove the expiration from a key. Returns whether a timeout was removed. Redis Docs
Source§

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

Get the time to live for a key in seconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
Source§

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

Get the time to live for a key in milliseconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
Source§

fn get_ex<'a, K, RV>( &mut self, key: K, expire_at: Expiry, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Get the value of a key and set expiration Redis Docs
Source§

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

Get the value of a key and delete it Redis Docs
Source§

fn copy<'a, KSrc, KDst, Db, RV>( &mut self, source: KSrc, destination: KDst, options: CopyOptions<Db>, ) -> Result<RV, RedisError>
where KSrc: ToSingleRedisArg, KDst: ToSingleRedisArg, Db: ToString, RV: FromRedisValue,

Copy the value from one key to another, returning whether the copy was successful. Redis Docs
Source§

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

Rename a key. Errors if key does not exist. Redis Docs
Source§

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

Rename a key, only if the new key does not exist. Errors if key does not exist. Returns whether the key was renamed, or false if the new key already exists. Redis Docs
Unlink one or more keys. This is a non-blocking version of DEL. Returns number of keys unlinked. Redis Docs
Source§

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

Append a value to a key. Returns length of string after operation. Redis Docs
Source§

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

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type. If the key does not exist, it is set to 0 before performing the operation.
Source§

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

Decrement the numeric value of a key by the given amount. If the key does not exist, it is set to 0 before performing the operation. Redis Docs
Source§

fn setbit<'a, K, RV>( &mut self, key: K, offset: usize, value: bool, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Sets or clears the bit at offset in the string value stored at key. Returns the original bit value stored at offset. Redis Docs
Source§

fn getbit<'a, K, RV>(&mut self, key: K, offset: usize) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Returns the bit value at offset in the string value stored at key. Redis Docs
Source§

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

Count set bits in a string. Returns 0 if key does not exist. Redis Docs
Source§

fn bitcount_range<'a, K, RV>( &mut self, key: K, start: usize, end: usize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Count set bits in a string in a range. Returns 0 if key does not exist. Redis Docs
Source§

fn bit_and<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S, ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, S: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
Source§

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

Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
Source§

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

Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
Source§

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

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
Source§

fn bit_diff<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S, ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, S: ToRedisArgs, RV: FromRedisValue,

DIFF(X, Y1, Y2, …)
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
Source§

fn bit_diff1<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S, ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, S: ToRedisArgs, RV: FromRedisValue,

DIFF1(X, Y1, Y2, …) (Relative complement difference)
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
Source§

fn bit_and_or<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S, ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, S: ToRedisArgs, RV: FromRedisValue,

ANDOR(X, Y1, Y2, …)
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
Source§

fn bit_one<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S, ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, S: ToRedisArgs, RV: FromRedisValue,

ONE(X, Y1, Y2, …)
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
Source§

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

Get the length of the value stored in a key. 0 if key does not exist. Redis Docs
Source§

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

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

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

Gets multiple fields from a hash. Redis Docs
Source§

fn hget_ex<'a, K, F, RV>( &mut self, key: K, fields: F, expire_at: Expiry, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToRedisArgs, RV: FromRedisValue,

Get the value of one or more fields of a given hash key, and optionally set their expiration Redis Docs
Source§

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

Deletes a single (or multiple) fields from a hash. Returns number of fields deleted. Redis Docs
Source§

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

Get and delete the value of one or more fields of a given hash key Redis Docs
Source§

fn hset<'a, K, F, V, RV>( &mut self, key: K, field: F, value: V, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Sets a single field in a hash. Returns number of fields added. Redis Docs
Source§

fn hset_ex<'a, K, F, V, RV>( &mut self, key: K, hash_field_expiration_options: &'a HashFieldExpirationOptions, fields_values: &'a [(F, V)], ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Set the value of one or more fields of a given hash key, and optionally set their expiration Redis Docs
Source§

fn hset_nx<'a, K, F, V, RV>( &mut self, key: K, field: F, value: V, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Sets a single field in a hash if it does not exist. Returns whether the field was added. Redis Docs
Source§

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

Sets multiple fields in a hash. Redis Docs
Source§

fn hincr<'a, K, F, D, RV>( &mut self, key: K, field: F, delta: D, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToSingleRedisArg, D: ToSingleRedisArg, RV: FromRedisValue,

Increments a value. Returns the new value of the field after incrementation.
Source§

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

Checks if a field in a hash exists. Redis Docs
Source§

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

Get one or more fields’ TTL in seconds. Redis Docs
Source§

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

Get one or more fields’ TTL in milliseconds. Redis Docs
Source§

fn hexpire<'a, K, F, RV>( &mut self, key: K, seconds: i64, opt: ExpireOption, fields: F, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToRedisArgs, RV: FromRedisValue,

Set one or more fields’ time to live in seconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with 0 seconds. Errors if provided key exists but is not a hash. Redis Docs
Source§

fn hexpire_at<'a, K, F, RV>( &mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToRedisArgs, RV: FromRedisValue,

Set the expiration for one or more fields as a UNIX timestamp in seconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with a time in the past. Errors if provided key exists but is not a hash. Redis Docs
Source§

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

Returns the absolute Unix expiration timestamp in seconds. Redis Docs
Source§

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

Remove the expiration from a key. Returns 1 if the expiration was removed. Redis Docs
Source§

fn hpexpire<'a, K, F, RV>( &mut self, key: K, milliseconds: i64, opt: ExpireOption, fields: F, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToRedisArgs, RV: FromRedisValue,

Set one or more fields’ time to live in milliseconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with 0 seconds. Errors if provided key exists but is not a hash. Redis Docs
Source§

fn hpexpire_at<'a, K, F, RV>( &mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, F: ToRedisArgs, RV: FromRedisValue,

Set the expiration for one or more fields as a UNIX timestamp in milliseconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with a time in the past. Errors if provided key exists but is not a hash. Redis Docs
Source§

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

Returns the absolute Unix expiration timestamp in seconds. Redis Docs
Source§

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

Gets all the keys in a hash. Redis Docs
Source§

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

Gets all the values in a hash. Redis Docs
Source§

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

Gets all the fields and values in a hash. Redis Docs
Source§

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

Gets the length of a hash. Returns 0 if key does not exist. Redis Docs
Source§

fn blmove<'a, S, D, RV>( &mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> Result<RV, RedisError>
where S: ToSingleRedisArg, D: ToSingleRedisArg, RV: FromRedisValue,

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

Pops count elements from the first non-empty list key from the list of provided key names; or blocks until one is available. Redis Docs
Source§

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. Redis Docs
Source§

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. Redis Docs
Source§

fn brpoplpush<'a, S, D, RV>( &mut self, srckey: S, dstkey: D, timeout: f64, ) -> Result<RV, RedisError>
where S: ToSingleRedisArg, D: ToSingleRedisArg, RV: FromRedisValue,

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

fn lindex<'a, K, RV>(&mut self, key: K, index: isize) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Get an element from a list by its index. Redis Docs
Source§

fn linsert_before<'a, K, P, V, RV>( &mut self, key: K, pivot: P, value: V, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, P: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Insert an element before another element in a list. Redis Docs
Source§

fn linsert_after<'a, K, P, V, RV>( &mut self, key: K, pivot: P, value: V, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, P: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Insert an element after another element in a list. Redis Docs
Source§

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

Returns the length of the list stored at key. Redis Docs
Source§

fn lmove<'a, S, D, RV>( &mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, ) -> Result<RV, RedisError>
where S: ToSingleRedisArg, D: ToSingleRedisArg, RV: FromRedisValue,

Pop an element a list, push it to another list and return it Redis Docs
Source§

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. Redis Docs
Source§

fn lpop<'a, K, RV>( &mut self, key: K, count: Option<NonZero<usize>>, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

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

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

Returns the index of the first matching value of the list stored at key. Redis Docs
Source§

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

Insert all the specified values at the head of the list stored at key. Redis Docs
Source§

fn lpush_exists<'a, K, V, RV>( &mut self, key: K, value: V, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, 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. Redis Docs
Source§

fn lrange<'a, K, RV>( &mut self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Returns the specified elements of the list stored at key. Redis Docs
Source§

fn lrem<'a, K, V, RV>( &mut self, key: K, count: isize, value: V, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

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

fn ltrim<'a, K, RV>( &mut self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Trim an existing list so that it will contain only the specified range of elements specified. Redis Docs
Source§

fn lset<'a, K, V, RV>( &mut self, key: K, index: isize, value: V, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, V: ToSingleRedisArg, RV: FromRedisValue,

Sets the list element at index to value Redis Docs
Source§

fn ping<'a, RV>(&mut self) -> Result<RV, RedisError>
where RV: FromRedisValue,

Sends a ping to the server Redis Docs
Source§

fn ping_message<'a, K, RV>(&mut self, message: K) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Sends a ping with a message to the server Redis Docs
Source§

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

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

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

Pop a value from a list, push it to another list and return it. Redis Docs
Source§

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

Insert all the specified values at the tail of the list stored at key. Redis Docs
Source§

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

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

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

Add one or more members to a set. Redis Docs
Source§

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

Get the number of members in a set. Redis Docs
Source§

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

Subtract multiple sets. Redis Docs
Source§

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

Subtract multiple sets and store the resulting set in a key. Redis Docs
Source§

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

Intersect multiple sets. Redis Docs
Source§

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

Intersect multiple sets and store the resulting set in a key. Redis Docs
Source§

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

Determine if a given value is a member of a set. Redis Docs
Source§

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

Determine if given values are members of a set. Redis Docs
Source§

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

Get all the members in a set. Redis Docs
Source§

fn smove<'a, S, D, M, RV>( &mut self, srckey: S, dstkey: D, member: M, ) -> Result<RV, RedisError>
where S: ToSingleRedisArg, D: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

Move a member from one set to another. Redis Docs
Source§

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

Remove and return a random member from a set. Redis Docs
Source§

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

Get one random member from a set. Redis Docs
Source§

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

Get multiple random members from a set. Redis Docs
Source§

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

Remove one or more members from a set. Redis Docs
Source§

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

Add multiple sets. Redis Docs
Source§

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

Add multiple sets and store the resulting set in a key. Redis Docs
Source§

fn zadd<'a, K, S, M, RV>( &mut self, key: K, member: M, score: S, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, S: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

Add one member to a sorted set, or update its score if it already exists. Redis Docs
Source§

fn zadd_multiple<'a, K, S, M, RV>( &mut self, key: K, items: &'a [(S, M)], ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, S: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

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

fn zadd_options<'a, K, S, M, RV>( &mut self, key: K, member: M, score: S, options: &'a SortedSetAddOptions, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, S: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

Add one member to a sorted set, or update its score if it already exists. Redis Docs
Source§

fn zadd_multiple_options<'a, K, S, M, RV>( &mut self, key: K, items: &'a [(S, M)], options: &'a SortedSetAddOptions, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, S: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

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

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

Get the number of members in a sorted set. Redis Docs
Source§

fn zcount<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Count the members in a sorted set with scores within the given values. Redis Docs
Source§

fn zincr<'a, K, M, D, RV>( &mut self, key: K, member: M, delta: D, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, D: ToSingleRedisArg, 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. Redis Docs
Source§

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

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

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

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

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

Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Redis Docs
Source§

fn zinterstore_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, 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. Redis Docs
Source§

fn zinterstore_min_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, 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. Redis Docs
Source§

fn zinterstore_max_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, 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. Redis Docs
Source§

fn zlexcount<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Count the number of members in a sorted set between a given lexicographical range. Redis Docs
Source§

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. Redis Docs
Source§

fn zpopmax<'a, K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Removes and returns up to count members with the highest scores in a sorted set Redis Docs
Source§

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. Redis Docs
Source§

fn zpopmin<'a, K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Removes and returns up to count members with the lowest scores in a sorted set Redis Docs
Source§

fn bzmpop_max<'a, K, RV>( &mut self, timeout: f64, keys: 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. Redis Docs
Source§

fn zmpop_max<'a, K, RV>( &mut self, keys: 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. Redis Docs
Source§

fn bzmpop_min<'a, K, RV>( &mut self, timeout: f64, keys: 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. Redis Docs
Source§

fn zmpop_min<'a, K, RV>( &mut self, keys: 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. Redis Docs
Source§

fn zrandmember<'a, K, RV>( &mut self, key: K, count: Option<isize>, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Return up to count random members in a sorted set (or 1 if count == None) Redis Docs
Source§

fn zrandmember_withscores<'a, K, RV>( &mut self, key: K, count: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Return up to count random members in a sorted set with scores Redis Docs
Source§

fn zrange<'a, K, RV>( &mut self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by index Redis Docs
Source§

fn zrange_withscores<'a, K, RV>( &mut self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by index with scores. Redis Docs
Source§

fn zrangebylex<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range. Redis Docs
Source§

fn zrangebylex_limit<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range with offset and limit. Redis Docs
Source§

fn zrevrangebylex<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, MM: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range. Redis Docs
Source§

fn zrevrangebylex_limit<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, MM: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range with offset and limit. Redis Docs
Source§

fn zrangebyscore<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by score. Redis Docs
Source§

fn zrangebyscore_withscores<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by score with scores. Redis Docs
Source§

fn zrangebyscore_limit<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by score with limit. Redis Docs
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>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

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

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

Determine the index of a member in a sorted set. Redis Docs
Source§

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

Remove one or more members from a sorted set. Redis Docs
Source§

fn zrembylex<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Remove all members in a sorted set between the given lexicographical range. Redis Docs
Source§

fn zremrangebyrank<'a, K, RV>( &mut self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Remove all members in a sorted set within the given indexes. Redis Docs
Source§

fn zrembyscore<'a, K, M, MM, RV>( &mut self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, M: ToSingleRedisArg, MM: ToSingleRedisArg, RV: FromRedisValue,

Remove all members in a sorted set within the given scores. Redis Docs
Source§

fn zrevrange<'a, K, RV>( &mut self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by index, ordered from high to low. Redis Docs
Source§

fn zrevrange_withscores<'a, K, RV>( &mut self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by index, with scores ordered from high to low. Redis Docs
Source§

fn zrevrangebyscore<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, MM: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by score. Redis Docs
Source§

fn zrevrangebyscore_withscores<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, MM: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by score with scores. Redis Docs
Source§

fn zrevrangebyscore_limit<'a, K, MM, M, RV>( &mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, MM: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

Return a range of members in a sorted set, by score with limit. Redis Docs
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>
where K: ToSingleRedisArg, MM: ToSingleRedisArg, M: ToSingleRedisArg, RV: FromRedisValue,

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

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

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

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

Get the score associated with the given member in a sorted set. Redis Docs
Source§

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

Get the scores associated with multiple members in a sorted set. Redis Docs
Source§

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

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

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

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

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

Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Redis Docs
Source§

fn zunionstore_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, 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. Redis Docs
Source§

fn zunionstore_min_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, 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. Redis Docs
Source§

fn zunionstore_max_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, 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. Redis Docs
Source§

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

Adds the specified elements to the specified HyperLogLog. Redis Docs
Source§

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). Redis Docs
Source§

fn pfmerge<'a, D, S, RV>( &mut self, dstkey: D, srckeys: S, ) -> Result<RV, RedisError>
where D: ToSingleRedisArg, S: ToRedisArgs, RV: FromRedisValue,

Merge N different HyperLogLogs into a single one. Redis Docs
Source§

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

Posts a message to the given channel. Redis Docs
Source§

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

Posts a message to the given sharded channel. Redis Docs
Source§

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

Returns the encoding of a key. Redis Docs
Source§

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

Returns the time in seconds since the last access of a key. Redis Docs
Source§

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

Returns the logarithmic access frequency counter of a key. Redis Docs
Source§

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

Returns the reference count of a key. Redis Docs
Source§

fn client_getname<'a, RV>(&mut self) -> Result<RV, RedisError>
where RV: FromRedisValue,

Returns the name of the current connection as set by CLIENT SETNAME. Redis Docs
Source§

fn client_id<'a, RV>(&mut self) -> Result<RV, RedisError>
where RV: FromRedisValue,

Returns the ID of the current connection. Redis Docs
Source§

fn client_setname<'a, K, RV>( &mut self, connection_name: K, ) -> Result<RV, RedisError>
where K: ToSingleRedisArg, RV: FromRedisValue,

Command assigns a name to the current connection. Redis Docs
Source§

fn load_script<'a, RV>(&mut self, script: &'a Script) -> Result<RV, RedisError>
where RV: FromRedisValue,

Load a script. Read more
Source§

fn invoke_script<'a, RV>( &mut self, invocation: &'a ScriptInvocation<'a>, ) -> Result<RV, RedisError>
where RV: FromRedisValue,

Invoke a prepared script. Read more
Source§

fn flushall<'a, RV>(&mut self) -> Result<RV, RedisError>
where RV: FromRedisValue,

Deletes all the keys of all databases Read more
Source§

fn flushall_options<'a, RV>( &mut self, options: &'a FlushAllOptions, ) -> Result<RV, RedisError>
where RV: FromRedisValue,

Deletes all the keys of all databases with options Read more
Source§

fn flushdb<'a, RV>(&mut self) -> Result<RV, RedisError>
where RV: FromRedisValue,

Deletes all the keys of the current database Read more
Source§

fn flushdb_options<'a, RV>( &mut self, options: &'a FlushAllOptions, ) -> Result<RV, RedisError>
where RV: FromRedisValue,

Deletes all the keys of the current database with options Read more
Source§

fn scan<RV>(&mut self) -> Result<Iter<'_, RV>, RedisError>
where RV: FromRedisValue,

Incrementally iterate the keys space.
Source§

fn scan_options<RV>( &mut self, opts: ScanOptions, ) -> Result<Iter<'_, RV>, RedisError>
where RV: FromRedisValue,

Incrementally iterate the keys space with options.
Source§

fn scan_match<P, RV>(&mut self, pattern: P) -> Result<Iter<'_, RV>, RedisError>
where P: ToSingleRedisArg, 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: ToSingleRedisArg, 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: ToSingleRedisArg, P: ToSingleRedisArg, 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: ToSingleRedisArg, 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: ToSingleRedisArg, P: ToSingleRedisArg, 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: ToSingleRedisArg, 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: ToSingleRedisArg, P: ToSingleRedisArg, RV: FromRedisValue,

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

impl<C, T> ConnectionLike for T
where C: ConnectionLike, T: DerefMut<Target = C>,

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>, RedisError>

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§

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 supports_pipelining(&self) -> bool

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§

impl<T> CryptoRng for T
where T: DerefMut, <T as Deref>::Target: CryptoRng,

Source§

impl<R> CryptoRng for R
where R: TryCryptoRng<Error = Infallible> + ?Sized,

Source§

impl<T> Downcast for T
where T: Any,

Source§

fn into_any(self: Box<T>) -> Box<dyn Any>

Converts Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Converts Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
Source§

fn as_any(&self) -> &(dyn Any + 'static)

Converts &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
Source§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Converts &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
Source§

impl<T> DowncastSend for T
where T: Any + Send,

Source§

fn into_any_send(self: Box<T>) -> Box<dyn Any + Send>

Converts Box<Trait> (where Trait: DowncastSend) to Box<dyn Any + Send>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

Source§

fn into_any_sync(self: Box<T>) -> Box<dyn Any + Send + Sync>

Converts Box<Trait> (where Trait: DowncastSync) to Box<dyn Any + Send + Sync>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync> ⓘ

Converts Arc<Trait> (where Trait: DowncastSync) to Arc<Any>, which can then be downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T, A> DynAccess<T> for A
where A: Access<T>, <A as Access<T>>::Guard: 'static,

Source§

fn load(&self) -> DynGuard<T>

The equivalent of Access::load.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> FromRef<T> for T
where T: Clone,

Source§

fn from_ref(input: &T) -> T

Converts to this type from a reference to the input type.
Source§

impl<S, T> FromRequest<S, ViaParts> for T
where S: Send + Sync, T: FromRequestParts<S>,

Source§

type Rejection = <T as FromRequestParts<S>>::Rejection

If the extractor fails it’ll use this “rejection” type. A rejection is a kind of error that can be converted into a response.
Source§

fn from_request( req: Request<Body>, state: &S, ) -> impl Future<Output = Result<T, <T as FromRequest<S, ViaParts>>::Rejection>>

Perform the extraction.
Source§

impl<A, B, T> HttpServerConnExec<A, B> for T
where B: Body,

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 T
where U: From<T>,

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> IntoSql for T

Source§

fn into_sql<T>(self) -> Self::Expression
where Self: Sized + AsExpression<T>, T: SqlType + TypedExpressionType,

Convert self to an expression for Diesel’s query builder. Read more
Source§

fn as_sql<'a, T>(&'a self) -> <&'a Self as AsExpression<T>>::Expression
where &'a Self: AsExpression<T>, T: SqlType + TypedExpressionType,

Convert &self to an expression for Diesel’s query builder. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<P, T> Receiver for P
where P: Deref<Target = T> + ?Sized, T: ?Sized,

Source§

type Target = T

🔬This is a nightly-only experimental API. (arbitrary_self_types)
The target type on which the method may be called.
Source§

impl<T> RepositoryHooksClone for T
where T: Clone,

Source§

fn autumn_clone(&self) -> T

Clone hook state for generated repository values.
Source§

impl<T> RepositoryHooksDefault for T
where T: Default,

Source§

fn autumn_default() -> T

Construct a hook instance for generated repository state.
Source§

impl<R> Rng for R
where R: RngCore + ?Sized,

Source§

fn random<T>(&mut self) -> T
where StandardUniform: Distribution<T>,

Return a random value via the StandardUniform distribution. Read more
Source§

fn random_iter<T>(self) -> Iter<StandardUniform, Self, T>
where Self: Sized, StandardUniform: Distribution<T>,

Return an iterator over random variates Read more
Source§

fn random_range<T, R>(&mut self, range: R) -> T
where T: SampleUniform, R: SampleRange<T>,

Generate a random value in the given range. Read more
Source§

fn random_bool(&mut self, p: f64) -> bool

Return a bool with a probability p of being true. Read more
Source§

fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool

Return a bool with a probability of numerator/denominator of being true. Read more
Source§

fn sample<T, D>(&mut self, distr: D) -> T
where D: Distribution<T>,

Sample a new value, using the given distribution. Read more
Source§

fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T>
where D: Distribution<T>, Self: Sized,

Create an iterator that generates values using the given distribution. Read more
Source§

fn fill<T>(&mut self, dest: &mut T)
where T: Fill + ?Sized,

Fill any type implementing Fill with random data Read more
Source§

fn gen<T>(&mut self) -> T
where StandardUniform: Distribution<T>,

👎Deprecated since 0.9.0:

Renamed to random to avoid conflict with the new gen keyword in Rust 2024.

Alias for Rng::random.
Source§

fn gen_range<T, R>(&mut self, range: R) -> T
where T: SampleUniform, R: SampleRange<T>,

👎Deprecated since 0.9.0:

Renamed to random_range

Alias for Rng::random_range.
Source§

fn gen_bool(&mut self, p: f64) -> bool

👎Deprecated since 0.9.0:

Renamed to random_bool

Alias for Rng::random_bool.
Source§

fn gen_ratio(&mut self, numerator: u32, denominator: u32) -> bool

👎Deprecated since 0.9.0:

Renamed to random_ratio

Alias for Rng::random_ratio.
Source§

impl<R> Rng for R
where R: TryRng<Error = Infallible> + ?Sized,

Source§

fn next_u32(&mut self) -> u32

Return the next random u32.
Source§

fn next_u64(&mut self) -> u64

Return the next random u64.
Source§

fn fill_bytes(&mut self, dst: &mut [u8])

Fill dest with random data. Read more
Source§

impl<T> RngCore for T
where T: DerefMut, <T as Deref>::Target: RngCore,

Source§

fn next_u32(&mut self) -> u32

Return the next random u32. Read more
Source§

fn next_u64(&mut self) -> u64

Return the next random u64. Read more
Source§

fn fill_bytes(&mut self, dst: &mut [u8])

Fill dest with random data. Read more
Source§

impl<R> RngCore for R
where R: Rng,

Source§

impl<R> RngExt for R
where R: Rng + ?Sized,

Source§

fn random<T>(&mut self) -> T
where StandardUniform: Distribution<T>,

Return a random value via the StandardUniform distribution. Read more
Source§

fn random_iter<T>(self) -> Iter<StandardUniform, Self, T>
where Self: Sized, StandardUniform: Distribution<T>,

Return an iterator over random variates Read more
Source§

fn random_range<T, R>(&mut self, range: R) -> T
where T: SampleUniform, R: SampleRange<T>,

Generate a random value in the given range. Read more
Source§

fn random_bool(&mut self, p: f64) -> bool

Return a bool with a probability p of being true. Read more
Source§

fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool

Return a bool with a probability of numerator/denominator of being true. Read more
Source§

fn sample<T, D>(&mut self, distr: D) -> T
where D: Distribution<T>,

Sample a new value, using the given distribution. Read more
Source§

fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T>
where D: Distribution<T>, Self: Sized,

Create an iterator that generates values using the given distribution. Read more
Source§

fn fill<T>(&mut self, dest: &mut [T])
where T: Fill,

Fill any type implementing Fill with random data Read more
Source§

impl<T, Conn> RunQueryDsl<Conn> for T

Source§

fn execute<'conn, 'query>( self, conn: &'conn mut Conn, ) -> <Conn as AsyncConnectionCore>::ExecuteFuture<'conn, 'query>
where Conn: AsyncConnectionCore + Send, Self: ExecuteDsl<Conn> + 'query,

Executes the given command, returning the number of rows affected. Read more
Source§

fn load<'query, 'conn, U>( self, conn: &'conn mut Conn, ) -> AndThen<Self::LoadFuture<'conn>, TryCollect<Self::Stream<'conn>, Vec<U>>>
where U: Send, Conn: AsyncConnectionCore, Self: LoadQuery<'query, Conn, U> + 'query,

Executes the given query, returning a Vec with the returned rows. Read more
Source§

fn load_stream<'conn, 'query, U>( self, conn: &'conn mut Conn, ) -> Self::LoadFuture<'conn>
where Conn: AsyncConnectionCore, U: 'conn, Self: LoadQuery<'query, Conn, U> + 'query,

Executes the given query, returning a [Stream] with the returned rows. Read more
Source§

fn get_result<'query, 'conn, U>( self, conn: &'conn mut Conn, ) -> AndThen<Self::LoadFuture<'conn>, LoadNext<Pin<Box<Self::Stream<'conn>>>>>
where U: Send + 'conn, Conn: AsyncConnectionCore, Self: LoadQuery<'query, Conn, U> + 'query,

Runs the command, and returns the affected row. Read more
Source§

fn get_results<'query, 'conn, U>( self, conn: &'conn mut Conn, ) -> AndThen<Self::LoadFuture<'conn>, TryCollect<Self::Stream<'conn>, Vec<U>>>
where U: Send, Conn: AsyncConnectionCore, Self: LoadQuery<'query, Conn, U> + 'query,

Runs the command, returning an Vec with the affected rows. Read more
Source§

fn first<'query, 'conn, U>( self, conn: &'conn mut Conn, ) -> AndThen<<Self::Output as LoadQuery<'query, Conn, U>>::LoadFuture<'conn>, LoadNext<Pin<Box<<Self::Output as LoadQuery<'query, Conn, U>>::Stream<'conn>>>>>
where U: Send + 'conn, Conn: AsyncConnectionCore, Self: LimitDsl, Self::Output: LoadQuery<'query, Conn, U> + Send + 'query,

Attempts to load a single record. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Scoped for T
where T: Send + Sync + 'static,

Source§

fn scope(ctx: &PolicyContext) -> ScopeQuery<'_, Self>

Open a deferred ScopeQuery for this type. Resolves the registered scope at .load() time, not here.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

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<R> TryCryptoRng for R
where R: CryptoRng + ?Sized,

Source§

impl<R> TryCryptoRng for R
where R: DerefMut, <R as Deref>::Target: TryCryptoRng,

Source§

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

impl<R> TryRng for R
where R: DerefMut, <R as Deref>::Target: TryRng,

Source§

type Error = <<R as Deref>::Target as TryRng>::Error

The type returned in the event of a RNG error. Read more
Source§

fn try_next_u32(&mut self) -> Result<u32, <R as TryRng>::Error>

Return the next random u32.
Source§

fn try_next_u64(&mut self) -> Result<u64, <R as TryRng>::Error>

Return the next random u64.
Source§

fn try_fill_bytes(&mut self, dst: &mut [u8]) -> Result<(), <R as TryRng>::Error>

Fill dst entirely with random data.
Source§

impl<R> TryRngCore for R
where R: RngCore + ?Sized,

Source§

type Error = Infallible

The type returned in the event of a RNG error.
Source§

fn try_next_u32(&mut self) -> Result<u32, <R as TryRngCore>::Error>

Return the next random u32.
Source§

fn try_next_u64(&mut self) -> Result<u64, <R as TryRngCore>::Error>

Return the next random u64.
Source§

fn try_fill_bytes( &mut self, dst: &mut [u8], ) -> Result<(), <R as TryRngCore>::Error>

Fill dest entirely with random data.
Source§

fn unwrap_err(self) -> UnwrapErr<Self>
where Self: Sized,

Wrap RNG with the UnwrapErr wrapper.
Source§

fn unwrap_mut(&mut self) -> UnwrapMut<'_, Self>

Wrap RNG with the UnwrapMut wrapper.
Source§

fn read_adapter(&mut self) -> RngReadAdapter<'_, Self>
where Self: Sized,

Convert an RngCore to a RngReadAdapter.
Source§

impl<R> TryRngCore for R
where R: TryRng,

Source§

type Error = <R as TryRng>::Error

👎Deprecated since 0.10.0:

use TryRng instead

Error type.
Source§

impl<T> TypedCommands for T
where T: ConnectionLike,

Source§

fn get<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the value of a key. If key is a vec this becomes an MGET (if using TypedCommands, you should specifically use mget to get the correct return type. Redis Docs
Source§

fn mget<'a, K>(&'a mut self, key: K) -> Result<Vec<Option<String>>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Get values of keys Redis Docs
Source§

fn keys<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Gets all keys matching pattern Redis Docs
Source§

fn set<'a, K, V>(&'a mut self, key: K, value: V) -> Result<(), RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Set the string value of a key. Redis Docs
Source§

fn set_options<'a, K, V>( &'a mut self, key: K, value: V, options: SetOptions, ) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Set the string value of a key with options. Redis Docs
Source§

fn mset<'a, K, V>(&'a mut self, items: &'a [(K, V)]) -> Result<(), RedisError>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets multiple keys to their values. Redis Docs
Source§

fn set_ex<'a, K, V>( &'a mut self, key: K, value: V, seconds: u64, ) -> Result<(), RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Set the value and expiration of a key. Redis Docs
Source§

fn pset_ex<'a, K, V>( &'a mut self, key: K, value: V, milliseconds: u64, ) -> Result<(), RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Set the value and expiration in milliseconds of a key. Redis Docs
Source§

fn set_nx<'a, K, V>(&'a mut self, key: K, value: V) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Set the value of a key, only if the key does not exist Redis Docs
Source§

fn mset_nx<'a, K, V>( &'a mut self, items: &'a [(K, V)], ) -> Result<bool, RedisError>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets multiple keys to their values failing if at least one already exists. Redis Docs
Source§

fn mset_ex<'a, K, V>( &'a mut self, items: &'a [(K, V)], options: MSetOptions, ) -> Result<bool, RedisError>
where K: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets the given keys to their respective values. This command is an extension of the MSETNX that adds expiration and XX options. Redis Docs
Source§

fn getset<'a, K, V>( &'a mut self, key: K, value: V, ) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Set the string value of a key and return its old value. Redis Docs
Source§

fn getrange<'a, K>( &'a mut self, key: K, from: isize, to: isize, ) -> Result<String, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value. Redis returns an empty string if the key doesn’t exist, not Nil Redis Docs
Source§

fn setrange<'a, K, V>( &'a mut self, key: K, offset: isize, value: V, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Overwrite the part of the value stored in key at the specified offset. Redis Docs
Source§

fn del<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Delete one or more keys. Returns the number of keys deleted. Redis Docs
Source§

fn del_ex<'a, K>( &'a mut self, key: K, value_comparison: ValueComparison, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Conditionally removes the specified key. A key is ignored if it does not exist. IFEQ match-value - Delete the key only if its value is equal to match-value IFNE match-value - Delete the key only if its value is not equal to match-value IFDEQ match-digest - Delete the key only if the digest of its value is equal to match-digest IFDNE match-digest - Delete the key only if the digest of its value is not equal to match-digest Redis Docs
Source§

fn digest<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the hex signature of the value stored in the specified key. For the digest, Redis will use XXH3 Redis Docs
Source§

fn exists<'a, K>(&'a mut self, key: K) -> Result<bool, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Determine if a key exists. Redis Docs
Source§

fn key_type<'a, K>(&'a mut self, key: K) -> Result<ValueType, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Determine the type of key. Redis Docs
Source§

fn expire<'a, K>(&'a mut self, key: K, seconds: i64) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Set a key’s time to live in seconds. Returns whether expiration was set. Redis Docs
Source§

fn expire_at<'a, K>(&'a mut self, key: K, ts: i64) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Set the expiration for a key as a UNIX timestamp. Returns whether expiration was set. Redis Docs
Source§

fn pexpire<'a, K>(&'a mut self, key: K, ms: i64) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Set a key’s time to live in milliseconds. Returns whether expiration was set. Redis Docs
Source§

fn pexpire_at<'a, K>(&'a mut self, key: K, ts: i64) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Set the expiration for a key as a UNIX timestamp in milliseconds. Returns whether expiration was set. Redis Docs
Source§

fn expire_time<'a, K>( &'a mut self, key: K, ) -> Result<IntegerReplyOrNoOp, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the absolute Unix expiration timestamp in seconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
Source§

fn pexpire_time<'a, K>( &'a mut self, key: K, ) -> Result<IntegerReplyOrNoOp, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the absolute Unix expiration timestamp in milliseconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
Source§

fn persist<'a, K>(&'a mut self, key: K) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Remove the expiration from a key. Returns whether a timeout was removed. Redis Docs
Source§

fn ttl<'a, K>(&'a mut self, key: K) -> Result<IntegerReplyOrNoOp, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the time to live for a key in seconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
Source§

fn pttl<'a, K>(&'a mut self, key: K) -> Result<IntegerReplyOrNoOp, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the time to live for a key in milliseconds. Returns ExistsButNotRelevant if key exists but has no expiration time. Redis Docs
Source§

fn get_ex<'a, K>( &'a mut self, key: K, expire_at: Expiry, ) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the value of a key and set expiration Redis Docs
Source§

fn get_del<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the value of a key and delete it Redis Docs
Source§

fn copy<'a, KSrc, KDst, Db>( &'a mut self, source: KSrc, destination: KDst, options: CopyOptions<Db>, ) -> Result<bool, RedisError>
where KSrc: ToSingleRedisArg + Send + Sync + 'a, KDst: ToSingleRedisArg + Send + Sync + 'a, Db: ToString + Send + Sync + 'a,

Copy the value from one key to another, returning whether the copy was successful. Redis Docs
Source§

fn rename<'a, K, N>(&'a mut self, key: K, new_key: N) -> Result<(), RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, N: ToSingleRedisArg + Send + Sync + 'a,

Rename a key. Errors if key does not exist. Redis Docs
Source§

fn rename_nx<'a, K, N>( &'a mut self, key: K, new_key: N, ) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, N: ToSingleRedisArg + Send + Sync + 'a,

Rename a key, only if the new key does not exist. Errors if key does not exist. Returns whether the key was renamed, or false if the new key already exists. Redis Docs
Unlink one or more keys. This is a non-blocking version of DEL. Returns number of keys unlinked. Redis Docs
Source§

fn append<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Append a value to a key. Returns length of string after operation. Redis Docs
Source§

fn incr<'a, K, V>(&'a mut self, key: K, delta: V) -> Result<isize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type. If the key does not exist, it is set to 0 before performing the operation.
Source§

fn decr<'a, K, V>(&'a mut self, key: K, delta: V) -> Result<isize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Decrement the numeric value of a key by the given amount. If the key does not exist, it is set to 0 before performing the operation. Redis Docs
Source§

fn setbit<'a, K>( &'a mut self, key: K, offset: usize, value: bool, ) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Sets or clears the bit at offset in the string value stored at key. Returns the original bit value stored at offset. Redis Docs
Source§

fn getbit<'a, K>( &'a mut self, key: K, offset: usize, ) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Returns the bit value at offset in the string value stored at key. Redis Docs
Source§

fn bitcount<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Count set bits in a string. Returns 0 if key does not exist. Redis Docs
Source§

fn bitcount_range<'a, K>( &'a mut self, key: K, start: usize, end: usize, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Count set bits in a string in a range. Returns 0 if key does not exist. Redis Docs
Source§

fn bit_and<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
Source§

fn bit_or<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
Source§

fn bit_xor<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
Source§

fn bit_not<'a, D, S>( &'a mut self, dstkey: D, srckey: S, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToSingleRedisArg + Send + Sync + 'a,

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Returns size of destination string after operation. Redis Docs
Source§

fn bit_diff<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

DIFF(X, Y1, Y2, …)
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
Source§

fn bit_diff1<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

DIFF1(X, Y1, Y2, …) (Relative complement difference)
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
Source§

fn bit_and_or<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

ANDOR(X, Y1, Y2, …)
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
Source§

fn bit_one<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

ONE(X, Y1, Y2, …)
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
Source§

fn strlen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the length of the value stored in a key. 0 if key does not exist. Redis Docs
Source§

fn hget<'a, K, F>( &'a mut self, key: K, field: F, ) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToSingleRedisArg + Send + Sync + 'a,

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

fn hmget<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Gets multiple fields from a hash. Redis Docs
Source§

fn hget_ex<'a, K, F>( &'a mut self, key: K, fields: F, expire_at: Expiry, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Get the value of one or more fields of a given hash key, and optionally set their expiration Redis Docs
Source§

fn hdel<'a, K, F>(&'a mut self, key: K, field: F) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Deletes a single (or multiple) fields from a hash. Returns number of fields deleted. Redis Docs
Source§

fn hget_del<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<Option<String>>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Get and delete the value of one or more fields of a given hash key Redis Docs
Source§

fn hset<'a, K, F, V>( &'a mut self, key: K, field: F, value: V, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Sets a single field in a hash. Returns number of fields added. Redis Docs
Source§

fn hset_ex<'a, K, F, V>( &'a mut self, key: K, hash_field_expiration_options: &'a HashFieldExpirationOptions, fields_values: &'a [(F, V)], ) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Set the value of one or more fields of a given hash key, and optionally set their expiration Redis Docs
Source§

fn hset_nx<'a, K, F, V>( &'a mut self, key: K, field: F, value: V, ) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Sets a single field in a hash if it does not exist. Returns whether the field was added. Redis Docs
Source§

fn hset_multiple<'a, K, F, V>( &'a mut self, key: K, items: &'a [(F, V)], ) -> Result<(), RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Sets multiple fields in a hash. Redis Docs
Source§

fn hincr<'a, K, F, D>( &'a mut self, key: K, field: F, delta: D, ) -> Result<f64, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToSingleRedisArg + Send + Sync + 'a, D: ToSingleRedisArg + Send + Sync + 'a,

Increments a value. Returns the new value of the field after incrementation.
Source§

fn hexists<'a, K, F>(&'a mut self, key: K, field: F) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToSingleRedisArg + Send + Sync + 'a,

Checks if a field in a hash exists. Redis Docs
Source§

fn httl<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Get one or more fields’ TTL in seconds. Redis Docs
Source§

fn hpttl<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Get one or more fields’ TTL in milliseconds. Redis Docs
Source§

fn hexpire<'a, K, F>( &'a mut self, key: K, seconds: i64, opt: ExpireOption, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Set one or more fields’ time to live in seconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with 0 seconds. Errors if provided key exists but is not a hash. Redis Docs
Source§

fn hexpire_at<'a, K, F>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Set the expiration for one or more fields as a UNIX timestamp in seconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with a time in the past. Errors if provided key exists but is not a hash. Redis Docs
Source§

fn hexpire_time<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Returns the absolute Unix expiration timestamp in seconds. Redis Docs
Source§

fn hpersist<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Remove the expiration from a key. Returns 1 if the expiration was removed. Redis Docs
Source§

fn hpexpire<'a, K, F>( &'a mut self, key: K, milliseconds: i64, opt: ExpireOption, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Set one or more fields’ time to live in milliseconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with 0 seconds. Errors if provided key exists but is not a hash. Redis Docs
Source§

fn hpexpire_at<'a, K, F>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Set the expiration for one or more fields as a UNIX timestamp in milliseconds. Returns an array where each element corresponds to the field at the same index in the fields argument. Each element of the array is either: 0 if the specified condition has not been met. 1 if the expiration time was updated. 2 if called with a time in the past. Errors if provided key exists but is not a hash. Redis Docs
Source§

fn hpexpire_time<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, F: ToRedisArgs + Send + Sync + 'a,

Returns the absolute Unix expiration timestamp in seconds. Redis Docs
Source§

fn hkeys<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Gets all the keys in a hash. Redis Docs
Source§

fn hvals<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Gets all the values in a hash. Redis Docs
Source§

fn hgetall<'a, K>( &'a mut self, key: K, ) -> Result<HashMap<String, String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Gets all the fields and values in a hash. Redis Docs
Source§

fn hlen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Gets the length of a hash. Returns 0 if key does not exist. Redis Docs
Source§

fn blmove<'a, S, D>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> Result<Option<String>, RedisError>
where S: ToSingleRedisArg + Send + Sync + 'a, D: ToSingleRedisArg + Send + Sync + 'a,

Pop an element from a list, push it to another list and return it; or block until one is available Redis Docs
Source§

fn blmpop<'a, K>( &'a mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Result<Option<[String; 2]>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Pops count elements from the first non-empty list key from the list of provided key names; or blocks until one is available. Redis Docs
Source§

fn blpop<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Result<Option<[String; 2]>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn brpop<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Result<Option<[String; 2]>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

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

fn brpoplpush<'a, S, D>( &'a mut self, srckey: S, dstkey: D, timeout: f64, ) -> Result<Option<String>, RedisError>
where S: ToSingleRedisArg + Send + Sync + 'a, D: ToSingleRedisArg + Send + Sync + 'a,

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

fn lindex<'a, K>( &'a mut self, key: K, index: isize, ) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get an element from a list by its index. Redis Docs
Source§

fn linsert_before<'a, K, P, V>( &'a mut self, key: K, pivot: P, value: V, ) -> Result<isize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, P: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Insert an element before another element in a list. Redis Docs
Source§

fn linsert_after<'a, K, P, V>( &'a mut self, key: K, pivot: P, value: V, ) -> Result<isize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, P: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Insert an element after another element in a list. Redis Docs
Source§

fn llen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Returns the length of the list stored at key. Redis Docs
Source§

fn lmove<'a, S, D>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, ) -> Result<String, RedisError>
where S: ToSingleRedisArg + Send + Sync + 'a, D: ToSingleRedisArg + Send + Sync + 'a,

Pop an element a list, push it to another list and return it Redis Docs
Source§

fn lmpop<'a, K>( &'a mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Result<Option<(String, Vec<String>)>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Pops count elements from the first non-empty list key from the list of provided key names. Redis Docs
Source§

fn lpop<'a, RV, K>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Result<RV, RedisError>
where RV: FromRedisValue, K: ToSingleRedisArg + Send + Sync + 'a,

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

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

Returns the index of the first matching value of the list stored at key. Redis Docs
Source§

fn lpush<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Insert all the specified values at the head of the list stored at key. Redis Docs
Source§

fn lpush_exists<'a, K, V>( &'a mut self, key: K, value: V, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn lrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Returns the specified elements of the list stored at key. Redis Docs
Source§

fn lrem<'a, K, V>( &'a mut self, key: K, count: isize, value: V, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

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

fn ltrim<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<(), RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Trim an existing list so that it will contain only the specified range of elements specified. Redis Docs
Source§

fn lset<'a, K, V>( &'a mut self, key: K, index: isize, value: V, ) -> Result<(), RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToSingleRedisArg + Send + Sync + 'a,

Sets the list element at index to value Redis Docs
Source§

fn ping<'a>(&'a mut self) -> Result<String, RedisError>

Sends a ping to the server Redis Docs
Source§

fn ping_message<'a, K>(&'a mut self, message: K) -> Result<String, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Sends a ping with a message to the server Redis Docs
Source§

fn rpop<'a, RV, K>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Result<RV, RedisError>
where RV: FromRedisValue, K: ToSingleRedisArg + Send + Sync + 'a,

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

fn rpoplpush<'a, K, D>( &'a mut self, key: K, dstkey: D, ) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, D: ToSingleRedisArg + Send + Sync + 'a,

Pop a value from a list, push it to another list and return it. Redis Docs
Source§

fn rpush<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

Insert all the specified values at the tail of the list stored at key. Redis Docs
Source§

fn rpush_exists<'a, K, V>( &'a mut self, key: K, value: V, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, V: ToRedisArgs + Send + Sync + 'a,

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

fn sadd<'a, K, M>(&'a mut self, key: K, member: M) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Add one or more members to a set. Redis Docs
Source§

fn scard<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the number of members in a set. Redis Docs
Source§

fn sdiff<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Subtract multiple sets. Redis Docs
Source§

fn sdiffstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

Subtract multiple sets and store the resulting set in a key. Redis Docs
Source§

fn sinter<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Intersect multiple sets. Redis Docs
Source§

fn sinterstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

Intersect multiple sets and store the resulting set in a key. Redis Docs
Source§

fn sismember<'a, K, M>( &'a mut self, key: K, member: M, ) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Determine if a given value is a member of a set. Redis Docs
Source§

fn smismember<'a, K, M>( &'a mut self, key: K, members: M, ) -> Result<Vec<bool>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Determine if given values are members of a set. Redis Docs
Source§

fn smembers<'a, K>(&'a mut self, key: K) -> Result<HashSet<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get all the members in a set. Redis Docs
Source§

fn smove<'a, S, D, M>( &'a mut self, srckey: S, dstkey: D, member: M, ) -> Result<bool, RedisError>
where S: ToSingleRedisArg + Send + Sync + 'a, D: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Move a member from one set to another. Redis Docs
Source§

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

Remove and return a random member from a set. Redis Docs
Source§

fn srandmember<'a, K>( &'a mut self, key: K, ) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get one random member from a set. Redis Docs
Source§

fn srandmember_multiple<'a, K>( &'a mut self, key: K, count: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get multiple random members from a set. Redis Docs
Source§

fn srem<'a, K, M>(&'a mut self, key: K, member: M) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Remove one or more members from a set. Redis Docs
Source§

fn sunion<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Add multiple sets. Redis Docs
Source§

fn sunionstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

Add multiple sets and store the resulting set in a key. Redis Docs
Source§

fn zadd<'a, K, S, M>( &'a mut self, key: K, member: M, score: S, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, S: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Add one member to a sorted set, or update its score if it already exists. Redis Docs
Source§

fn zadd_multiple<'a, K, S, M>( &'a mut self, key: K, items: &'a [(S, M)], ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zadd_options<'a, K, S, M>( &'a mut self, key: K, member: M, score: S, options: &'a SortedSetAddOptions, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, S: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Add one member to a sorted set, or update its score if it already exists. Redis Docs
Source§

fn zadd_multiple_options<'a, K, S, M>( &'a mut self, key: K, items: &'a [(S, M)], options: &'a SortedSetAddOptions, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

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

fn zcard<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Get the number of members in a sorted set. Redis Docs
Source§

fn zcount<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Count the members in a sorted set with scores within the given values. Redis Docs
Source§

fn zincr<'a, K, M, D>( &'a mut self, key: K, member: M, delta: D, ) -> Result<f64, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, D: ToSingleRedisArg + Send + Sync + 'a,

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. Redis Docs
Source§

fn zinterstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zinterstore_min<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zinterstore_max<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Redis Docs
Source§

fn zinterstore_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

Commands::zinterstore, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple. Redis Docs
Source§

fn zinterstore_min_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
Source§

fn zinterstore_max_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
Source§

fn zlexcount<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Count the number of members in a sorted set between a given lexicographical range. Redis Docs
Source§

fn bzpopmax<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Result<Option<(String, String, f64)>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Removes and returns the member with the highest score in a sorted set. Blocks until a member is available otherwise. Redis Docs
Source§

fn zpopmax<'a, K>( &'a mut self, key: K, count: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Removes and returns up to count members with the highest scores in a sorted set Redis Docs
Source§

fn bzpopmin<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Result<Option<(String, String, f64)>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Removes and returns the member with the lowest score in a sorted set. Blocks until a member is available otherwise. Redis Docs
Source§

fn zpopmin<'a, K>( &'a mut self, key: K, count: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Removes and returns up to count members with the lowest scores in a sorted set Redis Docs
Source§

fn bzmpop_max<'a, K>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
Source§

fn zmpop_max<'a, K>( &'a mut self, keys: K, count: isize, ) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
Source§

fn bzmpop_min<'a, K>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
Source§

fn zmpop_min<'a, K>( &'a mut self, keys: K, count: isize, ) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
Source§

fn zrandmember<'a, RV, K>( &'a mut self, key: K, count: Option<isize>, ) -> Result<RV, RedisError>
where RV: FromRedisValue, K: ToSingleRedisArg + Send + Sync + 'a,

Return up to count random members in a sorted set (or 1 if count == None) Redis Docs
Source§

fn zrandmember_withscores<'a, RV, K>( &'a mut self, key: K, count: isize, ) -> Result<RV, RedisError>
where RV: FromRedisValue, K: ToSingleRedisArg + Send + Sync + 'a,

Return up to count random members in a sorted set with scores Redis Docs
Source§

fn zrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by index Redis Docs
Source§

fn zrange_withscores<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<(String, f64)>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by index with scores. Redis Docs
Source§

fn zrangebylex<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by lexicographical range. Redis Docs
Source§

fn zrangebylex_limit<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by lexicographical range with offset and limit. Redis Docs
Source§

fn zrevrangebylex<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by lexicographical range. Redis Docs
Source§

fn zrevrangebylex_limit<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by lexicographical range with offset and limit. Redis Docs
Source§

fn zrangebyscore<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by score. Redis Docs
Source§

fn zrangebyscore_withscores<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<Vec<(String, usize)>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by score with scores. Redis Docs
Source§

fn zrangebyscore_limit<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by score with limit. Redis Docs
Source§

fn zrangebyscore_limit_withscores<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<Vec<(String, usize)>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

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

fn zrank<'a, K, M>( &'a mut self, key: K, member: M, ) -> Result<Option<usize>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Determine the index of a member in a sorted set. Redis Docs
Source§

fn zrem<'a, K, M>(&'a mut self, key: K, members: M) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Remove one or more members from a sorted set. Redis Docs
Source§

fn zrembylex<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Remove all members in a sorted set between the given lexicographical range. Redis Docs
Source§

fn zremrangebyrank<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Remove all members in a sorted set within the given indexes. Redis Docs
Source§

fn zrembyscore<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a,

Remove all members in a sorted set within the given scores. Redis Docs
Source§

fn zrevrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by index, ordered from high to low. Redis Docs
Source§

fn zrevrange_withscores<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by index, with scores ordered from high to low. Redis Docs
Source§

fn zrevrangebyscore<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by score. Redis Docs
Source§

fn zrevrangebyscore_withscores<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by score with scores. Redis Docs
Source§

fn zrevrangebyscore_limit<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Return a range of members in a sorted set, by score with limit. Redis Docs
Source§

fn zrevrangebyscore_limit_withscores<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, MM: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

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

fn zrevrank<'a, K, M>( &'a mut self, key: K, member: M, ) -> Result<Option<usize>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

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

fn zscore<'a, K, M>( &'a mut self, key: K, member: M, ) -> Result<Option<f64>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToSingleRedisArg + Send + Sync + 'a,

Get the score associated with the given member in a sorted set. Redis Docs
Source§

fn zscore_multiple<'a, K, M>( &'a mut self, key: K, members: &'a [M], ) -> Result<Option<Vec<f64>>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, M: ToRedisArgs + Send + Sync + 'a,

Get the scores associated with multiple members in a sorted set. Redis Docs
Source§

fn zunionstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zunionstore_min<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

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

fn zunionstore_max<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a,

Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Redis Docs
Source§

fn zunionstore_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

Commands::zunionstore, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple. Redis Docs
Source§

fn zunionstore_min_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
Source§

fn zunionstore_max_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, K: ToRedisArgs + Send + Sync + 'a, W: ToRedisArgs + Send + Sync + 'a,

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. Redis Docs
Source§

fn pfadd<'a, K, E>(&'a mut self, key: K, element: E) -> Result<bool, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, E: ToRedisArgs + Send + Sync + 'a,

Adds the specified elements to the specified HyperLogLog. Redis Docs
Source§

fn pfcount<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
where K: ToRedisArgs + Send + Sync + 'a,

Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s). Redis Docs
Source§

fn pfmerge<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<(), RedisError>
where D: ToSingleRedisArg + Send + Sync + 'a, S: ToRedisArgs + Send + Sync + 'a,

Merge N different HyperLogLogs into a single one. Redis Docs
Source§

fn publish<'a, K, E>( &'a mut self, channel: K, message: E, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, E: ToSingleRedisArg + Send + Sync + 'a,

Posts a message to the given channel. Redis Docs
Source§

fn spublish<'a, K, E>( &'a mut self, channel: K, message: E, ) -> Result<usize, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a, E: ToSingleRedisArg + Send + Sync + 'a,

Posts a message to the given sharded channel. Redis Docs
Source§

fn object_encoding<'a, K>( &'a mut self, key: K, ) -> Result<Option<String>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Returns the encoding of a key. Redis Docs
Source§

fn object_idletime<'a, K>( &'a mut self, key: K, ) -> Result<Option<usize>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Returns the time in seconds since the last access of a key. Redis Docs
Source§

fn object_freq<'a, K>(&'a mut self, key: K) -> Result<Option<usize>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Returns the logarithmic access frequency counter of a key. Redis Docs
Source§

fn object_refcount<'a, K>( &'a mut self, key: K, ) -> Result<Option<usize>, RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Returns the reference count of a key. Redis Docs
Source§

fn client_getname<'a>(&'a mut self) -> Result<Option<String>, RedisError>

Returns the name of the current connection as set by CLIENT SETNAME. Redis Docs
Source§

fn client_id<'a>(&'a mut self) -> Result<isize, RedisError>

Returns the ID of the current connection. Redis Docs
Source§

fn client_setname<'a, K>( &'a mut self, connection_name: K, ) -> Result<(), RedisError>
where K: ToSingleRedisArg + Send + Sync + 'a,

Command assigns a name to the current connection. Redis Docs
Source§

fn load_script<'a, RV>( &'a mut self, script: &'a Script, ) -> Result<RV, RedisError>
where RV: FromRedisValue,

Load a script. Read more
Source§

fn invoke_script<'a, RV>( &'a mut self, invocation: &'a ScriptInvocation<'a>, ) -> Result<RV, RedisError>
where RV: FromRedisValue,

Invoke a prepared script. Read more
Source§

fn flushall<'a>(&'a mut self) -> Result<(), RedisError>

Deletes all the keys of all databases Read more
Source§

fn flushall_options<'a>( &'a mut self, options: &'a FlushAllOptions, ) -> Result<(), RedisError>

Deletes all the keys of all databases with options Read more
Source§

fn flushdb<'a>(&'a mut self) -> Result<(), RedisError>

Deletes all the keys of the current database Read more
Source§

fn flushdb_options<'a>( &'a mut self, options: &'a FlushAllOptions, ) -> Result<(), RedisError>

Deletes all the keys of the current database with options Read more
Source§

fn scan<RV>(&mut self) -> Result<Iter<'_, RV>, RedisError>
where RV: FromRedisValue,

Incrementally iterate the keys space.
Source§

fn scan_options<RV>( &mut self, opts: ScanOptions, ) -> Result<Iter<'_, RV>, RedisError>
where RV: FromRedisValue,

Incrementally iterate the keys space with options.
Source§

fn scan_match<P, RV>(&mut self, pattern: P) -> Result<Iter<'_, RV>, RedisError>
where P: ToSingleRedisArg, 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: ToSingleRedisArg, 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: ToSingleRedisArg, P: ToSingleRedisArg, 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: ToSingleRedisArg, 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: ToSingleRedisArg, P: ToSingleRedisArg, 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: ToSingleRedisArg, 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: ToSingleRedisArg, P: ToSingleRedisArg, RV: FromRedisValue,

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

fn get_int<K>(&mut self, key: K) -> Result<Option<isize>, RedisError>
where K: ToSingleRedisArg,

Get a value from Redis and convert it to an Option<isize>.
Source§

fn mget_ints<K>(&mut self, key: K) -> Result<Vec<Option<isize>>, RedisError>
where K: ToRedisArgs,

Get values from Redis and convert them to Option<isize>s.
Source§

impl<Changes, Output, Conn> UpdateAndFetchResults<Changes, Output> for Conn
where Conn: DerefMut + Send, Changes: Identifiable + HasTable + Send, <Conn as Deref>::Target: UpdateAndFetchResults<Changes, Output>,

Source§

fn update_and_fetch<'conn, 'changes>( &'conn mut self, changeset: Changes, ) -> Pin<Box<dyn Future<Output = Result<Output, Error>> + Send + 'changes>>
where 'conn: 'changes, Changes: 'changes, Conn: 'changes,

See the traits documentation.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WindowExpressionMethods for T

Source§

fn over(self) -> Self::Output
where Self: OverDsl,

Turn a function call into a window function call Read more
Source§

fn window_filter<P>(self, f: P) -> Self::Output
where P: AsExpression<Bool>, Self: FilterDsl<<P as AsExpression<Bool>>::Expression>,

Add a filter to the current window function Read more
Source§

fn partition_by<E>(self, expr: E) -> Self::Output
where Self: PartitionByDsl<E>,

Add a partition clause to the current window function Read more
Source§

fn window_order<E>(self, expr: E) -> Self::Output
where Self: OrderWindowDsl<E>,

Add a order clause to the current window function Read more
Source§

fn frame_by<E>(self, expr: E) -> Self::Output
where Self: FrameDsl<E>,

Add a frame clause to the current window function Read more
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