28 |
|
private ConcurrentLinkedQueue populatedQueue(int n) { |
29 |
|
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
30 |
|
assertTrue(q.isEmpty()); |
31 |
< |
for(int i = 0; i < n; ++i) |
31 |
> |
for (int i = 0; i < n; ++i) |
32 |
|
assertTrue(q.offer(new Integer(i))); |
33 |
|
assertFalse(q.isEmpty()); |
34 |
|
assertEquals(n, q.size()); |
389 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
390 |
|
Object[] o = q.toArray(); |
391 |
|
Arrays.sort(o); |
392 |
< |
for(int i = 0; i < o.length; i++) |
392 |
> |
for (int i = 0; i < o.length; i++) |
393 |
|
assertEquals(o[i], q.poll()); |
394 |
|
} |
395 |
|
|
401 |
|
Integer[] ints = new Integer[SIZE]; |
402 |
|
ints = (Integer[])q.toArray(ints); |
403 |
|
Arrays.sort(ints); |
404 |
< |
for(int i = 0; i < ints.length; i++) |
404 |
> |
for (int i = 0; i < ints.length; i++) |
405 |
|
assertEquals(ints[i], q.poll()); |
406 |
|
} |
407 |
|
|
413 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
414 |
|
Object o[] = q.toArray(null); |
415 |
|
shouldThrow(); |
416 |
< |
} catch(NullPointerException success){} |
416 |
> |
} catch (NullPointerException success){} |
417 |
|
} |
418 |
|
|
419 |
|
/** |
424 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
425 |
|
Object o[] = q.toArray(new String[10] ); |
426 |
|
shouldThrow(); |
427 |
< |
} catch(ArrayStoreException success){} |
427 |
> |
} catch (ArrayStoreException success){} |
428 |
|
} |
429 |
|
|
430 |
|
/** |
434 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
435 |
|
int i = 0; |
436 |
|
Iterator it = q.iterator(); |
437 |
< |
while(it.hasNext()) { |
437 |
> |
while (it.hasNext()) { |
438 |
|
assertTrue(q.contains(it.next())); |
439 |
|
++i; |
440 |
|
} |
527 |
|
assertEquals(q.size(), r.size()); |
528 |
|
while (!q.isEmpty()) |
529 |
|
assertEquals(q.remove(), r.remove()); |
530 |
< |
} catch(Exception e){ |
530 |
> |
} catch (Exception e){ |
531 |
|
unexpectedException(); |
532 |
|
} |
533 |
|
} |