scalaz.concurrent

Task

object Task

Source
Task.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Task
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

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

    Definition Classes
    Any
  6. def Try[A](a: ⇒ A): \/[Throwable, A]

    Utility function - evaluate a and catch and return any exceptions.

  7. def apply[A](a: ⇒ A)(implicit pool: ExecutorService = Strategy.DefaultExecutorService): Task[A]

    Create a Future that will evaluate a using the given ExecutorService.

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def async[A](register: ((\/[Throwable, A]) ⇒ Unit) ⇒ Unit): Task[A]

    Create a Future from an asynchronous computation, which takes the form of a function with which we can register a callback.

    Create a Future from an asynchronous computation, which takes the form of a function with which we can register a callback. This can be used to translate from a callback-based API to a straightforward monadic version. See Task.async for a version that allows for asynchronous exceptions.

  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def delay[A](a: ⇒ A): Task[A]

    Promote a non-strict value to a Task, catching exceptions in the process.

    Promote a non-strict value to a Task, catching exceptions in the process. Note that since Task is unmemoized, this will recompute a each time it is sequenced into a larger computation. Memoize a with a lazy value before calling this function if memoization is desired.

  12. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  14. def fail(e: Throwable): Task[Nothing]

    A Task which fails with the given Throwable.

  15. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def fork[A](a: ⇒ Task[A])(implicit pool: ExecutorService = Strategy.DefaultExecutorService): Task[A]

    Returns a Future that produces the same result as the given Future, but forks its evaluation off into a separate (logical) thread, using the given ExecutorService.

    Returns a Future that produces the same result as the given Future, but forks its evaluation off into a separate (logical) thread, using the given ExecutorService. Note that this forking is only described by the returned Future--nothing occurs until the Future is run.

  17. def gatherUnordered[A](tasks: Seq[Task[A]], exceptionCancels: Boolean = false): Task[List[A]]

    Like Nondeterminism[Task].gatherUnordered, but if exceptionCancels is true, exceptions in any task try to immediately cancel all other running tasks.

    Like Nondeterminism[Task].gatherUnordered, but if exceptionCancels is true, exceptions in any task try to immediately cancel all other running tasks. If exceptionCancels is false, in the event of an error, all tasks are run to completion before the error is returned.

    Since

    7.0.3

  18. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  19. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  21. final def ne(arg0: AnyRef): Boolean

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

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

    Definition Classes
    AnyRef
  24. def now[A](a: A): Task[A]

    Convert a strict value to a Task.

    Convert a strict value to a Task. Also see delay.

  25. def suspend[A](a: ⇒ Task[A]): Task[A]

    Produce f in the main trampolining loop, Future.step, using a fresh call stack.

    Produce f in the main trampolining loop, Future.step, using a fresh call stack. The standard trampolining primitive, useful for avoiding stack overflows.

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

    Definition Classes
    AnyRef
  27. implicit val taskInstance: Nondeterminism[Task] with Catchable[Task] { val F: scalaz.Nondeterminism[scalaz.concurrent.Future] }

  28. def toString(): String

    Definition Classes
    AnyRef → Any
  29. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped