ComposedFlatMap

When optimizing and composing flatMaps, this class can be used so that we can recover the parts if needed. For instance, options apply to the irreducible inputs from the user (such as functions, stores, etc... This class allows us to get those irreducibiles even after optimization

Linear Supertypes

Serializable, Serializable, Product, Equals, IrreducibleContainer, (A) ⇒ TraversableOnce[C], AnyRef, Any

Instance Constructors

new ComposedFlatMap(first: (A) ⇒ TraversableOnce[B], second: (B) ⇒ TraversableOnce[C])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Definition Classes
AnyRef → Any
def andThen[A](g: (TraversableOnce[C]) ⇒ A): (A) ⇒ A

Definition Classes
Function1
Annotations
@unspecialized()
def apply(a: A): TraversableOnce[C]

Definition Classes
ComposedFlatMap → Function1
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def compose[A](g: (A) ⇒ A): (A) ⇒ TraversableOnce[C]

Definition Classes
Function1
Annotations
@unspecialized()
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] )
val first: (A) ⇒ TraversableOnce[B]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def irreducibles: Iterable[Any]

Definition Classes
ComposedFlatMap → IrreducibleContainer
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val second: (B) ⇒ TraversableOnce[C]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
Function1 → AnyRef → Any
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( ... )

Related Doc: package planner

case class ComposedFlatMap[A, B, C](first: (A) ⇒ TraversableOnce[B], second: (B) ⇒ TraversableOnce[C]) extends (A) ⇒ TraversableOnce[C] with IrreducibleContainer with Product with Serializable

Instance Constructors

new ComposedFlatMap(first: (A) ⇒ TraversableOnce[B], second: (B) ⇒ TraversableOnce[C])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def andThen[A](g: (TraversableOnce[C]) ⇒ A): (A) ⇒ A

def apply(a: A): TraversableOnce[C]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[A](g: (A) ⇒ A): (A) ⇒ TraversableOnce[C]

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

val first: (A) ⇒ TraversableOnce[B]

final def getClass(): Class[_]

def irreducibles: Iterable[Any]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val second: (B) ⇒ TraversableOnce[C]

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

def toString(): String

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 IrreducibleContainer

Inherited from (A) ⇒ TraversableOnce[C]

Inherited from AnyRef

Inherited from Any

Ungrouped