/*
* <t-MultiStart.cpp>
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
* (C) OPAC Team, LIFL, 2002-2008
*
* Clive Canape
*
* This software is governed by the CeCILL license under French law and
* abiding by the rules of distribution of free software.  You can  use,
* modify and/ or redistribute the software under the terms of the CeCILL
* license as circulated by CEA, CNRS and INRIA at the following URL
* "http://www.cecill.info".
*
* As a counterpart to the access to the source code and  rights to copy,
* modify and redistribute granted by the license, users are provided only
* with a limited warranty  and the software's author,  the holder of the
* economic rights,  and the successive licensors  have only  limited liability.
*
* In this respect, the user's attention is drawn to the risks associated
* with loading,  using,  modifying and/or developing or reproducing the
* software by the user in light of its specific status of free software,
* that may mean  that it is complicated to manipulate,  and  that  also
* therefore means  that it is reserved for developers  and  experienced
* professionals having in-depth computer knowledge. Users are therefore
* encouraged to load and test the software's suitability as regards their
* requirements in conditions enabling the security of their systems and/or
* peoData to be ensured and,  more generally, to use and operate it in the
* same conditions as regards security.
* The fact that you are presently reading this means that you have had
* knowledge of the CeCILL license and that you accept its terms.
*
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
* Contact: paradiseo-help@lists.gforge.inria.fr
*
*/


// Test : multistart

#include <peo>

struct Algorithm
  {
    void operator()(double & _d)
    {
      _d = _d * _d;
    }
  };

int main (int __argc, char * * __argv)
{

  peo :: init (__argc, __argv);
  if (getNodeRank()==1)
    std::cout<<"\n\nTest : multistart\n\n";
  std::vector < double > v;
  if (getNodeRank()==1)
    std::cout<<"\n\nBefore :";
  for (unsigned i = 0; i< 10; i++)
    {
      v.push_back(i);
      if (getNodeRank()==1)
        std::cout<<"\n"<<v[i];
    }
  Algorithm algo;
  peoMultiStart < double > initParallel (algo);
  peoWrapper parallelAlgo (initParallel, v);
  initParallel.setOwner(parallelAlgo);
  peo :: run( );
  peo :: finalize( );
  if (getNodeRank()==1)
    {
      std::cout<<"\n\nAfter :\n";
      for (unsigned i = 0; i< 10; i++)
        std::cout<<v[i]<<"\n";
    }
}