Struct VecMap 

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

A drop in replacement for std::collections::HashMap for extensive documentation and examples, see the original data structure.

Implementations

impl<K, V> VecMap<K, V>

where K: Eq,

pub const fn new() -> Self

Creates an empty VecMap

pub fn with_capacity(capacity: usize) -> Self

pub fn capacity(&self) -> usize

Returns the number of elements the map can hold without reallocating.

pub fn reserve(&mut self, additional: usize)

pub fn len(&self) -> usize

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

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

where K: Borrow<Q> + PartialEq<Q>, Q: Eq + ?Sized,

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

where K: Borrow<Q> + PartialEq<Q>, Q: Eq + ?Sized,

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

where K: Borrow<Q>, Q: Eq + ?Sized,

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>

where K: Borrow<Q>, Q: Eq + ?Sized,

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

where K: Borrow<Q> + PartialEq<Q>, Q: Eq + ?Sized,

pub fn shrink_to_fit(&mut self)

pub fn shrink_to(&mut self, min_capacity: usize)

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

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

where K: Borrow<Q> + PartialEq<Q>, Q: Eq + ?Sized,

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

pub fn into_keys(self) -> IntoKeys<K, V>

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

pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>

pub fn into_values(self) -> IntoValues<K, V>

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

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>

pub fn is_empty(&self) -> bool

pub fn drain(&mut self) -> Drain<'_, K, V>

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&K, &mut V) -> bool,

pub fn clear(&mut self)

pub fn hasher<S>(&self) -> &S

where S: BuildHasher,

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for VecMap<K, V>

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

Formats the value using the given formatter.

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

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

Returns the “default value” for a type.

impl<'a, K, V> Extend<(&'a K, &'a V)> for VecMap<K, V>

where K: Eq + Copy, V: Copy,

fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K, V> Extend<(K, V)> for VecMap<K, V>

where K: Eq,

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K, V, const N: usize> From<[(K, V); N]> for VecMap<K, V>

where K: Eq,

fn from(value: [(K, V); N]) -> Self

Converts to this type from the input type.

impl<K, V> FromIterator<(K, V)> for VecMap<K, V>

where K: Eq,

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

Creates a value from an iterator.

impl<K, Q, V> Index<&Q> for VecMap<K, V>

where K: Eq + Borrow<Q>, Q: Eq + ?Sized,

type Output = V

The returned type after indexing.

fn index(&self, index: &Q) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'a, K, V> IntoIterator for &'a VecMap<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<'a, K, V> IntoIterator for &'a mut VecMap<K, V>

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

The type of the elements being iterated over.

type IntoIter = IterMut<'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, V> IntoIterator for VecMap<K, V>

where K: Eq,

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.

impl<K, V> PartialEq<HashMap<K, V>> for VecMap<K, V>

where K: Eq, V: PartialEq,

fn eq(&self, other: &HashMap<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: PartialEq + Eq, V: PartialEq> PartialEq for VecMap<K, V>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Eq, V: Eq> Eq for VecMap<K, V>