All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.amihaiemil.eva.GenerationReplacement Maven / Gradle / Ivy

The newest version!
/*
 Copyright (c) 2016, Mihai-Emil Andronache
 All rights reserved.

 Redistribution and use in source and binary forms, with or without modification,
 are permitted provided that the following conditions are met:
 1. Redistributions of source code must retain the above copyright notice,
 this list of conditions and the following disclaimer.
 2. Redistributions in binary form must reproduce the above copyright notice,
 this list of conditions and the following disclaimer in the documentation
 and/or other materials provided with the distribution.
 3. Neither the name of the copyright holder nor the names of its contributors
 may be used to endorse or promote products derived from this software
 without specific prior written permission.

 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
 THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 ARE DISCLAIMED.
 IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
 INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package com.amihaiemil.eva;

/**
 * A replacement algorithm for generations. At every iteration of the algorithm, the
 * current generation of solution has to be replaced by a new one.
 * @author Mihai Andronache ([email protected])
 * @version $Id: 695cd5bc62e58f375fe695ebfd93e45aafa1ac41 $
 * @since 1.0.0
 *
 */
public abstract class GenerationReplacement {

    /**
     * Replace the current generation somehow, taking into account the new one.
     * @param current Current generation in this iteration.
     * @param newPne New generation.
     * @return Generation that the algorithm will work with in the next iteration.
     */
    public abstract Generation replace(Generation current, Generation newOne);
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy