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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
package edu.caltech.cs2.interfaces;
import org.hamcrest.MatcherAssert;
import org.hamcrest.collection.IsEmptyIterable;
import org.junit.jupiter.api.DisplayName;
import org.junit.jupiter.api.Order;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.params.ParameterizedTest;
import org.junit.jupiter.params.provider.CsvSource;
import org.hamcrest.collection.IsIterableContainingInOrder;
import org.junit.jupiter.params.provider.ValueSource;
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Random;
import static edu.caltech.cs2.project03.Project03TestOrdering.*;
import static org.junit.jupiter.api.Assertions.*;
public interface IDequeTests extends ICollectionTests {
IDeque<Object> newDeque();
@Order(dequeTestLevel)
@DisplayName("Test Deque Iterator")
@ParameterizedTest(name = "Test deque iterator on [{arguments}]")
@ValueSource(strings = {
"",
"1",
"0, 1, 2, 3",
"5, 4, 3, 2, 1",
"8, 3, 5, 7, 4, 3, 12, 12, 1"
})
default void testIterator(String inputs) {
ArrayDeque<Object> ref = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
for (Object value : inputs.trim().split(", ")) {
impl.addBack(value);
ref.addLast(value);
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
}
// Check that iterator is consistent while objects are removed from the back
for (Object ignored : inputs.trim().split(", ")) {
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
impl.removeBack();
ref.removeLast();
}
MatcherAssert.assertThat(impl, IsEmptyIterable.emptyIterable());
}
@Test
@Order(dequeTestLevel)
@DisplayName("Test Deque addFront / removeFront edge cases")
default void testRepeatedAddFrontRemoveFront() {
ArrayDeque<Object> ref = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
for (int i = 0; i < 10; i ++) {
for (int j = 0; j < 5; j ++) {
impl.addFront(i);
ref.addFirst(i);
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
}
for (int j = 0; j < 5; j ++) {
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
impl.removeFront();
ref.removeFirst();
}
assertTrue(impl.isEmpty());
MatcherAssert.assertThat(impl, IsEmptyIterable.emptyIterable());
}
}
@Test
@Order(dequeTestLevel)
@DisplayName("Test Deque addFront / removeBack edge cases")
default void testRepeatedAddFrontRemoveBack() {
ArrayDeque<Object> ref = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
for (int i = 0; i < 10; i ++) {
for (int j = 0; j < 5; j ++) {
impl.addFront(i);
ref.addFirst(i);
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
}
for (int j = 0; j < 5; j ++) {
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
impl.removeBack();
ref.removeLast();
}
assertTrue(impl.isEmpty());
MatcherAssert.assertThat(impl, IsEmptyIterable.emptyIterable());
}
}
@Test
@Order(dequeTestLevel)
@DisplayName("Test Deque addBack / removeFront edge cases")
default void testRepeatedAddBackRemoveFront() {
ArrayDeque<Object> ref = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
for (int i = 0; i < 10; i ++) {
for (int j = 0; j < 5; j ++) {
impl.addBack(i);
ref.addLast(i);
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
}
for (int j = 0; j < 5; j ++) {
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
impl.removeFront();
ref.removeFirst();
}
assertTrue(impl.isEmpty());
MatcherAssert.assertThat(impl, IsEmptyIterable.emptyIterable());
}
}
@Test
@Order(dequeTestLevel)
@DisplayName("Test Deque addBack / removeBack edge cases")
default void testRepeatedAddBackRemoveBack() {
ArrayDeque<Object> ref = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
for (int i = 0; i < 10; i ++) {
for (int j = 0; j < 5; j ++) {
impl.addBack(i);
ref.addLast(i);
MatcherAssert.assertThat(impl, IsIterableContainingInOrder.contains(ref.toArray()));
}
for (int j = 0; j < 5; j ++) {
impl.removeBack();
ref.removeLast();
}
assertTrue(impl.isEmpty());
MatcherAssert.assertThat(impl, IsEmptyIterable.emptyIterable());
}
}
@Order(dequeTestLevel)
@DisplayName("Stress test for addFront(...) and peekFront(...)")
@ParameterizedTest(name = "Test addFront()ing {1} random numbers with seed = {0}")
@CsvSource({
"100, 300", "42, 500"
})
default void stressTestAddFront(int seed, int size) {
Random r = new Random(seed);
Deque<Object> reference = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
// Test that first peek is null
assertNull(impl.peekFront(), "empty peek should return null");
// Test adding values updates size and displays contained correctly
for (int i = 0; i < size; i++) {
int num = r.nextInt();
reference.addFirst(num);
impl.addFront(num);
assertEquals(reference.size(), impl.size(), "size()s are not equal");
assertEquals(reference.peekFirst(), impl.peekFront(), "peeks should be the same");
assertEquals(reference.toString(), impl.toString(), "toStrings()s are not equal");
}
}
@Order(dequeTestLevel)
@DisplayName("Stress test for addBack(...) and peekBack(...)")
@ParameterizedTest(name = "Test addBack()ing {1} random numbers with seed = {0}")
@CsvSource({
"100, 300", "42, 500"
})
default void stressTestAddBack(int seed, int size) {
Random r = new Random(seed);
Deque<Object> reference = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
// Test that first peek is null
assertNull(impl.peekBack(), "empty peek should return null");
// Test adding values updates size and displays contained correctly
for (int i = 0; i < size; i++) {
int num = r.nextInt();
reference.addLast(num);
impl.addBack(num);
assertEquals(reference.size(), impl.size(), "size()s are not equal");
assertEquals(reference.peekLast(), impl.peekBack(), "peeks should be the same");
assertEquals(reference.toString(), impl.toString(), "toStrings()s are not equal");
}
}
@Order(dequeTestLevel)
@DisplayName("Stress test for removeFront(...)")
@ParameterizedTest(name = "Test removeFront()ing {1} random numbers with seed = {0}")
@CsvSource({
"101, 300", "45, 500"
})
default void stressTestRemoveFront(int seed, int size) {
Random r = new Random(seed);
Deque<Object> reference = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
// Test that first removeFront is null
assertNull(impl.removeFront(), "empty removeFront should return null");
for (int i = 0; i < size; i++) {
int num = r.nextInt();
reference.addFirst(num);
impl.addFront(num);
assertEquals(reference.peekFirst(), impl.peekFront(),"return values of peekFront()s are not equal");
if (r.nextBoolean()) {
assertEquals(reference.removeFirst(), impl.removeFront(),"return values of removeFront()s are not equal");
assertEquals(reference.peekFirst(), impl.peekFront(),"return values of peekFront()s are not equal");
}
assertEquals(reference.size(), impl.size(), "size()s are not equal");
assertEquals(reference.toString(), impl.toString(), "toStrings()s are not equal");
}
}
@Order(dequeTestLevel)
@DisplayName("Stress test for removeBack(...)")
@ParameterizedTest(name = "Test removeBack()ing {1} random numbers with seed = {0}")
@CsvSource({
"101, 300", "45, 500"
})
default void stressTestRemoveBack(int seed, int size) {
Random r = new Random(seed);
Deque<Object> reference = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
// Test that first removeBack is null
assertNull(impl.removeBack(), "empty removeBack should return null");
for (int i = 0; i < size; i++) {
int num = r.nextInt();
reference.addLast(num);
impl.addBack(num);
assertEquals(reference.peekLast(), impl.peekBack(),"return values of peekBack()s are not equal");
if (r.nextBoolean()) {
assertEquals(reference.removeLast(), impl.removeBack(),"return values of removeBack()s are not equal");
assertEquals(reference.peekLast(), impl.peekBack(),"return values of peekBack()s are not equal");
}
assertEquals(reference.size(), impl.size(), "size()s are not equal");
assertEquals(reference.toString(), impl.toString(), "toStrings()s are not equal");
}
}
@Order(dequeTestLevel)
@DisplayName("Stress test full IDeque")
@ParameterizedTest(name = "Test all IDeque methods {1} random numbers with seed = {0}")
@CsvSource({
"102, 300", "52, 500"
})
default void stressTestFullDeque(int seed, int size) {
Random r = new Random(seed);
Deque<Object> reference = new ArrayDeque<>();
IDeque<Object> impl = newDeque();
for (int i = 0; i < size; i++) {
int num = r.nextInt();
// Add to either front or back
if (r.nextBoolean()) {
reference.addFirst(num);
impl.addFront(num);
}
else {
reference.addLast(num);
impl.addBack(num);
}
// Test that peeks are correct
assertEquals(reference.peekFirst(), impl.peekFront(),"return values of peekFront()s are not equal");
assertEquals(reference.peekLast(), impl.peekBack(),"return values of peekBacks()s are not equal");
// If true, remove an element
if (r.nextBoolean()) {
// If true, remove from front, else remove from back
if (r.nextBoolean()) {
assertEquals(reference.removeFirst(), impl.removeFront(),"return values of removeFront()s are not equal");
}
else {
assertEquals(reference.removeLast(), impl.removeBack(),"return values of removeBack()s are not equal");
}
assertEquals(reference.peekFirst(), impl.peekFront(),"return values of peekFront()s are not equal");
assertEquals(reference.peekLast(), impl.peekBack(),"return values of peekBacks()s are not equal");
}
assertEquals(reference.size(), impl.size(), "size()s are not equal");
assertEquals(reference.toString(), impl.toString(), "toStrings()s are not equal");
}
}
@Order(dequeTestLevel)
@DisplayName("Test for addAll(...)")
@ParameterizedTest(name = "Test addAll with {1} random numbers and seed = {0}")
@CsvSource({
"99, 300", "48, 500"
})
default void testAddAll(int seed, int size) {
Random r = new Random(seed);
ICollection<Object> coll = newDeque();
IDeque<Object> impl = newDeque();
for (int i = 0; i < size; i++) {
int num = r.nextInt();
coll.add(num);
}
impl.addAll(coll);
MatcherAssert.assertThat("IDeque has incorrect elements / order", impl, IsIterableContainingInOrder.contains(coll));
}
}