SeqComposite

Instance Constructors

new SeqComposite(f: First, s: Second)

Type Members

type Result = R

Definition Classes
Task

Abstract Value Members

abstract def combineResults(fr: FR, sr: SR): R

Definition Classes
Composite

Concrete 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
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 equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def forwardThrowable(): Unit

Definition Classes
Task
val ft: First

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

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
def leaf(prevr: Option[R]): Unit

Body of the task - non-divisible unit of work done by this task.
Body of the task - non-divisible unit of work done by this task. Optionally is provided with the result from the previous completed task or None if there was no previous task (or the previous task is uncompleted or unknown).

Definition Classes
SeqComposite → Task
def mergeSubtasks(): Unit

Attributes
protected
Definition Classes
Composite
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def repr: Composite[FR, SR, R, First, Second]

Definition Classes
Task
def requiresStrictSplitters: Boolean

Definition Classes
Composite → StrictSplitterCheckTask
var result: R

A result that can be accessed once the task is completed.
A result that can be accessed once the task is completed.

Definition Classes
Composite → Task
def shouldSplitFurther: Boolean

Decides whether or not this task should be split further.
Decides whether or not this task should be split further.

Definition Classes
NonDivisibleTask → Task
def split: Nothing

Splits this task into a list of smaller tasks.
Splits this task into a list of smaller tasks.

Definition Classes
NonDivisibleTask → Task
val st: Second

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

Definition Classes
AnyRef
var throwable: Throwable

Definition Classes
Task
def toString(): String

Definition Classes
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 ParIterableLike

abstract class SeqComposite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

Instance Constructors

new SeqComposite(f: First, s: Second)

Type Members

type Result = R

Abstract Value Members

abstract def combineResults(fr: FR, sr: SR): R

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def forwardThrowable(): Unit

val ft: First

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def leaf(prevr: Option[R]): Unit

def mergeSubtasks(): Unit

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def repr: Composite[FR, SR, R, First, Second]

def requiresStrictSplitters: Boolean

var result: R

def shouldSplitFurther: Boolean

def split: Nothing

val st: Second

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

var throwable: Throwable

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Composite[FR, SR, R, First, Second]

Inherited from NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]

Inherited from StrictSplitterCheckTask[R, Composite[FR, SR, R, First, Second]]

Inherited from Task[R, Composite[FR, SR, R, First, Second]]

Inherited from AnyRef

Inherited from Any

Ungrouped