Struct Set 

pub struct Set<T: Obj>(/* private fields */);

Garbage-collected hash set implementing Copy. This implements Ord but the order is not meaningful; this is just so one can use BTreeMaps. In particular, the order might differ across two runs of the same program.

Implementations

impl<T: Obj> Set<T>

pub fn new() -> Self

Constructs an empty Set.

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

Checks whether t is contained in self.

pub fn insert(&mut self, t: T)

Inserts t into self.

pub fn try_insert(&mut self, t: T) -> Result<(), ()>

Like insert, but fails if t was already in the set.

pub fn remove(&mut self, t: T)

Removes t from self.

pub fn len(self) -> Int

Returns the number of elements in self.

pub fn is_empty(self) -> bool

Returns true if the set contains no elements.

impl<T: Obj> Set<T>

pub fn iter(self) -> ConsumingIter<T>

An iterator over all elements of self.

Trait Implementations

impl<T: Clone + Obj> Clone for Set<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Copy + Obj> Copy for Set<T>

impl<T: Debug + Obj> Debug for Set<T>

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

Formats the value using the given formatter.

impl<T: Obj> Default for Set<T>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T: Obj + Deserialize<'de>> Deserialize<'de> for Set<T>

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Eq + Obj> Eq for Set<T>

impl<U: Obj> FromIterator<U> for Set<U>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = U>,

Creates a value from an iterator.

impl<T: Hash + Obj> Hash for Set<T>

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<T: Obj> IntoIterator for Set<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = ConsumingIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord + Obj> Ord for Set<T>

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

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

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

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq + Obj> PartialEq for Set<T>

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T: PartialOrd + Obj> PartialOrd for Set<T>

fn partial_cmp(&self, other: &Set<T>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<T: Serialize + Obj> Serialize for Set<T>

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: PartialEq + Obj> StructuralPartialEq for Set<T>