| 4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
< |
import junit.framework.*; |
| 8 |
< |
import java.util.Arrays; |
| 7 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
| 8 |
> |
|
| 9 |
|
import java.util.ArrayList; |
| 10 |
+ |
import java.util.Arrays; |
| 11 |
|
import java.util.Collection; |
| 12 |
+ |
import java.util.Deque; |
| 13 |
|
import java.util.Iterator; |
| 14 |
|
import java.util.NoSuchElementException; |
| 15 |
|
import java.util.Queue; |
| 19 |
|
import java.util.concurrent.Executors; |
| 20 |
|
import java.util.concurrent.ExecutorService; |
| 21 |
|
import java.util.concurrent.LinkedBlockingDeque; |
| 22 |
< |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
| 22 |
> |
|
| 23 |
> |
import junit.framework.Test; |
| 24 |
|
|
| 25 |
|
public class LinkedBlockingDequeTest extends JSR166TestCase { |
| 26 |
|
|
| 1773 |
|
assertEquals(SIZE-k, q.size()); |
| 1774 |
|
for (int j = 0; j < k; ++j) |
| 1775 |
|
assertEquals(l.get(j), new Integer(j)); |
| 1776 |
< |
while (q.poll() != null) ; |
| 1776 |
> |
do {} while (q.poll() != null); |
| 1777 |
> |
} |
| 1778 |
> |
} |
| 1779 |
> |
|
| 1780 |
> |
/** |
| 1781 |
> |
* remove(null), contains(null) always return false |
| 1782 |
> |
*/ |
| 1783 |
> |
public void testNeverContainsNull() { |
| 1784 |
> |
Deque<?>[] qs = { |
| 1785 |
> |
new LinkedBlockingDeque<Object>(), |
| 1786 |
> |
populatedDeque(2), |
| 1787 |
> |
}; |
| 1788 |
> |
|
| 1789 |
> |
for (Deque<?> q : qs) { |
| 1790 |
> |
assertFalse(q.contains(null)); |
| 1791 |
> |
assertFalse(q.remove(null)); |
| 1792 |
> |
assertFalse(q.removeFirstOccurrence(null)); |
| 1793 |
> |
assertFalse(q.removeLastOccurrence(null)); |
| 1794 |
|
} |
| 1795 |
|
} |
| 1796 |
|
|
