Struct KeyGcPlan 

pub struct KeyGcPlan {
    pub key: Vec<u8>,
    pub versions_to_remove: Vec<Timestamp>,
    pub collapse_tombstone: Option<Timestamp>,
    pub versions_examined: usize,
    pub complete: bool,
}

A deterministic, read-only garbage-collection plan for one logical key.

Fields

key: Vec<u8>

The exact logical key that was planned.

versions_to_remove: Vec<Timestamp>

Explicit obsolete version timestamps to remove, ordered newest first.

This list never includes the safe-point keeper. If Self::collapse_tombstone is present, the caller must remove that tombstone and these older versions atomically.

collapse_tombstone: Option<Timestamp>

The final tombstone timestamp to collapse, when explicitly permitted.

versions_examined: usize

Number of obsolete, pre-keeper version timestamps examined.

complete: bool

Whether the planner established that no eligible debt remains unplanned.

A page that exactly fills the budget is conservatively incomplete, because the bounded backend contract does not require a separate unbudgeted lookahead read. After applying the explicit removals, planning the same key again will establish completion or return another page.

Trait Implementations

impl Clone for KeyGcPlan

fn clone(&self) -> KeyGcPlan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KeyGcPlan

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

Formats the value using the given formatter.

impl Eq for KeyGcPlan

impl PartialEq for KeyGcPlan

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for KeyGcPlan