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