Struct RestoreCost 

pub struct RestoreCost {
    pub records_before_checkpoint: u64,
    pub tail_inputs_replayed: u64,
    pub records_after_checkpoint: u64,
    pub bytes_read: u64,
}

What a restore actually read.

A deterministic counter rather than a timer: the claim “restore is bounded by the tail” is about how much history is touched, and a wall-clock benchmark would measure the machine instead. The three counters are the three sources a restore can read from, and records_before_checkpoint is the one that must stay zero whenever a checkpoint exists.

Fields

records_before_checkpoint: u64

Journal records read from below the checkpoint’s base. Zero with a checkpoint; the whole journal without one.

tail_inputs_replayed: u64

Canonical inputs replayed out of the checkpoint’s own bounded tail — (base, through].

records_after_checkpoint: u64

Journal records replayed from above through_step_seq.

bytes_read: u64

Bytes read across all three, for the byte axis of the tail bound.

Implementations

impl RestoreCost

pub fn total_transitions(&self) -> u64

Trait Implementations

impl Clone for RestoreCost

fn clone(&self) -> RestoreCost

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RestoreCost

impl Debug for RestoreCost

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

Formats the value using the given formatter.

impl Default for RestoreCost

fn default() -> RestoreCost

Returns the “default value” for a type.

impl Eq for RestoreCost

impl PartialEq for RestoreCost

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RestoreCost