A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://www.scala-lang.org/api/2.12.19/scala/collection/parallel/ParIterableLike$SeqComposite.html below:

Scala Standard Library 2.12.19 - scala.collection.parallel.ParIterableLike.SeqComposite

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

 

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SeqComposite
  2. Composite
  3. NonDivisibleTask
  4. StrictSplitterCheckTask
  5. Task
  6. AnyRef
  7. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Instance Constructors
  1.  new SeqComposite(f: First, s: Second)
Type Members
  1.  type Result = R
Abstract Value Members
  1.  abstract def combineResults(fr: FR, sr: SR): R
Concrete Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##(): Int
  3.  def +(other: String): String
  4.  def ->[B](y: B): (SeqComposite[FR, SR, R, First, Second], B)
  5.  final def ==(arg0: Any): Boolean
  6.  final def asInstanceOf[T0]: T0
  7.  def clone(): AnyRef
  8.  def ensuring(cond: (SeqComposite[FR, SR, R, First, Second]) ⇒ Boolean, msg: ⇒ Any): SeqComposite[FR, SR, R, First, Second]
  9.  def ensuring(cond: (SeqComposite[FR, SR, R, First, Second]) ⇒ Boolean): SeqComposite[FR, SR, R, First, Second]
  10.  def ensuring(cond: Boolean, msg: ⇒ Any): SeqComposite[FR, SR, R, First, Second]
  11.  def ensuring(cond: Boolean): SeqComposite[FR, SR, R, First, Second]
  12.  final def eq(arg0: AnyRef): Boolean
  13.  def equals(arg0: Any): Boolean
  14.  def finalize(): Unit
  15.  def forwardThrowable(): Unit
  16.  val ft: First
  17.  final def getClass(): Class[_]
  18.  def hashCode(): Int
  19.  final def isInstanceOf[T0]: Boolean
  20.  def leaf(prevr: Option[R]): Unit
  21.  def mergeSubtasks(): Unit
  22.  final def ne(arg0: AnyRef): Boolean
  23.  final def notify(): Unit
  24.  final def notifyAll(): Unit
  25.  def repr: Composite[FR, SR, R, First, Second]
  26.  def requiresStrictSplitters: Boolean
  27.  var result: R
  28.  def shouldSplitFurther: Boolean
  29.  def split: Nothing
  30.  val st: Second
  31.  final def synchronized[T0](arg0: ⇒ T0): T0
  32.  val throwable: Throwable
  33.  def toParArray: ParArray[T]
  34.  def toString(): String
  35.  final def wait(): Unit
  36.  final def wait(arg0: Long, arg1: Int): Unit
  37.  final def wait(arg0: Long): Unit
  38.  def →[B](y: B): (SeqComposite[FR, SR, R, First, Second], B)
Inherited from Composite[FR, SR, R, First, Second]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4