Struct poem::web::Query

source ·
pub struct Query<T>(pub T);
Expand description

An extractor that can deserialize some type from query string.

§Errors

§Example

use poem::{
    get, handler,
    http::{Method, StatusCode, Uri},
    test::TestClient,
    web::Query,
    Endpoint, Request, Route,
};
use serde::Deserialize;

#[derive(Deserialize)]
struct CreateDocument {
    title: String,
    content: String,
}

#[handler]
fn index(Query(CreateDocument { title, content }): Query<CreateDocument>) -> String {
    format!("{}:{}", title, content)
}

let app = Route::new().at("/", get(index).post(index));
let cli = TestClient::new(app);

let resp = cli
    .get("/")
    .query("title", &"foo")
    .query("content", &"bar")
    .send()
    .await;
resp.assert_status_is_ok();
resp.assert_text("foo:bar").await;

Tuple Fields§

§0: T

Trait Implementations§

source§

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

source§

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

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

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

Performs copy-assignment from source. Read more
source§

impl<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>

§

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<'a, T: DeserializeOwned> FromRequest<'a> for Query<T>

source§

async fn from_request(req: &'a Request, _body: &mut RequestBody) -> Result<Self>

Extract from request head and body.
source§

fn from_request_without_body( req: &'a Request ) -> impl Future<Output = Result<Self>> + Send

Extract from request head. Read more
source§

impl<T: PartialEq> PartialEq for Query<T>

source§

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

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<T: Eq> Eq for Query<T>

source§

impl<T> StructuralPartialEq for Query<T>

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

§

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> AnyEq for T
where T: Any + PartialEq,

source§

fn equals(&self, other: &(dyn Any + 'static)) -> bool

source§

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

source§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

source§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

source§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

source§

fn implicit( self, class: Class, constructed: bool, tag: u32 ) -> TaggedParser<'a, Implicit, Self, E>

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

Checks if this value is equivalent to the given key. Read more
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<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> FutureExt for T

source§

fn with_context(self, otel_cx: Context) -> WithContext<Self>

Attaches the provided Context to this type, returning a WithContext wrapper. Read more
source§

fn with_current_context(self) -> WithContext<Self>

Attaches the current Context to this type, returning a WithContext wrapper. Read more
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> Same for T

§

type Output = T

Should always be Self
source§

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

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

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

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

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

impl<T> TowerCompatExt for T

source§

fn compat<ResBody, Err, Fut>(self) -> TowerCompatEndpoint<Self>
where ResBody: Body + Send + Sync + 'static, ResBody::Data: Into<Bytes> + Send + 'static, ResBody::Error: StdError + Send + Sync + 'static, Err: Into<Error>, Self: Service<Request<BoxBody<Bytes, Error>>, Response = Response<ResBody>, Error = Err, Future = Fut> + Clone + Send + Sync + Sized + 'static, Fut: Future<Output = Result<Response<ResBody>, Err>> + Send + 'static,

Available on crate feature tower-compat only.
Converts a tower service to a poem endpoint.
source§

impl<L> TowerLayerCompatExt for L

source§

fn compat(self) -> TowerCompatMiddleware<Self>
where Self: Sized,

Available on crate feature tower-compat only.
Converts a tower layer to a poem middleware.
source§

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

§

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

§

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<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

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