Ajout de incremental evaluation for the royal road problem

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1767 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
verel 2010-04-29 15:35:46 +00:00
commit 949fa3319d
2 changed files with 82 additions and 2 deletions

View file

@ -40,7 +40,7 @@ class RoyalRoadEval : public eoEvalFunc<EOT>
{
public:
/**
* Dfault constructor
* Default constructor
* @param _k size of a block
*/
RoyalRoad(unsigned int _k) : k(_k) {}
@ -58,7 +58,7 @@ public:
unsigned int n = _solution.size() / k;
for (i = 0; i < n; i++) {
offset = i * n;
offset = i * k;
j = 0;
while (_solution[offset + j] && j < k) j++;