Packages

object AlgoSettings extends Serializable

Linear Supertypes
Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AlgoSettings
  2. Serializable
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. type Combine[A] = (Seed, A, A) => (Seed, A)
  2. type Generation = Int
  3. type Offset = Int
  4. type OffsetLikelihood = (Set[Int], Double)

    when choosing a gene at some population index i, this is the index of the next index to find

  5. type PartnerIndex = Int
  6. type PopulationSize = Int

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply[A](maxPopulationSize: Int, maxGenerations: Int)(combine: Combine[A])(implicit arg0: Ordering[A], arg1: Show[A]): Builder1[A]
  5. def apply[A](implicit instance: AlgoSettings[A]): AlgoSettings[A]
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException])
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  11. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def nextMateIndices(forIndex: Int, populationSize: PopulationSize): State[Seed, Seq[Int]]

    We assume indices near the 'top' (e.g.

    We assume indices near the 'top' (e.g. closes to zero, furthest from populationSize) are 'fitter', so we give them more of an opportunity to produce multiple mates.

    If the index is in the top 30% of the population, we give it a 75% of having multiple mates If the index is in the top 60% of the population, we give it a 50% of having multiple mates Otherwise we give it a 25% of having multiple mates

  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  19. def toString(): String
    Definition Classes
    AnyRef → Any
  20. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  21. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  23. object dsl

    Some builder syntax.

    Some builder syntax. You don't have to use this.

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped