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
use super::QueueCapAtLeast;
use arrayvec::ArrayVec;
impl<T, const LEN: usize> QueueCapAtLeast<LEN> for ArrayVec<T, LEN> {
type Item = T;
fn empty() -> Self {
Self::default()
}
fn len(&self) -> usize {
self.len()
}
fn deque(&mut self) -> Option<Self::Item> {
if self.len() > 0 {
Some(self.remove(self.len() - 1))
} else {
None
}
}
fn enque(&mut self, item: Self::Item) {
self.insert(0, item);
}
fn get_latest(&self, n: usize) -> Option<&Self::Item> {
self.get(n)
}
}