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

test added

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1801 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jhumeau 2010-05-07 14:55:37 +00:00
commit 2cf997ca72
20 changed files with 894 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

14
trunk/paradiseo-mo/src/continuator/moCombinedContinuator.h
View file

@ -32,6 +32,7 @@ Contact: paradiseo-help@lists.gforge.inria.fr
#include <continuator/moContinuator.h>
#include <neighborhood/moNeighborhood.h>
#include <vector>
/**
* Combined several continuators
* Continue until one of the continuators is false
@ -58,6 +59,15 @@ public:
continuators.push_back(&_cont);
}
/**
* init all continuators
* @param _solution a solution
*/
virtual void init(EOT & _solution) {
for(unsigned int i = 0; i < continuators.size(); ++i)
continuators[i]->init(_solution);
}
/**
*@param _solution a solution
*@return true all the continuators are true
@ -69,14 +79,14 @@ public:
// So, all continuators are tested
for(unsigned int i = 0; i < continuators.size(); ++i)
if ( !(*continuators[i])(_solution) )
bContinue = false;
bContinue = false;
return bContinue;
}
private:
/** continuators vector */
std::vector<moContinuator<Neighbor>*> continuators;
std::vector< moContinuator<Neighbor>* > continuators;
};
#endif