487 |
|
} |
488 |
|
} |
489 |
|
Node n = p.next; |
490 |
< |
p = p != n ? n : (h = head); // Use head if p offlist |
490 |
> |
p = (p != n) ? n : (h = head); // Use head if p offlist |
491 |
|
} |
492 |
|
|
493 |
|
if (how >= ASYNC) { // No matches available |
523 |
|
return null; // lost race vs opposite mode |
524 |
|
else if ((n = p.next) != null) // Not tail; keep traversing |
525 |
|
p = p != t && t != (u = tail) ? (t = u) : // stale tail |
526 |
< |
p != n ? n : null; // restart if off list |
526 |
> |
(p != n) ? n : null; // restart if off list |
527 |
|
else if (!p.casNext(null, s)) |
528 |
|
p = p.next; // re-read on CAS failure |
529 |
|
else { |
640 |
|
private Node firstOfMode(boolean data) { |
641 |
|
for (Node p = head; p != null; ) { |
642 |
|
if (!p.isMatched()) |
643 |
< |
return p.isData == data? p : null; |
643 |
> |
return (p.isData == data) ? p : null; |
644 |
|
Node n = p.next; |
645 |
< |
p = n != p ? n : head; |
645 |
> |
p = (n != p) ? n : head; |
646 |
|
} |
647 |
|
return null; |
648 |
|
} |
658 |
|
if (item != p && (item != null) == isData) |
659 |
|
return isData ? item : null; |
660 |
|
Node n = p.next; |
661 |
< |
p = n != p ? n : head; |
661 |
> |
p = (n != p) ? n : head; |
662 |
|
} |
663 |
|
return null; |
664 |
|
} |
712 |
|
else if (item == null) |
713 |
|
break; |
714 |
|
Node n = p.next; |
715 |
< |
p = n != p ? n : head; |
715 |
> |
p = (n != p) ? n : head; |
716 |
|
} |
717 |
|
nextNode = null; |
718 |
|
} |
763 |
|
*/ |
764 |
|
if (pred != null && pred != s) { |
765 |
|
while (pred.next == s) { |
766 |
< |
Node oldpred = cleanMe == null? null : reclean(); |
766 |
> |
Node oldpred = (cleanMe == null) ? null : reclean(); |
767 |
|
Node n = s.next; |
768 |
|
if (n != null) { |
769 |
|
if (n != s) |