Struct TimeEventAccumulator 

pub struct TimeEventAccumulator { /* private fields */ }

Provides a means of accumulating and draining time event handlers using a priority queue.

Events are maintained in timestamp order using a binary heap, allowing efficient retrieval of the next event to process.

Implementations

impl TimeEventAccumulator

pub fn new() -> Self

Creates a new TimeEventAccumulator instance.

pub fn advance_clock( &mut self, clock: &mut TestClock, to_time_ns: UnixNanos, set_time: bool, )

Advance the given clock to the to_time_ns and push events to the heap.

pub fn peek_next_time(&self) -> Option<UnixNanos>

Peek at the next event timestamp without removing it.

Returns None if the heap is empty.

pub fn pop_next_at_or_before( &mut self, ts: UnixNanos, ) -> Option<TimeEventHandler>

Pop the next event if its timestamp is at or before ts.

Returns None if the heap is empty or the next event is after ts.

pub fn is_empty(&self) -> bool

Check if the heap is empty.

pub fn len(&self) -> usize

Get the number of events in the heap.

pub fn clear(&mut self)

Clear all events from the heap.

pub fn drain(&mut self) -> Vec<TimeEventHandler>

Drain all events from the heap in timestamp order.

This is provided for backwards compatibility with code that expects batch processing. For iterative processing, prefer pop_next_at_or_before.

Trait Implementations

impl Debug for TimeEventAccumulator

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for TimeEventAccumulator

fn default() -> Self

Creates a new default TimeEventAccumulator instance.