Struct EventQueue 

pub struct EventQueue<T>(/* private fields */);

The single owner of an unbounded FIFO of typed event pointers.

Publication schedules the owner’s wake callback on nagoya only when an empty batch becomes nonempty. Producers share one serialized ring lane, following the debug-control handoff. Full rings append another segment so publication stays unbounded. Taking a batch transfers the ring handles in one operation, releasing the lock before any event is handled. There is no idle receive loop and no payload copying.

Implementations

impl<T> EventQueue<T>

pub fn new(wake: impl Fn() + Send + Sync + 'static) -> EventQueue<T>

pub fn target(&self) -> EventTarget<T>

A publication capability that does not keep the consumer alive.

pub fn take_pending(&mut self) -> EventBatch<T>

Take the current batch in publication order, releasing the lock before the caller handles any event or drops any payload.

Trait Implementations

impl<T> Drop for EventQueue<T>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.