Struct rustc_data_structures :: unord :: UnordMap Copy item path

pub fn try_insert( &mut self, k: K, v: V, ) -> Result<&mut V, OccupiedError<'_, K, V>>

pub fn contains_key<Q>(&self, k: &Q) -> bool
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn is_empty(&self) -> bool

pub fn entry(&mut self, key: K) -> Entry<'_, K, V>

pub fn get<Q>(&self, k: &Q) -> Option<&V>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

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

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

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

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

pub fn keys(&self) -> UnordItems<&K, impl Iterator<Item = &K>>

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

Returns the entries of this map 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 K is expensive (e.g. a DefId -> DefPathHash lookup).

pub fn to_sorted_stable_ord(&self) -> Vec<(&K, &V)>
where K: StableCompare,

Returns the entries of this map in stable sort order (as defined by StableCompare). This method can be much more efficient than into_sorted because it does not need to transform keys to their ToStableHashKey equivalent.

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

Returns the entries of this map 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 K is expensive (e.g. a DefId -> DefPathHash lookup).

pub fn into_sorted_stable_ord(self) -> Vec<(K, V)>
where K: StableCompare,

Returns the entries of this map in stable sort order (as defined by StableCompare). This method can be much more efficient than into_sorted because it does not need to transform keys to their ToStableHashKey equivalent.

pub fn values_sorted<HCX>( &self, hcx: &HCX, cache_sort_key: bool, ) -> impl Iterator<Item = &V>
where K: ToStableHashKey<HCX>,

Returns the values of this map in stable sort order (as defined by K’s ToStableHashKey implementation).

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 K is expensive (e.g. a DefId -> DefPathHash lookup).

Trait Implementations§

impl<K: Clone + Eq + Hash, V: Clone> Clone for UnordMap<K, V>

fn clone(&self) -> UnordMap<K, 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

impl<K: Debug + Eq + Hash, V: Debug> Debug for UnordMap<K, V>

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

Formats the value using the given formatter. Read more

impl<K, V, D: Decoder> Decodable<D> for UnordMap<K, V>
where K: Decodable<D> + Eq + Hash, V: Decodable<D>,

fn decode(decoder: &mut D) -> Self

impl<K: Eq + Hash, V> Default for UnordMap<K, V>

fn default() -> Self

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

impl<K, V, E: Encoder> Encodable<E> for UnordMap<K, V>
where K: Encodable<E> + Eq + Hash, V: Encodable<E>,

fn encode(&self, encoder: &mut E)

impl<K: Hash + Eq, V> Extend<(K, V)> for UnordMap<K, V>

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

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

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

impl<K: Hash + Eq, V, I: Iterator<Item = (K, V)>> From<UnordItems<(K, V), I>> for UnordMap<K, V>

fn from(items: UnordItems<(K, V), I>) -> Self

Converts to this type from the input type.

impl<K: Hash + Eq, V> FromIterator<(K, V)> for UnordMap<K, V>

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

Creates a value from an iterator. Read more

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

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

impl<K, Q, V> Index<&Q> for UnordMap<K, V>
where K: Eq + Hash + Borrow<Q>, Q: Eq + Hash + ?Sized,

type Output = V

The returned type after indexing.

fn index(&self, key: &Q) -> &V

Performs the indexing (container[index]) operation. Read more

impl<K: PartialEq + Eq + Hash, V: PartialEq> PartialEq for UnordMap<K, V>

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

Tests for self and other values to be equal, and is used by ==.

1.0.0 · source§

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

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

impl<K: Eq + Eq + Hash, V: Eq> Eq for UnordMap<K, V>

impl<K, V> !IntoIterator for UnordMap<K, V>

impl<K: Eq + Hash, V> StructuralPartialEq for UnordMap<K, V>

impl<K: Eq + Hash, V> UnordCollection for UnordMap<K, V>

Auto Trait Implementations§

impl<K, V> Freeze for UnordMap<K, V>

impl<K, V> RefUnwindSafe for UnordMap<K, V>
where K: RefUnwindSafe, V: RefUnwindSafe,

impl<K, V> Send for UnordMap<K, V>
where K: Send, V: Send,

impl<K, V> Sync for UnordMap<K, V>
where K: Sync, V: Sync,

impl<K, V> Unpin for UnordMap<K, V>
where K: Unpin, V: Unpin,

impl<K, V> UnwindSafe for UnordMap<K, V>
where K: UnwindSafe, V: UnwindSafe,

Blanket Implementations§

impl<T> Aligned for T

const ALIGN: Alignment = const ALIGN: Alignment = Alignment::of::<Self>();

Alignment of Self.

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

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

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

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

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

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

Mutably borrows from an owned value. Read more

impl<T> CloneToUninit for T
where T: Clone,

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)

Performs copy-assignment from self to dst. Read more

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

impl<C, T> ExtendUnord<T> for C
where C: Extend<T> + UnordCollection,

fn extend_unord(&mut self, items: UnordItems<T, I>)
where I: Iterator<Item = T>,

Extend this unord collection with the given UnordItems. This method is called extend_unord instead of just extend so it does not conflict with Extend::extend. Otherwise there would be many places where the two methods would have to be explicitly disambiguated via UFCS.

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

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

fn into(self) -> U

Calls U::from(self).

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

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

impl<T> ToOwned for T
where T: Clone,

type Owned = T

The resulting type after obtaining ownership.

fn to_owned(&self) -> T

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

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

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

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

type Error = Infallible

The type returned in the event of a conversion error.

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

Performs the conversion.

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

type Error = >::Error

The type returned in the event of a conversion error.

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

Performs the conversion.

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more