/*
 * Java Genetic Algorithm Library (@__identifier__@).
 * Copyright (c) @__year__@ Franz Wilhelmstötter
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
 * Author:
 *    Franz Wilhelmstötter (franz.wilhelmstoetter@gmail.com)
 */
package io.jenetics.ext;

/**
 * @author <a href="mailto:franz.wilhelmstoetter@gmail.com">Franz Wilhelmstötter</a>
 * @version !__version__!
 * @since !__version__!
 */
public class UFTournamentSelector {
}

@@ -767,185 +767,1878 @@
 t;%0A%0A
-/**%0A * @author %3Ca href=%22mailto:franz.wilhelmstoetter@gmail.com%22%3EFranz Wilhelmst%C3%B6tter%3C/a%3E%0A * @version !__version__!%0A * @since !__version__!%0A */%0Apublic class UFTournamentSelector %7B
+import io.jenetics.Gene;%0Aimport io.jenetics.Optimize;%0Aimport io.jenetics.Phenotype;%0Aimport io.jenetics.Selector;%0Aimport io.jenetics.util.ISeq;%0Aimport io.jenetics.util.Seq;%0A%0A/**%0A * The last front selection procedure takes two arguments: a front F and the%0A * number of solutions to select k. The algorithm starts by sorting the unique%0A * fitnesses associated with the members of F in descending order of crowding%0A * distance (%3Edist) and stores the result in a list F (line 2). It then proceeds%0A * to fill the initially empty set of solutions S by cycling over the sorted%0A * unique fitnesses F. For each fitness, the algorithm first selects each%0A * individual sharing this fitness and puts the result in set T (line 6). If%0A * the resulting set is not empty, the procedure randomly picks one solution%0A * from T, adds it to set S and finally removes it from the front F so that%0A * individuals can be picked only once (lines 8 to 10). When all k solutions%0A * have been selected, the loop stops and set S is returned (line 14).%0A *%0A * %3Cp%3E%0A *  %3Cb%3EReference:%3C/b%3E%3Cem%3E%0A *      F%C3%A9lix-Antoine Fortin and Marc Parizeau. 2013. Revisiting the NSGA-II%0A *      crowding-distance computation. In Proceedings of the 15th annual%0A *      conference on Genetic and evolutionary computation (GECCO '13),%0A *      Christian Blum (Ed.). ACM, New York, NY, USA, 623-630.%0A *      DOI=%3Ca href=%22http://dx.doi.org/10.1145/2463372.2463456%22%3E%0A *          10.1145/2463372.2463456%3C/a%3E%3C/em%3E%0A *%0A *%0A * @author %3Ca href=%22mailto:franz.wilhelmstoetter@gmail.com%22%3EFranz Wilhelmst%C3%B6tter%3C/a%3E%0A * @version !__version__!%0A * @since !__version__!%0A */%0Apublic class UFTournamentSelector%3C%0A%09G extends Gene%3C?, G%3E,%0A%09C extends Comparable%3C? super C%3E%0A%3E%0A%09implements Selector%3CG, C%3E%0A%7B%0A%09@Override%0A%09public ISeq%3CPhenotype%3CG, C%3E%3E select(%0A%09%09final Seq%3CPhenotype%3CG, C%3E%3E population,%0A%09%09final int count,%0A%09%09final Optimize opt%0A%09) %7B%0A%09%09return null;%0A%09%7D
 %0A%7D%0A

Add Javadoc.