1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
/*
* Copyright (c) 2018 Frank Fischer <frank-fischer@shadow-soft.de>
*
* This program is free software: you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>
*/
use std::collections::VecDeque;
pub trait ItemQueue<I> {
fn is_empty(&self) -> bool {
self.len() == 0
}
fn len(&self) -> usize;
fn clear(&mut self);
fn push(&mut self, u: I);
fn pop(&mut self) -> Option<I>;
}
impl<'a, I, D> ItemQueue<I> for &'a mut D
where
D: ItemQueue<I>,
{
fn is_empty(&self) -> bool {
(**self).is_empty()
}
fn len(&self) -> usize {
(**self).len()
}
fn clear(&mut self) {
(**self).clear()
}
fn push(&mut self, u: I) {
(**self).push(u)
}
fn pop(&mut self) -> Option<I> {
(**self).pop()
}
}
impl<I> ItemQueue<I> for VecDeque<I> {
fn is_empty(&self) -> bool {
VecDeque::is_empty(self)
}
fn len(&self) -> usize {
VecDeque::len(self)
}
fn clear(&mut self) {
VecDeque::clear(self)
}
fn push(&mut self, u: I) {
VecDeque::push_back(self, u)
}
fn pop(&mut self) -> Option<I> {
VecDeque::pop_front(self)
}
}