Trait Container 

pub trait Container {
    type Key;
    type Value;
    type Entry<'a>: ContainerEntry<'a, Key = Self::Key, Value = Self::Value>
       where Self: 'a,
             Self::Key: 'a,
             Self::Value: 'a;
    type Iter<'a>: Iterator<Item = (&'a Self::Key, &'a Self::Value)>
       where Self: 'a,
             Self::Key: 'a,
             Self::Value: 'a;
    type Drain<'a>: Iterator<Item = (Self::Key, Self::Value)>
       where Self: 'a,
             Self::Key: 'a,
             Self::Value: 'a;

    // Required methods
    fn get(&self, key: &Self::Key) -> Option<&Self::Value>;
    fn get_mut(&mut self, key: &Self::Key) -> Option<&mut Self::Value>;
    fn insert(
        &mut self,
        key: Self::Key,
        value: Self::Value,
    ) -> Option<Self::Value>;
    fn remove(&mut self, key: &Self::Key) -> Option<Self::Value>;
    fn entry(&mut self, key: Self::Key) -> Self::Entry<'_>;
    fn iter(&self) -> Self::Iter<'_>;
    fn drain(&mut self) -> Self::Drain<'_>;
}

Required Associated Types

type Key

type Value

type Entry<'a>: ContainerEntry<'a, Key = Self::Key, Value = Self::Value> where Self: 'a, Self::Key: 'a, Self::Value: 'a

type Iter<'a>: Iterator<Item = (&'a Self::Key, &'a Self::Value)> where Self: 'a, Self::Key: 'a, Self::Value: 'a

type Drain<'a>: Iterator<Item = (Self::Key, Self::Value)> where Self: 'a, Self::Key: 'a, Self::Value: 'a

Required Methods

fn get(&self, key: &Self::Key) -> Option<&Self::Value>

fn get_mut(&mut self, key: &Self::Key) -> Option<&mut Self::Value>

fn insert(&mut self, key: Self::Key, value: Self::Value) -> Option<Self::Value>

fn remove(&mut self, key: &Self::Key) -> Option<Self::Value>

fn entry(&mut self, key: Self::Key) -> Self::Entry<'_>

fn iter(&self) -> Self::Iter<'_>

fn drain(&mut self) -> Self::Drain<'_>

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<K, V> Container for BTreeMap<K, V>

where K: Ord,

type Key = K

type Value = V

type Entry<'a> = Entry<'a, K, V> where K: 'a, V: 'a

type Iter<'a> = Iter<'a, K, V> where K: 'a, V: 'a

type Drain<'a> = BTreeMapDrain<'a, K, V> where K: 'a, V: 'a

fn get(&self, key: &Self::Key) -> Option<&Self::Value>

fn get_mut(&mut self, key: &Self::Key) -> Option<&mut Self::Value>

fn insert(&mut self, key: Self::Key, value: Self::Value) -> Option<Self::Value>

fn remove(&mut self, key: &Self::Key) -> Option<Self::Value>

fn entry(&mut self, key: Self::Key) -> Self::Entry<'_>

fn iter(&self) -> Self::Iter<'_>

fn drain(&mut self) -> Self::Drain<'_>

impl<K, V> Container for HashMap<K, V>

where K: Eq + Hash,

type Key = K

type Value = V

type Entry<'a> = Entry<'a, K, V> where K: 'a, V: 'a

type Iter<'a> = Iter<'a, K, V> where K: 'a, V: 'a

type Drain<'a> = Drain<'a, K, V> where K: 'a, V: 'a

fn get(&self, key: &Self::Key) -> Option<&Self::Value>

fn get_mut(&mut self, key: &Self::Key) -> Option<&mut Self::Value>

fn insert(&mut self, key: Self::Key, value: Self::Value) -> Option<Self::Value>

fn remove(&mut self, key: &Self::Key) -> Option<Self::Value>

fn entry(&mut self, key: Self::Key) -> Self::Entry<'_>

fn iter(&self) -> Self::Iter<'_>

fn drain(&mut self) -> Self::Drain<'_>

Implementors

impl<const FIXED: bool, K, V, F> Container for VecMap<FIXED, K, V, F>

where F: Fn(&K) -> usize,

type Key = K

type Value = V

type Entry<'a> = Entry<'a, K, V> where Self: 'a, Self::Key: 'a, Self::Value: 'a

type Iter<'a> = Map<FilterMap<Iter<'a, Option<(K, V)>>, fn(&Option<(K, V)>) -> Option<&(K, V)>>, fn(&(K, V)) -> (&K, &V)> where Self: 'a, Self::Key: 'a, Self::Value: 'a

type Drain<'a> = FilterMap<IterMut<'a, Option<(K, V)>>, fn(&mut Option<(K, V)>) -> Option<(K, V)>> where Self: 'a, Self::Key: 'a, Self::Value: 'a