Struct LinearMap

pub struct LinearMap<K, V>(/* private fields */);

O(n) Vec-backed map for keys that only implement Eq. Only use this for a very small number of keys, operations on it can easily become O(n^2).

Implementations

impl<K: Eq, V> LinearMap<K, V>

pub fn new() -> Self

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

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

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

This is O(n), because we check for an existing entry.

pub fn get_or_insert_with(&mut self, k: K, f: impl FnOnce() -> V) -> &mut V

pub fn values(&self) -> impl Iterator<Item = &V>

Trait Implementations

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

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<K: Eq, V> FromIterator<(K, V)> for LinearMap<K, V>

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

This calls insert in a loop, so is O(n^2)!!

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

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = <Vec<(K, V)> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.