Struct move_compiler::shared::unique_set::UniqueSet

source · [−]

pub struct UniqueSet<T: TName>(_);

Expand description

Unique set wrapper around UniqueMap where the value of the map is not needed

Implementations

source

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

source

pub fn cloned_iter(&self) -> impl Iterator<Item = T>

source

pub fn from_elements(
iter: impl IntoIterator<Item = T>
) -> Result<Self, (T::Key, T::Loc, T::Loc )>

source

pub fn from_elements_(
loc: T::Loc,
iter: impl IntoIterator<Item = T::Key>
) -> Result<Self, (T::Key, T::Loc, T::Loc )>

Trait Implementations

source

impl<T: Clone + TName> Clone for UniqueSet<T>

source

fn clone(&self) -> UniqueSet<T>

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<T: TName + Debug> Debug for UniqueSet<T> where
T::Key: Debug,
T::Loc: Debug,

source

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

Formats the value using the given formatter. Read more

source

impl<T: TName> Hash for UniqueSet<T> where
T::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<T: TName> IntoIterator for UniqueSet<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

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, T: TName> IntoIterator for &'a UniqueSet<T>

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

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

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<T: TName> Ord for UniqueSet<T>

source

fn cmp(&self, other: &UniqueSet<T>) -> 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<T: TName> PartialEq<UniqueSet<T>> for UniqueSet<T>

source

fn eq(&self, other: &UniqueSet<T>) -> 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<T: TName> PartialOrd<UniqueSet<T>> for UniqueSet<T>

source

fn partial_cmp(&self, other: &UniqueSet<T>) -> 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<T: TName> Eq for UniqueSet<T>

Auto Trait Implementations

impl<T> RefUnwindSafe for UniqueSet<T> where
<T as TName>::Key: RefUnwindSafe,
<T as TName>::Loc: RefUnwindSafe,

impl<T> Send for UniqueSet<T> where
<T as TName>::Key: Send,
<T as TName>::Loc: Send,

impl<T> Sync for UniqueSet<T> where
<T as TName>::Key: Sync,
<T as TName>::Loc: Sync,

impl<T> Unpin for UniqueSet<T>

impl<T> UnwindSafe for UniqueSet<T> where
<T as TName>::Key: RefUnwindSafe,
<T 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_set::UniqueSet

Implementations

impl<T: TName> UniqueSet<T>

pub fn new() -> Self

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn add(&mut self, x: T) -> Result<(), (T, T::Loc)>

pub fn remove(&mut self, x: &T) -> bool

pub fn remove_(&mut self, x: &T::Key) -> bool

pub fn contains(&self, x: &T) -> bool

pub fn contains_(&self, x_: &T::Key) -> bool

pub fn get_loc(&self, x: &T) -> Option<&T::Loc>

pub fn get_loc_(&self, x_: &T::Key) -> Option<&T::Loc>

pub fn intersect(&self, other: &Self) -> Self

pub fn union(&self, other: &Self) -> Self

pub fn is_subset(&self, other: &Self) -> bool

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

pub fn cloned_iter(&self) -> impl Iterator<Item = T>

pub fn from_elements( iter: impl IntoIterator<Item = T>) -> Result<Self, (T::Key, T::Loc, T::Loc)>

pub fn from_elements_( loc: T::Loc, iter: impl IntoIterator<Item = T::Key>) -> Result<Self, (T::Key, T::Loc, T::Loc)>

Trait Implementations

impl<T: Clone + TName> Clone for UniqueSet<T>

fn clone(&self) -> UniqueSet<T>

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

impl<T: TName + Debug> Debug for UniqueSet<T> where T::Key: Debug, T::Loc: Debug,

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

impl<T: TName> Hash for UniqueSet<T> where T::Key: Hash,

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

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

impl<T: TName> IntoIterator for UniqueSet<T>

type Item = T

type IntoIter = IntoIter<T>

fn into_iter(self) -> Self::IntoIter

impl<'a, T: TName> IntoIterator for &'a UniqueSet<T>

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

type IntoIter = Iter<'a, T>

fn into_iter(self) -> Self::IntoIter

impl<T: TName> Ord for UniqueSet<T>

fn cmp(&self, other: &UniqueSet<T>) -> Ordering

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

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

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

impl<T: TName> PartialEq<UniqueSet<T>> for UniqueSet<T>

fn eq(&self, other: &UniqueSet<T>) -> bool

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

impl<T: TName> PartialOrd<UniqueSet<T>> for UniqueSet<T>

fn partial_cmp(&self, other: &UniqueSet<T>) -> 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<T: TName> Eq for UniqueSet<T>

Auto Trait Implementations

impl<T> RefUnwindSafe for UniqueSet<T> where <T as TName>::Key: RefUnwindSafe, <T as TName>::Loc: RefUnwindSafe,

impl<T> Send for UniqueSet<T> where <T as TName>::Key: Send, <T as TName>::Loc: Send,

impl<T> Sync for UniqueSet<T> where <T as TName>::Key: Sync, <T as TName>::Loc: Sync,

impl<T> Unpin for UniqueSet<T>

impl<T> UnwindSafe for UniqueSet<T> where <T as TName>::Key: RefUnwindSafe, <T 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,

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> Same<T> for T

type Output = T

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

type Owned = T

fn to_owned(&self) -> T

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

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

pub fn add(&mut self, x: T) -> Result<(), (T, T::Loc )>

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

pub fn from_elements(
iter: impl IntoIterator<Item = T>
) -> Result<Self, (T::Key, T::Loc, T::Loc )>

pub fn from_elements_(
loc: T::Loc,
iter: impl IntoIterator<Item = T::Key>
) -> Result<Self, (T::Key, T::Loc, T::Loc )>

impl<T: TName + Debug> Debug for UniqueSet<T> where
T::Key: Debug,
T::Loc: Debug,

impl<T: TName> Hash for UniqueSet<T> where
T::Key: Hash,

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

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

impl<T> RefUnwindSafe for UniqueSet<T> where
<T as TName>::Key: RefUnwindSafe,
<T as TName>::Loc: RefUnwindSafe,

impl<T> Send for UniqueSet<T> where
<T as TName>::Key: Send,
<T as TName>::Loc: Send,

impl<T> Sync for UniqueSet<T> where
<T as TName>::Key: Sync,
<T as TName>::Loc: Sync,

impl<T> UnwindSafe for UniqueSet<T> where
<T as TName>::Key: RefUnwindSafe,
<T 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>,