/guava/guava/src/com/google/common/collect/TreeRangeSet.java
backingItr.next ( ) ;
} else { candidates = rangesByLowerBound.descendingMap().values(); } PeekingIterator<Range<C>> backingItr = Iterators.peekingIterator(candidates.iterator()); if (backingItr.hasNext() && upperBoundWindow.upperBound.isLessThan(backingItr.peek().upperBound)) { <extra_id_0> } return new AbstractIterator<Entry<Cut<C>, Range<C>>>() { @Override @CheckForNull protected Entry<Cut<C>, Range<C>> computeNext() { if (!backingItr.hasNext()) {