Struct OrderedMap 

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

A map from node names to V that iterates in insertion order.

Inserting an existing key replaces its value in place, as a Python dict does. Lookups are linear: the maps hold one entry per network node, a few dozen at most, where a scan beats hashing.

Implementations

impl<V> OrderedMap<V>

pub const fn new() -> Self

Creates an empty map.

pub fn len(&self) -> usize

Returns the number of entries.

pub fn is_empty(&self) -> bool

Returns true when the map holds no entry.

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

Returns the value stored under key.

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

Returns a mutable reference to the value stored under key.

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

Returns true when key is present.

pub fn insert(&mut self, key: impl Into<String>, value: V) -> Option<V>

Inserts value under key, returning the value it replaced. A new key goes last; an existing key keeps its position.

pub fn remove(&mut self, key: &str) -> Option<V>

Removes key, keeping the order of the remaining entries.

pub fn iter(&self) -> impl ExactSizeIterator<Item = (&str, &V)>

Iterates over the entries in insertion order.

pub fn keys(&self) -> impl ExactSizeIterator<Item = &str>

Iterates over the keys in insertion order.

Trait Implementations

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

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<V> Default for OrderedMap<V>

fn default() -> Self

Returns the “default value” for a type.

impl<V: Eq> Eq for OrderedMap<V>

impl<K: Into<String>, V> Extend<(K, V)> for OrderedMap<V>

fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: T)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K: Into<String>, V> FromIterator<(K, V)> for OrderedMap<V>

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

Creates a value from an iterator.

impl<V> IntoIterator for OrderedMap<V>

type Item = (String, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<(String, V)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, V> IntoIterator for &'a OrderedMap<V>

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

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<V: PartialEq> StructuralPartialEq for OrderedMap<V>