org.apache.uima.internal.util.rb_trees
Class CompIntArrayRBT
java.lang.Object
org.apache.uima.internal.util.rb_trees.IntArrayRBT
org.apache.uima.internal.util.rb_trees.CompIntArrayRBT
public class CompIntArrayRBT
- extends IntArrayRBT
Class comment for CompIntArrayRBT.java goes here.
Fields inherited from class org.apache.uima.internal.util.rb_trees.IntArrayRBT |
black, color, default_size, greatestNode, key, left, NIL, parent, rand, red, right, root |
Methods inherited from class org.apache.uima.internal.util.rb_trees.IntArrayRBT |
containsKey, deleteKey, findInsertionPointNoDups, flush, getKeyForNode, insertKey, insertKeyWithDups, iterator, iterator, main, maxDepth, minDepth, newNode, nextNode, nodeDepth, pointerIterator, pointerIterator, pointerIterator, printKeys, satisfiesRedBlackProperties, size |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
CompIntArrayRBT
public CompIntArrayRBT(IntComparator comp)
CompIntArrayRBT
public CompIntArrayRBT(IntComparator comp,
int initialSize)
- Constructor for CompIntArrayRBT.
- Parameters:
initialSize
-
treeInsert
protected int treeInsert(int k)
- Overrides:
treeInsert
in class IntArrayRBT
treeInsertWithDups
protected int treeInsertWithDups(int k)
- Overrides:
treeInsertWithDups
in class IntArrayRBT
findKey
public int findKey(int k)
- Description copied from class:
IntArrayRBT
- Find the first node such that k <= key[node].
- Overrides:
findKey
in class IntArrayRBT
findInsertionPoint
public int findInsertionPoint(int k)
- Description copied from class:
IntArrayRBT
- Find the node such that key[node] >= k and key[previous(node)] < k.
- Overrides:
findInsertionPoint
in class IntArrayRBT
Copyright © 2011. All Rights Reserved.