Package org.drools.core.util.index

Class TupleIndexRBTree

java.lang.Object

org.drools.core.util.index.AbstractTupleIndexTree

org.drools.core.util.index.TupleIndexRBTree

All Implemented Interfaces:

java.io.Externalizable, java.io.Serializable, TupleMemory

public class TupleIndexRBTree
extends AbstractTupleIndexTree
implements java.io.Externalizable, TupleMemory

See Also:

Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
class	TupleIndexRBTree.TupleFastIterator

Nested classes/interfaces inherited from class org.drools.core.util.index.AbstractTupleIndexTree

AbstractTupleIndexTree.IndexTupleList

Nested classes/interfaces inherited from interface org.drools.core.reteoo.TupleMemory

TupleMemory.IndexType

Field Summary

Fields inherited from class org.drools.core.util.index.AbstractTupleIndexTree

constraintType, factSize, index, left

Constructor Summary

Constructors

Constructor	Description
TupleIndexRBTree()
TupleIndexRBTree(IndexUtil.ConstraintType constraintType, AbstractHashTable.FieldIndex index, boolean left)

Method Summary

Modifier and Type	Method	Description
void	add(Tuple tuple)
void	clear()
static java.lang.Comparable	coerceType(AbstractHashTable.FieldIndex index, java.lang.Comparable treeRootKey, java.lang.Comparable key)
FastIterator<Tuple>	fastIterator()
FastIterator<Tuple>	fullFastIterator()	Iterates the entire data structure, regardless of whether TupleMemory is hashed or not.
FastIterator<Tuple>	fullFastIterator(Tuple leftTuple)	Iterator that resumes from the current RightTuple, regardless of whether the TupleMemory is hashed or not
Tuple	getFirst(Tuple rightTuple)	The FactHandle is always the context fact and is necessary when the object being modified is in the both left and right node memories.
TupleMemory.IndexType	getIndexType()
Iterator<Tuple>	iterator()
void	readExternal(java.io.ObjectInput in)
void	remove(Tuple tuple)
void	removeAdd(Tuple tuple)
int	size()
Tuple[]	toArray()
void	writeExternal(java.io.ObjectOutput out)

Methods inherited from class org.drools.core.util.index.AbstractTupleIndexTree

getIndexedValue, getLeftIndexedValue, getRightIndexedValue, isIndexed

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.drools.core.reteoo.TupleMemory

getIndex, isIndexed

Constructor Detail

TupleIndexRBTree

public TupleIndexRBTree()

TupleIndexRBTree

public TupleIndexRBTree(IndexUtil.ConstraintType constraintType,
                        AbstractHashTable.FieldIndex index,
                        boolean left)

Method Detail

writeExternal

public void writeExternal(java.io.ObjectOutput out)
                   throws java.io.IOException

Specified by:

writeExternal in interface java.io.Externalizable

Throws:

java.io.IOException

readExternal

public void readExternal(java.io.ObjectInput in)
                  throws java.io.IOException,
                         java.lang.ClassNotFoundException

Specified by:

readExternal in interface java.io.Externalizable

Throws:

java.io.IOException

java.lang.ClassNotFoundException

add

public void add(Tuple tuple)

Specified by:

add in interface TupleMemory

remove

public void remove(Tuple tuple)

Specified by:

remove in interface TupleMemory

removeAdd

public void removeAdd(Tuple tuple)

Specified by:

removeAdd in interface TupleMemory

size

public int size()

Specified by:

size in interface TupleMemory

toArray

public Tuple[] toArray()

Specified by:

toArray in interface TupleMemory

getFirst

public Tuple getFirst(Tuple rightTuple)

Description copied from interface: TupleMemory

The FactHandle is always the context fact and is necessary when the object being modified is in the both left and right node memories. This is because the memory on the opposite side would not have yet memory.removeAdd the fact, so it could potentially be in the wrong bucket. So the bucket matches check always checks to ignore the first facthandle if it's the same as the context fact.

Specified by:

getFirst in interface TupleMemory

iterator

public Iterator<Tuple> iterator()

Specified by:

iterator in interface TupleMemory

fastIterator

public FastIterator<Tuple> fastIterator()

Specified by:

fastIterator in interface TupleMemory

fullFastIterator

public FastIterator<Tuple> fullFastIterator()

Description copied from interface: TupleMemory

Iterates the entire data structure, regardless of whether TupleMemory is hashed or not.

Specified by:

fullFastIterator in interface TupleMemory

Returns:

fullFastIterator

public FastIterator<Tuple> fullFastIterator(Tuple leftTuple)

Description copied from interface: TupleMemory

Iterator that resumes from the current RightTuple, regardless of whether the TupleMemory is hashed or not

Specified by:

fullFastIterator in interface TupleMemory

Returns:

coerceType

public static java.lang.Comparable coerceType(AbstractHashTable.FieldIndex index,
                                              java.lang.Comparable treeRootKey,
                                              java.lang.Comparable key)

clear

public void clear()

Specified by:

clear in interface TupleMemory

getIndexType

public TupleMemory.IndexType getIndexType()

Specified by:

getIndexType in interface TupleMemory