269 |
|
* addAll throws ISE if not enough room |
270 |
|
*/ |
271 |
|
public void testAddAll_insufficientSpace() { |
272 |
< |
int size = ThreadLocalRandom.current().nextInt(SIZE); |
272 |
> |
int size = ThreadLocalRandom.current().nextInt(1, SIZE); |
273 |
|
ArrayBlockingQueue q = populatedQueue(0, size, size, false); |
274 |
|
// Just fits: |
275 |
|
q.addAll(populatedQueue(size, size, 2 * size, false)); |
579 |
|
* clear removes all elements |
580 |
|
*/ |
581 |
|
public void testClear() { |
582 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
582 |
> |
int size = ThreadLocalRandom.current().nextInt(1, 5); |
583 |
> |
ArrayBlockingQueue q = populatedQueue(size, size, 2 * size, false); |
584 |
> |
int capacity = size + q.remainingCapacity(); |
585 |
|
q.clear(); |
586 |
|
assertTrue(q.isEmpty()); |
587 |
|
assertEquals(0, q.size()); |
588 |
< |
assertEquals(SIZE, q.remainingCapacity()); |
588 |
> |
assertEquals(capacity, q.remainingCapacity()); |
589 |
|
q.add(one); |
590 |
|
assertFalse(q.isEmpty()); |
591 |
|
assertTrue(q.contains(one)); |
939 |
|
*/ |
940 |
|
public void testNeverContainsNull() { |
941 |
|
Collection<?>[] qs = { |
942 |
< |
new ArrayBlockingQueue<Object>(10), |
943 |
< |
populatedQueue(2), |
942 |
> |
populatedQueue(0, 1, 10, false), |
943 |
> |
populatedQueue(2, 2, 10, true), |
944 |
|
}; |
945 |
|
|
946 |
|
for (Collection<?> q : qs) { |