Struct move_lang::shared::unique_map::UniqueMap

pub struct UniqueMap<K: TName, V>(_);

Unique wrapper around BTreeMap that throws on duplicate inserts

Implementations

impl<K: TName, V> UniqueMap<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 contains_key(&self, key: &K) -> bool

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

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

pub fn get_(&self, key_: &K::Key) -> Option<&V>

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

pub fn get_mut_(&mut self, key_: &K::Key) -> Option<&mut V>

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

pub fn get_loc_(&self, key_: &K::Key) -> Option<&K::Loc>

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

pub fn remove_(&mut self, key_: &K::Key) -> Option<V>

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

pub fn filter_map<V2, F>(self, f: F) -> UniqueMap<K, V2>where F: FnMut(K, V) -> Option<V2>,

pub fn ref_map<V2, F>(&self, f: F) -> UniqueMap<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 key_cloned_iter(&self) -> impl Iterator<Item = (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<UniqueMap<K, V>, (K::Key, K::Loc, K::Loc)>>

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

Trait Implementations

impl<K: Clone + TName, V: Clone> Clone for UniqueMap<K, V>where K::Key: Clone, K::Loc: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<K: Default + TName, V: Default> Default for UniqueMap<K, V>where K::Key: Default, K::Loc: Default,

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

Returns the “default value” for a type.

impl<K: TName, V: Hash> Hash for UniqueMap<K, V>where K::Key: Hash,

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: TName, V> IntoIterator for &'a UniqueMap<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 UniqueMap<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 UniqueMap<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: Ord> Ord for UniqueMap<K, V>

fn cmp(&self, other: &UniqueMap<K, V>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<K: TName, V: PartialEq> PartialEq<UniqueMap<K, V>> for UniqueMap<K, V>

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

fn partial_cmp(&self, other: &UniqueMap<K, V>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

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