# | Line 571 | Line 571 | public class LinkedTransferQueue<E> exte | |
---|---|---|
571 | if (p.casItem(item, e)) { // match | |
572 | for (Node q = p; q != h;) { | |
573 | Node n = q.next; // update by 2 unless singleton | |
574 | < | if (head == h && casHead(h, n == null? q : n)) { |
574 | > | if (head == h && casHead(h, n == null ? q : n)) { |
575 | h.forgetNext(); | |
576 | break; | |
577 | } // advance and retry |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |