Struct OrderedMap 

pub struct OrderedMap<K, V> { /* private fields */ }

An ordered map preserving insertion order.

Implementations

impl<K: Eq + Hash + Clone, V: Clone> OrderedMap<K, V>

pub fn new() -> Self

Creates a new, empty OrderedMap, optionally with a capacity hint.

pub fn from_map(m: HashMap<K, V>) -> Self

where K: Ord,

Creates a new ordered map from a built-in map. The order is sorted deterministically by key.

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

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

pub fn set(&mut self, key: K, value: V)

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn has(&self, key: &K) -> bool

pub fn oldest(&self) -> Option<&Pair<K, V>>

pub fn newest(&self) -> Option<&Pair<K, V>>

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

pub fn keys(&self) -> Vec<K>

pub fn values(&self) -> Vec<V>

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: Default, V: Default> Default for OrderedMap<K, V>

fn default() -> OrderedMap<K, V>

Returns the “default value” for a type.

impl<'de, K, V> Deserialize<'de> for OrderedMap<K, V>

where K: Deserialize<'de> + Eq + Hash + Clone, V: Deserialize<'de> + Clone,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.