Skip to main content

Presence

Struct Presence 

Source
pub struct Presence<A: Address, K, Route: DeliveryRoute<Protocol: Protocol<Addr = A, Msg = PresenceReply<K>>>> { /* private fields */ }
Expand description

Versioned, generation-safe membership-presence behavior.

The first announcement commits generation zero before requesting expiry. Greater evidence versions refresh with a checked fresh generation; identical evidence is idempotent and does not reschedule. Lower or contradictory evidence is rejected atomically. A timer-key collision with another live participant is rejection, never replacement. Matching elapsed evidence commits an explicit tombstone and reports expiry. Generations advance per timer key across every retained participant tombstone, so reuse by a later participant cannot reinterpret delayed evidence from an earlier owner; stale and unknown timer evidence is inert. Initialization is empty, no actors are created, and the host never terminates by policy. Versioning, first-observation ordering, timer mapping, and tombstone retention are Bombay policy. Scheduling belongs to Timers; release/cancellation is not part of this announcement protocol. No transition has a semantic panic condition.

Implementations§

Source§

impl<A, K, Route> Presence<A, K, Route>
where A: Address, K: Clone + Eq, Route: DeliveryRoute<Protocol: Protocol<Addr = A, Msg = PresenceReply<K>>> + Clone,

Source

pub const fn new(timer_id: fn(&K) -> TimerId) -> Self

Construct an empty presence table with a pure actor-local timer mapping.

Source

pub fn report(&self) -> PresenceReport<K>

Snapshot complete present and tombstoned state.

Trait Implementations§

Source§

impl<A, K, Route> Behavior for Presence<A, K, Route>
where A: Address, K: Clone + Eq, Route: DeliveryRoute<Protocol: Protocol<Addr = A, Msg = PresenceReply<K>>> + Clone, Route::Sends: SendsFor<TimedEvent<User<A, PresenceMessage<K, Route>>>>,

Source§

type Protocol = Presence<A, K, Route>

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

type Event = EventLayer<TimerElapsed, User<A, <<Presence<A, K, Route> as Behavior>::Protocol as Protocol>::Msg>>

Source§

type Sends = PresenceSends<<Route as DeliveryRoute>::Sends, InterpreterRequests<ScheduleAfter>>

Source§

type Ph = Never

Source§

type Error = Never

Source§

type Birth = NoBirths

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 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>>::Output
where Self: Sized, L: BehaviorLayer<Self>,

Apply one statically dispatched construction layer. Read more
Source§

impl<A, K, Route> BehaviorBase for Presence<A, K, Route>
where A: Address, Route: DeliveryRoute<Protocol: Protocol<Addr = A, Msg = PresenceReply<K>>>,

Source§

type Base = Presence<A, K, Route>

Source§

fn base(&self) -> &Self

Source§

impl<A, K, Route> Protocol for Presence<A, K, Route>
where A: Address, Route: DeliveryRoute<Protocol: Protocol<Addr = A, Msg = PresenceReply<K>>>,

Source§

type Addr = A

Source§

type Msg = PresenceMessage<K, Route>

Auto Trait Implementations§

§

impl<A, K, Route> Freeze for Presence<A, K, Route>

§

impl<A, K, Route> RefUnwindSafe for Presence<A, K, Route>
where Route: RefUnwindSafe, K: RefUnwindSafe,

§

impl<A, K, Route> Send for Presence<A, K, Route>
where Route: Send, K: Send,

§

impl<A, K, Route> Sync for Presence<A, K, Route>
where Route: Sync, K: Sync,

§

impl<A, K, Route> Unpin for Presence<A, K, Route>
where Route: Unpin, K: Unpin,

§

impl<A, K, Route> UnsafeUnpin for Presence<A, K, Route>

§

impl<A, K, Route> UnwindSafe for Presence<A, K, Route>
where Route: UnwindSafe, K: UnwindSafe,

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.