Struct graph_rs_sdk::header::GetAll

pub struct GetAll<'a, T> { /* private fields */ }

A view to all values stored in a single entry.

This struct is returned by HeaderMap::get_all.

Implementations

impl<'a, T> GetAll<'a, T> where
    T: 'a, 

pub fn iter(&self) -> ValueIter<'a, T>

Returns an iterator visiting all values associated with the entry.

Values are iterated in insertion order.

Examples

let mut map = HeaderMap::new();
map.insert(HOST, "hello.world".parse().unwrap());
map.append(HOST, "hello.earth".parse().unwrap());

let values = map.get_all("host");
let mut iter = values.iter();
assert_eq!(&"hello.world", iter.next().unwrap());
assert_eq!(&"hello.earth", iter.next().unwrap());
assert!(iter.next().is_none());

Trait Implementations

impl<'a, T> Debug for GetAll<'a, T> where
    T: Debug, 

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

Formats the value using the given formatter.

impl<'a, T> IntoIterator for GetAll<'a, T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = ValueIter<'a, T>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> ValueIter<'a, T>

Creates an iterator from a value.

impl<'a, 'b, T> IntoIterator for &'b GetAll<'a, T> where
    'b: 'a, 

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = ValueIter<'a, T>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> ValueIter<'a, T>

Creates an iterator from a value.

impl<'a, T> PartialEq<GetAll<'a, T>> for GetAll<'a, T> where
    T: PartialEq<T>, 

pub fn eq(&self, other: &GetAll<'a, T>) -> bool

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

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

This method tests for !=.