Struct kismet_cache::second_chance::Update

pub struct Update<T: Entry> {
    pub to_evict: Vec<T>,
    pub to_move_back: Vec<T>,
}

An Update<T> represents the maintenance operations to perform on a set of Second Chance entries.

Fields

to_evict: Vec<T>

List of entries to evict (remove from the cached set).

For files, this is a plain unlink / deletion.

to_move_back: Vec<T>

List of entries to move back in the list of potential removal victims, in order (i.e., the first entry in to_move_back should be moved directly to the end of the current list, the second entry right after, etc.).

For files, this corresponds to increasing the modification time to, e.g., “now.”

Implementations

impl<T: Entry> Update<T>

pub fn new(entries: impl IntoIterator<Item = T>, capacity: usize) -> Self

Determines how to update a second chance list of entries, so that at most capacity entries remain.