Struct casper_execution_engine::core::tracking_copy::TrackingCopyCache

pub struct TrackingCopyCache<M> { /* private fields */ }

Keeps track of already accessed keys. We deliberately separate cached Reads from cached mutations because we want to invalidate Reads’ cache so it doesn’t grow too fast.

Implementations

impl<M: Meter<Key, StoredValue>> TrackingCopyCache<M>

pub fn new(max_cache_size: usize, meter: M) -> TrackingCopyCache<M>

Creates instance of TrackingCopyCache with specified max_cache_size, above which least-recently-used elements of the cache are invalidated. Measurements of elements’ “size” is done with the usage of Meter instance.

pub fn insert_read(&mut self, key: Key, value: StoredValue)

Inserts key and value pair to Read cache.

pub fn insert_key_tag_read(&mut self, key_tag: KeyTag, keys: BTreeSet<Key>)

Inserts a KeyTag value and the keys under this prefix into the key reads cache.

pub fn insert_write(&mut self, key: Key, value: StoredValue)

Inserts key and value pair to Write/Add cache.

pub fn get(&mut self, key: &Key) -> Option<&StoredValue>

Gets value from key in the cache.

pub fn get_key_tag_muts_cached( &mut self, key_tag: &KeyTag ) -> Option<&BTreeSet<Key>>

Gets the set of mutated keys in the cache by KeyTag.

pub fn get_key_tag_reads_cached( &mut self, key_tag: &KeyTag ) -> Option<&BTreeSet<Key>>

Gets the set of read keys in the cache by KeyTag.