1 |
/* |
2 |
* Written by Doug Lea and Martin Buchholz with assistance from |
3 |
* members of JCP JSR-166 Expert Group and released to the public |
4 |
* domain, as explained at |
5 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
6 |
*/ |
7 |
|
8 |
import java.util.ArrayDeque; |
9 |
import java.util.Arrays; |
10 |
import java.util.Collection; |
11 |
import java.util.Collections; |
12 |
import java.util.Deque; |
13 |
import java.util.Iterator; |
14 |
import java.util.NoSuchElementException; |
15 |
import java.util.Queue; |
16 |
import java.util.Random; |
17 |
import java.util.concurrent.ThreadLocalRandom; |
18 |
|
19 |
import junit.framework.Test; |
20 |
import junit.framework.TestSuite; |
21 |
|
22 |
public class ArrayDequeTest extends JSR166TestCase { |
23 |
public static void main(String[] args) { |
24 |
main(suite(), args); |
25 |
} |
26 |
|
27 |
public static Test suite() { |
28 |
class Implementation implements CollectionImplementation { |
29 |
public Class<?> klazz() { return ArrayDeque.class; } |
30 |
public Collection emptyCollection() { return populatedDeque(0); } |
31 |
public Object makeElement(int i) { return i; } |
32 |
public boolean isConcurrent() { return false; } |
33 |
public boolean permitsNulls() { return false; } |
34 |
} |
35 |
return newTestSuite(ArrayDequeTest.class, |
36 |
CollectionTest.testSuite(new Implementation())); |
37 |
} |
38 |
|
39 |
/** |
40 |
* Returns a new deque of given size containing consecutive |
41 |
* Integers 0 ... n - 1. |
42 |
*/ |
43 |
private static ArrayDeque<Integer> populatedDeque(int n) { |
44 |
// Randomize various aspects of memory layout, including |
45 |
// filled-to-capacity and wraparound. |
46 |
final ArrayDeque<Integer> q; |
47 |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
48 |
switch (rnd.nextInt(6)) { |
49 |
case 0: q = new ArrayDeque<Integer>(); break; |
50 |
case 1: q = new ArrayDeque<Integer>(0); break; |
51 |
case 2: q = new ArrayDeque<Integer>(1); break; |
52 |
case 3: q = new ArrayDeque<Integer>(Math.max(0, n - 1)); break; |
53 |
case 4: q = new ArrayDeque<Integer>(n); break; |
54 |
case 5: q = new ArrayDeque<Integer>(n + 1); break; |
55 |
default: throw new AssertionError(); |
56 |
} |
57 |
switch (rnd.nextInt(3)) { |
58 |
case 0: |
59 |
q.addFirst(42); |
60 |
assertEquals((Integer) 42, q.removeLast()); |
61 |
break; |
62 |
case 1: |
63 |
q.addLast(42); |
64 |
assertEquals((Integer) 42, q.removeFirst()); |
65 |
break; |
66 |
case 2: /* do nothing */ break; |
67 |
default: throw new AssertionError(); |
68 |
} |
69 |
assertTrue(q.isEmpty()); |
70 |
if (rnd.nextBoolean()) |
71 |
for (int i = 0; i < n; i++) |
72 |
assertTrue(q.offerLast((Integer) i)); |
73 |
else |
74 |
for (int i = n; --i >= 0; ) |
75 |
q.addFirst((Integer) i); |
76 |
assertEquals(n, q.size()); |
77 |
if (n > 0) { |
78 |
assertFalse(q.isEmpty()); |
79 |
assertEquals((Integer) 0, q.peekFirst()); |
80 |
assertEquals((Integer) (n - 1), q.peekLast()); |
81 |
} |
82 |
return q; |
83 |
} |
84 |
|
85 |
/** |
86 |
* new deque is empty |
87 |
*/ |
88 |
public void testConstructor1() { |
89 |
assertEquals(0, new ArrayDeque().size()); |
90 |
} |
91 |
|
92 |
/** |
93 |
* Initializing from null Collection throws NPE |
94 |
*/ |
95 |
public void testConstructor3() { |
96 |
try { |
97 |
new ArrayDeque((Collection)null); |
98 |
shouldThrow(); |
99 |
} catch (NullPointerException success) {} |
100 |
} |
101 |
|
102 |
/** |
103 |
* Initializing from Collection of null elements throws NPE |
104 |
*/ |
105 |
public void testConstructor4() { |
106 |
try { |
107 |
new ArrayDeque(Arrays.asList(new Integer[SIZE])); |
108 |
shouldThrow(); |
109 |
} catch (NullPointerException success) {} |
110 |
} |
111 |
|
112 |
/** |
113 |
* Initializing from Collection with some null elements throws NPE |
114 |
*/ |
115 |
public void testConstructor5() { |
116 |
Integer[] ints = new Integer[SIZE]; |
117 |
for (int i = 0; i < SIZE - 1; ++i) |
118 |
ints[i] = new Integer(i); |
119 |
try { |
120 |
new ArrayDeque(Arrays.asList(ints)); |
121 |
shouldThrow(); |
122 |
} catch (NullPointerException success) {} |
123 |
} |
124 |
|
125 |
/** |
126 |
* Deque contains all elements of collection used to initialize |
127 |
*/ |
128 |
public void testConstructor6() { |
129 |
Integer[] ints = new Integer[SIZE]; |
130 |
for (int i = 0; i < SIZE; ++i) |
131 |
ints[i] = new Integer(i); |
132 |
ArrayDeque q = new ArrayDeque(Arrays.asList(ints)); |
133 |
for (int i = 0; i < SIZE; ++i) |
134 |
assertEquals(ints[i], q.pollFirst()); |
135 |
} |
136 |
|
137 |
/** |
138 |
* isEmpty is true before add, false after |
139 |
*/ |
140 |
public void testEmpty() { |
141 |
ArrayDeque q = new ArrayDeque(); |
142 |
assertTrue(q.isEmpty()); |
143 |
q.add(new Integer(1)); |
144 |
assertFalse(q.isEmpty()); |
145 |
q.add(new Integer(2)); |
146 |
q.removeFirst(); |
147 |
q.removeFirst(); |
148 |
assertTrue(q.isEmpty()); |
149 |
} |
150 |
|
151 |
/** |
152 |
* size changes when elements added and removed |
153 |
*/ |
154 |
public void testSize() { |
155 |
ArrayDeque q = populatedDeque(SIZE); |
156 |
for (int i = 0; i < SIZE; ++i) { |
157 |
assertEquals(SIZE - i, q.size()); |
158 |
q.removeFirst(); |
159 |
} |
160 |
for (int i = 0; i < SIZE; ++i) { |
161 |
assertEquals(i, q.size()); |
162 |
q.add(new Integer(i)); |
163 |
} |
164 |
} |
165 |
|
166 |
/** |
167 |
* push(null) throws NPE |
168 |
*/ |
169 |
public void testPushNull() { |
170 |
ArrayDeque q = new ArrayDeque(1); |
171 |
try { |
172 |
q.push(null); |
173 |
shouldThrow(); |
174 |
} catch (NullPointerException success) {} |
175 |
} |
176 |
|
177 |
/** |
178 |
* peekFirst() returns element inserted with push |
179 |
*/ |
180 |
public void testPush() { |
181 |
ArrayDeque q = populatedDeque(3); |
182 |
q.pollLast(); |
183 |
q.push(four); |
184 |
assertSame(four, q.peekFirst()); |
185 |
} |
186 |
|
187 |
/** |
188 |
* pop() removes next element, or throws NSEE if empty |
189 |
*/ |
190 |
public void testPop() { |
191 |
ArrayDeque q = populatedDeque(SIZE); |
192 |
for (int i = 0; i < SIZE; ++i) { |
193 |
assertEquals(i, q.pop()); |
194 |
} |
195 |
try { |
196 |
q.pop(); |
197 |
shouldThrow(); |
198 |
} catch (NoSuchElementException success) {} |
199 |
} |
200 |
|
201 |
/** |
202 |
* offer(null) throws NPE |
203 |
*/ |
204 |
public void testOfferNull() { |
205 |
ArrayDeque q = new ArrayDeque(); |
206 |
try { |
207 |
q.offer(null); |
208 |
shouldThrow(); |
209 |
} catch (NullPointerException success) {} |
210 |
} |
211 |
|
212 |
/** |
213 |
* offerFirst(null) throws NPE |
214 |
*/ |
215 |
public void testOfferFirstNull() { |
216 |
ArrayDeque q = new ArrayDeque(); |
217 |
try { |
218 |
q.offerFirst(null); |
219 |
shouldThrow(); |
220 |
} catch (NullPointerException success) {} |
221 |
} |
222 |
|
223 |
/** |
224 |
* offerLast(null) throws NPE |
225 |
*/ |
226 |
public void testOfferLastNull() { |
227 |
ArrayDeque q = new ArrayDeque(); |
228 |
try { |
229 |
q.offerLast(null); |
230 |
shouldThrow(); |
231 |
} catch (NullPointerException success) {} |
232 |
} |
233 |
|
234 |
/** |
235 |
* offer(x) succeeds |
236 |
*/ |
237 |
public void testOffer() { |
238 |
ArrayDeque q = new ArrayDeque(); |
239 |
assertTrue(q.offer(zero)); |
240 |
assertTrue(q.offer(one)); |
241 |
assertSame(zero, q.peekFirst()); |
242 |
assertSame(one, q.peekLast()); |
243 |
} |
244 |
|
245 |
/** |
246 |
* offerFirst(x) succeeds |
247 |
*/ |
248 |
public void testOfferFirst() { |
249 |
ArrayDeque q = new ArrayDeque(); |
250 |
assertTrue(q.offerFirst(zero)); |
251 |
assertTrue(q.offerFirst(one)); |
252 |
assertSame(one, q.peekFirst()); |
253 |
assertSame(zero, q.peekLast()); |
254 |
} |
255 |
|
256 |
/** |
257 |
* offerLast(x) succeeds |
258 |
*/ |
259 |
public void testOfferLast() { |
260 |
ArrayDeque q = new ArrayDeque(); |
261 |
assertTrue(q.offerLast(zero)); |
262 |
assertTrue(q.offerLast(one)); |
263 |
assertSame(zero, q.peekFirst()); |
264 |
assertSame(one, q.peekLast()); |
265 |
} |
266 |
|
267 |
/** |
268 |
* add(null) throws NPE |
269 |
*/ |
270 |
public void testAddNull() { |
271 |
ArrayDeque q = new ArrayDeque(); |
272 |
try { |
273 |
q.add(null); |
274 |
shouldThrow(); |
275 |
} catch (NullPointerException success) {} |
276 |
} |
277 |
|
278 |
/** |
279 |
* addFirst(null) throws NPE |
280 |
*/ |
281 |
public void testAddFirstNull() { |
282 |
ArrayDeque q = new ArrayDeque(); |
283 |
try { |
284 |
q.addFirst(null); |
285 |
shouldThrow(); |
286 |
} catch (NullPointerException success) {} |
287 |
} |
288 |
|
289 |
/** |
290 |
* addLast(null) throws NPE |
291 |
*/ |
292 |
public void testAddLastNull() { |
293 |
ArrayDeque q = new ArrayDeque(); |
294 |
try { |
295 |
q.addLast(null); |
296 |
shouldThrow(); |
297 |
} catch (NullPointerException success) {} |
298 |
} |
299 |
|
300 |
/** |
301 |
* add(x) succeeds |
302 |
*/ |
303 |
public void testAdd() { |
304 |
ArrayDeque q = new ArrayDeque(); |
305 |
assertTrue(q.add(zero)); |
306 |
assertTrue(q.add(one)); |
307 |
assertSame(zero, q.peekFirst()); |
308 |
assertSame(one, q.peekLast()); |
309 |
} |
310 |
|
311 |
/** |
312 |
* addFirst(x) succeeds |
313 |
*/ |
314 |
public void testAddFirst() { |
315 |
ArrayDeque q = new ArrayDeque(); |
316 |
q.addFirst(zero); |
317 |
q.addFirst(one); |
318 |
assertSame(one, q.peekFirst()); |
319 |
assertSame(zero, q.peekLast()); |
320 |
} |
321 |
|
322 |
/** |
323 |
* addLast(x) succeeds |
324 |
*/ |
325 |
public void testAddLast() { |
326 |
ArrayDeque q = new ArrayDeque(); |
327 |
q.addLast(zero); |
328 |
q.addLast(one); |
329 |
assertSame(zero, q.peekFirst()); |
330 |
assertSame(one, q.peekLast()); |
331 |
} |
332 |
|
333 |
/** |
334 |
* addAll(null) throws NPE |
335 |
*/ |
336 |
public void testAddAll1() { |
337 |
ArrayDeque q = new ArrayDeque(); |
338 |
try { |
339 |
q.addAll(null); |
340 |
shouldThrow(); |
341 |
} catch (NullPointerException success) {} |
342 |
} |
343 |
|
344 |
/** |
345 |
* addAll of a collection with null elements throws NPE |
346 |
*/ |
347 |
public void testAddAll2() { |
348 |
ArrayDeque q = new ArrayDeque(); |
349 |
try { |
350 |
q.addAll(Arrays.asList(new Integer[SIZE])); |
351 |
shouldThrow(); |
352 |
} catch (NullPointerException success) {} |
353 |
} |
354 |
|
355 |
/** |
356 |
* addAll of a collection with any null elements throws NPE after |
357 |
* possibly adding some elements |
358 |
*/ |
359 |
public void testAddAll3() { |
360 |
ArrayDeque q = new ArrayDeque(); |
361 |
Integer[] ints = new Integer[SIZE]; |
362 |
for (int i = 0; i < SIZE - 1; ++i) |
363 |
ints[i] = new Integer(i); |
364 |
try { |
365 |
q.addAll(Arrays.asList(ints)); |
366 |
shouldThrow(); |
367 |
} catch (NullPointerException success) {} |
368 |
} |
369 |
|
370 |
/** |
371 |
* Deque contains all elements, in traversal order, of successful addAll |
372 |
*/ |
373 |
public void testAddAll5() { |
374 |
Integer[] empty = new Integer[0]; |
375 |
Integer[] ints = new Integer[SIZE]; |
376 |
for (int i = 0; i < SIZE; ++i) |
377 |
ints[i] = new Integer(i); |
378 |
ArrayDeque q = new ArrayDeque(); |
379 |
assertFalse(q.addAll(Arrays.asList(empty))); |
380 |
assertTrue(q.addAll(Arrays.asList(ints))); |
381 |
for (int i = 0; i < SIZE; ++i) |
382 |
assertEquals(ints[i], q.pollFirst()); |
383 |
} |
384 |
|
385 |
/** |
386 |
* pollFirst() succeeds unless empty |
387 |
*/ |
388 |
public void testPollFirst() { |
389 |
ArrayDeque q = populatedDeque(SIZE); |
390 |
for (int i = 0; i < SIZE; ++i) { |
391 |
assertEquals(i, q.pollFirst()); |
392 |
} |
393 |
assertNull(q.pollFirst()); |
394 |
} |
395 |
|
396 |
/** |
397 |
* pollLast() succeeds unless empty |
398 |
*/ |
399 |
public void testPollLast() { |
400 |
ArrayDeque q = populatedDeque(SIZE); |
401 |
for (int i = SIZE - 1; i >= 0; --i) { |
402 |
assertEquals(i, q.pollLast()); |
403 |
} |
404 |
assertNull(q.pollLast()); |
405 |
} |
406 |
|
407 |
/** |
408 |
* poll() succeeds unless empty |
409 |
*/ |
410 |
public void testPoll() { |
411 |
ArrayDeque q = populatedDeque(SIZE); |
412 |
for (int i = 0; i < SIZE; ++i) { |
413 |
assertEquals(i, q.poll()); |
414 |
} |
415 |
assertNull(q.poll()); |
416 |
} |
417 |
|
418 |
/** |
419 |
* remove() removes next element, or throws NSEE if empty |
420 |
*/ |
421 |
public void testRemove() { |
422 |
ArrayDeque q = populatedDeque(SIZE); |
423 |
for (int i = 0; i < SIZE; ++i) { |
424 |
assertEquals(i, q.remove()); |
425 |
} |
426 |
try { |
427 |
q.remove(); |
428 |
shouldThrow(); |
429 |
} catch (NoSuchElementException success) {} |
430 |
} |
431 |
|
432 |
/** |
433 |
* remove(x) removes x and returns true if present |
434 |
*/ |
435 |
public void testRemoveElement() { |
436 |
ArrayDeque q = populatedDeque(SIZE); |
437 |
for (int i = 1; i < SIZE; i += 2) { |
438 |
assertTrue(q.contains(i)); |
439 |
assertTrue(q.remove(i)); |
440 |
assertFalse(q.contains(i)); |
441 |
assertTrue(q.contains(i - 1)); |
442 |
} |
443 |
for (int i = 0; i < SIZE; i += 2) { |
444 |
assertTrue(q.contains(i)); |
445 |
assertTrue(q.remove(i)); |
446 |
assertFalse(q.contains(i)); |
447 |
assertFalse(q.remove(i + 1)); |
448 |
assertFalse(q.contains(i + 1)); |
449 |
} |
450 |
assertTrue(q.isEmpty()); |
451 |
} |
452 |
|
453 |
/** |
454 |
* peekFirst() returns next element, or null if empty |
455 |
*/ |
456 |
public void testPeekFirst() { |
457 |
ArrayDeque q = populatedDeque(SIZE); |
458 |
for (int i = 0; i < SIZE; ++i) { |
459 |
assertEquals(i, q.peekFirst()); |
460 |
assertEquals(i, q.pollFirst()); |
461 |
assertTrue(q.peekFirst() == null || |
462 |
!q.peekFirst().equals(i)); |
463 |
} |
464 |
assertNull(q.peekFirst()); |
465 |
} |
466 |
|
467 |
/** |
468 |
* peek() returns next element, or null if empty |
469 |
*/ |
470 |
public void testPeek() { |
471 |
ArrayDeque q = populatedDeque(SIZE); |
472 |
for (int i = 0; i < SIZE; ++i) { |
473 |
assertEquals(i, q.peek()); |
474 |
assertEquals(i, q.poll()); |
475 |
assertTrue(q.peek() == null || |
476 |
!q.peek().equals(i)); |
477 |
} |
478 |
assertNull(q.peek()); |
479 |
} |
480 |
|
481 |
/** |
482 |
* peekLast() returns next element, or null if empty |
483 |
*/ |
484 |
public void testPeekLast() { |
485 |
ArrayDeque q = populatedDeque(SIZE); |
486 |
for (int i = SIZE - 1; i >= 0; --i) { |
487 |
assertEquals(i, q.peekLast()); |
488 |
assertEquals(i, q.pollLast()); |
489 |
assertTrue(q.peekLast() == null || |
490 |
!q.peekLast().equals(i)); |
491 |
} |
492 |
assertNull(q.peekLast()); |
493 |
} |
494 |
|
495 |
/** |
496 |
* element() returns first element, or throws NSEE if empty |
497 |
*/ |
498 |
public void testElement() { |
499 |
ArrayDeque q = populatedDeque(SIZE); |
500 |
for (int i = 0; i < SIZE; ++i) { |
501 |
assertEquals(i, q.element()); |
502 |
assertEquals(i, q.poll()); |
503 |
} |
504 |
try { |
505 |
q.element(); |
506 |
shouldThrow(); |
507 |
} catch (NoSuchElementException success) {} |
508 |
} |
509 |
|
510 |
/** |
511 |
* getFirst() returns first element, or throws NSEE if empty |
512 |
*/ |
513 |
public void testFirstElement() { |
514 |
ArrayDeque q = populatedDeque(SIZE); |
515 |
for (int i = 0; i < SIZE; ++i) { |
516 |
assertEquals(i, q.getFirst()); |
517 |
assertEquals(i, q.pollFirst()); |
518 |
} |
519 |
try { |
520 |
q.getFirst(); |
521 |
shouldThrow(); |
522 |
} catch (NoSuchElementException success) {} |
523 |
} |
524 |
|
525 |
/** |
526 |
* getLast() returns last element, or throws NSEE if empty |
527 |
*/ |
528 |
public void testLastElement() { |
529 |
ArrayDeque q = populatedDeque(SIZE); |
530 |
for (int i = SIZE - 1; i >= 0; --i) { |
531 |
assertEquals(i, q.getLast()); |
532 |
assertEquals(i, q.pollLast()); |
533 |
} |
534 |
try { |
535 |
q.getLast(); |
536 |
shouldThrow(); |
537 |
} catch (NoSuchElementException success) {} |
538 |
assertNull(q.peekLast()); |
539 |
} |
540 |
|
541 |
/** |
542 |
* removeFirst() removes first element, or throws NSEE if empty |
543 |
*/ |
544 |
public void testRemoveFirst() { |
545 |
ArrayDeque q = populatedDeque(SIZE); |
546 |
for (int i = 0; i < SIZE; ++i) { |
547 |
assertEquals(i, q.removeFirst()); |
548 |
} |
549 |
try { |
550 |
q.removeFirst(); |
551 |
shouldThrow(); |
552 |
} catch (NoSuchElementException success) {} |
553 |
assertNull(q.peekFirst()); |
554 |
} |
555 |
|
556 |
/** |
557 |
* removeLast() removes last element, or throws NSEE if empty |
558 |
*/ |
559 |
public void testRemoveLast() { |
560 |
ArrayDeque q = populatedDeque(SIZE); |
561 |
for (int i = SIZE - 1; i >= 0; --i) { |
562 |
assertEquals(i, q.removeLast()); |
563 |
} |
564 |
try { |
565 |
q.removeLast(); |
566 |
shouldThrow(); |
567 |
} catch (NoSuchElementException success) {} |
568 |
assertNull(q.peekLast()); |
569 |
} |
570 |
|
571 |
/** |
572 |
* removeFirstOccurrence(x) removes x and returns true if present |
573 |
*/ |
574 |
public void testRemoveFirstOccurrence() { |
575 |
Deque<Integer> q = populatedDeque(SIZE); |
576 |
assertFalse(q.removeFirstOccurrence(null)); |
577 |
for (int i = 1; i < SIZE; i += 2) { |
578 |
assertTrue(q.removeFirstOccurrence(i)); |
579 |
assertFalse(q.contains(i)); |
580 |
} |
581 |
for (int i = 0; i < SIZE; i += 2) { |
582 |
assertTrue(q.removeFirstOccurrence(i)); |
583 |
assertFalse(q.removeFirstOccurrence(i + 1)); |
584 |
assertFalse(q.contains(i)); |
585 |
assertFalse(q.contains(i + 1)); |
586 |
} |
587 |
assertTrue(q.isEmpty()); |
588 |
assertFalse(q.removeFirstOccurrence(null)); |
589 |
assertFalse(q.removeFirstOccurrence(42)); |
590 |
q = new ArrayDeque(); |
591 |
assertFalse(q.removeFirstOccurrence(null)); |
592 |
assertFalse(q.removeFirstOccurrence(42)); |
593 |
} |
594 |
|
595 |
/** |
596 |
* removeLastOccurrence(x) removes x and returns true if present |
597 |
*/ |
598 |
public void testRemoveLastOccurrence() { |
599 |
Deque<Integer> q = populatedDeque(SIZE); |
600 |
assertFalse(q.removeLastOccurrence(null)); |
601 |
for (int i = 1; i < SIZE; i += 2) { |
602 |
assertTrue(q.removeLastOccurrence(i)); |
603 |
assertFalse(q.contains(i)); |
604 |
} |
605 |
for (int i = 0; i < SIZE; i += 2) { |
606 |
assertTrue(q.removeLastOccurrence(i)); |
607 |
assertFalse(q.removeLastOccurrence(i + 1)); |
608 |
assertFalse(q.contains(i)); |
609 |
assertFalse(q.contains(i + 1)); |
610 |
} |
611 |
assertTrue(q.isEmpty()); |
612 |
assertFalse(q.removeLastOccurrence(null)); |
613 |
assertFalse(q.removeLastOccurrence(42)); |
614 |
q = new ArrayDeque(); |
615 |
assertFalse(q.removeLastOccurrence(null)); |
616 |
assertFalse(q.removeLastOccurrence(42)); |
617 |
} |
618 |
|
619 |
/** |
620 |
* contains(x) reports true when elements added but not yet removed |
621 |
*/ |
622 |
public void testContains() { |
623 |
ArrayDeque q = populatedDeque(SIZE); |
624 |
for (int i = 0; i < SIZE; ++i) { |
625 |
assertTrue(q.contains(new Integer(i))); |
626 |
assertEquals(i, q.pollFirst()); |
627 |
assertFalse(q.contains(new Integer(i))); |
628 |
} |
629 |
} |
630 |
|
631 |
/** |
632 |
* clear removes all elements |
633 |
*/ |
634 |
public void testClear() { |
635 |
ArrayDeque q = populatedDeque(SIZE); |
636 |
q.clear(); |
637 |
assertTrue(q.isEmpty()); |
638 |
assertEquals(0, q.size()); |
639 |
assertTrue(q.add(new Integer(1))); |
640 |
assertFalse(q.isEmpty()); |
641 |
q.clear(); |
642 |
assertTrue(q.isEmpty()); |
643 |
} |
644 |
|
645 |
/** |
646 |
* containsAll(c) is true when c contains a subset of elements |
647 |
*/ |
648 |
public void testContainsAll() { |
649 |
ArrayDeque q = populatedDeque(SIZE); |
650 |
ArrayDeque p = new ArrayDeque(); |
651 |
for (int i = 0; i < SIZE; ++i) { |
652 |
assertTrue(q.containsAll(p)); |
653 |
assertFalse(p.containsAll(q)); |
654 |
assertTrue(p.add(new Integer(i))); |
655 |
} |
656 |
assertTrue(p.containsAll(q)); |
657 |
} |
658 |
|
659 |
/** |
660 |
* retainAll(c) retains only those elements of c and reports true if changed |
661 |
*/ |
662 |
public void testRetainAll() { |
663 |
ArrayDeque q = populatedDeque(SIZE); |
664 |
ArrayDeque p = populatedDeque(SIZE); |
665 |
for (int i = 0; i < SIZE; ++i) { |
666 |
boolean changed = q.retainAll(p); |
667 |
assertEquals(changed, (i > 0)); |
668 |
assertTrue(q.containsAll(p)); |
669 |
assertEquals(SIZE - i, q.size()); |
670 |
p.removeFirst(); |
671 |
} |
672 |
} |
673 |
|
674 |
/** |
675 |
* removeAll(c) removes only those elements of c and reports true if changed |
676 |
*/ |
677 |
public void testRemoveAll() { |
678 |
for (int i = 1; i < SIZE; ++i) { |
679 |
ArrayDeque q = populatedDeque(SIZE); |
680 |
ArrayDeque p = populatedDeque(i); |
681 |
assertTrue(q.removeAll(p)); |
682 |
assertEquals(SIZE - i, q.size()); |
683 |
for (int j = 0; j < i; ++j) { |
684 |
assertFalse(q.contains(p.removeFirst())); |
685 |
} |
686 |
} |
687 |
} |
688 |
|
689 |
void checkToArray(ArrayDeque<Integer> q) { |
690 |
int size = q.size(); |
691 |
Object[] a1 = q.toArray(); |
692 |
assertEquals(size, a1.length); |
693 |
Integer[] a2 = q.toArray(new Integer[0]); |
694 |
assertEquals(size, a2.length); |
695 |
Integer[] a3 = q.toArray(new Integer[Math.max(0, size - 1)]); |
696 |
assertEquals(size, a3.length); |
697 |
Integer[] a4 = new Integer[size]; |
698 |
assertSame(a4, q.toArray(a4)); |
699 |
Integer[] a5 = new Integer[size + 1]; |
700 |
Arrays.fill(a5, 42); |
701 |
assertSame(a5, q.toArray(a5)); |
702 |
Integer[] a6 = new Integer[size + 2]; |
703 |
Arrays.fill(a6, 42); |
704 |
assertSame(a6, q.toArray(a6)); |
705 |
Object[][] as = { a1, a2, a3, a4, a5, a6 }; |
706 |
for (Object[] a : as) { |
707 |
if (a.length > size) assertNull(a[size]); |
708 |
if (a.length > size + 1) assertEquals(42, a[size + 1]); |
709 |
} |
710 |
Iterator it = q.iterator(); |
711 |
Integer s = q.peekFirst(); |
712 |
for (int i = 0; i < size; i++) { |
713 |
Integer x = (Integer) it.next(); |
714 |
assertEquals(s + i, (int) x); |
715 |
for (Object[] a : as) |
716 |
assertSame(a1[i], x); |
717 |
} |
718 |
} |
719 |
|
720 |
/** |
721 |
* toArray() and toArray(a) contain all elements in FIFO order |
722 |
*/ |
723 |
public void testToArray() { |
724 |
final int size = ThreadLocalRandom.current().nextInt(10); |
725 |
ArrayDeque<Integer> q = new ArrayDeque<>(size); |
726 |
for (int i = 0; i < size; i++) { |
727 |
checkToArray(q); |
728 |
q.addLast(i); |
729 |
} |
730 |
// Provoke wraparound |
731 |
int added = size * 2; |
732 |
for (int i = 0; i < added; i++) { |
733 |
checkToArray(q); |
734 |
assertEquals((Integer) i, q.poll()); |
735 |
q.addLast(size + i); |
736 |
} |
737 |
for (int i = 0; i < size; i++) { |
738 |
checkToArray(q); |
739 |
assertEquals((Integer) (added + i), q.poll()); |
740 |
} |
741 |
} |
742 |
|
743 |
/** |
744 |
* toArray(null) throws NullPointerException |
745 |
*/ |
746 |
public void testToArray_NullArg() { |
747 |
ArrayDeque l = new ArrayDeque(); |
748 |
l.add(new Object()); |
749 |
try { |
750 |
l.toArray(null); |
751 |
shouldThrow(); |
752 |
} catch (NullPointerException success) {} |
753 |
} |
754 |
|
755 |
/** |
756 |
* toArray(incompatible array type) throws ArrayStoreException |
757 |
*/ |
758 |
public void testToArray_incompatibleArrayType() { |
759 |
ArrayDeque l = new ArrayDeque(); |
760 |
l.add(new Integer(5)); |
761 |
try { |
762 |
l.toArray(new String[10]); |
763 |
shouldThrow(); |
764 |
} catch (ArrayStoreException success) {} |
765 |
try { |
766 |
l.toArray(new String[0]); |
767 |
shouldThrow(); |
768 |
} catch (ArrayStoreException success) {} |
769 |
} |
770 |
|
771 |
/** |
772 |
* Iterator iterates through all elements |
773 |
*/ |
774 |
public void testIterator() { |
775 |
ArrayDeque q = populatedDeque(SIZE); |
776 |
Iterator it = q.iterator(); |
777 |
int i; |
778 |
for (i = 0; it.hasNext(); i++) |
779 |
assertTrue(q.contains(it.next())); |
780 |
assertEquals(i, SIZE); |
781 |
assertIteratorExhausted(it); |
782 |
} |
783 |
|
784 |
/** |
785 |
* iterator of empty collection has no elements |
786 |
*/ |
787 |
public void testEmptyIterator() { |
788 |
Deque c = new ArrayDeque(); |
789 |
assertIteratorExhausted(c.iterator()); |
790 |
assertIteratorExhausted(c.descendingIterator()); |
791 |
} |
792 |
|
793 |
/** |
794 |
* Iterator ordering is FIFO |
795 |
*/ |
796 |
public void testIteratorOrdering() { |
797 |
final ArrayDeque q = new ArrayDeque(); |
798 |
q.add(one); |
799 |
q.add(two); |
800 |
q.add(three); |
801 |
int k = 0; |
802 |
for (Iterator it = q.iterator(); it.hasNext();) { |
803 |
assertEquals(++k, it.next()); |
804 |
} |
805 |
|
806 |
assertEquals(3, k); |
807 |
} |
808 |
|
809 |
/** |
810 |
* iterator.remove() removes current element |
811 |
*/ |
812 |
public void testIteratorRemove() { |
813 |
final ArrayDeque q = new ArrayDeque(); |
814 |
final Random rng = new Random(); |
815 |
for (int iters = 0; iters < 100; ++iters) { |
816 |
int max = rng.nextInt(5) + 2; |
817 |
int split = rng.nextInt(max - 1) + 1; |
818 |
for (int j = 1; j <= max; ++j) |
819 |
q.add(new Integer(j)); |
820 |
Iterator it = q.iterator(); |
821 |
for (int j = 1; j <= split; ++j) |
822 |
assertEquals(it.next(), new Integer(j)); |
823 |
it.remove(); |
824 |
assertEquals(it.next(), new Integer(split + 1)); |
825 |
for (int j = 1; j <= split; ++j) |
826 |
q.remove(new Integer(j)); |
827 |
it = q.iterator(); |
828 |
for (int j = split + 1; j <= max; ++j) { |
829 |
assertEquals(it.next(), new Integer(j)); |
830 |
it.remove(); |
831 |
} |
832 |
assertFalse(it.hasNext()); |
833 |
assertTrue(q.isEmpty()); |
834 |
} |
835 |
} |
836 |
|
837 |
/** |
838 |
* Descending iterator iterates through all elements |
839 |
*/ |
840 |
public void testDescendingIterator() { |
841 |
ArrayDeque q = populatedDeque(SIZE); |
842 |
int i = 0; |
843 |
Iterator it = q.descendingIterator(); |
844 |
while (it.hasNext()) { |
845 |
assertTrue(q.contains(it.next())); |
846 |
++i; |
847 |
} |
848 |
assertEquals(i, SIZE); |
849 |
assertFalse(it.hasNext()); |
850 |
try { |
851 |
it.next(); |
852 |
shouldThrow(); |
853 |
} catch (NoSuchElementException success) {} |
854 |
} |
855 |
|
856 |
/** |
857 |
* Descending iterator ordering is reverse FIFO |
858 |
*/ |
859 |
public void testDescendingIteratorOrdering() { |
860 |
final ArrayDeque q = new ArrayDeque(); |
861 |
for (int iters = 0; iters < 100; ++iters) { |
862 |
q.add(new Integer(3)); |
863 |
q.add(new Integer(2)); |
864 |
q.add(new Integer(1)); |
865 |
int k = 0; |
866 |
for (Iterator it = q.descendingIterator(); it.hasNext();) { |
867 |
assertEquals(++k, it.next()); |
868 |
} |
869 |
|
870 |
assertEquals(3, k); |
871 |
q.remove(); |
872 |
q.remove(); |
873 |
q.remove(); |
874 |
} |
875 |
} |
876 |
|
877 |
/** |
878 |
* descendingIterator.remove() removes current element |
879 |
*/ |
880 |
public void testDescendingIteratorRemove() { |
881 |
final ArrayDeque q = new ArrayDeque(); |
882 |
final Random rng = new Random(); |
883 |
for (int iters = 0; iters < 100; ++iters) { |
884 |
int max = rng.nextInt(5) + 2; |
885 |
int split = rng.nextInt(max - 1) + 1; |
886 |
for (int j = max; j >= 1; --j) |
887 |
q.add(new Integer(j)); |
888 |
Iterator it = q.descendingIterator(); |
889 |
for (int j = 1; j <= split; ++j) |
890 |
assertEquals(it.next(), new Integer(j)); |
891 |
it.remove(); |
892 |
assertEquals(it.next(), new Integer(split + 1)); |
893 |
for (int j = 1; j <= split; ++j) |
894 |
q.remove(new Integer(j)); |
895 |
it = q.descendingIterator(); |
896 |
for (int j = split + 1; j <= max; ++j) { |
897 |
assertEquals(it.next(), new Integer(j)); |
898 |
it.remove(); |
899 |
} |
900 |
assertFalse(it.hasNext()); |
901 |
assertTrue(q.isEmpty()); |
902 |
} |
903 |
} |
904 |
|
905 |
/** |
906 |
* toString() contains toStrings of elements |
907 |
*/ |
908 |
public void testToString() { |
909 |
ArrayDeque q = populatedDeque(SIZE); |
910 |
String s = q.toString(); |
911 |
for (int i = 0; i < SIZE; ++i) { |
912 |
assertTrue(s.contains(String.valueOf(i))); |
913 |
} |
914 |
} |
915 |
|
916 |
/** |
917 |
* A deserialized serialized deque has same elements in same order |
918 |
*/ |
919 |
public void testSerialization() throws Exception { |
920 |
Queue x = populatedDeque(SIZE); |
921 |
Queue y = serialClone(x); |
922 |
|
923 |
assertNotSame(y, x); |
924 |
assertEquals(x.size(), y.size()); |
925 |
assertEquals(x.toString(), y.toString()); |
926 |
assertEquals(Arrays.toString(x.toArray()), Arrays.toString(y.toArray())); |
927 |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
928 |
while (!x.isEmpty()) { |
929 |
assertFalse(y.isEmpty()); |
930 |
assertEquals(x.remove(), y.remove()); |
931 |
} |
932 |
assertTrue(y.isEmpty()); |
933 |
} |
934 |
|
935 |
/** |
936 |
* A cloned deque has same elements in same order |
937 |
*/ |
938 |
public void testClone() throws Exception { |
939 |
ArrayDeque<Integer> x = populatedDeque(SIZE); |
940 |
ArrayDeque<Integer> y = x.clone(); |
941 |
|
942 |
assertNotSame(y, x); |
943 |
assertEquals(x.size(), y.size()); |
944 |
assertEquals(x.toString(), y.toString()); |
945 |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
946 |
while (!x.isEmpty()) { |
947 |
assertFalse(y.isEmpty()); |
948 |
assertEquals(x.remove(), y.remove()); |
949 |
} |
950 |
assertTrue(y.isEmpty()); |
951 |
} |
952 |
|
953 |
/** |
954 |
* remove(null), contains(null) always return false |
955 |
*/ |
956 |
public void testNeverContainsNull() { |
957 |
Deque<?>[] qs = { |
958 |
new ArrayDeque<Object>(), |
959 |
populatedDeque(2), |
960 |
}; |
961 |
|
962 |
for (Deque<?> q : qs) { |
963 |
assertFalse(q.contains(null)); |
964 |
assertFalse(q.remove(null)); |
965 |
assertFalse(q.removeFirstOccurrence(null)); |
966 |
assertFalse(q.removeLastOccurrence(null)); |
967 |
} |
968 |
} |
969 |
|
970 |
} |