static final class TreeRangeSet.RangesByUpperBound<C extends java.lang.Comparable<?>> extends AbstractNavigableMap<Cut<C>,Range<C>>
| Modifier and Type | Field and Description |
|---|---|
private java.util.NavigableMap<Cut<C>,Range<C>> |
rangesByLowerBound |
private Range<Cut<C>> |
upperBoundWindow
upperBoundWindow represents the headMap/subMap/tailMap view of the entire "ranges by upper
bound" map; it's a constraint on the *keys*, and does not affect the values.
|
| Modifier | Constructor and Description |
|---|---|
(package private) |
RangesByUpperBound(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound) |
private |
RangesByUpperBound(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound,
Range<Cut<C>> upperBoundWindow) |
| Modifier and Type | Method and Description |
|---|---|
java.util.Comparator<? super Cut<C>> |
comparator() |
boolean |
containsKey(java.lang.Object key) |
(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> |
descendingEntryIterator() |
(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> |
entryIterator() |
Range<C> |
get(java.lang.Object key) |
java.util.NavigableMap<Cut<C>,Range<C>> |
headMap(Cut<C> toKey,
boolean inclusive) |
boolean |
isEmpty() |
int |
size() |
java.util.NavigableMap<Cut<C>,Range<C>> |
subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
private java.util.NavigableMap<Cut<C>,Range<C>> |
subMap(Range<Cut<C>> window) |
java.util.NavigableMap<Cut<C>,Range<C>> |
tailMap(Cut<C> fromKey,
boolean inclusive) |
ceilingEntry, ceilingKey, descendingKeySet, descendingMap, firstEntry, firstKey, floorEntry, floorKey, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, subMap, tailMapclear, entrySet, entrySpliterator, forEachEntryclone, containsValue, equals, hashCode, put, putAll, remove, toString, valuesprivate final java.util.NavigableMap<Cut<C extends java.lang.Comparable<?>>,Range<C extends java.lang.Comparable<?>>> rangesByLowerBound
public java.util.NavigableMap<Cut<C>,Range<C>> subMap(Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive)
public boolean containsKey(@CheckForNull
java.lang.Object key)
java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> entryIterator()
entryIterator in class Maps.IteratorBasedAbstractMap<Cut<C extends java.lang.Comparable<?>>,Range<C extends java.lang.Comparable<?>>>java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> descendingEntryIterator()
descendingEntryIterator in class AbstractNavigableMap<Cut<C extends java.lang.Comparable<?>>,Range<C extends java.lang.Comparable<?>>>public int size()