Struct rustc_ap_rustc_data_structures::stable_map::StableMap [−][src]
pub struct StableMap<K, V> { /* fields omitted */ }Expand description
A deterministic wrapper around FxHashMap that does not provide iteration support.
It supports insert, remove, get and get_mut functions from FxHashMap.
It also allows to convert hashmap to a sorted vector with the method into_sorted_vector().
Implementations
impl<K, V> StableMap<K, V> where
K: Eq + Hash, [src]
impl<K, V> StableMap<K, V> where
K: Eq + Hash, [src]pub fn new() -> StableMap<K, V>[src]
pub fn into_sorted_vector(self) -> Vec<(K, V)> where
K: Ord + Copy, [src]
K: Ord + Copy,
pub fn entry(&mut self, k: K) -> Entry<'_, K, V>[src]
pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V> where
K: Borrow<Q>,
Q: Hash + Eq, [src]
K: Borrow<Q>,
Q: Hash + Eq,
pub fn get_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut V> where
K: Borrow<Q>,
Q: Hash + Eq, [src]
K: Borrow<Q>,
Q: Hash + Eq,
pub fn insert(&mut self, k: K, v: V) -> Option<V>[src]
pub fn remove<Q: ?Sized>(&mut self, k: &Q) -> Option<V> where
K: Borrow<Q>,
Q: Hash + Eq, [src]
K: Borrow<Q>,
Q: Hash + Eq,
Trait Implementations
impl<K, V> Eq for StableMap<K, V> where
K: Eq + Hash,
V: Eq, [src]
K: Eq + Hash,
V: Eq,
Auto Trait Implementations
impl<K, V> RefUnwindSafe for StableMap<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for StableMap<K, V> where
K: Send,
V: Send,
K: Send,
V: Send,
impl<K, V> Sync for StableMap<K, V> where
K: Sync,
V: Sync,
K: Sync,
V: Sync,
impl<K, V> Unpin for StableMap<K, V> where
K: Unpin,
V: Unpin,
K: Unpin,
V: Unpin,
impl<K, V> UnwindSafe for StableMap<K, V> where
K: UnwindSafe,
V: UnwindSafe,
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]pub fn borrow_mut(&mut self) -> &mut T[src]
pub fn borrow_mut(&mut self) -> &mut T[src]Mutably borrows from an owned value. Read more
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized, [src]
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized, [src]pub fn equivalent(&self, key: &K) -> bool[src]
pub fn equivalent(&self, key: &K) -> bool[src]Compare self to key and return true if they are equal.
impl<T> Instrument for T[src]
impl<T> Instrument for T[src]fn instrument(self, span: Span) -> Instrumented<Self>[src]
fn instrument(self, span: Span) -> Instrumented<Self>[src]Instruments this type with the provided Span, returning an
Instrumented wrapper. Read more
fn in_current_span(self) -> Instrumented<Self>[src]
fn in_current_span(self) -> Instrumented<Self>[src]impl<T> ToOwned for T where
T: Clone, [src]
impl<T> ToOwned for T where
T: Clone, [src]type Owned = T
type Owned = TThe resulting type after obtaining ownership.
pub fn to_owned(&self) -> T[src]
pub fn to_owned(&self) -> T[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)[src]
pub fn clone_into(&self, target: &mut T)[src]🔬 This is a nightly-only experimental API. (toowned_clone_into)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>, pub fn vzip(self) -> V
impl<'a, T> Captures<'a> for T where
T: ?Sized, [src]
T: ?Sized,