Struct ds_ext::queue::LinkedHashMap

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

A hash map in insertion order which can be reordered using Self::bump and Self::swap.

Implementations

impl<K: Eq + Hash, V> LinkedHashMap<K, V>

pub fn new() -> Self

Construct a new LinkedHashMap.

pub fn with_capacity(capacity: usize) -> Self

Construct a new LinkedHashMap with the given capacity.

pub fn bump(&mut self, key: &K) -> bool

If key is present, increase its priority by one and return true.

pub fn clear(&mut self)

Remove all entries from this LinkedHashMap.

pub fn contains_key<Q>(&self, key: &Q) -> boolwhere Arc<K>: Borrow<Q>, Q: Eq + Hash + ?Sized,

Return true if there is an entry for the given key in this LinkedHashMap.

pub fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, iter: I)

Consume the iter and insert all its elements into this LinkedHashMap.

pub fn get<Q>(&self, key: &Q) -> Option<&V>where Arc<K>: Borrow<Q>, Q: Eq + Hash + ?Sized,

Borrow the value at the given key, if present.

pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)>where Arc<K>: Borrow<Q>, Q: Eq + Hash + ?Sized,

Borrow the entry at the given key, if present.

pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>where Arc<K>: Borrow<Q>, Q: Eq + Hash + ?Sized,

Borrow the value at the given key mutably, if present.

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

Insert a new value at key and return the previous value, if any.

pub fn iter(&self) -> Iter<'_, K, V>

Construct an iterator over the entries in this LinkedHashMap.

pub fn is_empty(&self) -> bool

Return true if this LinkedHashMap is empty.

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

Construct an iterator over keys of this LinkedHashMap.

pub fn len(&self) -> usize

Return the size of this LinkedHashMap.

pub fn pop_first(&mut self) -> Option<V>

Remove and return the first value in this LinkedHashMap.

pub fn pop_first_entry(&mut self) -> Option<(K, V)>where K: Debug,

Remove and return the first entry in this LinkedHashMap.

pub fn pop_last(&mut self) -> Option<V>

Remove and return the last value in this LinkedHashMap.

pub fn pop_last_entry(&mut self) -> Option<(K, V)>where K: Debug,

Remove and return the last entry in this LinkedHashMap.

pub fn remove<Q>(&mut self, key: &Q) -> Option<V>where Arc<K>: Borrow<Q>, Q: Hash + Eq + ?Sized,

Remove an entry from this LinkedHashMap and return its value, if present.

pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>where K: Debug, Arc<K>: Borrow<Q>, Q: Hash + Eq + ?Sized,

Remove and return an entry from this LinkedHashMap, if present.

pub fn swap<Q>(&mut self, l: &Q, r: &Q) -> boolwhere Arc<K>: Borrow<Q>, Q: Hash + Eq + ?Sized,

Swap the position of two keys in this LinkedHashMap. Returns true if both keys are present.

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

Construct an iterator over the values in this LinkedHashMap.

Trait Implementations

impl<K: Clone + Eq + Hash, V: Clone> Clone for LinkedHashMap<K, V>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Eq + Hash + Debug, V: Debug> Debug for LinkedHashMap<K, V>

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

Formats the value using the given formatter.

impl<K: Eq + Hash, V> FromIterator<(K, V)> for LinkedHashMap<K, V>

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

Creates a value from an iterator.

impl<'a, K: Eq + Hash, V> IntoIterator for &'a LinkedHashMap<K, V>

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: Eq + Hash + Debug, V> IntoIterator for LinkedHashMap<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.