TupleMemory (Drools :: Core 7.69.0.Final API)

All Known Implementing Classes:

AbstractHashTable.IndexTupleList, TupleIndexHashTable, TupleIndexRBTree, TupleList, TupleRBTree.Node
```
public interface TupleMemory
```

Nested Class Summary

Nested Classes
Modifier and Type Interface Description

static class TupleMemory.IndexType

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`void`	`add(Tuple rightTuple)`
`void`	`clear()`
`boolean`	`contains(Tuple rightTuple)`
`FastIterator`	`fastIterator()`
`FastIterator`	`fullFastIterator()`	Iterates the entire data structure, regardless of whether TupleMemory is hashed or not.
`FastIterator`	`fullFastIterator(Tuple rightTuple)`	Iterator that resumes from the current RightTuple, regardless of whether the TupleMemory is hashed or not
`Tuple`	`getFirst(Tuple leftTuple)`	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()`
`boolean`	`isIndexed()`
`Iterator`	`iterator()`
`void`	`remove(Tuple rightTuple)`
`void`	`removeAdd(Tuple rightTuple)`
`int`	`size()`
`Entry[]`	`toArray()`

- Method Detail
  - getFirst
```
Tuple getFirst(Tuple leftTuple)
```
    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.
  - removeAdd
```
void removeAdd(Tuple rightTuple)
```
  - add
```
void add(Tuple rightTuple)
```
  - remove
```
void remove(Tuple rightTuple)
```
  - contains
```
boolean contains(Tuple rightTuple)
```
  - isIndexed
```
boolean isIndexed()
```
  - size
```
int size()
```
  - 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(Tuple rightTuple)
```
    Iterator that resumes from the current RightTuple, regardless of whether the TupleMemory is hashed or not
    
    Parameters:
    
    rightTuple -
    
    Returns:
  - toArray
```
Entry[] toArray()
```
  - getIndexType
```
TupleMemory.IndexType getIndexType()
```
  - clear
```
void clear()
```