Struct EventualLeaderDetector 

pub struct EventualLeaderDetector<D: VolatileDetector = EventuallyPerfectFailureDetector> { /* private fields */ }

Trust the highest-ranked process not currently suspected.

Implementations

impl EventualLeaderDetector<EventuallyPerfectFailureDetector>

pub fn new( me: NodeId, peers: impl IntoIterator<Item = NodeId>, heartbeat: Duration, detect_after: Duration, ) -> Self

Ω among peers, over the eventually perfect detector Algorithm 2.8 names.

detect_after is the silence a peer is allowed to begin with: ◇P adapts it, and will suspect correct processes while it is below what the network actually needs — which is a fault this module faithfully passes on, and which the suites above deliberately provoke.

impl<D: VolatileDetector> EventualLeaderDetector<D>

pub fn with_detector( me: NodeId, peers: impl IntoIterator<Item = NodeId>, build: impl FnOnce(NodeId, BTreeSet<NodeId>) -> D, ) -> Self

Ω among peers, over whatever detector build supplies.

pub fn leader(&self) -> Option<NodeId>

Who this process currently trusts, if anyone.

pub fn suspected(&self) -> impl Iterator<Item = NodeId> + '_

The processes currently suspected by the detector beneath, as this layer has recorded them.

impl EventualLeaderDetector<PerfectFailureDetector>

pub fn over_perfect_detection( me: NodeId, peers: impl IntoIterator<Item = NodeId>, heartbeat: Duration, detect_after: Duration, ) -> Self

Ω over a perfect failure detector beating every heartbeat and accusing after detect_after of silence.

Trait Implementations

impl<D: Debug + VolatileDetector> Debug for EventualLeaderDetector<D>

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

Formats the value using the given formatter.

impl<D: VolatileDetector> Protocol for EventualLeaderDetector<D>

type Scope = Infallible

No scope conditions of its own.

type Meta = Infallible

Keeps nothing durably: a restarted process suspects nobody and trusts afresh.

fn on_init(&mut self, cx: &mut ProtoCx<'_, Self>)

upon event ⟨ Ω, Init ⟩ — and immediately a first Trust, since with nobody suspected maxrank(Π) is already defined and the standing condition already holds.

type Cmd = Infallible

Requests from the layer above.

type Ind = Ind

Indications to the layer above — this protocol delivering on its guarantee.

type Msg = <D as Protocol>::Msg

What crosses the wire to a peer running the same protocol.

type Note = Note

The vocabulary in which this protocol narrates its decisions.

type Entry = Infallible

The durable entries this protocol appends: what accumulates.

fn on_cmd(&mut self, cmd: Cmd, _: &mut ProtoCx<'_, Self>)

Handle a request from the layer above.

fn on_msg(&mut self, from: NodeId, msg: D::Msg, cx: &mut ProtoCx<'_, Self>)

Handle a message received from from.

fn on_timer(&mut self, id: TimerId, cx: &mut ProtoCx<'_, Self>)

Handle a timer that fired somewhere in this protocol or in what it composes.

fn on_recovery( &mut self, _cx: &mut Cx<'_, Self::Msg, Self::Ind, Self::Note, Self::Meta, Self::Entry>, )

Resume after a crash, reading what survived.

fn on_scope_event( &mut self, _scope: Self::Scope, _cx: &mut Cx<'_, Self::Msg, Self::Ind, Self::Note, Self::Meta, Self::Entry>, )

Handle a boundary of a scope this protocol’s guarantees depend on — its end, or the beginning of the one that succeeds it.