Skip to main content

Watch

Struct Watch 

Source
pub struct Watch<B: Behavior> { /* private fields */ }
Expand description

Observe a logical peer name across any number of later incarnations.

A logical name can denote another incarnation after a stop, so every matching report is accepted and the watch remains observing. This recurrence law is distinct from crate::TerminationMonitor, which consumes one correlated terminal relationship. Initialization emits one typed ObservePeer request after preserving the inner initialization effects.

Implementations§

Source§

impl<B: Behavior> Watch<B>

Source

pub const fn new( inner: B, peer: BehaviorAddr<B>, on_stopped: LinkReaction<B>, ) -> Self

Wrap inner with recurring observation of one logical peer name.

Trait Implementations§

Source§

impl<B, A, Ph, Sends, Br> Behavior for Watch<B>
where A: Address, Sends: SendEffects + SendsFor<B::Event>, Br: BirthMode, B: Behavior<Ph = Ph, Sends = Sends, Birth = Br>, B::Protocol: Protocol<Addr = A>,

Source§

type Protocol = <B as Behavior>::Protocol

Stable public communication identity owned by this actor template. Read more
Source§

type Event = EventLayer<PeerStopped<<<B as Behavior>::Event as UserEvent>::Addr>, <B as Behavior>::Event>

Source§

type Sends = SendLayer<InterpreterRequests<ObservePeer<A>>, Sends>

Source§

type Ph = Ph

Source§

type Error = TerminationMonitorError<<B as Behavior>::Error, PeerStopped<A>>

Source§

type Birth = Br

Source§

fn init(&mut self, _: InitializationTurn) -> BehaviorActed<Self>

Produce initialization actions before the first event is accepted. Read more
Source§

fn transition( &mut self, _: ActiveTurn, event: Self::Event, ) -> BehaviorActed<Self>

Fold exactly one event into explicit actions and the next behavior. Read more
Source§

fn layer<L>(self, layer: L) -> <L as BehaviorLayer<Self>>::Output
where Self: Sized, L: BehaviorLayer<Self>,

Apply one statically dispatched construction layer. Read more
Source§

impl<B> BehaviorBase for Watch<B>

Source§

type Base = <B as BehaviorBase>::Base

Source§

fn base(&self) -> &Self::Base

Source§

impl<B> StashStatus for Watch<B>
where B: Behavior + StashStatus,

Auto Trait Implementations§

§

impl<B> Freeze for Watch<B>
where B: Freeze, <<B as Behavior>::Protocol as Protocol>::Addr: Freeze,

§

impl<B> RefUnwindSafe for Watch<B>

§

impl<B> Send for Watch<B>
where B: Send, <<B as Behavior>::Protocol as Protocol>::Addr: Send,

§

impl<B> Sync for Watch<B>
where B: Sync, <<B as Behavior>::Protocol as Protocol>::Addr: Sync,

§

impl<B> Unpin for Watch<B>
where B: Unpin, <<B as Behavior>::Protocol as Protocol>::Addr: Unpin,

§

impl<B> UnsafeUnpin for Watch<B>

§

impl<B> UnwindSafe for Watch<B>

Blanket Implementations§

Source§

impl<B> Activate for B
where B: Behavior,

Source§

fn initialize(self) -> Result<Initialized<Self>, Self::Error>

Consume this definition, perform its one initialization fold, and return the active behavior together with the ordered initialization effects. Read more
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<B> BeginShutdownPhases for B
where B: Behavior, <<B as Behavior>::Birth as BirthMode>::Child: ChildOccurrenceProduct<AvailableChildren>,

Source§

impl<Node> BirthNodeAppend<Never> for Node
where Node: NonEmptyBirthNode,

Source§

type Output = Node

Closed child algebra containing the complete prefix followed by the complete appended tail.
Source§

fn append_prefix(self) -> <Node as BirthNodeAppend<Never>>::Output

Inject one child from the existing prefix without changing its structural occurrence.
Source§

fn append_tail(tail: Never) -> <Node as BirthNodeAppend<Never>>::Output

Inject one child from the appended tail after every prefix occurrence.
Source§

fn append_creations<A>( prefix: Creations<CreateChild<A, Self>>, tail: Creations<CreateChild<A, Tail>>, ) -> Creations<CreateChild<A, Self::Output>>
where A: Address,

Preserve and concatenate two ordered creation batches.
Source§

impl<Child, Tail> BirthNodeAppend<Tail> for Child
where Child: Behavior, Tail: NonEmptyBirthNode,

Source§

type Output = ChildChoice<Child, Tail>

Closed child algebra containing the complete prefix followed by the complete appended tail.
Source§

fn append_prefix(self) -> <Child as BirthNodeAppend<Tail>>::Output

Inject one child from the existing prefix without changing its structural occurrence.
Source§

fn append_tail(tail: Tail) -> <Child as BirthNodeAppend<Tail>>::Output

Inject one child from the appended tail after every prefix occurrence.
Source§

fn append_creations<A>( prefix: Creations<CreateChild<A, Self>>, tail: Creations<CreateChild<A, Tail>>, ) -> Creations<CreateChild<A, Self::Output>>
where A: Address,

Preserve and concatenate two ordered creation batches.
Source§

impl<B> BirthProtocols for B
where B: Behavior, <B as Behavior>::Birth: BirthModeProtocols,

Source§

type Protocols = BirthProtocol<<B as Behavior>::Protocol, <<B as Behavior>::Birth as BirthModeProtocols>::Protocols>

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
Source§

impl<Node, Shape> ChildOccurrenceProduct<Shape> for Node
where Node: ChildOccurrenceProductAt<ChildHead, Shape>, Shape: ChildOccurrenceShape,

Source§

type Product = <Node as ChildOccurrenceProductAt<ChildHead, Shape>>::Product

Complete shape-owned representation of this closed birth node.
Source§

impl<A, Child, Host> DispatchBirth<A, Host> for Child
where A: Address, Child: CreateSelectedChild<A, ChildHead, Host>,

Source§

fn dispatch_birth( self, id: CreationId, route: <A as Address>::Nonce, kind: CreationKind, host: &mut Host, ) -> impl Future<Output = ItemSettlement<RoutedCreation<A, Child>, <Child as ChildCreationProduct<A, ChildHead>>::Result, CreationRejection, Never>> + Send

Select exactly one concrete child host while preserving creation data in every non-accepted settlement.
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.

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.