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, valueIterator
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
comparator, containsValue, getMaximum, getMedian, getMinimum, getUniqueCount, isAllowDuplicates, isEmpty, size, valueIterator
public IntIntTreeMap()
public IntIntTreeMap(boolean allowDuplicates)
public IntIntTreeMap(LiteralComparator comparator)
public IntIntTreeMap(LiteralComparator comparator, boolean allowDuplicates)
public void clear()
clear
in interface IntSortedMap
clear
in class AbstractTreeMap
Map.clear()
public boolean containsKey(int key)
containsKey
in interface IntIntSortedMap
Map.containsKey(java.lang.Object)
public int get(int key)
get
in interface IntIntSortedMap
Map.get(java.lang.Object)
public int put(int key, int value)
put
in interface IntIntSortedMap
Map.put(java.lang.Object, java.lang.Object)
public int remove(int key)
remove
in interface IntIntSortedMap
Map.remove(java.lang.Object)
public int remove(int key, int val)
remove
in interface IntIntSortedMap
public int getLast(int key)
getLast
in interface IntIntSortedMap
public int getPreviousValue(int key, int value)
getPreviousValue
in interface IntIntSortedMap
public int getNextValue(int key, int value)
getNextValue
in interface IntIntSortedMap
public int firstKey()
firstKey
in interface IntIntSortedMap
SortedMap.firstKey()
public int lastKey()
lastKey
in interface IntIntSortedMap
SortedMap.lastKey()
public LiteralIterator keyIterator()
keyIterator
in interface IntIntSortedMap
public LiteralIterator keyRangeIterator(int fromKey, boolean fromInc, int toKey, boolean toInc)
keyRangeIterator
in interface IntIntSortedMap
public IntIterator valueRangeIterator(int fromKey, boolean fromInc, int toKey, boolean toInc)
valueRangeIterator
in interface IntIntSortedMap
protected int compare(AbstractTreeMap.Entry e1, AbstractTreeMap.Entry e2)
compare
in class AbstractTreeMap
Copyright ? 2013 Regents of the University of California