Struct VALUE_CACHE

pub struct VALUE_CACHE { /* private fields */ }

A lazily-initialized global cache for rain values, for hash-consing

Methods from Deref<Target = ValueCache>

pub fn cached_entry<'a, K>( &'a self, key: &K, ) -> Either<Node<T>, CacheEntry<'a, T>>

where K: Hash,

Get either the cached value for a key (if it exists), or the entry for the key (if it does not). Note that this locks the bucket for the key up until the handle for the entry is destroyed, so be careful!

pub fn cached_constructor<D, E, F>( &self, data: D, constructor: F, ) -> Result<Node<T>, E>

where D: Hash, F: FnOnce(D) -> Result<Node<T>, E>,

Try to get the node cached for a given key, with a given node creation function. If the node has been collected or otherwise does not exist, try to create a new one and cache it. If this fails, return an error.

pub fn remove<K>(&self, key: &K) -> Option<(u64, WeakNode<T>)>

where K: Hash,

Remove a given cached value

pub fn cached_desc<D>(&self, desc: D) -> Result<Node<T>, T::CacheError>

where D: Hash, T: CacheBy<D>,

Try to get the node cached for a given descriptor. If the node has been collected or otherwise does not exist, try to create a new one and cache it. If this fails, return an error.

Trait Implementations

impl Deref for VALUE_CACHE

type Target = NodeCache<ValueData>

The resulting type after dereferencing.

fn deref(&self) -> &ValueCache

Dereferences the value.

impl LazyStatic for VALUE_CACHE