Struct vertigo::AutoMap

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

A structure similar to HashMap but allows to provide a function create for creating a new value if particular key doesn’t exists.

Such a function can for example fetch data from internet.

use vertigo::AutoMap;

let my_map = AutoMap::<i32, i32>::new(|_, x| x*2);
assert_eq!(my_map.get(&5), 10);

Implementations

impl<K: Eq + Hash + Clone, V: Clone> AutoMap<K, V>

pub fn new<C: Fn(&AutoMap<K, V>, &K) -> V + 'static>(create: C) -> AutoMap<K, V>

pub fn get(&self, key: &K) -> V

Trait Implementations

impl<K: Clone, V: Clone> Clone for AutoMap<K, V>

fn clone(&self) -> AutoMap<K, V>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K, V> Debug for AutoMap<K, V>

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

Formats the value using the given formatter.

impl<K, V> PartialEq for AutoMap<K, V>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.