Struct fallible_collections::hashmap::TryHashMap

pub struct TryHashMap<K, V> { /* private fields */ }

Implementations

impl<K, V> TryHashMap<K, V>where K: Eq + Hash,

pub fn with_capacity(capacity: usize) -> Result<Self, TryReserveError>

pub fn get<Q>(&self, k: &Q) -> Option<&V>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn insert(&mut self, k: K, v: V) -> Result<Option<V>, TryReserveError>

pub fn iter(&self) -> Iter<'_, K, V>

pub fn len(&self) -> usize

pub fn remove<Q>(&mut self, k: &Q) -> Option<V>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Trait Implementations

impl<K: Debug, V: Debug> Debug for TryHashMap<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K, V> Default for TryHashMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> IntoIterator for TryHashMap<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V, Global>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V> TryClone for TryHashMap<K, V>where K: Eq + Hash + TryClone, V: TryClone,

fn try_clone(&self) -> Result<Self, TryReserveError>

try clone method, (Self must be sized because of Result constraint)