pub struct Latch<A, Route>{ /* private fields */ }Expand description
A one-generation countdown latch.
The state sum is LatchState::Counting or LatchState::Released. Each
arrival decrements exactly once. The transition reaching zero atomically
changes state to Released and emits one LatchReleased delivery to
every accepted participant in arrival order. Later arrivals receive an
immediate release. Initialization is empty; zero count starts released.
There are no rejection, retry, cancellation, or timer paths. The latch
never terminates itself. Countdown and ordering are Bombay workflow policy,
while typed delivery is interpreted by Address and Communication.
Implementations§
Trait Implementations§
Source§impl<A, Route> Behavior for Latch<A, Route>where
A: Address,
Route: DeliveryRoute,
Route::Protocol: Protocol<Addr = A, Msg = LatchReleased>,
Route::Sends: SendsFor<User<A, LatchMessage<Route>>>,
impl<A, Route> Behavior for Latch<A, Route>where
A: Address,
Route: DeliveryRoute,
Route::Protocol: Protocol<Addr = A, Msg = LatchReleased>,
Route::Sends: SendsFor<User<A, LatchMessage<Route>>>,
Source§type Protocol = Latch<A, Route>
type Protocol = Latch<A, Route>
Stable public communication identity owned by this actor template. Read more
type Event = User<A, <<Latch<A, Route> as Behavior>::Protocol as Protocol>::Msg>
type Sends = <Route as DeliveryRoute>::Sends
type Ph = Never
type Error = Never
type Birth = NoBirths
Source§fn transition(
&mut self,
_: ActiveTurn,
event: Self::Event,
) -> BehaviorActed<Self>
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 init(
&mut self,
_turn: InitializationTurn,
) -> Result<Actions<<Self::Protocol as Protocol>::Addr, Self::Ph, Self::Sends, Self::Birth>, Self::Error>where
Self: Sized,
fn init(
&mut self,
_turn: InitializationTurn,
) -> Result<Actions<<Self::Protocol as Protocol>::Addr, Self::Ph, Self::Sends, Self::Birth>, Self::Error>where
Self: Sized,
Produce initialization actions before the first event is accepted. Read more
Source§fn layer<L>(self, layer: L) -> <L as BehaviorLayer<Self>>::Outputwhere
Self: Sized,
L: BehaviorLayer<Self>,
fn layer<L>(self, layer: L) -> <L as BehaviorLayer<Self>>::Outputwhere
Self: Sized,
L: BehaviorLayer<Self>,
Apply one statically dispatched construction layer. Read more
Source§impl<A, Route> BehaviorBase for Latch<A, Route>
impl<A, Route> BehaviorBase for Latch<A, Route>
Auto Trait Implementations§
impl<A, Route> Freeze for Latch<A, Route>
impl<A, Route> RefUnwindSafe for Latch<A, Route>where
Route: RefUnwindSafe,
impl<A, Route> Send for Latch<A, Route>where
Route: Send,
impl<A, Route> Sync for Latch<A, Route>where
Route: Sync,
impl<A, Route> Unpin for Latch<A, Route>where
Route: Unpin,
impl<A, Route> UnsafeUnpin for Latch<A, Route>
impl<A, Route> UnwindSafe for Latch<A, Route>where
Route: UnwindSafe,
Blanket Implementations§
Source§impl<B> Activate for Bwhere
B: Behavior,
impl<B> Activate for Bwhere
B: Behavior,
Source§fn initialize(self) -> Result<Initialized<Self>, Self::Error>
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<B> BeginShutdownPhases for B
impl<B> BeginShutdownPhases for B
type Output = ChildShutdownPhases<B, <<<B as Behavior>::Birth as BirthMode>::Child as ChildOccurrenceProduct<AvailableChildren>>::Product, NoPhases>
fn begin_shutdown_phases(self) -> <B as BeginShutdownPhases>::Output
Source§impl<Node> BirthNodeAppend<Never> for Nodewhere
Node: NonEmptyBirthNode,
impl<Node> BirthNodeAppend<Never> for Nodewhere
Node: NonEmptyBirthNode,
Source§type Output = Node
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
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
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,
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 Childwhere
Child: Behavior,
Tail: NonEmptyBirthNode,
impl<Child, Tail> BirthNodeAppend<Tail> for Childwhere
Child: Behavior,
Tail: NonEmptyBirthNode,
Source§type Output = ChildChoice<Child, Tail>
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
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
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,
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
impl<B> BirthProtocols for B
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<Node, Shape> ChildOccurrenceProduct<Shape> for Nodewhere
Node: ChildOccurrenceProductAt<ChildHead, Shape>,
Shape: ChildOccurrenceShape,
impl<Node, Shape> ChildOccurrenceProduct<Shape> for Nodewhere
Node: ChildOccurrenceProductAt<ChildHead, Shape>,
Shape: ChildOccurrenceShape,
Source§impl<A, Child, Host> DispatchBirth<A, Host> for Child
impl<A, Child, Host> DispatchBirth<A, Host> for Child
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
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.