Struct TimeQueue

pub struct TimeQueue<T> { /* private fields */ }

A time queue that delays yielding inserted elements until a fixed timeout has elapsed. Each inserted element is stored together with its expiration time (current Tokio Instant plus the constant timeout). Since the timeout is constant, the elements naturally expire in FIFO order, and both push and pop operations are O(1).

Implementations

impl<T> TimeQueue<T>

pub fn new(timeout: Duration) -> Self

Creates a new TimeQueue with the given timeout.

pub fn with_capacity(timeout: Duration, capacity: usize) -> Self

Creates a new TimeQueue with the given timeout and reserves capacity for the underlying queue.

pub fn push(&mut self, element: T)

Inserts an element into the queue. The element will be yielded after timeout has elapsed from the time of insertion.

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

Trait Implementations

impl<T> Stream for TimeQueue<T>

type Item = T

Values yielded by the stream.

fn poll_next( self: Pin<&mut Self>, cx: &mut Context<'_>, ) -> Poll<Option<Self::Item>>

Attempt to pull out the next value of this stream, registering the current task for wakeup if the value is not yet available, and returning None if the stream is exhausted.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the stream.

impl<T> Unpin for TimeQueue<T>