/guava/guava/src/com/google/common/collect/TreeRangeMap.java
if ( ( rangeMapEntry.getUpperBound( ).compareTo( cut) ) <= 0) {   return ; }
[Delete]
return new AbstractIterator<Entry<Range<K>, V>>() { @Override @CheckForNull protected Entry<Range<K>, V> computeNext() { if (backingItr.hasNext()) { RangeMapEntry<K, V> entry = backingItr.next(); <extra_id_0> return endOfData(); } return Maps.immutableEntry(entry.getKey().intersection(subRange), entry.getValue()); } return endOfData(); }