Scala Standard Library 2.12.18 - scala.collection.parallel.immutable.ParSet (original) (raw)

trait ParSet[T] extends GenSet[T] with GenericParTemplate[T, ParSet] with parallel.ParSet[T] with ParIterable[T] with ParSetLike[T, ParSet[T], immutable.Set[T]]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. ParSet
2. ParIterable
3. Immutable
4. ParSet
5. ParSetLike
6. ParIterable
7. ParIterableLike
8. Parallel
9. CustomParallelizable
10. GenericParTemplate
11. HasNewCombiner
12. GenSet
13. GenericSetTemplate
14. GenIterable
15. GenTraversable
16. GenericTraversableTemplate
17. HasNewBuilder
18. GenSetLike
19. Equals
20. Function1
21. GenIterableLike
22. GenTraversableLike
23. Parallelizable
24. GenTraversableOnce
25. AnyRef
26. Any

Implicitly

1. by CollectionsHaveToParArray

2. by any2stringadd

3. by StringFormat

4. by Ensuring

5. by ArrowAssoc

6. Hide All

7. Show All

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]

Abstract Value Members

1.  abstract def +(elem: T): ParSet[T]
2.  abstract def -(elem: T): ParSet[T]
3.  abstract def contains(elem: T): Boolean
4.  abstract def seq: immutable.Set[T]
5.  abstract def size: Int
6.  abstract def splitter: IterableSplitter[T]

Concrete Value Members

1.  final def !=(arg0: Any): Boolean
2.  final def ##(): Int
3.  def &(that: GenSet[T]): ParSet[T]
4.  def &~(that: GenSet[T]): ParSet[T]
5.  def ++[U >: T, That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParSet[T], U, That]): That
6.  def ->[B](y: B): (ParSet[T], B)
7.  final def ==(arg0: Any): Boolean
8.  def aggregate[S](z: ⇒ S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S
9.  def andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A
10.  def apply(elem: T): Boolean
11.  final def asInstanceOf[T0]: T0
12.  def bf2seq[S, That](bf: CanBuildFrom[ParSet[T], S, That]): CanBuildFrom[immutable.Set[T], S, That]
13.  implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]
14.  def canEqual(other: Any): Boolean
15.  def clone(): AnyRef
16.  def collect[B](pf: PartialFunction[A, B]): mutable.ParSet[B]
17.  def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]
18.  def combinerFactory: CombinerFactory[T, ParSet[T]]
19.  def companion: GenericCompanion[ParSet] with GenericParCompanion[ParSet]
20.  def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean
21.  def copyToArray(xs: Array[A], start: Int, len: Int): Unit
22.  def copyToArray(xs: Array[A], start: Int): Unit
23.  def copyToArray(xs: Array[A]): Unit
24.  def count(p: (T) ⇒ Boolean): Int
25.  def debugBuffer: ArrayBuffer[String]
26.  implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]
27.  def diff(that: GenSet[T]): ParSet[T]
28.  def drop(n: Int): ParSet[T]
29.  def dropWhile(pred: (T) ⇒ Boolean): ParSet[T]
30.  def empty: ParSet[T]
31.  def ensuring(cond: (ParSet[T]) ⇒ Boolean, msg: ⇒ Any): ParSet[T]
32.  def ensuring(cond: (ParSet[T]) ⇒ Boolean): ParSet[T]
33.  def ensuring(cond: Boolean, msg: ⇒ Any): ParSet[T]
34.  def ensuring(cond: Boolean): ParSet[T]
35.  final def eq(arg0: AnyRef): Boolean
36.  def equals(that: Any): Boolean
37.  def exists(p: (T) ⇒ Boolean): Boolean
38.  def filter(pred: (T) ⇒ Boolean): ParSet[T]
39.  def filterNot(pred: (T) ⇒ Boolean): ParSet[T]
40.  def finalize(): Unit
41.  def find(p: (T) ⇒ Boolean): Option[T]
42.  def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): mutable.ParSet[B]
43.  def flatten[B]: mutable.ParSet[B]
44.  def fold[U >: T](z: U)(op: (U, U) ⇒ U): U
45.  def foldLeft[S](z: S)(op: (S, T) ⇒ S): S
46.  def foldRight[S](z: S)(op: (T, S) ⇒ S): S
47.  def forall(p: (T) ⇒ Boolean): Boolean
48.  def foreach[U](f: (T) ⇒ U): Unit
49.  def genericBuilder[B]: Combiner[B, ParSet[B]]
50.  def genericCombiner[B]: Combiner[B, ParSet[B]]
51.  final def getClass(): Class[_]
52.  def groupBy[K](f: (T) ⇒ K): ParMap[K, ParSet[T]]
53.  def hasDefiniteSize: Boolean
54.  def hashCode(): Int
55.  def head: T
56.  def headOption: Option[T]
57.  def init: ParSet[T]
58.  def initTaskSupport(): Unit
59.  def intersect(that: GenSet[T]): ParSet[T]
60.  def isEmpty: Boolean
61.  final def isInstanceOf[T0]: Boolean
62.  def isStrictSplitterCollection: Boolean
63.  final def isTraversableAgain: Boolean
64.  def iterator: Splitter[T]
65.  def last: T
66.  def lastOption: Option[T]
67.  def map[B](f: (A) ⇒ B): mutable.ParSet[B]
68.  def max: A
69.  def maxBy[B](f: (A) ⇒ B): A
70.  def min: A
71.  def minBy[B](f: (A) ⇒ B): A
72.  def mkString: String
73.  def mkString(sep: String): String
74.  def mkString(start: String, sep: String, end: String): String
75.  final def ne(arg0: AnyRef): Boolean
76.  def newBuilder: Builder[T, ParSet[T]]
77.  def newCombiner: Combiner[T, ParSet[T]]
78.  def nonEmpty: Boolean
79.  final def notify(): Unit
80.  final def notifyAll(): Unit
81.  def par: ParSet[T]
82.  def parCombiner: Combiner[T, ParSet[T]]
83.  def partition(pred: (T) ⇒ Boolean): (ParSet[T], ParSet[T])
84.  def product: A
85.  def reduce[U >: T](op: (U, U) ⇒ U): U
86.  def reduceLeft[U >: T](op: (U, T) ⇒ U): U
87.  def reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]
88.  def reduceOption[U >: T](op: (U, U) ⇒ U): Option[U]
89.  def reduceRight[U >: T](op: (T, U) ⇒ U): U
90.  def reduceRightOption[U >: T](op: (T, U) ⇒ U): Option[U]
91.  def repr: ParSet[T]
92.  def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]
93.  def sameElements(that: GenIterable[A]): Boolean
94.  def scan(z: T)(op: (T, T) ⇒ T): mutable.ParSet[T]
95.  def scanBlockSize: Int
96.  def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[ParSet[T], S, That]): That
97.  def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[ParSet[T], S, That]): That
98.  def sequentially[S, That <: Parallel](b: (immutable.Set[T]) ⇒ Parallelizable[S, That]): ParSet[T]
99.  def sizeHintIfCheap: Int
100.  def slice(unc_from: Int, unc_until: Int): ParSet[T]
101.  def span(pred: (T) ⇒ Boolean): (ParSet[T], ParSet[T])
102.  def splitAt(n: Int): (ParSet[T], ParSet[T])
103.  def stringPrefix: String
104.  def subsetOf(that: GenSet[T]): Boolean
105.  def sum: A
106.  final def synchronized[T0](arg0: ⇒ T0): T0
107.  def tail: ParSet[T]
108.  def take(n: Int): ParSet[T]
109.  def takeWhile(pred: (T) ⇒ Boolean): ParSet[T]
110.  implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]
111.  def tasksupport: TaskSupport
112.  def tasksupport_=(ts: TaskSupport): Unit
113.  def to[Col[_]]: Col[A]
114.  def toArray: Array[A]
115.  def toBuffer[U >: T]: Buffer[U]
116.  def toIndexedSeq: immutable.IndexedSeq[T]
117.  def toIterable: ParIterable[T]
118.  def toIterator: scala.Iterator[T]
119.  def toList: List[T]
120.  def toMap[T, U]: collection.Map[T, U]
121.  def toParArray: ParArray[T]
122.  def toParCollection[U >: T, That](cbf: () ⇒ Combiner[U, That]): That
123.  def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[T, (K, V)]): That
124.  def toSeq: ParSeq[T]
125.  def toSet[U >: T]: ParSet[U]
126.  def toStream: Stream[T]
127.  def toString(): String
128.  def toTraversable: GenTraversable[T]
129.  def toVector: Vector[T]
130.  def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParSet[ParSet[B]]
131.  def union(that: GenSet[T]): ParSet[T]
132.  def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (ParSet[A1], ParSet[A2])
133.  def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (ParSet[A1], ParSet[A2], ParSet[A3])
134.  final def wait(): Unit
135.  final def wait(arg0: Long, arg1: Int): Unit
136.  final def wait(arg0: Long): Unit
137.  def withFilter(pred: (T) ⇒ Boolean): ParSet[T]
138.  def wrap[R](body: ⇒ R): NonDivisible[R]
139.  def zip[B](that: GenIterable[B]): mutable.ParSet[(A, B)]
140.  def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): mutable.ParSet[(A, B)]
141.  def zipWithIndex: mutable.ParSet[(A, Int)]
142.  def |(that: GenSet[T]): ParSet[T]
143.  def →[B](y: B): (ParSet[T], B)

Inherited from ParIterable[T]

Inherited from Immutable

Inherited from parallel.ParSet[T]

Inherited from ParSetLike[T, ParSet[T], immutable.Set[T]]

Inherited from parallel.ParIterable[T]

Inherited from ParIterableLike[T, ParSet[T], immutable.Set[T]]

Inherited from Parallel

Inherited from CustomParallelizable[T, ParSet[T]]

Inherited from GenericParTemplate[T, ParSet]

Inherited from HasNewCombiner[T, scala.collection.parallel.immutable.ParSet[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from GenSet[T]

Inherited from GenericSetTemplate[T, GenSet]

Inherited from GenIterable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, ParSet]

Inherited from HasNewBuilder[T, scala.collection.parallel.immutable.ParSet[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from GenSetLike[T, ParSet[T]]

Inherited from Equals

Inherited from (T) ⇒ Boolean

Inherited from GenIterableLike[T, ParSet[T]]

Inherited from GenTraversableLike[T, ParSet[T]]

Inherited from Parallelizable[T, ParSet[T]]

Inherited from GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion CollectionsHaveToParArray fromParSet[T] to CollectionsHaveToParArray[ParSet[T], T]

Inherited by implicit conversion any2stringadd fromParSet[T] to any2stringadd[ParSet[T]]

Inherited by implicit conversion StringFormat fromParSet[T] to StringFormat[ParSet[T]]

Inherited by implicit conversion Ensuring fromParSet[T] to Ensuring[ParSet[T]]

Inherited by implicit conversion ArrowAssoc fromParSet[T] to ArrowAssoc[ParSet[T]]

Ungrouped