/guava/guava/src/com/google/common/collect/TreeRangeSet.java
Cut<C> firstComplementRangeUpperBound = MoreObjects.firstNonNull( cut, Cut.<C>aboveAll( ) ) ; }cut = positiveRangesByLowerBound.higherKey( Cut.<C>belowAll( ) ) ;
cut = positiveRangesByLowerBound.higherKey ( Cut.<C>belowAll ( ) ) ; } Cut<C> firstComplementRangeUpperBound = MoreObjects.firstNonNull ( cut, Cut.<C>aboveAll ( ) ) ;
? positiveItr.next().lowerBound : positiveRangesByLowerBound.higherKey(positiveItr.peek().upperBound); } else if (!complementLowerBoundWindow.contains(Cut.<C>belowAll()) || positiveRangesByLowerBound.containsKey(Cut.belowAll())) { return Iterators.emptyIterator(); } else { <extra_id_0> return new AbstractIterator<Entry<Cut<C>, Range<C>>>() { Cut<C> nextComplementRangeUpperBound = firstComplementRangeUpperBound; @Override @CheckForNull protected Entry<Cut<C>, Range<C>> computeNext() { if (nextComplementRangeUpperBound == Cut.<C>belowAll()) {