public class IntIntTreeMap extends AbstractTreeMap implements IntIntSortedMap
AbstractTreeMap.Entry, AbstractTreeMap.EntryIterator, AbstractTreeMap.ValueIterator| Constructor and Description |
|---|
IntIntTreeMap() |
IntIntTreeMap(boolean allowDuplicates) |
IntIntTreeMap(LiteralComparator comparator) |
IntIntTreeMap(LiteralComparator comparator,
boolean allowDuplicates) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
protected int |
compare(AbstractTreeMap.Entry e1,
AbstractTreeMap.Entry e2) |
boolean |
containsKey(int key) |
int |
firstKey() |
int |
get(int key) |
int |
getLast(int key) |
int |
getNextValue(int key,
int value) |
int |
getPreviousValue(int key,
int value) |
LiteralIterator |
keyIterator() |
LiteralIterator |
keyRangeIterator(int fromKey,
boolean fromInc,
int toKey,
boolean toInc) |
int |
lastKey() |
int |
put(int key,
int value) |
int |
remove(int key) |
int |
remove(int key,
int val) |
IntIterator |
valueRangeIterator(int fromKey,
boolean fromInc,
int toKey,
boolean toInc) |
comparator, containsValue, decrementSize, find, findCeiling, findPredecessor, fixUpInsert, fixUpRemove, getMaximum, getMedian, getMinimum, getUniqueCount, incrementSize, isAllowDuplicates, isEmpty, maximum, minimum, predecessor, remove, rotateLeft, rotateRight, size, successor, valueIteratorclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitcomparator, containsValue, getMaximum, getMedian, getMinimum, getUniqueCount, isAllowDuplicates, isEmpty, size, valueIteratorpublic IntIntTreeMap()
public IntIntTreeMap(boolean allowDuplicates)
public IntIntTreeMap(LiteralComparator comparator)
public IntIntTreeMap(LiteralComparator comparator, boolean allowDuplicates)
public void clear()
clear in interface IntSortedMapclear in class AbstractTreeMapMap.clear()public boolean containsKey(int key)
containsKey in interface IntIntSortedMapMap.containsKey(java.lang.Object)public int get(int key)
get in interface IntIntSortedMapMap.get(java.lang.Object)public int put(int key,
int value)
put in interface IntIntSortedMapMap.put(java.lang.Object, java.lang.Object)public int remove(int key)
remove in interface IntIntSortedMapMap.remove(java.lang.Object)public int remove(int key,
int val)
remove in interface IntIntSortedMappublic int getLast(int key)
getLast in interface IntIntSortedMappublic int getPreviousValue(int key,
int value)
getPreviousValue in interface IntIntSortedMappublic int getNextValue(int key,
int value)
getNextValue in interface IntIntSortedMappublic int firstKey()
firstKey in interface IntIntSortedMapSortedMap.firstKey()public int lastKey()
lastKey in interface IntIntSortedMapSortedMap.lastKey()public LiteralIterator keyIterator()
keyIterator in interface IntIntSortedMappublic LiteralIterator keyRangeIterator(int fromKey, boolean fromInc, int toKey, boolean toInc)
keyRangeIterator in interface IntIntSortedMappublic IntIterator valueRangeIterator(int fromKey, boolean fromInc, int toKey, boolean toInc)
valueRangeIterator in interface IntIntSortedMapprotected int compare(AbstractTreeMap.Entry e1, AbstractTreeMap.Entry e2)
compare in class AbstractTreeMap