Struct dashcache::DashCache

pub struct DashCache<C, S = RandomState> { /* fields omitted */ }

A global cache built around a DashMap

Implementations

impl<C: Hash + Eq> DashCache<C>

pub fn new() -> DashCache<C>

Create a new, empty DashCache

Trait Implementations

impl<C, S> Debug for DashCache<C, S> where
    C: Debug + Hash + Eq,
    S: BuildHasher + Clone, 

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

Formats the value using the given formatter.

impl<C: Hash + Eq, S: BuildHasher + Clone + Default> Default for DashCache<C, S>

fn default() -> DashCache<C, S>

Returns the "default value" for a type.

impl<C, S> From<DashMap<C, (), S>> for DashCache<C, S>

fn from(cache: DashMap<C, (), S>) -> DashCache<C, S>

Performs the conversion.

impl<C, S> GlobalCache for DashCache<C, S> where
    S: BuildHasher + Clone,
    C: Hash + Eq + Clone + CanCollect, 

type Entry = C

The cache entry type

fn cache<Q>(&self, value: Q) -> C where
    C: Borrow<Q>,
    Q: Into<C> + Hash + Eq, 

Attempt to cache a value. If already cached, return the corresponding entry.

fn gc(&self) -> usize

Attempt to garbage-collect this cache, returning how many elements were removed. # Example ```rust use dashcache::{GlobalCache, DashCache}; use elysees::Arc; let int_cache = DashCache::::new();

fn try_gc(&self, key: &mut Self::Entry) -> Option<Self::Entry>

Garbage collect a single entry if doing so would not break the hash-consing property due to uniqueness. Returns the removed key on success, or Err(key) on failure

fn try_gc_global(&self, key: &Self::Entry) -> Option<Self::Entry>

Garbage collect a single entry if doing so would not break the hash-consing property due to uniqueness. Returns the removed key on success, or Err(key) on failure.

fn len(&self) -> usize

Compute how many items are in a given cache.

fn is_empty(&self) -> bool

Check if a cache is empty