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, size
public CompIntArrayRBT(IntComparator comp)
public CompIntArrayRBT(IntComparator comp, int initialSize)
initialSize
- protected int treeInsert(int k)
treeInsert
in class IntArrayRBT
protected int treeInsertWithDups(int k)
treeInsertWithDups
in class IntArrayRBT
public int findKey(int k)
IntArrayRBT
findKey
in class IntArrayRBT
public int findInsertionPoint(int k)
IntArrayRBT
findInsertionPoint
in class IntArrayRBT
Copyright © 2012. All Rights Reserved.