/guava/guava/src/com/google/common/collect/TreeRangeSet.java
} else { firstComplementRangeLowerBound = positiveItr.next( ).upperBound;} else if ( positiveItr.hasNext( ) ) {
} else if ( positiveItr.hasNext ( ) ) { firstComplementRangeLowerBound = positiveItr.next ( ) .upperBound; } else {
} PeekingIterator<Range<C>> positiveItr = Iterators.peekingIterator(positiveRanges.iterator()); Cut<C> firstComplementRangeLowerBound; if (complementLowerBoundWindow.contains(Cut.<C>belowAll()) && (!positiveItr.hasNext() || positiveItr.peek().lowerBound != Cut.<C>belowAll())) { firstComplementRangeLowerBound = Cut.belowAll(); <extra_id_0> return Iterators.emptyIterator(); } return new AbstractIterator<Entry<Cut<C>, Range<C>>>() { Cut<C> nextComplementRangeLowerBound = firstComplementRangeLowerBound; @Override @CheckForNull