4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
– |
import junit.framework.*; |
8 |
– |
import java.util.Arrays; |
7 |
|
import java.util.ArrayDeque; |
8 |
+ |
import java.util.Arrays; |
9 |
|
import java.util.Collection; |
10 |
|
import java.util.Deque; |
11 |
|
import java.util.Iterator; |
13 |
|
import java.util.Queue; |
14 |
|
import java.util.Random; |
15 |
|
|
16 |
+ |
import junit.framework.Test; |
17 |
+ |
import junit.framework.TestSuite; |
18 |
+ |
|
19 |
|
public class ArrayDequeTest extends JSR166TestCase { |
20 |
|
public static void main(String[] args) { |
21 |
|
junit.textui.TestRunner.run(suite()); |
393 |
|
*/ |
394 |
|
public void testRemoveElement() { |
395 |
|
ArrayDeque q = populatedDeque(SIZE); |
396 |
< |
for (int i = 1; i < SIZE; i+=2) { |
396 |
> |
for (int i = 1; i < SIZE; i += 2) { |
397 |
|
assertTrue(q.contains(i)); |
398 |
|
assertTrue(q.remove(i)); |
399 |
|
assertFalse(q.contains(i)); |
400 |
|
assertTrue(q.contains(i-1)); |
401 |
|
} |
402 |
< |
for (int i = 0; i < SIZE; i+=2) { |
402 |
> |
for (int i = 0; i < SIZE; i += 2) { |
403 |
|
assertTrue(q.contains(i)); |
404 |
|
assertTrue(q.remove(i)); |
405 |
|
assertFalse(q.contains(i)); |
532 |
|
*/ |
533 |
|
public void testRemoveFirstOccurrence() { |
534 |
|
ArrayDeque q = populatedDeque(SIZE); |
535 |
< |
for (int i = 1; i < SIZE; i+=2) { |
535 |
> |
for (int i = 1; i < SIZE; i += 2) { |
536 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
537 |
|
} |
538 |
< |
for (int i = 0; i < SIZE; i+=2) { |
538 |
> |
for (int i = 0; i < SIZE; i += 2) { |
539 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
540 |
|
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
541 |
|
} |
547 |
|
*/ |
548 |
|
public void testRemoveLastOccurrence() { |
549 |
|
ArrayDeque q = populatedDeque(SIZE); |
550 |
< |
for (int i = 1; i < SIZE; i+=2) { |
550 |
> |
for (int i = 1; i < SIZE; i += 2) { |
551 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
552 |
|
} |
553 |
< |
for (int i = 0; i < SIZE; i+=2) { |
553 |
> |
for (int i = 0; i < SIZE; i += 2) { |
554 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
555 |
|
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
556 |
|
} |