object Runner
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Runner
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def algorithm[M[_], F[_], A, B](name: Refined[String, NonEmpty], config: A, f: (A) ⇒ Kleisli[M, F[B], F[B]], updater: (A, @@[Int, Iteration]) ⇒ A)(implicit arg0: Monad[M], arg1: Foldable1[F]): Process[Nothing, Algorithm[Kleisli[M, F[B], F[B]]]]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
foldStep[F[_], A, B](initialConfig: Environment[A], rng: RNG, collection: RVar[F[B]], alg: Process[Task, Algorithm[Kleisli[[β$0$]Step[A, β$0$], F[B], F[B]]]], env: Process[Task, Problem[A]], onChange: (F[B], Eval[NonEmptyList, A]) ⇒ RVar[F[B]]): Process[Task, Progress[F[B]]]
Interpreter for algorithm execution
- def foldStepS[F[_], S, A, B](initialConfig: Environment[A], initialState: S, rng: RNG, collection: RVar[F[B]], alg: Process[Task, Algorithm[Kleisli[[γ$2$]StepS[A, S, γ$2$], F[B], F[B]]]], env: Process[Task, Problem[A]], onChange: (F[B], Eval[NonEmptyList, A]) ⇒ RVar[F[B]]): Process[Task, Progress[(S, F[B])]]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def measure[A, S, B](f: (A) ⇒ B)(implicit B: SchemaFor[B]): Process1[Progress[A], Measurement[B]]
- def measureWithState[A, S, B](f: (S, A) ⇒ B)(implicit B: SchemaFor[B]): Process1[Progress[(S, A)], Measurement[B]]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def problem[S, A](name: Refined[String, NonEmpty], state: RVar[S], next: (S) ⇒ RVar[(S, Eval[NonEmptyList, A])])(env: Stream[Env], rng: RNG): Process[Task, Problem[A]]
- def repeat[M[_], F[_], A](n: Int, alg: Kleisli[M, F[A], F[A]], collection: RVar[F[A]])(implicit arg0: Monad[M], M: MonadStep[M]): M[F[A]]
- def staticAlgorithm[M[_], F[_], A](name: Refined[String, NonEmpty], a: Kleisli[M, F[A], F[A]])(implicit arg0: Monad[M]): Process0[Algorithm[Kleisli[M, F[A], F[A]]]]
- def staticProblem[S, A](name: Refined[String, NonEmpty], eval: Eval[NonEmptyList, A]): Process[Task, Problem[A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )