| Package | Description |
|---|---|
| ec.gp | |
| ec.gp.breed | |
| ec.gp.build | |
| ec.gp.koza |
| Modifier and Type | Method and Description |
|---|---|
boolean |
GPSetType.compatibleWith(GPInitializer initializer,
GPType t) |
boolean |
GPAtomicType.compatibleWith(GPInitializer initializer,
GPType t) |
abstract boolean |
GPType.compatibleWith(GPInitializer initializer,
GPType t)
Am I compatible with ("fit" with) t? For two atomic
types, this is done by direct pointer equality.
|
GPNodeConstraints |
GPNode.constraints(GPInitializer initializer) |
GPTreeConstraints |
GPTree.constraints(GPInitializer initializer) |
GPType |
GPNode.parentType(GPInitializer initializer)
Returns the argument type of the slot that I fit into in my parent.
|
boolean |
GPNode.swapCompatibleWith(GPInitializer initializer,
GPNode node)
Returns true if I can swap into node's position.
|
| Modifier and Type | Method and Description |
|---|---|
private int |
MutateDemotePipeline._numDemotableNodes(GPInitializer initializer,
GPNode root,
int soFar,
GPFunctionSet set) |
private int |
MutateDemotePipeline._pickDemotableNode(GPInitializer initializer,
GPNode root,
int num,
GPFunctionSet set) |
private boolean |
MutateDemotePipeline.demotable(GPInitializer initializer,
GPNode node,
GPFunctionSet set) |
private int |
MutateDemotePipeline.numDemotableNodes(GPInitializer initializer,
GPNode root,
int soFar,
GPFunctionSet set) |
private int |
MutatePromotePipeline.numPromotableNodes(GPInitializer initializer,
GPNode root,
int soFar) |
private int |
MutateSwapPipeline.numSwappableNodes(GPInitializer initializer,
GPNode root,
int soFar) |
private int |
MutateDemotePipeline.pickDemotableNode(GPInitializer initializer,
GPNode root,
int num,
GPFunctionSet set) |
private int |
MutatePromotePipeline.pickPromotableNode(GPInitializer initializer,
GPNode root,
int num) |
private int |
MutateSwapPipeline.pickSwappableNode(GPInitializer initializer,
GPNode root,
int num) |
private boolean |
MutatePromotePipeline.promotable(GPInitializer initializer,
GPNode node) |
private boolean |
MutateSwapPipeline.swappable(GPInitializer initializer,
GPNode node)
This very expensive method (for types)
might be improved in various ways I guess.
|
(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.
|
| Modifier and Type | Method and Description |
|---|---|
(package private) GPNode |
Uniform.createTreeOfType(EvolutionState state,
int thread,
GPInitializer initializer,
int functionset,
int type,
int size,
MersenneTwisterFast mt) |
(package private) void |
Uniform.fillNodeWithChildren(EvolutionState state,
int thread,
GPInitializer initializer,
int functionset,
GPNode parent,
GPNode parentc,
int pickchild,
int outof,
MersenneTwisterFast mt) |
BigInteger |
Uniform.numChildPermutations(GPInitializer initializer,
int functionset,
GPNode parent,
int size,
int outof,
int pickchild) |
BigInteger |
Uniform.numTreesOfType(GPInitializer initializer,
int functionset,
int type,
int size) |
BigInteger |
Uniform.numTreesRootedByNode(GPInitializer initializer,
int functionset,
GPNode node,
int size) |
| 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.
|
Copyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.