pub struct RehashingHashMap<K: Eq + Hash, V> { /* private fields */ }
Implementations§
Source§impl<K, V> RehashingHashMap<K, V>
impl<K, V> RehashingHashMap<K, V>
pub fn new() -> RehashingHashMap<K, V>
pub fn with_capacity(capacity: usize) -> RehashingHashMap<K, V>
pub fn rehash(&mut self)
pub fn capacity(&self) -> usize
pub fn reserve(&mut self, additional: usize)
pub fn is_rehashing(&self) -> bool
pub fn shrink_to_fit(&mut self)
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub fn clear(&mut self)
pub fn insert(&mut self, k: K, v: V) -> Option<V>
pub fn get<Q>(&self, k: &Q) -> Option<&V>
pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>
pub fn contains_key<Q>(&self, k: &Q) -> bool
pub fn remove<Q>(&mut self, k: &Q) -> Option<V>
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
pub fn iter(&self) -> Iter<'_, K, V> ⓘ
pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
pub fn keys(&self) -> Keys<'_, K, V> ⓘ
pub fn values(&self) -> Values<'_, K, V> ⓘ
Trait Implementations§
Source§impl<K: Default + Eq + Hash, V: Default> Default for RehashingHashMap<K, V>
impl<K: Default + Eq + Hash, V: Default> Default for RehashingHashMap<K, V>
Source§fn default() -> RehashingHashMap<K, V>
fn default() -> RehashingHashMap<K, V>
Returns the “default value” for a type. Read more
Source§impl<K, V> Extend<(K, V)> for RehashingHashMap<K, V>
impl<K, V> Extend<(K, V)> for RehashingHashMap<K, V>
Source§fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)
fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)
Extends a collection with the contents of an iterator. Read more
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
🔬This is a nightly-only experimental API. (
extend_one
)Extends a collection with exactly one element.
Source§fn extend_reserve(&mut self, additional: usize)
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
Source§impl<K, V> FromIterator<(K, V)> for RehashingHashMap<K, V>
impl<K, V> FromIterator<(K, V)> for RehashingHashMap<K, V>
Source§fn from_iter<T: IntoIterator<Item = (K, V)>>(
iterable: T,
) -> RehashingHashMap<K, V>
fn from_iter<T: IntoIterator<Item = (K, V)>>( iterable: T, ) -> RehashingHashMap<K, V>
Creates a value from an iterator. Read more
Source§impl<'a, K, Q, V> Index<&'a Q> for RehashingHashMap<K, V>
impl<'a, K, Q, V> Index<&'a Q> for RehashingHashMap<K, V>
Source§impl<'a, K, V> IntoIterator for &'a RehashingHashMap<K, V>
impl<'a, K, V> IntoIterator for &'a RehashingHashMap<K, V>
Source§impl<'a, K, V> IntoIterator for &'a mut RehashingHashMap<K, V>
impl<'a, K, V> IntoIterator for &'a mut RehashingHashMap<K, V>
Source§impl<K, V> PartialEq for RehashingHashMap<K, V>
impl<K, V> PartialEq for RehashingHashMap<K, V>
Auto Trait Implementations§
impl<K, V> Freeze for RehashingHashMap<K, V>
impl<K, V> RefUnwindSafe for RehashingHashMap<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for RehashingHashMap<K, V>
impl<K, V> Sync for RehashingHashMap<K, V>
impl<K, V> Unpin for RehashingHashMap<K, V>
impl<K, V> UnwindSafe for RehashingHashMap<K, V>where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more