Struct Set 

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

A set in which the presence of an entry is tied to the lifetime of a RAII handle returned by the insertion.

Implementations

impl<T: Ord> Set<T>

pub fn new() -> Self

Creates a new, empty set.

pub fn len(&self) -> usize

Gets the number of items in the set.

pub fn is_empty(&self) -> bool

Checks if the set is empty.

pub fn iter(&self) -> Iter<'_, T>

Gets an iterator over the contents of the set.

Trait Implementations

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

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<'a, T: Ord> IntoIterator for &'a Set<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = <&'a BTreeSet<T> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord> IntoIterator for Set<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = <BTreeSet<T> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> 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: Eq> Eq for Set<T>

impl<T> StructuralPartialEq for Set<T>