scala.collection

# GenTraversableLike

#### trait GenTraversableLike [+A, +Repr] extends GenTraversableOnce[A] with Parallelizable[A, ParIterable[A]]

A template trait for all traversable collections upon which operations may be implemented in parallel.

Source
  GenTraversableLike.scala

Linear Supertypes
Parallelizable[A, ParIterable[A]], GenTraversableOnce[A], AnyRef, Any
Known Subclasses
::, AbsScope, Appended, Appended, Appended, Appended, Appended, Appended, Appended, Appended, Appended, ArrayBuffer, ArrayLike, ArrayOps, ArraySeq, ArrayStack, Atom, Attribute, BitSet, BitSet, BitSet, BitSet1, BitSet2, BitSetLike, BitSetN, Buffer, BufferLike, BufferProxy, BufferWrapper, ByOne, Comment, ConcurrentMap, Cons, Content, DefaultKeySet, DefaultKeySortedSet, DefaultKeySortedSet, DefaultMap, DefaultMap, DefaultMapModel, DefaultValuesIterable, Document, DoubleLinkedList, DoubleLinkedListLike, DroppedWhile, DroppedWhile, DroppedWhile, DroppedWhile, DroppedWhile, DroppedWhile, DroppedWhile, DroppedWhile, Elem, Empty, EmptyMap, EmptyMap, EmptySet, EmptySet, EmptyView, EmptyView, EmptyView, EmptyView, EmptyView, EmptyView, EmptyView, EntityRef, Exclusive, Filtered, Filtered, Filtered, Filtered, Filtered, Filtered, Filtered, Filtered, FlatMapped, FlatMapped, FlatMapped, FlatMapped, FlatMapped, FlatMapped, FlatMapped, Forced, Forced, Forced, Forced, Forced, Forced, Forced, Forced, Forced, GenIterable, GenIterableLike, GenIterableView, GenIterableViewLike, GenMap, GenMapLike, GenSeq, GenSeqLike, GenSeqView, GenSeqViewLike, GenSet, GenSetLike, GenTraversable, GenTraversableView, GenTraversableViewLike, Group, HashMap, HashMap, HashMap1, HashSet, HashSet, HashSet1, HashTrieMap, HashTrieSet, History, ImmutableDefaultKeySet, ImmutableMapAdaptor, ImmutableSetAdaptor, Impl, Inclusive, Inclusive, IndexedSeq, IndexedSeq, IndexedSeq, IndexedSeqLike, IndexedSeqLike, IndexedSeqOptimized, IndexedSeqOptimized, IndexedSeqView, Indices, IntMap, Iterable, Iterable, Iterable, IterableForwarder, IterableLike, IterableProxy, IterableProxyLike, IterableView, IterableViewLike, JCollectionWrapper, JConcurrentMapWrapper, JDictionaryWrapper, JIterableWrapper, JListWrapper, JMapWrapper, JMapWrapperLike, JPropertiesWrapper, JSetWrapper, LinearSeq, LinearSeq, LinearSeq, LinearSeqLike, LinearSeqOptimized, LinkedHashMap, LinkedHashSet, LinkedList, LinkedListLike, List, ListBuffer, ListMap, ListMap, ListSet, LongMap, Map, Map, Map, Map1, Map2, Map3, Map4, MapLike, MapLike, MapLike, MapProxy, MapProxy, MapProxy, MapProxyLike, Mapped, Mapped, Mapped, Mapped, Mapped, Mapped, Mapped, Mapped, Mapped, MetaData, MultiMap, MutableList, Nil, Node, Node, Node, NodeBuffer, NodeSeq, Null, NumericRange, ObservableBuffer, ObservableMap, ObservableSet, OpenHashMap, PCData, PagedSeq, ParArray, ParHashMap, ParHashMap, ParHashSet, ParHashSet, ParIterable, ParIterable, ParIterable, ParIterableLike, ParIterableView, ParIterableViewLike, ParMap, ParMap, ParMap, ParMapLike, ParMapLike, ParRange, ParSeq, ParSeq, ParSeq, ParSeqLike, ParSeqView, ParSeqViewLike, ParSet, ParSet, ParSet, ParSetLike, ParSetLike, ParVector, Patched, Patched, Patched, Patched, PicklerEnv, PrefixedAttribute, Prepended, Prepended, Prepended, Prepended, PriorityQueue, PriorityQueueProxy, ProcInstr, Queue, Queue, QueueProxy, Range, RefBuffer, ResizableArray, Reversed, Reversed, Reversed, Reversed, Reversed, RevertibleHistory, Scope, Script, SelectionSet, Seq, Seq, Seq, SeqForwarder, SeqLike, SeqLike, SeqProxy, SeqProxyLike, SeqView, SeqViewLike, Set, Set, Set, Set1, Set2, Set3, Set4, SetLike, SetLike, SetProxy, SetProxy, SetProxy, SetProxyLike, Sliced, Sliced, Sliced, Sliced, Sliced, Sliced, Sliced, Sliced, Sliced, Sliced, SortedMap, SortedMap, SortedMapLike, SortedSet, SortedSet, SortedSetLike, SpecialNode, Stack, Stack, StackProxy, Stream, StreamView, StreamViewLike, StringBuilder, StringLike, StringOps, SynchronizedBuffer, SynchronizedMap, SynchronizedPriorityQueue, SynchronizedQueue, SynchronizedSet, SynchronizedStack, SystemProperties, TakenWhile, TakenWhile, TakenWhile, TakenWhile, TakenWhile, TakenWhile, TakenWhile, TakenWhile, Text, Transformed, Transformed, Transformed, Transformed, Transformed, Transformed, Transformed, Transformed, Transformed, Transformed, Traversable, Traversable, Traversable, TraversableForwarder, TraversableLike, TraversableProxy, TraversableProxyLike, TraversableView, TraversableViewLike, TreeMap, TreeSet, UnPicklerEnv, Unparsed, UnprefixedAttribute, UnrolledBuffer, ValueSet, Vector, WeakHashMap, WithDefault, WithDefault, WithDefault, WrappedArray, WrappedString, Zipped, Zipped, Zipped, Zipped, Zipped, Zipped, Zipped, ZippedAll, ZippedAll, ZippedAll, ZippedAll, ZippedAll, ZippedAll, ZippedAll, columns, indices, items, ofBoolean, ofBoolean, ofByte, ofByte, ofChar, ofChar, ofDouble, ofDouble, ofFloat, ofFloat, ofInt, ofInt, ofLong, ofLong, ofRef, ofRef, ofShort, ofShort, ofUnit, ofUnit, pages, rows
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. GenTraversableLike
2. Parallelizable
3. GenTraversableOnce
4. AnyRef
5. Any

Visibility

1. Public
2. All

### Abstract Value Members

1. #### def ++ [B >: A, That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

   Concatenates this general collection with the elements of a traversable collection.

   Concatenates this general collection with the elements of a traversable collection.

   B

     the element type of the returned 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.

   that

     the traversable to append.

   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 general collection followed by all elements of `that`.

   Attributes
     abstract

2. #### def /: [B] (z: B)(op: (B, A) ⇒ B): B

   Applies a binary operator to a start value and all elements of this general collection, going left to right.

   Applies a binary operator to a start value and all elements of this general collection, 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.

   B

     the result type of the binary operator.

   z

     the start value.

   op

     the binary operator.

   returns

     the result of inserting `op` between consecutive elements of this general collection, 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 general collection.

   Attributes
     abstract
   Definition Classes
     GenTraversableOnce

3. #### def :\ [B] (z: B)(op: (A, B) ⇒ B): B

   Applies a binary operator to all elements of this general collection and a start value, going right to left.

   Applies a binary operator to all elements of this general collection 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.

   B

     the result type of the binary operator.

   z

     the start value

   op

     the binary operator

   returns

     the result of inserting `op` between consecutive elements of this general collection, 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 general collection.

   Attributes
     abstract
   Definition Classes
     GenTraversableOnce

4. #### def aggregate [B] (z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

   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).

   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

   Attributes
     abstract
   Definition Classes
     GenTraversableOnce

5. #### def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Repr, B, That]): That

   Builds a new collection by applying a partial function to all elements of this general collection on which the function is defined.

   Builds a new collection by applying a partial function to all elements of this general collection on which the function is defined.

   B

     the element type of the returned 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.

   pf

     the partial function which filters and maps the general collection.

   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.

   Attributes
     abstract

6. #### def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int): Unit

   Attributes
     abstract
   Definition Classes
     GenTraversableOnce

7. #### def copyToArray [B >: A] (xs: Array[B], start: Int): Unit

   Copies values of this general collection to an array.

   Copies values of this general collection to an array. Fills the given array `xs` with values of this general collection, beginning at index `start`. Copying will stop once either the end of the current general collection is reached, or the end of the array is reached.

   Note: will not terminate for infinite-sized collections.

   B

     the type of the elements of the array.

   xs

     the array to fill.

   start

     the starting index.

   Attributes
     abstract
   Definition Classes
     GenTraversableOnce

8. #### def copyToArray [B >: A] (xs: Array[B]): Unit

   Copies values of this general collection to an array.

   Copies values of this general collection to an array. Fills the given array `xs` with values of this general collection. Copying will stop once either the end of the current general collection is reached, or the end of the array is reached.

   Note: will not terminate for infinite-sized collections.

   B

     the type of the elements of the array.

   xs

     the array to fill.

   Attributes
     abstract
   Definition Classes
     GenTraversableOnce

9. #### def count (p: (A) ⇒ Boolean): Int

   Counts the number of elements in the general collection which satisfy a predicate.

   Counts the number of elements in the general collection which satisfy a predicate.

   p

     the predicate used to test elements.

   returns

     the number of elements satisfying the predicate `p`.

   Attributes
     abstract
   Definition Classes
     GenTraversableOnce

10. #### def drop (n: Int): Repr

    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 general collection.

    returns

      a general collection consisting of all elements of this general collection except the first `n` ones, or else the empty general collection, if this general collection has less than `n` elements.

    Attributes
      abstract

11. #### def dropWhile (pred: (A) ⇒ Boolean): Repr

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      the longest suffix of this general collection whose first element does not satisfy the predicate `p`.

    Attributes
      abstract

12. #### def exists (pred: (A) ⇒ Boolean): Boolean

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

13. #### def filter (pred: (A) ⇒ Boolean): Repr

    Selects all elements of this general collection which satisfy a predicate.

    Selects all elements of this general collection which satisfy a predicate.

    returns

      a new general collection consisting of all elements of this general collection that satisfy the given predicate `p`. Their order may not be preserved.

    Attributes
      abstract

14. #### def filterNot (pred: (A) ⇒ Boolean): Repr

    Selects all elements of this general collection which do not satisfy a predicate.

    Selects all elements of this general collection which do not satisfy a predicate.

    returns

      a new general collection consisting of all elements of this general collection that do not satisfy the given predicate `p`. Their order may not be preserved.

    Attributes
      abstract

15. #### def find (pred: (A) ⇒ Boolean): Option[A]

    Finds the first element of the general collection satisfying a predicate, if any.

    Finds the first element of the general collection satisfying a predicate, if any.

    Note: may not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      an option value containing the first element in the general collection that satisfies `p`, or `None` if none exists.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

16. #### def flatMap [B, That] (f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    Builds a new collection by applying a function to all elements of this general collection and concatenating the results.

    Builds a new collection by applying a function to all elements of this general collection and concatenating the results.

    B

      the element type of the returned 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.

    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 general collection and concatenating the results.

    Attributes
      abstract

17. #### def fold [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    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`.

    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`

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

18. #### def foldLeft [B] (z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this general collection, going left to right.

    Applies a binary operator to a start value and all elements of this general collection, 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.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this general collection, 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

19. #### def foldRight [B] (z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this general collection and a start value, going right to left.

    Applies a binary operator to all elements of this general collection 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.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this general collection, 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

20. #### def forall (pred: (A) ⇒ Boolean): Boolean

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

21. #### def foreach [U] (f: (A) ⇒ U): Unit

    Applies a function `f` to all elements of this general collection.

    Applies a function `f` to all elements of this general collection.

    U

      the type parameter describing the result of function `f`. This result will always be ignored. Typically `U` is `Unit`, but this is not necessary.

    f

      the function that is applied for its side-effect to every element. The result of function `f` is discarded.

    Attributes
      abstract
    Definition Classes
      GenTraversableLike → GenTraversableOnce

22. #### def groupBy [K] (f: (A) ⇒ K): GenMap[K, Repr]

    Partitions this general collection into a map of general collections according to some discriminator function.

    Partitions this general collection into a map of general collections 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 general collection.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to general collections 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 general collection of those elements `x` for which `f(x)` equals `k`.

    Attributes
      abstract

23. #### def hasDefiniteSize : Boolean

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

24. #### def head : A

    Attributes
      abstract

25. #### def isEmpty : Boolean

    Tests whether the general collection is empty.

    Tests whether the general collection is empty.

    returns

      `true` if the general collection contains no elements, `false` otherwise.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

26. #### def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    Builds a new collection by applying a function to all elements of this general collection.

    Builds a new collection by applying a function to all elements of this general collection.

    B

      the element type of the returned 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.

    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 general collection and collecting the results.

    Attributes
      abstract

27. #### def max [A1 >: A] (implicit ord: Ordering[A1]): A

    Finds the largest element.

    Finds the largest element.

    returns

      the largest element of this general collection with respect to the ordering `cmp`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

28. #### def maxBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

29. #### def min [A1 >: A] (implicit ord: Ordering[A1]): A

    Finds the smallest element.

    Finds the smallest element.

    returns

      the smallest element of this general collection with respect to the ordering `cmp`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

30. #### def minBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

31. #### def mkString : String

    Displays all elements of this general collection in a string.

    Displays all elements of this general collection in a string.

    returns

      a string representation of this general collection. In the resulting string the string representations (w.r.t. the method `toString`) of all elements of this general collection follow each other without any separator string.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

32. #### def mkString (sep: String): String

    Displays all elements of this general collection in a string using a separator string.

    Displays all elements of this general collection in a string using a separator string.

    sep

      the separator string.

    returns

      a string representation of this general collection. In the resulting string the string representations (w.r.t. the method `toString`) of all elements of this general collection are separated by the string `sep`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce
    Example:

    1. `List(1, 2, 3).mkString("|") = "1|2|3"`

33. #### def mkString (start: String, sep: String, end: String): String

    Displays all elements of this general collection in a string using start, end, and separator strings.

    Displays all elements of this general collection 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 general collection. 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 general collection are separated by the string `sep`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce
    Example:

    1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

34. #### def nonEmpty : Boolean

    Tests whether the general collection is not empty.

    Tests whether the general collection is not empty.

    returns

      `true` if the general collection contains at least one element, `false` otherwise.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

35. #### def parCombiner : Combiner[A, ParIterable[A]]

    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] abstract
    Definition Classes
      Parallelizable

36. #### def partition (pred: (A) ⇒ Boolean): (Repr, Repr)

    Partitions this general collection in two general collections according to a predicate.

    Partitions this general collection in two general collections according to a predicate.

    returns

      a pair of general collections: the first general collection consists of all elements that satisfy the predicate `p` and the second general collection consists of all elements that don't. The relative order of the elements in the resulting general collections may not be preserved.

    Attributes
      abstract

37. #### def product [A1 >: A] (implicit num: Numeric[A1]): A1

    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 general collection with respect to the `*` operator in `num`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

38. #### def reduce [A1 >: A] (op: (A1, A1) ⇒ A1): A1

    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`.

    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.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

39. #### def reduceLeftOption [B >: A] (op: (B, A) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this general collection, going left to right.

    Optionally applies a binary operator to all elements of this general collection, 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.

    B

      the result type of the binary operator.

    op

      the binary operator.

    returns

      an option value containing the result of `reduceLeft(op)` is this general collection is nonempty, `None` otherwise.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

40. #### def reduceOption [A1 >: A] (op: (A1, A1) ⇒ A1): Option[A1]

    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`.

    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.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

41. #### def reduceRight [B >: A] (op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this general collection, going right to left.

    Applies a binary operator to all elements of this general collection, 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.

    B

      the result type of the binary operator.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this general collection, 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

42. #### def reduceRightOption [B >: A] (op: (A, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this general collection, going right to left.

    Optionally applies a binary operator to all elements of this general collection, 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.

    B

      the result type of the binary operator.

    op

      the binary operator.

    returns

      an option value containing the result of `reduceRight(op)` is this general collection is nonempty, `None` otherwise.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

43. #### def repr : Repr

    Attributes
      abstract

44. #### def scan [B >: A, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Repr, B, 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.

    B

      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

    cbf

      combiner factory which provides a combiner

    returns

      a new general collection containing the prefix scan of the elements in this general collection

    Attributes
      abstract

45. #### def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, 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.

    B

      the type of the elements in the resulting collection

    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

    Attributes
      abstract

46. #### def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, 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)

    B

      the type of the elements in the resulting collection

    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

    Attributes
      abstract
    Annotations
      @migration
    Migration

      "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

47. #### def seq : TraversableOnce[A]

    Attributes
      abstract
    Definition Classes
      Parallelizable

48. #### def size : Int

    The size of this general collection.

    The size of this general collection.

    Note: will not terminate for infinite-sized collections.

    returns

      the number of elements in this general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableLike → GenTraversableOnce

49. #### def slice (unc_from: Int, unc_until: Int): Repr

    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.

    returns

      a general collection containing the elements greater than or equal to index `from` extending up to (but not including) index `until` of this general collection.

    Attributes
      abstract

50. #### def span (pred: (A) ⇒ Boolean): (Repr, Repr)

    Splits this general collection into a prefix/suffix pair according to a predicate.

    Splits this general collection into a prefix/suffix pair according to a predicate.

    Note: `c span p` is equivalent to (but possibly more efficient than) `(c takeWhile p, c dropWhile p)`, provided the evaluation of the predicate `p` does not cause any side-effects.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      a pair consisting of the longest prefix of this general collection whose elements all satisfy `p`, and the rest of this general collection.

    Attributes
      abstract

51. #### def splitAt (n: Int): (Repr, Repr)

    Splits this general collection into two at a given position.

    Splits this general collection 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 general collections consisting of the first `n` elements of this general collection, and the other elements.

    Attributes
      abstract

52. #### 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 general collection. By default the string prefix is the simple name of the collection class general collection.

    Attributes
      abstract

53. #### def sum [A1 >: A] (implicit num: Numeric[A1]): A1

    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 general collection with respect to the `+` operator in `num`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

54. #### def take (n: Int): Repr

    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 general collection.

    returns

      a general collection consisting only of the first `n` elements of this general collection, or else the whole general collection, if it has less than `n` elements.

    Attributes
      abstract

55. #### def takeWhile (pred: (A) ⇒ Boolean): Repr

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      the longest prefix of this general collection whose elements all satisfy the predicate `p`.

    Attributes
      abstract

56. #### def toArray [A1 >: A] (implicit arg0: ClassManifest[A1]): Array[A1]

    Converts this general collection to an array.

    Converts this general collection to an array.

    Note: will not terminate for infinite-sized collections.

    returns

      an array containing all elements of this general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

57. #### def toBuffer [A1 >: A] : Buffer[A1]

    Converts this general collection to a mutable buffer.

    Converts this general collection to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

      a buffer containing all elements of this general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

58. #### def toIndexedSeq [A1 >: A] : IndexedSeq[A1]

    Converts this general collection to an indexed sequence.

    Converts this general collection to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

      an indexed sequence containing all elements of this general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

59. #### def toIterable : GenIterable[A]

    Converts this general collection to an iterable collection.

    Converts this general collection 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

60. #### def toIterator : Iterator[A]

    Returns an Iterator over the elements in this general collection.

    Returns an Iterator over the elements in this general collection. 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

61. #### def toList : List[A]

    Converts this general collection to a list.

    Converts this general collection to a list.

    Note: will not terminate for infinite-sized collections.

    returns

      a list containing all elements of this general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

62. #### def toMap [K, V] (implicit ev: <:<[A, (K, V)]): GenMap[K, V]

    Converts this general collection to a map.

    Converts this general collection 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

63. #### def toSeq : GenSeq[A]

    Converts this general collection to a sequence.

    Converts this general collection 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

64. #### def toSet [A1 >: A] : GenSet[A1]

    Converts this general collection to a set.

    Converts this general collection to a set.

    Note: will not terminate for infinite-sized collections.

    returns

      a set containing all elements of this general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

65. #### def toStream : Stream[A]

    Converts this general collection to a stream.

    Converts this general collection to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

      a stream containing all elements of this general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

66. #### def toTraversable : GenTraversable[A]

    Converts this general collection to an unspecified Traversable.

    Converts this general collection 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

### Concrete Value Members

1. #### def != (arg0: AnyRef): Boolean

   Attributes
     final
   Definition Classes
     AnyRef

2. #### 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

3. #### 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

4. #### def ++ [B] (that: GenTraversableOnce[B]): GenTraversable[B]

   [use case] Concatenates this general collection with the elements of a traversable collection.

   [use case]

   Concatenates this general collection 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 general collection followed by all elements of `that`.

   Attributes
     abstract

5. #### def /:\ [A1 >: A] (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

6. #### def == (arg0: AnyRef): Boolean

   Attributes
     final
   Definition Classes
     AnyRef

7. #### 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

8. #### 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

9. #### 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()

10. #### def collect [B] (pf: PartialFunction[A, B]): GenTraversable[B]

    [use case] Builds a new collection by applying a partial function to all elements of this general collection on which the function is defined.

    [use case]

    Builds a new collection by applying a partial function to all elements of this general collection on which the function is defined.

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the general collection.

    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

11. #### def copyToArray (xs: Array[A], start: Int): Unit

    [use case] Copies values of this general collection to an array.

    [use case]

    Copies values of this general collection to an array. Fills the given array `xs` with values of this general collection, beginning at index `start`. Copying will stop once either the end of the current general collection is reached, or the end of the array is reached.

    xs

      the array to fill.

    start

      the starting index.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

12. #### def copyToArray (xs: Array[A]): Unit

    [use case] Copies values of this general collection to an array.

    [use case]

    Copies values of this general collection to an array. Fills the given array `xs` with values of this general collection. Copying will stop once either the end of the current general collection is reached, or the end of the array is reached.

    xs

      the array to fill.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

13. #### 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

14. #### def equals (arg0: Any): Boolean

    The equality method for reference types.

    The equality method for reference types. See equals in Any.

    returns

      `true` if the receiver object is equivalent to the argument; `false` otherwise.

    Definition Classes
      AnyRef → Any

15. #### 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()

16. #### def flatMap [B] (f: (A) ⇒ GenTraversableOnce[B]): GenTraversable[B]

    [use case] Builds a new collection by applying a function to all elements of this general collection and concatenating the results.

    [use case]

    Builds a new collection by applying a function to all elements of this general collection 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 general collection and concatenating the results.

    Attributes
      abstract

17. #### def foreach (f: (A) ⇒ Unit): Unit

    [use case] Applies a function `f` to all elements of this general collection.

    [use case]

    Applies a function `f` to all elements of this general collection.

    f

      the function that is applied for its side-effect to every element. The result of function `f` is discarded.

    Attributes
      abstract

18. #### def getClass (): java.lang.Class[_]

    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 → Any

19. #### def hashCode (): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in Any.

    returns

      the hash code value for this object.

    Definition Classes
      AnyRef → Any

20. #### 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

21. #### def isTraversableAgain : Boolean

    Tests whether this general collection can be repeatedly traversed.

    Tests whether this general collection can be repeatedly traversed.

    returns

      `true`

    Attributes
      final
    Definition Classes
      GenTraversableLike → GenTraversableOnce

22. #### def map [B] (f: (A) ⇒ B): GenTraversable[B]

    [use case] Builds a new collection by applying a function to all elements of this general collection.

    [use case]

    Builds a new collection by applying a function to all elements of this general collection.

    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 general collection and collecting the results.

    Attributes
      abstract

23. #### def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

      the largest element of this general collection with respect to the ordering `cmp`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

24. #### def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

      the smallest element of this general collection with respect to the ordering `cmp`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

25. #### 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

26. #### 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

27. #### 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

28. #### def par : ParIterable[A]

    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
      Parallelizable

29. #### def product : A

    [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 general collection with respect to the `*` operator in `num`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

30. #### def sum : A

    [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 general collection with respect to the `+` operator in `num`.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

31. #### def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
      final
    Definition Classes
      AnyRef

32. #### def tail : Repr

    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 general collection consisting of all elements of this general collection except the first one.

33. #### def toArray : Array[A]

    [use case] Converts this general collection to an array.

    [use case]

    Converts this general collection to an array.

    Note: will not terminate for infinite-sized collections.

    returns

      an array containing all elements of this general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

34. #### def toMap [T, U] : Map[T, U]

    [use case] Converts this general collection to a map.

    [use case]

    Converts this general collection 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 general collection.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

35. #### 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
      AnyRef → Any

36. #### def wait (): Unit

    Attributes
      final
    Definition Classes
      AnyRef
    Annotations
      @throws()

37. #### def wait (arg0: Long, arg1: Int): Unit

    Attributes
      final
    Definition Classes
      AnyRef
    Annotations
      @throws()

38. #### def wait (arg0: Long): Unit

    Attributes
      final
    Definition Classes
      AnyRef
    Annotations
      @throws()

### Inherited from Parallelizable[A, ParIterable[A]]

### Inherited from GenTraversableOnce[A]

### Inherited from AnyRef

### Inherited from Any