Struct OrderedHashMap 

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

Available on crate feature std only.

Tracks the insertion order of key/value pairs. Backed by a HashMap for storage and a VecDeque for key insertion order.

Implementations

impl<K, V> OrderedHashMap<K, V>

pub fn new() -> OrderedHashMap<K, V>

pub fn with_capacity(capacity: usize) -> OrderedHashMap<K, V>

pub fn capacity(&self) -> usize

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

pub fn clear(&mut self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn get<Q: ?Sized + Hash + Eq>(&self, k: &Q) -> Option<&V>

where K: Borrow<Q>,

pub fn insert(&mut self, k: K, v: V) -> Option<V>

impl<'a, K: Eq + Hash, V> OrderedHashMap<K, V>

pub fn iter(&'a self) -> OrderedMapIter<'a, K, V>

pub fn drain(self) -> OrderedDrain<K, V>

Trait Implementations

impl<K: Default, V: Default> Default for OrderedHashMap<K, V>

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

Returns the “default value” for a type.