Struct SnapshotRoots 

pub struct SnapshotRoots {
    pub bindings: BTreeSet<(String, String)>,
    pub checkpoints: BTreeSet<(String, String)>,
    pub lane_heads: BTreeSet<(String, String)>,
}

Everything that keeps a lane rev alive, kept apart by where the claim came from so cleanup can explain retained disk instead of just retaining it.

Checkpoints are roots even for instances whose binding record has been archived. A checkpoint pointing at a pruned rev is not a smaller store, it is a broken undo.

Fields

bindings: BTreeSet<(String, String)>

Claimed by a surviving instance’s tracker binding.

checkpoints: BTreeSet<(String, String)>

Claimed by any checkpoint record, live or archived.

lane_heads: BTreeSet<(String, String)>

Claimed by a lane’s own head (LATEST), which new instances project.

Implementations

impl SnapshotRoots

pub fn collect( store: &MetadataStore, branches: &[BranchInstance], ) -> Result<Self>

branches is the set of instances that survive the cleanup pass, not everything on disk — a record about to be archived must not keep its unreferenced captures alive.

pub fn contains(&self, tracker: &str, rev: &str) -> bool

pub fn pinned_only_by_checkpoints( &self, ) -> impl Iterator<Item = &(String, String)>

Revs held only because some checkpoint references them — the disk a user might otherwise expect cleanup to have reclaimed.

Trait Implementations

impl Clone for SnapshotRoots

fn clone(&self) -> SnapshotRoots

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SnapshotRoots

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

Formats the value using the given formatter.

impl Default for SnapshotRoots

fn default() -> SnapshotRoots

Returns the “default value” for a type.

impl Eq for SnapshotRoots

impl PartialEq for SnapshotRoots

fn eq(&self, other: &SnapshotRoots) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for SnapshotRoots