# Enum std::collections::hash_map::Entry 1.0.0 [−] [src]

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

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 `HashMap`.

## Variants

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

An occupied entry.

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

A vacant entry.

## Methods

### `impl<'a, K, V> Entry<'a, K, V>`
[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::HashMap;

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

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

    *map.entry("poneyland").or_insert(12) += 10;
    assert_eq!(map["poneyland"], 22);Run

#### `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::HashMap;

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

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

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

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

Returns a reference to this entry's key.

# Examples

    use std::collections::HashMap;

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

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

🔬 This is a nightly-only experimental API. (`entry_and_modify` #44733)

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

# Examples

    #![feature(entry_and_modify)]
    use std::collections::HashMap;

    let mut map: HashMap<&str, u32> = HashMap::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);Run

### `impl<'a, K, V: Default> Entry<'a, K, V>`
[src]

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

🔬 This is a nightly-only experimental API. (`entry_or_default` #44324)

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

    #![feature(entry_or_default)]
    use std::collections::HashMap;

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

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

## Trait Implementations

### `impl<'a, K: 'a + Debug, V: 'a + Debug> Debug for Entry<'a, K, V>`
1.12.0
[src]

#### `fn fmt(&self, f: &mut Formatter) -> Result`
[src]

Formats the value using the given formatter.

### `impl<'a, K, V> Placer<V> for Entry<'a, K, V>`
[src]

#### `type Place = EntryPlace<'a, K, V>`

🔬 This is a nightly-only experimental API. (`placement_new_protocol` #27779)

`Place` is the intermediate agent guarding the uninitialized state for `Data`. Read more

#### `fn make_place(self) -> EntryPlace<'a, K, V>`
[src]

🔬 This is a nightly-only experimental API. (`placement_new_protocol` #27779)

Creates a fresh place from `self`.

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)