public abstract class AbstractTreeMap extends java.lang.Object implements IntSortedMap
Modifier and Type | Class and Description |
---|---|
static class |
AbstractTreeMap.Entry |
protected class |
AbstractTreeMap.EntryIterator |
protected class |
AbstractTreeMap.KeyIterator |
protected class |
AbstractTreeMap.ValueIterator |
Modifier and Type | Field and Description |
---|---|
protected boolean |
allowDuplicates |
protected static boolean |
BLACK |
protected LiteralComparator |
cmp |
protected int |
lastOrder |
protected int |
modCount |
protected static AbstractTreeMap.Entry |
NIL |
protected static boolean |
RED |
protected AbstractTreeMap.Entry |
root |
protected int |
size |
protected int |
unique |
Constructor and Description |
---|
AbstractTreeMap(LiteralComparator comparator,
boolean allowDuplicates) |
protected static final boolean RED
protected static final boolean BLACK
protected static final AbstractTreeMap.Entry NIL
protected LiteralComparator cmp
protected AbstractTreeMap.Entry root
protected boolean allowDuplicates
protected int size
protected int unique
protected int modCount
protected int lastOrder
public AbstractTreeMap(LiteralComparator comparator, boolean allowDuplicates)
public boolean isAllowDuplicates()
isAllowDuplicates
in interface IntSortedMap
public int size()
size
in interface IntSortedMap
Map.size()
public boolean isEmpty()
isEmpty
in interface IntSortedMap
public java.util.Comparator comparator()
comparator
in interface IntSortedMap
SortedMap.comparator()
public void clear()
clear
in interface IntSortedMap
Map.clear()
public int getMinimum()
getMinimum
in interface IntSortedMap
public int getMaximum()
getMaximum
in interface IntSortedMap
public int getMedian()
getMedian
in interface IntSortedMap
public int getUniqueCount()
getUniqueCount
in interface IntSortedMap
public boolean containsValue(int value)
containsValue
in interface IntSortedMap
Map.containsValue(java.lang.Object)
public IntIterator valueIterator(boolean ascend)
valueIterator
in interface IntSortedMap
protected void incrementSize(boolean isUnique)
protected void decrementSize(boolean isUnique)
protected abstract int compare(AbstractTreeMap.Entry e1, AbstractTreeMap.Entry e2)
protected AbstractTreeMap.Entry find(AbstractTreeMap.Entry x)
protected AbstractTreeMap.Entry findPredecessor(AbstractTreeMap.Entry x)
protected AbstractTreeMap.Entry findCeiling(AbstractTreeMap.Entry x)
protected AbstractTreeMap.Entry minimum(AbstractTreeMap.Entry x)
protected AbstractTreeMap.Entry maximum(AbstractTreeMap.Entry x)
protected AbstractTreeMap.Entry successor(AbstractTreeMap.Entry x)
protected AbstractTreeMap.Entry predecessor(AbstractTreeMap.Entry x)
protected void rotateLeft(AbstractTreeMap.Entry x)
protected void rotateRight(AbstractTreeMap.Entry x)
protected void fixUpInsert(AbstractTreeMap.Entry x)
protected void fixUpRemove(AbstractTreeMap.Entry x)
protected void remove(AbstractTreeMap.Entry z)
Copyright ? 2013 Regents of the University of California