Struct SieveCache 

pub struct SieveCache<V> { /* private fields */ }

SIEVE eviction cache.

Single FIFO queue with a moving eviction hand and a visited bit. Dirty entries are pinned and never evictable.

O(1) amortized eviction.

Implementations

impl<V: Default> SieveCache<V>

pub fn new(capacity: usize) -> Self

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

Look up a key. If found, set visited=true and return reference.

pub fn get_mut(&mut self, key: u64) -> Option<&mut V>

Look up a key. If found, set visited=true and return mutable reference.

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

Check if a key exists without marking visited.

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

Insert a value. If cache is full, evict using SIEVE algorithm. Returns None if inserted without eviction, or Some((evicted_key, evicted_value)) if an entry was evicted.

Returns Err(()) if the cache is full and all entries are dirty (pinned).

pub fn set_dirty(&mut self, key: u64)

Mark an entry as dirty (pinned, not evictable).

pub fn clear_dirty(&mut self, key: u64)

Clear dirty flag on an entry (after flush).

pub fn is_dirty(&self, key: u64) -> bool

Check if an entry is dirty.

pub fn dirty_entries(&self) -> impl Iterator<Item = (u64, &V)>

Iterate over all dirty entries. Returns (key, &value) pairs.

pub fn dirty_entries_mut(&mut self) -> impl Iterator<Item = (u64, &mut V)>

Iterate mutably over all dirty entries.

pub fn clear_all_dirty(&mut self)

Clear all dirty flags (after commit).

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

Remove an entry by key. Returns the value if present.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

pub fn dirty_count(&self) -> usize

Count dirty entries.

pub fn clear(&mut self)

Remove all entries from the cache.