private class TreeBasedTable.TreeRow extends StandardTable.Row implements java.util.SortedMap<C,V>
Modifier and Type | Field and Description |
---|---|
(package private) C |
lowerBound |
(package private) C |
upperBound |
(package private) java.util.SortedMap<C,V> |
wholeRow |
backingRowMap, rowKey
Constructor and Description |
---|
TreeRow(R rowKey) |
TreeRow(R rowKey,
C lowerBound,
C upperBound) |
Modifier and Type | Method and Description |
---|---|
(package private) java.util.SortedMap<C,V> |
backingRowMap() |
java.util.Comparator<? super C> |
comparator() |
(package private) int |
compare(java.lang.Object a,
java.lang.Object b) |
(package private) java.util.SortedMap<C,V> |
computeBackingRowMap() |
boolean |
containsKey(java.lang.Object key) |
C |
firstKey() |
java.util.SortedMap<C,V> |
headMap(C toKey) |
java.util.SortedSet<C> |
keySet() |
C |
lastKey() |
(package private) void |
maintainEmptyInvariant() |
V |
put(C key,
V value) |
(package private) boolean |
rangeContains(java.lang.Object o) |
java.util.SortedMap<C,V> |
subMap(C fromKey,
C toKey) |
java.util.SortedMap<C,V> |
tailMap(C fromKey) |
(package private) java.util.SortedMap<C,V> |
wholeRow() |
clear, createEntrySet, get, remove
createKeySet, createValues, entrySet, values
clone, containsValue, equals, hashCode, isEmpty, putAll, size, toString
TreeRow(R rowKey)
public java.util.SortedSet<C> keySet()
public java.util.Comparator<? super C> comparator()
int compare(java.lang.Object a, java.lang.Object b)
boolean rangeContains(@Nullable java.lang.Object o)
java.util.SortedMap<C,V> backingRowMap()
backingRowMap
in class StandardTable.Row
java.util.SortedMap<C,V> computeBackingRowMap()
computeBackingRowMap
in class StandardTable.Row
void maintainEmptyInvariant()
maintainEmptyInvariant
in class StandardTable.Row
public boolean containsKey(java.lang.Object key)
containsKey
in interface java.util.Map<C,V>
containsKey
in class StandardTable.Row