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

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

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

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)
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 RightTupleRBTree.Node<K extends Comparable<? super K>> root

Constructor Detail

RightTupleRBTree

public RightTupleRBTree()

Method Detail

verifyProperties

public void verifyProperties()

lookup

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

isEmpty

public boolean isEmpty()

first

public RightTupleRBTree.Node<K> first()

last

public RightTupleRBTree.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 RightTupleRBTree.Node<K> findNearestNode(K key,
                                                boolean allowEqual,
                                                RightTupleRBTree.Boundary boundary)

insert

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

delete

public void delete(K key)

print

public void print()