Struct ipfs_sqlite_block_store::cache::InMemCacheTracker

pub struct InMemCacheTracker<T, F> { /* fields omitted */ }

keep track of block accesses in memory

Implementations

impl<T, F> InMemCacheTracker<T, F> where
    T: Ord + Clone + Debug,
    F: Fn(Duration, BlockInfo) -> Option<T>, 

pub fn new(mk_cache_entry: F) -> Self

mk_cache_entry will be called on each block access to create or update a cache entry. It allows to customize whether we are interested in an entry at all, and what entries we want to be preserved.

E.g. to just sort entries by their access time, use |access, _, _| Some(access). this will keep entries in the cache based on last access time.

It is also possible to use more sophisticated strategies like only caching certain cid types or caching based on the data size.

Trait Implementations

impl<T, F> CacheTracker for InMemCacheTracker<T, F> where
    T: Ord + Clone + Debug + Send,
    F: Fn(Duration, BlockInfo) -> Option<T> + Send, 

fn blocks_accessed(&self, blocks: Vec<BlockInfo>)

called whenever blocks were accessed

fn blocks_deleted(&self, blocks: Vec<BlockInfo>)

notification that these ids no longer have to be tracked

fn retain_ids(&self, ids: &[i64])

notification that only these ids should be retained

fn sort_ids(&self, ids: &mut [i64])

sort ids by importance. More important ids should go to the end.

fn blocks_written(&self, blocks: Vec<WriteInfo>)

called whenever blocks were written

impl<T: Debug, F> Debug for InMemCacheTracker<T, F>

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

Formats the value using the given formatter.