void |
OrNode.addActivation(Iteration t,
LatticeQueue queue,
Activation.Key ak,
Activation inputAct) |
void |
AndNode.addActivation(Iteration t,
LatticeQueue queue,
Activation.Key ak,
int recurrentCount,
TreeSet<Activation> inputActs) |
Activation |
Node.addActivationAndPropagate(Iteration t,
LatticeQueue queue,
Activation.Key ak,
int recurrentCount,
Option exclusionOption,
TreeSet<Activation> inputActs) |
static void |
AndNode.addActivationsToNextLevelPattern(Iteration t,
LatticeQueue queue,
Node firstNode,
Node secondNode,
InputNode refinement,
Activation act,
Option conflict) |
static void |
AndNode.createNextLevelPattern(Iteration t,
LatticeQueue queue,
Node firstNode,
InputNode refinement) |
void |
OrNode.expandToNextLevel(Iteration t,
LatticeQueue queue,
Activation act,
Option conflict,
boolean train) |
abstract void |
Node.expandToNextLevel(Iteration t,
LatticeQueue queue,
Activation act,
Option conflict,
boolean train) |
void |
InputNode.expandToNextLevel(Iteration t,
LatticeQueue queue,
Activation act,
Option conflict,
boolean train) |
void |
AndNode.expandToNextLevel(Iteration t,
LatticeQueue queue,
Activation act,
Option conflict,
boolean train) |
static void |
OrNode.processCandidate(Iteration t,
LatticeQueue queue,
Node parentNode,
Activation act,
Option conflict,
boolean train) |
static void |
AndNode.processCandidate(Iteration t,
LatticeQueue queue,
Node firstNode,
Node secondNode,
InputNode refinement,
Activation act,
Option conflict,
boolean train) |
void |
Node.propagateAddedActivation(Iteration t,
LatticeQueue queue,
Activation act) |
void |
Node.propagateRemovedActivation(Iteration t,
LatticeQueue queue,
Activation act) |
protected void |
OrNode.removeActivation(Iteration t,
LatticeQueue queue,
Activation.Key ak) |
protected void |
AndNode.removeActivation(Iteration t,
LatticeQueue queue,
Activation.Key ak) |
void |
Node.removeActivationAndPropagate(Iteration t,
LatticeQueue queue,
Activation.Key ak) |
void |
Node.removeFromNextLevel(Iteration t,
LatticeQueue queue,
Activation.Key ak) |