p

cilib

package cilib

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. cilib
  2. EvalInstances
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. final case class Adjusted extends Fit with Product with Serializable
  2. abstract class Comparison extends AnyRef
  3. sealed abstract class Constraint[A] extends AnyRef
  4. final case class ConstraintFunction[A](f: (NonEmptyList[A]) ⇒ Double) extends Product with Serializable
  5. type Crossover[A] = (NonEmptyList[Position[A]]) ⇒ RVar[NonEmptyList[Position[A]]]
  6. final case class Entity[S, A](state: S, pos: Position[A]) extends Product with Serializable
  7. final class Environment[A] extends AnyRef
  8. final case class Equal[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
  9. sealed abstract class Eval[F[_], A] extends AnyRef
  10. trait EvalInstances extends AnyRef
  11. final case class Feasible(v: Double) extends Fit with Product with Serializable
  12. sealed abstract class Fit extends AnyRef
  13. trait Fitness[F[_], A, B] extends AnyRef
    Annotations
    @implicitNotFound( ... )
  14. sealed trait Generator[A] extends AnyRef
  15. final case class GreaterThan[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
  16. final case class GreaterThanEqual[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
  17. trait HasCharge[A] extends AnyRef
  18. trait HasMemory[S, A] extends AnyRef
    Annotations
    @implicitNotFound( ... )
  19. trait HasPBestStagnation[A] extends AnyRef
  20. trait HasVelocity[S, A] extends AnyRef
  21. final case class InInterval[A](f: ConstraintFunction[A], interval: Interval[Double]) extends Constraint[A] with Product with Serializable
  22. type IndexSelection[A] = (NonEmptyList[A], A) ⇒ List[A]
  23. final case class Infeasible(v: Double) extends Fit with Product with Serializable
  24. trait Input[F[_]] extends AnyRef
  25. implicit final class IntervalOps[A] extends AnyVal
  26. sealed trait Iteration[M[_], A] extends AnyRef

    An Iteration is an atomic action that applies a given "algorithm" for each item within the provided List[A].

    An Iteration is an atomic action that applies a given "algorithm" for each item within the provided List[A].

    An Iteration may either run synchronously or asynchronously (but not in terms of concurrency - at least, not yet)

    The Algorithm passed to an Iteration scheme has the shape:

    NonEmptyList[B] => B => Step[A,NonEmptyList[B]]

    NB: Should consider trying to define this based on the Free monad?

  27. final case class LessThan[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
  28. final case class LessThanEqual[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
  29. final case class Mem[A](b: Position[A], v: Position[A]) extends Product with Serializable
  30. trait MetricSpace[A, B] extends AnyRef

    A MetricSpace is a set together with a notion of distance between elements.

    A MetricSpace is a set together with a notion of distance between elements. Distance is computed by a function dist which has the following four laws:

    1. non-negative: forall x y. dist x y >= 0
    2. identity of indiscernibles: forall x y. dist x y == 0 <=> x == y
    3. symmetry: forall x y. dist x y == dist y x
    4. triangle inequality: forall x y z. dist x z <= dist x y + dist y z

    See the Wikipedia article on metric spaces for more details.

  31. final class MultiEval[F[_], A] extends AnyRef
  32. sealed abstract class Objective[A] extends AnyRef

    An Objective represents the result of an evaluation.

    An Objective represents the result of an evaluation.

    In most cases, Objective values are Single values that contain the fitness and the violation count of an objective function evaluation.

    Multi duplicates the evaluation for multiple potential objective functions.

  33. sealed abstract class Opt extends AnyRef
  34. sealed abstract class Position[A] extends AnyRef
  35. sealed trait RNG extends AnyRef
  36. sealed abstract class RVar[A] extends AnyRef
  37. sealed abstract class RVarInstances extends RVarInstances0
  38. sealed abstract class RVarInstances0 extends AnyRef
  39. type RandIndexSelection[A] = (NonEmptyList[A], A) ⇒ RVar[List[A]]
  40. type RandSelection[A] = (NonEmptyList[A]) ⇒ RVar[List[A]]
  41. type Selection[A] = (NonEmptyList[A]) ⇒ List[A]
  42. sealed abstract class Step[A, B] extends AnyRef

    A Step is a type that models a single step / operation within a CI Algorithm.

    A Step is a type that models a single step / operation within a CI Algorithm.

    The general idea would be that you would compose different Steps to produce the desired algorithmic behaviour.

    Even though this is an initial pass at modeling the compuation of CI algorithms this way, it does provide a recursive, list-like composition allowing a multitude of different usages (or it is hoped to be so).

    Step is nothing more than a data structure that hides the details of a monad transformer stack which represents the algoritmic parts.

  43. final case class StepS[A, S, B](run: StateT[[β$3$]Step[A, β$3$], S, B]) extends Product with Serializable
  44. final class ViolationCount extends AnyVal

Value Members

  1. implicit def PositionModule[A](implicit sc: Rng[A]): Module[Position[A], A]
  2. implicit def intervalEqual[A]: scalaz.Equal[Interval[A]]
  3. implicit val nelInput: Input[NonEmptyList]
    Definition Classes
    EvalInstances
  4. implicit val pairInput: Input[[x](x, x)]
    Definition Classes
    EvalInstances
  5. def positiveInt[A](n: Int)(f: (Refined[Int, Positive]) ⇒ A): A

    Positive integers are the set of inegers that are greater than 0

  6. def refine[A, B, C](a: A)(f: (Refined[A, B]) ⇒ C)(implicit ev: Validate[A, B]): C
  7. object Boundary
  8. object Comparison
  9. object Constraint
  10. object Crossover
  11. object Dist
  12. implicit object DoubleMonoid extends Monoid[Double]
  13. object Entity extends Serializable
  14. object Environment
  15. object Eval
  16. object Generator
  17. object HasMemory
  18. object HasVelocity
  19. object Iteration
  20. object Lenses
  21. object Max extends Opt with Product with Serializable
  22. object MetricSpace
  23. object Min extends Opt with Product with Serializable
  24. object MultiEval
  25. object Objective
  26. object Position
  27. object RNG
  28. object RVar extends RVarInstances
  29. object Selection
  30. object Step
  31. object StepS extends Serializable
  32. object ViolationCount

Inherited from EvalInstances

Inherited from AnyRef

Inherited from Any

Ungrouped