71 |
|
*/ |
72 |
|
public void testConstructor5() { |
73 |
|
Integer[] ints = new Integer[SIZE]; |
74 |
< |
for (int i = 0; i < SIZE-1; ++i) |
74 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
75 |
|
ints[i] = new Integer(i); |
76 |
|
try { |
77 |
|
new ArrayDeque(Arrays.asList(ints)); |
111 |
|
public void testSize() { |
112 |
|
ArrayDeque q = populatedDeque(SIZE); |
113 |
|
for (int i = 0; i < SIZE; ++i) { |
114 |
< |
assertEquals(SIZE-i, q.size()); |
114 |
> |
assertEquals(SIZE - i, q.size()); |
115 |
|
q.removeFirst(); |
116 |
|
} |
117 |
|
for (int i = 0; i < SIZE; ++i) { |
316 |
|
public void testAddAll3() { |
317 |
|
ArrayDeque q = new ArrayDeque(); |
318 |
|
Integer[] ints = new Integer[SIZE]; |
319 |
< |
for (int i = 0; i < SIZE-1; ++i) |
319 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
320 |
|
ints[i] = new Integer(i); |
321 |
|
try { |
322 |
|
q.addAll(Arrays.asList(ints)); |
355 |
|
*/ |
356 |
|
public void testPollLast() { |
357 |
|
ArrayDeque q = populatedDeque(SIZE); |
358 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
358 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
359 |
|
assertEquals(i, q.pollLast()); |
360 |
|
} |
361 |
|
assertNull(q.pollLast()); |
395 |
|
assertTrue(q.contains(i)); |
396 |
|
assertTrue(q.remove(i)); |
397 |
|
assertFalse(q.contains(i)); |
398 |
< |
assertTrue(q.contains(i-1)); |
398 |
> |
assertTrue(q.contains(i - 1)); |
399 |
|
} |
400 |
|
for (int i = 0; i < SIZE; i += 2) { |
401 |
|
assertTrue(q.contains(i)); |
402 |
|
assertTrue(q.remove(i)); |
403 |
|
assertFalse(q.contains(i)); |
404 |
< |
assertFalse(q.remove(i+1)); |
405 |
< |
assertFalse(q.contains(i+1)); |
404 |
> |
assertFalse(q.remove(i + 1)); |
405 |
> |
assertFalse(q.contains(i + 1)); |
406 |
|
} |
407 |
|
assertTrue(q.isEmpty()); |
408 |
|
} |
440 |
|
*/ |
441 |
|
public void testPeekLast() { |
442 |
|
ArrayDeque q = populatedDeque(SIZE); |
443 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
443 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
444 |
|
assertEquals(i, q.peekLast()); |
445 |
|
assertEquals(i, q.pollLast()); |
446 |
|
assertTrue(q.peekLast() == null || |
484 |
|
*/ |
485 |
|
public void testLastElement() { |
486 |
|
ArrayDeque q = populatedDeque(SIZE); |
487 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
487 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
488 |
|
assertEquals(i, q.getLast()); |
489 |
|
assertEquals(i, q.pollLast()); |
490 |
|
} |
530 |
|
*/ |
531 |
|
public void testRemoveFirstOccurrence() { |
532 |
|
ArrayDeque q = populatedDeque(SIZE); |
533 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
534 |
|
for (int i = 1; i < SIZE; i += 2) { |
535 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
536 |
|
} |
537 |
|
for (int i = 0; i < SIZE; i += 2) { |
538 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
539 |
< |
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
539 |
> |
assertFalse(q.removeFirstOccurrence(new Integer(i + 1))); |
540 |
|
} |
541 |
|
assertTrue(q.isEmpty()); |
542 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
543 |
+ |
assertFalse(q.removeFirstOccurrence(42)); |
544 |
+ |
q = new ArrayDeque(); |
545 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
546 |
+ |
assertFalse(q.removeFirstOccurrence(42)); |
547 |
|
} |
548 |
|
|
549 |
|
/** |
551 |
|
*/ |
552 |
|
public void testRemoveLastOccurrence() { |
553 |
|
ArrayDeque q = populatedDeque(SIZE); |
554 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
555 |
|
for (int i = 1; i < SIZE; i += 2) { |
556 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
557 |
|
} |
558 |
|
for (int i = 0; i < SIZE; i += 2) { |
559 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
560 |
< |
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
560 |
> |
assertFalse(q.removeLastOccurrence(new Integer(i + 1))); |
561 |
|
} |
562 |
|
assertTrue(q.isEmpty()); |
563 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
564 |
+ |
assertFalse(q.removeLastOccurrence(42)); |
565 |
+ |
q = new ArrayDeque(); |
566 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
567 |
+ |
assertFalse(q.removeLastOccurrence(42)); |
568 |
|
} |
569 |
|
|
570 |
|
/** |
617 |
|
boolean changed = q.retainAll(p); |
618 |
|
assertEquals(changed, (i > 0)); |
619 |
|
assertTrue(q.containsAll(p)); |
620 |
< |
assertEquals(SIZE-i, q.size()); |
620 |
> |
assertEquals(SIZE - i, q.size()); |
621 |
|
p.removeFirst(); |
622 |
|
} |
623 |
|
} |
630 |
|
ArrayDeque q = populatedDeque(SIZE); |
631 |
|
ArrayDeque p = populatedDeque(i); |
632 |
|
assertTrue(q.removeAll(p)); |
633 |
< |
assertEquals(SIZE-i, q.size()); |
633 |
> |
assertEquals(SIZE - i, q.size()); |
634 |
|
for (int j = 0; j < i; ++j) { |
635 |
|
assertFalse(q.contains(p.removeFirst())); |
636 |
|
} |
662 |
|
for (int i = 0; i < SIZE; i++) { |
663 |
|
checkToArray(q); |
664 |
|
assertEquals(i, q.poll()); |
665 |
< |
q.addLast(SIZE+i); |
665 |
> |
q.addLast(SIZE + i); |
666 |
|
} |
667 |
|
for (int i = 0; i < SIZE; i++) { |
668 |
|
checkToArray(q); |
669 |
< |
assertEquals(SIZE+i, q.poll()); |
669 |
> |
assertEquals(SIZE + i, q.poll()); |
670 |
|
} |
671 |
|
} |
672 |
|
|
673 |
|
void checkToArray2(ArrayDeque q) { |
674 |
|
int size = q.size(); |
675 |
< |
Integer[] a1 = size == 0 ? null : new Integer[size-1]; |
675 |
> |
Integer[] a1 = (size == 0) ? null : new Integer[size - 1]; |
676 |
|
Integer[] a2 = new Integer[size]; |
677 |
< |
Integer[] a3 = new Integer[size+2]; |
677 |
> |
Integer[] a3 = new Integer[size + 2]; |
678 |
|
if (size > 0) Arrays.fill(a1, 42); |
679 |
|
Arrays.fill(a2, 42); |
680 |
|
Arrays.fill(a3, 42); |
681 |
< |
Integer[] b1 = size == 0 ? null : (Integer[]) q.toArray(a1); |
681 |
> |
Integer[] b1 = (size == 0) ? null : (Integer[]) q.toArray(a1); |
682 |
|
Integer[] b2 = (Integer[]) q.toArray(a2); |
683 |
|
Integer[] b3 = (Integer[]) q.toArray(a3); |
684 |
|
assertSame(a2, b2); |
692 |
|
assertSame(b3[i], x); |
693 |
|
} |
694 |
|
assertNull(a3[size]); |
695 |
< |
assertEquals(42, (int) a3[size+1]); |
695 |
> |
assertEquals(42, (int) a3[size + 1]); |
696 |
|
if (size > 0) { |
697 |
|
assertNotSame(a1, b1); |
698 |
|
assertEquals(size, b1.length); |
715 |
|
for (int i = 0; i < SIZE; i++) { |
716 |
|
checkToArray2(q); |
717 |
|
assertEquals(i, q.poll()); |
718 |
< |
q.addLast(SIZE+i); |
718 |
> |
q.addLast(SIZE + i); |
719 |
|
} |
720 |
|
for (int i = 0; i < SIZE; i++) { |
721 |
|
checkToArray2(q); |
722 |
< |
assertEquals(SIZE+i, q.poll()); |
722 |
> |
assertEquals(SIZE + i, q.poll()); |
723 |
|
} |
724 |
|
} |
725 |
|
|
793 |
|
final Random rng = new Random(); |
794 |
|
for (int iters = 0; iters < 100; ++iters) { |
795 |
|
int max = rng.nextInt(5) + 2; |
796 |
< |
int split = rng.nextInt(max-1) + 1; |
796 |
> |
int split = rng.nextInt(max - 1) + 1; |
797 |
|
for (int j = 1; j <= max; ++j) |
798 |
|
q.add(new Integer(j)); |
799 |
|
Iterator it = q.iterator(); |
800 |
|
for (int j = 1; j <= split; ++j) |
801 |
|
assertEquals(it.next(), new Integer(j)); |
802 |
|
it.remove(); |
803 |
< |
assertEquals(it.next(), new Integer(split+1)); |
803 |
> |
assertEquals(it.next(), new Integer(split + 1)); |
804 |
|
for (int j = 1; j <= split; ++j) |
805 |
|
q.remove(new Integer(j)); |
806 |
|
it = q.iterator(); |
807 |
< |
for (int j = split+1; j <= max; ++j) { |
807 |
> |
for (int j = split + 1; j <= max; ++j) { |
808 |
|
assertEquals(it.next(), new Integer(j)); |
809 |
|
it.remove(); |
810 |
|
} |
861 |
|
final Random rng = new Random(); |
862 |
|
for (int iters = 0; iters < 100; ++iters) { |
863 |
|
int max = rng.nextInt(5) + 2; |
864 |
< |
int split = rng.nextInt(max-1) + 1; |
864 |
> |
int split = rng.nextInt(max - 1) + 1; |
865 |
|
for (int j = max; j >= 1; --j) |
866 |
|
q.add(new Integer(j)); |
867 |
|
Iterator it = q.descendingIterator(); |
868 |
|
for (int j = 1; j <= split; ++j) |
869 |
|
assertEquals(it.next(), new Integer(j)); |
870 |
|
it.remove(); |
871 |
< |
assertEquals(it.next(), new Integer(split+1)); |
871 |
> |
assertEquals(it.next(), new Integer(split + 1)); |
872 |
|
for (int j = 1; j <= split; ++j) |
873 |
|
q.remove(new Integer(j)); |
874 |
|
it = q.descendingIterator(); |
875 |
< |
for (int j = split+1; j <= max; ++j) { |
875 |
> |
for (int j = split + 1; j <= max; ++j) { |
876 |
|
assertEquals(it.next(), new Integer(j)); |
877 |
|
it.remove(); |
878 |
|
} |