235 |
|
shouldThrow(); |
236 |
|
} catch (InterruptedException success) {} |
237 |
|
assertFalse(Thread.interrupted()); |
238 |
+ |
|
239 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
240 |
|
}}); |
241 |
|
|
242 |
|
barrier.await(); |
345 |
|
checkEmpty(q); |
346 |
|
for (int i = 0; i < size; i++) |
347 |
|
q.add(elts[i] = makeElement(i)); |
348 |
< |
for (int i = 1; i < size; i+=2) { |
348 |
> |
for (int i = 1; i < size; i += 2) { |
349 |
|
for (int pass = 0; pass < 2; pass++) { |
350 |
|
assertEquals((pass == 0), q.contains(elts[i])); |
351 |
|
assertEquals((pass == 0), q.remove(elts[i])); |
352 |
|
assertFalse(q.contains(elts[i])); |
353 |
< |
assertTrue(q.contains(elts[i-1])); |
353 |
> |
assertTrue(q.contains(elts[i - 1])); |
354 |
|
if (i < size - 1) |
355 |
< |
assertTrue(q.contains(elts[i+1])); |
355 |
> |
assertTrue(q.contains(elts[i + 1])); |
356 |
|
} |
357 |
|
} |
358 |
|
if (size > 0) |
359 |
|
assertTrue(q.contains(elts[0])); |
360 |
< |
for (int i = size-2; i >= 0; i-=2) { |
360 |
> |
for (int i = size - 2; i >= 0; i -= 2) { |
361 |
|
assertTrue(q.contains(elts[i])); |
362 |
< |
assertFalse(q.contains(elts[i+1])); |
362 |
> |
assertFalse(q.contains(elts[i + 1])); |
363 |
|
assertTrue(q.remove(elts[i])); |
364 |
|
assertFalse(q.contains(elts[i])); |
365 |
< |
assertFalse(q.remove(elts[i+1])); |
366 |
< |
assertFalse(q.contains(elts[i+1])); |
365 |
> |
assertFalse(q.remove(elts[i + 1])); |
366 |
> |
assertFalse(q.contains(elts[i + 1])); |
367 |
|
} |
368 |
|
checkEmpty(q); |
369 |
|
} |