pub struct HashMap<K: Clone + Hash + Eq, V: Clone, ALLOC: GlobalAlloc + Default = System, H: Hasher + Default = DefaultHasher> { /* private fields */ }Implementations§
Source§impl<K: Clone + Hash + Eq, V: Clone, ALLOC: GlobalAlloc + Default, H: Hasher + Default> HashMap<K, V, ALLOC, H>
impl<K: Clone + Hash + Eq, V: Clone, ALLOC: GlobalAlloc + Default, H: Hasher + Default> HashMap<K, V, ALLOC, H>
pub fn insert_with_op(&self, op: InsertOp, key: &K, value: V) -> Option<V>
pub fn write(&self, key: &K) -> Option<HashMapWriteGuard<'_, K, V, ALLOC, H>>
pub fn read(&self, key: &K) -> Option<HashMapReadGuard<'_, K, V, ALLOC, H>>
Trait Implementations§
Source§impl<K: Clone + Hash + Eq, V: Clone, ALLOC: GlobalAlloc + Default, H: Hasher + Default> Map<K, V> for HashMap<K, V, ALLOC, H>
impl<K: Clone + Hash + Eq, V: Clone, ALLOC: GlobalAlloc + Default, H: Hasher + Default> Map<K, V> for HashMap<K, V, ALLOC, H>
fn with_capacity(cap: usize) -> Self
fn get(&self, key: &K) -> Option<V>
fn insert(&self, key: &K, value: V) -> Option<V>
fn try_insert(&self, key: &K, value: V) -> Option<V>
fn remove(&self, key: &K) -> Option<V>
fn entries(&self) -> Vec<(K, V)>
fn contains_key(&self, key: &K) -> bool
fn len(&self) -> usize
fn get_or_insert<F: Fn() -> V>(&self, key: &K, func: F) -> V
Auto Trait Implementations§
impl<K, V, ALLOC = System, H = DefaultHasher> !Freeze for HashMap<K, V, ALLOC, H>
impl<K, V, ALLOC, H> RefUnwindSafe for HashMap<K, V, ALLOC, H>
impl<K, V, ALLOC, H> Send for HashMap<K, V, ALLOC, H>where
H: Send,
impl<K, V, ALLOC, H> Sync for HashMap<K, V, ALLOC, H>where
H: Sync,
impl<K, V, ALLOC, H> Unpin for HashMap<K, V, ALLOC, H>where
H: Unpin,
impl<K, V, ALLOC, H> UnwindSafe for HashMap<K, V, ALLOC, H>
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