Struct rustc_data_structures::unord::UnordSet

pub struct UnordSet<V: Eq + Hash> {
    inner: FxHashSet<V>,
}

This is a set collection type that tries very hard to not expose any internal iteration. This is a useful property when trying to uphold the determinism invariants imposed by the query system.

This collection type is a good choice for set-like collections the keys of which don’t have a semantic ordering.

See MCP 533 for more information.

Fields

inner: FxHashSet<V>

Implementations

impl<V: Eq + Hash> UnordSet<V>

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn insert(&mut self, v: V) -> bool

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

pub fn items<'a>(&'a self) -> UnordItems<&'a V, impl Iterator<Item = &'a V>>

pub fn into_items(self) -> UnordItems<V, impl Iterator<Item = V>>

pub fn extend<I: Iterator<Item = V>>(&mut self, items: UnordItems<V, I>)

Trait Implementations

impl<V: Clone + Eq + Hash> Clone for UnordSet<V>

fn clone(&self) -> UnordSet<V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<V: Debug + Eq + Hash> Debug for UnordSet<V>

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

Formats the value using the given formatter.

impl<V, __D: Decoder> Decodable<__D> for UnordSet<V>where
    V: Decodable<__D> + Eq + Hash,

fn decode(__decoder: &mut __D) -> Self

impl<V: Eq + Hash> Default for UnordSet<V>

fn default() -> Self

Returns the “default value” for a type.

impl<V, __E: Encoder> Encodable<__E> for UnordSet<V>where
    V: Encodable<__E> + Eq + Hash,

fn encode(&self, __encoder: &mut __E)

impl<V: Hash + Eq> Extend<V> for UnordSet<V>

fn extend<T: IntoIterator<Item = V>>(&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<HCX, V: Hash + Eq + HashStable<HCX>> HashStable<HCX> for UnordSet<V>

fn hash_stable(&self, hcx: &mut HCX, hasher: &mut StableHasher)

impl<V> !IntoIterator for UnordSet<V>

type Item

The type of the elements being iterated over.

type IntoIter: Iterator<Item = Self::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<V: PartialEq + Eq + Hash> PartialEq<UnordSet<V>> for UnordSet<V>

fn eq(&self, other: &UnordSet<V>) -> 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<V: Eq + Eq + Hash> Eq for UnordSet<V>

impl<V: Eq + Hash> StructuralEq for UnordSet<V>

impl<V: Eq + Hash> StructuralPartialEq for UnordSet<V>

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.

Size: 32 bytes