[][src]Enum alloc_wg::collections::btree_map::Entry

pub enum Entry<'a, K: 'a, V: 'a, A: AllocRef> {
    Vacant(VacantEntry<'a, K, V, A>),
    Occupied(OccupiedEntry<'a, K, V, A>),
}

A view into a single entry in a map, which may either be vacant or occupied.

This enum is constructed from the entry method on BTreeMap.

Variants

Vacant(VacantEntry<'a, K, V, A>)

A vacant entry.

Occupied(OccupiedEntry<'a, K, V, A>)

An occupied entry.

Implementations

impl<'a, K: Ord, V, A: AllocRef> Entry<'a, K, V, A>[src]

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.

Examples

use std::collections::BTreeMap;

let mut map: BTreeMap<&str, usize> = BTreeMap::new();
map.entry("poneyland").or_insert(12);

assert_eq!(map["poneyland"], 12);

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.

Examples

use std::collections::BTreeMap;

let mut map: BTreeMap<&str, String> = BTreeMap::new();
let s = "hoho".to_string();

map.entry("poneyland").or_insert_with(|| s);

assert_eq!(map["poneyland"], "hoho".to_string());

pub fn or_insert_with_key<F: FnOnce(&K) -> V>(self, default: F) -> &'a mut V[src]

Ensures a value is in the entry by inserting, if empty, the result of the default function, which takes the key as its argument, and returns a mutable reference to the value in the entry.

Examples

#![feature(or_insert_with_key)]
use std::collections::BTreeMap;

let mut map: BTreeMap<&str, usize> = BTreeMap::new();

map.entry("poneyland")
    .or_insert_with_key(|key| key.chars().count());

assert_eq!(map["poneyland"], 9);

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

Returns a reference to this entry's key.

Examples

use std::collections::BTreeMap;

let mut map: BTreeMap<&str, usize> = BTreeMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland");

pub fn and_modify<F>(self, f: F) -> Self where
    F: FnOnce(&mut V), 
[src]

Provides in-place mutable access to an occupied entry before any potential inserts into the map.

Examples

use std::collections::BTreeMap;

let mut map: BTreeMap<&str, usize> = BTreeMap::new();

map.entry("poneyland").and_modify(|e| *e += 1).or_insert(42);
assert_eq!(map["poneyland"], 42);

map.entry("poneyland").and_modify(|e| *e += 1).or_insert(42);
assert_eq!(map["poneyland"], 43);

impl<'a, K: Ord, V: Default, A: AllocRef> Entry<'a, K, V, A>[src]

pub fn or_default(self) -> &'a mut V[src]

Ensures a value is in the entry by inserting the default value if empty, and returns a mutable reference to the value in the entry.

Examples

use std::collections::BTreeMap;

let mut map: BTreeMap<&str, Option<usize>> = BTreeMap::new();
map.entry("poneyland").or_default();

assert_eq!(map["poneyland"], None);

Trait Implementations

impl<K: Debug + Ord, V: Debug, A: AllocRef, '_> Debug for Entry<'_, K, V, A>[src]

Auto Trait Implementations

impl<'a, K, V, A> RefUnwindSafe for Entry<'a, K, V, A> where
    A: RefUnwindSafe,
    K: RefUnwindSafe,
    V: RefUnwindSafe

impl<'a, K, V, A> Send for Entry<'a, K, V, A> where
    A: Send,
    K: Send,
    V: Send

impl<'a, K, V, A> Sync for Entry<'a, K, V, A> where
    A: Sync,
    K: Sync,
    V: Sync

impl<'a, K, V, A> Unpin for Entry<'a, K, V, A> where
    K: Unpin

impl<'a, K, V, A> !UnwindSafe for Entry<'a, K, V, A>

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.