Class LawnERC
- java.lang.Object
-
- ec.gp.GPNode
-
- ec.gp.ERC
-
- ec.app.lawnmower.func.LawnERC
-
- All Implemented Interfaces:
- GPNodeParent, Prototype, Setup, java.io.Serializable, java.lang.Cloneable
public class LawnERC extends ERC
- See Also:
- Serialized Form
-
-
Field Summary
Fields Modifier and Type Field and Description intmaxxintmaxyintxinty-
Fields inherited from class ec.gp.GPNode
argposition, children, CHILDREN_UNKNOWN, constraints, GPNODEPRINTTAB, MAXPRINTBYTES, NODESEARCH_ALL, NODESEARCH_NONTERMINALS, NODESEARCH_TERMINALS, P_NODE, P_NODECONSTRAINTS, parent
-
-
Constructor Summary
Constructors Constructor and Description LawnERC()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method and Description booleandecode(DecodeReturn dret)Decodes data into the ERC from dret.java.lang.Stringencode()Encodes data from the ERC, using ec.util.Code.voideval(EvolutionState state, int thread, GPData input, ADFStack stack, GPIndividual individual, Problem problem)Evaluates the node with the given thread, state, individual, problem, and stack.booleannodeEquals(GPNode node)Implement this to do ERC-to-ERC comparisons.intnodeHashCode()Implement this to hash ERCs, along with other nodes, in such a way that two "equal" ERCs will usually hash to the same value.voidreadNode(EvolutionState state, java.io.DataInput dataInput)To successfully read from a DataOutput, you must override this to read your specific ERC data in.voidresetNode(EvolutionState state, int thread)Remember to override this to randomize your ERC after it has been cloned.voidsetup(EvolutionState state, Parameter base)Sets up a prototypical GPNode with those features all nodes of that prototype share, and nothing more.java.lang.StringtoStringForHumans()You might want to override this to return a special human-readable version of the erc value; otherwise this defaults to toString(); This should be something that resembles a LISP atom.voidwriteNode(EvolutionState state, java.io.DataOutput dataOutput)To successfully write to a DataOutput, you must override this to write your specific ERC data out.-
Methods inherited from class ec.gp.GPNode
atDepth, checkConstraints, clone, cloneReplacing, cloneReplacing, cloneReplacing, cloneReplacingAtomic, cloneReplacingAtomic, cloneReplacingNoSubclone, constraints, contains, defaultBase, depth, errorInfo, iterator, iterator, iterator, lightClone, makeCTree, makeGraphvizTree, makeLatexTree, makeLispTree, makeLispTree, nodeEquivalentTo, nodeInPosition, nodeInPosition, numNodes, numNodes, parentType, pathLength, printNode, printNode, printNode, printNodeForHumans, printNodeForHumans, printRootedTree, printRootedTree, printRootedTree, printRootedTreeForHumans, printRootedTreeForHumans, readRootedTree, readRootedTree, replaceWith, rootedTreeEquals, rootedTreeHashCode, rootParent, swapCompatibleWith, toStringForError, writeRootedTree
-
-
-
-
Method Detail
-
setup
public void setup(EvolutionState state, Parameter base)
Description copied from class:GPNodeSets up a prototypical GPNode with those features all nodes of that prototype share, and nothing more. So no filled-in children, no argposition, no parent. Yet. This must be called after the GPTypes and GPNodeConstraints have been set up. Presently they're set up in GPInitializer, which gets called before this does, so we're safe. You should override this if you need to load some special features on a per-function basis. Note that base hangs off of a function set, so this method may get called for different instances in the same GPNode class if they're being set up as prototypes for different GPFunctionSets. If you absolutely need some global base, then you should use something hanging off of GPDefaults.base(). The ultimate caller of this method must guarantee that he will eventually call state.output.exitIfErrors(), so you can freely use state.output.error instead of state.output.fatal(), which will help a lot.
-
resetNode
public void resetNode(EvolutionState state, int thread)
Description copied from class:ERCRemember to override this to randomize your ERC after it has been cloned. The prototype will not ever receive this method call.
-
nodeHashCode
public int nodeHashCode()
Description copied from class:ERCImplement this to hash ERCs, along with other nodes, in such a way that two "equal" ERCs will usually hash to the same value. The default value, which may not be very good, is a combination of the class hash code and the hash code of the string returned by encode(). You might make a better hash value.- Overrides:
nodeHashCodein classERC
-
nodeEquals
public boolean nodeEquals(GPNode node)
Description copied from class:ERCImplement this to do ERC-to-ERC comparisons.- Specified by:
nodeEqualsin classERC
-
readNode
public void readNode(EvolutionState state, java.io.DataInput dataInput) throws java.io.IOException
Description copied from class:ERCTo successfully read from a DataOutput, you must override this to read your specific ERC data in. The default implementation issues a fatal error.
-
writeNode
public void writeNode(EvolutionState state, java.io.DataOutput dataOutput) throws java.io.IOException
Description copied from class:ERCTo successfully write to a DataOutput, you must override this to write your specific ERC data out. The default implementation issues a fatal error.
-
encode
public java.lang.String encode()
Description copied from class:ERCEncodes data from the ERC, using ec.util.Code.
-
decode
public boolean decode(DecodeReturn dret)
Description copied from class:ERCDecodes data into the ERC from dret. Return true if you sucessfully decoded, false if you didn't. Don't increment dret.pos's value beyond exactly what was needed to decode your ERC. If you fail to decode, you should make sure that the position and data in the dret are exactly as they were originally.
-
toStringForHumans
public java.lang.String toStringForHumans()
Description copied from class:ERCYou might want to override this to return a special human-readable version of the erc value; otherwise this defaults to toString(); This should be something that resembles a LISP atom. If a simple number or other object won't suffice, you might use something that begins with name() + [ + ... + ]- Overrides:
toStringForHumansin classERC
-
eval
public void eval(EvolutionState state, int thread, GPData input, ADFStack stack, GPIndividual individual, Problem problem)
Description copied from class:GPNodeEvaluates the node with the given thread, state, individual, problem, and stack. Your random number generator will be state.random[thread]. The node should, as appropriate, evaluate child nodes with these same items passed to eval(...).About input: input is special; it is how data is passed between parent and child nodes. If children "receive" data from their parent node when it evaluates them, they should receive this data stored in input. If (more likely) the parent "receives" results from its children, it should pass them an input object, which they'll fill out, then it should check this object for the returned value.
A tree is typically evaluated by dropping a GPData into the root. When the root returns, the resultant input should hold the return value.
In general, you should not be creating new GPDatas. If you think about it, in most conditions (excepting ADFs and ADMs) you can use and reuse input for most communications purposes between parents and children.
So, let's say that your GPNode function implements the boolean AND function, and expects its children to return return boolean values (as it does itself). You've implemented your GPData subclass to be, uh, BooleanData, which looks like
public class BooleanData extends GPData { public boolean result; public GPData copyTo(GPData gpd) { ((BooleanData)gpd).result = result; } }...so, you might implement your eval(...) function as follows:
public void eval(final EvolutionState state, final int thread, final GPData input, final ADFStack stack, final GPIndividual individual, final Problem problem { BooleanData dat = (BooleanData)input; boolean x; // evaluate the first child children[0].eval(state,thread,input,stack,individual,problem); // store away its result x = dat.result; // evaluate the second child children[1].eval(state,thread,input,stack,individual,problem); // return (in input) the result of the two ANDed dat.result = dat.result && x; return; }
-
-
DMelt 3.0 © DataMelt by jWork.ORG