Struct move_lang::shared::unique_set::UniqueSet

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

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

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>

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>

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

type Item = (<T as TName>::Loc, &'a <T as TName>::Key)

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

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

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

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