Package | Description |
---|---|
com.google.common.collect |
This package contains generic collection interfaces and implementations, and
other utilities for working with collections.
|
Modifier and Type | Class and Description |
---|---|
private static class |
Cut.AboveAll |
private static class |
Cut.AboveValue<C extends java.lang.Comparable> |
private static class |
Cut.BelowAll |
private static class |
Cut.BelowValue<C extends java.lang.Comparable> |
Modifier and Type | Field and Description |
---|---|
(package private) Cut<C> |
Range.lowerBound |
(package private) Cut<C> |
Range.upperBound |
Modifier and Type | Field and Description |
---|---|
private Range<Cut<C>> |
TreeRangeSet.ComplementRangesByLowerBound.complementLowerBoundWindow
complementLowerBoundWindow represents the headMap/subMap/tailMap view of the entire
"complement ranges by lower bound" map; it's a constraint on the *keys*, and does not affect
the values.
|
private java.util.NavigableMap<Cut<K>,TreeRangeMap.RangeMapEntry<K,V>> |
TreeRangeMap.entriesByLowerBound |
private static Function<Range,Cut> |
Range.LOWER_BOUND_FN |
private Range<Cut<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.lowerBoundWindow
lowerBoundWindow is the headMap/subMap/tailMap view; it only restricts the keys, and does not
affect the values.
|
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.positiveRangesByLowerBound |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.positiveRangesByUpperBound |
(package private) java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.rangesByLowerBound |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.rangesByLowerBound |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.rangesByLowerBound |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.rangesByUpperBound |
private static Function<Range,Cut> |
Range.UPPER_BOUND_FN |
private Range<Cut<C>> |
TreeRangeSet.RangesByUpperBound.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 and Type | Method and Description |
---|---|
(package private) static <C extends java.lang.Comparable> |
Cut.aboveAll() |
(package private) static <C extends java.lang.Comparable> |
Cut.aboveValue(C endpoint) |
(package private) static <C extends java.lang.Comparable> |
Cut.belowAll() |
(package private) static <C extends java.lang.Comparable> |
Cut.belowValue(C endpoint) |
(package private) Cut<C> |
Cut.canonical(DiscreteDomain<C> domain) |
(package private) Cut<C> |
Cut.AboveValue.canonical(DiscreteDomain<C> domain) |
(package private) Cut<java.lang.Comparable<?>> |
Cut.BelowAll.canonical(DiscreteDomain<java.lang.Comparable<?>> domain) |
(package private) Cut<K> |
TreeRangeMap.RangeMapEntry.getLowerBound() |
(package private) Cut<K> |
TreeRangeMap.RangeMapEntry.getUpperBound() |
(package private) abstract Cut<C> |
Cut.withLowerBoundType(BoundType boundType,
DiscreteDomain<C> domain) |
(package private) Cut<C> |
Cut.BelowValue.withLowerBoundType(BoundType boundType,
DiscreteDomain<C> domain) |
(package private) Cut<C> |
Cut.AboveValue.withLowerBoundType(BoundType boundType,
DiscreteDomain<C> domain) |
(package private) Cut<java.lang.Comparable<?>> |
Cut.BelowAll.withLowerBoundType(BoundType boundType,
DiscreteDomain<java.lang.Comparable<?>> domain) |
(package private) Cut<java.lang.Comparable<?>> |
Cut.AboveAll.withLowerBoundType(BoundType boundType,
DiscreteDomain<java.lang.Comparable<?>> domain) |
(package private) abstract Cut<C> |
Cut.withUpperBoundType(BoundType boundType,
DiscreteDomain<C> domain) |
(package private) Cut<C> |
Cut.BelowValue.withUpperBoundType(BoundType boundType,
DiscreteDomain<C> domain) |
(package private) Cut<C> |
Cut.AboveValue.withUpperBoundType(BoundType boundType,
DiscreteDomain<C> domain) |
(package private) Cut<java.lang.Comparable<?>> |
Cut.BelowAll.withUpperBoundType(BoundType boundType,
DiscreteDomain<java.lang.Comparable<?>> domain) |
(package private) Cut<java.lang.Comparable<?>> |
Cut.AboveAll.withUpperBoundType(BoundType boundType,
DiscreteDomain<java.lang.Comparable<?>> domain) |
Modifier and Type | Method and Description |
---|---|
java.util.Comparator<? super Cut<C>> |
TreeRangeSet.RangesByUpperBound.comparator() |
java.util.Comparator<? super Cut<C>> |
TreeRangeSet.ComplementRangesByLowerBound.comparator() |
java.util.Comparator<? super Cut<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.comparator() |
(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> |
TreeRangeSet.RangesByUpperBound.descendingEntryIterator() |
(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> |
TreeRangeSet.ComplementRangesByLowerBound.descendingEntryIterator() |
(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.descendingEntryIterator() |
(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> |
TreeRangeSet.RangesByUpperBound.entryIterator() |
(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> |
TreeRangeSet.ComplementRangesByLowerBound.entryIterator() |
(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.entryIterator() |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.headMap(Cut<C> toKey,
boolean inclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.headMap(Cut<C> toKey,
boolean inclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.headMap(Cut<C> toKey,
boolean inclusive) |
(package private) static <C extends java.lang.Comparable<?>> |
Range.lowerBoundFn() |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.subMap(Range<Cut<C>> window) |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.subMap(Range<Cut<C>> subWindow) |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.subMap(Range<Cut<C>> window) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.tailMap(Cut<C> fromKey,
boolean inclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.tailMap(Cut<C> fromKey,
boolean inclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.tailMap(Cut<C> fromKey,
boolean inclusive) |
(package private) static <C extends java.lang.Comparable<?>> |
Range.upperBoundFn() |
Modifier and Type | Method and Description |
---|---|
int |
Cut.compareTo(Cut<C> that) |
int |
Cut.BelowAll.compareTo(Cut<java.lang.Comparable<?>> o) |
int |
Cut.AboveAll.compareTo(Cut<java.lang.Comparable<?>> o) |
(package private) static <C extends java.lang.Comparable<?>> |
Range.create(Cut<C> lowerBound,
Cut<C> upperBound) |
(package private) static <C extends java.lang.Comparable<?>> |
Range.create(Cut<C> lowerBound,
Cut<C> upperBound) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.headMap(Cut<C> toKey,
boolean inclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.headMap(Cut<C> toKey,
boolean inclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.headMap(Cut<C> toKey,
boolean inclusive) |
private void |
TreeRangeMap.putRangeMapEntry(Cut<K> lowerBound,
Cut<K> upperBound,
V value) |
private void |
TreeRangeMap.putRangeMapEntry(Cut<K> lowerBound,
Cut<K> upperBound,
V value) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.subMap(Cut<C> fromKey,
boolean fromInclusive,
Cut<C> toKey,
boolean toInclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.tailMap(Cut<C> fromKey,
boolean inclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.tailMap(Cut<C> fromKey,
boolean inclusive) |
java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.tailMap(Cut<C> fromKey,
boolean inclusive) |
private static java.lang.String |
Range.toString(Cut<?> lowerBound,
Cut<?> upperBound) |
private static java.lang.String |
Range.toString(Cut<?> lowerBound,
Cut<?> upperBound) |
Modifier and Type | Method and Description |
---|---|
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.RangesByUpperBound.subMap(Range<Cut<C>> window) |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.ComplementRangesByLowerBound.subMap(Range<Cut<C>> subWindow) |
private java.util.NavigableMap<Cut<C>,Range<C>> |
TreeRangeSet.SubRangeSetRangesByLowerBound.subMap(Range<Cut<C>> window) |
Constructor and Description |
---|
Range(Cut<C> lowerBound,
Cut<C> upperBound) |
Range(Cut<C> lowerBound,
Cut<C> upperBound) |
RangeMapEntry(Cut<K> lowerBound,
Cut<K> upperBound,
V value) |
RangeMapEntry(Cut<K> lowerBound,
Cut<K> upperBound,
V value) |
Constructor and Description |
---|
ComplementRangesByLowerBound(java.util.NavigableMap<Cut<C>,Range<C>> positiveRangesByLowerBound) |
ComplementRangesByLowerBound(java.util.NavigableMap<Cut<C>,Range<C>> positiveRangesByLowerBound,
Range<Cut<C>> window) |
ComplementRangesByLowerBound(java.util.NavigableMap<Cut<C>,Range<C>> positiveRangesByLowerBound,
Range<Cut<C>> window) |
RangesByUpperBound(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound) |
RangesByUpperBound(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound,
Range<Cut<C>> upperBoundWindow) |
RangesByUpperBound(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound,
Range<Cut<C>> upperBoundWindow) |
SubRangeSetRangesByLowerBound(Range<Cut<C>> lowerBoundWindow,
Range<C> restriction,
java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound) |
SubRangeSetRangesByLowerBound(Range<Cut<C>> lowerBoundWindow,
Range<C> restriction,
java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound) |
TreeRangeSet(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerCut) |