Struct rustc_data_structures::vec_map::VecMap

pub struct VecMap<K, V>(Vec<(K, V)>);

A map type implemented as a vector of pairs K (key) and V (value). It currently provides a subset of all the map operations, the rest could be added as needed.

Tuple Fields

0: Vec<(K, V)>

Implementations

impl<K, V> VecMap<K, V>where
    K: Debug + PartialEq,
    V: Debug,

pub fn new() -> Self

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

Sets the value of the entry, and returns the entry’s old value.

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

Removes the entry from the map and returns the removed value

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

Gets a reference to the value in the entry.

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

Gets a mutable reference to the value in the entry.

pub fn any_value_matching(
    &self,
    predicate: impl FnMut(&(K, V)) -> bool
) -> Option<&V>

Returns the any value corresponding to the supplied predicate filter.

The supplied predicate will be applied to each (key, value) pair and it will return a reference to the values where the predicate returns true.

pub fn get_value_matching(
    &self,
    predicate: impl FnMut(&(K, V)) -> bool
) -> Option<&V>

Returns the value corresponding to the supplied predicate filter. It crashes if there’s more than one matching element.

The supplied predicate will be applied to each (key, value) pair and it will return a reference to the value where the predicate returns true.

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

Returns true if the map contains a value for the specified key.

The key may be any borrowed form of the map’s key type, Eq on the borrowed form must match those for the key type.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

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

pub fn iter_mut(&mut self) -> impl Iterator<Item = (&K, &mut V)>

pub fn retain(&mut self, f: impl Fn(&(K, V)) -> bool)

Trait Implementations

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

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

Returns a copy 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, V, __D: Decoder> Decodable<__D> for VecMap<K, V>where
    K: Decodable<__D>,
    V: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Self

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

fn default() -> Self

Returns the “default value” for a type.

impl<K, V, __E: Encoder> Encodable<__E> for VecMap<K, V>where
    K: Encodable<__E>,
    V: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<K: PartialEq + Debug, V: Debug> Extend<(K, V)> for VecMap<K, V>

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

Extends a collection with the contents of an iterator.

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

🔬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> From<Vec<(K, V), Global>> for VecMap<K, V>

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

Converts to this type from the input type.

impl<K, 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, V, CTX> HashStable<CTX> for VecMap<K, V>where
    K: HashStable<CTX> + Eq,
    V: HashStable<CTX>,

fn hash_stable(&self, hcx: &mut CTX, hasher: &mut StableHasher)

impl<K, V> Into<Vec<(K, V), Global>> for VecMap<K, V>

fn into(self) -> Vec<(K, V)>

Converts this type into the (usually inferred) input type.

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

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

The type of the elements being iterated over.

type IntoIter = impl Iterator<Item = (&'a K, &'a mut 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), Global>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.

Size: 24 bytes