Struct EventQueue 

pub struct EventQueue { /* private fields */ }

Implementations

impl EventQueue

pub fn new(lane: QueueLane, capacity: u64) -> EventQueue

pub fn enqueue( &mut self, key: IdemKey, payload: Payload, now: TimeMs, ) -> Result<Admission, StorageError>

Admission first, then storage. A duplicate key is admitted-and- ignored rather than refused: the sender did its job, and telling it otherwise would invite a retry that changes nothing.

Errors

Returns nothing today; the fallible signature is the port’s, and storage that can fail is what it is there for.

pub fn consume(&mut self) -> Option<QueueItem>

Takes the oldest item. The key stays in seen, so a late duplicate arriving after consumption is still recognised.

pub fn stats(&self) -> QueueStats

pub fn len(&self) -> u64

pub fn is_empty(&self) -> bool

pub fn lane(&self) -> QueueLane

pub fn shed_count(&self) -> u64

Counters for the accounting payloads: how many were refused, how many arrived twice.

pub fn duplicate_count(&self) -> u64