Struct OrderedMap 

pub struct OrderedMap<K, V>(/* private fields */);

An ordered map of key-value pairs.

Implementations

impl<K: PartialEq, V> OrderedMap<K, V>

pub fn get(&self, key: &K) -> Option<&V>

Returns the value corresponding to the key.

pub fn keys(&self) -> impl Iterator<Item = &K>

Returns an iterator over the keys in the map.

pub fn values(&self) -> impl Iterator<Item = &V>

Returns an iterator over the values in the map.

pub fn iter(&self) -> impl Iterator<Item = &(K, V)>

Returns an iterator over the key-value pairs in the map.

Trait Implementations

impl<K: Clone, V: Clone> Clone for OrderedMap<K, V>

fn clone(&self) -> OrderedMap<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for OrderedMap<K, V>

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

Formats the value using the given formatter.

impl<K: PartialEq, V> From<Vec<(K, V)>> for OrderedMap<K, V>

fn from(value: Vec<(K, V)>) -> Self

Converts to this type from the input type.

impl<K: PartialEq, V: PartialEq> PartialEq for OrderedMap<K, V>

fn eq(&self, other: &OrderedMap<K, V>) -> 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<K: Eq, V: Eq> Eq for OrderedMap<K, V>

impl<K, V> StructuralPartialEq for OrderedMap<K, V>