Struct m6_key_set::KeyHashSet [−][src]
pub struct KeyHashSet<T, K: Hash> { /* fields omitted */ }
Expand description
KeyHashSet
Trait Implementations
impl<T, K> Debug for KeyHashSet<T, K> where
T: Clone + Debug,
K: Debug + Hash,
[src]
impl<T, K> Debug for KeyHashSet<T, K> where
T: Clone + Debug,
K: Debug + Hash,
[src]Debug for KeyHashSet
impl<T, K> Extend<T> for KeyHashSet<T, K> where
T: Clone,
K: Hash + Eq,
[src]
impl<T, K> Extend<T> for KeyHashSet<T, K> where
T: Clone,
K: Hash + Eq,
[src]Extend for KeyHashSet
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
[src]
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
[src]Extends a collection with the contents of an iterator. Read more
fn extend_one(&mut self, item: A)
[src]
fn extend_one(&mut self, item: A)
[src]🔬 This is a nightly-only experimental API. (
extend_one
)Extends a collection with exactly one element.
fn extend_reserve(&mut self, additional: usize)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]🔬 This is a nightly-only experimental API. (
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
impl<T, K> IntoIterator for KeyHashSet<T, K> where
K: Hash,
[src]
impl<T, K> IntoIterator for KeyHashSet<T, K> where
K: Hash,
[src]IntoIterator for KeyHashSet
impl<T, K> KeySet<T, K> for KeyHashSet<T, K> where
T: Clone,
K: Eq + Hash,
[src]
impl<T, K> KeySet<T, K> for KeyHashSet<T, K> where
T: Clone,
K: Eq + Hash,
[src]fn new(get_key: GetKeyType<T, K>) -> Self
[src]
fn new(get_key: GetKeyType<T, K>) -> Self
[src]Create KeySet
fn from_intoiter(
get_key: GetKeyType<T, K>,
iter: impl IntoIterator<Item = T>
) -> Self
[src]
get_key: GetKeyType<T, K>,
iter: impl IntoIterator<Item = T>
) -> Self
fn contains(&self, value: &T) -> bool
[src]
fn remove(&mut self, value: &T) -> bool
[src]
fn take(&mut self, value: &T) -> Option<T>
[src]
fn get(&mut self, value: &T) -> Option<&T>
[src]
fn len(&self) -> usize
[src]
fn iter(&self) -> IntoIter<&T>
[src]
fn intersection<'a>(&'a self, other: &'a Self) -> Self
[src]
fn intersection<'a>(&'a self, other: &'a Self) -> Self
[src]Operate with other KeySet
fn union<'a>(&'a self, other: &'a Self) -> Self
[src]
fn difference<'a>(&'a self, other: &'a Self) -> Self
[src]
fn symmetric_difference<'a>(&'a self, other: &'a Self) -> Self
[src]
fn is_superset(&self, other: &Self) -> bool
[src]
fn is_empty(&self) -> bool
[src]
fn is_disjoint(&self, other: &Self) -> bool
[src]
impl<T, K> PartialEq<KeyHashSet<T, K>> for KeyHashSet<T, K> where
T: Clone,
K: Eq + Hash,
[src]
impl<T, K> PartialEq<KeyHashSet<T, K>> for KeyHashSet<T, K> where
T: Clone,
K: Eq + Hash,
[src]PartialEq for KeyHashSet
Auto Trait Implementations
impl<T, K> RefUnwindSafe for KeyHashSet<T, K> where
K: RefUnwindSafe,
T: RefUnwindSafe,
K: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, K> Send for KeyHashSet<T, K> where
K: Send,
T: Send,
K: Send,
T: Send,
impl<T, K> Sync for KeyHashSet<T, K> where
K: Sync,
T: Sync,
K: Sync,
T: Sync,
impl<T, K> Unpin for KeyHashSet<T, K> where
K: Unpin,
T: Unpin,
K: Unpin,
T: Unpin,
impl<T, K> UnwindSafe for KeyHashSet<T, K> where
K: UnwindSafe,
T: UnwindSafe,
K: UnwindSafe,
T: UnwindSafe,