Struct weak_table::WeakValueHashMap
source · [−]pub struct WeakValueHashMap<K, V, S = RandomState> { /* private fields */ }
Expand description
A hash map with weak values.
When a weak pointer expires, its mapping is lazily removed.
Implementations
sourceimpl<K: Eq + Hash, V: WeakElement> WeakValueHashMap<K, V, RandomState>
impl<K: Eq + Hash, V: WeakElement> WeakValueHashMap<K, V, RandomState>
sourcepub fn with_capacity(capacity: usize) -> Self
pub fn with_capacity(capacity: usize) -> Self
Creates an empty WeakValueHashMap
with the given capacity.
O(n) time
sourceimpl<K: Eq + Hash, V: WeakElement, S: BuildHasher> WeakValueHashMap<K, V, S>
impl<K: Eq + Hash, V: WeakElement, S: BuildHasher> WeakValueHashMap<K, V, S>
sourcepub fn with_hasher(hash_builder: S) -> Self
pub fn with_hasher(hash_builder: S) -> Self
Creates an empty WeakValueHashMap
with the given capacity and hasher.
O(n) time
sourcepub fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> Self
pub fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> Self
Creates an empty WeakValueHashMap
with the given capacity and hasher.
O(n) time
sourcepub fn capacity(&self) -> usize
pub fn capacity(&self) -> usize
Returns the number of elements the map can hold without reallocating.
O(1) time
sourcepub fn remove_expired(&mut self)
pub fn remove_expired(&mut self)
Removes all mappings whose keys have expired.
O(n) time
sourcepub fn reserve(&mut self, additional_capacity: usize)
pub fn reserve(&mut self, additional_capacity: usize)
Reserves room for additional elements.
O(n) time
sourcepub fn shrink_to_fit(&mut self)
pub fn shrink_to_fit(&mut self)
Shrinks the capacity to the minimum allowed to hold the current number of elements.
O(n) time
sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
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
sourcepub fn load_factor(&self) -> f32
pub fn load_factor(&self) -> f32
The proportion of buckets that are used.
This is an over-approximation because of expired keys.
O(1) time
sourcepub fn entry(&mut self, key: K) -> Entry<'_, K, V>
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
Gets the requested entry.
expected O(1) time; worst-case O(p) time
sourcepub fn get<Q>(&self, key: &Q) -> Option<V::Strong> where
Q: ?Sized + Hash + Eq,
K: Borrow<Q>,
pub fn get<Q>(&self, key: &Q) -> Option<V::Strong> where
Q: ?Sized + Hash + Eq,
K: Borrow<Q>,
Returns a reference to the value corresponding to the key.
expected O(1) time; worst-case O(p) time
sourcepub fn contains_key<Q>(&self, key: &Q) -> bool where
Q: ?Sized + Hash + Eq,
K: Borrow<Q>,
pub fn contains_key<Q>(&self, key: &Q) -> bool where
Q: ?Sized + Hash + Eq,
K: Borrow<Q>,
Returns true if the map contains the specified key.
expected O(1) time; worst-case O(p) time
sourcepub fn insert(&mut self, key: K, value: V::Strong) -> Option<V::Strong>
pub fn insert(&mut self, key: K, value: V::Strong) -> Option<V::Strong>
Unconditionally inserts the value, returning the old value if already present.
Like std::collections::HashMap
, this does not replace the key if occupied.
expected O(1) time; worst-case O(p) time
sourcepub fn remove<Q>(&mut self, key: &Q) -> Option<V::Strong> where
Q: ?Sized + Hash + Eq,
K: Borrow<Q>,
pub fn remove<Q>(&mut self, key: &Q) -> Option<V::Strong> where
Q: ?Sized + Hash + Eq,
K: Borrow<Q>,
Removes the entry with the given key, if it exists, and returns the value.
expected O(1) time; worst-case O(p) time
sourcepub fn retain<F>(&mut self, f: F) where
F: FnMut(&K, V::Strong) -> bool,
pub fn retain<F>(&mut self, f: F) where
F: FnMut(&K, V::Strong) -> bool,
Removes all mappings not satisfying the given predicate.
Also removes any expired mappings.
O(n) time
sourcepub fn is_submap_with<F, S1, V1>(
&self,
other: &WeakValueHashMap<K, V1, S1>,
value_equal: F
) -> bool where
V1: WeakElement,
F: FnMut(V::Strong, V1::Strong) -> bool,
S1: BuildHasher,
pub fn is_submap_with<F, S1, V1>(
&self,
other: &WeakValueHashMap<K, V1, S1>,
value_equal: F
) -> bool where
V1: WeakElement,
F: FnMut(V::Strong, V1::Strong) -> bool,
S1: BuildHasher,
Is this map a submap of the other, using the given value comparison.
In particular, all the keys of self
must be in other
and the values must compare
true
with value_equal
.
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
)
sourcepub fn is_submap<V1, S1>(&self, other: &WeakValueHashMap<K, V1, S1>) -> bool where
V1: WeakElement,
V::Strong: PartialEq<V1::Strong>,
S1: BuildHasher,
pub fn is_submap<V1, S1>(&self, other: &WeakValueHashMap<K, V1, S1>) -> bool where
V1: WeakElement,
V::Strong: PartialEq<V1::Strong>,
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
)
sourcepub fn domain_is_subset<V1, S1>(
&self,
other: &WeakValueHashMap<K, V1, S1>
) -> bool where
V1: WeakElement,
S1: BuildHasher,
pub fn domain_is_subset<V1, S1>(
&self,
other: &WeakValueHashMap<K, V1, S1>
) -> bool where
V1: WeakElement,
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
)
sourceimpl<K, V: WeakElement, S> WeakValueHashMap<K, V, S>
impl<K, V: WeakElement, S> WeakValueHashMap<K, V, S>
sourcepub fn iter(&self) -> Iter<'_, K, V>ⓘNotable traits for Iter<'a, K, V>impl<'a, K, V: WeakElement> Iterator for Iter<'a, K, V> type Item = (&'a K, V::Strong);
pub fn iter(&self) -> Iter<'_, K, V>ⓘNotable traits for Iter<'a, K, V>impl<'a, K, V: WeakElement> Iterator for Iter<'a, K, V> type Item = (&'a K, V::Strong);
Gets an iterator over the keys and values.
O(1) time
sourcepub fn keys(&self) -> Keys<'_, K, V>ⓘNotable traits for Keys<'a, K, V>impl<'a, K, V: WeakElement> Iterator for Keys<'a, K, V> type Item = &'a K;
pub fn keys(&self) -> Keys<'_, K, V>ⓘNotable traits for Keys<'a, K, V>impl<'a, K, V: WeakElement> Iterator for Keys<'a, K, V> type Item = &'a K;
Gets an iterator over the keys.
O(1) time
Trait Implementations
sourceimpl<K: Clone, V: Clone, S: Clone> Clone for WeakValueHashMap<K, V, S>
impl<K: Clone, V: Clone, S: Clone> Clone for WeakValueHashMap<K, V, S>
sourcefn clone(&self) -> WeakValueHashMap<K, V, S>
fn clone(&self) -> WeakValueHashMap<K, V, S>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<K: Debug, V: WeakElement, S> Debug for WeakValueHashMap<K, V, S> where
V::Strong: Debug,
impl<K: Debug, V: WeakElement, S> Debug for WeakValueHashMap<K, V, S> where
V::Strong: Debug,
sourceimpl<K: Eq + Hash, V: WeakElement, S: BuildHasher + Default> Default for WeakValueHashMap<K, V, S>
impl<K: Eq + Hash, V: WeakElement, S: BuildHasher + Default> Default for WeakValueHashMap<K, V, S>
sourceimpl<'a, K, V, S> Extend<(&'a K, &'a <V as WeakElement>::Strong)> for WeakValueHashMap<K, V, S> where
K: 'a + Eq + Hash + Clone,
V: 'a + WeakElement,
V::Strong: Clone,
S: BuildHasher,
impl<'a, K, V, S> Extend<(&'a K, &'a <V as WeakElement>::Strong)> for WeakValueHashMap<K, V, S> where
K: 'a + Eq + Hash + Clone,
V: 'a + WeakElement,
V::Strong: Clone,
S: BuildHasher,
sourcefn extend<T: IntoIterator<Item = (&'a K, &'a V::Strong)>>(&mut self, iter: T)
fn extend<T: IntoIterator<Item = (&'a K, &'a V::Strong)>>(&mut self, iter: T)
Extends a collection with the contents of an iterator. Read more
sourcefn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Extends a collection with exactly one element.
sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
sourceimpl<K, V, S> Extend<(K, <V as WeakElement>::Strong)> for WeakValueHashMap<K, V, S> where
K: Eq + Hash,
V: WeakElement,
S: BuildHasher,
impl<K, V, S> Extend<(K, <V as WeakElement>::Strong)> for WeakValueHashMap<K, V, S> where
K: Eq + Hash,
V: WeakElement,
S: BuildHasher,
sourcefn extend<T: IntoIterator<Item = (K, V::Strong)>>(&mut self, iter: T)
fn extend<T: IntoIterator<Item = (K, V::Strong)>>(&mut self, iter: T)
Extends a collection with the contents of an iterator. Read more
sourcefn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Extends a collection with exactly one element.
sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
sourceimpl<K, V, S> FromIterator<(K, <V as WeakElement>::Strong)> for WeakValueHashMap<K, V, S> where
K: Eq + Hash,
V: WeakElement,
S: BuildHasher + Default,
impl<K, V, S> FromIterator<(K, <V as WeakElement>::Strong)> for WeakValueHashMap<K, V, S> where
K: Eq + Hash,
V: WeakElement,
S: BuildHasher + Default,
sourceimpl<K, V: WeakElement, S> IntoIterator for WeakValueHashMap<K, V, S>
impl<K, V: WeakElement, S> IntoIterator for WeakValueHashMap<K, V, S>
sourceimpl<'a, K, V: WeakElement, S> IntoIterator for &'a WeakValueHashMap<K, V, S>
impl<'a, K, V: WeakElement, S> IntoIterator for &'a WeakValueHashMap<K, V, S>
sourceimpl<K, V, V1, S, S1> PartialEq<WeakValueHashMap<K, V1, S1>> for WeakValueHashMap<K, V, S> where
K: Eq + Hash,
V: WeakElement,
V1: WeakElement,
V::Strong: PartialEq<V1::Strong>,
S: BuildHasher,
S1: BuildHasher,
impl<K, V, V1, S, S1> PartialEq<WeakValueHashMap<K, V1, S1>> for WeakValueHashMap<K, V, S> where
K: Eq + Hash,
V: WeakElement,
V1: WeakElement,
V::Strong: PartialEq<V1::Strong>,
S: BuildHasher,
S1: BuildHasher,
impl<K: Eq + Hash, V: WeakElement, S: BuildHasher> Eq for WeakValueHashMap<K, V, S> where
V::Strong: Eq,
Auto Trait Implementations
impl<K, V, S> RefUnwindSafe for WeakValueHashMap<K, V, S> where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V, S> Send for WeakValueHashMap<K, V, S> where
K: Send,
S: Send,
V: Send,
impl<K, V, S> Sync for WeakValueHashMap<K, V, S> where
K: Sync,
S: Sync,
V: Sync,
impl<K, V, S> Unpin for WeakValueHashMap<K, V, S> where
S: Unpin,
impl<K, V, S> UnwindSafe for WeakValueHashMap<K, V, S> where
K: UnwindSafe,
S: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more