TournamentOnHitCount

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

abstract def selection(population: Population[G, P, F], archive: A)(implicit rng: Random): Iterator[Individual[G, P, F]]

Select an individual among the population.

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (TournamentOnHitCount, B)

final def ==(arg0: Any): Boolean

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

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def combine(a1: A, a2: A): A

def ensuring(cond: (TournamentOnHitCount) ⇒ Boolean, msg: ⇒ Any): TournamentOnHitCount

def ensuring(cond: (TournamentOnHitCount) ⇒ Boolean): TournamentOnHitCount

def ensuring(cond: Boolean, msg: ⇒ Any): TournamentOnHitCount

def ensuring(cond: Boolean): TournamentOnHitCount

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def evaluate(population: Population[G, P, F], archive: A)(implicit rng: Random): Seq[Evaluation]

def finalize(): Unit

def formatted(fmtstr: String): String

def genomesEqualOn(g: G): Any

final def getClass(): Class[_]

def hashCode(): Int

def hits(a: A, c: NICHE): Int

def initialArchive(implicit rng: Random): scala.collection.Map[NICHE, Int]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def toString(): String

def tournament(e1: IndividualEvaluation, e2: IndividualEvaluation)(implicit rng: Random): IndividualEvaluation

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def →[B](y: B): (TournamentOnHitCount, B)