Struct IndexMap

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

HashMap which provides

1. Immutable APIs
2. Preserving insertion order

Implementations

impl<K: Hash + Eq, V> IndexMap<K, V>

pub fn new() -> Self

pub fn insert(self, key: K, value: V) -> (Self, Option<V>)

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

pub fn keys(&self) -> Keys<'_, K, V>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<K: Hash + Eq, V> Default for IndexMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K: Hash + Eq, V> IntoIterator for IndexMap<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.