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 asIO[T](f: ⇒ future.Future[T])(implicit ec: future.ExecutionContext): IO[T]
5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @native() @throws( ... )

7.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

8.  def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

9.  def fail[T](a: Anomaly): future.Future[T]
10.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

13.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

14.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

15.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

16.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

17.  def pure[T](t: T): future.Future[T]
    t

    Never, ever use a side-effecting computation when defining the value of this parameter

18.  def serialize[A, B, C[X] <: TraversableOnce[X]](col: C[A])(fn: (A) ⇒ future.Future[B])(implicit cbf: CanBuildFrom[C[A], B, C[B]], ec: future.ExecutionContext): future.Future[C[B]]

    Syntactically inspired from Future.traverse, but it differs semantically insofar as this method does not attempt to run any futures in parallel.

    Syntactically inspired from Future.traverse, but it differs semantically insofar as this method does not attempt to run any futures in parallel. "M" stands for "monadic", as opposed to "applicative" which is the foundation for the formal definition of "traverse" (even though in Scala it is by accident-ish)

    For the vast majority of cases you should prefer this method over Future.sequence and Future.traverse, since even small collections can easily wind up queuing so many Futures that you blow your execution context.

    Usage:

    import busymachines.future._
    val patches: Seq[Patch] = //...
    
    //this ensures that no two changes will be applied in parallel.
    val allPatches: Future[Seq[Patch]] = Future.serialize(patches){ patch: Patch =>
      Future {
        //apply patch
      }
    }
    //... and so on, and so on!

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

    Definition Classes

    AnyRef

20.  def toString(): String

    Definition Classes

    AnyRef → Any

21.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

22.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

23.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )