BGAMutation

abstract def clamp(values: SimpleLens[G, Seq[Double]]): SimpleLens[G, Seq[Double]]

abstract def genomeSize: Int

Size of the value part of the genome

abstract def randomGenome(implicit rng: Random): G

abstract def rawValues: SimpleLens[G, Seq[Double]]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def genomesEqualOn(g: G): Any

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def mutate(genome: G, population: Population[G, P, F], archive: A)(implicit rng: Random): G

Mutate a genome

def mutationRange: Double

def mutationRate: Double

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

def values: SimpleLens[G, Seq[Double]]

The value part of the genome actually used for the optimisation

final def wait(): Unit

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

final def wait(arg0: Long): Unit