Struct light_cache::map::LightMap

pub struct LightMap<K, V, S = DefaultHashBuilder> { /* private fields */ }

A concurrent hashmap implementation thats always non-blocking.

Calls to get and insert are not async and since values are clone, they will never block another thread.

Implementations

impl<K, V> LightMap<K, V>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

impl<K, V, S: BuildHasher> LightMap<K, V, S>

pub fn with_hasher(build_hasher: S) -> Self

pub fn with_capacity_and_hasher(capacity: usize, build_hasher: S) -> Self

impl<K, V, S> LightMap<K, V, S>

pub fn len(&self) -> usize

impl<K, V, S> LightMap<K, V, S>

where K: Eq + Hash, S: BuildHasher, V: Clone,

pub fn insert(&self, key: K, value: V) -> Option<V>

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

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