/*
 *  Open BEAGLE
 *  Copyright (C) 2001-2004 by Christian Gagne and Marc Parizeau
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public
 *  License as published by the Free Software Foundation; either
 *  version 2.1 of the License, or (at your option) any later version.
 *
 *  This library is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this library; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 *  Contact:
 *  Laboratoire de Vision et Systemes Numeriques
 *  Departement de genie electrique et de genie informatique
 *  Universite Laval, Quebec, Canada, G1V 4J7
 *  http://vision.gel.ulaval.ca
 *
 */

/*!
 *  \file   beagle/MuCommaLambdaOp.hpp
 *  \brief  Definition of the class MuCommaLambdaOp.
 *  \author Christian Gagne
 *  \author Marc Parizeau
 *  $Revision: 1.2 $
 *  $Date: 2004/01/15 21:08:57 $
 */

 
#ifndef Beagle_MuCommaLambdaOp_hpp
#define Beagle_MuCommaLambdaOp_hpp

#include "beagle/config.hpp"
#include "beagle/macros.hpp"
#include "beagle/Object.hpp"
#include "beagle/Pointer.hpp"
#include "beagle/PointerT.hpp"
#include "beagle/Allocator.hpp"
#include "beagle/AllocatorT.hpp"
#include "beagle/AbstractAllocT.hpp"
#include "beagle/ContainerAllocator.hpp"
#include "beagle/Container.hpp"
#include "beagle/ContainerT.hpp"
#include "beagle/Operator.hpp"
#include "beagle/ReplacementStrategyOp.hpp"
#include "beagle/Float.hpp"
#include "beagle/UInt.hpp"

namespace Beagle {
  

/*!
 *  \class MuCommaLambdaOp beagle/MuCommaLambdaOp.hpp "beagle/MuCommaLambdaOp.hpp"
 *  \brief Mu comma lambda (Mu,Lambda) replacement strategy operator class.
 *  \ingroup ECF
 *  \ingroup Op
 *
 *  A (Mu,Lambda) operator generates Lambda children individuals from a population of Mu parents
 *  (where Lambda > Mu). From these Lambda individual, it keeps the Mu best to constitute the new 
 *  generation.
 */
class MuCommaLambdaOp : public ReplacementStrategyOp {

public:

  //! MuCommaLambdaOp allocator type.
  typedef AllocatorT<MuCommaLambdaOp,ReplacementStrategyOp::Alloc>
          Alloc;
  //! MuCommaLambdaOp handle type.
  typedef PointerT<MuCommaLambdaOp,ReplacementStrategyOp::Handle>
          Handle;
  //! MuCommaLambdaOp bag type.
  typedef ContainerT<MuCommaLambdaOp,ReplacementStrategyOp::Bag>
          Bag;

           MuCommaLambdaOp(std::string inLMRatioName="ec.mulambda.ratio",
                           std::string inName="MuCommaLambdaOp");
  virtual ~MuCommaLambdaOp() { }

  virtual void initialize(System& ioSystem);
  virtual void operate(Deme& ioDeme, Context& ioContext);
  virtual void readWithMap(XMLNode::Handle& inNode, OperatorMap& inOpMap);
  virtual void write(XMLStreamer& ioStreamer) const;
  
protected:
  UInt::Handle  mElitismKeepSize;      //!< Number of individuals keep with elitism
  Float::Handle mLMRatio;              //!< (Lambda / Mu) ratio to use for replacement operator.
  std::string   mLMRatioName;          //!< (Lambda / Mu) ratio parameter name used in register.

};

}


#endif // Beagle_MuCommaLambdaOp_hpp

