Skip to main content

FairLossLink

Struct FairLossLink 

Source
pub struct FairLossLink<P>(/* private fields */);
Expand description

The link the book’s stack starts from: send it, and hope.

No retransmission, no deduplication, no timer, no state. What arrives, arrives.

Implementations§

Source§

impl<P> FairLossLink<P>

Source

pub fn new() -> Self

Trait Implementations§

Source§

impl<P: Debug> Debug for FairLossLink<P>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<P: Default> Default for FairLossLink<P>

Source§

fn default() -> FairLossLink<P>

Returns the “default value” for a type. Read more
Source§

impl<P: Clone> Link<P> for FairLossLink<P>

The fair-loss link satisfies the link port, and only its unscoped half.

It does not report scope boundaries because it cannot observe any — it holds no session, no epoch and no state whatever. A layer that repairs a scope ending gets nothing from this link, which is the honest outcome rather than a boundary invented to satisfy a bound.

Source§

fn send(to: NodeId, msg: P) -> Cmd<P>

The request that sends msg to to. Read more
Source§

fn classify(_: Ind<P>) -> LinkInd<P>

What this indication means to the layer above. Read more
Source§

impl<P: Clone> Protocol for FairLossLink<P>

Source§

type Scope = Infallible

No scope conditions. FLL1 to FLL3 are stated over correct processes and hold as long as one is correct; there is no session to end and nothing this link could report about one.

Source§

type Meta = Infallible

Keeps nothing durably, because it keeps nothing at all.

Source§

type Cmd = Cmd<P>

Requests from the layer above.
Source§

type Ind = Ind<P>

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

type Msg = P

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

type Note = Note

The vocabulary in which this protocol narrates its decisions. Read more
Source§

type Entry = Infallible

The durable entries this protocol appends: what accumulates.
Source§

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

Handle a request from the layer above.
Source§

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

Handle a message received from from.
Source§

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. Read more
§

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

Begin, on a first start — when nothing has been written down. Read more
§

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. Read more
§

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. Read more

Auto Trait Implementations§

§

impl<P> Freeze for FairLossLink<P>

§

impl<P> RefUnwindSafe for FairLossLink<P>

§

impl<P> Send for FairLossLink<P>

§

impl<P> Sync for FairLossLink<P>

§

impl<P> Unpin for FairLossLink<P>

§

impl<P> UnsafeUnpin for FairLossLink<P>

§

impl<P> UnwindSafe for FairLossLink<P>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

Source§

impl<P, L> VolatileLink<P> for L
where L: Link<P, Meta = Infallible, Entry = Infallible>,