|
Drools :: Core 6.0.0.Beta5 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.drools.core.util.LeftTupleRBTree<K>
public class LeftTupleRBTree<K extends Comparable<? super K>>
| Nested Class Summary | |
|---|---|
static class |
LeftTupleRBTree.Boundary
|
static class |
LeftTupleRBTree.Color
|
static class |
LeftTupleRBTree.Node<K extends Comparable<? super K>>
|
static class |
LeftTupleRBTree.RangeFastIterator<K extends Comparable<? super K>>
|
| Field Summary | |
|---|---|
LeftTupleRBTree.Node<K> |
root
|
static boolean |
VERIFY_RBTREE
|
| Constructor Summary | |
|---|---|
LeftTupleRBTree()
|
|
| Method Summary | |
|---|---|
void |
delete(K key)
|
FastIterator |
fastIterator()
|
LeftTupleRBTree.Node<K> |
findNearestNode(K key,
boolean allowEqual,
LeftTupleRBTree.Boundary boundary)
|
LeftTupleRBTree.Node<K> |
first()
|
LeftTupleRBTree.Node<K> |
insert(K key)
|
boolean |
isEmpty()
|
LeftTupleRBTree.Node<K> |
last()
|
LeftTupleRBTree.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 LeftTupleRBTree.Node<K extends Comparable<? super K>> root
| Constructor Detail |
|---|
public LeftTupleRBTree()
| Method Detail |
|---|
public void verifyProperties()
public LeftTupleRBTree.Node<K> lookup(K key)
public boolean isEmpty()
public LeftTupleRBTree.Node<K> first()
public LeftTupleRBTree.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 LeftTupleRBTree.Node<K> findNearestNode(K key,
boolean allowEqual,
LeftTupleRBTree.Boundary boundary)
public LeftTupleRBTree.Node<K> insert(K key)
public void delete(K key)
public void print()
|
Drools :: Core 6.0.0.Beta5 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||