# | Line 2073 | Line 2073 | public class ConcurrentSkipListMap<K,V> | |
---|---|---|
2073 | final void advance(Node<K,V> b) { | |
2074 | Node<K,V> n = null; | |
2075 | V v = null; | |
2076 | < | if ((lastReturned = b) != null) |
2077 | < | do {} while ((n = b.next) != null && (v = n.val) == null); |
2076 | > | if ((lastReturned = b) != null) { |
2077 | > | while ((n = b.next) != null && (v = n.val) == null) |
2078 | > | b = n; |
2079 | > | } |
2080 | nextValue = v; | |
2081 | next = n; | |
2082 | } |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |