Query: pgasortpop
OS: debian
Section: 8
Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar
PGASortPop(8) PGAPack PGASortPop(8)NAMEPGASortPop - Creates an (internal) array of indices according to one of three criteria.DESCRIPTIONIf PGA_POPREPL_BEST is used (the default) the array is sorted from most fit to least fit. If PGA_POPREPL_RANDOM_REP is used the indices in the array are selected randomly with replacement. If PGA_POPREPL_RANDOM_NOREP is used the indices in the array are selected randomly with- out replacement. The function PGASetPopReplaceType() is used to specify which strategy is used. The indices of the sorted population mem- bers may then be accessed from the internal array via PGAGetSortedPopIndex(). This routine is typically used during population replace- ment.INPUT PARAMETERSctx - context variable popindex - symbolic constant of the population from which to create the srted array.OUTPUT PARAMETERSnoneSYNOPSIS#include "pgapack.h" void PGASortPop(ctx, pop) PGAContext *ctx int popLOCATIONpop.cEXAMPLEExample: Copy the five best strings from the old population into the new population. The rest of the new population will be created by recombination, and is not shown. PGAContext *ctx; int i,j; : PGASetPopReplaceType(ctx,PGA_POPREPL_BEST) : PGASortPop(ctx, PGA_OLDPOP); for ( i=0; i < 5; i++) { j = PGAGetSortedPopIndex(ctx, i); PGACopyIndividual (ctx, j, PGA_OLDPOP, i, PGA_NEWPOP); : 05/01/95 PGASortPop(8)
| Related Man Pages |
|---|
| pgasetintegerinitrange(2) - debian |
| pgasetrealinitrange(2) - debian |
| pgaduplicate(8) - debian |
| pgasortpop(8) - debian |
| bio::popgen::populationi(3pm) - debian |
| Similar Topics in the Unix Linux Community |
|---|
| find an available item in array |
| India – big potential for algorithmic trading |
| Efficient population of array from text file |
| How to select lines randomly without replacement in UNIX? |