cilib
package cilib
- Alphabetic
- By Inheritance
- cilib
- EvalInstances
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
- final case class Adjusted extends Fit with Product with Serializable
- abstract class Comparison extends AnyRef
- sealed trait Constraint[A] extends AnyRef
- final case class ConstraintFunction[A](f: (NonEmptyList[A]) ⇒ Double) extends Product with Serializable
- type Crossover[A] = (NonEmptyList[Position[A]]) ⇒ RVar[NonEmptyList[Position[A]]]
- final case class Entity[S, A](state: S, pos: Position[A]) extends Product with Serializable
- final case class Environment[A](cmp: Comparison, eval: RVar[(NonEmptyList[A]) ⇒ Objective[A]]) extends Product with Serializable
- final case class Equal[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
- sealed abstract class Eval[F[_], A] extends AnyRef
- trait EvalInstances extends AnyRef
- final case class Feasible(v: Double) extends Fit with Product with Serializable
- sealed trait Fit extends AnyRef
-
trait
Fitness[F[_], A] extends AnyRef
- Annotations
- @implicitNotFound( ... )
- sealed trait Generator[A] extends AnyRef
- final case class GreaterThan[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
- final case class GreaterThanEqual[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
- trait HasCharge[A] extends AnyRef
-
trait
HasMemory[S, A] extends AnyRef
- Annotations
- @implicitNotFound( ... )
- trait HasPBestStagnation[A] extends AnyRef
- trait HasVelocity[S, A] extends AnyRef
- final case class InInterval[A](f: ConstraintFunction[A], interval: Interval[Double]) extends Constraint[A] with Product with Serializable
- type IndexSelection[A] = (NonEmptyList[A], A) ⇒ List[A]
- final case class Infeasible(v: Double, violations: Int) extends Fit with Product with Serializable
- trait Input[F[_]] extends AnyRef
- implicit final class IntervalOps[A] extends AnyVal
-
sealed
trait
Iteration[M[_], A] extends AnyRef
An
Iteration
is an atomic action that applies a given "algorithm" for each item within the providedList[A]
.An
Iteration
is an atomic action that applies a given "algorithm" for each item within the providedList[A]
.An
Iteration
may either run synchronously or asynchronously (but not in terms of concurrency - at least, not yet)The
Algorithm
passed to anIteration
scheme has the shape:NonEmptyList[B] => B => Step[A,NonEmptyList[B]]
NB: Should consider trying to define this based on the Free monad?
- final case class LessThan[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
- final case class LessThanEqual[A](f: ConstraintFunction[A], v: Double) extends Constraint[A] with Product with Serializable
- final case class Mem[A](b: Position[A], v: Position[A]) extends Product with Serializable
-
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:
- non-negative: forall x y. dist x y >= 0
- identity of indiscernibles: forall x y. dist x y == 0 <=> x == y
- symmetry: forall x y. dist x y == dist y x
- 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.
- final case class Multi[A](x: List[Single[A]]) extends Objective[A] with Product with Serializable
-
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 areSingle
values that contain the fitness and the violation count of an objective function evaluation.Multi
duplicates the evaluation for multiple potential objective functions. - sealed trait Opt extends AnyRef
- final case class Point[A] extends Position[A] with Product with Serializable
- sealed abstract class Position[A] extends AnyRef
- sealed trait RNG extends AnyRef
- sealed abstract class RVar[A] extends AnyRef
- type RandIndexSelection[A] = (NonEmptyList[A], A) ⇒ RVar[List[A]]
- type RandSelection[A] = (NonEmptyList[A]) ⇒ RVar[List[A]]
- type Selection[A] = (NonEmptyList[A]) ⇒ List[A]
- final case class Single[A](f: Fit, v: List[Constraint[A]]) extends Objective[A] with Product with Serializable
- final case class Solution[A] extends Position[A] with Product with Serializable
-
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
Step
s 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. - final case class StepS[A, S, B](run: StateT[[β$3$]Step[A, β$3$], S, B]) extends Product with Serializable
- final class ViolationCount extends AnyVal
Value Members
- implicit def PositionModule[A](implicit sc: Rng[A]): Module[Position[A], A]
- implicit def intervalEqual[A]: scalaz.Equal[Interval[A]]
-
implicit
val
nelInput: Input[NonEmptyList]
- Definition Classes
- EvalInstances
-
implicit
val
pairInput: Input[[x](x, x)]
- Definition Classes
- EvalInstances
-
def
positiveInt[A](n: Int)(f: (Refined[Int, Positive]) ⇒ A): A
Positive integers are the set of inegers that are greater than 0
- def refine[A, B, C](a: A)(f: (Refined[A, B]) ⇒ C)(implicit ev: Validate[A, B]): C
- object Boundary
- object Comparison
- object Constraint
- object Crossover
- object Dist
- implicit object DoubleMonoid extends Monoid[Double]
- object Entity extends Serializable
- object Eval
- object Generator
- object HasMemory
- object HasVelocity
- object Iteration
- object Lenses
- object Max extends Opt with Product with Serializable
- object MetricSpace
- object Min extends Opt with Product with Serializable
- object Position
- object RNG
- object RVar
- object Selection
- object Step
- object StepS extends Serializable
- object ViolationCount