# | Line 797 | Line 797 | public class LinkedTransferQueue<E> exte | |
---|---|---|
797 | lastPred = r; // next lastPred is old lastRet | |
798 | else if ((b = lastPred) == null || b.isMatched()) | |
799 | lastPred = null; // at start of list | |
800 | < | else { |
800 | > | else { |
801 | Node s, n; // help with removal of lastPred.next | |
802 | while ((s = b.next) != null && | |
803 | s != b && s.isMatched() && | |
# | Line 821 | Line 821 | public class LinkedTransferQueue<E> exte | |
821 | nextNode = s; | |
822 | return; | |
823 | } | |
824 | < | } |
824 | > | } |
825 | else if (item == null) | |
826 | break; | |
827 | // assert s.isMatched(); |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |