Struct KeyValues 

pub struct KeyValues<T> { /* private fields */ }

Implementations

impl<T> KeyValues<T>

where T: AsRef<dyn KeyValue>,

pub fn empty() -> Self

Creates an empty KeyValues instance

pub fn and(self, other: Self) -> Self

Creates a KeyValues from key-value pairs in a vector Merges this KeyValues with another

pub fn iter(&self) -> impl Iterator<Item = &T>

Returns an iterator over the key-value pairs

pub fn len(&self) -> usize

Returns the number of key-value pairs

pub fn is_empty(&self) -> bool

Checks if the collection is empty

Trait Implementations

impl<T: Clone> Clone for KeyValues<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for KeyValues<T>

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

Formats the value using the given formatter.

impl<T> Display for KeyValues<T>

where T: KeyValue,

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

Formats the value using the given formatter.

impl<'a, T> IntoIterator for &'a KeyValues<T>

where T: KeyValue,

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for KeyValues<T>

where T: KeyValue,

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for KeyValues<T>

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T: Eq> Eq for KeyValues<T>

impl<T> StructuralPartialEq for KeyValues<T>