Struct EvictionCandidates 

pub struct EvictionCandidates(/* private fields */);

Snapshot of access times for blobs that are eligible for LRU eviction — i.e. pinned hashes are already excluded. Returned by CacheEngine::eviction_candidates.

The one carve-out is a deny-listed hash: it stays a candidate even when pinned (“deny wins over pin”), so the space path reclaims an unservable blob instead of holding it on disk.

The newtype makes “pinned-already-excluded” a type-level property: any future eviction-policy implementation that takes EvictionCandidates is guaranteed by the compiler not to evict pinned hashes. With a raw HashMap<Hash, Instant> return that guarantee would live only in a doc comment, and a future caller could substitute CacheEngine::access_times_snapshot (which includes pinned) by mistake.

Implementations

impl EvictionCandidates

pub fn len(&self) -> usize

Number of eviction candidates.

pub fn is_empty(&self) -> bool

Are there no eviction candidates?

pub fn contains_key(&self, hash: &Hash) -> bool

Does hash appear in the candidate set?

pub fn iter(&self) -> Iter<'_, Hash, Instant>

Iterate (hash, last-access) pairs.

pub fn into_inner(self) -> HashMap<Hash, Instant>

Consume into the underlying HashMap. Eviction policies that need to sort by access time and pop top-K can call this once at the start of their loop. The newtype’s invariant (pinned-already-excluded) is preserved by the time this returns — the caller just gets a plain map to work with.

Trait Implementations

impl Debug for EvictionCandidates

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

Formats the value using the given formatter.

impl Default for EvictionCandidates

fn default() -> Self

Returns the “default value” for a type.

impl<'a> IntoIterator for &'a EvictionCandidates

type Item = (&'a Hash, &'a Instant)

The type of the elements being iterated over.

type IntoIter = Iter<'a, Hash, Instant>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.