Struct IndexedLinkedHashMap 

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

Stores number of keys, keys in order, and values.

Implementations

impl<I, K, V> IndexedLinkedHashMap<I, K, V>

where I: Ordered<K> + Default, K: Eq + Hash + Clone, V: Clone,

pub fn new() -> Self

Creates new IndexedLinkedHashMap.

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

Gets value using key; returns Some(v) if exists or None.

pub fn set(&mut self, k: K, v: V)

Sets value; upserts if exists already or adds new entry.

pub fn at(&self, i: Option<usize>) -> Option<&V>

Gets value using index; returns Some(v) if exists or None.

pub fn key_at(&self, i: Option<usize>) -> Option<&K>

Gets key using index; returns Some(k) if exists or None.

pub fn set_at(&mut self, i: Option<usize>, k: K, v: V)

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

Removes value; returns Some(v) if exists or None.

pub fn clear(&mut self)

Clears all values.

pub fn len(&self) -> usize

Gets length.

pub fn contains_key(&self, k: K) -> bool

Check if contains a key.

pub fn keys(&self) -> &I

Gets all keys.

pub fn values(&self) -> Vec<&IndexedLinkedHashMapValue<V>>

Gets all values.

Trait Implementations

impl<I, K, V> Debug for IndexedLinkedHashMap<I, K, V>

where I: Ordered<K> + Default, K: Eq + Hash + Clone + Debug, V: Clone + Debug,

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

Formats the value using the given formatter.