Object

fr.iscpif.mgo

ranking

Related Doc: package mgo

Permalink

object ranking

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ranking
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Ranking[M[_], I] = Kleisli[M, Vector[I], Vector[Lazy[Int]]]

    Permalink

    Compute the ranks of the individuals in the same order

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. object Ranking

    Permalink
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  12. def hierarchicalRanking[M[_], I](fitness: Fitness[I, Vector[Double]])(implicit arg0: Monad[M]): Ranking[M, I]

    Permalink
  13. def hitCountRanking[M[_], I, C](cell: (I) ⇒ C)(implicit arg0: Monad[M], hm: HitMapper[M, C]): Ranking[M, I]

    Permalink
  14. def hyperVolumeRanking[M[_], I](referencePoint: Seq[Double], fitness: Fitness[I, Seq[Double]])(implicit arg0: Monad[M]): Ranking[M, I]

    Permalink
  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  16. def monoObjectiveRanking[M[_], I](fitness: Fitness[I, Double])(implicit arg0: Monad[M]): Ranking[M, I]

    Permalink
  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. def paretoRanking[M[_], I](fitness: Fitness[I, Vector[Double]], dominance: Dominance = nonStrictDominance)(implicit arg0: Monad[M]): Ranking[M, I]

    Permalink
  21. def paretoRankingMinAndCrowdingDiversity[M[_], I](fitness: (I) ⇒ Vector[Double])(implicit arg0: Monad[M], arg1: RandomGen[M]): Kleisli[M, Vector[I], Vector[(Lazy[Int], Lazy[Double])]]

    Permalink
  22. def profileRanking[M[_], I](niche: Niche[I, Int], fitness: Fitness[I, Double])(implicit arg0: Monad[M]): Ranking[M, I]

    Permalink
  23. def rank[M[_], I, K](ranking: Kleisli[M, Vector[I], Vector[K]])(implicit arg0: Monad[M]): Kleisli[M, Vector[I], Vector[(I, K)]]

    Permalink
  24. def rankAndDiversity[M[_], I](ranking: Ranking[M, I], diversity: Diversity[M, I])(implicit arg0: Monad[M]): Kleisli[M, Vector[I], Vector[(Lazy[Int], Lazy[Double])]]

    Permalink
  25. def reversedRanking[M[_], I](ranking: Ranking[M, I])(implicit arg0: Monad[M]): Ranking[M, I]

    Permalink

    ** Generic functions on rankings ***

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

    Permalink
    Definition Classes
    AnyRef
  27. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped