org.drools.core.reteoo
Interface RightTupleMemory

All Known Implementing Classes:

RightTupleIndexHashTable, RightTupleIndexRangeRBTree, RightTupleIndexRBTree, RightTupleList, RightTupleRBTree.Node

public interface RightTupleMemory

Nested Class Summary

static class

RightTupleMemory.IndexType

Method Summary

void	add(RightTuple rightTuple)
boolean	contains(RightTuple rightTuple)
FastIterator	fastIterator()
FastIterator	fullFastIterator() Iterates the entire data structure, regardless of whether TupleMemory is hashed or not.
FastIterator	fullFastIterator(RightTuple rightTuple) Iterator that resumes from the current RightTuple, regardless of whether the TupleMemory is hashed or not
RightTuple	getFirst(LeftTuple leftTuple, InternalFactHandle factHandle, FastIterator rightTupleIterator) The FactHandle is always the context fact and is necessary when the object being modified is in the both left and right node memories.
RightTupleMemory.IndexType	getIndexType()
boolean	isIndexed()
Iterator	iterator()
void	remove(RightTuple rightTuple)
void	removeAdd(RightTuple rightTuple)
int	size()
Entry[]	toArray()

Method Detail

getFirst

RightTuple getFirst(LeftTuple leftTuple,
                    InternalFactHandle factHandle,
                    FastIterator rightTupleIterator)

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.

Parameters:

leftTuple -

factHandle -

Returns:

removeAdd

void removeAdd(RightTuple rightTuple)

add

void add(RightTuple rightTuple)

remove

void remove(RightTuple rightTuple)

contains

boolean contains(RightTuple rightTuple)

iterator

Iterator iterator()

fastIterator

FastIterator fastIterator()

fullFastIterator

FastIterator fullFastIterator()

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

Returns:

fullFastIterator

FastIterator fullFastIterator(RightTuple rightTuple)

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

Parameters:

rightTuple -

Returns:

isIndexed

boolean isIndexed()

toArray

Entry[] toArray()

size

int size()

getIndexType

RightTupleMemory.IndexType getIndexType()