407 |
|
* remainingCapacity decreases on add, increases on remove |
408 |
|
*/ |
409 |
|
public void testRemainingCapacity() { |
410 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
410 |
> |
BlockingQueue q = populatedDeque(SIZE); |
411 |
|
for (int i = 0; i < SIZE; ++i) { |
412 |
|
assertEquals(i, q.remainingCapacity()); |
413 |
< |
assertEquals(SIZE-i, q.size()); |
414 |
< |
q.remove(); |
413 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
414 |
> |
assertEquals(i, q.remove()); |
415 |
|
} |
416 |
|
for (int i = 0; i < SIZE; ++i) { |
417 |
|
assertEquals(SIZE-i, q.remainingCapacity()); |
418 |
< |
assertEquals(i, q.size()); |
419 |
< |
q.add(new Integer(i)); |
418 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
419 |
> |
assertTrue(q.add(i)); |
420 |
|
} |
421 |
|
} |
422 |
|
|
438 |
|
try { |
439 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
440 |
|
for (int i = 0; i < SIZE; ++i) { |
441 |
< |
Integer I = new Integer(i); |
442 |
< |
q.push(I); |
443 |
< |
assertEquals(I, q.peek()); |
441 |
> |
Integer x = new Integer(i); |
442 |
> |
q.push(x); |
443 |
> |
assertEquals(x, q.peek()); |
444 |
|
} |
445 |
|
assertEquals(0, q.remainingCapacity()); |
446 |
|
q.push(new Integer(SIZE)); |
558 |
|
public void testPut() throws InterruptedException { |
559 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
560 |
|
for (int i = 0; i < SIZE; ++i) { |
561 |
< |
Integer I = new Integer(i); |
562 |
< |
q.put(I); |
563 |
< |
assertTrue(q.contains(I)); |
561 |
> |
Integer x = new Integer(i); |
562 |
> |
q.put(x); |
563 |
> |
assertTrue(q.contains(x)); |
564 |
|
} |
565 |
|
assertEquals(0, q.remainingCapacity()); |
566 |
|
} |
790 |
|
public void testPutFirst() throws InterruptedException { |
791 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
792 |
|
for (int i = 0; i < SIZE; ++i) { |
793 |
< |
Integer I = new Integer(i); |
794 |
< |
q.putFirst(I); |
795 |
< |
assertTrue(q.contains(I)); |
793 |
> |
Integer x = new Integer(i); |
794 |
> |
q.putFirst(x); |
795 |
> |
assertTrue(q.contains(x)); |
796 |
|
} |
797 |
|
assertEquals(0, q.remainingCapacity()); |
798 |
|
} |
1137 |
|
public void testPutLast() throws InterruptedException { |
1138 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
1139 |
|
for (int i = 0; i < SIZE; ++i) { |
1140 |
< |
Integer I = new Integer(i); |
1141 |
< |
q.putLast(I); |
1142 |
< |
assertTrue(q.contains(I)); |
1140 |
> |
Integer x = new Integer(i); |
1141 |
> |
q.putLast(x); |
1142 |
> |
assertTrue(q.contains(x)); |
1143 |
|
} |
1144 |
|
assertEquals(0, q.remainingCapacity()); |
1145 |
|
} |
1473 |
|
assertTrue(q.removeAll(p)); |
1474 |
|
assertEquals(SIZE-i, q.size()); |
1475 |
|
for (int j = 0; j < i; ++j) { |
1476 |
< |
Integer I = (Integer)(p.remove()); |
1477 |
< |
assertFalse(q.contains(I)); |
1476 |
> |
Integer x = (Integer)(p.remove()); |
1477 |
> |
assertFalse(q.contains(x)); |
1478 |
|
} |
1479 |
|
} |
1480 |
|
} |
1518 |
|
public void testIterator() throws InterruptedException { |
1519 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1520 |
|
Iterator it = q.iterator(); |
1521 |
< |
while (it.hasNext()) { |
1521 |
> |
int i; |
1522 |
> |
for (i = 0; it.hasNext(); i++) |
1523 |
> |
assertTrue(q.contains(it.next())); |
1524 |
> |
assertEquals(i, SIZE); |
1525 |
> |
assertIteratorExhausted(it); |
1526 |
> |
|
1527 |
> |
it = q.iterator(); |
1528 |
> |
for (i = 0; it.hasNext(); i++) |
1529 |
|
assertEquals(it.next(), q.take()); |
1530 |
< |
} |
1530 |
> |
assertEquals(i, SIZE); |
1531 |
> |
assertIteratorExhausted(it); |
1532 |
> |
} |
1533 |
> |
|
1534 |
> |
/** |
1535 |
> |
* iterator of empty collection has no elements |
1536 |
> |
*/ |
1537 |
> |
public void testEmptyIterator() { |
1538 |
> |
Deque c = new LinkedBlockingDeque(); |
1539 |
> |
assertIteratorExhausted(c.iterator()); |
1540 |
> |
assertIteratorExhausted(c.descendingIterator()); |
1541 |
|
} |
1542 |
|
|
1543 |
|
/** |