Scala Standard Library 2.12.18 - scala.collection.parallel.ParIterableLike.FromScanTree (original) (raw)
class FromScanTree[U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]
Ordering
- Alphabetic
- By Inheritance
Inherited
- FromScanTree
- StrictSplitterCheckTask
- Task
- AnyRef
- Any
Implicitly
by CollectionsHaveToParArray
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
Hide All
Show All
Type Members
Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def +(other: String): String
- def ->[B](y: B): (FromScanTree[U, That], B)
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def ensuring(cond: (FromScanTree[U, That]) ⇒ Boolean, msg: ⇒ Any): FromScanTree[U, That]
- def ensuring(cond: (FromScanTree[U, That]) ⇒ Boolean): FromScanTree[U, That]
- def ensuring(cond: Boolean, msg: ⇒ Any): FromScanTree[U, That]
- def ensuring(cond: Boolean): FromScanTree[U, That]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: Any): Boolean
- def finalize(): Unit
- def forwardThrowable(): Unit
- final def getClass(): Class[_]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- def leaf(prev: Option[Combiner[U, That]]): Unit
- def merge(that: FromScanTree[U, That]): Unit
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def repr: FromScanTree[U, That]
- def requiresStrictSplitters: Boolean
- var result: Combiner[U, That]
- def shouldSplitFurther: Boolean
- def split: scala.Seq[Task[Combiner[U, That], FromScanTree[U, That]]]
- final def synchronized[T0](arg0: ⇒ T0): T0
- val throwable: Throwable
- def toParArray: ParArray[T]
- def toString(): String
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def →[B](y: B): (FromScanTree[U, That], B)