Struct comlib_common::MiniMap

pub struct MiniMap<K, V> { /* fields omitted */ }

Map data structure optimized for small number of elements.

The API is modelled after BTreeMap and HashMap. Implements [Entry API] for easier access and modification of the map, modelled after [Standard library Entry API].

[Entry API]: [Standard library Entry API]: https://doc.rust-lang.org/std/collections/index.html#entries

Implementations

impl<K, V> MiniMap<K, V> where
    K: Ord, 

pub fn new() -> Self

Constructs a new MiniMap.

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

Inserts the given value at the given key.

Returns the previous value stored at the key, if one exists.

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

Returns a reference to a value corresponding to the key.

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

Returns a mutable reference to a value corresponding to the key.

pub fn into_inner(self) -> Vec<(K, V)>

Turns the map into an ordered vector of key-value pairs.

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

Gets the given key’s corresponding entry in the map for in-place manipulation.

Trait Implementations

impl<K: Clone, V: Clone> Clone for MiniMap<K, V>

fn clone(&self) -> MiniMap<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for MiniMap<K, V> where
    K: Ord,
    K: Debug,
    V: Debug, 

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

Formats the value using the given formatter.

impl<K, V> Default for MiniMap<K, V> where
    K: Ord, 

fn default() -> Self

Returns the “default value” for a type.