BindSuspend

Instance Constructors

new BindSuspend(thunk: () ⇒ Future[A], f: (A) ⇒ Future[B])

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

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

Definition Classes
AnyRef
val f: (A) ⇒ Future[B]
def finalize(): Unit

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

Definition Classes
Future
final def getClass(): Class[_]

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

Definition Classes
Any
def listen(cb: (B) ⇒ Free.Trampoline[Unit]): Unit

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 runAsync.

Definition Classes
Future
def listenInterruptibly(cb: (B) ⇒ Free.Trampoline[Unit], cancel: AtomicBoolean): Unit

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.

Definition Classes
Future
def map[B](f: (B) ⇒ B): Future[B]

Definition Classes
Future
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def run: B

Run this Future and block awaiting its result.
Run this Future and block awaiting its result.

Definition Classes
Future
def runAsync(cb: (B) ⇒ Unit): Unit

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.

Definition Classes
Future
def runAsyncInterruptibly(cb: (B) ⇒ Unit, cancel: AtomicBoolean): Unit

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.

Definition Classes
Future
def start: Future[B]

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 results

Definition Classes
Future
final def step: Future[B]

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.

Definition Classes
Future
Annotations
@tailrec()
final def stepInterruptibly(cancel: AtomicBoolean): Future[B]

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

Definition Classes
Future
Annotations
@tailrec()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val thunk: () ⇒ Future[A]
def timed(timeoutInMillis: Long): Future[\/[Throwable, B]]

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

Definition Classes
Future
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

case class BindSuspend[A, B](thunk: () ⇒ Future[A], f: (A) ⇒ Future[B]) extends Future[B] with Product with Serializable

Instance Constructors

new BindSuspend(thunk: () ⇒ Future[A], f: (A) ⇒ Future[B])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

val f: (A) ⇒ Future[B]

def finalize(): Unit

def flatMap[B](f: (B) ⇒ Future[B]): Future[B]

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

def listen(cb: (B) ⇒ Free.Trampoline[Unit]): Unit

def listenInterruptibly(cb: (B) ⇒ Free.Trampoline[Unit], cancel: AtomicBoolean): Unit

def map[B](f: (B) ⇒ B): Future[B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def run: B

def runAsync(cb: (B) ⇒ Unit): Unit

def runAsyncInterruptibly(cb: (B) ⇒ Unit, cancel: AtomicBoolean): Unit

def start: Future[B]

final def step: Future[B]

final def stepInterruptibly(cancel: AtomicBoolean): Future[B]

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

val thunk: () ⇒ Future[A]

def timed(timeoutInMillis: Long): Future[\/[Throwable, B]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Future[B]

Inherited from AnyRef

Inherited from Any

Ungrouped