124 |
|
private DelayQueue<PDelay> populatedQueue(int n) { |
125 |
|
DelayQueue<PDelay> q = new DelayQueue<PDelay>(); |
126 |
|
assertTrue(q.isEmpty()); |
127 |
< |
for (int i = n-1; i >= 0; i -= 2) |
127 |
> |
for (int i = n - 1; i >= 0; i -= 2) |
128 |
|
assertTrue(q.offer(new PDelay(i))); |
129 |
|
for (int i = (n & 1); i < n; i += 2) |
130 |
|
assertTrue(q.offer(new PDelay(i))); |
166 |
|
*/ |
167 |
|
public void testConstructor5() { |
168 |
|
PDelay[] a = new PDelay[SIZE]; |
169 |
< |
for (int i = 0; i < SIZE-1; ++i) |
169 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
170 |
|
a[i] = new PDelay(i); |
171 |
|
try { |
172 |
|
new DelayQueue(Arrays.asList(a)); |
208 |
|
BlockingQueue q = populatedQueue(SIZE); |
209 |
|
for (int i = 0; i < SIZE; ++i) { |
210 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
211 |
< |
assertEquals(SIZE-i, q.size()); |
211 |
> |
assertEquals(SIZE - i, q.size()); |
212 |
|
assertTrue(q.remove() instanceof PDelay); |
213 |
|
} |
214 |
|
for (int i = 0; i < SIZE; ++i) { |
256 |
|
public void testAddAll3() { |
257 |
|
DelayQueue q = new DelayQueue(); |
258 |
|
PDelay[] a = new PDelay[SIZE]; |
259 |
< |
for (int i = 0; i < SIZE-1; ++i) |
259 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
260 |
|
a[i] = new PDelay(i); |
261 |
|
try { |
262 |
|
q.addAll(Arrays.asList(a)); |
270 |
|
public void testAddAll5() { |
271 |
|
PDelay[] empty = new PDelay[0]; |
272 |
|
PDelay[] ints = new PDelay[SIZE]; |
273 |
< |
for (int i = SIZE-1; i >= 0; --i) |
273 |
> |
for (int i = SIZE - 1; i >= 0; --i) |
274 |
|
ints[i] = new PDelay(i); |
275 |
|
DelayQueue q = new DelayQueue(); |
276 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
542 |
|
assertTrue(changed); |
543 |
|
|
544 |
|
assertTrue(q.containsAll(p)); |
545 |
< |
assertEquals(SIZE-i, q.size()); |
545 |
> |
assertEquals(SIZE - i, q.size()); |
546 |
|
p.remove(); |
547 |
|
} |
548 |
|
} |
555 |
|
DelayQueue q = populatedQueue(SIZE); |
556 |
|
DelayQueue p = populatedQueue(i); |
557 |
|
assertTrue(q.removeAll(p)); |
558 |
< |
assertEquals(SIZE-i, q.size()); |
558 |
> |
assertEquals(SIZE - i, q.size()); |
559 |
|
for (int j = 0; j < i; ++j) { |
560 |
|
PDelay x = (PDelay)(p.remove()); |
561 |
|
assertFalse(q.contains(x)); |
753 |
|
final DelayQueue q = populatedQueue(SIZE); |
754 |
|
Thread t = new Thread(new CheckedRunnable() { |
755 |
|
public void realRun() { |
756 |
< |
q.put(new PDelay(SIZE+1)); |
756 |
> |
q.put(new PDelay(SIZE + 1)); |
757 |
|
}}); |
758 |
|
|
759 |
|
t.start(); |
773 |
|
ArrayList l = new ArrayList(); |
774 |
|
q.drainTo(l, i); |
775 |
|
int k = (i < SIZE) ? i : SIZE; |
776 |
< |
assertEquals(SIZE-k, q.size()); |
776 |
> |
assertEquals(SIZE - k, q.size()); |
777 |
|
assertEquals(k, l.size()); |
778 |
|
} |
779 |
|
} |