scala.collection.parallel.ParSeqViewLike.Sliced

Ordering

Alphabetic
By inheritance

Inherited

Hide All
Show all

Sliced
Transformed
ParSeqView
ParSeqViewLike
ParSeq
ParSeqLike
Sliced
Transformed
ParIterableView
ParIterableViewLike
ParIterable
ParIterableLike
Parallel
CustomParallelizable
GenericParTemplate
HasNewCombiner
Sliced
Transformed
GenSeqView
GenSeqViewLike
GenSeq
GenSeqLike
Equals
Sliced
Transformed
GenIterableView
GenIterableViewLike
GenIterable
GenIterableLike
Sliced
Transformed
GenTraversableView
GenTraversableViewLike
GenTraversable
GenericTraversableTemplate
HasNewBuilder
GenTraversableLike
Parallelizable
GenTraversableOnce
AnyRef
Any

Visibility

Public
All

Type Members

trait Accessor [R, Tp] extends Accessor[R, Tp]

Standard accessor task that iterates over the elements of the collection.
class Aggregate [S] extends Accessor[S, Aggregate[S]]

Attributes
protected[this]
trait Appended [U >: T] extends Appended[U] with Appended[U] with Transformed[U]

Definition Classes
ParSeqViewLike → ParIterableViewLike → GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike
trait BuilderOps [Elem, To] extends AnyRef
class Collect [S, That] extends Transformer[Combiner[S, That], Collect[S, That]]

Attributes
protected[this]
class Composite [FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR, _], Second <: ParIterableLike.this.StrictSplitterCheckTask[SR, _]] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]

Attributes
protected[this] abstract
class Copy [U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]

Attributes
protected
class CopyToArray [U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]

Attributes
protected[this]
class Corresponds [S] extends Accessor[Boolean, Corresponds[S]]

Attributes
protected[this]
class Count extends Accessor[Int, Count]

Attributes
protected[this]
class CreateScanTree [U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]

Attributes
protected[this]
class Drop [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]

Attributes
protected[this]
class Elements extends ParIterator with BufferedIterator[T]

Used to iterate elements using indices
class Exists extends Accessor[Boolean, Exists]

Attributes
protected[this]
class Filter [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]

Attributes
protected[this]
class FilterNot [U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]

Attributes
protected[this]
class Find [U >: T] extends Accessor[Option[U], Find[U]]

Attributes
protected[this]
class FlatMap [S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]

Attributes
protected[this]
class Fold [U >: T] extends Accessor[U, Fold[U]]

Attributes
protected[this]
class Forall extends Accessor[Boolean, Forall]

Attributes
protected[this]
class Force [U >: T, That] extends Transformer[Combiner[U, That], Force[U, That]]

Attributes
protected[this]
Definition Classes
ParSeqViewLike → ParIterableViewLike
trait Forced [S] extends Forced[S] with Forced[S] with Transformed[S]

A fall back which forces everything into a vector and then applies an operation on it.
class Foreach [S] extends Accessor[Unit, Foreach[S]]

Attributes
protected[this]
class FromScanTree [U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]

Attributes
protected[this]
class GroupBy [K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]

Attributes
protected[this]
class IndexWhere extends Accessor[Int, IndexWhere]

Attributes
protected[this]
class LastIndexWhere extends Accessor[Int, LastIndexWhere]

Attributes
protected[this]
class Map [S, That] extends Transformer[Combiner[S, That], Map[S, That]]

Attributes
protected[this]
trait Mapped [S] extends Mapped[S] with Mapped[S] with Transformed[S]

Definition Classes
ParSeqViewLike → ParIterableViewLike → GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike
class Max [U >: T] extends Accessor[Option[U], Max[U]]

Attributes
protected[this]
class Min [U >: T] extends Accessor[Option[U], Min[U]]

Attributes
protected[this]
trait NonDivisible [R] extends NonDivisibleTask[R, NonDivisible[R]]

Attributes
protected[this]
trait NonDivisibleTask [R, Tp] extends StrictSplitterCheckTask[R, Tp]

Attributes
protected[this]
class ParComposite [FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR, _], Second <: ParIterableLike.this.StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

Performs two tasks in parallel, and waits for both to finish.
trait ParIterator extends SeqSplitter[T] with ParIterator

An iterator that can be split into arbitrary subsets of iterators.
class Partition [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]

Attributes
protected[this]
trait Patched [U >: T] extends Patched[U] with Transformed[U]

Definition Classes
ParSeqViewLike → GenSeqViewLike
trait Prepended [U >: T] extends Prepended[U] with Transformed[U]

Definition Classes
ParSeqViewLike → GenSeqViewLike
class Product [U >: T] extends Accessor[U, Product[U]]

Attributes
protected[this]
class Reduce [U >: T] extends Accessor[Option[U], Reduce[U]]

Attributes
protected[this]
class ResultMapping [R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

Attributes
protected[this] abstract
class Reverse [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Reverse[U, This]]

Attributes
protected[this]
class ReverseMap [S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]

Attributes
protected[this]
trait Reversed extends Reversed with Transformed[T]

Definition Classes
ParSeqViewLike → GenSeqViewLike
type SSCTask [R, Tp] = StrictSplitterCheckTask[R, Tp]

Definition Classes
ParIterableLike
class SameElements [U >: T] extends Accessor[Boolean, SameElements[U]]

Attributes
protected[this]
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 Product with Serializable

Attributes
protected[this]
case class ScanNode [U >: T] (left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with Product with Serializable

Attributes
protected[this]
trait ScanTree [U >: T] extends AnyRef

Attributes
protected[this]
class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

Attributes
protected[this]
class SeqComposite [FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR, _], Second <: ParIterableLike.this.StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

Sequentially performs one task after another.
trait SignalContextPassingIterator [+IterRepr <: ParIterator] extends ParIterator with SignalContextPassingIterator[IterRepr]

A stackable modification that ensures signal contexts get passed along the iterators.
trait SignallingOps [PI <: DelegatedSignalling] extends AnyRef
class Slice [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]

Attributes
protected[this]
trait Sliced extends Sliced with Sliced with Transformed[T]

Definition Classes
ParSeqViewLike → ParIterableViewLike → GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike
class Span [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]

Attributes
protected[this]
class SplitAt [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]

Attributes
protected[this]
trait StrictSplitterCheckTask [R, Tp] extends Task[R, Tp]

Attributes
protected
class Sum [U >: T] extends Accessor[U, Sum[U]]

Attributes
protected[this]
type SuperParIterator = IterableSplitter[T]

Definition Classes
ParSeqLike
class Take [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

Attributes
protected[this]
class TakeWhile [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]

Attributes
protected[this]
trait TaskOps [R, Tp] extends AnyRef
class ToParCollection [U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]

Attributes
protected[this]
class ToParMap [K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

Attributes
protected[this]
trait Transformed [+S] extends ParSeqView[S, Coll, CollSeq] with Transformed[S] with Transformed[S]

The implementation base trait of this view.
trait Transformer [R, Tp] extends Accessor[R, Tp] with Transformer[R, Tp]

Attributes
protected
Definition Classes
ParSeqLike → ParIterableLike
class Updated [U >: T, That] extends Transformer[Combiner[U, That], Updated[U, That]]

Attributes
protected[this]
class Zip [U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]

Attributes
protected[this]
Definition Classes
ParSeqLike → ParIterableLike
class ZipAll [U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]

Attributes
protected[this]
trait Zipped [S] extends Zipped[S] with Zipped[S] with Transformed[(T, S)]

Definition Classes
ParSeqViewLike → ParIterableViewLike → GenSeqViewLike → GenIterableViewLike
trait ZippedAll [U >: T, S] extends ZippedAll[U, S] with ZippedAll[U, S] with Transformed[(U, S)]

Definition Classes
ParSeqViewLike → ParIterableViewLike → GenSeqViewLike → GenIterableViewLike

Abstract Value Members

val endpoints : SliceInterval

Attributes
protected[this] abstract
Definition Classes
Sliced

Concrete Value Members

def != (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def != (arg0: Any): Boolean

Test two objects for inequality.
Test two objects for inequality.
returns
true if !(this == that), false otherwise.

Attributes
final
Definition Classes
Any
def ## (): Int

Equivalent to x.hashCode except for boxed numeric types.
Equivalent to x.hashCode except for boxed numeric types. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them.
returns
a hash value consistent with ==

Attributes
final
Definition Classes
AnyRef → Any
def ++ [B] (that: GenTraversableOnce[B]): ParIterable[B]

[use case] Concatenates this parallel iterable with the elements of a traversable collection.
[use case]
Concatenates this parallel iterable with the elements of a traversable collection.
B
the element type of the returned collection.
that
the traversable to append.
returns
a new collection of type That which contains all elements of this parallel iterable followed by all elements of that.

Attributes
abstract
Definition Classes
GenTraversableLike
def ++ [U >: T, That] (xs: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], U, That]): That

Concatenates this parallel iterable with the elements of a traversable collection.
Concatenates this parallel iterable with the elements of a traversable collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this parallel iterable followed by all elements of that.

Definition Classes
ParSeqViewLike → ParIterableViewLike → ParIterableLike → GenTraversableLike
def +: (elem: T): ParIterable[T]

[use case] Prepends an element to this parallel iterable
[use case]
Prepends an element to this parallel iterable
elem
the prepended element
returns
a new collection of type That consisting of elem followed by all elements of this parallel iterable.

Attributes
abstract
Definition Classes
GenSeqLike
def +: [U >: T, That] (elem: U)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], U, That]): That

Prepends an element to this parallel iterable
Prepends an element to this parallel iterable
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
elem
the prepended element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That consisting of elem followed by all elements of this parallel iterable.

Definition Classes
ParSeqViewLike → ParSeqLike → GenSeqLike
def /: [S] (z: S)(op: (S, T) ⇒ S): S

Applies a binary operator to a start value and all elements of this parallel iterable, going left to right.
Applies a binary operator to a start value and all elements of this parallel iterable, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this parallel iterable, going left to right with the start value z on the left:
```
            op(...op(op(z, x,,1,,), x,,2,,), ..., x,,n,,)
```
where x,,1,,, ..., x,,n,, are the elements of this parallel iterable.
Definition Classes
ParIterableLike → GenTraversableOnce
def /:\ [A1 >: T] (z: A1)(op: (A1, A1) ⇒ A1): A1

A syntactic sugar for out of order folding.
A syntactic sugar for out of order folding. See fold.

Definition Classes
GenTraversableOnce
def :+ (elem: T): ParIterable[T]

[use case] Appends an element to this parallel iterable
[use case]
Appends an element to this parallel iterable
Note: will not terminate for infinite-sized collections.
elem
the appended element
returns
a new collection of type That consisting of all elements of this parallel iterable followed by elem.

Attributes
abstract
Definition Classes
GenSeqLike
def :+ [U >: T, That] (elem: U)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], U, That]): That

Appends an element to this parallel iterable
Appends an element to this parallel iterable
Note: will not terminate for infinite-sized collections.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
elem
the appended element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That consisting of all elements of this parallel iterable followed by elem.

Definition Classes
ParSeqViewLike → ParSeqLike → GenSeqLike
def :\ [S] (z: S)(op: (T, S) ⇒ S): S

Applies a binary operator to all elements of this parallel iterable and a start value, going right to left.
Applies a binary operator to all elements of this parallel iterable and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
z
the start value
op
the binary operator
returns
the result of inserting op between consecutive elements of this parallel iterable, going right to left with the start value z on the right:
```
            op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
```
where x,,1,,, ..., x,,n,, are the elements of this parallel iterable.
Definition Classes
ParIterableLike → GenTraversableOnce
def == (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def == (arg0: Any): Boolean

Test two objects for equality.
Test two objects for equality.
returns
true if the receiver object is equivalent to the argument; false otherwise.

Attributes
final
Definition Classes
Any
def aggregate [S] (z: S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S

Aggregates the results of applying an operator to subsequent elements.
Aggregates the results of applying an operator to subsequent elements.
This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked arbitrary number of times.
For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.
```
   pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
```
Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).
S
the type of accumulated results
z
the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)
seqop
an operator used to accumulate results within a partition
combop
an associative operator used to combine results from different partitions

Definition Classes
ParIterableLike → GenTraversableOnce
def apply (idx: Int): T

Selects an element by its index in the parallel iterable.
Selects an element by its index in the parallel iterable.
idx
The index to select.
returns
the element of this parallel iterable at index idx, where 0 indicates the first element.

Definition Classes
Sliced → Transformed → GenSeqLike
def asInstanceOf [T0] : T0

Cast the receiver object to be of type T0.
Cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.
returns
the receiver object.

Attributes
final
Definition Classes
Any
def bf2seq [S, That] (bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], S, That]): CanBuildFrom[SeqView[T, CollSeq], S, That]

Attributes
protected[this]
Definition Classes
ParIterableLike
implicit def builder2ops [Elem, To] (cb: Builder[Elem, To]): BuilderOps[Elem, To]

Attributes
protected implicit
Definition Classes
ParIterableLike
def canEqual (other: Any): Boolean

Definition Classes
ParIterableLike
def cbfactory : () ⇒ Combiner[T, ParSeqView[T, Coll, CollSeq]]

Attributes
protected[this]
Definition Classes
ParIterableLike
def clone (): AnyRef

Create a copy of the receiver object.
Create a copy of the receiver object.
The default implementation of the clone method is platform dependent.
returns
a copy of the receiver object.

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def collect [B] (pf: PartialFunction[T, B]): ParIterable[B]

[use case] Builds a new collection by applying a partial function to all elements of this parallel iterable on which the function is defined.
[use case]
Builds a new collection by applying a partial function to all elements of this parallel iterable on which the function is defined.
B
the element type of the returned collection.
pf
the partial function which filters and maps the parallel iterable.
returns
a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

Attributes
abstract
Definition Classes
GenTraversableLike
def collect [S, That] (pf: PartialFunction[T, S])(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], S, That]): That

Builds a new collection by applying a partial function to all elements of this parallel iterable on which the function is defined.
Builds a new collection by applying a partial function to all elements of this parallel iterable on which the function is defined.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
pf
the partial function which filters and maps the parallel iterable.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

Definition Classes
ParSeqViewLike → ParIterableLike → GenTraversableLike
def companion : GenericCompanion[ParSeq] with GenericParCompanion[ParSeq]

The factory companion object that builds instances of class ParIterable.
The factory companion object that builds instances of class ParIterable. (or its Iterable superclass where class ParIterable is not a Seq.)

Definition Classes
ParSeq → ParIterable → GenericParTemplate → GenSeq → GenIterable → GenTraversable → GenericTraversableTemplate
def copyToArray [U >: T] (xs: Array[U], start: Int, len: Int): Unit

Definition Classes
ParIterableLike → GenTraversableOnce
def copyToArray (xs: Array[T], start: Int): Unit

[use case] Copies values of this parallel iterable to an array.
[use case]
Copies values of this parallel iterable to an array. Fills the given array xs with values of this parallel iterable, beginning at index start. Copying will stop once either the end of the current parallel iterable is reached, or the end of the array is reached.
xs
the array to fill.
start
the starting index.

Attributes
abstract
Definition Classes
GenTraversableOnce
def copyToArray [U >: T] (xs: Array[U], start: Int): Unit

Copies values of this parallel iterable to an array.
Copies values of this parallel iterable to an array. Fills the given array xs with values of this parallel iterable, beginning at index start. Copying will stop once either the end of the current parallel iterable is reached, or the end of the array is reached.
Note: will not terminate for infinite-sized collections.
xs
the array to fill.
start
the starting index.

Definition Classes
ParIterableLike → GenTraversableOnce
def copyToArray (xs: Array[T]): Unit

[use case] Copies values of this parallel iterable to an array.
[use case]
Copies values of this parallel iterable to an array. Fills the given array xs with values of this parallel iterable. Copying will stop once either the end of the current parallel iterable is reached, or the end of the array is reached.
xs
the array to fill.

Attributes
abstract
Definition Classes
GenTraversableOnce
def copyToArray [U >: T] (xs: Array[U]): Unit

Copies values of this parallel iterable to an array.
Copies values of this parallel iterable to an array. Fills the given array xs with values of this parallel iterable. Copying will stop once either the end of the current parallel iterable is reached, or the end of the array is reached.
Note: will not terminate for infinite-sized collections.
xs
the array to fill.

Definition Classes
ParIterableLike → GenTraversableOnce
def corresponds [S] (that: GenSeq[S])(p: (T, S) ⇒ Boolean): Boolean

Tests whether every element of this parallel iterable relates to the corresponding element of another parallel sequence by satisfying a test predicate.
Tests whether every element of this parallel iterable relates to the corresponding element of another parallel sequence by satisfying a test predicate.
This method will use abort signalling capabilities. This means that splitters may send and read abort signals.
S
the type of the elements of that
that
the other parallel sequence
p
the test predicate, which relates elements from both sequences
returns
true if both parallel sequences have the same length and p(x, y) is true for all corresponding elements x of this parallel iterable and y of that, otherwise false

Definition Classes
ParSeqLike → GenSeqLike
def count (p: (T) ⇒ Boolean): Int

Counts the number of elements in the parallel iterable which satisfy a predicate.
Counts the number of elements in the parallel iterable which satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.

Definition Classes
ParIterableLike → GenTraversableOnce
def debugBuffer : ArrayBuffer[String]

Definition Classes
ParIterableLike
implicit def delegatedSignalling2ops [PI <: DelegatedSignalling] (it: PI): SignallingOps[PI]

Attributes
protected implicit
Definition Classes
ParIterableLike
def diff (that: GenSeq[T]): ParIterable[T]

[use case] Computes the multiset difference between this parallel iterable and another sequence.
[use case]
Computes the multiset difference between this parallel iterable and another sequence.
Note: will not terminate for infinite-sized collections.
that
the sequence of elements to remove
returns
a new collection of type That which contains all elements of this parallel iterable except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

Attributes
abstract
Definition Classes
GenSeqLike
def diff [U >: T] (that: GenSeq[U]): ParSeqView[T, Coll, CollSeq]

Computes the multiset difference between this parallel iterable and another sequence.
Computes the multiset difference between this parallel iterable and another sequence.
Note: will not terminate for infinite-sized collections.
that
the sequence of elements to remove
returns
a new collection of type That which contains all elements of this parallel iterable except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

Definition Classes
ParSeqLike → GenSeqLike
def distinct : ParSeqView[T, Coll, CollSeq]

Builds a new parallel iterable from this parallel iterable without any duplicate elements.
Builds a new parallel iterable from this parallel iterable without any duplicate elements.
Note: will not terminate for infinite-sized collections.
returns
A new parallel iterable which contains the first occurrence of every element of this parallel iterable.

Definition Classes
ParSeqLike → GenSeqLike
def down (p: scala.collection.parallel.IterableSplitter[_]): SeqSplitter[T]

Attributes
protected[this]
Definition Classes
ParSeqLike
def drop (n: Int): ParSeqView[T, Coll, CollSeq]

Selects all elements except first n ones.
Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the number of elements to drop from this parallel iterable.
returns
a parallel iterable consisting of all elements of this parallel iterable except the first n ones, or else the empty parallel iterable, if this parallel iterable has less than n elements.

Definition Classes
ParSeqViewLike → ParIterableViewLike → ParIterableLike → GenTraversableLike
def dropWhile (p: (T) ⇒ Boolean): ParSeqView[T, Coll, CollSeq]

Drops all elements in the longest prefix of elements that satisfy the predicate, and returns a collection composed of the remaining elements.
Drops all elements in the longest prefix of elements that satisfy the predicate, and returns a collection composed of the remaining elements.
This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state. The index flag is initially set to maximum integer value.
returns
a collection composed of all the elements after the longest prefix of elements in this parallel iterable that satisfy the predicate pred

Definition Classes
ParIterableViewLike → ParIterableLike → GenTraversableLike
def endsWith [S] (that: GenSeq[S]): Boolean

Tests whether this parallel iterable ends with the given parallel sequence.
Tests whether this parallel iterable ends with the given parallel sequence.
This method will use abort signalling capabilities. This means that splitters may send and read abort signals.
S
the type of the elements of that sequence
that
the sequence to test
returns
true if this parallel iterable has that as a suffix, false otherwise

Definition Classes
ParSeqLike → GenSeqLike
def eq (arg0: AnyRef): Boolean

Tests whether the argument (arg0) is a reference to the receiver object (this).
Tests whether the argument (arg0) is a reference to the receiver object (this).
The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:
- It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
- For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
- null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
returns
true if the argument is a reference to the receiver object; false otherwise.

Attributes
final
Definition Classes
AnyRef
def equals (that: Any): Boolean

The equals method for arbitrary sequences.
The equals method for arbitrary sequences. Compares this sequence to some other object.
that
The object to compare the sequence to
returns
true if that is a sequence that has the same elements as this sequence in the same order, false otherwise

Definition Classes
GenSeqLike → Equals → AnyRef → Any
def exists (pred: (T) ⇒ Boolean): Boolean

Tests whether a predicate holds for some element of this parallel iterable.
Tests whether a predicate holds for some element of this parallel iterable.
This method will use abort signalling capabilities. This means that splitters may send and read abort signals.
returns
true if p holds for some element, false otherwise

Definition Classes
ParIterableLike → GenTraversableOnce
def filter (p: (T) ⇒ Boolean): ParSeqView[T, Coll, CollSeq]

Selects all elements of this parallel iterable which satisfy a predicate.
Selects all elements of this parallel iterable which satisfy a predicate.
p
the predicate used to test elements.
returns
a new parallel iterable consisting of all elements of this parallel iterable that satisfy the given predicate p. Their order may not be preserved.

Definition Classes
ParIterableViewLike → ParIterableLike → GenTraversableLike
def filterNot (p: (T) ⇒ Boolean): ParSeqView[T, Coll, CollSeq]

Selects all elements of this parallel iterable which do not satisfy a predicate.
Selects all elements of this parallel iterable which do not satisfy a predicate.
p
the predicate used to test elements.
returns
a new parallel iterable consisting of all elements of this parallel iterable that do not satisfy the given predicate p. Their order may not be preserved.

Definition Classes
ParIterableViewLike → ParIterableLike → GenTraversableLike
def finalize (): Unit

Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def find (pred: (T) ⇒ Boolean): Option[T]

Finds some element in the collection for which the predicate holds, if such an element exists.
Finds some element in the collection for which the predicate holds, if such an element exists. The element may not necessarily be the first such element in the iteration order.
If there are multiple elements obeying the predicate, the choice is nondeterministic.
This method will use abort signalling capabilities. This means that splitters may send and read abort signals.
returns
an option value with the element if such an element exists, or None otherwise

Definition Classes
ParIterableLike → GenTraversableOnce
def flatMap [B] (f: (T) ⇒ GenTraversableOnce[B]): ParIterable[B]

[use case] Builds a new collection by applying a function to all elements of this parallel iterable and concatenating the results.
[use case]
Builds a new collection by applying a function to all elements of this parallel iterable and concatenating the results.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new collection of type That resulting from applying the given collection-valued function f to each element of this parallel iterable and concatenating the results.

Attributes
abstract
Definition Classes
GenTraversableLike
def flatMap [S, That] (f: (T) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], S, That]): That

Builds a new collection by applying a function to all elements of this parallel iterable and concatenating the results.
Builds a new collection by applying a function to all elements of this parallel iterable and concatenating the results.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given collection-valued function f to each element of this parallel iterable and concatenating the results.

Definition Classes
ParIterableViewLike → ParIterableLike → GenTraversableLike
def flatten [B] : ParIterable[B]

[use case] Converts this parallel iterable of traversable collections into a parallel iterable in which all element collections are concatenated.
[use case]
Converts this parallel iterable of traversable collections into a parallel iterable in which all element collections are concatenated.
B
the type of the elements of each traversable collection.
returns
a new parallel iterable resulting from concatenating all element parallel iterables.

Attributes
abstract
Definition Classes
GenericTraversableTemplate
def flatten [B] (implicit asTraversable: (T) ⇒ TraversableOnce[B]): ParSeq[B]

Converts this parallel iterable of traversable collections into a parallel iterable in which all element collections are concatenated.
Converts this parallel iterable of traversable collections into a parallel iterable in which all element collections are concatenated.
B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this parallel iterable is a Traversable.
returns
a new parallel iterable resulting from concatenating all element parallel iterables.

Definition Classes
GenericTraversableTemplate
def fold [U >: T] (z: U)(op: (U, U) ⇒ U): U

Folds the elements of this sequence using the specified associative binary operator.
Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.
Note this method has a different signature than the foldLeft and foldRight methods of the trait Traversable. The result of folding may only be a supertype of this parallel collection's type parameter T.
U
a type parameter for the binary operator, a supertype of T.
z
a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing the result (e.g. Nil for list concatenation, 0 for addition, or 1 for multiplication)
op
a binary operator that must be associative
returns
the result of applying fold operator op between all the elements and z

Definition Classes
ParIterableLike → GenTraversableOnce
def foldLeft [S] (z: S)(op: (S, T) ⇒ S): S

Applies a binary operator to a start value and all elements of this parallel iterable, going left to right.
Applies a binary operator to a start value and all elements of this parallel iterable, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this parallel iterable, going left to right with the start value z on the left:
```
            op(...op(z, x,,1,,), x,,2,,, ..., x,,n,,)
```
where x,,1,,, ..., x,,n,, are the elements of this parallel iterable.
Definition Classes
ParIterableLike → GenTraversableOnce
def foldRight [S] (z: S)(op: (T, S) ⇒ S): S

Applies a binary operator to all elements of this parallel iterable and a start value, going right to left.
Applies a binary operator to all elements of this parallel iterable and a start value, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this parallel iterable, going right to left with the start value z on the right:
```
            op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
```
where x,,1,,, ..., x,,n,, are the elements of this parallel iterable.
Definition Classes
ParIterableLike → GenTraversableOnce
def forall (pred: (T) ⇒ Boolean): Boolean

Tests whether a predicate holds for all elements of this parallel iterable.
Tests whether a predicate holds for all elements of this parallel iterable.
This method will use abort signalling capabilities. This means that splitters may send and read abort signals.
returns
true if p holds for all elements, false otherwise

Definition Classes
ParIterableLike → GenTraversableOnce
def force [U >: T, That] (implicit bf: CanBuildFrom[Coll, U, That]): That

Definition Classes
ParSeqViewLike → ParIterableViewLike → GenTraversableViewLike
def foreach [U] (f: (T) ⇒ U): Unit

Applies a function f to all the elements of parallel iterable in a sequential order.
Applies a function f to all the elements of parallel iterable in a sequential order.
U
the result type of the function applied to each element, which is always discarded
f
function applied to each element

Definition Classes
ParIterableViewLike → ParIterableLike → GenericTraversableTemplate → GenTraversableLike → GenTraversableOnce
def from : Int

Attributes
protected[this]
Definition Classes
Sliced
def genericBuilder [B] : Combiner[B, ParSeq[B]]

The generic builder that builds instances of ParIterable at arbitrary element types.
The generic builder that builds instances of ParIterable at arbitrary element types.

Definition Classes
GenericParTemplate → GenericTraversableTemplate
def genericCombiner [B] : Combiner[B, ParSeq[B]]

Definition Classes
GenericParTemplate
def getClass (): java.lang.Class[_ <: java.lang.Object]

A representation that corresponds to the dynamic class of the receiver object.
A representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
returns
a representation that corresponds to the dynamic class of the receiver object.

Attributes
final
Definition Classes
AnyRef
def groupBy [K] (f: (T) ⇒ K): ParMap[K, ParSeqView[T, Coll, CollSeq]]

Partitions this parallel iterable into a map of parallel iterables according to some discriminator function.
Partitions this parallel iterable into a map of parallel iterables according to some discriminator function.
Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new parallel iterable.
K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to parallel iterables such that the following invariant holds:
```
                (xs partition f)(k) = xs filter (x => f(x) == k)
```
That is, every key k is bound to a parallel iterable of those elements x for which f(x) equals k.
Definition Classes
ParSeqViewLike → ParIterableLike → GenTraversableLike
def hasDefiniteSize : Boolean

Definition Classes
ParIterableLike → GenTraversableOnce
def hashCode (): Int

Hashcodes for ParIterable produce a value from the hashcodes of all the elements of the parallel iterable.
Hashcodes for ParIterable produce a value from the hashcodes of all the elements of the parallel iterable.
returns
the hash code value for this object.

Definition Classes
GenSeqLike → AnyRef → Any
def head : T

Definition Classes
GenIterableLike → GenTraversableLike
def indexOf (elem: T, from: Int): Int

[use case] Finds index of first occurrence of some value in this parallel iterable after or at some start index.
[use case]
Finds index of first occurrence of some value in this parallel iterable after or at some start index.
elem
the element value to search for.
from
the start index
returns
the index >= from of the first element of this parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

Attributes
abstract
Definition Classes
GenSeqLike
def indexOf [B >: T] (elem: B, from: Int): Int

Finds index of first occurrence of some value in this parallel iterable after or at some start index.
Finds index of first occurrence of some value in this parallel iterable after or at some start index.
Note: may not terminate for infinite-sized collections.
B
the type of the element elem.
elem
the element value to search for.
from
the start index
returns
the index >= from of the first element of this parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

Definition Classes
GenSeqLike
def indexOf (elem: T): Int

[use case] Finds index of first occurrence of some value in this parallel iterable.
[use case]
Finds index of first occurrence of some value in this parallel iterable.
elem
the element value to search for.
returns
the index of the first element of this parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

Attributes
abstract
Definition Classes
GenSeqLike
def indexOf [B >: T] (elem: B): Int

Finds index of first occurrence of some value in this parallel iterable.
Finds index of first occurrence of some value in this parallel iterable.
Note: may not terminate for infinite-sized collections.
B
the type of the element elem.
elem
the element value to search for.
returns
the index of the first element of this parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

Definition Classes
GenSeqLike
def indexWhere (p: (T) ⇒ Boolean, from: Int): Int

Finds the first element satisfying some predicate.
Finds the first element satisfying some predicate.
This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state.
The index flag is initially set to maximum integer value.
p
the predicate used to test the elements
from
the starting offset for the search
returns
the index >= from of the first element of this parallel iterable that satisfies the predicate p, or -1, if none exists

Definition Classes
ParSeqLike → GenSeqLike
def indexWhere (p: (T) ⇒ Boolean): Int

Finds index of first element satisfying some predicate.
Finds index of first element satisfying some predicate.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
the index of the first element of this parallel iterable that satisfies the predicate p, or -1, if none exists.

Definition Classes
GenSeqLike
def intersect (that: Seq[T]): ParIterable[T]

[use case] Computes the multiset intersection between this parallel iterable and another sequence.
[use case]
Computes the multiset intersection between this parallel iterable and another sequence.
Note: may not terminate for infinite-sized collections.
that
the sequence of elements to intersect with.
returns
a new collection of type That which contains all elements of this parallel iterable which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

Attributes
abstract
Definition Classes
ParSeqLike
def intersect [U >: T] (that: GenSeq[U]): ParSeqView[T, Coll, CollSeq]

Computes the multiset intersection between this parallel iterable and another sequence.
Computes the multiset intersection between this parallel iterable and another sequence.
Note: may not terminate for infinite-sized collections.
that
the sequence of elements to intersect with.
returns
a new collection of type That which contains all elements of this parallel iterable which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

Definition Classes
ParSeqLike → GenSeqLike
def isDefinedAt (idx: Int): Boolean

Tests whether this parallel iterable contains given index.
Tests whether this parallel iterable contains given index.
The implementations of methods apply and isDefinedAt turn a Seq[A] into a PartialFunction[Int, A].
idx
the index to test
returns
true if this parallel iterable contains an element at position idx, false otherwise.

Definition Classes
GenSeqLike
def isEmpty : Boolean

Tests whether the parallel iterable is empty.
Tests whether the parallel iterable is empty.
returns
true if the parallel iterable contains no elements, false otherwise.

Definition Classes
GenIterableLike → GenTraversableOnce
def isInstanceOf [T0] : Boolean

Test whether the dynamic type of the receiver object is T0.
Test whether the dynamic type of the receiver object is T0.
Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.

Attributes
final
Definition Classes
Any
def isStrictSplitterCollection : Boolean

Denotes whether this parallel collection has strict splitters.
Denotes whether this parallel collection has strict splitters.
This is true in general, and specific collection instances may choose to override this method. Such collections will fail to execute methods which rely on splitters being strict, i.e. returning a correct value in the remaining method.
This method helps ensure that such failures occur on method invocations, rather than later on and in unpredictable ways.

Definition Classes
ParIterableLike
def isTraversableAgain : Boolean

Tests whether this parallel iterable can be repeatedly traversed.
Tests whether this parallel iterable can be repeatedly traversed.
returns
true

Attributes
final
Definition Classes
GenTraversableLike → GenTraversableOnce
def iterator : SeqSplitter[T]

Creates a new split iterator used to traverse the elements of this collection.
Creates a new split iterator used to traverse the elements of this collection.
By default, this method is implemented in terms of the protected splitter method.
returns
a split iterator

Definition Classes
Transformed → Transformed → Transformed → ParSeqLike → ParIterableLike → GenIterableLike
def lastIndexOf (elem: T, end: Int): Int

[use case] Finds index of last occurrence of some value in this parallel iterable before or at a given end index.
[use case]
Finds index of last occurrence of some value in this parallel iterable before or at a given end index.
elem
the element value to search for.
end
the end index.
returns
the index <= end of the last element of this parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

Attributes
abstract
Definition Classes
GenSeqLike
def lastIndexOf [B >: T] (elem: B, end: Int): Int

Finds index of last occurrence of some value in this parallel iterable before or at a given end index.
Finds index of last occurrence of some value in this parallel iterable before or at a given end index.
B
the type of the element elem.
elem
the element value to search for.
end
the end index.
returns
the index <= end of the last element of this parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

Definition Classes
GenSeqLike
def lastIndexOf (elem: T): Int

[use case] Finds index of last occurrence of some value in this parallel iterable.
[use case]
Finds index of last occurrence of some value in this parallel iterable.
elem
the element value to search for.
returns
the index of the last element of this parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

Attributes
abstract
Definition Classes
GenSeqLike
def lastIndexOf [B >: T] (elem: B): Int

Finds index of last occurrence of some value in this parallel iterable.
Finds index of last occurrence of some value in this parallel iterable.
Note: will not terminate for infinite-sized collections.
B
the type of the element elem.
elem
the element value to search for.
returns
the index of the last element of this parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

Definition Classes
GenSeqLike
def lastIndexWhere (p: (T) ⇒ Boolean, end: Int): Int

Finds the last element satisfying some predicate.
Finds the last element satisfying some predicate.
This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state.
The index flag is initially set to minimum integer value.
p
the predicate used to test the elements
end
the maximum offset for the search
returns
the index <= end of the first element of this parallel iterable that satisfies the predicate p, or -1, if none exists

Definition Classes
ParSeqLike → GenSeqLike
def lastIndexWhere (p: (T) ⇒ Boolean): Int

Finds index of last element satisfying some predicate.
Finds index of last element satisfying some predicate.
Note: will not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
the index of the last element of this parallel iterable that satisfies the predicate p, or -1, if none exists.

Definition Classes
GenSeqLike
def length : Int

The length of the parallel iterable.
The length of the parallel iterable.
Note: will not terminate for infinite-sized collections.
Note: xs.length and xs.size yield the same result.
returns
the number of elements in this parallel iterable.

Definition Classes
Sliced → Transformed → GenSeqLike
def map [B] (f: (T) ⇒ B): ParIterable[B]

[use case] Builds a new collection by applying a function to all elements of this parallel iterable.
[use case]
Builds a new collection by applying a function to all elements of this parallel iterable.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new collection of type That resulting from applying the given function f to each element of this parallel iterable and collecting the results.

Attributes
abstract
Definition Classes
GenTraversableLike
def map [S, That] (f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], S, That]): That

Builds a new collection by applying a function to all elements of this parallel iterable.
Builds a new collection by applying a function to all elements of this parallel iterable.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given function f to each element of this parallel iterable and collecting the results.

Definition Classes
ParSeqViewLike → ParIterableViewLike → ParIterableLike → GenTraversableLike
def max : T

[use case] Finds the largest element.
[use case]
Finds the largest element.
returns
the largest element of this parallel iterable with respect to the ordering cmp.

Attributes
abstract
Definition Classes
GenTraversableOnce
def max [U >: T] (implicit ord: Ordering[U]): T

Finds the largest element.
Finds the largest element.
returns
the largest element of this parallel iterable with respect to the ordering cmp.

Definition Classes
ParIterableLike → GenTraversableOnce
def maxBy [S] (f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

Definition Classes
ParIterableLike → GenTraversableOnce
def min : T

[use case] Finds the smallest element.
[use case]
Finds the smallest element.
returns
the smallest element of this parallel iterable with respect to the ordering cmp.

Attributes
abstract
Definition Classes
GenTraversableOnce
def min [U >: T] (implicit ord: Ordering[U]): T

Finds the smallest element.
Finds the smallest element.
returns
the smallest element of this parallel iterable with respect to the ordering cmp.

Definition Classes
ParIterableLike → GenTraversableOnce
def minBy [S] (f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

Definition Classes
ParIterableLike → GenTraversableOnce
def mkString : String

Displays all elements of this parallel iterable in a string.
Displays all elements of this parallel iterable in a string.
returns
a string representation of this parallel iterable. In the resulting string the string representations (w.r.t. the method toString) of all elements of this parallel iterable follow each other without any separator string.

Definition Classes
ParIterableLike → GenTraversableOnce
def mkString (sep: String): String

Displays all elements of this parallel iterable in a string using a separator string.
Displays all elements of this parallel iterable in a string using a separator string.
sep
the separator string.
returns
a string representation of this parallel iterable. In the resulting string the string representations (w.r.t. the method toString) of all elements of this parallel iterable are separated by the string sep.
Definition Classes
ParIterableLike → GenTraversableOnce
Example:
1. List(1, 2, 3).mkString("|") = "1|2|3"
def mkString (start: String, sep: String, end: String): String

Displays all elements of this parallel iterable in a string using start, end, and separator strings.
Displays all elements of this parallel iterable in a string using start, end, and separator strings.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
a string representation of this parallel iterable. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this parallel iterable are separated by the string sep.
Definition Classes
ParIterableLike → GenTraversableOnce
Example:
1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
def ne (arg0: AnyRef): Boolean

Equivalent to !(this eq that).
Equivalent to !(this eq that).
returns
true if the argument is not a reference to the receiver object; false otherwise.

Attributes
final
Definition Classes
AnyRef
def newAppended [U >: T] (that: GenTraversable[U]): Transformed[U]

Attributes
protected
Definition Classes
ParSeqViewLike → ParIterableViewLike
def newAppendedTryParIterable [U >: T] (that: GenTraversable[U]): Transformed[U]

Attributes
protected
Definition Classes
ParIterableViewLike
def newBuilder : Builder[T, ParSeq[T]]

The builder that builds instances of type ParIterable[A]
The builder that builds instances of type ParIterable[A]

Attributes
protected[this]
Definition Classes
GenericParTemplate → GenericTraversableTemplate → HasNewBuilder
def newCombiner : Combiner[T, ParSeqView[T, Coll, CollSeq]]

Attributes
protected[this]
Definition Classes
ParIterableViewLike → GenericParTemplate → HasNewCombiner
def newDroppedWhile (p: (T) ⇒ Boolean): Nothing

Attributes
protected
Definition Classes
ParIterableViewLike
def newFiltered (p: (T) ⇒ Boolean): Nothing

Attributes
protected
Definition Classes
ParIterableViewLike
def newFlatMapped [S] (f: (T) ⇒ GenTraversableOnce[S]): Nothing

Attributes
protected
Definition Classes
ParIterableViewLike
def newForced [S] (xs: ⇒ GenSeq[S]): Transformed[S]

Attributes
protected
Definition Classes
ParSeqViewLike → ParIterableViewLike
def newForcedTryParIterable [S] (xs: ⇒ GenSeq[S]): Transformed[S]

Attributes
protected
Definition Classes
ParIterableViewLike
def newMapped [S] (f: (T) ⇒ S): Transformed[S]

Attributes
protected
Definition Classes
ParSeqViewLike → ParIterableViewLike
def newPatched [U >: T] (_from: Int, _patch: GenSeq[U], _replaced: Int): Transformed[U]

Attributes
protected
Definition Classes
ParSeqViewLike
def newPrepended [U >: T] (elem: U): Transformed[U]

Attributes
protected
Definition Classes
ParSeqViewLike
def newReversed : Transformed[T]

Attributes
protected
Definition Classes
ParSeqViewLike
def newSliced (_endpoints: SliceInterval): Transformed[T]

Attributes
protected
Definition Classes
ParSeqViewLike → ParIterableViewLike
def newTakenWhile (p: (T) ⇒ Boolean): Nothing

Attributes
protected
Definition Classes
ParIterableViewLike
def newZipped [S] (that: GenIterable[S]): Transformed[(T, S)]

Attributes
protected
Definition Classes
ParSeqViewLike → ParIterableViewLike
def newZippedAll [U >: T, S] (that: GenIterable[S], _thisElem: U, _thatElem: S): Transformed[(U, S)]

Attributes
protected
Definition Classes
ParSeqViewLike → ParIterableViewLike
def newZippedAllTryParSeq [S, U >: T] (that: GenIterable[S], thisElem: U, thatElem: S): Transformed[(U, S)]

Attributes
protected
Definition Classes
ParIterableViewLike
def newZippedTryParSeq [S] (that: GenIterable[S]): Transformed[(T, S)]

Attributes
protected
Definition Classes
ParIterableViewLike
def nonEmpty : Boolean

Tests whether the parallel iterable is not empty.
Tests whether the parallel iterable is not empty.
returns
true if the parallel iterable contains at least one element, false otherwise.

Definition Classes
ParIterableLike → GenTraversableOnce
def notify (): Unit

Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.

Attributes
final
Definition Classes
AnyRef
def notifyAll (): Unit

Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.

Attributes
final
Definition Classes
AnyRef
def padTo (len: Int, elem: T): ParIterable[T]

[use case] Appends an element value to this parallel iterable until a given target length is reached.
[use case]
Appends an element value to this parallel iterable until a given target length is reached.
len
the target length
elem
the padding value
returns
a new collection of type That consisting of all elements of this parallel iterable followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

Attributes
abstract
Definition Classes
GenSeqLike
def padTo [U >: T, That] (len: Int, elem: U)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], U, That]): That

Appends an element value to this parallel iterable until a given target length is reached.
Appends an element value to this parallel iterable until a given target length is reached.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
len
the target length
elem
the padding value
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That consisting of all elements of this parallel iterable followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

Definition Classes
ParSeqViewLike → ParSeqLike → GenSeqLike
def par : ParSeqView[T, Coll, CollSeq]

Returns a parallel implementation of this collection.
Returns a parallel implementation of this collection.
For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.
Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.
All parallel collections return a reference to themselves.
returns
a parallel implementation of this collection

Definition Classes
ParIterableLike → CustomParallelizable → Parallelizable
def parCombiner : Combiner[T, ParSeqView[T, Coll, CollSeq]]

The default par implementation uses the combiner provided by this method to create a new parallel collection.
The default par implementation uses the combiner provided by this method to create a new parallel collection.
returns
a combiner for the parallel collection of type ParRepr

Attributes
protected[this]
Definition Classes
CustomParallelizable → Parallelizable
def partition (p: (T) ⇒ Boolean): (ParSeqView[T, Coll, CollSeq], ParSeqView[T, Coll, CollSeq])

Partitions this parallel iterable in two parallel iterables according to a predicate.
Partitions this parallel iterable in two parallel iterables according to a predicate.
p
the predicate on which to partition.
returns
a pair of parallel iterables: the first parallel iterable consists of all elements that satisfy the predicate p and the second parallel iterable consists of all elements that don't. The relative order of the elements in the resulting parallel iterables may not be preserved.

Definition Classes
ParIterableViewLike → ParIterableLike → GenTraversableLike
def patch (from: Int, that: GenSeq[T], replaced: Int): ParIterable[T]

[use case] Produces a new parallel iterable where a slice of elements in this parallel iterable is replaced by another sequence.
[use case]
Produces a new parallel iterable where a slice of elements in this parallel iterable is replaced by another sequence.
from
the index of the first replaced element
replaced
the number of elements to drop in the original parallel iterable
returns
a new parallel iterable consisting of all elements of this parallel iterable except that replaced elements starting from from are replaced by patch.

Attributes
abstract
Definition Classes
GenSeqLike
def patch [U >: T, That] (from: Int, patch: GenSeq[U], replace: Int)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], U, That]): That

Produces a new parallel iterable where a slice of elements in this parallel iterable is replaced by another sequence.
Produces a new parallel iterable where a slice of elements in this parallel iterable is replaced by another sequence.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
from
the index of the first replaced element
patch
the replacement sequence
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new parallel iterable consisting of all elements of this parallel iterable except that replaced elements starting from from are replaced by patch.

Definition Classes
ParSeqViewLike → ParSeqLike → GenSeqLike
def prefixLength (p: (T) ⇒ Boolean): Int

Returns the length of the longest prefix whose elements all satisfy some predicate.
Returns the length of the longest prefix whose elements all satisfy some predicate.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
the length of the longest prefix of this parallel iterable such that every element of the segment satisfies the predicate p.

Definition Classes
GenSeqLike
def product : T

[use case] Multiplies up the elements of this collection.
[use case]
Multiplies up the elements of this collection.
returns
the product of all elements of this parallel iterable with respect to the * operator in num.

Attributes
abstract
Definition Classes
GenTraversableOnce
def product [U >: T] (implicit num: Numeric[U]): U

Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
num
an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.
returns
the product of all elements of this parallel iterable with respect to the * operator in num.

Definition Classes
ParIterableLike → GenTraversableOnce
def reduce [U >: T] (op: (U, U) ⇒ U): U

Reduces the elements of this sequence using the specified associative binary operator.
Reduces the elements of this sequence using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
Note this method has a different signature than the reduceLeft and reduceRight methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.
U
A type parameter for the binary operator, a supertype of T.
op
A binary operator that must be associative.
returns
The result of applying reduce operator op between all the elements if the collection is nonempty.

Definition Classes
ParIterableLike → GenTraversableOnce
def reduceLeft [U >: T] (op: (U, T) ⇒ U): U

Definition Classes
ParIterableLike
def reduceLeftOption [U >: T] (op: (U, T) ⇒ U): Option[U]

Optionally applies a binary operator to all elements of this parallel iterable, going left to right.
Optionally applies a binary operator to all elements of this parallel iterable, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) is this parallel iterable is nonempty, None otherwise.

Definition Classes
ParIterableLike → GenTraversableOnce
def reduceOption [U >: T] (op: (U, U) ⇒ U): Option[U]

Optionally reduces the elements of this sequence using the specified associative binary operator.
Optionally reduces the elements of this sequence using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
Note this method has a different signature than the reduceLeftOption and reduceRightOption methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.
U
A type parameter for the binary operator, a supertype of T.
op
A binary operator that must be associative.
returns
An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

Definition Classes
ParIterableLike → GenTraversableOnce
def reduceRight [U >: T] (op: (T, U) ⇒ U): U

Applies a binary operator to all elements of this parallel iterable, going right to left.
Applies a binary operator to all elements of this parallel iterable, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this parallel iterable, going right to left:
```
            op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
```
where x,,1,,, ..., x,,n,, are the elements of this parallel iterable.
Definition Classes
ParIterableLike → GenTraversableOnce
def reduceRightOption [U >: T] (op: (T, U) ⇒ U): Option[U]

Optionally applies a binary operator to all elements of this parallel iterable, going right to left.
Optionally applies a binary operator to all elements of this parallel iterable, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) is this parallel iterable is nonempty, None otherwise.

Definition Classes
ParIterableLike → GenTraversableOnce
def repr : ParSeqView[T, Coll, CollSeq]

Definition Classes
ParIterableLike → GenTraversableLike
def reuse [S, That] (oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

Optionally reuses an existing combiner for better performance.
Optionally reuses an existing combiner for better performance. By default it doesn't - subclasses may override this behaviour. The provided combiner oldc that can potentially be reused will be either some combiner from the previous computational task, or None if there was no previous phase (in which case this method must return newc).
oldc
The combiner that is the result of the previous task, or None if there was no previous task.
newc
The new, empty combiner that can be used.
returns
Either newc or oldc.

Attributes
protected
Definition Classes
ParIterableLike
def reverse : ParSeqView[T, Coll, CollSeq]

Returns new parallel iterable wih elements in reversed order.
Returns new parallel iterable wih elements in reversed order.
Note: will not terminate for infinite-sized collections.
returns
A new parallel iterable with all elements of this parallel iterable in reversed order.

Definition Classes
ParSeqViewLike → ParSeqLike → GenSeqLike
def reverseMap [B] (f: (T) ⇒ B): ParIterable[B]

[use case] Builds a new collection by applying a function to all elements of this parallel iterable and collecting the results in reversed order.
[use case]
Builds a new collection by applying a function to all elements of this parallel iterable and collecting the results in reversed order.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new collection of type That resulting from applying the given function f to each element of this parallel iterable and collecting the results in reversed order.
Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

Attributes
abstract
Definition Classes
GenSeqLike
def reverseMap [S, That] (f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], S, That]): That

Builds a new collection by applying a function to all elements of this parallel iterable and collecting the results in reversed order.
Builds a new collection by applying a function to all elements of this parallel iterable and collecting the results in reversed order.
Note: will not terminate for infinite-sized collections.
Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given function f to each element of this parallel iterable and collecting the results in reversed order.

Definition Classes
ParSeqViewLike → ParSeqLike → GenSeqLike
def sameElements (that: GenIterable[T]): Boolean

[use case] Checks if the other iterable collection contains the same elements in the same order as this parallel iterable.
[use case]
Checks if the other iterable collection contains the same elements in the same order as this parallel iterable.
that
the collection to compare with.
returns
true, if both collections contain the same elements in the same order, false otherwise.

Attributes
abstract
Definition Classes
GenIterableLike
def sameElements [U >: T] (that: GenIterable[U]): Boolean

Checks if the other iterable collection contains the same elements in the same order as this parallel iterable.
Checks if the other iterable collection contains the same elements in the same order as this parallel iterable.
Note: might return different results for different runs, unless the underlying collection type is ordered.
Note: will not terminate for infinite-sized collections.
that
the collection to compare with.
returns
true, if both collections contain the same elements in the same order, false otherwise.

Definition Classes
ParSeqLike → ParIterableLike → GenIterableLike
def scan (z: T)(op: (T, T) ⇒ T): ParIterable[T]

[use case] Computes a prefix scan of the elements of the collection.
[use case]
Computes a prefix scan of the elements of the collection.
z
neutral element for the operator op
op
the associative operator for the scan
returns
a collection containing the prefix scan of the elements in the original collection

Attributes
abstract
Definition Classes
ParIterableLike
def scan [U >: T, That] (z: U)(op: (U, U) ⇒ U)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], U, That]): That

Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
Note: The neutral element z may be applied more than once.
U
element type of the resulting collection
That
type of the resulting collection
z
neutral element for the operator op
op
the associative operator for the scan
returns
a collection containing the prefix scan of the elements in the original collection

Definition Classes
ParIterableLike → GenTraversableLike
def scanBlockSize : Int

Attributes
protected[this]
Definition Classes
ParIterableLike
def scanLeft [S, That] (z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], S, That]): That

Produces a collection containing cummulative results of applying the operator going left to right.
Produces a collection containing cummulative results of applying the operator going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
collection with intermediate results

Definition Classes
ParSeqViewLike → ParIterableLike → GenTraversableLike
def scanRight [S, That] (z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], S, That]): That

Produces a collection containing cummulative results of applying the operator going right to left.
Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
Example:
```
   List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
```
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
collection with intermediate results

Definition Classes
ParSeqViewLike → ParIterableLike → GenTraversableLike
def segmentLength (p: (T) ⇒ Boolean, from: Int): Int

Returns the length of the longest segment of elements starting at a given position satisfying some predicate.
Returns the length of the longest segment of elements starting at a given position satisfying some predicate.
This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state.
The index flag is initially set to maximum integer value.
p
the predicate used to test the elements
from
the starting offset for the search
returns
the length of the longest segment of elements starting at from and satisfying the predicate

Definition Classes
ParSeqLike → GenSeqLike
def seq : ThisSeq

Definition Classes
Sliced → Sliced → ParIterableLike → GenSeq → GenIterable → GenTraversable → Parallelizable → GenTraversableOnce
def sequentially [S, That <: Parallel] (b: (SeqView[T, CollSeq]) ⇒ Parallelizable[S, That]): ParSeqView[T, Coll, CollSeq]

Attributes
protected[this]
Definition Classes
ParIterableLike
def size : Int

The size of this parallel iterable.
The size of this parallel iterable.
Note: will not terminate for infinite-sized collections.
returns
the number of elements in this parallel iterable.

Definition Classes
Transformed → Transformed → ParSeqLike → GenTraversableLike → GenTraversableOnce
def slice (from: Int, until: Int): ParSeqView[T, Coll, CollSeq]

Selects an interval of elements.
Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:
```
   from <= indexOf(x) < until
```
Note: might return different results for different runs, unless the underlying collection type is ordered.
from
the lowest index to include from this parallel iterable.
until
the highest index to EXCLUDE from this parallel iterable.
returns
a parallel iterable containing the elements greater than or equal to index from extending up to (but not including) index until of this parallel iterable.

Definition Classes
ParSeqViewLike → ParIterableViewLike → ParIterableLike → GenTraversableLike
def span (p: (T) ⇒ Boolean): (ParSeqView[T, Coll, CollSeq], ParSeqView[T, Coll, CollSeq])

Splits this parallel iterable into a prefix/suffix pair according to a predicate.
Splits this parallel iterable into a prefix/suffix pair according to a predicate.
This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state. The index flag is initially set to maximum integer value.
returns
a pair consisting of the longest prefix of the collection for which all the elements satisfy pred, and the rest of the collection

Definition Classes
ParIterableViewLike → ParIterableLike → GenTraversableLike
def splitAt (n: Int): (ParSeqView[T, Coll, CollSeq], ParSeqView[T, Coll, CollSeq])

Splits this parallel iterable into two at a given position.
Splits this parallel iterable into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the position at which to split.
returns
a pair of parallel iterables consisting of the first n elements of this parallel iterable, and the other elements.

Definition Classes
ParSeqViewLike → ParIterableViewLike → ParIterableLike → GenTraversableLike
def splitter : SeqSplitter[T]

Creates a new parallel iterator used to traverse the elements of this parallel collection.
Creates a new parallel iterator used to traverse the elements of this parallel collection. This iterator is more specific than the iterator of the returned by iterator, and augmented with additional accessor and transformer methods.
returns
a parallel iterator

Definition Classes
Sliced → Transformed → ParSeqLike → Sliced → Transformed → ParIterableLike
def startsWith [S] (that: GenSeq[S], offset: Int): Boolean

Tests whether this parallel iterable contains the given sequence at a given index.
Tests whether this parallel iterable contains the given sequence at a given index.
This method will use abort signalling capabilities. This means that splitters may send and read abort signals.
that
the parallel sequence this sequence is being searched for
offset
the starting offset for the search
returns
true if there is a sequence that starting at offset in this sequence, false otherwise

Definition Classes
ParSeqLike → GenSeqLike
def startsWith [B] (that: Seq[B]): Boolean

Definition Classes
GenSeqLike
Annotations
@bridge()
def startsWith [B] (that: GenSeq[B]): Boolean

Tests whether this parallel iterable starts with the given sequence.
Tests whether this parallel iterable starts with the given sequence.
that
the sequence to test
returns
true if this collection has that as a prefix, false otherwise.

Definition Classes
GenSeqLike
def stringPrefix : String

Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
returns
a string representation which starts the result of toString applied to this parallel iterable. By default the string prefix is the simple name of the collection class parallel iterable.

Definition Classes
ParSeq → ParIterable → GenTraversableLike
def sum : T

[use case] Sums up the elements of this collection.
[use case]
Sums up the elements of this collection.
returns
the sum of all elements of this parallel iterable with respect to the + operator in num.

Attributes
abstract
Definition Classes
GenTraversableOnce
def sum [U >: T] (implicit num: Numeric[U]): U

Sums up the elements of this collection.
Sums up the elements of this collection.
num
an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.
returns
the sum of all elements of this parallel iterable with respect to the + operator in num.

Definition Classes
ParIterableLike → GenTraversableOnce
def synchronized [T0] (arg0: ⇒ T0): T0

Attributes
final
Definition Classes
AnyRef
def tail : ParSeqView[T, Coll, CollSeq]

Selects all elements except the first.
Selects all elements except the first.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
a parallel iterable consisting of all elements of this parallel iterable except the first one.

Definition Classes
GenTraversableLike
def take (n: Int): ParSeqView[T, Coll, CollSeq]

Selects first n elements.
Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
Tt number of elements to take from this parallel iterable.
returns
a parallel iterable consisting only of the first n elements of this parallel iterable, or else the whole parallel iterable, if it has less than n elements.

Definition Classes
ParSeqViewLike → ParIterableViewLike → ParIterableLike → GenTraversableLike
def takeWhile (p: (T) ⇒ Boolean): ParSeqView[T, Coll, CollSeq]

Takes the longest prefix of elements that satisfy the predicate.
Takes the longest prefix of elements that satisfy the predicate.
This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state. The index flag is initially set to maximum integer value.
returns
the longest prefix of this parallel iterable of elements that satisy the predicate pred

Definition Classes
ParIterableViewLike → ParIterableLike → GenTraversableLike
implicit def task2ops [R, Tp] (tsk: SSCTask[R, Tp]): TaskOps[R, Tp]

Attributes
protected implicit
Definition Classes
ParIterableLike
def thisParSeq : ParSeq[T]

Attributes
protected[this]
Definition Classes
ParIterableViewLike
def threshold (sz: Int, p: Int): Int

Some minimal number of elements after which this collection should be handled sequentially by different processors.
Some minimal number of elements after which this collection should be handled sequentially by different processors.
This method depends on the size of the collection and the parallelism level, which are both specified as arguments.
sz
the size based on which to compute the threshold
p
the parallelism level based on which to compute the threshold
returns
the maximum number of elements for performing operations sequentially

Definition Classes
ParIterableLike
def toArray : Array[T]

[use case] Converts this parallel iterable to an array.
[use case]
Converts this parallel iterable to an array.
Note: will not terminate for infinite-sized collections.
returns
an array containing all elements of this parallel iterable.

Attributes
abstract
Definition Classes
GenTraversableOnce
def toArray [U >: T] (implicit arg0: ClassManifest[U]): Array[U]

Converts this parallel iterable to an array.
Converts this parallel iterable to an array.
Note: will not terminate for infinite-sized collections.
returns
an array containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toBuffer [U >: T] : Buffer[U]

Converts this parallel iterable to a mutable buffer.
Converts this parallel iterable to a mutable buffer.
Note: will not terminate for infinite-sized collections.
returns
a buffer containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toIndexedSeq [U >: T] : IndexedSeq[U]

Converts this parallel iterable to an indexed sequence.
Converts this parallel iterable to an indexed sequence.
Note: will not terminate for infinite-sized collections.
returns
an indexed sequence containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toIterable : ParIterable[T]

Converts this parallel iterable to an iterable collection.
Converts this parallel iterable to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).
Note: will not terminate for infinite-sized collections.
returns
an Iterable containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toIterator : Iterator[T]

Returns an Iterator over the elements in this parallel iterable.
Returns an Iterator over the elements in this parallel iterable. Will return the same Iterator if this instance is already an Iterator.
Note: will not terminate for infinite-sized collections.
returns
an Iterator containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toList : List[T]

Converts this parallel iterable to a list.
Converts this parallel iterable to a list.
Note: will not terminate for infinite-sized collections.
returns
a list containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toMap [T, U] : Map[T, U]

[use case] Converts this parallel iterable to a map.
[use case]
Converts this parallel iterable to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
Note: will not terminate for infinite-sized collections.
returns
a map containing all elements of this parallel iterable.

Attributes
abstract
Definition Classes
GenTraversableOnce
def toMap [K, V] (implicit ev: <:<[T, (K, V)]): ParMap[K, V]

Converts this parallel iterable to a map.
Converts this parallel iterable to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
Note: will not terminate for infinite-sized collections.
returns
a map containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toParCollection [U >: T, That] (cbf: () ⇒ Combiner[U, That]): That

Attributes
protected
Definition Classes
ParIterableLike
def toParMap [K, V, That] (cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[T, (K, V)]): That

Attributes
protected
Definition Classes
ParIterableLike
def toSeq : ParSeq[T]

Converts this parallel iterable to a sequence.
Converts this parallel iterable to a sequence. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.
Note: will not terminate for infinite-sized collections.
returns
a sequence containing all elements of this parallel iterable.

Definition Classes
ParSeqLike → ParIterableLike → GenSeqLike → GenTraversableOnce
def toSet [U >: T] : ParSet[U]

Converts this parallel iterable to a set.
Converts this parallel iterable to a set.
Note: will not terminate for infinite-sized collections.
returns
a set containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toStream : Stream[T]

Converts this parallel iterable to a stream.
Converts this parallel iterable to a stream.
Note: will not terminate for infinite-sized collections.
returns
a stream containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def toString (): String

Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
returns
a String representation of the object.

Definition Classes
ParSeq → ParSeqLike → ParIterableLike → AnyRef → Any
def toTraversable : GenTraversable[T]

Converts this parallel iterable to an unspecified Traversable.
Converts this parallel iterable to an unspecified Traversable. Will return the same collection if this instance is already Traversable.
Note: will not terminate for infinite-sized collections.
returns
a Traversable containing all elements of this parallel iterable.

Definition Classes
ParIterableLike → GenTraversableOnce
def transpose [B] (implicit asTraversable: (T) ⇒ TraversableOnce[B]): ParSeq[ParSeq[B]]

Transposes this parallel iterable of traversable collections into a parallel iterable of parallel iterables.
Transposes this parallel iterable of traversable collections into a parallel iterable of parallel iterables.
B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this parallel iterable is a Traversable.
returns
a two-dimensional parallel iterable of parallel iterables which has as nth row the nth column of this parallel iterable.

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
"As of 2.9, transpose throws an exception if collections are not uniformly sized."
lazy val underlying : Coll

Definition Classes
Transformed → GenTraversableViewLike
def union [B >: T, That] (that: Seq[B])(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], B, That]): That

Definition Classes
GenSeqLike
Annotations
@bridge()
def union (that: GenSeq[T]): ParIterable[T]

[use case] Produces a new sequence which contains all elements of this parallel iterable and also all elements of a given sequence.
[use case]
Produces a new sequence which contains all elements of this parallel iterable and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.
Note: will not terminate for infinite-sized collections.
that
the sequence to add.
returns
a new collection of type That which contains all elements of this parallel iterable followed by all elements of that.

Attributes
abstract
Definition Classes
GenSeqLike
def union [B >: T, That] (that: GenSeq[B])(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], B, That]): That

Produces a new sequence which contains all elements of this parallel iterable and also all elements of a given sequence.
Produces a new sequence which contains all elements of this parallel iterable and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.
Note: will not terminate for infinite-sized collections.
Another way to express this is that xs union ys computes the order-presevring multi-set union of xs and ys. union is hence a counter-part of diff and intersect which also work on multi-sets.
Note: will not terminate for infinite-sized collections.
B
the element type of the returned parallel iterable.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the sequence to add.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this parallel iterable followed by all elements of that.

Definition Classes
GenSeqLike
def until : Int

Attributes
protected[this]
Definition Classes
Sliced
def unzip [A1, A2] (implicit asPair: (T) ⇒ (A1, A2)): (ParSeq[A1], ParSeq[A2])

Converts this parallel iterable of pairs into two collections of the first and second half of each pair.
Converts this parallel iterable of pairs into two collections of the first and second half of each pair.
asPair
an implicit conversion which asserts that the element type of this parallel iterable is a pair.
returns
a pair parallel iterables, containing the first, respectively second half of each element pair of this parallel iterable.

Definition Classes
GenericTraversableTemplate
def unzip3 [A1, A2, A3] (implicit asTriple: (T) ⇒ (A1, A2, A3)): (ParSeq[A1], ParSeq[A2], ParSeq[A3])

Converts this parallel iterable of triples into three collections of the first, second, and third element of each triple.
Converts this parallel iterable of triples into three collections of the first, second, and third element of each triple.
returns
a triple parallel iterables, containing the first, second, respectively third member of each element triple of this parallel iterable.

Definition Classes
GenericTraversableTemplate
def updated (index: Int, elem: T): ParIterable[T]

[use case] A copy of this parallel iterable with one single replaced element.
[use case]
A copy of this parallel iterable with one single replaced element.
index
the position of the replacement
elem
the replacing element
returns
a new parallel iterable which is a copy of this parallel iterable with the element at position index replaced by elem.

Attributes
abstract
Definition Classes
GenSeqLike
def updated [U >: T, That] (index: Int, elem: U)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], U, That]): That

A copy of this parallel iterable with one single replaced element.
A copy of this parallel iterable with one single replaced element.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
index
the position of the replacement
elem
the replacing element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new parallel iterable which is a copy of this parallel iterable with the element at position index replaced by elem.

Definition Classes
ParSeqViewLike → ParSeqLike → GenSeqLike
def view : ParSeqView[T, ParSeqView[T, Coll, CollSeq], SeqView[T, CollSeq]]

Definition Classes
ParSeqLike → ParIterableLike
def viewIdString : String

Attributes
protected[this] final
Definition Classes
Transformed → GenTraversableViewLike
def viewIdentifier : String

Attributes
protected[this] final
Definition Classes
Sliced → GenTraversableViewLike
def viewToString : String

Definition Classes
GenTraversableViewLike
def wait (): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long, arg1: Int): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wrap [R] (body: ⇒ R): NonDivisible[R]

Attributes
protected
Definition Classes
ParIterableLike
def zip [B] (that: GenIterable[B]): ParIterable[(T, B)]

[use case] Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs.
[use case]
Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
returns
a new collection of type That containing pairs consisting of corresponding elements of this parallel iterable and that. The length of the returned collection is the minimum of the lengths of this parallel iterable and that.

Attributes
abstract
Definition Classes
GenIterableLike
def zip [U >: T, S, That] (that: GenIterable[S])(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], (U, S), That]): That

Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs.
Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
Note: might return different results for different runs, unless the underlying collection type is ordered.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.
that
The iterable providing the second half of each result pair
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).
returns
a new collection of type That containing pairs consisting of corresponding elements of this parallel iterable and that. The length of the returned collection is the minimum of the lengths of this parallel iterable and that.

Definition Classes
ParSeqViewLike → ParSeqLike → ParIterableViewLike → ParIterableLike → GenIterableLike
def zipAll [B] (that: Iterable[B], thisElem: T, thatElem: B): ParIterable[(T, B)]

[use case] Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs.
[use case]
Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
that
the iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this parallel iterable is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this parallel iterable.
returns
a new collection of type That containing pairs consisting of corresponding elements of this parallel iterable and that. The length of the returned collection is the maximum of the lengths of this parallel iterable and that. If this parallel iterable is shorter than that, thisElem values are used to pad the result. If that is shorter than this parallel iterable, thatElem values are used to pad the result.

Attributes
abstract
Definition Classes
GenIterableLike
def zipAll [S, U >: T, That] (that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], (U, S), That]): That

Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs.
Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
Note: might return different results for different runs, unless the underlying collection type is ordered.
that
the iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this parallel iterable is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this parallel iterable.
returns
a new collection of type That containing pairs consisting of corresponding elements of this parallel iterable and that. The length of the returned collection is the maximum of the lengths of this parallel iterable and that. If this parallel iterable is shorter than that, thisElem values are used to pad the result. If that is shorter than this parallel iterable, thatElem values are used to pad the result.

Definition Classes
ParIterableViewLike → ParIterableLike → GenIterableLike
def zipWithIndex : ParIterable[(T, Int)]

[use case] Zips this parallel iterable with its indices.
[use case]
Zips this parallel iterable with its indices.
returns
A new collection of type That containing pairs consisting of all elements of this parallel iterable paired with their index. Indices start at 0.

Attributes
abstract
Definition Classes
GenIterableLike
def zipWithIndex [U >: T, That] (implicit bf: CanBuildFrom[ParSeqView[T, Coll, CollSeq], (U, Int), That]): That

Zips this parallel iterable with its indices.
Zips this parallel iterable with its indices.
Note: might return different results for different runs, unless the underlying collection type is ordered.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.
returns
A new collection of type That containing pairs consisting of all elements of this parallel iterable paired with their index. Indices start at 0.

Definition Classes
ParSeqViewLike → ParIterableViewLike → ParIterableLike → GenIterableLike

Sliced

trait Sliced extends Sliced with Sliced with Transformed[T]

Type Members

trait Accessor [R, Tp] extends Accessor[R, Tp]

class Aggregate [S] extends Accessor[S, Aggregate[S]]

trait Appended [U >: T] extends Appended[U] with Appended[U] with Transformed[U]

trait BuilderOps [Elem, To] extends AnyRef

class Collect [S, That] extends Transformer[Combiner[S, That], Collect[S, That]]

class Composite [FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR, _], Second <: ParIterableLike.this.StrictSplitterCheckTask[SR, _]] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]

class Copy [U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]

class CopyToArray [U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]

class Corresponds [S] extends Accessor[Boolean, Corresponds[S]]

class Count extends Accessor[Int, Count]

class CreateScanTree [U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]

class Drop [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]

class Elements extends ParIterator with BufferedIterator[T]

class Exists extends Accessor[Boolean, Exists]

class Filter [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]

class FilterNot [U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]

class Find [U >: T] extends Accessor[Option[U], Find[U]]

class FlatMap [S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]

class Fold [U >: T] extends Accessor[U, Fold[U]]

class Forall extends Accessor[Boolean, Forall]

class Force [U >: T, That] extends Transformer[Combiner[U, That], Force[U, That]]

trait Forced [S] extends Forced[S] with Forced[S] with Transformed[S]

class Foreach [S] extends Accessor[Unit, Foreach[S]]

class FromScanTree [U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]

class GroupBy [K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]

class IndexWhere extends Accessor[Int, IndexWhere]

class LastIndexWhere extends Accessor[Int, LastIndexWhere]

class Map [S, That] extends Transformer[Combiner[S, That], Map[S, That]]

trait Mapped [S] extends Mapped[S] with Mapped[S] with Transformed[S]

class Max [U >: T] extends Accessor[Option[U], Max[U]]

class Min [U >: T] extends Accessor[Option[U], Min[U]]

trait NonDivisible [R] extends NonDivisibleTask[R, NonDivisible[R]]

trait NonDivisibleTask [R, Tp] extends StrictSplitterCheckTask[R, Tp]

class ParComposite [FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR, _], Second <: ParIterableLike.this.StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

trait ParIterator extends SeqSplitter[T] with ParIterator

class Partition [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]

trait Patched [U >: T] extends Patched[U] with Transformed[U]

trait Prepended [U >: T] extends Prepended[U] with Transformed[U]

class Product [U >: T] extends Accessor[U, Product[U]]

class Reduce [U >: T] extends Accessor[Option[U], Reduce[U]]

class ResultMapping [R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

class Reverse [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Reverse[U, This]]

class ReverseMap [S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]

trait Reversed extends Reversed with Transformed[T]

type SSCTask [R, Tp] = StrictSplitterCheckTask[R, Tp]

class SameElements [U >: T] extends Accessor[Boolean, SameElements[U]]

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 Product with Serializable

case class ScanNode [U >: T] (left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with Product with Serializable

trait ScanTree [U >: T] extends AnyRef

class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

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

trait SignalContextPassingIterator [+IterRepr <: ParIterator] extends ParIterator with SignalContextPassingIterator[IterRepr]

trait SignallingOps [PI <: DelegatedSignalling] extends AnyRef

class Slice [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]

trait Sliced extends Sliced with Sliced with Transformed[T]

class Span [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]

class SplitAt [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]

trait StrictSplitterCheckTask [R, Tp] extends Task[R, Tp]

class Sum [U >: T] extends Accessor[U, Sum[U]]

type SuperParIterator = IterableSplitter[T]

class Take [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

class TakeWhile [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]

trait TaskOps [R, Tp] extends AnyRef

class ToParCollection [U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]

class ToParMap [K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

trait Transformed [+S] extends ParSeqView[S, Coll, CollSeq] with Transformed[S] with Transformed[S]

trait Transformer [R, Tp] extends Accessor[R, Tp] with Transformer[R, Tp]

class Updated [U >: T, That] extends Transformer[Combiner[U, That], Updated[U, That]]

class Zip [U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]

class ZipAll [U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]

trait Zipped [S] extends Zipped[S] with Zipped[S] with Transformed[(T, S)]

trait ZippedAll [U >: T, S] extends ZippedAll[U, S] with ZippedAll[U, S] with Transformed[(U, S)]

Abstract Value Members

val endpoints : SliceInterval

Concrete Value Members

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean