Struct move_lang::shared::remembering_unique_map::RememberingUniqueMap

pub struct RememberingUniqueMap<K: TName + Ord, V> { /* private fields */ }

wrapper around UniqueMap that remembers which values were asked for in get

Implementations

impl<K: TName, V> RememberingUniqueMap<K, V>

pub fn new() -> Self

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn add(&mut self, key: K, value: V) -> Result<(), (K, K::Loc)>

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

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

pub fn contains_key_(&self, key_: &K::Key) -> bool

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

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

pub fn get_loc(&mut self, key: &K) -> Option<&K::Loc>

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

pub fn map<V2, F>(self, f: F) -> RememberingUniqueMap<K, V2>where F: FnMut(K, V) -> V2,

pub fn ref_map<V2, F>(&self, f: F) -> RememberingUniqueMap<K, V2>where F: FnMut(K, &V) -> V2,

pub fn union_with<F>(&self, other: &Self, f: F) -> Selfwhere V: Clone, F: FnMut(&K, &V, &V) -> V,

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

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

pub fn maybe_from_opt_iter( iter: impl Iterator<Item = Option<(K, V)>> ) -> Option<Result<RememberingUniqueMap<K, V>, (K::Key, K::Loc, K::Loc)>>

pub fn maybe_from_iter( iter: impl Iterator<Item = (K, V)> ) -> Result<RememberingUniqueMap<K, V>, (K::Key, K::Loc, K::Loc)>

pub fn into_inner(self) -> UniqueMap<K, V>

pub fn remember(self) -> BTreeSet<K>

Trait Implementations

impl<K: Clone + TName + Ord, V: Clone> Clone for RememberingUniqueMap<K, V>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: TName + Debug, V: Debug> Debug for RememberingUniqueMap<K, V>where K::Key: Debug, K::Loc: Debug,

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

Formats the value using the given formatter.

impl<'a, K: TName, V> IntoIterator for &'a RememberingUniqueMap<K, V>

type Item = (<K as TName>::Loc, &'a <K as TName>::Key, &'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: TName, V> IntoIterator for &'a mut RememberingUniqueMap<K, V>

type Item = (<K as TName>::Loc, &'a <K as TName>::Key, &'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: TName, V> IntoIterator for RememberingUniqueMap<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: TName, V: PartialEq> PartialEq<RememberingUniqueMap<K, V>> for RememberingUniqueMap<K, V>

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<K: TName, V: Eq> Eq for RememberingUniqueMap<K, V>