Struct LazyMap

pub struct LazyMap<K, V, S = RandomState, F = fn(&K) -> V> { /* private fields */ }

A map where values are automatically filled at access.

This type has less overhead than crate::sync::LazyMap but it cannot be shared across threads.

let map = once_map::unsync::LazyMap::new(|x: &i32| x.to_string());

assert_eq!(&map[&3], "3");
assert_eq!(map.get(&-67), "-67");

Implementations

impl<K, V, F> LazyMap<K, V, RandomState, F>

pub fn new(f: F) -> Self

impl<K, V, S, F> LazyMap<K, V, S, F>

pub const fn with_hasher(hash_builder: S, f: F) -> Self

pub fn clear(&mut self)

Removes all entries from the map.

impl<K, V, S, F> LazyMap<K, V, S, F>

where K: Eq + Hash, S: BuildHasher, F: Fn(&K) -> V, V: StableDeref,

pub fn get<Q>(&self, key: &Q) -> &V::Target

where Q: Hash + ToOwnedEquivalent<K> + ?Sized,

impl<K, V, S, F> LazyMap<K, V, S, F>

where K: Eq + Hash, S: BuildHasher, F: Fn(&K) -> V, V: Clone,

pub fn get_cloned<Q>(&self, key: &Q) -> V

where Q: Hash + ToOwnedEquivalent<K> + ?Sized,

impl<K, V, S, F> LazyMap<K, V, S, F>

where K: Eq + Hash, S: BuildHasher, F: Fn(&K) -> V,

pub fn map_get<Q, T>(&self, key: &Q, with_result: impl FnOnce(&K, &V) -> T) -> T

where Q: Hash + ToOwnedEquivalent<K> + ?Sized,

impl<K, V, S, F> LazyMap<K, V, S, F>

where K: Eq + Hash, S: BuildHasher,

pub fn remove<Q>(&mut self, key: &Q) -> Option<V>

where Q: Hash + Equivalent<K> + ?Sized,

Trait Implementations

impl<K, V, S> Debug for LazyMap<K, V, S>

where K: Debug, V: Debug,

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

Formats the value using the given formatter.

impl<K, V: Default, S: Default> Default for LazyMap<K, V, S>

Creates a LazyMap that fills all values with V::default().

fn default() -> Self

Returns the “default value” for a type.

impl<K, V, S, F, Q> Index<&Q> for LazyMap<K, V, S, F>

where K: Eq + Hash, S: BuildHasher, F: Fn(&K) -> V, V: StableDeref, Q: Hash + ToOwnedEquivalent<K> + ?Sized,

type Output = <V as Deref>::Target

The returned type after indexing.

fn index(&self, key: &Q) -> &V::Target

Performs the indexing (container[index]) operation.