public class DoubleIntTreeMap extends AbstractTreeMap implements DoubleIntSortedMap
AbstractTreeMap.Entry, AbstractTreeMap.EntryIterator, AbstractTreeMap.ValueIterator
Constructor and Description |
---|
DoubleIntTreeMap() |
DoubleIntTreeMap(boolean allowDuplicates) |
DoubleIntTreeMap(LiteralComparator comparator) |
DoubleIntTreeMap(LiteralComparator comparator,
boolean allowDuplicates) |
Modifier and Type | Method and Description |
---|---|
void |
clear() |
protected int |
compare(AbstractTreeMap.Entry e1,
AbstractTreeMap.Entry e2) |
boolean |
containsKey(double key) |
double |
firstKey() |
int |
get(double key) |
LiteralIterator |
keyIterator() |
LiteralIterator |
keyRangeIterator(double fromKey,
boolean fromInc,
double toKey,
boolean toInc) |
double |
lastKey() |
int |
put(double key,
int value) |
int |
remove(double key) |
int |
remove(double key,
int val) |
IntIterator |
valueRangeIterator(double fromKey,
boolean fromInc,
double 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 DoubleIntTreeMap()
public DoubleIntTreeMap(boolean allowDuplicates)
public DoubleIntTreeMap(LiteralComparator comparator)
public DoubleIntTreeMap(LiteralComparator comparator, boolean allowDuplicates)
public void clear()
clear
in interface IntSortedMap
clear
in class AbstractTreeMap
Map.clear()
public boolean containsKey(double key)
containsKey
in interface DoubleIntSortedMap
Map.containsKey(java.lang.Object)
public int get(double key)
get
in interface DoubleIntSortedMap
Map.get(java.lang.Object)
public int put(double key, int value)
put
in interface DoubleIntSortedMap
Map.put(java.lang.Object, java.lang.Object)
public int remove(double key)
remove
in interface DoubleIntSortedMap
Map.remove(java.lang.Object)
public int remove(double key, int val)
remove
in interface DoubleIntSortedMap
public double firstKey()
firstKey
in interface DoubleIntSortedMap
SortedMap.firstKey()
public double lastKey()
lastKey
in interface DoubleIntSortedMap
SortedMap.lastKey()
public LiteralIterator keyIterator()
keyIterator
in interface DoubleIntSortedMap
public LiteralIterator keyRangeIterator(double fromKey, boolean fromInc, double toKey, boolean toInc)
keyRangeIterator
in interface DoubleIntSortedMap
public IntIterator valueRangeIterator(double fromKey, boolean fromInc, double toKey, boolean toInc)
valueRangeIterator
in interface DoubleIntSortedMap
protected int compare(AbstractTreeMap.Entry e1, AbstractTreeMap.Entry e2)
compare
in class AbstractTreeMap
Copyright ? 2013 Regents of the University of California