| # | Line 82 | Line 82 | public class LinkedTransferQueue<E> exte | |
|---|---|---|
| 82 | * | |
| 83 | * A FIFO dual queue may be implemented using a variation of the | |
| 84 | * Michael & Scott (M&S) lock-free queue algorithm | |
| 85 | < | * (http://www.cs.rochester.edu/u/scott/papers/1996_PODC_queues.pdf). |
| 85 | > | * (http://www.cs.rochester.edu/~scott/papers/1996_PODC_queues.pdf). |
| 86 | * It maintains two pointer fields, "head", pointing to a | |
| 87 | * (matched) node that in turn points to the first actual | |
| 88 | * (unmatched) queue node (or null if empty); and "tail" that | |
| – | Removed lines |
| + | Added lines |
| < | Changed lines |
| > | Changed lines |