Trait texcraft_stdext::collections::groupingmap::BackingContainer

pub trait BackingContainer<K, V>: Default {
    type Iter<'a>: Iterator<Item = (K, &'a V)>
       where V: 'a,
             Self: 'a;

    // Required methods
    fn insert(&mut self, k: K, v: V);
    fn get(&self, k: &K) -> Option<&V>;
    fn get_mut(&mut self, k: &K) -> Option<&mut V>;
    fn remove(&mut self, k: &K);
    fn iter(&self) -> Self::Iter<'_>;
    fn len(&self) -> usize;

    // Provided method
    fn is_empty(&self) -> bool { ... }
}

Trait for containers that can be wrapped using GroupingContainer.

Required Associated Types

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

Type of iterator returned by the BackingContainer::iter method.

Required Methods

fn insert(&mut self, k: K, v: V)

Set the value at the provided key.

fn get(&self, k: &K) -> Option<&V>

Get a reference to the value at the provided key, or None if the value doesn’t exist.

fn get_mut(&mut self, k: &K) -> Option<&mut V>

Get mutable a reference to the value at the provided key, or None if the value doesn’t exist.

fn remove(&mut self, k: &K)

Remove a value with the provided key, if it exists.

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

Iterate over all (key, value) tuples in the container.

fn len(&self) -> usize

Return the number of elements in the container.

Provided Methods

fn is_empty(&self) -> bool

Return whether the container is empty.

Implementations on Foreign Types

impl<V> BackingContainer<usize, V> for Vec<Option<V>>

fn insert(&mut self, k: usize, v: V)

fn get(&self, k: &usize) -> Option<&V>

fn get_mut(&mut self, k: &usize) -> Option<&mut V>

fn remove(&mut self, k: &usize)

type Iter<'a> = FilterMap<Enumerate<Iter<'a, Option<V>>>, fn(_: (usize, &'a Option<V>)) -> Option<(usize, &'a V)>> where V: 'a

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

fn len(&self) -> usize

impl<K: Eq + Hash + Clone, V> BackingContainer<K, V> for HashMap<K, V>

fn insert(&mut self, k: K, v: V)

fn get(&self, k: &K) -> Option<&V>

fn get_mut(&mut self, k: &K) -> Option<&mut V>

fn remove(&mut self, k: &K)

type Iter<'a> = Map<Iter<'a, K, V>, fn(_: (&'a K, &'a V)) -> (K, &'a V)> where K: 'a, V: 'a

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

fn len(&self) -> usize

Implementors