Type Members

1.  final case class Adjusted extends Fit with Product with Serializable
2.  abstract class Comparison extends AnyRef
3.  sealed trait 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 case class Environment[A](cmp: Comparison, eval: RVar[(NonEmptyList[A]) ⇒ Objective[A]]) extends Product with Serializable
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 trait Fit extends AnyRef
13.  trait Fitness[F[_], A] 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, violations: Int) 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 case class Multi[A](x: List[Single[A]]) extends Objective[A] with Product with Serializable
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 trait Opt extends AnyRef
34.  final case class Point[A] extends Position[A] with Product with Serializable
35.  sealed abstract class Position[A] extends AnyRef
36.  sealed trait RNG extends AnyRef
37.  sealed abstract class RVar[A] extends AnyRef
38.  type RandIndexSelection[A] = (NonEmptyList[A], A) ⇒ RVar[List[A]]
39.  type RandSelection[A] = (NonEmptyList[A]) ⇒ RVar[List[A]]
40.  type Selection[A] = (NonEmptyList[A]) ⇒ List[A]
41.  final case class Single[A](f: Fit, v: List[Constraint[A]]) extends Objective[A] with Product with Serializable
42.  final case class Solution[A] extends Position[A] with Product with Serializable
43.  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.

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