[−][src]Enum rustc_ap_rustc_data_structures::sso::SsoHashMap
Small-storage-optimized implementation of a map.
Stores elements in a small array up to a certain length
and switches to HashMap
when that length is exceeded.
Variants
Map(FxHashMap<K, V>)
Implementations
impl<K, V> SsoHashMap<K, V>
[src]
pub fn new() -> Self
[src]
Creates an empty SsoHashMap
.
pub fn with_capacity(cap: usize) -> Self
[src]
Creates an empty SsoHashMap
with the specified capacity.
pub fn clear(&mut self)
[src]
Clears the map, removing all key-value pairs. Keeps the allocated memory for reuse.
pub fn capacity(&self) -> usize
[src]
Returns the number of elements the map can hold without reallocating.
pub fn len(&self) -> usize
[src]
Returns the number of elements in the map.
pub fn is_empty(&self) -> bool
[src]
Returns true
if the map contains no elements.
pub fn iter(&self) -> <&Self as IntoIterator>::IntoIterⓘ
[src]
An iterator visiting all key-value pairs in arbitrary order.
The iterator element type is (&'a K, &'a V)
.
pub fn iter_mut(&mut self) -> impl Iterator<Item = (&K, &mut V)>
[src]
An iterator visiting all key-value pairs in arbitrary order,
with mutable references to the values.
The iterator element type is (&'a K, &'a mut V)
.
pub fn keys(&self) -> impl Iterator<Item = &K>
[src]
An iterator visiting all keys in arbitrary order.
The iterator element type is &'a K
.
pub fn values(&self) -> impl Iterator<Item = &V>
[src]
An iterator visiting all values in arbitrary order.
The iterator element type is &'a V
.
pub fn values_mut(&mut self) -> impl Iterator<Item = &mut V>
[src]
An iterator visiting all values mutably in arbitrary order.
The iterator element type is &'a mut V
.
pub fn drain(&mut self) -> impl Iterator<Item = (K, V)> + '_
[src]
Clears the map, returning all key-value pairs as an iterator. Keeps the allocated memory for reuse.
impl<K: Eq + Hash, V> SsoHashMap<K, V>
[src]
pub fn reserve(&mut self, additional: usize)
[src]
Reserves capacity for at least additional
more elements to be inserted
in the SsoHashMap
. The collection may reserve more space to avoid
frequent reallocations.
pub fn shrink_to_fit(&mut self)
[src]
Shrinks the capacity of the map as much as possible. It will drop down as much as possible while maintaining the internal rules and possibly leaving some space in accordance with the resize policy.
pub fn retain<F>(&mut self, f: F) where
F: FnMut(&K, &mut V) -> bool,
[src]
F: FnMut(&K, &mut V) -> bool,
Retains only the elements specified by the predicate.
pub fn insert(&mut self, key: K, value: V) -> Option<V>
[src]
Inserts a key-value pair into the map.
If the map did not have this key present, None
is returned.
If the map did have this key present, the value is updated, and the old
value is returned. The key is not updated, though; this matters for
types that can be ==
without being identical. See the [module-level
documentation] for more.
pub fn remove(&mut self, key: &K) -> Option<V>
[src]
Removes a key from the map, returning the value at the key if the key was previously in the map.
pub fn remove_entry(&mut self, key: &K) -> Option<(K, V)>
[src]
Removes a key from the map, returning the stored key and value if the key was previously in the map.
pub fn get(&self, key: &K) -> Option<&V>
[src]
Returns a reference to the value corresponding to the key.
pub fn get_mut(&mut self, key: &K) -> Option<&mut V>
[src]
Returns a mutable reference to the value corresponding to the key.
pub fn get_key_value(&self, key: &K) -> Option<(&K, &V)>
[src]
Returns the key-value pair corresponding to the supplied key.
pub fn contains_key(&self, key: &K) -> bool
[src]
Returns true
if the map contains a value for the specified key.
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
[src]
Gets the given key's corresponding entry in the map for in-place manipulation.
Trait Implementations
impl<K: Clone, V: Clone> Clone for SsoHashMap<K, V>
[src]
fn clone(&self) -> SsoHashMap<K, V>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<K, V> Debug for SsoHashMap<K, V> where
K: Debug,
V: Debug,
[src]
K: Debug,
V: Debug,
impl<K, V> Default for SsoHashMap<K, V>
[src]
impl<'a, K, V> Extend<(&'a K, &'a V)> for SsoHashMap<K, V> where
K: Eq + Hash + Copy,
V: Copy,
[src]
K: Eq + Hash + Copy,
V: Copy,
fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)
[src]
fn extend_one(&mut self, (k, v): (&'a K, &'a V))
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<K: Eq + Hash, V> Extend<(K, V)> for SsoHashMap<K, V>
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = (K, V)>,
[src]
I: IntoIterator<Item = (K, V)>,
fn extend_one(&mut self, (k, v): (K, V))
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<K: Eq + Hash, V> FromIterator<(K, V)> for SsoHashMap<K, V>
[src]
fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> SsoHashMap<K, V>
[src]
impl<'a, K, V> Index<&'a K> for SsoHashMap<K, V> where
K: Eq + Hash,
[src]
K: Eq + Hash,
impl<K, V> IntoIterator for SsoHashMap<K, V>
[src]
type IntoIter = EitherIter<<ArrayVec<[(K, V); 8]> as IntoIterator>::IntoIter, <FxHashMap<K, V> as IntoIterator>::IntoIter>
Which kind of iterator are we turning this into?
type Item = <Self::IntoIter as Iterator>::Item
The type of the elements being iterated over.
fn into_iter(self) -> Self::IntoIter
[src]
impl<'a, K, V> IntoIterator for &'a SsoHashMap<K, V>
[src]
type IntoIter = EitherIter<Map<<&'a ArrayVec<[(K, V); 8]> as IntoIterator>::IntoIter, fn(_: &'a (K, V)) -> (&'a K, &'a V)>, <&'a FxHashMap<K, V> as IntoIterator>::IntoIter>
Which kind of iterator are we turning this into?
type Item = <Self::IntoIter as Iterator>::Item
The type of the elements being iterated over.
fn into_iter(self) -> Self::IntoIter
[src]
impl<'a, K, V> IntoIterator for &'a mut SsoHashMap<K, V>
[src]
type IntoIter = EitherIter<Map<<&'a mut ArrayVec<[(K, V); 8]> as IntoIterator>::IntoIter, fn(_: &'a mut (K, V)) -> (&'a K, &'a mut V)>, <&'a mut FxHashMap<K, V> as IntoIterator>::IntoIter>
Which kind of iterator are we turning this into?
type Item = <Self::IntoIter as Iterator>::Item
The type of the elements being iterated over.
fn into_iter(self) -> Self::IntoIter
[src]
Auto Trait Implementations
impl<K, V> RefUnwindSafe for SsoHashMap<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for SsoHashMap<K, V> where
K: Send,
V: Send,
K: Send,
V: Send,
impl<K, V> Sync for SsoHashMap<K, V> where
K: Sync,
V: Sync,
K: Sync,
V: Sync,
impl<K, V> Unpin for SsoHashMap<K, V> where
K: Unpin,
V: Unpin,
K: Unpin,
V: Unpin,
impl<K, V> UnwindSafe for SsoHashMap<K, V> where
K: UnwindSafe,
V: UnwindSafe,
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut Tⓘ
[src]
impl<'a, T> Captures<'a> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Erased for T
[src]
impl<T> From<T> for T
[src]
impl<T> Instrument for T
[src]
fn instrument(self, span: Span) -> Instrumented<Self>
[src]
fn in_current_span(self) -> Instrumented<Self>
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
pub fn into_iter(self) -> I
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,