Struct VecMap

pub struct VecMap<K, V>(/* private fields */);

Implementations

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

pub const fn new() -> Self

pub fn from_single(key: K, value: V) -> Self

pub fn with_capacity(cap: usize) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

impl<K: Ord, V> VecMap<K, V>

pub fn from_vec(v: Vec<(K, V)>) -> Self

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

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

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

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

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

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

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

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

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

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

pub fn merge_copied_with(&mut self, other: &Self, f: impl FnMut(V, V) -> V)

where K: Copy, V: Copy,

pub fn remove_less_than<Q>(&mut self, key: &Q)

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

pub fn remove_max(&mut self) -> Option<(K, V)>

pub fn apply(&self, keys: &VecSet<K>, f: impl FnMut(&V))

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, V> Debug for VecMap<K, V>

where K: Debug, V: Debug,

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<K: Ord, V> From<Vec<(K, V)>> for VecMap<K, V>

fn from(v: Vec<(K, V)>) -> Self

Converts to this type from the input type.

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

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

Creates a value from an iterator.

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

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, K, V> IntoIterator for &'a VecMap<K, V>

type Item = &'a (K, 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 mut (K, 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>

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: PartialEq, V: PartialEq> PartialEq for VecMap<K, V>

fn eq(&self, other: &VecMap<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: Eq, V: Eq> Eq for VecMap<K, V>

impl<K, V> StructuralPartialEq for VecMap<K, V>