Struct DelayQueue

pub struct DelayQueue<T: Delayed + Send> { /* private fields */ }

An unbounded blocking queue of delayed values. When a value is pushed onto the queue, a delay is included. The value will only be able to be popped off once the specified delay has expired. The head of the queue is the value whose delay is expired and furthest in the past.

Implementations

impl<T: Delayed + Send> DelayQueue<T>

pub fn new() -> DelayQueue<T>

Create a new DelayQueue

pub fn poll_timeout(&self, timeout: Duration) -> Option<T>

Retrieves and removes the head of the queue, blocking if necessary for up to timeout.

Trait Implementations

impl<T: Delayed + Send> Clone for DelayQueue<T>

fn clone(&self) -> DelayQueue<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Delayed + Send> Queue<T> for DelayQueue<T>

fn poll(&self) -> Option<T>

Retrieves and removes the head of this queue or returns None if the queue is empty.

fn is_empty(&self) -> bool

Returns true if the underlying data structure does not contain any elements.

fn offer(&self, e: T) -> Result<(), T>

impl<T: Delayed + Send> SyncQueue<T> for DelayQueue<T>

fn take(&self) -> T

Retrieves and removes the head of this queue, waiting if necessary until an element becomes available.

fn put(&self, e: T)