public class CompIntArrayRBT extends IntArrayRBT
black, color, default_size, greatestNode, key, left, NIL, parent, rand, red, right, root| Constructor and Description |
|---|
CompIntArrayRBT(IntComparator comp) |
CompIntArrayRBT(IntComparator comp,
int initialSize)
Constructor for CompIntArrayRBT.
|
| Modifier and Type | Method and Description |
|---|---|
int |
findInsertionPoint(int k)
Find the node such that key[node] >= k and key[previous(node)] < k.
|
int |
findKey(int k)
Find the first node such that k <= key[node].
|
protected int |
treeInsert(int k) |
protected int |
treeInsertWithDups(int k) |
containsKey, deleteKey, findInsertionPointNoDups, flush, getKeyForNode, insertKey, insertKeyWithDups, iterator, iterator, main, maxDepth, minDepth, newNode, nextNode, nodeDepth, pointerIterator, pointerIterator, pointerIterator, printKeys, satisfiesRedBlackProperties, sizepublic CompIntArrayRBT(IntComparator comp)
public CompIntArrayRBT(IntComparator comp, int initialSize)
initialSize - protected int treeInsert(int k)
treeInsert in class IntArrayRBTprotected int treeInsertWithDups(int k)
treeInsertWithDups in class IntArrayRBTpublic int findKey(int k)
IntArrayRBTfindKey in class IntArrayRBTpublic int findInsertionPoint(int k)
IntArrayRBTfindInsertionPoint in class IntArrayRBTCopyright © 2013. All Rights Reserved.