| 247 |
|
public void testPut() throws InterruptedException { |
| 248 |
|
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
| 249 |
|
for (int i = 0; i < SIZE; ++i) { |
| 250 |
< |
Integer I = new Integer(i); |
| 251 |
< |
q.put(I); |
| 252 |
< |
assertTrue(q.contains(I)); |
| 250 |
> |
Integer x = new Integer(i); |
| 251 |
> |
q.put(x); |
| 252 |
> |
assertTrue(q.contains(x)); |
| 253 |
|
} |
| 254 |
|
assertEquals(0, q.remainingCapacity()); |
| 255 |
|
} |
| 589 |
|
assertTrue(q.removeAll(p)); |
| 590 |
|
assertEquals(SIZE-i, q.size()); |
| 591 |
|
for (int j = 0; j < i; ++j) { |
| 592 |
< |
Integer I = (Integer)(p.remove()); |
| 593 |
< |
assertFalse(q.contains(I)); |
| 592 |
> |
Integer x = (Integer)(p.remove()); |
| 593 |
> |
assertFalse(q.contains(x)); |
| 594 |
|
} |
| 595 |
|
} |
| 596 |
|
} |
| 634 |
|
public void testIterator() throws InterruptedException { |
| 635 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
| 636 |
|
Iterator it = q.iterator(); |
| 637 |
< |
while (it.hasNext()) { |
| 637 |
> |
int i; |
| 638 |
> |
for (i = 0; it.hasNext(); i++) |
| 639 |
> |
assertTrue(q.contains(it.next())); |
| 640 |
> |
assertEquals(i, SIZE); |
| 641 |
> |
assertIteratorExhausted(it); |
| 642 |
> |
|
| 643 |
> |
it = q.iterator(); |
| 644 |
> |
for (i = 0; it.hasNext(); i++) |
| 645 |
|
assertEquals(it.next(), q.take()); |
| 646 |
< |
} |
| 646 |
> |
assertEquals(i, SIZE); |
| 647 |
> |
assertIteratorExhausted(it); |
| 648 |
> |
} |
| 649 |
> |
|
| 650 |
> |
/** |
| 651 |
> |
* iterator of empty collection has no elements |
| 652 |
> |
*/ |
| 653 |
> |
public void testEmptyIterator() { |
| 654 |
> |
assertIteratorExhausted(new LinkedBlockingQueue().iterator()); |
| 655 |
|
} |
| 656 |
|
|
| 657 |
|
/** |
