Type Members

1.  sealed trait Action[T] extends AnyRef

   Defines a task computation

2.  final case class DependsOn[T](in: Task[T], deps: Seq[Task[_]]) extends Action[T] with Product with Serializable

   A computation in that requires other tasks deps to be evaluated first.

3.  final case class FlatMapped[T, K[L[x]]](in: K[Task], f: (K[Result]) ⇒ Task[T], alist: AList[K]) extends Action[T] with Product with Serializable

   Computes another task to evaluate based on results from evaluating other tasks.

4.  final case class Info[T](attributes: AttributeMap = AttributeMap.empty, post: (T) ⇒ AttributeMap = Info.defaultAttributeMap) extends Product with Serializable

   Used to provide information about a task, such as the name, description, and tags for controlling concurrent execution.

   Used to provide information about a task, such as the name, description, and tags for controlling concurrent execution.

   attributes

   Arbitrary user-defined key/value pairs describing this task

   post

   a transformation that takes the result of evaluating this task and produces user-defined key/value pairs.

5.  final case class Join[T, U](in: Seq[Task[U]], f: (Seq[Result[U]]) ⇒ Either[Task[T], T]) extends Action[T] with Product with Serializable

   A computation that operates on the results of a homogeneous list of other tasks.

   A computation that operates on the results of a homogeneous list of other tasks. It can either return another task to be evaluated or the final value.

6.  final case class Mapped[T, K[L[x]]](in: K[Task], f: (K[Result]) ⇒ T, alist: AList[K]) extends Action[T] with Product with Serializable

   Applies a function to the result of evaluating a heterogeneous list of other tasks.

7.  final case class Pure[T](f: () ⇒ T, inline: Boolean) extends Action[T] with Product with Serializable

   A direct computation of a value.

   A direct computation of a value. If inline is true, f will be evaluated on the scheduler thread without the overhead of normal scheduling when possible. This is intended as an optimization for already evaluated values or very short pure computations.

8.  final case class Selected[A, B](fab: Task[Either[A, B]], fin: Task[(A) ⇒ B]) extends Action[B] with Product with Serializable

   A computation that conditionally falls back to a second transformation.

   A computation that conditionally falls back to a second transformation. This can be used to encode if conditions.

9.  final case class Task[T](info: Info[T], work: Action[T]) extends Product with Serializable

   Combines metadata info and a computation work to define a task.