org.drools.core.reteoo
Interface LeftTupleMemory

All Known Implementing Classes:

LeftTupleIndexHashTable, LeftTupleIndexRangeRBTree, LeftTupleIndexRBTree, LeftTupleList, LeftTupleRBTree.Node

public interface LeftTupleMemory

Method Summary

void	add(LeftTuple tuple)
boolean	contains(LeftTuple leftTuple)
FastIterator	fastIterator()
FastIterator	fullFastIterator() Iterates the entire data structure, regardless of whether TupleMemory is hashed or not.
FastIterator	fullFastIterator(LeftTuple leftTuple) Iterator that resumes from the current RightTuple, regardless of whether the TupleMemory is hashed or not
LeftTuple	getFirst(RightTuple rightTuple)
boolean	isIndexed()
Iterator	iterator()
void	remove(LeftTuple leftTuple)
void	removeAdd(LeftTuple tuple)
int	size()
Entry[]	toArray()

Method Detail

iterator

Iterator iterator()

getFirst

LeftTuple getFirst(RightTuple rightTuple)

removeAdd

void removeAdd(LeftTuple tuple)

add

void add(LeftTuple tuple)

remove

void remove(LeftTuple leftTuple)

contains

boolean contains(LeftTuple leftTuple)

isIndexed

boolean isIndexed()

size

int size()

toArray

Entry[] toArray()

fastIterator

FastIterator fastIterator()

fullFastIterator

FastIterator fullFastIterator()

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

Returns:

fullFastIterator

FastIterator fullFastIterator(LeftTuple leftTuple)

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

Parameters:

rightTuple -

Returns: