Struct mz_ore::collections::HashSet

#[repr(transparent)]
pub struct HashSet<T>(HashSet<T>);

A wrapper around std::collections::HashSet that hides methods that expose unstable iteration order.

See the module documentation for a rationale.

Tuple Fields

0: HashSet<T>

Implementations

impl<T> HashSet<T>

pub fn new() -> Self

See std::collections::HashSet::new.

pub fn with_capacity(capacity: usize) -> Self

See std::collections::HashSet::with_capacity.

pub fn capacity(&self) -> usize

See std::collections::HashSet::capacity.

pub fn len(&self) -> usize

See std::collections::HashSet::len.

pub fn is_empty(&self) -> bool

See std::collections::HashSet::is_empty.

pub fn clear(&mut self)

See std::collections::HashSet::clear.

impl<T> HashSet<T>

where T: Eq + Hash,

pub fn reserve(&mut self, additional: usize)

See std::collections::HashSet::reserve.

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

See std::collections::HashSet::try_reserve.

pub fn shrink_to_fit(&mut self)

See std::collections::HashSet::shrink_to_fit.

pub fn shrink_to(&mut self, min_capacity: usize)

See std::collections::HashSet::shrink_to.

pub fn contains<Q>(&self, value: &Q) -> bool

where T: Borrow<Q>, Q: Hash + Eq + ?Sized,

See std::collections::HashSet::contains.

pub fn get<Q>(&self, value: &Q) -> Option<&T>

where T: Borrow<Q>, Q: Hash + Eq + ?Sized,

See std::collections::HashSet::get.

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

See std::collections::HashSet::is_disjoint.

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

See std::collections::HashSet::is_subset.

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

See std::collections::HashSet::is_superset.

pub fn insert(&mut self, value: T) -> bool

See std::collections::HashSet::insert.

pub fn replace(&mut self, value: T) -> Option<T>

See std::collections::HashSet::replace.

pub fn remove<Q>(&mut self, value: &Q) -> bool

where T: Borrow<Q>, Q: Hash + Eq + ?Sized,

See std::collections::HashSet::remove.

pub fn take<Q>(&mut self, value: &Q) -> Option<T>

where T: Borrow<Q>, Q: Hash + Eq + ?Sized,

See std::collections::HashSet::take.

Trait Implementations

impl<T> BitAnd<&HashSet<T>> for &HashSet<T>

where T: Eq + Hash + Clone,

type Output = HashSet<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: &HashSet<T>) -> HashSet<T>

Performs the & operation.

impl<T> BitOr<&HashSet<T>> for &HashSet<T>

where T: Eq + Hash + Clone,

type Output = HashSet<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: &HashSet<T>) -> HashSet<T>

Performs the | operation.

impl<T> BitXor<&HashSet<T>> for &HashSet<T>

where T: Eq + Hash + Clone,

type Output = HashSet<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &HashSet<T>) -> HashSet<T>

Performs the ^ operation.

impl<T: Clone> Clone for HashSet<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for HashSet<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for HashSet<T>

fn default() -> HashSet<T>

Returns the “default value” for a type.

impl<'a, T> Extend<&'a T> for HashSet<T>

where T: 'a + Eq + Hash + Copy,

fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

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

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<T> for HashSet<T>

where T: Eq + Hash,

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

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

Reserves capacity in a collection for the given number of additional elements.

impl<T, const N: usize> From<[T; N]> for HashSet<T>

where T: Eq + Hash,

fn from(arr: [T; N]) -> Self

Converts to this type from the input type.

impl<T> From<HashSet<T>> for HashSet<T>

where T: Eq + Hash,

fn from(set: StdSet<T>) -> Self

Converts to this type from the input type.

impl<T> FromIterator<T> for HashSet<T>

where T: Eq + Hash,

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> HashSet<T>

Creates a value from an iterator.

impl<T> PartialEq for HashSet<T>

where T: Eq + Hash,

fn eq(&self, other: &Self) -> 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> Sub<&HashSet<T>> for &HashSet<T>

where T: Eq + Hash + Clone,

type Output = HashSet<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &HashSet<T>) -> HashSet<T>

Performs the - operation.

impl<T> Eq for HashSet<T>

where T: Eq + Hash,