Struct FCFSStorage 

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

The FCFS queue storage.

Implementations

impl<T> FCFSStorage<T>

where T: Clone,

pub fn new() -> Self

Create a new storage.

Trait Implementations

impl<T> QueueStorage for FCFSStorage<T>

where T: Clone + 'static,

type Priority = ()

The type of priorities, if push_with_priority is supported. Otherwise, it may define the () type.

type Item = T

The type of items.

fn is_empty(&self, p: &Point<'_>) -> bool

Test whether the storage is empty.

fn pop(&self, p: &Point<'_>) -> Option<Self::Item>

Pop the front item.

fn push(&self, item: Self::Item, p: &Point<'_>)

Push an item, or panic if only push_with_priority is supported.

fn push_with_priority( &self, _priority: Self::Priority, _item: Self::Item, _p: &Point<'_>, )

Push an item with the specified priority, or panic if only push is supported.

fn remove_by<F>(&self, predicate: F, p: &Point<'_>) -> Option<Self::Item>

where F: Fn(&Self::Item) -> bool + Clone,

Try to remove an item satisfying the specified predicate and return the item removed.

fn exists<F>(&self, predicate: F, p: &Point<'_>) -> bool

where F: Fn(&Self::Item) -> bool + Clone,

Detect whether there is an element satisfying the specified predicate in the queue.

fn find<F>(&self, predicate: F, p: &Point<'_>) -> Option<T>

where F: Fn(&Self::Item) -> bool + Clone, Self::Item: Clone,

Find an element satisfying the specified predicate.