Struct variadics::variadic_collections::VariadicHashSet

pub struct VariadicHashSet<T, S = RandomState> { /* private fields */ }

HashSet that stores Variadics of owned values but allows for lookups with RefVariadics as well

Implementations

impl<T> VariadicHashSet<T>

pub fn new() -> Self

Creates a new VariadicHashSet with a default hasher.

impl<T, S> VariadicHashSet<T, S>

where T: PartialEqVariadic, for<'a> T::AsRefVar<'a>: Hash, S: BuildHasher,

pub fn get<'a>(&'a self, ref_var: T::AsRefVar<'_>) -> Option<&'a T>

given a RefVariadic lookup key, get a RefVariadic version of a tuple in the set

impl<T, S> VariadicHashSet<T, S>

pub fn with_hasher(hasher: S) -> Self

allocate a new VariadicHashSet with a specific hasher

pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> Self

allocate a new VariadicHashSet with a specific hasher and capacity

Trait Implementations

impl<T: Clone, S: Clone> Clone for VariadicHashSet<T, S>

fn clone(&self) -> VariadicHashSet<T, S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for VariadicHashSet<T>

where T: Debug + VariadicExt + PartialEqVariadic + Eq + Hash, for<'a> T::AsRefVar<'a>: Hash + Debug,

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

Formats the value using the given formatter.

impl<T> Default for VariadicHashSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<K, S> Extend<K> for VariadicHashSet<K, S>

where K: Eq + Hash + PartialEqVariadic, S: BuildHasher, for<'a> K::AsRefVar<'a>: Hash,

fn extend<T: IntoIterator<Item = K>>(&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<T, S> FromIterator<T> for VariadicHashSet<T, S>

where T: Eq + Hash + PartialEqVariadic, S: BuildHasher + Default, for<'a> T::AsRefVar<'a>: Hash,

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

Creates a value from an iterator.

impl<T, S> IntoIterator for VariadicHashSet<T, S>

where T: VariadicExt + PartialEqVariadic,

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, S> PartialEq for VariadicHashSet<T, S>

where T: Eq + Hash + PartialEqVariadic, S: BuildHasher, for<'a> T::AsRefVar<'a>: 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, S> VariadicCollection for VariadicHashSet<T, S>

where T: VariadicExt + PartialEqVariadic + Eq + Hash, for<'a> T::AsRefVar<'a>: Hash, S: BuildHasher,

type Schema = T

The Schema (aka Variadic type) associated with tuples in this set

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

Insert an element into the set, return true if successful

fn len(&self) -> usize

Return number of elements in the set

fn is_empty(&self) -> bool

Return true if empty

fn drain(&mut self) -> impl Iterator<Item = Self::Schema>

iterate and drain items from the set without deallocating the container

fn contains(&self, value: <Self::Schema as VariadicExt>::AsRefVar<'_>) -> bool

Check for containment

fn iter(&self) -> impl Iterator<Item = T::AsRefVar<'_>>

Iterate over the elements of the set

impl<T, S> VariadicSet for VariadicHashSet<T, S>

where T: VariadicExt + PartialEqVariadic + Eq + Hash, for<'a> T::AsRefVar<'a>: Hash, S: BuildHasher,