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/immutable/ParIterable.html below:

Scala Standard Library 2.12.19 - scala.collection.parallel.immutable.ParIterable

trait ParIterable[+T] extends GenIterable[T] with parallel.ParIterable[T] with GenericParTemplate[T, ParIterable] with ParIterableLike[T, ParIterable[T], immutable.Iterable[T]] with Immutable

 

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParIterable
  2. Immutable
  3. ParIterable
  4. ParIterableLike
  5. Parallel
  6. CustomParallelizable
  7. GenericParTemplate
  8. HasNewCombiner
  9. GenIterable
  10. GenTraversable
  11. GenericTraversableTemplate
  12. HasNewBuilder
  13. GenIterableLike
  14. GenTraversableLike
  15. Parallelizable
  16. GenTraversableOnce
  17. AnyRef
  18. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Type Members
  1.  trait Accessor[R, Tp] extends StrictSplitterCheckTask[R, Tp]
  2.  class Aggregate[S] extends Accessor[S, Aggregate[S]]
  3.  trait BuilderOps[Elem, To] extends AnyRef
  4.  class Collect[S, That] extends Transformer[Combiner[S, That], Collect[S, That]]
  5.  abstract class Composite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]
  6.  class Copy[U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]
  7.  class CopyToArray[U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]
  8.  class Count extends Accessor[Int, Count]
  9.  class CreateScanTree[U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]
  10.  class Drop[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]
  11.  class Exists extends Accessor[Boolean, Exists]
  12.  class Filter[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]
  13.  class FilterNot[U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]
  14.  class Find[U >: T] extends Accessor[Option[U], Find[U]]
  15.  class FlatMap[S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]
  16.  class Fold[U >: T] extends Accessor[U, Fold[U]]
  17.  class Forall extends Accessor[Boolean, Forall]
  18.  class Foreach[S] extends Accessor[Unit, Foreach[S]]
  19.  class FromScanTree[U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]
  20.  class GroupBy[K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]
  21.  class Map[S, That] extends Transformer[Combiner[S, That], Map[S, That]]
  22.  class Max[U >: T] extends Accessor[Option[U], Max[U]]
  23.  class Min[U >: T] extends Accessor[Option[U], Min[U]]
  24.  trait NonDivisible[R] extends NonDivisibleTask[R, NonDivisible[R]]
  25.  trait NonDivisibleTask[R, Tp] extends StrictSplitterCheckTask[R, Tp]
  26.  abstract class ParComposite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]
  27.  class Partition[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]
  28.  class Product[U >: T] extends Accessor[U, Product[U]]
  29.  class Reduce[U >: T] extends Accessor[Option[U], Reduce[U]]
  30.  abstract class ResultMapping[R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]
  31.  case class ScanLeaf[U >: T](pit: IterableSplitter[U], op: (U, U) ⇒ U, from: Int, len: Int, prev: Option[ScanLeaf[U]], acc: U) extends ScanTree[U] with scala.Product with Serializable
  32.  case class ScanNode[U >: T](left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with scala.Product with Serializable
  33.  trait ScanTree[U >: T] extends AnyRef
  34.  abstract class SeqComposite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]
  35.  trait SignallingOps[PI <: DelegatedSignalling] extends AnyRef
  36.  class Slice[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]
  37.  class Span[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]
  38.  class SplitAt[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]
  39.  trait StrictSplitterCheckTask[R, Tp] extends Task[R, Tp]
  40.  class Sum[U >: T] extends Accessor[U, Sum[U]]
  41.  class Take[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]
  42.  class TakeWhile[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]
  43.  trait TaskOps[R, Tp] extends AnyRef
  44.  class ToParCollection[U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]
  45.  class ToParMap[K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]
  46.  trait Transformer[R, Tp] extends Accessor[R, Tp]
  47.  class Zip[U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]
  48.  class ZipAll[U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]
  49.  type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]
Concrete Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##(): Int
  3.  def +(other: String): String
  4.  def ++[U >: T, That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParIterable[T], U, That]): That
  5.  def ->[B](y: B): (ParIterable[T], B)
  6.  final def ==(arg0: Any): Boolean
  7.  def aggregate[S](z: ⇒ S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S
  8.  final def asInstanceOf[T0]: T0
  9.  def bf2seq[S, That](bf: CanBuildFrom[ParIterable[T], S, That]): CanBuildFrom[immutable.Iterable[T], S, That]
  10.  implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]
  11.  def canEqual(other: Any): Boolean
  12.  def clone(): AnyRef
  13.  def collect[B](pf: PartialFunction[A, B]): ParIterable[B]
  14.  def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]
  15.  def combinerFactory: CombinerFactory[T, ParIterable[T]]
  16.  def companion: GenericCompanion[ParIterable] with GenericParCompanion[ParIterable]
  17.  def copyToArray(xs: Array[A], start: Int, len: Int): Unit
  18.  def copyToArray(xs: Array[A], start: Int): Unit
  19.  def copyToArray(xs: Array[A]): Unit
  20.  def count(p: (T) ⇒ Boolean): Int
  21.  def debugBuffer: ArrayBuffer[String]
  22.  implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]
  23.  def drop(n: Int): ParIterable[T]
  24.  def dropWhile(pred: (T) ⇒ Boolean): ParIterable[T]
  25.  def ensuring(cond: (ParIterable[T]) ⇒ Boolean, msg: ⇒ Any): ParIterable[T]
  26.  def ensuring(cond: (ParIterable[T]) ⇒ Boolean): ParIterable[T]
  27.  def ensuring(cond: Boolean, msg: ⇒ Any): ParIterable[T]
  28.  def ensuring(cond: Boolean): ParIterable[T]
  29.  final def eq(arg0: AnyRef): Boolean
  30.  def equals(arg0: Any): Boolean
  31.  def exists(p: (T) ⇒ Boolean): Boolean
  32.  def filter(pred: (T) ⇒ Boolean): ParIterable[T]
  33.  def filterNot(pred: (T) ⇒ Boolean): ParIterable[T]
  34.  def finalize(): Unit
  35.  def find(p: (T) ⇒ Boolean): Option[T]
  36.  def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ParIterable[B]
  37.  def flatten[B]: ParIterable[B]
  38.  def fold[U >: T](z: U)(op: (U, U) ⇒ U): U
  39.  def foldLeft[S](z: S)(op: (S, T) ⇒ S): S
  40.  def foldRight[S](z: S)(op: (T, S) ⇒ S): S
  41.  def forall(p: (T) ⇒ Boolean): Boolean
  42.  def foreach[U](f: (T) ⇒ U): Unit
  43.  def genericBuilder[B]: Combiner[B, ParIterable[B]]
  44.  def genericCombiner[B]: Combiner[B, ParIterable[B]]
  45.  final def getClass(): Class[_]
  46.  def groupBy[K](f: (T) ⇒ K): ParMap[K, ParIterable[T]]
  47.  def hasDefiniteSize: Boolean
  48.  def hashCode(): Int
  49.  def head: T
  50.  def headOption: Option[T]
  51.  def init: ParIterable[T]
  52.  def initTaskSupport(): Unit
  53.  def isEmpty: Boolean
  54.  final def isInstanceOf[T0]: Boolean
  55.  def isStrictSplitterCollection: Boolean
  56.  final def isTraversableAgain: Boolean
  57.  def iterator: Splitter[T]
  58.  def last: T
  59.  def lastOption: Option[T]
  60.  def map[B](f: (A) ⇒ B): ParIterable[B]
  61.  def max: A
  62.  def maxBy[B](f: (A) ⇒ B): A
  63.  def min: A
  64.  def minBy[B](f: (A) ⇒ B): A
  65.  def mkString: String
  66.  def mkString(sep: String): String
  67.  def mkString(start: String, sep: String, end: String): String
  68.  final def ne(arg0: AnyRef): Boolean
  69.  def newBuilder: Builder[T, ParIterable[T]]
  70.  def newCombiner: Combiner[T, ParIterable[T]]
  71.  def nonEmpty: Boolean
  72.  final def notify(): Unit
  73.  final def notifyAll(): Unit
  74.  def par: ParIterable[T]
  75.  def parCombiner: Combiner[T, ParIterable[T]]
  76.  def partition(pred: (T) ⇒ Boolean): (ParIterable[T], ParIterable[T])
  77.  def product: A
  78.  def reduce[U >: T](op: (U, U) ⇒ U): U
  79.  def reduceLeft[U >: T](op: (U, T) ⇒ U): U
  80.  def reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]
  81.  def reduceOption[U >: T](op: (U, U) ⇒ U): Option[U]
  82.  def reduceRight[U >: T](op: (T, U) ⇒ U): U
  83.  def reduceRightOption[U >: T](op: (T, U) ⇒ U): Option[U]
  84.  def repr: ParIterable[T]
  85.  def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]
  86.  def sameElements(that: GenIterable[A]): Boolean
  87.  def scan(z: T)(op: (T, T) ⇒ T): ParIterable[T]
  88.  def scanBlockSize: Int
  89.  def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[ParIterable[T], S, That]): That
  90.  def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[ParIterable[T], S, That]): That
  91.  def sequentially[S, That <: Parallel](b: (immutable.Iterable[T]) ⇒ Parallelizable[S, That]): ParIterable[T]
  92.  def sizeHintIfCheap: Int
  93.  def slice(unc_from: Int, unc_until: Int): ParIterable[T]
  94.  def span(pred: (T) ⇒ Boolean): (ParIterable[T], ParIterable[T])
  95.  def splitAt(n: Int): (ParIterable[T], ParIterable[T])
  96.  def stringPrefix: String
  97.  def sum: A
  98.  final def synchronized[T0](arg0: ⇒ T0): T0
  99.  def tail: ParIterable[T]
  100.  def take(n: Int): ParIterable[T]
  101.  def takeWhile(pred: (T) ⇒ Boolean): ParIterable[T]
  102.  implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]
  103.  def tasksupport: TaskSupport
  104.  def tasksupport_=(ts: TaskSupport): Unit
  105.  def to[Col[_]]: Col[A]
  106.  def toArray: Array[A]
  107.  def toBuffer[U >: T]: Buffer[U]
  108.  def toIndexedSeq: immutable.IndexedSeq[T]
  109.  def toIterable: ParIterable[T]
  110.  def toIterator: scala.Iterator[T]
  111.  def toList: List[T]
  112.  def toMap[T, U]: collection.Map[T, U]
  113.  def toParArray: ParArray[T]
  114.  def toParCollection[U >: T, That](cbf: () ⇒ Combiner[U, That]): That
  115.  def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[T, (K, V)]): That
  116.  def toSeq: ParSeq[T]
  117.  def toSet[U >: T]: ParSet[U]
  118.  def toStream: Stream[T]
  119.  def toString(): String
  120.  def toTraversable: GenTraversable[T]
  121.  def toVector: Vector[T]
  122.  def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParIterable[ParIterable[B]]
  123.  def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (ParIterable[A1], ParIterable[A2])
  124.  def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (ParIterable[A1], ParIterable[A2], ParIterable[A3])
  125.  final def wait(): Unit
  126.  final def wait(arg0: Long, arg1: Int): Unit
  127.  final def wait(arg0: Long): Unit
  128.  def withFilter(pred: (T) ⇒ Boolean): ParIterable[T]
  129.  def wrap[R](body: ⇒ R): NonDivisible[R]
  130.  def zip[B](that: GenIterable[B]): ParIterable[(A, B)]
  131.  def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): ParIterable[(A, B)]
  132.  def zipWithIndex: ParIterable[(A, Int)]
  133.  def →[B](y: B): (ParIterable[T], B)
Inherited from HasNewCombiner[T, scala.collection.parallel.immutable.ParIterable[T] @scala.annotation.unchecked.uncheckedVariance] Inherited from HasNewBuilder[T, scala.collection.parallel.immutable.ParIterable[T] @scala.annotation.unchecked.uncheckedVariance]

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