24 |
|
* algorithm based on one described in <a |
25 |
|
* href="http://www.cs.rochester.edu/u/michael/PODC96.html"> Simple, |
26 |
|
* Fast, and Practical Non-Blocking and Blocking Concurrent Queue |
27 |
< |
* Algorithms</a> by Maged M. Michael and Michael L. Scott.) |
27 |
> |
* Algorithms</a> by Maged M. Michael and Michael L. Scott. |
28 |
|
* |
29 |
|
* <p>Beware that, unlike in most collections, the <tt>size</tt> method |
30 |
|
* is <em>NOT</em> a constant-time operation. Because of the |
31 |
|
* asynchronous nature of these queues, determining the current number |
32 |
< |
* of elements requires an O(n) traversal. |
32 |
> |
* of elements requires a traversal of the elements. |
33 |
|
* @since 1.5 |
34 |
|
* @author Doug Lea |
35 |
|
* |