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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/*
* Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
import java.util.*;
/**
* A complete Deque implementation that inherits the reversed() method
* from SequencedCollection. Useful for testing ReverseOrderDequeView.
* Underlying implementation provided by ArrayDeque.
*/
public class SimpleDeque<E> implements Deque<E> {
final Deque<E> deque;
public SimpleDeque() {
deque = new ArrayDeque<>();
}
public SimpleDeque(Collection<? extends E> c) {
deque = new ArrayDeque<>(c);
}
// ========== Object ==========
public boolean equals(Object o) {
return deque.equals(o);
}
public int hashCode() {
return deque.hashCode();
}
public String toString() {
return deque.toString();
}
// ========== Collection ==========
public boolean add(E e) {
return deque.add(e);
}
public boolean addAll(Collection<? extends E> c) {
return deque.addAll(c);
}
public void clear() {
deque.clear();
}
public boolean contains(Object o) {
return deque.contains(o);
}
public boolean containsAll(Collection<?> c) {
return deque.containsAll(c);
}
public boolean isEmpty() {
return deque.isEmpty();
}
public Iterator<E> iterator() {
return deque.iterator();
}
public boolean remove(Object o) {
return deque.remove(o);
}
public boolean removeAll(Collection<?> c) {
return deque.removeAll(c);
}
public boolean retainAll(Collection<?> c) {
return deque.retainAll(c);
}
public int size() {
return deque.size();
}
public Object[] toArray() {
return deque.toArray();
}
public <T> T[] toArray(T[] a) {
return deque.toArray(a);
}
// ========== Deque ==========
public void addFirst(E e) {
deque.addFirst(e);
}
public void addLast(E e) {
deque.addLast(e);
}
public boolean offerFirst(E e) {
return deque.offerFirst(e);
}
public boolean offerLast(E e) {
return deque.offerLast(e);
}
public E removeFirst() {
return deque.removeFirst();
}
public E removeLast() {
return deque.removeLast();
}
public E pollFirst() {
return deque.pollFirst();
}
public E pollLast() {
return deque.pollLast();
}
public E getFirst() {
return deque.getFirst();
}
public E getLast() {
return deque.getLast();
}
public E peekFirst() {
return deque.peekFirst();
}
public E peekLast() {
return deque.peekLast();
}
public boolean removeFirstOccurrence(Object o) {
return deque.removeFirstOccurrence(o);
}
public boolean removeLastOccurrence(Object o) {
return deque.removeLastOccurrence(o);
}
public boolean offer(E e) {
return deque.offer(e);
}
public E remove() {
return deque.remove();
}
public E poll() {
return deque.poll();
}
public E element() {
return deque.element();
}
public E peek() {
return deque.peek();
}
public void push(E e) {
deque.push(e);
}
public E pop() {
return deque.pop();
}
public Iterator<E> descendingIterator() {
return deque.descendingIterator();
}
}
|
