Struct KeyHashSet

pub struct KeyHashSet<T, K: Hash> { /* private fields */ }

KeyHashSet

Trait Implementations

impl<T, K> Debug for KeyHashSet<T, K>

where T: Clone + Debug, K: Debug + Hash,

Debug for KeyHashSet

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

Formats the value using the given formatter.

impl<T, K> Extend<T> for KeyHashSet<T, K>

where T: Clone, K: Hash + Eq,

Extend for KeyHashSet

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, K> IntoIterator for KeyHashSet<T, K>

where K: Hash,

IntoIterator for KeyHashSet

type Item = T

The type of the elements being iterated over.

type IntoIter = Map<IntoIter<K, T>, fn(_: (K, T)) -> T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, K> KeySet<T, K> for KeyHashSet<T, K>

where T: Clone, K: Eq + Hash,

fn new(get_key: GetKeyType<T, K>) -> Self

Create KeySet

fn from_intoiter( get_key: GetKeyType<T, K>, iter: impl IntoIterator<Item = T>, ) -> Self

fn insert(&mut self, value: T)

Operate KeySet elem

fn contains(&self, value: &T) -> bool

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

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

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

fn len(&self) -> usize

fn iter(&self) -> IntoIter<&T>

fn intersection<'a>(&'a self, other: &'a Self) -> Self

Operate with other KeySet

fn union<'a>(&'a self, other: &'a Self) -> Self

fn difference<'a>(&'a self, other: &'a Self) -> Self

fn symmetric_difference<'a>(&'a self, other: &'a Self) -> Self

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

Check KeySet relationship

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

fn is_empty(&self) -> bool

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

impl<T, K> PartialEq for KeyHashSet<T, K>

where T: Clone, K: Eq + Hash,

PartialEq for KeyHashSet

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.