pub struct ConcurrentHashMap<K, V>{ /* private fields */ }
Implementations§
Source§impl<K, V> ConcurrentHashMap<K, V>
impl<K, V> ConcurrentHashMap<K, V>
pub fn new() -> Self
pub fn reserve(&self, additional: usize)
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub fn clear(&self)
pub fn get<Q>(&self, k: &Q) -> Option<V>
pub fn get_all(&self) -> Vec<(K, V)>
pub fn contains_key<Q>(&self, k: &Q) -> bool
pub fn insert(&self, k: K, v: V) -> Option<V>
pub fn remove<Q>(&self, k: &Q) -> Option<V>
Trait Implementations§
Source§impl<K, V> Debug for ConcurrentHashMap<K, V>
impl<K, V> Debug for ConcurrentHashMap<K, V>
Auto Trait Implementations§
impl<K, V> !Freeze for ConcurrentHashMap<K, V>
impl<K, V> !RefUnwindSafe for ConcurrentHashMap<K, V>
impl<K, V> Send for ConcurrentHashMap<K, V>
impl<K, V> Sync for ConcurrentHashMap<K, V>
impl<K, V> Unpin for ConcurrentHashMap<K, V>
impl<K, V> UnwindSafe for ConcurrentHashMap<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