/*    cpplibga, free library of genetic algorithms.    Copyright (C) 2003  Burger Y.A. (aka Jo Kruger)    This program is free software; you can redistribute it and/or modify    it under the terms of the GNU General Public License as published by    the Free Software Foundation; either version 2 of the License, or    (at your option) any later version.    This program 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 General Public License for more details.    You should have received a copy of the GNU General Public License    along with this program; if not, write to the Free Software    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USAContacts:   address: planet Terra   e-mail:  jo_kruger@mail.ru            kruger@selena.net.ua*/#ifndef __CPPLIBGA_REPRODUCTION_UNIFIEDCROSSOVER_H__#define __CPPLIBGA_REPRODUCTION_UNIFIEDCROSSOVER_H__#include <stdlib.h>#include <cpplibga/Types.h>namespace cpplibga{    namespace reproduction    {	class UnifiedCrossover	{	    public:	    		template<typename P, typename S, typename A>		void reproduct(const P& pair,			       S* solutions,			       A* allocator)		{		    typedef typename A::result_type   Child;                    typedef typename A::solution_type Solution;                    		    Child child=allocator->New();                    genotype_size_type size=Solution::size();		                        for(genotype_size_type t=0; t<size; ++t)		    {			child->setGene(t, ((rand()<RAND_MAX/2)?(pair.first):(pair.second))->getGene(t));		    }                    		    solutions->push_back(child);		}	};    }}#endif