Enum linked_hash_map::Entry
source · [−]pub enum Entry<'a, K: 'a, V: 'a, S: 'a = RandomState> {
Occupied(OccupiedEntry<'a, K, V, S>),
Vacant(VacantEntry<'a, K, V, S>),
}Expand description
A view into a single location in a map, which may be vacant or occupied.
Variants
Occupied(OccupiedEntry<'a, K, V, S>)
An occupied Entry.
Vacant(VacantEntry<'a, K, V, S>)
A vacant Entry.
Implementations
sourceimpl<'a, K: Hash + Eq, V, S: BuildHasher> Entry<'a, K, V, S>
impl<'a, K: Hash + Eq, V, S: BuildHasher> Entry<'a, K, V, S>
sourcepub fn key(&self) -> &K
pub fn key(&self) -> &K
Returns the entry key
Examples
use linked_hash_map::LinkedHashMap;
let mut map = LinkedHashMap::<String, u32>::new();
assert_eq!("hello", map.entry("hello".to_string()).key());sourcepub fn or_insert(self, default: V) -> &'a mut V
pub fn or_insert(self, default: V) -> &'a mut V
Ensures a value is in the entry by inserting the default if empty, and returns a mutable reference to the value in the entry.
sourcepub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut V
pub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut V
Ensures a value is in the entry by inserting the result of the default function if empty, and returns a mutable reference to the value in the entry.
Auto Trait Implementations
impl<'a, K, V, S> RefUnwindSafe for Entry<'a, K, V, S> where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, K, V, S = RandomState> !Send for Entry<'a, K, V, S>
impl<'a, K, V, S = RandomState> !Sync for Entry<'a, K, V, S>
impl<'a, K, V, S> Unpin for Entry<'a, K, V, S> where
K: Unpin,
impl<'a, K, V, S = RandomState> !UnwindSafe for Entry<'a, K, V, S>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more