| Package | Description |
|---|---|
| ec.gp.ge |
| Modifier and Type | Method and Description |
|---|---|
GEIndividual |
GESpecies.reverseMap(EvolutionState state,
GPIndividual ind,
int threadnum)
Reverse of the original map() function, takes a GPIndividual and returns
a corresponding GEIndividual; The GPIndividual may contain more than one trees,
and such cases are handled accordingly, see the 3rd bullet below --
NOTE:
This reverse mapping is only valid for S-expression trees ;
This procedure supports ERC for the current population (not for population
/subpopulation from other islands); However, that could be done by merging
all ERCBanks from all the sub-populations but that is not done yet ;
Support for the ADF's are done as follows -- suppose in one GPIndividual,
there are N trees -- T1, T2, ,,, Tn and each of them follows n different
grammars G1, G2, ,,, Gn respectively; now if they are reverse-mapped to
int arrays, there will be n int arrays A1[], A2[], ,,, An[]; and suppose
the i-th tree Ti is reverse mapped to int array Ai[] and morevoer Ai[] is
the longest among all the arrays (Bj[]s); so Bi[] is sufficient to build
all ADF trees Tjs.
|
| Modifier and Type | Method and Description |
|---|---|
int |
GESpecies.consumed(EvolutionState state,
GEIndividual ind,
int threadnum)
Returns the number of elements consumed from the GEIndividual array to produce
the tree, else returns -1 if an error occurs, specifically if all elements were
consumed and the tree had still not been completed.
|
int |
GESpecies.makeTrees(EvolutionState state,
GEIndividual ind,
GPTree[] trees,
int threadnum,
HashMap ercMapsForFancyPrint)
creates all of an individual's trees
|
GPIndividual |
GESpecies.map(EvolutionState state,
GEIndividual ind,
int threadnum,
HashMap ercMapsForFancyPrint)
Returns a dummy GPIndividual with a single tree which was built by mapping
over the elements of the given GEIndividual.
|
Copyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.