Enum linked_hash_map::Entry
[−]
[src]
pub enum Entry<'a, K: 'a, V: 'a, S: 'a = RandomState> { Occupied(OccupiedEntry<'a, K, V, S>), Vacant(VacantEntry<'a, K, V, S>), }
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.
Methods
impl<'a, K: Hash + Eq, V, S: BuildHasher> Entry<'a, K, V, S>
[src]
impl<'a, K: Hash + Eq, V, S: BuildHasher> Entry<'a, K, V, S>
pub fn key(&self) -> &K
[src]
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());
pub fn or_insert(self, default: V) -> &'a mut V
[src]
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.
pub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut V
[src]
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.
Trait Implementations
Auto Trait Implementations
impl<'a, K, V, S = RandomState> !Send for Entry<'a, K, V, S>
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 = RandomState> !Sync for Entry<'a, K, V, S>