TournamentOnRankAndDiversity

abstract def diversity(values: Seq[Seq[Double]]): Seq[Lazy[Double]]

Compute the diversity metric of the values

abstract def fitness: Lens[F, Seq[Double]]

abstract def rank(values: Seq[Seq[Double]]): Seq[Lazy[Int]]

Compute the rank of a set of individuals.

abstract def selection(population: Population[G, P, F, MF])(implicit aprng: Random): Iterator[Individual[G, P, F]]

Select an individual among the population.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def diversity: Lens[MF, Lazy[Double]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filter(individuals: Seq[Individual[G, P, F]]): Seq[Individual[G, P, F]]

Filter the individuals

def finalize(): Unit

def fitnesses(evaluated: Seq[Individual[G, P, F]], archive: A): Seq[Seq[Double]]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def modify(evaluated: Seq[Individual[G, P, F]], archive: A): Population[G, P, F, MF]

Generate a population from a set of indiviuals

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def rank: Lens[MF, Lazy[Int]]

final def synchronized[T0](arg0: ⇒ T0): T0

def toPopulation(individuals: Seq[Individual[G, P, F]], a: A): Population[G, P, F, MF]

Generate a population from a set of indiviuals that is filtered in a first time

def toString(): String

def tournament(e1: PopulationElement[G, P, F, MF], e2: PopulationElement[G, P, F, MF])(implicit rng: Random): PopulationElement[G, P, F, MF]

Select the best ranked and if equal the more diverse individual between two population elements.

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit