| # | Line 654 | Line 654 | public class ConcurrentLinkedDeque<E> | |
|---|---|---|
| 654 | */ | |
| 655 | final Node<E> succ(Node<E> p) { | |
| 656 | // TODO: should we skip deleted nodes here? | |
| 657 | < | Node<E> q = p.next; |
| 658 | < | return (p == q) ? first() : q; |
| 657 | > | if (p == (p = p.next)) |
| 658 | > | p = first(); |
| 659 | > | return p; |
| 660 | } | |
| 661 | ||
| 662 | /** | |
| – | Removed lines |
| + | Added lines |
| < | Changed lines |
| > | Changed lines |