Struct TieredCache 

pub struct TieredCache { /* private fields */ }

Multi-level cache with automatic promotion.

Checks tiers in order: Memory → Local → (Remote, future). On a hit in a lower tier, promotes the entry to faster tiers.

Implementations

impl TieredCache

pub fn new(tiers: Vec<(CacheTier, Box<dyn CacheStore>)>) -> Self

Create a tiered cache from a list of (tier, store) pairs. Tiers should be ordered fastest-first.

pub fn memory_and_local( memory: Box<dyn CacheStore>, local: Box<dyn CacheStore>, ) -> Self

Create a two-level cache: Memory + Local.

Trait Implementations

impl CacheStore for TieredCache

fn get(&self, key: &CacheKey) -> Result<Option<Value>>

fn put(&self, key: &CacheKey, value: &Value) -> Result<()>

fn exists(&self, key: &CacheKey) -> Result<bool>

fn remove(&self, key: &CacheKey) -> Result<()>

fn metadata(&self, key: &CacheKey) -> Result<Option<EntryMeta>>