[−][src]Enum linked_hash_map::Entry

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]

pub fn key(&self) -> &K[src]

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]

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]

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

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.