Struct PageCache 

pub struct PageCache<K, V, W = NoOpWriter>
where
    K: Clone + Eq + Hash,
    V: Clone,
    W: PageWriter<K, V>,
{ /* private fields */ }

SIEVE Page Cache

Implementations

impl<K, V> PageCache<K, V, NoOpWriter>

where K: Clone + Eq + Hash, V: Clone,

pub fn new(config: CacheConfig) -> Self

Create new cache with default writer

pub fn with_capacity(capacity: usize) -> Self

Create with specific capacity

impl<K, V, W> PageCache<K, V, W>

where K: Clone + Eq + Hash, V: Clone, W: PageWriter<K, V>,

pub fn with_writer(config: CacheConfig, writer: W) -> Self

Create new cache with custom writer

pub fn get_with(&self, key: &K, strategy: BufferAccessStrategy) -> Option<V>

Strategy-aware get.

Normal behaves exactly like PageCache::get. Non-Normal strategies look in the main pool first (a hit is a free win), then fall through to the strategy’s dedicated ring buffer. Hits in the ring do NOT promote the page into the main pool — that is the whole point of the strategy: keep scans out of the hot working set.

pub fn insert_with( &self, key: K, value: V, strategy: BufferAccessStrategy, ) -> Option<(K, V)>

Strategy-aware insert.

Normal behaves exactly like PageCache::insert. Non-Normal strategies route the write into the dedicated ring instead of the main pool. The ring’s eviction return is propagated up so callers (the pager) can flush dirty pages through the double-write buffer.

pub fn clear_strategy_rings(&self)

Drop every strategy ring. Used by tests and by post-checkpoint cleanup.

pub fn get(&self, key: &K) -> Option<V>

Get an entry from cache

pub fn contains(&self, key: &K) -> bool

Check if key exists in cache

pub fn insert(&self, key: K, value: V) -> Option<V>

Insert an entry into cache

pub fn remove(&self, key: &K) -> Option<V>

Remove an entry from cache

pub fn pin(&self, key: &K) -> bool

Pin a page (prevent eviction)

pub fn unpin(&self, key: &K) -> bool

Unpin a page

pub fn mark_dirty(&self, key: &K) -> bool

Mark a page as dirty

pub fn flush(&self) -> Result<usize>

Flush all dirty pages

pub fn clear(&self)

Clear all entries

pub fn len(&self) -> usize

Get current entry count

pub fn is_empty(&self) -> bool

Check if empty

pub fn capacity(&self) -> usize

Get capacity

pub fn stats(&self) -> CacheStats

Get statistics

pub fn config(&self) -> &CacheConfig

Get configuration

pub fn keys(&self) -> Vec<K>

Get all cached keys

pub fn dirty_count(&self) -> usize

Get dirty page count