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

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§

source§

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

source

pub fn new() -> Self

source

pub fn len(&self) -> usize

source

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

source

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

source

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

source

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

source

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

source

pub fn to_sorted<HCX>(&self, hcx: &HCX, cache_sort_key: bool) -> Vec<&V>where
    V: ToStableHashKey<HCX>,

Returns the items of this set in stable sort order (as defined by ToStableHashKey).

The cache_sort_key parameter controls if slice::sort_by_cached_key or slice::sort_unstable_by_key will be used for sorting the vec. Use cache_sort_key when the ToStableHashKey::to_stable_hash_key implementation for V is expensive (e.g. a DefId -> DefPathHash lookup).

source

pub fn to_sorted_stable_ord(&self) -> Vec<V>where
    V: Ord + StableOrd + Copy,

Returns the items of this set in stable sort order (as defined by StableOrd). This method is much more efficient than into_sorted because it does not need to transform keys to their ToStableHashKey equivalent.

source

pub fn into_sorted<HCX>(self, hcx: &HCX, cache_sort_key: bool) -> Vec<V>where
    V: ToStableHashKey<HCX>,

Returns the items of this set in stable sort order (as defined by ToStableHashKey).

The cache_sort_key parameter controls if slice::sort_by_cached_key or slice::sort_unstable_by_key will be used for sorting the vec. Use cache_sort_key when the ToStableHashKey::to_stable_hash_key implementation for V is expensive (e.g. a DefId -> DefPathHash lookup).

source

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

source

pub fn clear(&mut self)

Trait Implementations§

source§

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

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

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

source§

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

Formats the value using the given formatter. Read more
source§

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

source§

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

source§

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

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

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

source§

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

source§

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

source§

fn extend<T: IntoIterator<Item = V>>(&mut self, iter: T)

Extends a collection with the contents of an iterator. Read more
source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
source§

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. Read more
source§

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

source§

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

Creates a value from an iterator. Read more
source§

impl<HCX, V: Hash + Eq + HashStable<HCX>> HashStable<HCX> for UnordSet<V>

source§

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

source§

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?
1.0.0 · source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

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

source§

fn eq(&self, other: &UnordSet<V>) -> bool

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

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.
source§

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

source§

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

source§

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

Auto Trait Implementations§

§

impl<V> RefUnwindSafe for UnordSet<V>where
    V: RefUnwindSafe,

§

impl<V> Send for UnordSet<V>where
    V: Send,

§

impl<V> Sync for UnordSet<V>where
    V: Sync,

§

impl<V> Unpin for UnordSet<V>where
    V: Unpin,

§

impl<V> UnwindSafe for UnordSet<V>where
    V: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere
    T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere
    T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere
    T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere
    U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for Twhere
    T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere
    U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere
    U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<'a, T> Captures<'a> for Twhere
    T: ?Sized,

source§

impl<T> Erased for T

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