Scala Standard Library 2.12.18 - scala.collection.parallel.ParIterableLike.ScanNode (original) (raw)
case class ScanNode[U >: T](left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with scala.Product with Serializable
Ordering
- Alphabetic
- By Inheritance
Inherited
- ScanNode
- Serializable
- Serializable
- Product
- Equals
- ScanTree
- AnyRef
- Any
Implicitly
by CollectionsHaveToParArray
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
Hide All
Show All
Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def +(other: String): String
- def ->[B](y: B): (ScanNode[U], B)
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def beginsAt: Int
- def clone(): AnyRef
- def ensuring(cond: (ScanNode[U]) ⇒ Boolean, msg: ⇒ Any): ScanNode[U]
- def ensuring(cond: (ScanNode[U]) ⇒ Boolean): ScanNode[U]
- def ensuring(cond: Boolean, msg: ⇒ Any): ScanNode[U]
- def ensuring(cond: Boolean): ScanNode[U]
- final def eq(arg0: AnyRef): Boolean
- def finalize(): Unit
- final def getClass(): Class[_]
- final def isInstanceOf[T0]: Boolean
- val left: ScanTree[U]
- val leftmost: ScanLeaf[U]
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def print(depth: Int): Unit
- def pushdown(v: U): Unit
- val right: ScanTree[U]
- val rightmost: ScanLeaf[U]
- final def synchronized[T0](arg0: ⇒ T0): T0
- def toParArray: ParArray[T]
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def →[B](y: B): (ScanNode[U], B)