Struct OrderedMap 

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

An order-preserving immutable map with lookup via a perfect hash function.

Constructable at compile time with a BuildOrderedMap. Unlike a Map, iteration order is guaranteed to match the definition order.

Internally, this is a wrapper for phf::OrderedMap from the excellent phf crate.

This API requires the following crate feature to be activated: map

Implementations

impl<K, V> OrderedMap<K, V>

pub const fn len(&self) -> usize

pub const fn is_empty(&self) -> bool

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

where T: PhfHash + Eq + ?Sized, K: PhfBorrow<T>,

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

where T: PhfHash + Eq + ?Sized, K: PhfBorrow<T>,

pub fn get_key<T>(&self, key: &T) -> Option<&K>

where T: PhfHash + Eq + ?Sized, K: PhfBorrow<T>,

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

where T: PhfHash + Eq + ?Sized, K: PhfBorrow<T>,

pub fn get_index<T>(&self, key: &T) -> Option<usize>

where T: PhfHash + Eq + ?Sized, K: PhfBorrow<T>,

pub fn index<T>(&self, index: usize) -> Option<(&K, &V)>

pub fn entries(&self) -> Entries<'_, K, V>

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

pub fn values(&self) -> Values<'_, K, V>

pub const fn init_raw(map: OrderedMap<K, V>) -> OrderedMap<K, V>

An implementation detail. You shouldn’t need to call this function.