Struct IndexCache

pub struct IndexCache {
    pub stats: CacheStats,
    /* private fields */
}

Simple cache implemented with a Vec<RwLock<Block>>, with the key determined by the position modulo the size.

Prone to collisions.

Fields

stats: CacheStats

Trait Implementations

impl<E> DataBlockCache<E> for IndexCache

fn new( capacity_mb: u64, block_size: u64, _total_size: u64, ) -> Result<Self, CacheError<E>>

Create a new block cache with given maximal capacity, block size, and cumulative size of all blocks.

fn stats(&self) -> &CacheStats

Caching statistics.

fn get<'life0, 'async_trait>( &'life0 self, pos: u64, ) -> Pin<Box<dyn Future<Output = Option<RwLockReadGuard<'_, Block>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Get the block at a position.

fn insert_lock<'life0, 'async_trait, A>( &'life0 self, pos: u64, f: impl 'async_trait + Future<Output = Result<A, E>> + Send, ) -> Pin<Box<dyn Future<Output = Result<RwLockReadGuard<'_, Block>, CacheError<E>>> + Send + 'async_trait>>

where A: 'async_trait + AsRef<[u8]> + Send, Self: 'async_trait, 'life0: 'async_trait,

Insert a block at a position, locking until the output is ready.

impl Debug for IndexCache

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

Formats the value using the given formatter.

impl Display for IndexCache

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

Formats the value using the given formatter.