redundanceremoval.java

著名的开源仿真软件yale

/*
 *  YALE - Yet Another Learning Environment
 *  Copyright (C) 2002, 2003
 *      Simon Fischer, Ralf Klinkenberg, Ingo Mierswa, 
 *          Katharina Morik, Oliver Ritthoff
 *      Artificial Intelligence Unit
 *      Computer Science Department
 *      University of Dortmund
 *      44221 Dortmund,  Germany
 *  email: [e-mail]
 *  web:   http://yale.cs.uni-dortmund.de/
 *
 *  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
 *  USA.
 */
package edu.udo.cs.yale.operator.features;

import java.util.List;
import java.util.LinkedList;

/** Ensures that every individual appears only once. 
 *
 *  @author simon
 *  @version $Id: RedundanceRemoval.java,v 2.1 2003/04/04 11:59:28 fischer Exp $
 */
public class RedundanceRemoval implements PopulationOperator {

    public void operate(Population pop) {
	for (int i = 0; i < pop.getNumberOfIndividuals()-1; i++) {
	    for (int j = pop.getNumberOfIndividuals()-1; j > i; j--) {
		if (pop.get(i).equals(pop.get(j))) pop.remove(j);
	    }
	}
    }
}