BestRankedNicheElitism

abstract def archive(a: A, oldIndividuals: Population[G, P, F], offspring: Population[G, P, F])(implicit rng: Random): A

abstract def initialArchive(implicit rng: Random): A

abstract def niche(individual: Individual[G, P, F]): NICHE

abstract def rank(values: Population[G, P, F]): Seq[Lazy[Int]]

Compute the rank of a set of individuals.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def computeElitism(oldGeneration: Population[G, P, F], offspring: Population[G, P, F], archive: A)(implicit rng: Random): Population[G, P, F]

def elitism(oldGeneration: Population[G, P, F], offspring: Population[G, P, F], archive: A)(implicit rng: Random): Population[G, P, F]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filter(population: Population[G, P, F]): Population[G, P, F]

Filter the individuals

def finalize(): Unit

def fitness(f: F): F

def fitness(individual: Individual[G, P, F]): Seq[Double]

def genomesEqualOn(g: G): Any

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def keep(population: Population[G, P, F])(implicit rng: Random): Population[G, P, F]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit