Struct ForcedPromotion 

pub struct ForcedPromotion {
    pub collection: CollectionId,
    pub range_id: RangeId,
    pub dead_owner: NodeIdentity,
    pub new_owner: NodeIdentity,
    pub covers_watermark: bool,
    pub evidence: Option<CatchUpEvidence>,
    pub next: RangeOwnership,
}

A forced promotion of one owned range away from the dead member to the best-available surviving replica. Unlike a planned hand-off this proceeds even when the target cannot prove it covers the commit watermark — covers_watermark records whether it could, so the audit trail captures any possible committed-write loss. next is the fenced catalog entry (epoch bumped) that activation installs.

Fields

collection: CollectionId

range_id: RangeId

dead_owner: NodeIdentity

new_owner: NodeIdentity

covers_watermark: bool

Whether the promoted replica’s applied log covers the commit watermark. When false, writes past the replica’s applied point may be lost — the price of recovering a range whose owner is gone.

evidence: Option<CatchUpEvidence>

The promoted replica’s catch-up evidence, if any was known.

next: RangeOwnership

Trait Implementations

impl Clone for ForcedPromotion

fn clone(&self) -> ForcedPromotion

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ForcedPromotion

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

Formats the value using the given formatter.

impl Eq for ForcedPromotion

impl PartialEq for ForcedPromotion

fn eq(&self, other: &ForcedPromotion) -> 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 ForcedPromotion