Struct collected::UniqueHashSet

pub struct UniqueHashSet<A>(_);

A collection that takes unique values into a set.

It maintains a HashSet internally. When it is built from iterator or extended, it expects unique input values. Otherwise, it empties out the internal and ignore future values.

Implementations

impl<A> UniqueHashSet<A>

pub fn unwrap(self) -> HashSet<A>

pub fn get(&self) -> Option<&HashSet<A>>

pub fn into_inner(self) -> Option<HashSet<A>>

Trait Implementations

impl<A: Clone> Clone for UniqueHashSet<A>

fn clone(&self) -> UniqueHashSet<A>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug> Debug for UniqueHashSet<A>

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

Formats the value using the given formatter.

impl<A> Default for UniqueHashSet<A>

fn default() -> Self

Returns the “default value” for a type.

impl<A> Extend<A> for UniqueHashSet<A> where
    A: Hash + Eq, 

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

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<A> FromIterator<A> for UniqueHashSet<A> where
    A: Hash + Eq, 

fn from_iter<T: IntoIterator<Item = A>>(iter: T) -> Self

Creates a value from an iterator.