Struct TermFence 

pub struct TermFence<S>
where
    S: TermStore,
{ /* private fields */ }

The stale-term fence. Wraps a durable TermStore and applies the term rule at the apply and handshake boundaries.

Implementations

impl<S> TermFence<S>

where S: TermStore,

pub fn new(store: S) -> TermFence<S>

pub fn current_term(&self) -> Result<u64, TermStoreError>

The node’s current (highest adopted) term.

pub fn classify( &self, boundary: FenceBoundary, incoming_term: u64, ) -> Result<FenceVerdict, TermStoreError>

Classify incoming_term against the current term without mutating anything. Pure read — useful for probing a decision before committing to the adoption side-effect.

pub fn admit_record( &self, incoming_term: u64, ) -> Result<FenceVerdict, TermStoreError>

Admit (or fence) a term-stamped record at the apply boundary. On a newer term the fence adopts it durably before returning Adopt.

pub fn admit_handshake( &self, incoming_term: u64, ) -> Result<FenceVerdict, TermStoreError>

Admit (or fence) a stream handshake declaring incoming_term. On a newer term the fence adopts it durably before returning Adopt.

pub fn adopt(&self, new_term: u64) -> Result<(), TermStoreError>

Force the current term to new_term, persisting it. Used after a node re-syncs under a known term (e.g. a deposed primary rejoining as a replica) so it stops fencing the timeline it has now adopted. Never moves the term backwards.