Struct xlang_abi::collection::HashSet

pub struct HashSet<K, H: BuildHasher = BuildHasherDefault<XLangHasher>, A: Allocator = XLangAlloc> { /* private fields */ }

A HashSet that has a stable ABI and obtains storage backed by an Allocator

Implementations

impl<K, H: BuildHasher + Default, A: Allocator + Default> HashSet<K, H, A>

pub fn new() -> Self

Constructs a new HashSet with a Default allocator and Default hasher

impl<K, H: BuildHasher, A: Allocator + Default> HashSet<K, H, A>

pub fn with_hasher(hasher: H) -> Self

Constructs a new HashSet with the given hasher and a Default allocator

impl<K, H: BuildHasher + Default, A: Allocator> HashSet<K, H, A>

pub fn new_in(alloc: A) -> Self

Constructs a new HashSet with the given allocator and a Default hasher

impl<K, H: BuildHasher, A: Allocator> HashSet<K, H, A>

pub fn with_hasher_in(hasher: H, alloc: A) -> Self

Constructs a new HashSet with the given hasher and allocator

pub fn iter(&self) -> SetIter<'_, K>

Produces an Iterator over each element of the set

impl<K: Eq + Hash, H: BuildHasher, A: Allocator> HashSet<K, H, A>

pub fn contains<Q: ?Sized + Hash + Eq>(&self, val: &Q) -> boolwhere
    K: Borrow<Q>,

Checks if self contains the given val.

pub fn insert(&mut self, val: K) -> Result<(), K>

Inserts val into the set if it is not already present (according to the Eq implementation), or returns it (as an Err) instead.

pub fn remove<Q: ?Sized + Hash + Eq>(&mut self, val: &Q) -> Option<K>where
    K: Borrow<Q>,

Removes a value from the set and returns it if present

Trait Implementations

impl<K: Clone, H: Clone + BuildHasher, A: Clone + Allocator> Clone for HashSet<K, H, A>

fn clone(&self) -> HashSet<K, H, A>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, H: Debug + BuildHasher, A: Debug + Allocator> Debug for HashSet<K, H, A>

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

Formats the value using the given formatter.

impl<K, H: BuildHasher + Default, A: Allocator + Default> Default for HashSet<K, H, A>

fn default() -> Self

Returns the “default value” for a type.

impl<K: Eq + Hash, H: BuildHasher + Default, A: Allocator + Default> Extend<K> for HashSet<K, H, A>

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

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<K: Eq + Hash, H: BuildHasher + Default, A: Allocator + Default> FromIterator<K> for HashSet<K, H, A>

fn from_iter<I>(iter: I) -> Selfwhere
    I: IntoIterator<Item = K>,

Creates a value from an iterator.

impl<K: Eq + Hash, H: BuildHasher, A: Allocator> Hash for HashSet<K, H, A>

fn hash<Hash: Hasher>(&self, hasher: &mut Hash)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where
    H: Hasher,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K: Eq + Hash, H: BuildHasher, A: Allocator> PartialEq<HashSet<K, H, A>> for HashSet<K, H, A>

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

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Eq + Hash, H: BuildHasher, A: Allocator> Eq for HashSet<K, H, A>