Class/Object

scalaz.concurrent

Future

Related Docs: object Future | package concurrent

Permalink

sealed abstract class Future[A] extends AnyRef

Future is a trampolined computation producing an A that may include asynchronous steps. Like Trampoline, arbitrary monadic expressions involving map and flatMap are guaranteed to use constant stack space. But in addition, one may construct a Future from an asynchronous computation, represented as a function, listen: (A => Unit) => Unit, which registers a callback that will be invoked when the result becomes available. This makes Future useful as a concurrency primitive and as a control structure for wrapping callback-based APIs with a more straightforward, monadic API.

Unlike the Future implementation in scala 2.10, map and flatMap do NOT spawn new tasks and do not require an implicit ExecutionContext. Instead, map and flatMap merely add to the current (trampolined) continuation that will be run by the 'current' thread, unless explicitly forked via Future.fork or Future.apply. This means that Future achieves much better thread reuse than the 2.10 implementation and avoids needless thread pool submit cycles.

Future also differs from the scala 2.10 Future type in that it does not necessarily represent a _running_ computation. Instead, we reintroduce nondeterminism _explicitly_ using the functions of the scalaz.Nondeterminism interface. This simplifies our implementation and makes code easier to reason about, since the order of effects and the points of nondeterminism are made fully explicit and do not depend on Scala's evaluation order.

IMPORTANT NOTE: Future does not include any error handling and should generally only be used as a building block by library writers who want to build on Future's capabilities but wish to design their own error handling strategy. See scalaz.concurrent.Task for a type that extends Future with proper error handling -- it is merely a wrapper for Future[Throwable \/ A] with a number of additional convenience functions.

Source
Future.scala
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Future
  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. def after(t: Duration)(implicit scheduler: ScheduledExecutorService = Strategy.DefaultTimeoutScheduler): Future[A]

    Permalink

    Returns a Future that delays the execution of this Future by the duration t.

  5. def afterMillis(delay: Long)(implicit scheduler: ScheduledExecutorService = Strategy.DefaultTimeoutScheduler): Future[A]

    Permalink
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def flatMap[B](f: (A) ⇒ Future[B]): Future[B]

    Permalink
  12. final def getClass(): Class[_]

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

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

    Permalink
    Definition Classes
    Any
  15. def map[B](f: (A) ⇒ B): Future[B]

    Permalink
  16. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  19. final def step: Future[A]

    Permalink

    Evaluate this Future to a result, or another asynchronous computation.

    Evaluate this Future to a result, or another asynchronous computation. This has the effect of stripping off any 'pure' trampolined computation at the start of this Future.

    Annotations
    @tailrec()
  20. final def stepInterruptibly(cancel: AtomicBoolean): Future[A]

    Permalink

    Like step, but may be interrupted by setting cancel to true.

    Like step, but may be interrupted by setting cancel to true.

    Annotations
    @tailrec()
  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  22. def timed(timeout: Duration)(implicit scheduler: ScheduledExecutorService = Strategy.DefaultTimeoutScheduler): Future[\/[Throwable, A]]

    Permalink
  23. def timed(timeoutInMillis: Long)(implicit scheduler: ScheduledExecutorService): Future[\/[Throwable, A]]

    Permalink

    Returns a Future which returns a TimeoutException after timeoutInMillis, and attempts to cancel the running computation.

    Returns a Future which returns a TimeoutException after timeoutInMillis, and attempts to cancel the running computation. This implementation will not block the future's execution thread

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  25. def unsafePerformAsync(cb: (A) ⇒ Unit): Unit

    Permalink

    Run this Future, passing the result to the given callback once available.

    Run this Future, passing the result to the given callback once available. Any pure, non-asynchronous computation at the head of this Future will be forced in the calling thread. At the first Async encountered, control switches to whatever thread backs the Async and this function returns.

  26. def unsafePerformAsyncInterruptibly(cb: (A) ⇒ Unit, cancel: AtomicBoolean): Unit

    Permalink

    Run this computation to obtain an A, so long as cancel remains false.

    Run this computation to obtain an A, so long as cancel remains false. Because of trampolining, we get frequent opportunities to cancel while stepping through the trampoline, this should provide a fairly robust means of cancellation.

  27. def unsafePerformListen(cb: (A) ⇒ Free.Trampoline[Unit]): Unit

    Permalink

    Run this computation to obtain an A, then invoke the given callback.

    Run this computation to obtain an A, then invoke the given callback. Also see unsafePerformAsync.

  28. def unsafePerformListenInterruptibly(cb: (A) ⇒ Free.Trampoline[Unit], cancel: AtomicBoolean): Unit

    Permalink

    Run this computation to obtain an A, so long as cancel remains false.

    Run this computation to obtain an A, so long as cancel remains false. Because of trampolining, we get frequent opportunities to cancel while stepping through the trampoline, so this should provide a fairly robust means of cancellation.

  29. def unsafePerformSync: A

    Permalink

    Run this Future and block awaiting its result.

  30. def unsafePerformSyncAttemptFor(timeout: Duration): \/[Throwable, A]

    Permalink
  31. def unsafePerformSyncAttemptFor(timeoutInMillis: Long): \/[Throwable, A]

    Permalink

    Like unsafePerformSyncFor, but returns TimeoutException as left value.

    Like unsafePerformSyncFor, but returns TimeoutException as left value. Will not report any other exceptions that may be raised during computation of A

  32. def unsafePerformSyncFor(timeout: Duration): A

    Permalink
  33. def unsafePerformSyncFor(timeoutInMillis: Long): A

    Permalink

    Run this Future and block until its result is available, or until timeoutInMillis milliseconds have elapsed, at which point a TimeoutException will be thrown and the Future will attempt to be canceled.

  34. def unsafeStart: Future[A]

    Permalink

    Begins running this Future and returns a new future that blocks waiting for the result.

    Begins running this Future and returns a new future that blocks waiting for the result. Note that this will start executing side effects immediately, and is thus morally equivalent to unsafePerformIO. The resulting Future cannot be rerun to repeat the effects.

    Use with care.

  35. final def wait(): Unit

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped