BooleanConstrainedLeftMemory - JBoss RULES 3.0.6 API 英文版文档

Overview

Package

Class

Tree

Deprecated

Index

Help

PREV CLASS NEXT CLASS

FRAMES NO FRAMES

SUMMARY: NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

org.drools.reteoo.beta
Class BooleanConstrainedLeftMemory

java.lang.Object
  org.drools.reteoo.beta.BooleanConstrainedLeftMemory

All Implemented Interfaces:: java.io.Serializable, BetaLeftMemory

public class BooleanConstrainedLeftMemory
extends java.lang.Object
implements BetaLeftMemory
extends java.lang.Object
implements BetaLeftMemory

BooleanConstrainedLeftMemory A boolean constrained implementation for the left memory

See Also:: Serialized Form

Constructor Summary

BooleanConstrainedLeftMemory(FieldExtractor extractor, Declaration declaration, Evaluator evaluator)


BooleanConstrainedLeftMemory(FieldExtractor extractor, Declaration declaration, Evaluator evaluator, BetaLeftMemory childMemory)


Method Summary

void add(WorkingMemory workingMemory, MultiLinkedListNodeWrapper tuple)
          Adds the given tuple to the memory

void add(WorkingMemory workingMemory, ReteTuple tuple)
          Adds the given tuple to the memory

BetaLeftMemory getInnerMemory()
          Returns the inner beta left memory in case of a multi-indexed memory

boolean isEmpty()
          Checks if this memory is empty

boolean isPossibleMatch(MultiLinkedListNodeWrapper tuple)
          Returns true if the tuple is a possible match to the handle passed to the previous selectPossibleMatches() call

java.util.Iterator iterator()
          Returns an iterator to iterate over all tuples in the beta left memory This method is much heavier than the iterator(workingMemory, handle) method as it is not backed by a data structure.

java.util.Iterator iterator(WorkingMemory workingMemory, InternalFactHandle handle)
          Returns an iterator to iterate over tuples that attend the binder/handle constraints

void remove(WorkingMemory workingMemory, MultiLinkedListNodeWrapper tuple)
          Remove the given tuple from the memory

void remove(WorkingMemory workingMemory, ReteTuple tuple)
          Remove the given tuple from the memory

void selectPossibleMatches(WorkingMemory workingMemory, InternalFactHandle handle)
          Prepares the left memory for subsequent calls of isPossibleMatch() based on the constraints applied to the handle.

void setInnerMemory(BetaLeftMemory innerMemory)
          Sets the inner beta left memory in case of a multi-indexed memory

int size()
          Returns the number of tuples currently stored in the left memory

Methods inherited from class java.lang.Object

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

Constructor Summary
`BooleanConstrainedLeftMemory(FieldExtractor extractor, Declaration declaration, Evaluator evaluator)`
`BooleanConstrainedLeftMemory(FieldExtractor extractor, Declaration declaration, Evaluator evaluator, BetaLeftMemory childMemory)`

Method Summary
`void`	`add(WorkingMemory workingMemory, MultiLinkedListNodeWrapper tuple)` Adds the given tuple to the memory
`void`	`add(WorkingMemory workingMemory, ReteTuple tuple)` Adds the given tuple to the memory
`BetaLeftMemory`	`getInnerMemory()` Returns the inner beta left memory in case of a multi-indexed memory
`boolean`	`isEmpty()` Checks if this memory is empty
`boolean`	`isPossibleMatch(MultiLinkedListNodeWrapper tuple)` Returns true if the tuple is a possible match to the handle passed to the previous selectPossibleMatches() call
`java.util.Iterator`	`iterator()` Returns an iterator to iterate over all tuples in the beta left memory This method is much heavier than the iterator(workingMemory, handle) method as it is not backed by a data structure.
`java.util.Iterator`	`iterator(WorkingMemory workingMemory, InternalFactHandle handle)` Returns an iterator to iterate over tuples that attend the binder/handle constraints
`void`	`remove(WorkingMemory workingMemory, MultiLinkedListNodeWrapper tuple)` Remove the given tuple from the memory
`void`	`remove(WorkingMemory workingMemory, ReteTuple tuple)` Remove the given tuple from the memory
`void`	`selectPossibleMatches(WorkingMemory workingMemory, InternalFactHandle handle)` Prepares the left memory for subsequent calls of isPossibleMatch() based on the constraints applied to the handle.
`void`	`setInnerMemory(BetaLeftMemory innerMemory)` Sets the inner beta left memory in case of a multi-indexed memory
`int`	`size()` Returns the number of tuples currently stored in the left memory

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Constructor Detail

BooleanConstrainedLeftMemory

public BooleanConstrainedLeftMemory(FieldExtractor extractor,
                                    Declaration declaration,
                                    Evaluator evaluator)

BooleanConstrainedLeftMemory

public BooleanConstrainedLeftMemory(FieldExtractor extractor,
                                    Declaration declaration,
                                    Evaluator evaluator,
                                    BetaLeftMemory childMemory)

Method Detail