nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

doing things work on VC++

Browse source
This commit is contained in:
gustavo 1999-02-15 11:55:59 +00:00
commit 1eaeece266
1 changed files with 7 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

13
eo/src/eoBreeder.h
View file

@ -38,6 +38,8 @@ template<class Chrom> class eoBreeder: public eoTransform<Chrom>
*/
void operator()(eoPop<Chrom>& pop)
{
unsigned i;
for (Operators::const_iterator op = operators.begin();
op != operators.end();
op++)
@ -46,16 +48,15 @@ template<class Chrom> class eoBreeder: public eoTransform<Chrom>
case unary:
{
eoMonOp<Chrom>& monop = (eoMonOp<Chrom>&)*(op->second);
for (unsigned i = 0; i < pop.size(); i++)
for (i = 0; i < pop.size(); i++)
if (uniform() < op->first)
monop(pop[i]);
break;
}
case binary:
{
vector<unsigned> pos(pop.size(), 1);
pos[0] = 0;
partial_sum(pos.begin(), pos.end(), pos.begin());
{
vector<unsigned> pos(pop.size());
iota(pos.begin(), pos.end(), 0);
random_shuffle(pos.begin(), pos.end());
cout << "pos = ";
@ -64,7 +65,7 @@ template<class Chrom> class eoBreeder: public eoTransform<Chrom>
cout << endl;
eoBinOp<Chrom>& binop = (eoBinOp<Chrom>&)*(op->second);
for (unsigned i = 1; i < pop.size(); i += 2)
for (i = 1; i < pop.size(); i += 2)
if (uniform() < op->first)
binop(pop[pos[i - 1]], pop[pos[i]]);
break;