Uses of Class
ec.gp.GPNode

Packages that use GPNode

Package	Description
ec.app.ant.func
ec.app.edge.func
ec.app.gpsemantics.func
ec.app.klandscapes
ec.app.klandscapes.func
ec.app.lawnmower.func
ec.app.lid.func
ec.app.majority.func
ec.app.multiplexerslow.func
ec.app.ordertree
ec.app.ordertree.func
ec.app.parity.func
ec.app.regression.func
ec.app.royaltree
ec.app.royaltree.func
ec.app.tutorial4
ec.app.twobox.func
ec.gp
ec.gp.breed
ec.gp.build
ec.gp.ge
ec.gp.koza
ec.gp.push

Uses of GPNode in ec.app.ant.func

Subclasses of GPNode in ec.app.ant.func

Modifier and Type	Class and Description
class	IfFoodAhead
class	Move
class	Progn3
class	Progn4
class	Right

Uses of GPNode in ec.app.edge.func

Subclasses of GPNode in ec.app.edge.func

Modifier and Type	Class and Description
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.gpsemantics.func

Subclasses of GPNode in ec.app.gpsemantics.func

Modifier and Type	Class and Description
class	SemanticExtra
class	SemanticJ
class	SemanticN0
class	SemanticN1
class	SemanticN10
class	SemanticN11
class	SemanticN12
class	SemanticN13
class	SemanticN14
class	SemanticN15
class	SemanticN16
class	SemanticN2
class	SemanticN3
class	SemanticN4
class	SemanticN5
class	SemanticN6
class	SemanticN7
class	SemanticN8
class	SemanticN9
class	SemanticNode
class	SemanticX0
class	SemanticX1
class	SemanticX10
class	SemanticX11
class	SemanticX12
class	SemanticX13
class	SemanticX14
class	SemanticX15
class	SemanticX16
class	SemanticX2
class	SemanticX3
class	SemanticX4
class	SemanticX5
class	SemanticX6
class	SemanticX7
class	SemanticX8
class	SemanticX9

Uses of GPNode in ec.app.klandscapes

Methods in ec.app.klandscapes with parameters of type GPNode

Modifier and Type	Method and Description
(package private) double	KLandscapes.fitness(GPNode root)
(package private) double	KLandscapes.fitnessHelper(GPNode node)
(package private) double	KLandscapes.subtreeFitness(GPNode node, int depth)

Uses of GPNode in ec.app.klandscapes.func

Subclasses of GPNode in ec.app.klandscapes.func

Modifier and Type	Class and Description
class	KLandscapeTree
class	KLandscapeTreeA
class	KLandscapeTreeB
class	KLandscapeTreeW
class	KLandscapeTreeX
class	KLandscapeTreeY
class	KLandscapeTreeZ

Uses of GPNode in ec.app.lawnmower.func

Subclasses of GPNode in ec.app.lawnmower.func

Modifier and Type	Class and Description
class	Frog
class	LawnERC
class	Left
class	Mow
class	Progn2
class	V8a

Methods in ec.app.lawnmower.func with parameters of type GPNode

Modifier and Type	Method and Description
boolean	LawnERC.nodeEquals(GPNode node)

Uses of GPNode in ec.app.lid.func

Subclasses of GPNode in ec.app.lid.func

Modifier and Type	Class and Description
class	LidJ
class	LidX

Uses of GPNode in ec.app.majority.func

Subclasses of GPNode in ec.app.majority.func

Modifier and Type	Class and Description
class	E
class	EE
class	EEE
class	Nand
class	Nor
class	W
class	WW
class	WWW
class	X
class	Xor

Uses of GPNode in ec.app.multiplexerslow.func

Subclasses of GPNode in ec.app.multiplexerslow.func

Modifier and Type	Class and Description
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.ordertree

Methods in ec.app.ordertree with parameters of type GPNode

Modifier and Type	Method and Description
(package private) void	OrderTree.nodeCal(GPNode p, EvolutionState state)

Uses of GPNode in ec.app.ordertree.func

Subclasses of GPNode in ec.app.ordertree.func

Modifier and Type	Class and Description
class	OrderTreeF0
class	OrderTreeF1
class	OrderTreeF2
class	OrderTreeF3
class	OrderTreeF4
class	OrderTreeF5
class	OrderTreeF6
class	OrderTreeF7
class	OrderTreeF8
class	OrderTreeF9
class	OrderTreeNode
class	OrderTreeT0
class	OrderTreeT1
class	OrderTreeT2
class	OrderTreeT3
class	OrderTreeT4
class	OrderTreeT5
class	OrderTreeT6
class	OrderTreeT7
class	OrderTreeT8
class	OrderTreeT9

Uses of GPNode in ec.app.parity.func

Subclasses of GPNode in ec.app.parity.func

Modifier and Type	Class and Description
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

Uses of GPNode in ec.app.regression.func

Subclasses of GPNode in ec.app.regression.func

Modifier and Type	Class and Description
class	Cos
class	Cube
class	Exp
class	Inv
class	KeijzerERC
class	KornsERC
class	Log
class	Neg
class	NegExp
class	RegERC
class	Sin
class	Sqrt
class	Square
class	Tan
class	Tanh
class	VladERCA
class	VladERCB
class	VladERCC
class	X1
class	X2
class	X3
class	X4
class	X5

Methods in ec.app.regression.func with parameters of type GPNode

Modifier and Type	Method and Description
boolean	RegERC.nodeEquals(GPNode node)

Uses of GPNode in ec.app.royaltree

Methods in ec.app.royaltree with parameters of type GPNode

Modifier and Type	Method and Description
(package private) double	RoyalTree.fitness(GPNode node, EvolutionState state)
(package private) boolean	RoyalTree.isPerfect(char parent, GPNode node, EvolutionState state) Calculate whether the tree rooted at n is a perfect subtree of the appropriate type given the current parent.

Uses of GPNode in ec.app.royaltree.func

Subclasses of GPNode in ec.app.royaltree.func

Modifier and Type	Class and Description
class	RoyalTreeA
class	RoyalTreeB
class	RoyalTreeC
class	RoyalTreeD
class	RoyalTreeE
class	RoyalTreeNode
class	RoyalTreeX

Uses of GPNode in ec.app.tutorial4

Subclasses of GPNode in ec.app.tutorial4

Modifier and Type	Class and Description
class	Y

Uses of GPNode in ec.app.twobox.func

Subclasses of GPNode in ec.app.twobox.func

Modifier and Type	Class and Description
class	Add
class	Div
class	H0
class	H1
class	L0
class	L1
class	Mul
class	Sub
class	W0
class	W1

Uses of GPNode in ec.gp

Subclasses of GPNode in ec.gp

Modifier and Type	Class and Description
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

Modifier and Type	Field and Description
GPNode	GPTree.child the root GPNode in the GPTree
GPNode[]	GPNode.children
(package private) 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].
GPNode[]	GPNodeConstraints.zeroChildren A little memory optimization: if GPNodes have no children, they are welcome to use share this zero-sized array as their children array.

Methods in ec.gp that return GPNode

Modifier and Type	Method and Description
GPNode	GPNode.cloneReplacing() Deprecated. use clone() instead.
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	GPNode.nodeInPosition(int p, GPNodeGatherer g) Returns the p'th node, constrained by nodesearch, in the subtree for which this GPNode is root.
GPNode	GPNode.nodeInPosition(int p, int nodesearch) Returns the p'th node, constrained by nodesearch, in the subtree for which this GPNode is root.
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, 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

Modifier and Type	Method and Description
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

Fields in ec.gp.breed declared as GPNode

Modifier and Type	Field and Description
private GPNode	MutateDemotePipeline.demotableNode
(package private) GPNode	SizeFairCrossoverPipeline.NodeInfo.node
private GPNode	MutatePromotePipeline.promotableNode
private GPNode	RehangPipeline.rehangableNode
private GPNode	MutateSwapPipeline.swappableNode

Methods in ec.gp.breed that return GPNode

Modifier and Type	Method and Description
protected GPNode	SizeFairCrossoverPipeline.findFairSizeNode(ArrayList nodeToSubtrees, HashMap sizeToNodes, GPNode parent1SelectedNode, GPTree tree2, EvolutionState state, int thread) This method finds a node using the logic given in the langdon paper.
private GPNode	MutateAllNodesPipeline.generateCompatibleTree(GPNode original, GPFunctionSet set, EvolutionState state, GPType returntype, int thread) Returns a brand-new tree which is swap-compatible with returntype, created by making nodes "compatible" with the equivalent nodes in the tree rooted at original.
GPNode	SizeFairCrossoverPipeline.NodeInfo.getNode()
private GPNode	MutateAllNodesPipeline.pickCompatibleNode(GPNode original, GPFunctionSet set, EvolutionState state, GPType returntype, int thread) Returns a node which is swap-compatible with returntype, and whose arguments are swap-compatible with the current children of original.
private GPNode	MutateOneNodePipeline.pickCompatibleNode(GPNode original, GPFunctionSet set, EvolutionState state, GPType returntype, int thread) Returns a node which is swap-compatible with returntype, and whose arguments are swap-compatible with the current children of original.

Methods in ec.gp.breed with parameters of type GPNode

Modifier and Type	Method and Description
private void	MutateDemotePipeline._demoteSomething(GPNode node, EvolutionState state, int thread, GPFunctionSet set)
private void	MutateDemotePipeline._demoteSomethingTypeless(GPNode node, EvolutionState state, int thread, GPFunctionSet set)
private int	MutateDemotePipeline._numDemotableNodes(GPInitializer initializer, GPNode root, int soFar, GPFunctionSet set)
private int	RehangPipeline._numRehangableNodes(GPNode root, int soFar)
private int	MutateDemotePipeline._pickDemotableNode(GPInitializer initializer, GPNode root, int num, GPFunctionSet set)
private int	RehangPipeline._pickRehangableNode(GPNode root, int num)
private void	MutateSwapPipeline._swapSomething(GPNode node, EvolutionState state, int thread)
private void	MutateSwapPipeline._swapSomethingTypeless(GPNode node, EvolutionState state, int thread)
private boolean	MutateDemotePipeline.demotable(GPInitializer initializer, GPNode node, GPFunctionSet set)
private void	MutateDemotePipeline.demoteSomething(GPNode node, EvolutionState state, int thread, GPFunctionSet set)
protected GPNode	SizeFairCrossoverPipeline.findFairSizeNode(ArrayList nodeToSubtrees, HashMap sizeToNodes, GPNode parent1SelectedNode, GPTree tree2, EvolutionState state, int thread) This method finds a node using the logic given in the langdon paper.
private GPNode	MutateAllNodesPipeline.generateCompatibleTree(GPNode original, GPFunctionSet set, EvolutionState state, GPType returntype, int thread) Returns a brand-new tree which is swap-compatible with returntype, created by making nodes "compatible" with the equivalent nodes in the tree rooted at original.
void	MutateERCPipeline.mutateERCs(GPNode node, EvolutionState state, int thread)
private boolean	InternalCrossoverPipeline.noContainment(GPNode inner1, GPNode inner2) Returns true if inner1 and inner2 do not contain one another
private int	MutateDemotePipeline.numDemotableNodes(GPInitializer initializer, GPNode root, int soFar, GPFunctionSet set)
private int	MutatePromotePipeline.numPromotableNodes(GPInitializer initializer, GPNode root, int soFar)
private int	RehangPipeline.numRehangableNodes(GPNode root, int soFar)
private int	MutateSwapPipeline.numSwappableNodes(GPInitializer initializer, GPNode root, int soFar)
private GPNode	MutateAllNodesPipeline.pickCompatibleNode(GPNode original, GPFunctionSet set, EvolutionState state, GPType returntype, int thread) Returns a node which is swap-compatible with returntype, and whose arguments are swap-compatible with the current children of original.
private GPNode	MutateOneNodePipeline.pickCompatibleNode(GPNode original, GPFunctionSet set, EvolutionState state, GPType returntype, int thread) Returns a node which is swap-compatible with returntype, and whose arguments are swap-compatible with the current children of original.
private int	MutateDemotePipeline.pickDemotableNode(GPInitializer initializer, GPNode root, int num, GPFunctionSet set)
private int	MutatePromotePipeline.pickPromotableNode(GPInitializer initializer, GPNode root, int num)
private int	RehangPipeline.pickRehangableNode(GPNode root, int num)
private int	MutateSwapPipeline.pickSwappableNode(GPInitializer initializer, GPNode root, int num)
private boolean	MutatePromotePipeline.promotable(GPInitializer initializer, GPNode node)
private void	MutatePromotePipeline.promoteSomething(GPNode node)
private void	RehangPipeline.rehang(EvolutionState state, int thread, GPNode pivot, GPNode root)
private boolean	MutateSwapPipeline.swappable(GPInitializer initializer, GPNode node) This very expensive method (for types) might be improved in various ways I guess.
private void	MutateSwapPipeline.swapSomething(GPNode node, EvolutionState state, int thread)
void	SizeFairCrossoverPipeline.traverseTreeForDepth(GPNode node, ArrayList nodeToDepth, HashMap sizeToNodes) Recursively travel the tree so that depth and subtree below are computed only once and can be reused later.
private boolean	MutateDemotePipeline.verifyPoint(GPNode inner1) Returns true if inner1's depth + atdepth +1 is within the depth bounds
(package private) boolean	InternalCrossoverPipeline.verifyPoints(GPInitializer initializer, GPNode inner1, GPNode inner2) Returns true if inner1 can feasibly be swapped into inner2's position.
boolean	SizeFairCrossoverPipeline.verifyPoints(GPInitializer initializer, GPNode inner1, GPNode inner2) Returns true if inner1 can feasibly be swapped into inner2's position.

Constructors in ec.gp.breed with parameters of type GPNode

Constructor and Description
SizeFairCrossoverPipeline.NodeInfo(GPNode node, int numberOfSubtrees)

Uses of GPNode in ec.gp.build

Fields in ec.gp.build declared as GPNode

Modifier and Type	Field and Description
(package private) GPNode	PTC2.dequeue_node
GPNode	UniformGPNodeStorage.node
(package private) GPNode[]	PTC2.s_node

Methods in ec.gp.build that return GPNode

Modifier and Type	Method and Description
(package private) GPNode	RandTree.buildTree(EvolutionState state, int thread, GPNodeParent parent, int argposition, GPFunctionSet set, String dyckWord)
(package private) GPNode	Uniform.createTreeOfType(EvolutionState state, int thread, GPInitializer initializer, int functionset, int type, int size, MersenneTwisterFast mt)
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)
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	PTC2.newRootedTree(EvolutionState state, GPType type, int thread, GPNodeParent parent, GPFunctionSet set, int argposition, int requestedSize)
private GPNode	PTC1.ptc1(EvolutionState state, int current, GPType type, int thread, GPNodeParent parent, int argposition, GPFunctionSet set, PTCFunctionSetForm pset, double[] nonterminalSelectionProbabilities) A private function which recursively returns a GROW tree to newRootedTree(...)
private GPNode	RandomBranch.randomBranch(EvolutionState state, GPType type, int maxLength, int thread, GPNodeParent parent, int argposition, GPFunctionSet set)

Methods in ec.gp.build with parameters of type GPNode

Modifier and Type	Method and Description
private void	PTC2.enqueue(GPNode n, int argpos, int depth)
(package private) void	Uniform.fillNodeWithChildren(EvolutionState state, int thread, GPInitializer initializer, int functionset, GPNode parent, GPNode parentc, int pickchild, int outof, MersenneTwisterFast mt)
int	Uniform.intForNode(GPNode node)
BigInteger	Uniform.numChildPermutations(GPInitializer initializer, int functionset, GPNode parent, int size, int outof, int pickchild)
BigInteger	Uniform.numTreesRootedByNode(GPInitializer initializer, int functionset, GPNode node, int size)

Uses of GPNode in ec.gp.ge

Fields in ec.gp.ge declared as GPNode

Modifier and Type	Field and Description
(package private) GPNode	GrammarFunctionNode.prototype

Methods in ec.gp.ge that return GPNode

Modifier and Type	Method and Description
GPNode	GrammarFunctionNode.getGPNodePrototype() Returns the prototype without cloning it first.
(package private) GPNode	GESpecies.makeSubtree(int[] index, int[] genome, EvolutionState es, GPFunctionSet gpfs, GrammarRuleNode rule, int treeNum, int threadnum, HashMap ercMapsForFancyPrint, GPNodeParent parent, byte argposition)
GPNode	GESpecies.obtainERC(EvolutionState state, int genomeVal, int threadnum, GPNode node, HashMap ercMapsForFancyPrint) Loads an ERC from the ERCBank given the value in the genome.

Methods in ec.gp.ge with parameters of type GPNode

Modifier and Type	Method and Description
List	GESpecies.gatherNodeString(EvolutionState state, int threadnum, GPNode node, int index) Used by the above function
String	GESpecies.getKeyFromNode(EvolutionState state, int threadnum, GPNode node, int index)
GPNode	GESpecies.obtainERC(EvolutionState state, int genomeVal, int threadnum, GPNode node, HashMap ercMapsForFancyPrint) Loads an ERC from the ERCBank given the value in the genome.

Uses of GPNode in ec.gp.koza

Methods in ec.gp.koza that return GPNode

Modifier and Type	Method and Description
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

Modifier and Type	Method and Description
boolean	CrossoverPipeline.verifyPoints(GPInitializer initializer, GPNode inner1, GPNode inner2) Returns true if inner1 can feasibly be swapped into inner2's position.
boolean	MutationPipeline.verifyPoints(GPNode inner1, GPNode inner2) Returns true if inner1 can feasibly be swapped into inner2's position

Uses of GPNode in ec.gp.push

Subclasses of GPNode in ec.gp.push

Modifier and Type	Class and Description
class	Nonterminal ECJ implements Push's s-expressions as trees of nonterminals and terminals.
class	Terminal Terminal is the leaf node in Push trees and is used to represent Push instructions of all types.

Fields in ec.gp.push declared as GPNode

Modifier and Type	Field and Description
(package private) GPNode[]	PushBuilder.dummy

Methods in ec.gp.push that return GPNode

Modifier and Type	Method and Description
GPNode	PushBuilder.newRootedTree(EvolutionState state, GPType type, int thread, GPNodeParent parent, GPFunctionSet set, int argposition, int requestedSize)
GPNode[]	PushBuilder.shuffle(GPNode[] objs, EvolutionState state, int thread)

Methods in ec.gp.push with parameters of type GPNode

Modifier and Type	Method and Description
boolean	Terminal.nodeEquals(GPNode other)
GPNode[]	PushBuilder.shuffle(GPNode[] objs, EvolutionState state, int thread)