369 |
|
} |
370 |
|
|
371 |
|
/** |
372 |
< |
* toArray contains all elements |
372 |
> |
* toArray contains all elements in FIFO order |
373 |
|
*/ |
374 |
|
public void testToArray() { |
375 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
376 |
|
Object[] o = q.toArray(); |
377 |
– |
Arrays.sort(o); |
377 |
|
for (int i = 0; i < o.length; i++) |
378 |
< |
assertEquals(o[i], q.poll()); |
378 |
> |
assertSame(o[i], q.poll()); |
379 |
|
} |
380 |
|
|
381 |
|
/** |
382 |
< |
* toArray(a) contains all elements |
382 |
> |
* toArray(a) contains all elements in FIFO order |
383 |
|
*/ |
384 |
|
public void testToArray2() { |
385 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
386 |
|
Integer[] ints = new Integer[SIZE]; |
387 |
< |
ints = (Integer[])q.toArray(ints); |
389 |
< |
Arrays.sort(ints); |
387 |
> |
assertSame(ints, q.toArray(ints)); |
388 |
|
for (int i = 0; i < ints.length; i++) |
389 |
< |
assertEquals(ints[i], q.poll()); |
389 |
> |
assertSame(ints[i], q.poll()); |
390 |
|
} |
391 |
|
|
392 |
|
/** |