38 |
|
* Create a deque of given size containing consecutive |
39 |
|
* Integers 0 ... n. |
40 |
|
*/ |
41 |
< |
private LinkedBlockingDeque populatedDeque(int n) { |
42 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(n); |
41 |
> |
private LinkedBlockingDeque<Integer> populatedDeque(int n) { |
42 |
> |
LinkedBlockingDeque<Integer> q = |
43 |
> |
new LinkedBlockingDeque<Integer>(n); |
44 |
|
assertTrue(q.isEmpty()); |
45 |
|
for (int i = 0; i < n; i++) |
46 |
|
assertTrue(q.offer(new Integer(i))); |
1208 |
|
public void testRemoveElement() { |
1209 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1210 |
|
for (int i = 1; i < SIZE; i+=2) { |
1211 |
< |
assertTrue(q.remove(new Integer(i))); |
1211 |
> |
assertTrue(q.contains(i)); |
1212 |
> |
assertTrue(q.remove(i)); |
1213 |
> |
assertFalse(q.contains(i)); |
1214 |
> |
assertTrue(q.contains(i-1)); |
1215 |
|
} |
1216 |
|
for (int i = 0; i < SIZE; i+=2) { |
1217 |
< |
assertTrue(q.remove(new Integer(i))); |
1218 |
< |
assertFalse(q.remove(new Integer(i+1))); |
1217 |
> |
assertTrue(q.contains(i)); |
1218 |
> |
assertTrue(q.remove(i)); |
1219 |
> |
assertFalse(q.contains(i)); |
1220 |
> |
assertFalse(q.remove(i+1)); |
1221 |
> |
assertFalse(q.contains(i+1)); |
1222 |
|
} |
1223 |
|
assertTrue(q.isEmpty()); |
1224 |
|
} |
1314 |
|
* toArray(a) contains all elements in FIFO order |
1315 |
|
*/ |
1316 |
|
public void testToArray2() { |
1317 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1317 |
> |
LinkedBlockingDeque<Integer> q = populatedDeque(SIZE); |
1318 |
|
Integer[] ints = new Integer[SIZE]; |
1319 |
< |
assertSame(ints, q.toArray(ints)); |
1319 |
> |
Integer[] array = q.toArray(ints); |
1320 |
> |
assertSame(ints, array); |
1321 |
|
for (int i = 0; i < ints.length; i++) |
1322 |
|
assertSame(ints[i], q.remove()); |
1323 |
|
} |