FlatMap

A computation whose value is obtained by first runnning ta then passing its value to the continutation k to get the computation that provides the final value.

Source: Trampolines.scala

Linear Supertypes

Serializable, Serializable, Product, Equals, Trampoline[B], AnyRef, Any

Instance Constructors

new FlatMap(ta: Trampoline[A], k: (A) ⇒ Trampoline[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
def finalize(): Unit

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

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

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

Definition Classes
Any
val k: (A) ⇒ Trampoline[B]
def map[B](f: (B) ⇒ B): Trampoline[B]

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def resume: Either[() ⇒ Trampoline[B], B]

Definition Classes
Trampoline
final def runT: B

Run this computation to produce its A.
Run this computation to produce its A. The key idea is that this method is directly tail recursive so the Scala compiler can convert it into a loop.

Definition Classes
Trampoline
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val ta: Trampoline[A]
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 FlatMap[A, +B](ta: Trampoline[A], k: (A) ⇒ Trampoline[B]) extends Trampoline[B] with Product with Serializable

Instance Constructors

new FlatMap(ta: Trampoline[A], k: (A) ⇒ Trampoline[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

def finalize(): Unit

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

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

val k: (A) ⇒ Trampoline[B]

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def resume: Either[() ⇒ Trampoline[B], B]

final def runT: B

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

val ta: Trampoline[A]

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 Trampoline[B]

Inherited from AnyRef

Inherited from Any

Ungrouped