Struct sp_trie::cache::SharedTrieCache

pub struct SharedTrieCache<H: Hasher> { /* private fields */ }

The shared trie cache.

It should be instantiated once per node. It will hold the trie nodes and values of all operations to the state. To not use all available memory it will ensure to stay in the bounds given via the CacheSize at startup.

The instance of this object can be shared between multiple threads.

Implementations

impl<H: Hasher> SharedTrieCache<H>

pub fn new(cache_size: CacheSize) -> Self

Create a new SharedTrieCache.

pub fn local_cache(&self) -> LocalTrieCache<H>

Create a new LocalTrieCache instance from this shared cache.

pub fn peek_node(&self, key: &H::Out) -> Option<NodeOwned<H::Out>>

Get a copy of the node for key.

This will temporarily lock the shared cache for reading.

This doesn’t change the least recently order in the internal LruMap.

pub fn peek_value_by_hash( &self, hash: ValueCacheKeyHash, storage_root: &H::Out, storage_key: &[u8], ) -> Option<CachedValue<H::Out>>

Get a copy of the CachedValue for key.

This will temporarily lock the shared cache for reading.

This doesn’t reorder any of the elements in the internal LruMap.

pub fn used_memory_size(&self) -> usize

Returns the used memory size of this cache in bytes.

pub fn reset_node_cache(&self)

Reset the node cache.

pub fn reset_value_cache(&self)

Reset the value cache.

pub fn reset(&self)

Reset the entire cache.

Trait Implementations

impl<H: Hasher> Clone for SharedTrieCache<H>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.