Struct DivergentTail 

pub struct DivergentTail {
    pub common_point_lsn: u64,
    pub to_lsn: u64,
    pub records: Vec<TailRecord>,
}

The divergent tail removed from the live timeline: the records in (common_point_lsn, to_lsn] that never reached quorum.

Fields

common_point_lsn: u64

The common point — exclusive lower bound. Records at or below this LSN are kept; this is the recover-to-LSN target.

to_lsn: u64

Inclusive upper bound — the deposed primary’s local frontier.

records: Vec<TailRecord>

The tail records, in LSN order. May be shorter than the LSN span (e.g. sparse / coalesced records); the span is authoritative for the boundary, the records are what gets preserved.

Implementations

impl DivergentTail

pub fn span_lsns(&self) -> u64

Number of LSNs removed from the live timeline.

Trait Implementations

impl Clone for DivergentTail

fn clone(&self) -> DivergentTail

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DivergentTail

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

Formats the value using the given formatter.

impl Eq for DivergentTail

impl PartialEq for DivergentTail

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for DivergentTail