|
Drools :: Core 6.1.0.Beta1 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.drools.core.util.RightTupleRBTree<K>
public class RightTupleRBTree<K extends Comparable<? super K>>
| Nested Class Summary | |
|---|---|
static class |
RightTupleRBTree.Boundary
|
static class |
RightTupleRBTree.Color
|
static class |
RightTupleRBTree.Node<K extends Comparable<? super K>>
|
static class |
RightTupleRBTree.RangeFastIterator<K extends Comparable<? super K>>
|
| Field Summary | |
|---|---|
RightTupleRBTree.Node<K> |
root
|
static boolean |
VERIFY_RBTREE
|
| Constructor Summary | |
|---|---|
RightTupleRBTree()
|
|
| Method Summary | |
|---|---|
void |
delete(K key)
|
FastIterator |
fastIterator()
|
RightTupleRBTree.Node<K> |
findNearestNode(K key,
boolean allowEqual,
RightTupleRBTree.Boundary boundary)
|
RightTupleRBTree.Node<K> |
first()
|
RightTupleRBTree.Node<K> |
insert(K key)
|
boolean |
isEmpty()
|
RightTupleRBTree.Node<K> |
last()
|
RightTupleRBTree.Node<K> |
lookup(K key)
|
void |
print()
|
FastIterator |
range(K lowerBound,
boolean testLowerEqual,
K upperBound,
boolean testUpperEqual)
|
void |
rangeLowerBounded(K upperBound,
boolean testUpperEqual)
|
void |
rangeUperBounded(K upperBound,
boolean testUpperEqual)
|
String |
toString()
|
void |
verifyProperties()
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
public static final boolean VERIFY_RBTREE
public RightTupleRBTree.Node<K extends Comparable<? super K>> root
| Constructor Detail |
|---|
public RightTupleRBTree()
| Method Detail |
|---|
public void verifyProperties()
public RightTupleRBTree.Node<K> lookup(K key)
public boolean isEmpty()
public RightTupleRBTree.Node<K> first()
public RightTupleRBTree.Node<K> last()
public FastIterator fastIterator()
public String toString()
toString in class Object
public FastIterator range(K lowerBound,
boolean testLowerEqual,
K upperBound,
boolean testUpperEqual)
public void rangeUperBounded(K upperBound,
boolean testUpperEqual)
public void rangeLowerBounded(K upperBound,
boolean testUpperEqual)
public RightTupleRBTree.Node<K> findNearestNode(K key,
boolean allowEqual,
RightTupleRBTree.Boundary boundary)
public RightTupleRBTree.Node<K> insert(K key)
public void delete(K key)
public void print()
|
Drools :: Core 6.1.0.Beta1 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||