Struct QueryView 

pub struct QueryView<'a> { /* private fields */ }

A parsed view over a request’s query string.

Borrowed from the request, so it cannot outlive it: the view hands out &str into the request’s memoized pairs, never copies of them. The pairs themselves are owned — percent-decoding has to produce new bytes — but they are built once, on first access, not per lookup.

Implementations

impl<'a> QueryView<'a>

pub fn get(&self, key: &str) -> Option<&'a str>

The first value for key.

pub fn contains_key(&self, key: &str) -> bool

Whether key appears at all.

pub fn get_all(&self, key: &'a str) -> impl Iterator<Item = &'a str> + 'a

Every value for key, in the order the client sent them.

pub fn iter(&self) -> impl Iterator<Item = (&'a str, &'a str)>

Every pair, in the order the client sent them.

pub fn len(&self) -> usize

The number of pairs, counting repeated keys separately.

pub fn is_empty(&self) -> bool

Whether the query carried any pairs.

pub fn to_hash_map(&self) -> HashMap<String, String>

An owned copy, for the call sites that genuinely need one.

This is the allocation the lazy path exists to avoid — reach for it only when a HashMap is actually required. Repeated keys collapse to the last one, matching HashMap’s own insert semantics.

Trait Implementations

impl<'a> Clone for QueryView<'a>

fn clone(&self) -> QueryView<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for QueryView<'a>

impl<'a> Debug for QueryView<'a>

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

Formats the value using the given formatter.

impl<'a> IntoIterator for QueryView<'a>

type Item = (&'a str, &'a str)

The type of the elements being iterated over.

type IntoIter = Map<Iter<'a, (String, String)>, fn(&'a (String, String)) -> (&'a str, &'a str)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.