com.clarifi.machines

Await

case class Await[+K, +O, +A](k: (Any) ⇒ Plan[K, O, A], success: K, failure: () ⇒ Plan[K, O, A]) extends Plan[K, O, A] with Product with Serializable

Await an input according to type K. Handle the input with continuation k or continue with failure if receiving the input failed.

Linear Supertypes
Serializable, Serializable, Product, Equals, Plan[K, O, A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Await
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Plan
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Await(k: (Any) ⇒ Plan[K, O, A], success: K, failure: () ⇒ Plan[K, O, A])

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  4. def >>[L >: K, P >: O, B](next: ⇒ Plan[L, P, B]): Plan[L, P, B]

    Sequential composition of Plans.

    Sequential composition of Plans.

    Definition Classes
    Plan
  5. final def andThen[P](p: Process[O, P]): Plan[K, P, A]

    Connect the output of the machine to the given Process.

    Connect the output of the machine to the given Process.

    Definition Classes
    Plan
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def compile: Machine[K, O]

    A Machine that executes the Plan and then stops.

    A Machine that executes the Plan and then stops.

    Definition Classes
    Plan
  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  10. val failure: () ⇒ Plan[K, O, A]

  11. def filter(f: (A) ⇒ Boolean): Plan[K, O, A]

    Definition Classes
    Plan
  12. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def flatMap[L >: K, P >: O, B](f: (A) ⇒ Plan[L, P, B]): Await[L, P, B]

    Substitute into the variables in this Plan.

    Substitute into the variables in this Plan.

    Definition Classes
    AwaitPlan
  14. def foldLeft[R](acc: R)(f: (R, O) ⇒ R): R

    Accumulate the outputs of the machine, associating to the left.

    Accumulate the outputs of the machine, associating to the left.

    Definition Classes
    Plan
  15. def foldMap[B](f: (O) ⇒ B)(implicit M: Monoid[B]): B

    Accumulate the outputs of the machine in a Monoid.

    Accumulate the outputs of the machine in a Monoid.

    Definition Classes
    Plan
  16. def foldRight[R](z: ⇒ R)(f: (O, ⇒ R) ⇒ R): R

    Accumulate the outputs of the machine, associating to the right.

    Accumulate the outputs of the machine, associating to the right.

    Definition Classes
    Plan
  17. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  18. def inmap[L](p: (K) ⇒ L): Plan[L, O, A]

    Transform the inputs of the resulting machine.

    Transform the inputs of the resulting machine.

    Definition Classes
    Plan
  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  20. def iterate[L >: K, P >: O, B >: A](h: (B) ⇒ Plan[L, P, B]): Machine[L, P]

    Corecursively build a machine by iterating the given function.

    Corecursively build a machine by iterating the given function.

    Definition Classes
    Plan
  21. val k: (Any) ⇒ Plan[K, O, A]

  22. def map[B](f: (A) ⇒ B): Plan[K, O, B]

    Reassign the variables in this Plan.

    Reassign the variables in this Plan.

    Definition Classes
    Plan
  23. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  24. final def notify(): Unit

    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  26. def orElse[L >: K, P >: O, B >: A](p: ⇒ Plan[L, P, B]): Await[L, P, B]

    If the current Plan fails, try the plan p.

    If the current Plan fails, try the plan p.

    Definition Classes
    AwaitPlan
  27. def outmap[P](f: (O) ⇒ P): Plan[K, P, A]

    Transform the outputs of the resulting machine.

    Transform the outputs of the resulting machine.

    Definition Classes
    Plan
  28. def repeatedly: Machine[K, O]

    A Machine that executes the Plan indefinitely.

    A Machine that executes the Plan indefinitely.

    Definition Classes
    Plan
  29. def replicateM_(n: Int): Plan[K, O, Unit]

    Repeat this plan n times.

    Repeat this plan n times.

    Definition Classes
    Plan
  30. def sink[P, Q >: O](m: Moore[Q, P]): Moore[Q, P]

    Definition Classes
    Plan
  31. def split[P](y: Process[O, P]): Plan[K, \/[O, P], A]

    Split the output into two streams at possibly differing rates.

    Split the output into two streams at possibly differing rates.

    Definition Classes
    Plan
  32. val success: K

  33. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  34. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. def withFilter(f: (A) ⇒ Boolean): Plan[K, O, A]

    Definition Classes
    Plan

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Plan[K, O, A]

Inherited from AnyRef

Inherited from Any

Ungrouped