Struct TotalIndexMap

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

An IndexMap where the keys are hashed and compared with TotalOrd/TotalEq.

Implementations

impl<K: TotalHash + TotalEq, V> TotalIndexMap<K, V>

pub fn reserve(&mut self, additional: usize)

pub fn len(&self) -> IdxSize

pub fn is_empty(&self) -> bool

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

pub fn entry(&mut self, key: K) -> Entry<'_, K, V>

pub fn get_index(&self, idx: IdxSize) -> Option<(&K, &V)>

Gets the key and value at the given index by insertion order.

pub unsafe fn get_index_unchecked(&self, idx: IdxSize) -> (&K, &V)

Gets the key and value at the given index by insertion order.

Safety

The index must be less than len().

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

Iterates over the keys in insertion order.

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

Iterates over the values in insertion order.

Trait Implementations

impl<K, V> Default for TotalIndexMap<K, V>

fn default() -> Self

Returns the “default value” for a type.