/**
* Copyright (C) 2001-2017 by RapidMiner and the contributors
*
* Complete list of developers available at our web site:
*
* http://rapidminer.com
*
* This program is free software: you can redistribute it and/or modify it under the terms of the
* GNU Affero General Public License as published by the Free Software Foundation, either version 3
* 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
* Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License along with this program.
* If not, see http://www.gnu.org/licenses/.
*/
package com.rapidminer.operator.features;
/**
* Keeps the <i>n</i> best individuals and kicks out the rest.
*
* @author Simon Fischer, Ingo Mierswa
*/
public class KeepBest implements PopulationOperator {
private int bestN;
public KeepBest(int bestN) {
this.bestN = bestN;
}
/** The default implementation returns true for every generation. */
@Override
public boolean performOperation(int generation) {
return true;
}
@Override
public void operate(Population pop) {
if (pop.getNumberOfIndividuals() > bestN) {
pop.sort();
while (pop.getNumberOfIndividuals() > bestN) {
pop.remove(0);
}
}
}
}