Struct using_queue::UsingQueue

pub struct UsingQueue<T> { /* fields omitted */ }

Special queue-like data structure that includes the notion of usage to avoid items that were queued but never used from making it into the queue.

Implementations

impl<T> UsingQueue<T>

pub fn new(max_size: usize) -> UsingQueue<T>

Create a new struct with a maximum size of max_size.

pub fn peek_last_ref(&self) -> Option<&T>

Return a reference to the item at the top of the queue (or None if the queue is empty); it doesn’t constitute noting that the item is used.

pub fn use_last_ref(&mut self) -> Option<&T>

Return a reference to the item at the top of the queue (or None if the queue is empty); this constitutes using the item and will remain in the queue for at least another max_size invocations of set_pending() + use_last_ref().

pub fn set_pending(&mut self, b: T)

Place an item on the end of the queue. The previously pending item will be removed if use_last_ref() since it was set.

pub fn is_in_use(&self) -> bool

Is there anything in the queue currently?

pub fn reset(&mut self)

Clears everything; the queue is entirely reset.

pub fn get_used_if<P>(&mut self, action: GetAction, predicate: P) -> Option<T> where
    P: Fn(&T) -> bool,
    T: Clone, 

Fork-function for take_used_if and clone_used_if.

pub fn get_pending_if<P>(&mut self, predicate: P) -> Option<T> where
    P: Fn(&T) -> bool,
    T: Clone, 

Returns a clone of the pending block if f returns true with a reference to it as a parameter, otherwise None.

If pending block is not available will clone the first of the used blocks that match the predicate.