public abstract class CellFlatMap
extends java.lang.Object
implements java.util.NavigableMap<Cell,Cell>
| Modifier and Type | Field and Description |
|---|---|
protected int |
maxCellIdx |
protected int |
minCellIdx |
| Constructor and Description |
|---|
CellFlatMap(java.util.Comparator<? super Cell> comparator,
int min,
int max,
boolean d) |
| Modifier and Type | Method and Description |
|---|---|
java.util.Map.Entry<Cell,Cell> |
ceilingEntry(Cell k) |
Cell |
ceilingKey(Cell k) |
void |
clear() |
java.util.Comparator<? super Cell> |
comparator() |
boolean |
containsKey(java.lang.Object o) |
boolean |
containsValue(java.lang.Object o) |
protected abstract CellFlatMap |
createSubCellFlatMap(int min,
int max,
boolean descending) |
java.util.NavigableSet<Cell> |
descendingKeySet() |
java.util.NavigableMap<Cell,Cell> |
descendingMap() |
java.util.Set<java.util.Map.Entry<Cell,Cell>> |
entrySet() |
java.util.Map.Entry<Cell,Cell> |
firstEntry() |
Cell |
firstKey() |
java.util.Map.Entry<Cell,Cell> |
floorEntry(Cell k) |
Cell |
floorKey(Cell k) |
Cell |
get(java.lang.Object o) |
protected abstract Cell |
getCell(int i) |
java.util.NavigableMap<Cell,Cell> |
headMap(Cell k) |
java.util.NavigableMap<Cell,Cell> |
headMap(Cell toKey,
boolean inclusive) |
java.util.Map.Entry<Cell,Cell> |
higherEntry(Cell k) |
Cell |
higherKey(Cell k) |
boolean |
isEmpty() |
java.util.NavigableSet<Cell> |
keySet() |
java.util.Map.Entry<Cell,Cell> |
lastEntry() |
Cell |
lastKey() |
java.util.Map.Entry<Cell,Cell> |
lowerEntry(Cell k) |
Cell |
lowerKey(Cell k) |
java.util.NavigableSet<Cell> |
navigableKeySet() |
java.util.Map.Entry<Cell,Cell> |
pollFirstEntry() |
java.util.Map.Entry<Cell,Cell> |
pollLastEntry() |
Cell |
put(Cell k,
Cell v) |
void |
putAll(java.util.Map<? extends Cell,? extends Cell> map) |
Cell |
remove(java.lang.Object o) |
int |
size() |
java.util.NavigableMap<Cell,Cell> |
subMap(Cell fromKey,
boolean fromInclusive,
Cell toKey,
boolean toInclusive) |
java.util.NavigableMap<Cell,Cell> |
subMap(Cell k1,
Cell k2) |
java.util.NavigableMap<Cell,Cell> |
tailMap(Cell k) |
java.util.NavigableMap<Cell,Cell> |
tailMap(Cell fromKey,
boolean inclusive) |
java.util.Collection<Cell> |
values() |
public CellFlatMap(java.util.Comparator<? super Cell> comparator,
int min,
int max,
boolean d)
protected abstract CellFlatMap createSubCellFlatMap(int min, int max, boolean descending)
protected abstract Cell getCell(int i)
public java.util.Comparator<? super Cell> comparator()
comparator in interface java.util.SortedMap<Cell,Cell>public int size()
size in interface java.util.Map<Cell,Cell>public boolean isEmpty()
isEmpty in interface java.util.Map<Cell,Cell>public java.util.NavigableMap<Cell,Cell> subMap(Cell fromKey,
boolean fromInclusive,
Cell toKey,
boolean toInclusive)
subMap in interface java.util.NavigableMap<Cell,Cell>public java.util.NavigableMap<Cell,Cell> headMap(Cell toKey,
boolean inclusive)
headMap in interface java.util.NavigableMap<Cell,Cell>public java.util.NavigableMap<Cell,Cell> tailMap(Cell fromKey,
boolean inclusive)
tailMap in interface java.util.NavigableMap<Cell,Cell>public java.util.NavigableMap<Cell,Cell> descendingMap()
descendingMap in interface java.util.NavigableMap<Cell,Cell>public java.util.NavigableMap<Cell,Cell> subMap(Cell k1,
Cell k2)
subMap in interface java.util.NavigableMap<Cell,Cell>subMap in interface java.util.SortedMap<Cell,Cell>public java.util.NavigableMap<Cell,Cell> headMap(Cell k)
headMap in interface java.util.NavigableMap<Cell,Cell>headMap in interface java.util.SortedMap<Cell,Cell>public java.util.NavigableMap<Cell,Cell> tailMap(Cell k)
tailMap in interface java.util.NavigableMap<Cell,Cell>tailMap in interface java.util.SortedMap<Cell,Cell>public Cell firstKey()
firstKey in interface java.util.SortedMap<Cell,Cell>public Cell lastKey()
lastKey in interface java.util.SortedMap<Cell,Cell>public Cell lowerKey(Cell k)
lowerKey in interface java.util.NavigableMap<Cell,Cell>public Cell floorKey(Cell k)
floorKey in interface java.util.NavigableMap<Cell,Cell>public Cell ceilingKey(Cell k)
ceilingKey in interface java.util.NavigableMap<Cell,Cell>public Cell higherKey(Cell k)
higherKey in interface java.util.NavigableMap<Cell,Cell>public boolean containsKey(java.lang.Object o)
containsKey in interface java.util.Map<Cell,Cell>public boolean containsValue(java.lang.Object o)
containsValue in interface java.util.Map<Cell,Cell>public Cell get(java.lang.Object o)
get in interface java.util.Map<Cell,Cell>public java.util.Map.Entry<Cell,Cell> lowerEntry(Cell k)
lowerEntry in interface java.util.NavigableMap<Cell,Cell>public java.util.Map.Entry<Cell,Cell> higherEntry(Cell k)
higherEntry in interface java.util.NavigableMap<Cell,Cell>public java.util.Map.Entry<Cell,Cell> ceilingEntry(Cell k)
ceilingEntry in interface java.util.NavigableMap<Cell,Cell>public java.util.Map.Entry<Cell,Cell> floorEntry(Cell k)
floorEntry in interface java.util.NavigableMap<Cell,Cell>public java.util.Map.Entry<Cell,Cell> firstEntry()
firstEntry in interface java.util.NavigableMap<Cell,Cell>public java.util.Map.Entry<Cell,Cell> lastEntry()
lastEntry in interface java.util.NavigableMap<Cell,Cell>public java.util.Map.Entry<Cell,Cell> pollFirstEntry()
pollFirstEntry in interface java.util.NavigableMap<Cell,Cell>public java.util.Map.Entry<Cell,Cell> pollLastEntry()
pollLastEntry in interface java.util.NavigableMap<Cell,Cell>public Cell put(Cell k,
Cell v)
put in interface java.util.Map<Cell,Cell>public void clear()
clear in interface java.util.Map<Cell,Cell>public Cell remove(java.lang.Object o)
remove in interface java.util.Map<Cell,Cell>public void putAll(java.util.Map<? extends Cell,? extends Cell> map)
putAll in interface java.util.Map<Cell,Cell>public java.util.NavigableSet<Cell> navigableKeySet()
navigableKeySet in interface java.util.NavigableMap<Cell,Cell>public java.util.NavigableSet<Cell> descendingKeySet()
descendingKeySet in interface java.util.NavigableMap<Cell,Cell>public java.util.NavigableSet<Cell> keySet()
keySet in interface java.util.Map<Cell,Cell>keySet in interface java.util.SortedMap<Cell,Cell>public java.util.Collection<Cell> values()
values in interface java.util.Map<Cell,Cell>values in interface java.util.SortedMap<Cell,Cell>public java.util.Set<java.util.Map.Entry<Cell,Cell>> entrySet()
entrySet in interface java.util.Map<Cell,Cell>entrySet in interface java.util.SortedMap<Cell,Cell>