object Future

Source
Future.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Future
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. case class Async[+A](onFinish: ((A) ⇒ Free.Trampoline[Unit]) ⇒ Unit) extends Future[A] with Product with Serializable
  2. case class BindAsync[A, B](onFinish: ((A) ⇒ Free.Trampoline[Unit]) ⇒ Unit, f: (A) ⇒ Future[B]) extends Future[B] with Product with Serializable
  3. case class BindSuspend[A, B](thunk: () ⇒ Future[A], f: (A) ⇒ Future[B]) extends Future[B] with Product with Serializable
  4. case class Now[+A](a: A) extends Future[A] with Product with Serializable
  5. type ParallelFuture[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    type for Futures which need to be executed in parallel when using an Applicative instance

  6. case class Suspend[+A](thunk: () ⇒ Future[A]) extends Future[A] with Product with Serializable

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 apply[A](a: ⇒ A)(implicit pool: ExecutorService = Strategy.DefaultExecutorService): Future[A]

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

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def async[A](listen: ((A) ⇒ Unit) ⇒ Unit): Future[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.

  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.CloneNotSupportedException])
  8. def delay[A](a: ⇒ A): Future[A]

    Promote a non-strict value to a Future.

    Promote a non-strict value to a Future. Note that since Future 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.

  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  12. def fork[A](a: ⇒ Future[A])(implicit pool: ExecutorService = Strategy.DefaultExecutorService): Future[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.

  13. implicit val futureInstance: Nondeterminism[Future]
  14. implicit val futureParallelApplicativeInstance: Applicative[ParallelFuture]

    This Applicative instance runs Futures in parallel.

    This Applicative instance runs Futures in parallel.

    It is different from the Applicative instance obtained from Monad[Future] which runs futures sequentially.

  15. def gatherUnordered[A](fs: Seq[Future[A]]): Future[List[A]]

    Calls Nondeterminism[Future].gatherUnordered.

    Calls Nondeterminism[Future].gatherUnordered.

    Since

    7.0.3

  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. def now[A](a: A): Future[A]

    Convert a strict value to a Future.

  23. def reduceUnordered[A, M](fs: Seq[Future[A]])(implicit R: Reducer[A, M]): Future[M]
  24. def schedule[A](a: ⇒ A, delay: Duration)(implicit pool: ScheduledExecutorService = Strategy.DefaultTimeoutScheduler): Future[A]

    Create a Future that will evaluate a after at least the given delay.

  25. def suspend[A](f: ⇒ Future[A]): Future[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. def toString(): String
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.InterruptedException])

Inherited from AnyRef

Inherited from Any

Ungrouped