Struct UnorderedHashSet

pub struct UnorderedHashSet<Key, BH = RandomState>(/* private fields */);

A hash set that does not care about the order of insertion.

In particular, it does not support iterating, in order to guarantee deterministic compilation. For an iterable version see OrderedHashSet.

Implementations

impl<Key, BH> UnorderedHashSet<Key, BH>

pub fn len(&self) -> usize

Returns the number of elements in the set.

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

pub fn clear(&mut self)

Clears the set, removing all values.

impl<Key: Hash + Eq, BH: BuildHasher> UnorderedHashSet<Key, BH>

pub fn insert(&mut self, key: Key) -> bool

Inserts the value into the set.

If an equivalent item already exists in the set, returns false. Otherwise, returns true.

pub fn remove<Q: ?Sized + Hash + Eq>(&mut self, value: &Q) -> bool

where Key: Borrow<Q>,

Removes a value from the set. Returns whether the value was present in the set.

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

Extends the set with the content of the given iterator.

pub fn extend_unordered(&mut self, other: Self)

Extends the set with the content of another set.

pub fn contains<Q: ?Sized + Hash + Eq>(&self, value: &Q) -> bool

where Key: Borrow<Q>,

Returns true if an equivalent to value exists in the set.

Trait Implementations

impl<Key: Clone, BH: Clone> Clone for UnorderedHashSet<Key, BH>

fn clone(&self) -> UnorderedHashSet<Key, BH>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Key: Debug, BH: Debug> Debug for UnorderedHashSet<Key, BH>

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

Formats the value using the given formatter.

impl<K, BH: Default> Default for UnorderedHashSet<K, BH>

fn default() -> Self

Returns the “default value” for a type.

impl<Key: Hash + Eq, BH: BuildHasher + Default> FromIterator<Key> for UnorderedHashSet<Key, BH>

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

Creates a value from an iterator.

impl<K, BH> PartialEq for UnorderedHashSet<K, BH>

where K: Eq + Hash, BH: BuildHasher,

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<'a, Key, BH> Sub for &'a UnorderedHashSet<Key, BH>

where &'a HashSet<Key, BH>: Sub<Output = HashSet<Key, BH>>,

type Output = UnorderedHashSet<Key, BH>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self::Output

Performs the - operation.

impl<K, BH> Eq for UnorderedHashSet<K, BH>

where K: Eq + Hash, BH: BuildHasher,