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
pub trait BidirectedQueue<T>: Default {
fn push_front(&mut self, t: T);
fn push_back(&mut self, t: T);
fn pop_front(&mut self) -> Option<T>;
fn pop_back(&mut self) -> Option<T>;
fn clear(&mut self);
fn len(&self) -> usize;
fn is_empty(&self) -> bool {
self.len() == 0
}
}
impl<T> BidirectedQueue<T> for std::collections::LinkedList<T> {
fn push_front(&mut self, t: T) {
std::collections::LinkedList::<T>::push_front(self, t)
}
fn push_back(&mut self, t: T) {
std::collections::LinkedList::<T>::push_back(self, t)
}
fn pop_front(&mut self) -> Option<T> {
std::collections::LinkedList::<T>::pop_front(self)
}
fn pop_back(&mut self) -> Option<T> {
std::collections::LinkedList::<T>::pop_back(self)
}
fn clear(&mut self) {
self.clear();
}
fn len(&self) -> usize {
std::collections::LinkedList::<T>::len(self)
}
}
impl<T> BidirectedQueue<T> for std::collections::VecDeque<T> {
fn push_front(&mut self, t: T) {
std::collections::VecDeque::<T>::push_front(self, t)
}
fn push_back(&mut self, t: T) {
std::collections::VecDeque::<T>::push_back(self, t)
}
fn pop_front(&mut self) -> Option<T> {
std::collections::VecDeque::<T>::pop_front(self)
}
fn pop_back(&mut self) -> Option<T> {
std::collections::VecDeque::<T>::pop_back(self)
}
fn clear(&mut self) {
self.clear();
}
fn len(&self) -> usize {
std::collections::VecDeque::<T>::len(self)
}
}