Object/Class

scalaz.concurrent

Task

Related Docs: class Task | package concurrent

Permalink

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
Visibility
  1. Public
  2. All

Value Members

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. object TaskInterrupted extends InterruptedException with Product with Serializable

    Permalink

    signals task was interrupted *

  5. def Try[A](a: ⇒ A): \/[Throwable, A]

    Permalink

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

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

    Permalink

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

  7. final def asInstanceOf[T0]: T0

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

    Permalink

    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.

  9. def clone(): AnyRef

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

    Permalink

    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.

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

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

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

    Permalink

    A Task which fails with the given Throwable.

  14. def finalize(): Unit

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

    Permalink

    Returns a Task 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 Task 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 Task--nothing occurs until the Task is run.

  16. def fromDisjunction[A <: Throwable, B](x: \/[A, B]): Task[B]

    Permalink
  17. def fromMaybe[A](ma: Maybe[A])(t: ⇒ Throwable): Task[A]

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

    Permalink

    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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  23. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit

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

    Permalink

    Convert a strict value to a Task.

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

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

    Permalink

    Create a Future that starts evaluating a using the given ExecutorService right away

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

    Permalink

    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.

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

    Permalink
    Definition Classes
    AnyRef
  29. implicit val taskInstance: Nondeterminism[Task] with Catchable[Task]

    Permalink
  30. def toString(): String

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped