Struct NodeCache

pub struct NodeCache<T, C: CacheType<T> = GlobalCache> {
    pub map: C::UnderlyingMap,
    pub keys: (u64, u64),
}

A node cache

Fields

map: C::UnderlyingMap

The underlying map of this

keys: (u64, u64)

The keys of this node cache, for constructing AHasher instances

Implementations

impl<T> NodeCache<T, GlobalCache>

pub fn with_keys(keys: (u64, u64)) -> NodeCache<T>

Create a new, empty node cache with the given keys

pub fn new() -> NodeCache<T>

Create a new, empty node cache

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<T: Clone, C: Clone + CacheType<T>> Clone for NodeCache<T, C>

where C::UnderlyingMap: Clone,

fn clone(&self) -> NodeCache<T, C>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, C: Debug + CacheType<T>> Debug for NodeCache<T, C>

where C::UnderlyingMap: Debug,

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

Formats the value using the given formatter.