use std::collections::{BinaryHeap, VecDeque};
#[derive(Clone, Debug, PartialEq, Eq)]
pub enum QueueError {
Full,
Rejected(String),
}
impl std::fmt::Display for QueueError {
fn fmt(&self, formatter: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
match self {
Self::Full => formatter.write_str("operation queue is full"),
Self::Rejected(message) => formatter.write_str(message),
}
}
}
impl std::error::Error for QueueError {}
pub trait OperationQueue<T>: Send {
fn push(&mut self, item: T) -> Result<(), QueueError>;
fn pop(&mut self) -> Option<T>;
fn len(&self) -> usize;
fn retain(&mut self, predicate: &mut dyn FnMut(&T) -> bool);
fn is_empty(&self) -> bool {
self.len() == 0
}
fn clear(&mut self) {
while self.pop().is_some() {}
}
}
pub struct FifoQueue<T> {
items: VecDeque<T>,
}
impl<T> Default for FifoQueue<T> {
fn default() -> Self {
Self {
items: VecDeque::new(),
}
}
}
impl<T: Send> OperationQueue<T> for FifoQueue<T> {
fn push(&mut self, item: T) -> Result<(), QueueError> {
self.items.push_back(item);
Ok(())
}
fn pop(&mut self) -> Option<T> {
self.items.pop_front()
}
fn len(&self) -> usize {
self.items.len()
}
fn retain(&mut self, predicate: &mut dyn FnMut(&T) -> bool) {
self.items.retain(predicate);
}
fn clear(&mut self) {
self.items.clear();
}
}
pub struct PriorityQueue<T> {
items: BinaryHeap<T>,
}
impl<T: Ord> Default for PriorityQueue<T> {
fn default() -> Self {
Self {
items: BinaryHeap::new(),
}
}
}
impl<T: Ord + Send> OperationQueue<T> for PriorityQueue<T> {
fn push(&mut self, item: T) -> Result<(), QueueError> {
self.items.push(item);
Ok(())
}
fn pop(&mut self) -> Option<T> {
self.items.pop()
}
fn len(&self) -> usize {
self.items.len()
}
fn retain(&mut self, predicate: &mut dyn FnMut(&T) -> bool) {
self.items.retain(predicate);
}
fn clear(&mut self) {
self.items.clear();
}
}