Struct Tiered 

pub struct Tiered<M: Medium> {
    pub front: MemoryCache,
    pub back: Pack<M>,
}

The back is a pack and nothing else: store carries no cost, and a pack admits by kind alone, so no back gated on cost can sit here and silently keep nothing.

Fields

front: MemoryCache

back: Pack<M>

Implementations

impl<M: Medium> Tiered<M>

pub fn new(front: MemoryCache, back: Pack<M>) -> Tiered<M>

Trait Implementations

impl<M: Medium> Cache for Tiered<M>

fn held_bytes(&self) -> u64

Both tiers’ own bytes, summed: a value in both is held twice.

fn load(&self, key: Hash, node: &str, expected: Expected) -> Option<Entry>

fn store( &self, key: Hash, payload: &Payload, traces: &[FilterTrace], label: Option<&Label>, )

fn holds(&self, key: Hash) -> bool

fn worth_storing(&self, cost: Duration, bytes: usize, kind: PayloadKind) -> bool

fn sweep(&self)

fn evicted_bytes(&self) -> u64

fn faults(&self) -> u64

fn max_bytes(&self) -> u64

fn dir(&self) -> Option<&Path>