org.drools.core.util
Class LeftTupleRBTree<K extends Comparable<? super K>>

java.lang.Object
  org.drools.core.util.LeftTupleRBTree<K>

public class LeftTupleRBTree<K extends Comparable<? super K>>
extends Object

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)
void	verifyProperties()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

VERIFY_RBTREE

public static final boolean VERIFY_RBTREE

See Also:

Constant Field Values

root

public LeftTupleRBTree.Node<K extends Comparable<? super K>> root

Constructor Detail

LeftTupleRBTree

public LeftTupleRBTree()

Method Detail

verifyProperties

public void verifyProperties()

lookup

public LeftTupleRBTree.Node<K> lookup(K key)

isEmpty

public boolean isEmpty()

first

public LeftTupleRBTree.Node<K> first()

last

public LeftTupleRBTree.Node<K> last()

fastIterator

public FastIterator fastIterator()

range

public FastIterator range(K lowerBound,
                          boolean testLowerEqual,
                          K upperBound,
                          boolean testUpperEqual)

rangeUperBounded

public void rangeUperBounded(K upperBound,
                             boolean testUpperEqual)

rangeLowerBounded

public void rangeLowerBounded(K upperBound,
                              boolean testUpperEqual)

findNearestNode

public LeftTupleRBTree.Node<K> findNearestNode(K key,
                                               boolean allowEqual,
                                               LeftTupleRBTree.Boundary boundary)

insert

public LeftTupleRBTree.Node<K> insert(K key)

delete

public void delete(K key)

print

public void print()