Struct move_compiler::shared::unique_map::UniqueMap

source · [−]

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

Expand description

Unique wrapper around BTreeMap that throws on duplicate inserts

Implementations

source

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

source

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

source

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

source

pub fn iter(&self) -> Iter<'_, K, V>ⓘNotable traits for Iter<'a, K, V>`impl<'a, K: TName, V> Iterator for Iter<'a, K, V> type Item = (K::Loc, &'a K::Key, &'a V);`

source

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

source

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>ⓘNotable traits for IterMut<'a, K, V>`impl<'a, K: TName, V> Iterator for IterMut<'a, K, V> type Item = (K::Loc, &'a K::Key, &'a mut V);`

source

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

source

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

Trait Implementations

source

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

source

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

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

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

source

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

Formats the value using the given formatter. Read more

source

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

source

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

Returns the “default value” for a type. Read more

source

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

source

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

Feeds this value into the given Hasher. Read more

1.3.0 · source

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

Feeds a slice of this type into the given Hasher. Read more

source

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?

source

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

source

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

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

source

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

source

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

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

source

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

source

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

source

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

This method returns an Ordering between self and other. Read more

1.21.0 · source

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

Compares and returns the maximum of two values. Read more

1.21.0 · source

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

Compares and returns the minimum of two values. Read more

1.50.0 · source

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval. Read more

source

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

source

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

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

1.0.0 · source

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

This method tests for !=.

source

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

source

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

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

1.0.0 · source

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

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

1.0.0 · source

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

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

1.0.0 · source

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

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

1.0.0 · source

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

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

source

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

Auto Trait Implementations

impl<K, V> RefUnwindSafe for UniqueMap<K, V> where
 V: RefUnwindSafe,
 <K as TName>::Key: RefUnwindSafe,
 <K as TName>::Loc: RefUnwindSafe,

impl<K, V> Send for UniqueMap<K, V> where
 V: Send,
 <K as TName>::Key: Send,
 <K as TName>::Loc: Send,

impl<K, V> Sync for UniqueMap<K, V> where
 V: Sync,
 <K as TName>::Key: Sync,
 <K as TName>::Loc: Sync,

impl<K, V> Unpin for UniqueMap<K, V>

impl<K, V> UnwindSafe for UniqueMap<K, V> where
 V: RefUnwindSafe,
 <K as TName>::Key: RefUnwindSafe,
 <K as TName>::Loc: RefUnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> CallHasher for T where
T: Hash + ?Sized,

source

fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64 where
H: Hash + ?Sized,
B: BuildHasher,

source

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

source

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

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

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

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

source

Struct move_compiler::shared::unique_map::UniqueMap

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 get_key(&self, key: &K) -> Option<&K::Key>

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) -> Self where V: Clone, F: FnMut(&K, &V, &V) -> V,

pub fn iter(&self) -> Iter<'_, K, V>ⓘNotable traits for Iter<'a, K, V>impl<'a, K: TName, V> Iterator for Iter<'a, K, V> type Item = (K::Loc, &'a K::Key, &'a V);

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

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>ⓘNotable traits for IterMut<'a, K, V>impl<'a, K: TName, V> Iterator for IterMut<'a, K, V> type Item = (K::Loc, &'a K::Key, &'a mut 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>

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

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

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

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

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

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

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

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

type Item = (K, V)

type IntoIter = IntoIter<K, V>

fn into_iter(self) -> Self::IntoIter

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

type Item = (K::Loc, &'a K::Key, &'a V)

type IntoIter = Iter<'a, K, V>

fn into_iter(self) -> Self::IntoIter

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

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

type IntoIter = IterMut<'a, K, V>

fn into_iter(self) -> Self::IntoIter

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

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

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

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

fn clamp(self, min: Self, max: Self) -> Self

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

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

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

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

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

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

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

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

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

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

Auto Trait Implementations

impl<K, V> RefUnwindSafe for UniqueMap<K, V> where V: RefUnwindSafe, <K as TName>::Key: RefUnwindSafe, <K as TName>::Loc: RefUnwindSafe,

impl<K, V> Send for UniqueMap<K, V> where V: Send, <K as TName>::Key: Send, <K as TName>::Loc: Send,

impl<K, V> Sync for UniqueMap<K, V> where V: Sync, <K as TName>::Key: Sync, <K as TName>::Loc: Sync,

impl<K, V> Unpin for UniqueMap<K, V>

impl<K, V> UnwindSafe for UniqueMap<K, V> where V: RefUnwindSafe, <K as TName>::Key: RefUnwindSafe, <K as TName>::Loc: RefUnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CallHasher for T where T: Hash + ?Sized,

fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64 where H: Hash + ?Sized, B: BuildHasher,

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

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) -> Self where
V: Clone,
F: FnMut(&K, &V, &V) -> V,

pub fn iter(&self) -> Iter<'_, K, V>ⓘNotable traits for Iter<'a, K, V>`impl<'a, K: TName, V> Iterator for Iter<'a, K, V> type Item = (K::Loc, &'a K::Key, &'a V);`

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>ⓘNotable traits for IterMut<'a, K, V>`impl<'a, K: TName, V> Iterator for IterMut<'a, K, V> type Item = (K::Loc, &'a K::Key, &'a mut 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 )>

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

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

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

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

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

impl<K, V> RefUnwindSafe for UniqueMap<K, V> where
V: RefUnwindSafe,
<K as TName>::Key: RefUnwindSafe,
<K as TName>::Loc: RefUnwindSafe,

impl<K, V> Send for UniqueMap<K, V> where
V: Send,
<K as TName>::Key: Send,
<K as TName>::Loc: Send,

impl<K, V> Sync for UniqueMap<K, V> where
V: Sync,
<K as TName>::Key: Sync,
<K as TName>::Loc: Sync,

impl<K, V> UnwindSafe for UniqueMap<K, V> where
V: RefUnwindSafe,
<K as TName>::Key: RefUnwindSafe,
<K as TName>::Loc: RefUnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T> CallHasher for T where
T: Hash + ?Sized,

fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64 where
H: Hash + ?Sized,
B: BuildHasher,

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

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,