Struct GcPlan 

pub struct GcPlan {
    pub reachability: GcReachability,
    pub candidate_nodes: usize,
    pub reclaimable_cids: Vec<Cid>,
    pub reclaimable_nodes: usize,
    pub reclaimable_bytes: usize,
    pub missing_candidates: usize,
}

Dry-run garbage-collection plan for an explicit candidate set.

Fields

reachability: GcReachability

Reachability report for the retained roots.

candidate_nodes: usize

Number of unique candidate CIDs inspected.

reclaimable_cids: Vec<Cid>

Unreachable candidate CIDs present in the store, sorted by CID bytes.

reclaimable_nodes: usize

Number of reclaimable candidate nodes.

reclaimable_bytes: usize

Serialized bytes reclaimable from present unreachable candidates.

missing_candidates: usize

Candidate CIDs that were neither reachable nor present in the store.

Implementations

impl GcPlan

pub fn reclaimable_cids(&self) -> &[Cid]

Return reclaimable candidate CIDs in stable byte order.

pub fn is_empty(&self) -> bool

Whether this plan would delete no nodes.

pub fn retained_candidate_nodes(&self) -> usize

Number of candidate nodes retained because they are still reachable.

Trait Implementations

impl Clone for GcPlan

fn clone(&self) -> GcPlan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GcPlan

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

Formats the value using the given formatter.

impl Default for GcPlan

fn default() -> GcPlan

Returns the “default value” for a type.

impl Eq for GcPlan

impl PartialEq for GcPlan

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GcPlan