|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Uses of GPNode in ec.app.ant.func |
|---|
| Subclasses of GPNode in ec.app.ant.func | |
|---|---|
class |
IfFoodAhead
|
class |
Left
|
class |
Move
|
class |
Progn2
|
class |
Progn3
|
class |
Progn4
|
class |
Right
|
| Uses of GPNode in ec.app.edge.func |
|---|
| Subclasses of GPNode in ec.app.edge.func | |
|---|---|
class |
Accept
|
class |
BAccept
|
class |
BBud
|
class |
BLoop
|
class |
BStart
|
class |
Bud
|
class |
Double
|
class |
Epsilon
|
class |
Loop
|
class |
One
|
class |
Reverse
|
class |
Split
|
class |
Start
|
class |
Zero
|
| Uses of GPNode in ec.app.lawnmower.func |
|---|
| Subclasses of GPNode in ec.app.lawnmower.func | |
|---|---|
class |
Frog
|
class |
LawnERC
|
class |
Mow
|
class |
V8a
|
| Methods in ec.app.lawnmower.func with parameters of type GPNode | |
|---|---|
boolean |
LawnERC.nodeEquals(GPNode node)
|
| Uses of GPNode in ec.app.multiplexer.func |
|---|
| Subclasses of GPNode in ec.app.multiplexer.func | |
|---|---|
class |
A0
|
class |
A1
|
class |
A2
|
class |
And
|
class |
D0
|
class |
D1
|
class |
D2
|
class |
D3
|
class |
D4
|
class |
D5
|
class |
D6
|
class |
D7
|
class |
If
|
class |
Not
|
class |
Or
|
| Uses of GPNode in ec.app.parity.func |
|---|
| Subclasses of GPNode in ec.app.parity.func | |
|---|---|
class |
D10
|
class |
D11
|
class |
D12
|
class |
D13
|
class |
D14
|
class |
D15
|
class |
D16
|
class |
D17
|
class |
D18
|
class |
D19
|
class |
D20
|
class |
D21
|
class |
D22
|
class |
D23
|
class |
D24
|
class |
D25
|
class |
D26
|
class |
D27
|
class |
D28
|
class |
D29
|
class |
D30
|
class |
D31
|
class |
D8
|
class |
D9
|
class |
Nand
|
class |
Nor
|
| Uses of GPNode in ec.app.regression.func |
|---|
| Subclasses of GPNode in ec.app.regression.func | |
|---|---|
class |
Add
|
class |
Cos
|
class |
Div
|
class |
Exp
|
class |
Log
|
class |
Mul
|
class |
RegERC
|
class |
Sin
|
class |
Sub
|
class |
X
|
| Methods in ec.app.regression.func with parameters of type GPNode | |
|---|---|
boolean |
RegERC.nodeEquals(GPNode node)
|
| Uses of GPNode in ec.app.twobox.func |
|---|
| Subclasses of GPNode in ec.app.twobox.func | |
|---|---|
class |
H0
|
class |
H1
|
class |
L0
|
class |
L1
|
class |
W0
|
class |
W1
|
| Uses of GPNode in ec.gp |
|---|
| Subclasses of GPNode in ec.gp | |
|---|---|
class |
ADF
An ADF is a GPNode which implements an "Automatically Defined Function", as described in Koza II. |
class |
ADFArgument
An ADFArgument is a GPNode which represents an ADF's argument terminal, its counterpart which returns argument values in its associated function tree. |
class |
ADM
An ADM is an ADF which doesn't evaluate its arguments beforehand, but instead only evaluates them (and possibly repeatedly) when necessary at runtime. |
class |
ERC
ERC is an abstract GPNode which implements Ephemeral Random Constants, as described in Koza I. |
| Fields in ec.gp declared as GPNode | |
|---|---|
GPNode |
GPTree.child
the root GPNode in the GPTree |
GPNode[] |
GPNode.children
|
GPNode |
GPNodeGatherer.node
|
GPNode[][] |
GPFunctionSet.nodes
The nodes that our GPTree can use: nodes[type][thenodes]. |
GPNode[][][] |
GPFunctionSet.nodesByArity
Nodes == a given arity, that is: nodesByArity[type][arity][thenodes] |
GPNode[][] |
GPFunctionSet.nonterminals
The nonterminals our GPTree can use: nonterminals[type][thenodes]. |
GPNode[][][] |
GPFunctionSet.nonterminalsOverArity
Nonterminals >= a given arity, that is: nonterminalsOverArity[type][arity][thenodes] -- this will be O(n^2). |
GPNode[][][] |
GPFunctionSet.nonterminalsUnderArity
Nonterminals <= a given arity, that is: nonterminalsUnderArity[type][arity][thenodes] -- this will be O(n^2). |
GPNode[][] |
GPFunctionSet.terminals
The terminals our GPTree can use: terminals[type][thenodes]. |
| Methods in ec.gp that return GPNode | |
|---|---|
GPNode |
GPNode.cloneReplacing()
Deep-clones the tree rooted at this node, and returns the entire copied tree. |
GPNode |
GPNode.cloneReplacing(GPNode[] newSubtrees,
GPNode[] oldSubtrees)
Deep-clones the tree rooted at this node, and returns the entire copied tree. |
GPNode |
GPNode.cloneReplacing(GPNode newSubtree,
GPNode oldSubtree)
Deep-clones the tree rooted at this node, and returns the entire copied tree. |
GPNode |
GPNode.cloneReplacingAtomic(GPNode[] newNodes,
GPNode[] oldNodes)
Clones a new subtree, but with each node in oldNodes[] respectively (which may or may not be in the subtree) replaced with the equivalent nodes in newNodes[] (and not clones). |
GPNode |
GPNode.cloneReplacingAtomic(GPNode newNode,
GPNode oldNode)
Clones a new subtree, but with the single node oldNode (which may or may not be in the subtree) replaced with a newNode (not a clone of newNode). |
GPNode |
GPNode.cloneReplacingNoSubclone(GPNode newSubtree,
GPNode oldSubtree)
Deep-clones the tree rooted at this node, and returns the entire copied tree. |
GPNode |
GPNode.lightClone()
|
abstract GPNode |
GPNodeBuilder.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
GPNode |
GPNodeSelector.pickNode(EvolutionState s,
int subpopulation,
int thread,
GPIndividual ind,
GPTree tree)
Picks a node at random from tree and returns it. |
GPNode |
ERC.readNode(DecodeReturn dret)
|
GPNode |
GPNode.readNode(DecodeReturn dret)
Reads the node symbol, advancing the DecodeReturn to the first character in the string beyond the node symbol, and returns a new, empty GPNode of the appropriate class representing that symbol, else null if the node symbol is not of the correct type for your GPNode class. |
static GPNode |
GPNode.readRootedTree(EvolutionState state,
java.io.DataInput dataInput,
GPType expectedType,
GPFunctionSet set,
GPNodeParent parent,
int argposition)
|
static GPNode |
GPNode.readRootedTree(int linenumber,
DecodeReturn dret,
GPType expectedType,
GPFunctionSet set,
GPNodeParent parent,
int argposition,
EvolutionState state)
Reads the node and its children from the form printed out by printRootedTree. |
| Methods in ec.gp with parameters of type GPNode | |
|---|---|
GPNode |
GPNode.cloneReplacing(GPNode[] newSubtrees,
GPNode[] oldSubtrees)
Deep-clones the tree rooted at this node, and returns the entire copied tree. |
GPNode |
GPNode.cloneReplacing(GPNode[] newSubtrees,
GPNode[] oldSubtrees)
Deep-clones the tree rooted at this node, and returns the entire copied tree. |
GPNode |
GPNode.cloneReplacing(GPNode newSubtree,
GPNode oldSubtree)
Deep-clones the tree rooted at this node, and returns the entire copied tree. |
GPNode |
GPNode.cloneReplacingAtomic(GPNode[] newNodes,
GPNode[] oldNodes)
Clones a new subtree, but with each node in oldNodes[] respectively (which may or may not be in the subtree) replaced with the equivalent nodes in newNodes[] (and not clones). |
GPNode |
GPNode.cloneReplacingAtomic(GPNode[] newNodes,
GPNode[] oldNodes)
Clones a new subtree, but with each node in oldNodes[] respectively (which may or may not be in the subtree) replaced with the equivalent nodes in newNodes[] (and not clones). |
GPNode |
GPNode.cloneReplacingAtomic(GPNode newNode,
GPNode oldNode)
Clones a new subtree, but with the single node oldNode (which may or may not be in the subtree) replaced with a newNode (not a clone of newNode). |
GPNode |
GPNode.cloneReplacingNoSubclone(GPNode newSubtree,
GPNode oldSubtree)
Deep-clones the tree rooted at this node, and returns the entire copied tree. |
boolean |
GPNode.contains(GPNode subnode)
Returns true if the subtree rooted at this node contains subnode. |
abstract boolean |
ERC.nodeEquals(GPNode node)
Implement this to do ERC-to-ERC comparisons. |
boolean |
GPNode.nodeEquals(GPNode node)
Returns true if I am the "genetically" identical to this node, and our children arrays are the same length, though we may have different parents and children. |
boolean |
ADF.nodeEquals(GPNode node)
Determines node equality by comparing the class, associated tree, and function name of the nodes. |
boolean |
GPNode.nodeEquivalentTo(GPNode node)
Returns true if I and the provided node are the same kind of node -- that is, we could have both been cloned() and reset() from the same prototype node. |
void |
GPNode.replaceWith(GPNode newNode)
Replaces the node with another node in its position in the tree. |
boolean |
GPNode.rootedTreeEquals(GPNode node)
Returns true if the two rooted trees are "genetically" equal, though they may have different parents. |
boolean |
GPNode.swapCompatibleWith(GPInitializer initializer,
GPNode node)
Returns true if I can swap into node's position. |
boolean |
GPNodeGatherer.test(GPNode thisNode)
Returns true if thisNode is the kind of node to be considered in the gather count for nodeInPosition(...) and GPNode.numNodes(GPNodeGatherer). |
| Uses of GPNode in ec.gp.breed |
|---|
| Methods in ec.gp.breed with parameters of type GPNode | |
|---|---|
void |
MutateERCPipeline.mutateERCs(GPNode node,
EvolutionState state,
int thread)
|
| Uses of GPNode in ec.gp.build |
|---|
| Methods in ec.gp.build that return GPNode | |
|---|---|
GPNode |
PTC2.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
GPNode |
PTC1.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
GPNode |
RandomBranch.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
GPNode |
RandTree.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
GPNode |
Uniform.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
| Methods in ec.gp.build with parameters of type GPNode | |
|---|---|
int |
Uniform.intForNode(GPNode node)
|
java.math.BigInteger |
Uniform.numChildPermutations(GPInitializer initializer,
int functionset,
GPNode parent,
int size,
int outof,
int pickchild)
|
java.math.BigInteger |
Uniform.numTreesRootedByNode(GPInitializer initializer,
int functionset,
GPNode node,
int size)
|
| Uses of GPNode in ec.gp.koza |
|---|
| Methods in ec.gp.koza that return GPNode | |
|---|---|
protected GPNode |
KozaBuilder.fullNode(EvolutionState state,
int current,
int max,
GPType type,
int thread,
GPNodeParent parent,
int argposition,
GPFunctionSet set)
A private recursive method which builds a FULL-style tree for newRootedTree(...) |
protected GPNode |
KozaBuilder.growNode(EvolutionState state,
int current,
int max,
GPType type,
int thread,
GPNodeParent parent,
int argposition,
GPFunctionSet set)
A private function which recursively returns a GROW tree to newRootedTree(...) |
GPNode |
HalfBuilder.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
GPNode |
GrowBuilder.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
GPNode |
FullBuilder.newRootedTree(EvolutionState state,
GPType type,
int thread,
GPNodeParent parent,
GPFunctionSet set,
int argposition,
int requestedSize)
|
GPNode |
KozaNodeSelector.pickNode(EvolutionState s,
int subpopulation,
int thread,
GPIndividual ind,
GPTree tree)
|
| Methods in ec.gp.koza with parameters of type GPNode | |
|---|---|
boolean |
CrossoverPipeline.verifyPoints(GPInitializer initializer,
GPNode inner1,
GPNode inner2)
Returns true if inner1 can feasibly be swapped into inner2's position. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||