object
elitism
Type Members
-
type
CloneStrategy[M[_], I] = (Vector[I]) ⇒ M[Vector[I]]
-
type
Elitism[M[_], I] = Kleisli[M, Vector[I], Vector[I]]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
def
addHits[M[_], I, C](cell: (I) ⇒ C, mapped: Lens[I, Boolean])(implicit arg0: Monad[M], MH: HitMapper[M, C]): Kleisli[M, Vector[I], Vector[I]]
-
def
applyCloneStrategy[M[_], I, G](getGenome: (I) ⇒ G, cloneStrategy: CloneStrategy[M, I])(implicit MM: Monad[M]): Elitism[M, I]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
incrementGeneration[M[_], I](age: Lens[I, Long])(implicit arg0: Monad[M], MG: Generational[M]): Elitism[M, I]
-
final
def
isInstanceOf[T0]: Boolean
-
def
keepHighestRanked[M[_], I, K](f: Kleisli[M, Vector[I], Vector[K]], mu: Int)(implicit MM: Monad[M], KO: Order[K]): Elitism[M, I]
-
def
keepYoungest[M[_], I](age: (I) ⇒ Long)(implicit arg0: Monad[M]): CloneStrategy[M, I]
-
def
maximiseO[M[_], I, F](f: (I) ⇒ F, mu: Int)(implicit MM: Monad[M], FO: Order[F]): Elitism[M, I]
-
def
mergeHistories[M[_], I, P](age: Lens[I, Long], history: Lens[I, Vector[P]])(historySize: Int)(implicit arg0: Monad[M]): CloneStrategy[M, I]
-
def
minimiseO[M[_], I, F](f: (I) ⇒ F, mu: Int)(implicit MM: Monad[M], FO: Order[F]): Elitism[M, I]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
randomO[M[_], I](n: Int)(implicit MM: Monad[M], MR: RandomGen[M]): Elitism[M, I]
-
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
Inherited from AnyRef
Inherited from Any
