Struct Form

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

URL encoded payload extractor and responder.

Form has two uses: URL encoded responses, and extracting typed data from URL request payloads.

ยงExtractor

To extract typed data from a request body, the inner type T must implement the DeserializeOwned trait.

Use FormConfig to configure extraction options.

ยงExamples

use actix_web::{post, web};
use serde::Deserialize;

#[derive(Deserialize)]
struct Info {
    name: String,
}

// This handler is only called if:
// - request headers declare the content type as `application/x-www-form-urlencoded`
// - request payload deserializes into an `Info` struct from the URL encoded format
#[post("/")]
async fn index(web::Form(form): web::Form<Info>) -> String {
    format!("Welcome {}!", form.name)
}

ยงResponder

The Form type also allows you to create URL encoded responses by returning a value of type Form<T> where T is the type to be URL encoded, as long as T implements Serialize.

ยงExamples

use actix_web::{get, web};
use serde::Serialize;

#[derive(Serialize)]
struct SomeForm {
    name: String,
    age: u8
}

// Response will have:
// - status: 200 OK
// - header: `Content-Type: application/x-www-form-urlencoded`
// - body: `name=actix&age=123`
#[get("/")]
async fn index() -> web::Form<SomeForm> {
    web::Form(SomeForm {
        name: "actix".to_owned(),
        age: 123
    })
}

ยงPanics

URL encoded forms consist of unordered key=value pairs, therefore they cannot be decoded into any type which depends upon data ordering (eg. tuples). Trying to do so will result in a panic.

Tuple Fieldsยง

ยง0: T

Implementationsยง

Sourceยง

impl<T> Form<T>

Source

pub fn into_inner(self) -> T

Unwrap into inner T value.

Trait Implementationsยง

Sourceยง

impl<T> CsrfGuarded for Form<T>
where T: CsrfGuarded,

Sourceยง

fn csrf_token(&self) -> &CsrfToken

Retrieves the CSRF token from the struct.
Sourceยง

impl<T> Debug for Form<T>
where T: Debug,

Sourceยง

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

Formats the value using the given formatter. Read more
Sourceยง

impl<T> DerefMut for Form<T>

Sourceยง

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

Mutably dereferences the value.
Sourceยง

impl<T> Display for Form<T>
where T: Display,

Sourceยง

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

Formats the value using the given formatter. Read more
Sourceยง

impl<T> FromRequest for Form<T>
where T: DeserializeOwned + 'static,

See here for example of usage as an extractor.

Sourceยง

type Error = Error

The associated error which can be returned.
Sourceยง

type Future = FormExtractFut<T>

Future that resolves to a Self. Read more
Sourceยง

fn from_request( req: &HttpRequest, payload: &mut Payload, ) -> <Form<T> as FromRequest>::Future

Create a Self from request parts asynchronously.
Sourceยง

fn extract(req: &HttpRequest) -> Self::Future

Create a Self from request head asynchronously. Read more
Sourceยง

impl<T> Ord for Form<T>
where T: Ord,

Sourceยง

fn cmp(&self, other: &Form<T>) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 ยท Sourceยง

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 ยท Sourceยง

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 ยท Sourceยง

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized,

Restrict a value to a certain interval. Read more
Sourceยง

impl<T> PartialEq for Form<T>
where T: PartialEq,

Sourceยง

fn eq(&self, other: &Form<T>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 ยท Sourceยง

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Sourceยง

impl<T> PartialOrd for Form<T>
where T: PartialOrd,

Sourceยง

fn partial_cmp(&self, other: &Form<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 ยท Sourceยง

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 ยท Sourceยง

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 ยท Sourceยง

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 ยท Sourceยง

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
Sourceยง

impl<T> Responder for Form<T>
where T: Serialize,

See here for example of usage as a handler return type.

Sourceยง

type Body = EitherBody<String>

Sourceยง

fn respond_to( self, _: &HttpRequest, ) -> HttpResponse<<Form<T> as Responder>::Body>

Convert self to HttpResponse.
Sourceยง

fn customize(self) -> CustomizeResponder<Self>
where Self: Sized,

Wraps responder to allow alteration of its response. Read more
Sourceยง

impl<T> Serialize for Form<T>
where T: Serialize,

Sourceยง

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where S: Serializer,

Serialize this value into the given Serde serializer. Read more
Sourceยง

impl<T> Deref for Form<T>

Sourceยง

type Target = T

The resulting type after dereferencing.
Sourceยง

fn deref(&self) -> &T

Dereferences the value.
Sourceยง

impl<T> Eq for Form<T>
where T: Eq,

Sourceยง

impl<T> StructuralPartialEq for Form<T>

Auto Trait Implementationsยง

ยง

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

ยง

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

ยง

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

ยง

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

ยง

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

ยง

impl<T> UnwindSafe for Form<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> Any for T
where T: 'static + ?Sized,

Sourceยง

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
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<T> Commands for T
where T: ConnectionLike,

Sourceยง

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

Get the value of a key. If key is a vec this becomes an MGET.
Sourceยง

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

Get values of keys
Sourceยง

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

Gets all keys matching pattern
Sourceยง

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

Set the string value of a key.
Sourceยง

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

Set the string value of a key with options.
Sourceยง

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

๐Ÿ‘ŽDeprecated since 0.22.4: Renamed to mset() to reflect Redis name
Sets multiple keys to their values.
Sourceยง

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

Sets multiple keys to their values.
Sourceยง

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

Set the value and expiration of a key.
Sourceยง

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

Set the value and expiration in milliseconds of a key.
Sourceยง

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

Set the value of a key, only if the key does not exist
Sourceยง

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

Sets multiple keys to their values failing if at least one already exists.
Sourceยง

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

Set the string value of a key and return its old value.
Sourceยง

fn getrange<'a, K, RV>( &mut self, key: K, from: isize, to: isize, ) -> Result<RV, RedisError>

Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.
Sourceยง

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

Overwrite the part of the value stored in key at the specified offset.
Sourceยง

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

Delete one or more keys.
Sourceยง

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

Determine if a key exists.
Sourceยง

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

Determine the type of a key.
Sourceยง

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

Set a keyโ€™s time to live in seconds.
Sourceยง

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

Set the expiration for a key as a UNIX timestamp.
Sourceยง

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

Set a keyโ€™s time to live in milliseconds.
Sourceยง

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

Set the expiration for a key as a UNIX timestamp in milliseconds.
Sourceยง

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

Remove the expiration from a key.
Sourceยง

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

Get the expiration time of a key.
Sourceยง

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

Get the expiration time of a key in milliseconds.
Sourceยง

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

Get the value of a key and set expiration
Sourceยง

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

Get the value of a key and delete it
Sourceยง

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

Rename a key.
Sourceยง

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

Rename a key, only if the new key does not exist.
Unlink one or more keys.
Sourceยง

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

Append a value to a key.
Sourceยง

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

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type.
Sourceยง

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

Decrement the numeric value of a key by the given amount.
Sourceยง

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

Sets or clears the bit at offset in the string value stored at key.
Sourceยง

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

Returns the bit value at offset in the string value stored at key.
Sourceยง

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

Count set bits in a string.
Sourceยง

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

Count set bits in a string in a range.
Sourceยง

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

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

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

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

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

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

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

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key.
Sourceยง

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

Get the length of the value stored in a key.
Sourceยง

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

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

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

Deletes a single (or multiple) fields from a hash.
Sourceยง

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

Sets a single field in a hash.
Sourceยง

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

Sets a single field in a hash if it does not exist.
Sourceยง

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

Sets a multiple fields in a hash.
Sourceยง

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

Increments a value.
Sourceยง

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

Checks if a field in a hash exists.
Sourceยง

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

Gets all the keys in a hash.
Sourceยง

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

Gets all the values in a hash.
Sourceยง

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

Gets all the fields and values in a hash.
Sourceยง

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

Gets the length of a hash.
Sourceยง

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

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

fn blmpop<'a, K, RV>( &mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Result<RV, RedisError>

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

fn blpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>

Remove and get the first element in a list, or block until one is available.
Sourceยง

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

Remove and get the last element in a list, or block until one is available.
Sourceยง

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

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

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

Get an element from a list by its index.
Sourceยง

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

Insert an element before another element in a list.
Sourceยง

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

Insert an element after another element in a list.
Sourceยง

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

Returns the length of the list stored at key.
Sourceยง

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

Pop an element a list, push it to another list and return it
Sourceยง

fn lmpop<'a, K, RV>( &mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Result<RV, RedisError>

Pops count elements from the first non-empty list key from the list of provided key names.
Sourceยง

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

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>

Returns the index of the first matching value of the list stored at key.
Sourceยง

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

Insert all the specified values at the head of the list stored at key.
Sourceยง

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

Inserts a value at the head of the list stored at key, only if key already exists and holds a list.
Sourceยง

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

Returns the specified elements of the list stored at key.
Sourceยง

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

Removes the first count occurrences of elements equal to value from the list stored at key.
Sourceยง

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

Trim an existing list so that it will contain only the specified range of elements specified.
Sourceยง

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

Sets the list element at index to value
Sourceยง

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

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>

Pop a value from a list, push it to another list and return it.
Sourceยง

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

Insert all the specified values at the tail of the list stored at key.
Sourceยง

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

Inserts value at the tail of the list stored at key, only if key already exists and holds a list.
Sourceยง

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

Add one or more members to a set.
Sourceยง

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

Get the number of members in a set.
Sourceยง

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

Subtract multiple sets.
Sourceยง

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

Subtract multiple sets and store the resulting set in a key.
Sourceยง

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

Intersect multiple sets.
Sourceยง

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

Intersect multiple sets and store the resulting set in a key.
Sourceยง

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

Determine if a given value is a member of a set.
Sourceยง

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

Get all the members in a set.
Sourceยง

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

Move a member from one set to another.
Sourceยง

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

Remove and return a random member from a set.
Sourceยง

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

Get one random member from a set.
Sourceยง

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

Get multiple random members from a set.
Sourceยง

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

Remove one or more members from a set.
Sourceยง

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

Add multiple sets.
Sourceยง

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

Add multiple sets and store the resulting set in a key.
Sourceยง

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

Add one member to a sorted set, or update its score if it already exists.
Sourceยง

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

Add multiple members to a sorted set, or update its score if it already exists.
Sourceยง

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

Get the number of members in a sorted set.
Sourceยง

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

Count the members in a sorted set with scores within the given values.
Sourceยง

fn zincr<'a, K, M, D, RV>( &mut self, key: K, member: M, delta: D, ) -> Result<RV, RedisError>

Increments the member in a sorted set at key by delta. If the member does not exist, it is added with delta as its score.
Sourceยง

fn zinterstore<'a, D, K, RV>( &mut self, dstkey: D, keys: &'a [K], ) -> Result<RV, RedisError>

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

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

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

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

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

fn zinterstore_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

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

fn zinterstore_min_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zinterstore_min, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

fn zinterstore_max_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zinterstore_max, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

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

Count the number of members in a sorted set between a given lexicographical range.
Sourceยง

fn bzpopmax<'a, K, RV>( &mut self, key: K, timeout: f64, ) -> Result<RV, RedisError>

Removes and returns the member with the highest score in a sorted set. Blocks until a member is available otherwise.
Sourceยง

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

Removes and returns up to count members with the highest scores in a sorted set
Sourceยง

fn bzpopmin<'a, K, RV>( &mut self, key: K, timeout: f64, ) -> Result<RV, RedisError>

Removes and returns the member with the lowest score in a sorted set. Blocks until a member is available otherwise.
Sourceยง

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

Removes and returns up to count members with the lowest scores in a sorted set
Sourceยง

fn bzmpop_max<'a, K, RV>( &mut self, timeout: f64, keys: &'a [K], count: isize, ) -> Result<RV, RedisError>

Removes and returns up to count members with the highest scores, from the first non-empty sorted set in the provided list of key names. Blocks until a member is available otherwise.
Sourceยง

fn zmpop_max<'a, K, RV>( &mut self, keys: &'a [K], count: isize, ) -> Result<RV, RedisError>

Removes and returns up to count members with the highest scores, from the first non-empty sorted set in the provided list of key names.
Sourceยง

fn bzmpop_min<'a, K, RV>( &mut self, timeout: f64, keys: &'a [K], count: isize, ) -> Result<RV, RedisError>

Removes and returns up to count members with the lowest scores, from the first non-empty sorted set in the provided list of key names. Blocks until a member is available otherwise.
Sourceยง

fn zmpop_min<'a, K, RV>( &mut self, keys: &'a [K], count: isize, ) -> Result<RV, RedisError>

Removes and returns up to count members with the lowest scores, from the first non-empty sorted set in the provided list of key names.
Sourceยง

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

Return up to count random members in a sorted set (or 1 if count == None)
Sourceยง

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

Return up to count random members in a sorted set with scores
Sourceยง

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

Return a range of members in a sorted set, by index
Sourceยง

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

Return a range of members in a sorted set, by index with scores.
Sourceยง

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

Return a range of members in a sorted set, by lexicographical range.
Sourceยง

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

Return a range of members in a sorted set, by lexicographical range with offset and limit.
Sourceยง

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

Return a range of members in a sorted set, by lexicographical range.
Sourceยง

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

Return a range of members in a sorted set, by lexicographical range with offset and limit.
Sourceยง

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

Return a range of members in a sorted set, by score.
Sourceยง

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

Return a range of members in a sorted set, by score with scores.
Sourceยง

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

Return a range of members in a sorted set, by score with limit.
Sourceยง

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

Return a range of members in a sorted set, by score with limit with scores.
Sourceยง

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

Determine the index of a member in a sorted set.
Sourceยง

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

Remove one or more members from a sorted set.
Sourceยง

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

Remove all members in a sorted set between the given lexicographical range.
Sourceยง

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

Remove all members in a sorted set within the given indexes.
Sourceยง

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

Remove all members in a sorted set within the given scores.
Sourceยง

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

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

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

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

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

Return a range of members in a sorted set, by score.
Sourceยง

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

Return a range of members in a sorted set, by score with scores.
Sourceยง

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

Return a range of members in a sorted set, by score with limit.
Sourceยง

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

Return a range of members in a sorted set, by score with limit with scores.
Sourceยง

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

Determine the index of a member in a sorted set, with scores ordered from high to low.
Sourceยง

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

Get the score associated with the given member in a sorted set.
Sourceยง

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

Get the scores associated with multiple members in a sorted set.
Sourceยง

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

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

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

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

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

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

fn zunionstore_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zunionstore, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

fn zunionstore_min_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zunionstore_min, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

fn zunionstore_max_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zunionstore_max, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

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

Adds the specified elements to the specified HyperLogLog.
Sourceยง

fn pfcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>

Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).
Sourceยง

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

Merge N different HyperLogLogs into a single one.
Sourceยง

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

Posts a message to the given channel.
Sourceยง

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

Returns the encoding of a key.
Sourceยง

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

Returns the time in seconds since the last access of a key.
Sourceยง

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

Returns the logarithmic access frequency counter of a key.
Sourceยง

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

Returns the reference count of a key.
Sourceยง

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

This is the reverse version of xrange_all. The same rules apply for start and end here. Read more
Sourceยง

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

Incrementally iterate the keys space.
Sourceยง

fn scan_match<P, RV>(&mut self, pattern: P) -> Result<Iter<'_, RV>, RedisError>

Incrementally iterate the keys space for keys matching a pattern.
Sourceยง

fn hscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>

Incrementally iterate hash fields and associated values.
Sourceยง

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

Incrementally iterate hash fields and associated values for field names matching a pattern.
Sourceยง

fn sscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>

Incrementally iterate set elements.
Sourceยง

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

Incrementally iterate set elements for elements matching a pattern.
Sourceยง

fn zscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>

Incrementally iterate sorted set elements.
Sourceยง

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

Incrementally iterate sorted set elements for elements matching a pattern.
Sourceยง

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

Sourceยง

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

Get the value of a key. If key is a vec this becomes an MGET.
Sourceยง

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

Get values of keys
Sourceยง

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

Gets all keys matching pattern
Sourceยง

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

Set the string value of a key.
Sourceยง

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

Set the string value of a key with options.
Sourceยง

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

๐Ÿ‘ŽDeprecated since 0.22.4: Renamed to mset() to reflect Redis name
Sets multiple keys to their values.
Sourceยง

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

Sets multiple keys to their values.
Sourceยง

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

Set the value and expiration of a key.
Sourceยง

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

Set the value and expiration in milliseconds of a key.
Sourceยง

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

Set the value of a key, only if the key does not exist
Sourceยง

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

Sets multiple keys to their values failing if at least one already exists.
Sourceยง

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

Set the string value of a key and return its old value.
Sourceยง

fn getrange<'a, K, RV>( &mut self, key: K, from: isize, to: isize, ) -> Result<RV, RedisError>

Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.
Sourceยง

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

Overwrite the part of the value stored in key at the specified offset.
Sourceยง

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

Delete one or more keys.
Sourceยง

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

Determine if a key exists.
Sourceยง

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

Determine the type of a key.
Sourceยง

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

Set a keyโ€™s time to live in seconds.
Sourceยง

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

Set the expiration for a key as a UNIX timestamp.
Sourceยง

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

Set a keyโ€™s time to live in milliseconds.
Sourceยง

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

Set the expiration for a key as a UNIX timestamp in milliseconds.
Sourceยง

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

Remove the expiration from a key.
Sourceยง

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

Get the expiration time of a key.
Sourceยง

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

Get the expiration time of a key in milliseconds.
Sourceยง

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

Get the value of a key and set expiration
Sourceยง

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

Get the value of a key and delete it
Sourceยง

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

Rename a key.
Sourceยง

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

Rename a key, only if the new key does not exist.
Unlink one or more keys.
Sourceยง

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

Append a value to a key.
Sourceยง

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

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type.
Sourceยง

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

Decrement the numeric value of a key by the given amount.
Sourceยง

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

Sets or clears the bit at offset in the string value stored at key.
Sourceยง

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

Returns the bit value at offset in the string value stored at key.
Sourceยง

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

Count set bits in a string.
Sourceยง

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

Count set bits in a string in a range.
Sourceยง

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

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

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

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

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

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

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

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key.
Sourceยง

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

Get the length of the value stored in a key.
Sourceยง

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

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

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

Deletes a single (or multiple) fields from a hash.
Sourceยง

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

Sets a single field in a hash.
Sourceยง

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

Sets a single field in a hash if it does not exist.
Sourceยง

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

Sets a multiple fields in a hash.
Sourceยง

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

Increments a value.
Sourceยง

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

Checks if a field in a hash exists.
Sourceยง

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

Gets all the keys in a hash.
Sourceยง

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

Gets all the values in a hash.
Sourceยง

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

Gets all the fields and values in a hash.
Sourceยง

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

Gets the length of a hash.
Sourceยง

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

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

fn blmpop<'a, K, RV>( &mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Result<RV, RedisError>

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

fn blpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>

Remove and get the first element in a list, or block until one is available.
Sourceยง

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

Remove and get the last element in a list, or block until one is available.
Sourceยง

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

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

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

Get an element from a list by its index.
Sourceยง

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

Insert an element before another element in a list.
Sourceยง

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

Insert an element after another element in a list.
Sourceยง

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

Returns the length of the list stored at key.
Sourceยง

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

Pop an element a list, push it to another list and return it
Sourceยง

fn lmpop<'a, K, RV>( &mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Result<RV, RedisError>

Pops count elements from the first non-empty list key from the list of provided key names.
Sourceยง

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

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>

Returns the index of the first matching value of the list stored at key.
Sourceยง

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

Insert all the specified values at the head of the list stored at key.
Sourceยง

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

Inserts a value at the head of the list stored at key, only if key already exists and holds a list.
Sourceยง

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

Returns the specified elements of the list stored at key.
Sourceยง

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

Removes the first count occurrences of elements equal to value from the list stored at key.
Sourceยง

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

Trim an existing list so that it will contain only the specified range of elements specified.
Sourceยง

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

Sets the list element at index to value
Sourceยง

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

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>

Pop a value from a list, push it to another list and return it.
Sourceยง

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

Insert all the specified values at the tail of the list stored at key.
Sourceยง

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

Inserts value at the tail of the list stored at key, only if key already exists and holds a list.
Sourceยง

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

Add one or more members to a set.
Sourceยง

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

Get the number of members in a set.
Sourceยง

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

Subtract multiple sets.
Sourceยง

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

Subtract multiple sets and store the resulting set in a key.
Sourceยง

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

Intersect multiple sets.
Sourceยง

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

Intersect multiple sets and store the resulting set in a key.
Sourceยง

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

Determine if a given value is a member of a set.
Sourceยง

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

Determine if given values are members of a set.
Sourceยง

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

Get all the members in a set.
Sourceยง

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

Move a member from one set to another.
Sourceยง

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

Remove and return a random member from a set.
Sourceยง

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

Get one random member from a set.
Sourceยง

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

Get multiple random members from a set.
Sourceยง

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

Remove one or more members from a set.
Sourceยง

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

Add multiple sets.
Sourceยง

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

Add multiple sets and store the resulting set in a key.
Sourceยง

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

Add one member to a sorted set, or update its score if it already exists.
Sourceยง

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

Add multiple members to a sorted set, or update its score if it already exists.
Sourceยง

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

Get the number of members in a sorted set.
Sourceยง

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

Count the members in a sorted set with scores within the given values.
Sourceยง

fn zincr<'a, K, M, D, RV>( &mut self, key: K, member: M, delta: D, ) -> Result<RV, RedisError>

Increments the member in a sorted set at key by delta. If the member does not exist, it is added with delta as its score.
Sourceยง

fn zinterstore<'a, D, K, RV>( &mut self, dstkey: D, keys: &'a [K], ) -> Result<RV, RedisError>

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

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

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

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

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

fn zinterstore_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

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

fn zinterstore_min_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zinterstore_min, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

fn zinterstore_max_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zinterstore_max, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

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

Count the number of members in a sorted set between a given lexicographical range.
Sourceยง

fn bzpopmax<'a, K, RV>( &mut self, key: K, timeout: f64, ) -> Result<RV, RedisError>

Removes and returns the member with the highest score in a sorted set. Blocks until a member is available otherwise.
Sourceยง

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

Removes and returns up to count members with the highest scores in a sorted set
Sourceยง

fn bzpopmin<'a, K, RV>( &mut self, key: K, timeout: f64, ) -> Result<RV, RedisError>

Removes and returns the member with the lowest score in a sorted set. Blocks until a member is available otherwise.
Sourceยง

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

Removes and returns up to count members with the lowest scores in a sorted set
Sourceยง

fn bzmpop_max<'a, K, RV>( &mut self, timeout: f64, keys: &'a [K], count: isize, ) -> Result<RV, RedisError>

Removes and returns up to count members with the highest scores, from the first non-empty sorted set in the provided list of key names. Blocks until a member is available otherwise.
Sourceยง

fn zmpop_max<'a, K, RV>( &mut self, keys: &'a [K], count: isize, ) -> Result<RV, RedisError>

Removes and returns up to count members with the highest scores, from the first non-empty sorted set in the provided list of key names.
Sourceยง

fn bzmpop_min<'a, K, RV>( &mut self, timeout: f64, keys: &'a [K], count: isize, ) -> Result<RV, RedisError>

Removes and returns up to count members with the lowest scores, from the first non-empty sorted set in the provided list of key names. Blocks until a member is available otherwise.
Sourceยง

fn zmpop_min<'a, K, RV>( &mut self, keys: &'a [K], count: isize, ) -> Result<RV, RedisError>

Removes and returns up to count members with the lowest scores, from the first non-empty sorted set in the provided list of key names.
Sourceยง

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

Return up to count random members in a sorted set (or 1 if count == None)
Sourceยง

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

Return up to count random members in a sorted set with scores
Sourceยง

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

Return a range of members in a sorted set, by index
Sourceยง

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

Return a range of members in a sorted set, by index with scores.
Sourceยง

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

Return a range of members in a sorted set, by lexicographical range.
Sourceยง

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

Return a range of members in a sorted set, by lexicographical range with offset and limit.
Sourceยง

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

Return a range of members in a sorted set, by lexicographical range.
Sourceยง

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

Return a range of members in a sorted set, by lexicographical range with offset and limit.
Sourceยง

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

Return a range of members in a sorted set, by score.
Sourceยง

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

Return a range of members in a sorted set, by score with scores.
Sourceยง

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

Return a range of members in a sorted set, by score with limit.
Sourceยง

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

Return a range of members in a sorted set, by score with limit with scores.
Sourceยง

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

Determine the index of a member in a sorted set.
Sourceยง

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

Remove one or more members from a sorted set.
Sourceยง

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

Remove all members in a sorted set between the given lexicographical range.
Sourceยง

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

Remove all members in a sorted set within the given indexes.
Sourceยง

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

Remove all members in a sorted set within the given scores.
Sourceยง

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

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

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

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

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

Return a range of members in a sorted set, by score.
Sourceยง

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

Return a range of members in a sorted set, by score with scores.
Sourceยง

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

Return a range of members in a sorted set, by score with limit.
Sourceยง

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

Return a range of members in a sorted set, by score with limit with scores.
Sourceยง

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

Determine the index of a member in a sorted set, with scores ordered from high to low.
Sourceยง

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

Get the score associated with the given member in a sorted set.
Sourceยง

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

Get the scores associated with multiple members in a sorted set.
Sourceยง

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

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

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

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

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

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

fn zunionstore_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zunionstore, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

fn zunionstore_min_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zunionstore_min, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

fn zunionstore_max_weights<'a, D, K, W, RV>( &mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<RV, RedisError>

Commands::zunionstore_max, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple.
Sourceยง

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

Adds the specified elements to the specified HyperLogLog.
Sourceยง

fn pfcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>

Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).
Sourceยง

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

Merge N different HyperLogLogs into a single one.
Sourceยง

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

Posts a message to the given channel.
Sourceยง

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

Returns the encoding of a key.
Sourceยง

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

Returns the time in seconds since the last access of a key.
Sourceยง

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

Returns the logarithmic access frequency counter of a key.
Sourceยง

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

Returns the reference count of a key.
Sourceยง

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

When Redis is configured to use an ACL file (with the aclfile configuration option), this command will reload the ACLs from the file, replacing all the current ACL rules with the ones defined in the file.
Sourceยง

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

When Redis is configured to use an ACL file (with the aclfile configuration option), this command will save the currently defined ACLs from the server memory to the ACL file.
Sourceยง

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

Shows the currently active ACL rules in the Redis server.
Sourceยง

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

Shows a list of all the usernames of the currently configured users in the Redis ACL system.
Sourceยง

fn acl_getuser<'a, K, RV>(&mut self, username: K) -> Result<RV, RedisError>

Returns all the rules defined for an existing ACL user.
Sourceยง

fn acl_setuser<'a, K, RV>(&mut self, username: K) -> Result<RV, RedisError>

Creates an ACL user without any privilege.
Sourceยง

fn acl_setuser_rules<'a, K, RV>( &mut self, username: K, rules: &'a [Rule], ) -> Result<RV, RedisError>

Creates an ACL user with the specified rules or modify the rules of an existing user.
Sourceยง

fn acl_deluser<'a, K, RV>( &mut self, usernames: &'a [K], ) -> Result<RV, RedisError>

Delete all the specified ACL users and terminate all the connections that are authenticated with such users.
Sourceยง

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

Shows the available ACL categories.
Sourceยง

fn acl_cat_categoryname<'a, K, RV>( &mut self, categoryname: K, ) -> Result<RV, RedisError>

Shows all the Redis commands in the specified category.
Sourceยง

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

Generates a 256-bits password starting from /dev/urandom if available.
Sourceยง

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

Generates a 1-to-1024-bits password starting from /dev/urandom if available.
Sourceยง

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

Returns the username the current connection is authenticated with.
Sourceยง

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

Shows a list of recent ACL security events
Sourceยง

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

Clears the ACL log.
Sourceยง

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

Returns a helpful text describing the different subcommands.
Sourceยง

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

Adds the specified geospatial items to the specified key. Read more
Sourceยง

fn geo_dist<'a, K, M1, M2, RV>( &mut self, key: K, member1: M1, member2: M2, unit: Unit, ) -> Result<RV, RedisError>

Return the distance between two members in the geospatial index represented by the sorted set. Read more
Sourceยง

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

Return valid Geohash strings representing the position of one or more members of the geospatial index represented by the sorted set at key. Read more
Sourceยง

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

Return the positions of all the specified members of the geospatial index represented by the sorted set at key. Read more
Sourceยง

fn geo_radius<'a, K, RV>( &mut self, key: K, longitude: f64, latitude: f64, radius: f64, unit: Unit, options: RadiusOptions, ) -> Result<RV, RedisError>

Return the members of a sorted set populated with geospatial information using geo_add, which are within the borders of the area specified with the center location and the maximum distance from the center (the radius). Read more
Sourceยง

fn geo_radius_by_member<'a, K, M, RV>( &mut self, key: K, member: M, radius: f64, unit: Unit, options: RadiusOptions, ) -> Result<RV, RedisError>

Retrieve members selected by distance with the center of member. The member itself is always contained in the results.
Sourceยง

fn xack<'a, K, G, I, RV>( &mut self, key: K, group: G, ids: &'a [I], ) -> Result<RV, RedisError>

Ack pending stream messages checked out by a consumer. Read more
Sourceยง

fn xadd<'a, K, ID, F, V, RV>( &mut self, key: K, id: ID, items: &'a [(F, V)], ) -> Result<RV, RedisError>

Add a stream message by key. Use * as the id for the current timestamp. Read more
Sourceยง

fn xadd_map<'a, K, ID, BTM, RV>( &mut self, key: K, id: ID, map: BTM, ) -> Result<RV, RedisError>

BTreeMap variant for adding a stream message by key. Use * as the id for the current timestamp. Read more
Sourceยง

fn xadd_maxlen<'a, K, ID, F, V, RV>( &mut self, key: K, maxlen: StreamMaxlen, id: ID, items: &'a [(F, V)], ) -> Result<RV, RedisError>

Add a stream message while capping the stream at a maxlength. Read more
Sourceยง

fn xadd_maxlen_map<'a, K, ID, BTM, RV>( &mut self, key: K, maxlen: StreamMaxlen, id: ID, map: BTM, ) -> Result<RV, RedisError>

BTreeMap variant for adding a stream message while capping the stream at a maxlength. Read more
Sourceยง

fn xclaim<'a, K, G, C, MIT, ID, RV>( &mut self, key: K, group: G, consumer: C, min_idle_time: MIT, ids: &'a [ID], ) -> Result<RV, RedisError>

Claim pending, unacked messages, after some period of time, currently checked out by another consumer. Read more
Sourceยง

fn xclaim_options<'a, K, G, C, MIT, ID, RV>( &mut self, key: K, group: G, consumer: C, min_idle_time: MIT, ids: &'a [ID], options: StreamClaimOptions, ) -> Result<RV, RedisError>

This is the optional arguments version for claiming unacked, pending messages currently checked out by another consumer. Read more
Sourceยง

fn xdel<'a, K, ID, RV>( &mut self, key: K, ids: &'a [ID], ) -> Result<RV, RedisError>

Deletes a list of ids for a given stream key. Read more
Sourceยง

fn xgroup_create<'a, K, G, ID, RV>( &mut self, key: K, group: G, id: ID, ) -> Result<RV, RedisError>

This command is used for creating a consumer group. It expects the stream key to already exist. Otherwise, use xgroup_create_mkstream if it doesnโ€™t. The id is the starting message id all consumers should read from. Use $ If you want all consumers to read from the last message added to stream. Read more
Sourceยง

fn xgroup_create_mkstream<'a, K, G, ID, RV>( &mut self, key: K, group: G, id: ID, ) -> Result<RV, RedisError>

This is the alternate version for creating a consumer group which makes the stream if it doesnโ€™t exist. Read more
Sourceยง

fn xgroup_setid<'a, K, G, ID, RV>( &mut self, key: K, group: G, id: ID, ) -> Result<RV, RedisError>

Alter which id you want consumers to begin reading from an existing consumer group. Read more
Sourceยง

fn xgroup_destroy<'a, K, G, RV>( &mut self, key: K, group: G, ) -> Result<RV, RedisError>

Destroy an existing consumer group for a given stream key Read more
Sourceยง

fn xgroup_delconsumer<'a, K, G, C, RV>( &mut self, key: K, group: G, consumer: C, ) -> Result<RV, RedisError>

This deletes a consumer from an existing consumer group for given stream `key. Read more
Sourceยง

fn xinfo_consumers<'a, K, G, RV>( &mut self, key: K, group: G, ) -> Result<RV, RedisError>

This returns all info details about which consumers have read messages for given consumer group. Take note of the StreamInfoConsumersReply return type. Read more
Sourceยง

fn xinfo_groups<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>

Returns all consumer groups created for a given stream key. Take note of the StreamInfoGroupsReply return type. Read more
Sourceยง

fn xinfo_stream<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>

Returns info about high-level stream details (first & last message id, length, number of groups, etc.) Take note of the StreamInfoStreamReply return type. Read more
Sourceยง

fn xlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>

Returns the number of messages for a given stream key. Read more
Sourceยง

fn xpending<'a, K, G, RV>(&mut self, key: K, group: G) -> Result<RV, RedisError>

This is a basic version of making XPENDING command calls which only passes a stream key and consumer group and it returns details about which consumers have pending messages that havenโ€™t been acked. Read more
Sourceยง

fn xpending_count<'a, K, G, S, E, C, RV>( &mut self, key: K, group: G, start: S, end: E, count: C, ) -> Result<RV, RedisError>

This XPENDING version returns a list of all messages over the range. You can use this for paginating pending messages (but without the message HashMap). Read more
Sourceยง

fn xpending_consumer_count<'a, K, G, S, E, C, CN, RV>( &mut self, key: K, group: G, start: S, end: E, count: C, consumer: CN, ) -> Result<RV, RedisError>

An alternate version of xpending_count which filters by consumer name. Read more
Sourceยง

fn xrange<'a, K, S, E, RV>( &mut self, key: K, start: S, end: E, ) -> Result<RV, RedisError>

Returns a range of messages in a given stream key. Read more
Sourceยง

fn xrange_all<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>

A helper method for automatically returning all messages in a stream by key. Use with caution! Read more
Sourceยง

fn xrange_count<'a, K, S, E, C, RV>( &mut self, key: K, start: S, end: E, count: C, ) -> Result<RV, RedisError>

A method for paginating a stream by key. Read more
Sourceยง

fn xread<'a, K, ID, RV>( &mut self, keys: &'a [K], ids: &'a [ID], ) -> Result<RV, RedisError>

Read a list of ids for each stream key. This is the basic form of reading streams. For more advanced control, like blocking, limiting, or reading by consumer group, see xread_options. Read more
Sourceยง

fn xread_options<'a, K, ID, RV>( &mut self, keys: &'a [K], ids: &'a [ID], options: &'a StreamReadOptions, ) -> Result<RV, RedisError>

This method handles setting optional arguments for XREAD or XREADGROUP Redis commands. Read more
Sourceยง

fn xrevrange<'a, K, E, S, RV>( &mut self, key: K, end: E, start: S, ) -> Result<RV, RedisError>

This is the reverse version of xrange. The same rules apply for start and end here. Read more
Sourceยง

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

This is the reverse version of xrange_all. The same rules apply for start and end here. Read more
Sourceยง

fn xrevrange_count<'a, K, E, S, C, RV>( &mut self, key: K, end: E, start: S, count: C, ) -> Result<RV, RedisError>

This is the reverse version of xrange_count. The same rules apply for start and end here. Read more
Sourceยง

fn xtrim<'a, K, RV>( &mut self, key: K, maxlen: StreamMaxlen, ) -> Result<RV, RedisError>

Trim a stream key to a MAXLEN count. Read more
Sourceยง

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

Incrementally iterate the keys space.
Sourceยง

fn scan_match<P, RV>(&mut self, pattern: P) -> Result<Iter<'_, RV>, RedisError>

Incrementally iterate the keys space for keys matching a pattern.
Sourceยง

fn hscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>

Incrementally iterate hash fields and associated values.
Sourceยง

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

Incrementally iterate hash fields and associated values for field names matching a pattern.
Sourceยง

fn sscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>

Incrementally iterate set elements.
Sourceยง

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

Incrementally iterate set elements for elements matching a pattern.
Sourceยง

fn zscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>

Incrementally iterate sorted set elements.
Sourceยง

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

Incrementally iterate sorted set elements for elements matching a pattern.
Sourceยง

impl<Q, K> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

Sourceยง

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
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>

Sends multiple already encoded (packed) command into the TCP socket and reads count responses from it. This is used to implement pipelining.
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<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> Conv for T

Sourceยง

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
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<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Sourceยง

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Sourceยง

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Sourceยง

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Sourceยง

impl<T> FmtForward for T

Sourceยง

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
Sourceยง

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
Sourceยง

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
Sourceยง

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
Sourceยง

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
Sourceยง

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
Sourceยง

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
Sourceยง

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
Sourceยง

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
Sourceยง

impl<T> From<T> for T

Sourceยง

fn from(t: T) -> T

Returns the argument unchanged.

Sourceยง

impl<T> Instrument for T

Sourceยง

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

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Sourceยง

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Sourceยง

impl<T, U> Into<U> for 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> IntoEither for T

Sourceยง

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Sourceยง

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Sourceยง

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

Sourceยง

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
Sourceยง

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
Sourceยง

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
Sourceยง

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
Sourceยง

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
Sourceยง

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
Sourceยง

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
Sourceยง

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
Sourceยง

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
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<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, P> Resource for T
where T: DerefMut<Target = Path<P>>, P: ResourcePath,

Sourceยง

type Path = P

Type of resourceโ€™s path returned in resource_path.
Sourceยง

fn resource_path(&mut self) -> &mut Path<<T as Resource>::Path>

Sourceยง

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

Sourceยง

fn random<T>(&mut self) -> T

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

fn random_iter<T>(self) -> Iter<StandardUniform, Self, 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

๐Ÿ‘Ž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
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
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<T> Same for T

Sourceยง

type Output = T

Should always be Self
Sourceยง

impl<T> Tap for T

Sourceยง

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
Sourceยง

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
Sourceยง

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
Sourceยง

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
Sourceยง

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
Sourceยง

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
Sourceยง

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
Sourceยง

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
Sourceยง

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
Sourceยง

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
Sourceยง

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
Sourceยง

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
Sourceยง

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
Sourceยง

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
Sourceยง

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
Sourceยง

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
Sourceยง

impl<T> ToCompactString for T
where T: Display,

Sourceยง

fn to_compact_string(&self) -> CompactString

Converts the given value to a CompactString. Read more
Sourceยง

impl<T> ToString for T
where T: Display + ?Sized,

Sourceยง

fn to_string(&self) -> String

Converts the given value to a String. Read more
Sourceยง

impl<T> TryConv for T

Sourceยง

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
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> 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<V, T> VZip<V> for T
where V: MultiLane<T>,

Sourceยง

fn vzip(self) -> V

Sourceยง

impl<T> ValidateIp for T
where T: ToString,

Sourceยง

fn validate_ipv4(&self) -> bool

Validates whether the given string is an IP V4
Sourceยง

fn validate_ipv6(&self) -> bool

Validates whether the given string is an IP V6
Sourceยง

fn validate_ip(&self) -> bool

Validates whether the given string is an IP
Sourceยง

impl<T> ValidateIp for T
where T: ToString,

Sourceยง

fn validate_ipv4(&self) -> bool

Validates whether the given string is an IP V4
Sourceยง

fn validate_ipv6(&self) -> bool

Validates whether the given string is an IP V6
Sourceยง

fn validate_ip(&self) -> bool

Validates whether the given string is an IP
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
Sourceยง

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

Sourceยง

impl<T> DebugAny for T
where T: Any + Debug,

Sourceยง

impl<T> ErasedDestructor for T
where T: 'static,

Sourceยง

impl<T> Formattable for T
where T: Deref, <T as Deref>::Target: Formattable,

Sourceยง

impl<T> Parsable for T
where T: Deref, <T as Deref>::Target: Parsable,

Sourceยง

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

Sourceยง

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