Coverage Report - org.dishevelled.evolve.ExitStrategy
 
Classes in this File Line Coverage Branch Coverage Complexity
ExitStrategy
N/A
N/A
1
 
 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;
 25  
 
 26  
 import java.util.Collection;
 27  
 
 28  
 import org.dishevelled.weighted.WeightedMap;
 29  
 
 30  
 /**
 31  
  * An exit strategy function.
 32  
  *
 33  
  * @param <I> individual type
 34  
  * @author  Michael Heuer
 35  
  */
 36  
 public interface ExitStrategy<I>
 37  
 {
 38  
 
 39  
     /**
 40  
      * Return <code>true</code> if the specified population has met
 41  
      * the criteria of this exit strategy function.
 42  
      *
 43  
      * @param population population
 44  
      * @param scores fitness scores
 45  
      * @param time time
 46  
      * @return true if the specified population has met the criteria
 47  
      *    of this exit strategy function
 48  
      */
 49  
     boolean evaluate(Collection<I> population, WeightedMap<I> scores, int time);
 50  
 }