Package | Description |
---|---|
org.drools.core.impl | |
org.drools.core.phreak | |
org.drools.core.reteoo |
Modifier and Type | Method and Description |
---|---|
void |
KnowledgeBaseImpl.invalidateSegmentPrototype(LeftTupleNode rootNode) |
void |
InternalKnowledgeBase.invalidateSegmentPrototype(LeftTupleNode rootNode) |
Modifier and Type | Method and Description |
---|---|
static SegmentMemory |
SegmentUtilities.createChildSegment(InternalWorkingMemory wm,
LeftTupleNode node) |
static SegmentMemory |
SegmentUtilities.createChildSegmentForTerminalNode(LeftTupleNode node,
Memory memory) |
void |
AddRemoveRule.ExistingPathStrategy.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
void |
AddRemoveRule.AddExistingPaths.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
void |
AddRemoveRule.RemoveExistingPaths.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
static boolean |
SegmentUtilities.isNonTerminalTipNode(LeftTupleNode node,
TerminalNode removingTN) |
static boolean |
SegmentUtilities.isRootNode(LeftTupleNode node,
TerminalNode removingTN)
Returns whether the node is the root of a segment.
|
static boolean |
SegmentUtilities.isTipNode(LeftTupleNode node,
TerminalNode removingTN)
Returns whether the node is the tip of a segment.
|
static SegmentMemory |
AddRemoveRule.splitSegment(InternalWorkingMemory wm,
SegmentMemory sm1,
LeftTupleNode splitNode) |
Modifier and Type | Method and Description |
---|---|
void |
AddRemoveRule.ExistingPathStrategy.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
void |
AddRemoveRule.ExistingPathStrategy.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
void |
AddRemoveRule.AddExistingPaths.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
void |
AddRemoveRule.AddExistingPaths.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
void |
AddRemoveRule.RemoveExistingPaths.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
void |
AddRemoveRule.RemoveExistingPaths.handleSplit(PathMemory pmem,
SegmentMemory[] prevSmems,
SegmentMemory[] smems,
int smemIndex,
int prevSmemIndex,
LeftTupleNode parentNode,
LeftTupleNode node,
TerminalNode tn,
Set<LeftTupleNode> visited,
Set<SegmentMemory> smemsToNotify,
Map<LeftTupleNode,SegmentMemory> nodeToSegmentMap,
InternalWorkingMemory wm) |
Modifier and Type | Interface and Description |
---|---|
interface |
LeftTupleSink
Receiver of propagated
ReteTuple s from a
TupleSource . |
interface |
LeftTupleSinkNode
Items placed in a
LinkedList |
interface |
PathEndNode |
interface |
TerminalNode
A markup interface for terminal nodes
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractTerminalNode |
class |
AccumulateNode
AccumulateNode
A beta node capable of doing accumulate logic.
|
class |
BetaNode |
class |
ConditionalBranchNode
Node which allows to follow different paths in the Rete-OO network,
based on the result of a boolean
Test . |
class |
EvalConditionNode |
class |
ExistsNode
ExistsNode extends BetaNode to perform tests for
the existence of a Fact plus one or more conditions. |
class |
FromNode<T extends FromNode.FromMemory> |
class |
JoinNode |
class |
LeftInputAdapterNode
All asserting Facts must propagated into the right
ObjectSink side of a BetaNode, if this is the first Pattern
then there are no BetaNodes to propagate to. |
class |
LeftTupleSource
A source of
ReteTuple s for a TupleSink . |
class |
NotNode |
class |
QueryElementNode |
class |
QueryTerminalNode
Leaf Rete-OO node responsible for enacting
Action s on a
matched Rule . |
class |
ReactiveFromNode |
class |
RightInputAdapterNode
When joining a subnetwork into the main network again, RightInputAdapterNode adapts the
subnetwork's tuple into a fact in order right join it with the tuple being propagated in
the main network.
|
class |
RuleTerminalNode
Leaf Rete-OO node responsible for enacting
Action s on a
matched Rule . |
class |
TimerNode |
Modifier and Type | Method and Description |
---|---|
LeftTupleNode[] |
RightInputAdapterNode.getPathNodes() |
LeftTupleNode[] |
AbstractTerminalNode.getPathNodes() |
LeftTupleNode[] |
PathEndNode.getPathNodes() |
static LeftTupleNode[] |
AbstractTerminalNode.getPathNodes(PathEndNode endNode) |
LeftTupleNode |
SegmentMemory.getRootNode() |
LeftTupleNode |
SegmentMemory.getTipNode() |
Modifier and Type | Method and Description |
---|---|
boolean |
RightInputAdapterNode.hasPathNode(LeftTupleNode node) |
boolean |
AbstractTerminalNode.hasPathNode(LeftTupleNode node) |
boolean |
PathEndNode.hasPathNode(LeftTupleNode node) |
boolean |
TerminalNode.isTerminalNodeOf(LeftTupleNode node) |
boolean |
AbstractTerminalNode.isTerminalNodeOf(LeftTupleNode node) |
void |
SegmentMemory.setTipNode(LeftTupleNode tipNode) |
Constructor and Description |
---|
SegmentMemory(LeftTupleNode rootNode) |
Copyright © 2001–2018 JBoss by Red Hat. All rights reserved.