Struct weak_table::WeakKeyHashMap [−][src]
pub struct WeakKeyHashMap<K, V, S = RandomState> { /* fields omitted */ }
Expand description
A hash map with weak keys, hashed on key value.
When a weak pointer expires, its mapping is lazily removed.
Implementations
Creates an empty WeakKeyHashMap
with the given capacity.
O(n) time
Creates an empty WeakKeyHashMap
with the given capacity and hasher.
O(n) time
Creates an empty WeakKeyHashMap
with the given capacity and hasher.
O(n) time
Returns the number of elements the map can hold without reallocating.
O(1) time
Removes all mappings whose keys have expired.
O(n) time
Reserves room for additional elements.
O(n) time
Shrinks the capacity to the minimum allowed to hold the current number of elements.
O(n) time
Is the map empty?
Note that this may return false even if all keys in the map have expired, if they haven’t been collected yet.
O(1) time
The proportion of buckets that are used.
This is an over-approximation because of expired keys.
O(1) time
Gets the requested entry.
expected O(1) time; worst-case O(p) time
Returns a reference to the value corresponding to the key.
expected O(1) time; worst-case O(p) time
Returns true if the map contains the specified key.
expected O(1) time; worst-case O(p) time
Returns a strong reference to the key, if found.
expected O(1) time; worst-case O(p) time
Returns a pair of a strong reference to the key, and a reference to the value, if present.
expected O(1) time; worst-case O(p) time
Returns a mutable reference to the value corresponding to the key.
expected O(1) time; worst-case O(p) time
Returns a pair of a strong reference to the key, and a mutable reference to the value, if present.
expected O(1) time; worst-case O(p) time
Unconditionally inserts the value, returning the old value if already present.
Unlike std::collections::HashMap
, this replaced the key even if occupied.
expected O(1) time; worst-case O(p) time
Removes the entry with the given key, if it exists, and returns the value.
expected O(1) time; worst-case O(p) time
Removes all mappings not satisfying the given predicate.
Also removes any expired mappings.
O(n) time
pub fn is_submap_with<F, S1, V1>(
&self,
other: &WeakKeyHashMap<K, V1, S1>,
cmp: F
) -> bool where
F: FnMut(&V, &V1) -> bool,
S1: BuildHasher,
pub fn is_submap_with<F, S1, V1>(
&self,
other: &WeakKeyHashMap<K, V1, S1>,
cmp: F
) -> bool where
F: FnMut(&V, &V1) -> bool,
S1: BuildHasher,
Is this map a submap of the other under the given value comparison cmp
?
In particular, for every key k
of self
,
k
must also be a key ofother
andcmp(self[k], other[k])
must hold.
expected O(n) time; worst-case O(nq) time (where n is
self.capacity()
and q is the length of the probe sequences
in other
)
pub fn is_submap<V1, S1>(&self, other: &WeakKeyHashMap<K, V1, S1>) -> bool where
V: PartialEq<V1>,
S1: BuildHasher,
pub fn is_submap<V1, S1>(&self, other: &WeakKeyHashMap<K, V1, S1>) -> bool where
V: PartialEq<V1>,
S1: BuildHasher,
Is self
a submap of other
?
expected O(n) time; worst-case O(nq) time (where n is
self.capacity()
and q is the length of the probe sequences
in other
)
pub fn domain_is_subset<V1, S1>(
&self,
other: &WeakKeyHashMap<K, V1, S1>
) -> bool where
S1: BuildHasher,
pub fn domain_is_subset<V1, S1>(
&self,
other: &WeakKeyHashMap<K, V1, S1>
) -> bool where
S1: BuildHasher,
Are the keys of self
a subset of the keys of other
?
expected O(n) time; worst-case O(nq) time (where n is
self.capacity()
and q is the length of the probe sequences
in other
)
Gets an iterator over the keys and values.
O(1) time
Gets an iterator over the keys.
O(1) time
Gets an iterator over the values.
O(1) time
Gets an iterator over the keys and mutable values.
O(1) time
pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>ⓘ
pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>ⓘ
Gets an iterator over the mutable values.
O(1) time
Trait Implementations
impl<'a, K, V, S> Extend<(&'a <K as WeakElement>::Strong, &'a V)> for WeakKeyHashMap<K, V, S> where
K: 'a + WeakKey,
K::Strong: Clone,
V: 'a + Clone,
S: BuildHasher,
impl<'a, K, V, S> Extend<(&'a <K as WeakElement>::Strong, &'a V)> for WeakKeyHashMap<K, V, S> where
K: 'a + WeakKey,
K::Strong: Clone,
V: 'a + Clone,
S: BuildHasher,
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
impl<K, V, S> Extend<(<K as WeakElement>::Strong, V)> for WeakKeyHashMap<K, V, S> where
K: WeakKey,
S: BuildHasher,
impl<K, V, S> Extend<(<K as WeakElement>::Strong, V)> for WeakKeyHashMap<K, V, S> where
K: WeakKey,
S: BuildHasher,
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
impl<K, V, S> FromIterator<(<K as WeakElement>::Strong, V)> for WeakKeyHashMap<K, V, S> where
K: WeakKey,
S: BuildHasher + Default,
impl<K, V, S> FromIterator<(<K as WeakElement>::Strong, V)> for WeakKeyHashMap<K, V, S> where
K: WeakKey,
S: BuildHasher + Default,
impl<K, V, V1, S, S1> PartialEq<WeakKeyHashMap<K, V1, S1>> for WeakKeyHashMap<K, V, S> where
K: WeakKey,
V: PartialEq<V1>,
S: BuildHasher,
S1: BuildHasher,
impl<K, V, V1, S, S1> PartialEq<WeakKeyHashMap<K, V1, S1>> for WeakKeyHashMap<K, V, S> where
K: WeakKey,
V: PartialEq<V1>,
S: BuildHasher,
S1: BuildHasher,
Auto Trait Implementations
impl<K, V, S> RefUnwindSafe for WeakKeyHashMap<K, V, S> where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V, S> Send for WeakKeyHashMap<K, V, S> where
K: Send,
S: Send,
V: Send,
impl<K, V, S> Sync for WeakKeyHashMap<K, V, S> where
K: Sync,
S: Sync,
V: Sync,
impl<K, V, S> Unpin for WeakKeyHashMap<K, V, S> where
S: Unpin,
impl<K, V, S> UnwindSafe for WeakKeyHashMap<K, V, S> where
K: UnwindSafe,
S: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more