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

Returns a copy of the value. Read more
Performs copy-assignment from source. Read more
Formats the value using the given formatter. Read more
Returns the “default value” for a type. Read more
The resulting type after dereferencing.
Dereferences the value.
Mutably dereferences the value.
Extract from request head and body.
This method tests for self and other values to be equal, and is used by ==. Read more
This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

Auto Trait Implementations

Blanket Implementations

A guard object containing the value and keeping it alive. Read more
The loading method. Read more
Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
Get the value of a key. If key is a vec this becomes an MGET.
Gets all keys matching pattern
Set the string value of a key.
Sets multiple keys to their values.
Set the value and expiration of a key.
Set the value and expiration in milliseconds of a key.
Set the value of a key, only if the key does not exist
Sets multiple keys to their values failing if at least one already exists.
Set the string value of a key and return its old value.
Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.
Overwrite the part of the value stored in key at the specified offset.
Delete one or more keys.
Determine if a key exists.
Set a key’s time to live in seconds.
Set the expiration for a key as a UNIX timestamp.
Set a key’s time to live in milliseconds.
Set the expiration for a key as a UNIX timestamp in milliseconds.
Remove the expiration from a key.
Get the expiration time of a key.
Get the expiration time of a key in milliseconds.
Get the value of a key and set expiration
Get the value of a key and delete it
Rename a key.
Rename a key, only if the new key does not exist.
Unlink one or more keys.
Append a value to a key.
Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type. Read more
Decrement the numeric value of a key by the given amount.
Sets or clears the bit at offset in the string value stored at key.
Returns the bit value at offset in the string value stored at key.
Count set bits in a string.
Count set bits in a string in a range.
Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Read more
Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Read more
Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Read more
Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Read more
Get the length of the value stored in a key.
Gets a single (or multiple) fields from a hash.
Deletes a single (or multiple) fields from a hash.
Sets a single field in a hash.
Sets a single field in a hash if it does not exist.
Sets a multiple fields in a hash.
Increments a value.
Checks if a field in a hash exists.
Gets all the keys in a hash.
Gets all the values in a hash.
Gets all the fields and values in a hash.
Gets the length of a hash.
Pop an element from a list, push it to another list and return it; or block until one is available Read more
Pops count elements from the first non-empty list key from the list of provided key names; or blocks until one is available. Read more
Remove and get the first element in a list, or block until one is available.
Remove and get the last element in a list, or block until one is available.
Pop a value from a list, push it to another list and return it; or block until one is available. Read more
Get an element from a list by its index.
Insert an element before another element in a list.
Insert an element after another element in a list.
Returns the length of the list stored at key.
Pop an element a list, push it to another list and return it
Pops count elements from the first non-empty list key from the list of provided key names. Read more
Removes and returns the up to count first elements of the list stored at key. Read more
Returns the index of the first matching value of the list stored at key.
Insert all the specified values at the head of the list stored at key.
Inserts a value at the head of the list stored at key, only if key already exists and holds a list. Read more
Returns the specified elements of the list stored at key.
Removes the first count occurrences of elements equal to value from the list stored at key. Read more
Trim an existing list so that it will contain only the specified range of elements specified. Read more
Sets the list element at index to value
Removes and returns the up to count last elements of the list stored at key Read more
Pop a value from a list, push it to another list and return it.
Insert all the specified values at the tail of the list stored at key.
Inserts value at the tail of the list stored at key, only if key already exists and holds a list. Read more
Add one or more members to a set.
Get the number of members in a set.
Subtract multiple sets.
Subtract multiple sets and store the resulting set in a key.
Intersect multiple sets.
Intersect multiple sets and store the resulting set in a key.
Determine if a given value is a member of a set.
Get all the members in a set.
Move a member from one set to another.
Remove and return a random member from a set.
Get one random member from a set.
Get multiple random members from a set.
Remove one or more members from a set.
Add multiple sets.
Add multiple sets and store the resulting set in a key.
Add one member to a sorted set, or update its score if it already exists.
Add multiple members to a sorted set, or update its score if it already exists.
Get the number of members in a sorted set.
Count the members in a sorted set with scores within the given values.
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. Read more
Intersect multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more
Intersect multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more
Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more
Commands::zinterstore, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple. Read more
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. Read more
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. Read more
Count the number of members in a sorted set between a given lexicographical range.
Removes and returns up to count members with the highest scores in a sorted set
Removes and returns up to count members with the lowest scores in a sorted set
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. Read more
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. Read more
Return up to count random members in a sorted set (or 1 if count == None)
Return up to count random members in a sorted set with scores
Return a range of members in a sorted set, by index
Return a range of members in a sorted set, by index with scores.
Return a range of members in a sorted set, by lexicographical range.
Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more
Return a range of members in a sorted set, by lexicographical range.
Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more
Return a range of members in a sorted set, by score.
Return a range of members in a sorted set, by score with scores.
Return a range of members in a sorted set, by score with limit.
Return a range of members in a sorted set, by score with limit with scores.
Determine the index of a member in a sorted set.
Remove one or more members from a sorted set.
Remove all members in a sorted set between the given lexicographical range.
Remove all members in a sorted set within the given indexes.
Remove all members in a sorted set within the given scores.
Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more
Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more
Return a range of members in a sorted set, by score.
Return a range of members in a sorted set, by score with scores.
Return a range of members in a sorted set, by score with limit.
Return a range of members in a sorted set, by score with limit with scores.
Determine the index of a member in a sorted set, with scores ordered from high to low.
Get the score associated with the given member in a sorted set.
Get the scores associated with multiple members in a sorted set.
Unions multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more
Unions multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more
Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more
Commands::zunionstore, but with the ability to specify a multiplication factor for each sorted set by pairing one with each key in a tuple. Read more
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. Read more
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. Read more
Adds the specified elements to the specified HyperLogLog.
Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s). Read more
Merge N different HyperLogLogs into a single one.
Posts a message to the given channel.
Returns the encoding of a key.
Returns the time in seconds since the last access of a key.
Returns the logarithmic access frequency counter of a key.
Returns the reference count of a key.
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. Read more
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. Read more
Shows the currently active ACL rules in the Redis server.
Shows a list of all the usernames of the currently configured users in the Redis ACL system. Read more
Returns all the rules defined for an existing ACL user.
Creates an ACL user without any privilege.
Creates an ACL user with the specified rules or modify the rules of an existing user. Read more
Delete all the specified ACL users and terminate all the connections that are authenticated with such users. Read more
Shows the available ACL categories.
Shows all the Redis commands in the specified category.
Generates a 256-bits password starting from /dev/urandom if available.
Generates a 1-to-1024-bits password starting from /dev/urandom if available.
Returns the username the current connection is authenticated with.
Shows a list of recent ACL security events
Clears the ACL log.
Returns a helpful text describing the different subcommands.
Adds the specified geospatial items to the specified key. Read more
Return the distance between two members in the geospatial index represented by the sorted set. Read more
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
Return the positions of all the specified members of the geospatial index represented by the sorted set at key. Read more
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
Retrieve members selected by distance with the center of member. The member itself is always contained in the results. Read more
Ack pending stream messages checked out by a consumer. Read more
Add a stream message by key. Use * as the id for the current timestamp. Read more
BTreeMap variant for adding a stream message by key. Use * as the id for the current timestamp. Read more
Add a stream message while capping the stream at a maxlength. Read more
BTreeMap variant for adding a stream message while capping the stream at a maxlength. Read more
Claim pending, unacked messages, after some period of time, currently checked out by another consumer. Read more
This is the optional arguments version for claiming unacked, pending messages currently checked out by another consumer. Read more
Deletes a list of ids for a given stream key. Read more
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
This is the alternate version for creating a consumer group which makes the stream if it doesn’t exist. Read more
Alter which id you want consumers to begin reading from an existing consumer group. Read more
Destroy an existing consumer group for a given stream key Read more
This deletes a consumer from an existing consumer group for given stream `key. Read more
This returns all info details about which consumers have read messages for given consumer group. Take note of the StreamInfoConsumersReply return type. Read more
Returns all consumer groups created for a given stream key. Take note of the StreamInfoGroupsReply return type. Read more
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
Returns the number of messages for a given stream key. Read more
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
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
An alternate version of xpending_count which filters by consumer name. Read more
Returns a range of messages in a given stream key. Read more
A helper method for automatically returning all messages in a stream by key. Use with caution! Read more
A method for paginating a stream by key. Read more
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
This method handles setting optional arguments for XREAD or XREADGROUP Redis commands. Read more
This is the reverse version of xrange. The same rules apply for start and end here. Read more
This is the reverse version of xrange_all. The same rules apply for start and end here. Read more
This is the reverse version of xrange_count. The same rules apply for start and end here. Read more
Trim a stream key to a MAXLEN count. Read more
Incrementally iterate the keys space.
Incrementally iterate the keys space for keys matching a pattern.
Incrementally iterate hash fields and associated values.
Incrementally iterate hash fields and associated values for field names matching a pattern. Read more
Incrementally iterate set elements.
Incrementally iterate set elements for elements matching a pattern.
Incrementally iterate sorted set elements.
Incrementally iterate sorted set elements for elements matching a pattern.
Sends an already encoded (packed) command into the TCP socket and reads the single response from it. Read more
Sends multiple already encoded (packed) command into the TCP socket and reads count responses from it. This is used to implement pipelining. Read more
Sends a Cmd into the TCP socket and reads a single response from it.
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. Read more
Check that all connections it has are available (PING internally).
Returns the connection status. Read more
The equivalent of [Access::load].
Compare self to key and return true if they are equal.

Returns the argument unchanged.

Attaches the provided Context to this type, returning a WithContext wrapper. Read more
Attaches the current Context to this type, returning a WithContext wrapper. Read more
Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Calls U::from(self).

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

Should always be Self
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.
Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more