Coverage Report - org.dishevelled.evolve.recombine.AsexualRecombination
 
Classes in this File Line Coverage Branch Coverage Complexity
AsexualRecombination
100%
6/6
100%
2/2
1.5
 
 1  
 /*
 2  
 
 3  
     dsh-evolve  Framework for evolutionary algorithms.
 4  
     Copyright (c) 2005-2013 held jointly by the individual authors.
 5  
 
 6  
     This library is free software; you can redistribute it and/or modify it
 7  
     under the terms of the GNU Lesser General Public License as published
 8  
     by the Free Software Foundation; either version 3 of the License, or (at
 9  
     your option) any later version.
 10  
 
 11  
     This library is distributed in the hope that it will be useful, but WITHOUT
 12  
     ANY WARRANTY; with out even the implied warranty of MERCHANTABILITY or
 13  
     FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
 14  
     License for more details.
 15  
 
 16  
     You should have received a copy of the GNU Lesser General Public License
 17  
     along with this library;  if not, write to the Free Software Foundation,
 18  
     Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA.
 19  
 
 20  
     > http://www.fsf.org/licensing/licenses/lgpl.html
 21  
     > http://www.opensource.org/licenses/lgpl-license.php
 22  
 
 23  
 */
 24  
 package org.dishevelled.evolve.recombine;
 25  
 
 26  
 import java.util.Collection;
 27  
 import java.util.ArrayList;
 28  
 
 29  
 import org.dishevelled.evolve.Recombination;
 30  
 
 31  
 /**
 32  
  * Abstract asexual recombination function implementation.
 33  
  * Subclasses need only to implement the abstract individual-wise method
 34  
  * <code>I recombine(I)</code>.
 35  
  *
 36  
  * @param <I> individual type
 37  
  * @author  Michael Heuer
 38  
  */
 39  2
 public abstract class AsexualRecombination<I>
 40  
     implements Recombination<I>
 41  
 {
 42  
 
 43  
     /** {@inheritDoc} */
 44  
     public final Collection<I> recombine(final Collection<I> population)
 45  
     {
 46  1
         Collection<I> recombined = new ArrayList<I>(population.size());
 47  
 
 48  1
         for (I individual : population)
 49  
         {
 50  3
             recombined.add(recombine(individual));
 51  3
         }
 52  1
         return recombined;
 53  
     }
 54  
 
 55  
     /**
 56  
      * Recombine the specified individual asexually, returning
 57  
      * a new individual.
 58  
      *
 59  
      * @param individual individual to recombine asexually
 60  
      * @return a new individual recombined from the specified individual
 61  
      */
 62  
     protected abstract I recombine(I individual);
 63  
 }