/*
 * 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@gmx.at)
 */
package org.jenetics;

import static java.lang.String.format;
import static java.util.Objects.requireNonNull;

import org.jenetics.internal.util.Equality;
import org.jenetics.internal.util.Hash;

/**
 * In truncation selection individuals are sorted according to their fitness.
 * Only the n  best individuals are selected. The truncation selection is a very
 * basic selection algorithm. It has it's strength in fast selecting individuals
 * in large populations, but is not very often used in practice.
 *
 * @see <a href="http://en.wikipedia.org/wiki/Truncation_selection">
 * 			Wikipedia: Truncation selection
 *      </a>
 *
 * @author <a href="mailto:franz.wilhelmstoetter@gmx.at">Franz Wilhelmstötter</a>
 * @since 1.0
 * @version 2.0 &mdash; <em>$Date: 2014-08-12 $</em>
 */
public final class TruncationSelector<
	G extends Gene<?, G>,
	C extends Comparable<? super C>
>
	implements Selector<G, C>
{

	/**
	 * Create a new TruncationSelector object.
	 */
	public TruncationSelector() {
	}

	/**
	 * This method sorts the population in descending order while calculating
	 * the selection probabilities. (The method {@link Population#sort()} is
	 * called by this method.) If the selection size is greater the the
	 * population size, the whole population is duplicated until the desired
	 * sample size is reached.
	 *
	 * @throws NullPointerException if the {@code population} is {@code null}.
	 */
	@Override
	public Population<G, C> select(
		final Population<G, C> population,
		final int count,
		final Optimize opt
	) {
		requireNonNull(population, "Population");
		requireNonNull(opt, "Optimization");
		if (count < 0) {
			throw new IllegalArgumentException(format(
				"Selection count must be greater or equal then zero, but was %s",
				count
			));
		}

		population.sortWith(opt.<C>descending());
		final Population<G, C> selection = new Population<>(count);
		int size = count;
		do {
			final int length = Math.min(population.size(), size);
			selection.addAll(population.subList(0, length));
			size -= length;
		} while (size > 0);

		return selection;
	}

	@Override
	public int hashCode() {
		return Hash.of(getClass()).value();
	}

	@Override
	public boolean equals(final Object obj) {
		return Equality.ofType(this, obj);
	}

	@Override
	public String toString() {
		return getClass().getName();
	}

}

@@ -1505,17 +1505,17 @@
 014-08-1
-2
+6
  $%3C/em%3E%0A
@@ -1858,16 +1858,20 @@
 e method
+%0A%09 *
  %7B@link 
@@ -1889,18 +1889,41 @@
 sort
-(
+With(java.util.Comparator)%7D 
 )%7D is
-%0A%09 *
  cal
@@ -1933,16 +1933,20 @@
  by this
+%0A%09 *
  method.
@@ -1987,20 +1987,16 @@
  the the
-%0A%09 *
  populat
@@ -2008,16 +2008,20 @@
 ize, the
+%0A%09 *
  whole p
@@ -2061,20 +2061,16 @@
  desired
-%0A%09 *
  sample 

Fix javadoc.