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
package edu.caltech.cs2.datastructures;
import edu.caltech.cs2.interfaces.IDeque;
import edu.caltech.cs2.interfaces.IQueue;
import edu.caltech.cs2.interfaces.IStack;
import java.util.Iterator;
public class ArrayDeque<E> implements IDeque<E>, IQueue<E>, IStack<E> {
@Override
public void addFront(E e) {
}
@Override
public void addBack(E e) {
}
@Override
public E removeFront() {
return null;
}
@Override
public E removeBack() {
return null;
}
@Override
public boolean enqueue(E e) {
return false;
}
@Override
public E dequeue() {
return null;
}
@Override
public boolean push(E e) {
return false;
}
@Override
public E pop() {
return null;
}
@Override
public E peekFront() {
return null;
}
@Override
public E peekBack() {
return null;
}
@Override
public E peek() {
return null;
}
@Override
public Iterator<E> iterator() {
return null;
}
@Override
public int size() {
return 0;
}
}