37 |
|
} |
38 |
|
|
39 |
|
public static void main(String[] args) { |
40 |
< |
junit.textui.TestRunner.run(suite()); |
40 |
> |
main(suite(), args); |
41 |
|
} |
42 |
|
|
43 |
|
public static Test suite() { |
104 |
|
*/ |
105 |
|
public void testConstructor5() { |
106 |
|
Integer[] ints = new Integer[SIZE]; |
107 |
< |
for (int i = 0; i < SIZE-1; ++i) |
107 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
108 |
|
ints[i] = i; |
109 |
|
Collection<Integer> elements = Arrays.asList(ints); |
110 |
|
try { |
111 |
< |
new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
111 |
> |
new ArrayBlockingQueue(SIZE, false, elements); |
112 |
|
shouldThrow(); |
113 |
|
} catch (NullPointerException success) {} |
114 |
|
} |
159 |
|
* remainingCapacity decreases on add, increases on remove |
160 |
|
*/ |
161 |
|
public void testRemainingCapacity() { |
162 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
162 |
> |
BlockingQueue q = populatedQueue(SIZE); |
163 |
|
for (int i = 0; i < SIZE; ++i) { |
164 |
|
assertEquals(i, q.remainingCapacity()); |
165 |
< |
assertEquals(SIZE-i, q.size()); |
166 |
< |
q.remove(); |
165 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
166 |
> |
assertEquals(i, q.remove()); |
167 |
|
} |
168 |
|
for (int i = 0; i < SIZE; ++i) { |
169 |
< |
assertEquals(SIZE-i, q.remainingCapacity()); |
170 |
< |
assertEquals(i, q.size()); |
171 |
< |
q.add(new Integer(i)); |
169 |
> |
assertEquals(SIZE - i, q.remainingCapacity()); |
170 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
171 |
> |
assertTrue(q.add(i)); |
172 |
|
} |
173 |
|
} |
174 |
|
|
185 |
|
* add succeeds if not full; throws ISE if full |
186 |
|
*/ |
187 |
|
public void testAdd() { |
188 |
+ |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
189 |
+ |
for (int i = 0; i < SIZE; ++i) { |
190 |
+ |
assertTrue(q.add(new Integer(i))); |
191 |
+ |
} |
192 |
+ |
assertEquals(0, q.remainingCapacity()); |
193 |
|
try { |
189 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
190 |
– |
for (int i = 0; i < SIZE; ++i) { |
191 |
– |
assertTrue(q.add(new Integer(i))); |
192 |
– |
} |
193 |
– |
assertEquals(0, q.remainingCapacity()); |
194 |
|
q.add(new Integer(SIZE)); |
195 |
|
shouldThrow(); |
196 |
|
} catch (IllegalStateException success) {} |
200 |
|
* addAll(this) throws IAE |
201 |
|
*/ |
202 |
|
public void testAddAllSelf() { |
203 |
+ |
ArrayBlockingQueue q = populatedQueue(SIZE); |
204 |
|
try { |
204 |
– |
ArrayBlockingQueue q = populatedQueue(SIZE); |
205 |
|
q.addAll(q); |
206 |
|
shouldThrow(); |
207 |
|
} catch (IllegalArgumentException success) {} |
212 |
|
* possibly adding some elements |
213 |
|
*/ |
214 |
|
public void testAddAll3() { |
215 |
+ |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
216 |
+ |
Integer[] ints = new Integer[SIZE]; |
217 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
218 |
+ |
ints[i] = new Integer(i); |
219 |
|
try { |
216 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
217 |
– |
Integer[] ints = new Integer[SIZE]; |
218 |
– |
for (int i = 0; i < SIZE-1; ++i) |
219 |
– |
ints[i] = new Integer(i); |
220 |
|
q.addAll(Arrays.asList(ints)); |
221 |
|
shouldThrow(); |
222 |
|
} catch (NullPointerException success) {} |
226 |
|
* addAll throws ISE if not enough room |
227 |
|
*/ |
228 |
|
public void testAddAll4() { |
229 |
+ |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
230 |
+ |
Integer[] ints = new Integer[SIZE]; |
231 |
+ |
for (int i = 0; i < SIZE; ++i) |
232 |
+ |
ints[i] = new Integer(i); |
233 |
|
try { |
230 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
231 |
– |
Integer[] ints = new Integer[SIZE]; |
232 |
– |
for (int i = 0; i < SIZE; ++i) |
233 |
– |
ints[i] = new Integer(i); |
234 |
|
q.addAll(Arrays.asList(ints)); |
235 |
|
shouldThrow(); |
236 |
|
} catch (IllegalStateException success) {} |
257 |
|
public void testPut() throws InterruptedException { |
258 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
259 |
|
for (int i = 0; i < SIZE; ++i) { |
260 |
< |
Integer I = new Integer(i); |
261 |
< |
q.put(I); |
262 |
< |
assertTrue(q.contains(I)); |
260 |
> |
Integer x = new Integer(i); |
261 |
> |
q.put(x); |
262 |
> |
assertTrue(q.contains(x)); |
263 |
|
} |
264 |
|
assertEquals(0, q.remainingCapacity()); |
265 |
|
} |
572 |
|
assertTrue(changed); |
573 |
|
|
574 |
|
assertTrue(q.containsAll(p)); |
575 |
< |
assertEquals(SIZE-i, q.size()); |
575 |
> |
assertEquals(SIZE - i, q.size()); |
576 |
|
p.remove(); |
577 |
|
} |
578 |
|
} |
585 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
586 |
|
ArrayBlockingQueue p = populatedQueue(i); |
587 |
|
assertTrue(q.removeAll(p)); |
588 |
< |
assertEquals(SIZE-i, q.size()); |
588 |
> |
assertEquals(SIZE - i, q.size()); |
589 |
|
for (int j = 0; j < i; ++j) { |
590 |
< |
Integer I = (Integer)(p.remove()); |
591 |
< |
assertFalse(q.contains(I)); |
590 |
> |
Integer x = (Integer)(p.remove()); |
591 |
> |
assertFalse(q.contains(x)); |
592 |
|
} |
593 |
|
} |
594 |
|
} |
619 |
|
checkToArray(q); |
620 |
|
assertEquals(i, q.poll()); |
621 |
|
checkToArray(q); |
622 |
< |
q.add(SIZE+i); |
622 |
> |
q.add(SIZE + i); |
623 |
|
} |
624 |
|
for (int i = 0; i < SIZE; i++) { |
625 |
|
checkToArray(q); |
626 |
< |
assertEquals(SIZE+i, q.poll()); |
626 |
> |
assertEquals(SIZE + i, q.poll()); |
627 |
|
} |
628 |
|
} |
629 |
|
|
630 |
|
void checkToArray2(ArrayBlockingQueue q) { |
631 |
|
int size = q.size(); |
632 |
< |
Integer[] a1 = size == 0 ? null : new Integer[size-1]; |
632 |
> |
Integer[] a1 = (size == 0) ? null : new Integer[size - 1]; |
633 |
|
Integer[] a2 = new Integer[size]; |
634 |
< |
Integer[] a3 = new Integer[size+2]; |
634 |
> |
Integer[] a3 = new Integer[size + 2]; |
635 |
|
if (size > 0) Arrays.fill(a1, 42); |
636 |
|
Arrays.fill(a2, 42); |
637 |
|
Arrays.fill(a3, 42); |
638 |
< |
Integer[] b1 = size == 0 ? null : (Integer[]) q.toArray(a1); |
638 |
> |
Integer[] b1 = (size == 0) ? null : (Integer[]) q.toArray(a1); |
639 |
|
Integer[] b2 = (Integer[]) q.toArray(a2); |
640 |
|
Integer[] b3 = (Integer[]) q.toArray(a3); |
641 |
|
assertSame(a2, b2); |
649 |
|
assertSame(b3[i], x); |
650 |
|
} |
651 |
|
assertNull(a3[size]); |
652 |
< |
assertEquals(42, (int) a3[size+1]); |
652 |
> |
assertEquals(42, (int) a3[size + 1]); |
653 |
|
if (size > 0) { |
654 |
|
assertNotSame(a1, b1); |
655 |
|
assertEquals(size, b1.length); |
673 |
|
checkToArray2(q); |
674 |
|
assertEquals(i, q.poll()); |
675 |
|
checkToArray2(q); |
676 |
< |
q.add(SIZE+i); |
676 |
> |
q.add(SIZE + i); |
677 |
|
} |
678 |
|
for (int i = 0; i < SIZE; i++) { |
679 |
|
checkToArray2(q); |
680 |
< |
assertEquals(SIZE+i, q.poll()); |
680 |
> |
assertEquals(SIZE + i, q.poll()); |
681 |
|
} |
682 |
|
} |
683 |
|
|
698 |
|
public void testIterator() throws InterruptedException { |
699 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
700 |
|
Iterator it = q.iterator(); |
701 |
< |
while (it.hasNext()) { |
701 |
> |
int i; |
702 |
> |
for (i = 0; it.hasNext(); i++) |
703 |
> |
assertTrue(q.contains(it.next())); |
704 |
> |
assertEquals(i, SIZE); |
705 |
> |
assertIteratorExhausted(it); |
706 |
> |
|
707 |
> |
it = q.iterator(); |
708 |
> |
for (i = 0; it.hasNext(); i++) |
709 |
|
assertEquals(it.next(), q.take()); |
710 |
< |
} |
710 |
> |
assertEquals(i, SIZE); |
711 |
> |
assertIteratorExhausted(it); |
712 |
> |
} |
713 |
> |
|
714 |
> |
/** |
715 |
> |
* iterator of empty collection has no elements |
716 |
> |
*/ |
717 |
> |
public void testEmptyIterator() { |
718 |
> |
assertIteratorExhausted(new ArrayBlockingQueue(SIZE).iterator()); |
719 |
|
} |
720 |
|
|
721 |
|
/** |
881 |
|
final ArrayBlockingQueue q = populatedQueue(SIZE); |
882 |
|
Thread t = new Thread(new CheckedRunnable() { |
883 |
|
public void realRun() throws InterruptedException { |
884 |
< |
q.put(new Integer(SIZE+1)); |
884 |
> |
q.put(new Integer(SIZE + 1)); |
885 |
|
}}); |
886 |
|
|
887 |
|
t.start(); |
898 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
899 |
|
*/ |
900 |
|
public void testDrainToN() { |
901 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2); |
901 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE * 2); |
902 |
|
for (int i = 0; i < SIZE + 2; ++i) { |
903 |
|
for (int j = 0; j < SIZE; j++) |
904 |
|
assertTrue(q.offer(new Integer(j))); |
906 |
|
q.drainTo(l, i); |
907 |
|
int k = (i < SIZE) ? i : SIZE; |
908 |
|
assertEquals(k, l.size()); |
909 |
< |
assertEquals(SIZE-k, q.size()); |
909 |
> |
assertEquals(SIZE - k, q.size()); |
910 |
|
for (int j = 0; j < k; ++j) |
911 |
|
assertEquals(l.get(j), new Integer(j)); |
912 |
|
do {} while (q.poll() != null); |