public class CompIntArrayRBT extends IntArrayRBT
randblack, color, default_size, greatestNode, growth_factor, initialSize, key, klrp, klrp1, klrp2, klrp3, left, MAXklrp0, MAXklrpMask, multiplication_limit, next, NIL, parent, red, right, root, size, useklrp| 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) |
add, addAdded, deleteKey, getKeyForNode, insertKey, insertKeyWithDups, iterator, iterator, pointerIterator, pointerIterator, pointerIteratorcontains, containsKey, deleteFixup, deleteNode, ensureArrayCapacity, ensureCapacity, ensureCapacityKlrp, findInsertionPointNoDups, findKeyDown, flush, getFirstNode, getKey, getLeft, getParent, getRight, getXXX, initVars, leftRotate, maxDepth, maxDepth, minDepth, minDepth, newNode, nextNode, nextPowerOf2, nodeDepth, nodeDepth, previousNode, printKeys, printKeys, rightRotate, satisfiesRBProps, satisfiesRedBlackProperties, setAsRoot, setKey, setLeft, setParent, setRight, setupArrays, setXXX, 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 IntArrayRBTk - the keyCopyright © 2014. All rights reserved.