scala.collection.mutable

# WrappedArray

#### abstract class WrappedArray[T] extends AbstractSeq[T] with IndexedSeq[T] with ArrayLike[T, WrappedArray[T]] with CustomParallelizable[T, ParArray[T]]

A class representing `Array[T]`.

T

  type of the elements in this wrapped array.

Source
  WrappedArray.scala
Version

  1.0

Since

  2.8

Linear Supertypes
CustomParallelizable[T, ParArray[T]], ArrayLike[T, WrappedArray[T]], IndexedSeqOptimized[T, WrappedArray[T]], IndexedSeqOptimized[T, WrappedArray[T]], IndexedSeq[T], IndexedSeqLike[T, WrappedArray[T]], IndexedSeq[T], IndexedSeqLike[T, WrappedArray[T]], AbstractSeq[T], Seq[T], SeqLike[T, Seq[T]], Cloneable[Seq[T]], Iterable[T], Traversable[T], Mutable, AbstractSeq[T], Seq[T], SeqLike[T, WrappedArray[T]], GenSeq[T], GenSeqLike[T, WrappedArray[T]], PartialFunction[Int, T], (Int) ⇒ T, AbstractIterable[T], Iterable[T], IterableLike[T, WrappedArray[T]], Equals, GenIterable[T], GenIterableLike[T, WrappedArray[T]], AbstractTraversable[T], Traversable[T], GenTraversable[T], GenericTraversableTemplate[T, IndexedSeq], TraversableLike[T, WrappedArray[T]], GenTraversableLike[T, WrappedArray[T]], Parallelizable[T, ParArray[T]], TraversableOnce[T], GenTraversableOnce[T], FilterMonadic[T, WrappedArray[T]], HasNewBuilder[T, WrappedArray[T]], AnyRef, Any
Known Subclasses
ofBoolean, ofByte, ofChar, ofDouble, ofFloat, ofInt, ofLong, ofRef, ofShort, ofUnit
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. WrappedArray
2. CustomParallelizable
3. ArrayLike
4. IndexedSeqOptimized
5. IndexedSeqOptimized
6. IndexedSeq
7. IndexedSeqLike
8. IndexedSeq
9. IndexedSeqLike
10. AbstractSeq
11. Seq
12. SeqLike
13. Cloneable
14. Iterable
15. Traversable
16. Mutable
17. AbstractSeq
18. Seq
19. SeqLike
20. GenSeq
21. GenSeqLike
22. PartialFunction
23. Function1
24. AbstractIterable
25. Iterable
26. IterableLike
27. Equals
28. GenIterable
29. GenIterableLike
30. AbstractTraversable
31. Traversable
32. GenTraversable
33. GenericTraversableTemplate
34. TraversableLike
35. GenTraversableLike
36. Parallelizable
37. TraversableOnce
38. GenTraversableOnce
39. FilterMonadic
40. HasNewBuilder
41. AnyRef
42. Any

Visibility

1. Public
2. All

### Instance Constructors

1. #### new WrappedArray()

### Type Members

1. #### class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable

   The class of the iterator returned by the `iterator` method.

2. #### type Self = WrappedArray[T]

   The type implementing this traversable

   The type implementing this traversable

   Attributes
     protected
   Definition Classes
     TraversableLike

3. #### class WithFilter extends FilterMonadic[A, Repr]

   A class supporting filtered operations.

### Abstract Value Members

1. #### abstract def apply(index: Int): T

   The element at given index

   The element at given index

   returns

     the element of this wrapped array at index `idx`, where `0` indicates the first element.

   Definition Classes
     WrappedArray → SeqLike → GenSeqLike → Function1

2. #### abstract def array: Array[T]

   The underlying array

3. #### abstract def elemManifest: ClassManifest[T]

   The manifest of the element type

4. #### abstract def length: Int

   The length of the array

   The length of the array

   returns

     the number of elements in this wrapped array.

   Definition Classes
     WrappedArray → SeqLike → GenSeqLike

5. #### abstract def update(index: Int, elem: T): Unit

   Update element at given index

   Update element at given index

   elem

     the new value.

   Definition Classes
     WrappedArray → IndexedSeqLike → SeqLike

### Concrete Value Members

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

   Definition Classes
     AnyRef

2. #### final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     Any

3. #### final def ##(): Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. 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. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any

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

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

     a new wrapped array which contains all elements of this wrapped array followed by all elements of `that`.

   Definition Classes
     TraversableLike → GenTraversableLike

5. #### def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[WrappedArray[T], B, That]): That

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   It differs from `++` in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

   Example:

           scala> val x = List(1)
           x: List[Int] = List(1)

           scala> val y = LinkedList(2)
           y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

           scala> val z = x ++: y
           z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

   This overload exists because: for the implementation of `++:` we should reuse that of `++` because many collections override it with more efficient versions.

   Since `TraversableOnce` has no `++` method, we have to implement that directly, but `Traversable` and down can use the overload.

   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 the new element type `B`.

   returns

     a new collection of type `That` which contains all elements of this wrapped array followed by all elements of `that`.

   Definition Classes
     TraversableLike

6. #### def ++:[B](that: TraversableOnce[B]): WrappedArray[B]

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

     a new wrapped array which contains all elements of this wrapped array followed by all elements of `that`.

   Definition Classes
     TraversableLike

7. #### def +:(elem: T): WrappedArray[A]

   [use case]

   [use case]
   elem

     the prepended element

   returns

     a new wrapped array consisting of `elem` followed by all elements of this wrapped array.

   Definition Classes
     SeqLike → GenSeqLike

8. #### def /:[B](z: B)(op: (B, T) ⇒ B): B

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

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

   Note: `/:` is alternate syntax for `foldLeft`; `z /: xs` is the same as `xs foldLeft z`.

   Examples:

   Note that the folding function used to compute b is equivalent to that used to compute c.

            scala> val a = LinkedList(1,2,3,4)
            a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

            scala> val b = (5 /: a)(_+_)
            b: Int = 15

            scala> val c = (5 /: a)((x,y) => x + y)
            c: Int = 15

   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 wrapped array, going left to right with the start value `z` on the left:

                     op(...op(op(z, x1), x2), ..., xn)

     where `x1, ..., xn` are the elements of this wrapped array.

   Definition Classes
     TraversableOnce → GenTraversableOnce

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

   Example:

            scala> val a = LinkedList(1,2,3,4)
            a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

            scala> val b = (a /:\ 5)(_+_)
            b: Int = 15

   Definition Classes
     GenTraversableOnce

10. #### def :+(elem: T): WrappedArray[A]

    [use case]

    [use case]
    elem

      the appended element

    returns

      a new wrapped array consisting of all elements of this wrapped array followed by `elem`. @example

                scala> import scala.collection.mutable.LinkedList
                import scala.collection.mutable.LinkedList

                scala> val a = LinkedList(1)
                a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)

                scala> val b = a :+ 2
                b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

                scala> println(a)
                LinkedList(1)

    Definition Classes
      SeqLike → GenSeqLike

11. #### def :\[B](z: B)(op: (T, B) ⇒ B): B

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

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

    Note: `:\` is alternate syntax for `foldRight`; `xs :\ z` is the same as `xs foldRight z`.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = (a :\ 5)(_+_)
             b: Int = 15

             scala> val c = (a :\ 5)((x,y) => x + y)
             c: Int = 15

    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 wrapped array, going right to left with the start value `z` on the right:

                      op(x1, op(x2, ... op(xn, z)...))

      where `x1, ..., xn` are the elements of this wrapped array.

    Definition Classes
      TraversableOnce → GenTraversableOnce

12. #### final def ==(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

13. #### final def ==(arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality. The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    returns

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

    Definition Classes
      Any

14. #### def addString(b: StringBuilder): StringBuilder

    Appends all elements of this wrapped array to a string builder.

    Appends all elements of this wrapped array to a string builder. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this wrapped array without any separator string.

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> val h = a.addString(b)
             b: StringBuilder = 1234

    b

      the string builder to which elements are appended.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

15. #### def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this wrapped array to a string builder using a separator string.

    Appends all elements of this wrapped array to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this wrapped array, separated by the string `sep`.

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> a.addString(b, ", ")
             res0: StringBuilder = 1, 2, 3, 4

    b

      the string builder to which elements are appended.

    sep

      the separator string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

16. #### def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all elements of this wrapped array to a string builder using start, end, and separator strings.

    Appends all elements of this wrapped array to a string builder using start, end, and separator strings. The written text 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 wrapped array are separated by the string `sep`.

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> a.addString(b, "LinkedList(", ", ", ")")
             res1: StringBuilder = LinkedList(1, 2, 3, 4)

    b

      the string builder to which elements are appended.

    start

      the starting string.

    sep

      the separator string.

    end

      the ending string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

17. #### def aggregate[B](z: B)(seqop: (B, T) ⇒ 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 an 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).

    B

      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
      TraversableOnce → GenTraversableOnce

18. #### def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

      a partial function with the same domain as this partial function, which maps arguments `x` to `k(this(x))`.

    Definition Classes
      PartialFunction → Function1

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

    Definition Classes
      Any
    Exceptions thrown
      ClassCastException

      if the receiver object is not an instance of the erasure of type `T0`.

20. #### def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

      The object with which this wrapped array should be compared

    returns

      `true`, if this wrapped array can possibly equal `that`, `false` otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
      IterableLike → Equals

21. #### def clone(): WrappedArray[T]

    Clones this object, including the underlying Array.

    Clones this object, including the underlying Array.

    returns

      a copy of the receiver object.

    Definition Classes
      WrappedArray → Cloneable → AnyRef

22. #### def collect[B](pf: PartialFunction[T, B]): WrappedArray[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the wrapped array.

    returns

      a new wrapped array resulting from applying the given partial function `pf` to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
      TraversableLike → GenTraversableLike

23. #### def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

    Finds the first element of the wrapped array for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the wrapped array for which the given partial function is defined, and applies the partial function to it.

    pf

      the partial function

    returns

      an option value containing pf applied to the first value for which it is defined, or `None` if none exists.

    Definition Classes
      TraversableOnce
    Example:

    1. `Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)`

24. #### def combinations(n: Int): Iterator[WrappedArray[T]]

    Iterates over combinations.

    Iterates over combinations.

    returns

      An Iterator which traverses the possible n-element combinations of this wrapped array.

    Definition Classes
      SeqLike
    Example:

    1. `"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)`

25. #### def companion: GenericCompanion[IndexedSeq]

    The factory companion object that builds instances of class WrappedArray.

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

    Definition Classes
      IndexedSeq → IndexedSeq → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate

26. #### def compose[A](g: (A) ⇒ Int): (A) ⇒ T

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

      a new function `f` such that `f(x) == apply(g(x))`

    Definition Classes
      Function1

27. #### def contains(elem: Any): Boolean

    Tests whether this wrapped array contains a given value as an element.

    Tests whether this wrapped array contains a given value as an element.

    elem

      the element to test.

    returns

      `true` if this wrapped array has an element that is is equal (wrt `==`) to `elem`, `false` otherwise.

    Definition Classes
      SeqLike

28. #### def containsSlice[B](that: GenSeq[B]): Boolean

    Tests whether this wrapped array contains a given sequence as a slice.

    Tests whether this wrapped array contains a given sequence as a slice.

    that

      the sequence to test

    returns

      `true` if this wrapped array contains a slice with the same elements as `that`, otherwise `false`.

    Definition Classes
      SeqLike

29. #### def copyToArray(xs: Array[T], start: Int, len: Int): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

30. #### def copyToArray(xs: Array[T]): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    Definition Classes
      TraversableOnce → GenTraversableOnce

31. #### def copyToArray(xs: Array[T], start: Int): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      TraversableOnce → GenTraversableOnce

32. #### def copyToBuffer[B >: T](dest: Buffer[B]): Unit

    Copies all elements of this wrapped array to a buffer.

    Copies all elements of this wrapped array to a buffer.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableOnce

33. #### def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

    Tests whether every element of this wrapped array relates to the corresponding element of another sequence by satisfying a test predicate.

    Tests whether every element of this wrapped array relates to the corresponding element of another sequence by satisfying a test predicate.

    B

      the type of the elements of `that`

    that

      the other sequence

    p

      the test predicate, which relates elements from both sequences

    returns

      `true` if both sequences have the same length and `p(x, y)` is `true` for all corresponding elements `x` of this wrapped array and `y` of `that`, otherwise `false`.

    Definition Classes
      SeqLike → GenSeqLike

34. #### def count(p: (T) ⇒ Boolean): Int

    Counts the number of elements in the wrapped array which satisfy a predicate.

    Counts the number of elements in the wrapped array which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      TraversableOnce → GenTraversableOnce

35. #### def deep: IndexedSeq[Any]

    Creates a possible nested `IndexedSeq` which consists of all the elements of this array.

    Creates a possible nested `IndexedSeq` which consists of all the elements of this array. If the elements are arrays themselves, the `deep` transformation is applied recursively to them. The `stringPrefix` of the `IndexedSeq` is "Array", hence the `IndexedSeq` prints like an array with all its elements shown, and the same recursively for any subarrays.

    Example:

         Array(Array(1, 2), Array(3, 4)).deep.toString

    prints: `Array(Array(1, 2), Array(3, 4))`

    returns

      An possibly nested indexed sequence of consisting of all the elements of the array.

    Definition Classes
      ArrayLike

36. #### def diff(that: Seq[T]): WrappedArray[T]

    [use case]

    [use case]
    that

      the sequence of elements to remove

    returns

      a new wrapped array which contains all elements of this wrapped array 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
      SeqLike → GenSeqLike

37. #### def distinct: WrappedArray[T]

    Builds a new wrapped array from this wrapped array without any duplicate elements.

    Builds a new wrapped array from this wrapped array without any duplicate elements.

    returns

      A new wrapped array which contains the first occurrence of every element of this wrapped array.

    Definition Classes
      SeqLike → GenSeqLike

38. #### def drop(n: Int): WrappedArray[T]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

      the number of elements to drop from this wrapped array.

    returns

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

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

39. #### def dropRight(n: Int): WrappedArray[T]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      The number of elements to take

    returns

      a wrapped array consisting of all elements of this wrapped array except the last `n` ones, or else the empty wrapped array, if this wrapped array has less than `n` elements.

    Definition Classes
      IndexedSeqOptimized → IterableLike

40. #### def dropWhile(p: (T) ⇒ Boolean): WrappedArray[T]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

      The predicate used to test elements.

    returns

      the longest suffix of this wrapped array whose first element does not satisfy the predicate `p`.

    Definition Classes
      IndexedSeqOptimized → TraversableLike → GenTraversableLike

41. #### def endsWith[B](that: GenSeq[B]): Boolean

    Tests whether this wrapped array ends with the given sequence.

    Tests whether this wrapped array ends with the given sequence.

    that

      the sequence to test

    returns

      `true` if this wrapped array has `that` as a suffix, `false` otherwise.

    Definition Classes
      IndexedSeqOptimized → SeqLike → GenSeqLike

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

    Definition Classes
      AnyRef

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

44. #### def exists(p: (T) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this wrapped array.

    Tests whether a predicate holds for some of the elements of this wrapped array.

    p

      the predicate used to test elements.

    returns

      `true` if the given predicate `p` holds for some of the elements of this wrapped array, otherwise `false`.

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

45. #### def filter(p: (T) ⇒ Boolean): WrappedArray[T]

    Selects all elements of this wrapped array which satisfy a predicate.

    Selects all elements of this wrapped array which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

      a new wrapped array consisting of all elements of this wrapped array that satisfy the given predicate `p`. The order of the elements is preserved.

    Definition Classes
      TraversableLike → GenTraversableLike

46. #### def filterNot(p: (T) ⇒ Boolean): WrappedArray[T]

    Selects all elements of this wrapped array which do not satisfy a predicate.

    Selects all elements of this wrapped array which do not satisfy a predicate.

    p

      the predicate used to test elements.

    returns

      a new wrapped array consisting of all elements of this wrapped array that do not satisfy the given predicate `p`. The order of the elements is preserved.

    Definition Classes
      TraversableLike → GenTraversableLike

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

      not specified by SLS as a member of AnyRef

48. #### def find(p: (T) ⇒ Boolean): Option[T]

    Finds the first element of the wrapped array satisfying a predicate, if any.

    Finds the first element of the wrapped array satisfying a predicate, if any.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

49. #### def flatMap[B](f: (T) ⇒ GenTraversableOnce[B]): WrappedArray[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

      a new wrapped array resulting from applying the given collection-valued function `f` to each element of this wrapped array and concatenating the results.

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

50. #### def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this wrapped array using the specified associative binary operator.

    Folds the elements of this wrapped array using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

      a type parameter for the binary operator, a supertype of `A`.

    z

      a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change 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
      TraversableOnce → GenTraversableOnce

51. #### def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

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

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

    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 wrapped array, going left to right with the start value `z` on the left:

                      op(...op(z, x1), x2, ..., xn)

      where `x1, ..., xn` are the elements of this wrapped array.

    Definition Classes
      IndexedSeqOptimized → TraversableOnce → GenTraversableOnce

52. #### def foldRight[B](z: B)(op: (T, B) ⇒ B): B

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

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

    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 wrapped array, going right to left with the start value `z` on the right:

                      op(x1, op(x2, ... op(xn, z)...))

      where `x1, ..., xn` are the elements of this wrapped array.

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce

53. #### def forall(p: (T) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this wrapped array.

    Tests whether a predicate holds for all elements of this wrapped array.

    p

      the predicate used to test elements.

    returns

      `true` if the given predicate `p` holds for all elements of this wrapped array, otherwise `false`.

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

54. #### def foreach(f: (T) ⇒ Unit): Unit

    [use case]

    [use case]
    f

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

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

55. #### def genericBuilder[B]: Builder[B, IndexedSeq[B]]

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

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

    Definition Classes
      GenericTraversableTemplate

56. #### final def getClass(): 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.

    Definition Classes
      AnyRef → Any
    Note

      not specified by SLS as a member of AnyRef

57. #### def groupBy[K](f: (T) ⇒ K): Map[K, WrappedArray[T]]

    Partitions this wrapped array into a map of wrapped arrays according to some discriminator function.

    Partitions this wrapped array into a map of wrapped arrays 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 wrapped array.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

58. #### def grouped(size: Int): Iterator[WrappedArray[T]]

    Partitions elements in fixed size wrapped arrays.

    Partitions elements in fixed size wrapped arrays.

    size

      the number of elements per group

    returns

      An iterator producing wrapped arrays of size `size`, except the last will be truncated if the elements don't divide evenly.

    Definition Classes
      IterableLike
    See also

      Iterator#grouped

59. #### def hasDefiniteSize: Boolean

    Tests whether this wrapped array is known to have a finite size.

    Tests whether this wrapped array is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as `Stream`, the predicate returns `true` if all elements have been computed. It returns `false` if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

      `true` if this collection is known to have finite size, `false` otherwise.

    Definition Classes
      TraversableLike → TraversableOnce → GenTraversableOnce

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

    Hashcodes for WrappedArray produce a value from the hashcodes of all the elements of the wrapped array.

    Hashcodes for WrappedArray produce a value from the hashcodes of all the elements of the wrapped array.

    returns

      the hash code value for this object.

    Definition Classes
      IndexedSeqLike → GenSeqLike → AnyRef → Any

61. #### def head: T

    Selects the first element of this wrapped array.

    Selects the first element of this wrapped array.

    returns

      the first element of this wrapped array.

    Definition Classes
      IndexedSeqOptimized → IterableLike → GenIterableLike → TraversableLike → GenTraversableLike
    Exceptions thrown
      `NoSuchElementException`

      if the wrapped array is empty.

62. #### def headOption: Option[T]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

      the first element of this wrapped array if it is nonempty, `None` if it is empty.

    Definition Classes
      TraversableLike

63. #### def indexOf(elem: T, from: Int): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    from

      the start index

    returns

      the index `>= from` of the first element of this wrapped array that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

64. #### def indexOf(elem: T): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    returns

      the index of the first element of this wrapped array that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

65. #### def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int

    Finds first index after or at a start index where this wrapped array contains a given sequence as a slice.

    Finds first index after or at a start index where this wrapped array contains a given sequence as a slice.

    that

      the sequence to test

    from

      the start index

    returns

      the first index `>= from` such that the elements of this wrapped array starting at this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

    Definition Classes
      SeqLike

66. #### def indexOfSlice[B >: T](that: GenSeq[B]): Int

    Finds first index where this wrapped array contains a given sequence as a slice.

    Finds first index where this wrapped array contains a given sequence as a slice.

    that

      the sequence to test

    returns

      the first index such that the elements of this wrapped array starting at this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

    Definition Classes
      SeqLike

67. #### def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

    Finds index of the first element satisfying some predicate after or at some start index.

    Finds index of the first element satisfying some predicate after or at some start index.

    p

      the predicate used to test elements.

    from

      the start index

    returns

      the index `>= from` of the first element of this wrapped array that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      IndexedSeqOptimized → SeqLike → GenSeqLike

68. #### def indexWhere(p: (T) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

      the predicate used to test elements.

    returns

      the index of the first element of this wrapped array that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

69. #### def indices: Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

      a `Range` value from `0` to one less than the length of this wrapped array.

    Definition Classes
      SeqLike

70. #### def init: WrappedArray[T]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

      a wrapped array consisting of all elements of this wrapped array except the last one.

    Definition Classes
      IndexedSeqOptimized → TraversableLike
    Exceptions thrown
      `UnsupportedOperationException`

      if the wrapped array is empty.

71. #### def inits: Iterator[WrappedArray[T]]

    Iterates over the inits of this wrapped array.

    Iterates over the inits of this wrapped array. The first value will be this wrapped array and the final one will be an empty wrapped array, with the intervening values the results of successive applications of `init`.

    returns

      an iterator over all the inits of this wrapped array

    Definition Classes
      TraversableLike
    Example:

    1. `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)`

72. #### def intersect(that: Seq[T]): WrappedArray[T]

    [use case]

    [use case]
    that

      the sequence of elements to intersect with.

    returns

      a new wrapped array which contains all elements of this wrapped array 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
      SeqLike → GenSeqLike

73. #### def isDefinedAt(idx: Int): Boolean

    Tests whether this wrapped array contains given index.

    Tests whether this wrapped array 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 wrapped array contains an element at position `idx`, `false` otherwise.

    Definition Classes
      GenSeqLike

74. #### def isEmpty: Boolean

    Tests whether the wrapped array is empty.

    Tests whether the wrapped array is empty.

    returns

      `true` if the wrapped array contains no elements, `false` otherwise.

    Definition Classes
      IndexedSeqOptimized → IterableLike → GenIterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
      Any

76. #### final def isTraversableAgain: Boolean

    Tests whether this wrapped array can be repeatedly traversed.

    Tests whether this wrapped array can be repeatedly traversed.

    returns

      `true`

    Definition Classes
      GenTraversableLike → GenTraversableOnce

77. #### def iterator: Iterator[T]

    Creates a new iterator over all elements contained in this iterable object.

    Creates a new iterator over all elements contained in this iterable object.

    returns

      the new iterator

    Definition Classes
      IndexedSeqLike → IterableLike → GenIterableLike

78. #### def last: T

    Selects the last element.

    Selects the last element.

    returns

      The last element of this wrapped array.

    Definition Classes
      IndexedSeqOptimized → TraversableLike
    Exceptions thrown
      NoSuchElementException

      If the wrapped array is empty.

79. #### def lastIndexOf(elem: T, end: Int): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    end

      the end index.

    returns

      the index `<= end` of the last element of this wrapped array that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

80. #### def lastIndexOf(elem: T): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    returns

      the index of the last element of this wrapped array that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

81. #### def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int

    Finds last index before or at a given end index where this wrapped array contains a given sequence as a slice.

    Finds last index before or at a given end index where this wrapped array contains a given sequence as a slice.

    that

      the sequence to test

    end

      the end index

    returns

      the last index `<= end` such that the elements of this wrapped array starting at this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

    Definition Classes
      SeqLike

82. #### def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int

    Finds last index where this wrapped array contains a given sequence as a slice.

    Finds last index where this wrapped array contains a given sequence as a slice.

    that

      the sequence to test

    returns

      the last index such that the elements of this wrapped array starting a this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

    Definition Classes
      SeqLike

83. #### def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

    Finds index of last element satisfying some predicate before or at given end index.

    Finds index of last element satisfying some predicate before or at given end index.

    p

      the predicate used to test elements.

    returns

      the index `<= end` of the last element of this wrapped array that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      IndexedSeqOptimized → SeqLike → GenSeqLike

84. #### def lastIndexWhere(p: (T) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    p

      the predicate used to test elements.

    returns

      the index of the last element of this wrapped array that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

85. #### def lastOption: Option[T]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

      the last element of this wrapped array$ if it is nonempty, `None` if it is empty.

    Definition Classes
      TraversableLike

86. #### def lengthCompare(len: Int): Int

    Compares the length of this wrapped array to a test value.

    Compares the length of this wrapped array to a test value.

    len

      the test value that gets compared with the length.

    returns

      A value `x` where

                 x <  0       if this.length <  len
                 x == 0       if this.length == len
                 x >  0       if this.length >  len

      The method as implemented here does not call `length` directly; its running time is `O(length min len)` instead of `O(length)`. The method should be overwritten if computing `length` is cheap.

    Definition Classes
      IndexedSeqOptimized → SeqLike

87. #### def lift: (Int) ⇒ Option[T]

    Turns this partial function into an plain function returning an `Option` result.

    Turns this partial function into an plain function returning an `Option` result.

    returns

      a function that takes an argument `x` to `Some(this(x))` if `this` is defined for `x`, and to `None` otherwise.

    Definition Classes
      PartialFunction
    See also

      Function.unlift

88. #### def map[B](f: (T) ⇒ B): WrappedArray[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

      a new wrapped array resulting from applying the given function `f` to each element of this wrapped array and collecting the results.

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

89. #### def max: A

    [use case]

    [use case]
    returns

      the largest element of this wrapped array.

    Definition Classes
      TraversableOnce → GenTraversableOnce

90. #### def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Definition Classes
      TraversableOnce → GenTraversableOnce

91. #### def min: A

    [use case]

    [use case]
    returns

      the smallest element of this wrapped array

    Definition Classes
      TraversableOnce → GenTraversableOnce

92. #### def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Definition Classes
      TraversableOnce → GenTraversableOnce

93. #### def missingCase(x: Int): T

    Attributes
      protected
    Definition Classes
      PartialFunction

94. #### def mkString: String

    Displays all elements of this wrapped array in a string.

    Displays all elements of this wrapped array in a string.

    returns

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

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    Displays all elements of this wrapped array in a string using a separator string.

    Displays all elements of this wrapped array in a string using a separator string.

    sep

      the separator string.

    returns

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

    Definition Classes
      TraversableOnce → GenTraversableOnce
    Example:

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

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

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

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

    Definition Classes
      TraversableOnce → GenTraversableOnce
    Example:

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

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

    Definition Classes
      AnyRef

98. #### def newBuilder: Builder[T, WrappedArray[T]]

    Creates new builder for this collection ==> move to subclasses

    Creates new builder for this collection ==> move to subclasses

    Attributes
      protected[this]
    Definition Classes
      WrappedArray → GenericTraversableTemplate → TraversableLike → HasNewBuilder

99. #### def nonEmpty: Boolean

    Tests whether the wrapped array is not empty.

    Tests whether the wrapped array is not empty.

    returns

      `true` if the wrapped array contains at least one element, `false` otherwise.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

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

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

102. #### def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

     Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

     Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

     A1

       the argument type of the fallback function

     B1

       the result type of the fallback function

     that

       the fallback function

     returns

       a partial function which has as domain the union of the domains of this partial function and `that`. The resulting partial function takes `x` to `this(x)` where `this` is defined, and to `that(x)` where it is not.

     Definition Classes
       PartialFunction

103. #### def orElseFast[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

     Definition Classes
       PartialFunction

104. #### def padTo(len: Int, elem: T): WrappedArray[A]

     [use case]

     [use case]
     len

       the target length

     elem

       the padding value

     returns

       a new wrapped array consisting of all elements of this wrapped array followed by the minimal number of occurrences of `elem` so that the resulting wrapped array has a length of at least `len`.

     Definition Classes
       SeqLike → GenSeqLike

105. #### def par: ParArray[T]

     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
       WrappedArray → CustomParallelizable → Parallelizable

106. #### def parCombiner: Combiner[T, ParArray[T]]

     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

107. #### def partition(p: (T) ⇒ Boolean): (WrappedArray[T], WrappedArray[T])

     Partitions this wrapped array in two wrapped arrays according to a predicate.

     Partitions this wrapped array in two wrapped arrays according to a predicate.

     p

       the predicate on which to partition.

     returns

       a pair of wrapped arrays: the first wrapped array consists of all elements that satisfy the predicate `p` and the second wrapped array consists of all elements that don't. The relative order of the elements in the resulting wrapped arrays is the same as in the original wrapped array.

     Definition Classes
       TraversableLike → GenTraversableLike

108. #### def patch(from: Int, that: GenSeq[T], replaced: Int): WrappedArray[A]

     [use case]

     [use case]
     from

       the index of the first replaced element

     replaced

       the number of elements to drop in the original wrapped array

     returns

       a new wrapped array consisting of all elements of this wrapped array except that `replaced` elements starting from `from` are replaced by `patch`.

     Definition Classes
       SeqLike → GenSeqLike

109. #### def permutations: Iterator[WrappedArray[T]]

     Iterates over distinct permutations.

     Iterates over distinct permutations.

     returns

       An Iterator which traverses the distinct permutations of this wrapped array.

     Definition Classes
       SeqLike
     Example:

     1. `"abb".permutations = Iterator(abb, bab, bba)`

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

     p

       the predicate used to test elements.

     returns

       the length of the longest prefix of this wrapped array such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       GenSeqLike

111. #### def product: A

     [use case]

     [use case]
     returns

       the product of all elements in this wrapped array of numbers of type `Int`. Instead of `Int`, any other type `T` with an implicit `Numeric[T]` implementation can be used as element type of the wrapped array and as result type of `product`. Examples of such types are: `Long`, `Float`, `Double`, `BigInt`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

112. #### def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

     Reduces the elements of this wrapped array using the specified associative binary operator.

     Reduces the elements of this wrapped array using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     A1

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

       The result of applying reduce operator `op` between all the elements if the wrapped array is nonempty.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Exceptions thrown
       UnsupportedOperationException

       if this wrapped array is empty.

113. #### def reduceLeft[B >: T](op: (B, T) ⇒ B): B

     Definition Classes
       IndexedSeqOptimized → TraversableOnce

114. #### def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

     Optionally applies a binary operator to all elements of this wrapped array, going left to right.

     Optionally applies a binary operator to all elements of this wrapped array, going left to right.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

115. #### def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

     Reduces the elements of this wrapped array, if any, using the specified associative binary operator.

     Reduces the elements of this wrapped array, if any, using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     A1

       A type parameter for the binary operator, a supertype of `A`.

     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
       TraversableOnce → GenTraversableOnce

116. #### def reduceRight[B >: T](op: (T, B) ⇒ B): B

     Applies a binary operator to all elements of this wrapped array, going right to left.

     Applies a binary operator to all elements of this wrapped array, going right to left.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this wrapped array, going right to left:

                       op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))

       where `x1, ..., xn` are the elements of this wrapped array.

     Definition Classes
       IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
     Exceptions thrown
       `UnsupportedOperationException`

       if this wrapped array is empty.

117. #### def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

     Optionally applies a binary operator to all elements of this wrapped array, going right to left.

     Optionally applies a binary operator to all elements of this wrapped array, going right to left.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

118. #### def repr: WrappedArray[T]

     The collection of type wrapped array underlying this `TraversableLike` object.

     The collection of type wrapped array underlying this `TraversableLike` object. By default this is implemented as the `TraversableLike` object itself, but this can be overridden.

     Definition Classes
       TraversableLike → GenTraversableLike

119. #### def reverse: WrappedArray[T]

     Returns new wrapped array wih elements in reversed order.

     Returns new wrapped array wih elements in reversed order.

     returns

       A new wrapped array with all elements of this wrapped array in reversed order.

     Definition Classes
       IndexedSeqOptimized → SeqLike → GenSeqLike

120. #### def reverseIterator: Iterator[T]

     An iterator yielding elements in reversed order.

     An iterator yielding elements in reversed order.

     Note: `xs.reverseIterator` is the same as `xs.reverse.iterator` but might be more efficient.

     returns

       an iterator yielding the elements of this wrapped array in reversed order

     Definition Classes
       IndexedSeqOptimized → SeqLike

121. #### def reverseMap[B](f: (T) ⇒ B): WrappedArray[B]

     [use case] Note: `xs.reverseMap(f)` is the same as `xs.reverse.map(f)` but might be more efficient.

     [use case]

     Note: `xs.reverseMap(f)` is the same as `xs.reverse.map(f)` but might be more efficient.

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

       a new wrapped array resulting from applying the given function `f` to each element of this wrapped array and collecting the results in reversed order.

     Definition Classes
       SeqLike → GenSeqLike

122. #### def reversed: List[T]

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

123. #### def sameElements(that: GenIterable[T]): Boolean

     [use case]

     [use case]
     that

       the collection to compare with.

     returns

       `true`, if both collections contain the same elements in the same order, `false` otherwise.

     Definition Classes
       IndexedSeqOptimized → IterableLike → GenIterableLike

124. #### def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[WrappedArray[T], 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 wrapped array containing the prefix scan of the elements in this wrapped array

     Definition Classes
       TraversableLike → GenTraversableLike

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

     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 the new element type `B`.

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike

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

     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 the new element type `B`.

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) The behavior of `scanRight` has changed. The previous behavior can be reproduced with scanRight.reverse.

127. #### def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

     Computes length of longest segment whose elements all satisfy some predicate.

     Computes length of longest segment whose elements all satisfy some predicate.

     p

       the predicate used to test elements.

     from

       the index where the search starts.

     returns

       the length of the longest segment of this wrapped array starting from index `from` such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       IndexedSeqOptimized → SeqLike → GenSeqLike

128. #### def seq: IndexedSeq[T]

     A version of this collection with all of the operations implemented sequentially (i.

     A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

     This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

     returns

       a sequential view of the collection.

     Definition Classes
       IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

129. #### def size: Int

     The size of this wrapped array, equivalent to `length`.

     The size of this wrapped array, equivalent to `length`.

     returns

       the number of elements in this wrapped array.

     Definition Classes
       SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

130. #### def slice(from: Int, until: Int): WrappedArray[T]

     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

     from

       the lowest index to include from this wrapped array.

     until

       the highest index to EXCLUDE from this wrapped array.

     returns

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

     Definition Classes
       IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

131. #### def sliding(size: Int, step: Int): Iterator[WrappedArray[T]]

     Definition Classes
       IterableLike

132. #### def sliding(size: Int): Iterator[WrappedArray[T]]

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

     size

       the number of elements per group

     returns

       An iterator producing wrapped arrays of size `size`, except the last and the only element will be truncated if there are fewer elements than size.

     Definition Classes
       IterableLike
     See also

       Iterator#sliding

133. #### def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): WrappedArray[T]

     Sorts this WrappedArray according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

     Sorts this WrappedArray according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

     B

       the target type of the transformation `f`, and the type where the ordering `ord` is defined.

     f

       the transformation function mapping elements to some other domain `B`.

     ord

       the ordering assumed on domain `B`.

     returns

       a wrapped array consisting of the elements of this wrapped array sorted according to the ordering where `x < y` if `ord.lt(f(x), f(y))`.

     Definition Classes
       SeqLike
     Example:

     1.        val words = "The quick brown fox jumped over the lazy dog".split(' ')
               // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]]
               words.sortBy(x => (x.length, x.head))
               res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)

     See also

       scala.math.Ordering

134. #### def sortWith(lt: (T, T) ⇒ Boolean): WrappedArray[T]

     Sorts this wrapped array according to a comparison function.

     Sorts this wrapped array according to a comparison function.

     The sort is stable. That is, elements that are equal wrt `lt` appear in the same order in the sorted sequence as in the original.

     lt

       the comparison function which tests whether its first argument precedes its second argument in the desired ordering.

     returns

       a wrapped array consisting of the elements of this wrapped array sorted according to the comparison function `lt`.

     Definition Classes
       SeqLike
     Example:

     1.        List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
               List("Bob", "John", "Steve", "Tom")

135. #### def sorted[B >: T](implicit ord: Ordering[B]): WrappedArray[T]

     Sorts this wrapped array according to an Ordering.

     Sorts this wrapped array according to an Ordering.

     The sort is stable. That is, elements that are equal wrt `lt` appear in the same order in the sorted sequence as in the original.

     ord

       the ordering to be used to compare elements.

     returns

       a wrapped array consisting of the elements of this wrapped array sorted according to the ordering `ord`.

     Definition Classes
       SeqLike
     See also

       scala.math.Ordering

136. #### def span(p: (T) ⇒ Boolean): (WrappedArray[T], WrappedArray[T])

     Splits this wrapped array into a prefix/suffix pair according to a predicate.

     Splits this wrapped array 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.

     p

       the test predicate

     returns

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

     Definition Classes
       IndexedSeqOptimized → TraversableLike → GenTraversableLike

137. #### def splitAt(n: Int): (WrappedArray[T], WrappedArray[T])

     Splits this wrapped array into two at a given position.

     Splits this wrapped array into two at a given position. Note: `c splitAt n` is equivalent to (but possibly more efficient than) `(c take n, c drop n)`.

     n

       the position at which to split.

     returns

       a pair of wrapped arrays consisting of the first `n` elements of this wrapped array, and the other elements.

     Definition Classes
       IndexedSeqOptimized → TraversableLike → GenTraversableLike

138. #### def startsWith[B](that: GenSeq[B], offset: Int): Boolean

     Tests whether this wrapped array contains the given sequence at a given index.

     Tests whether this wrapped array contains the given sequence at a given index.

     Note: If the both the receiver object `this` and the argument `that` are infinite sequences this method may not terminate.

     that

       the sequence to test

     offset

       the index where the sequence is searched.

     returns

       `true` if the sequence `that` is contained in this wrapped array at index `offset`, otherwise `false`.

     Definition Classes
       IndexedSeqOptimized → SeqLike → GenSeqLike

139. #### def startsWith[B](that: GenSeq[B]): Boolean

     Tests whether this wrapped array starts with the given sequence.

     Tests whether this wrapped array 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

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

     Definition Classes
       WrappedArray → TraversableLike → GenTraversableLike

141. #### def sum: A

     [use case]

     [use case]
     returns

       the sum of all elements in this wrapped array of numbers of type `Int`. Instead of `Int`, any other type `T` with an implicit `Numeric[T]` implementation can be used as element type of the wrapped array and as result type of `sum`. Examples of such types are: `Long`, `Float`, `Double`, `BigInt`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       AnyRef

143. #### def tail: WrappedArray[T]

     Selects all elements except the first.

     Selects all elements except the first.

     returns

       a wrapped array consisting of all elements of this wrapped array except the first one.

     Definition Classes
       IndexedSeqOptimized → TraversableLike → GenTraversableLike
     Exceptions thrown
       `UnsupportedOperationException`

       if the wrapped array is empty.

144. #### def tails: Iterator[WrappedArray[T]]

     Iterates over the tails of this wrapped array.

     Iterates over the tails of this wrapped array. The first value will be this wrapped array and the final one will be an empty wrapped array, with the intervening values the results of successive applications of `tail`.

     returns

       an iterator over all the tails of this wrapped array

     Definition Classes
       TraversableLike
     Example:

     1. `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`

145. #### def take(n: Int): WrappedArray[T]

     Selects first n elements.

     Selects first n elements.

     n

       Tt number of elements to take from this wrapped array.

     returns

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

     Definition Classes
       IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

146. #### def takeRight(n: Int): WrappedArray[T]

     Selects last n elements.

     Selects last n elements.

     n

       the number of elements to take

     returns

       a wrapped array consisting only of the last `n` elements of this wrapped array, or else the whole wrapped array, if it has less than `n` elements.

     Definition Classes
       IndexedSeqOptimized → IterableLike

147. #### def takeWhile(p: (T) ⇒ Boolean): WrappedArray[T]

     Takes longest prefix of elements that satisfy a predicate.

     Takes longest prefix of elements that satisfy a predicate.

     p

       The predicate used to test elements.

     returns

       the longest prefix of this wrapped array whose elements all satisfy the predicate `p`.

     Definition Classes
       IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

148. #### def thisCollection: WrappedArray[T]

     The underlying collection seen as an instance of `WrappedArray`.

     The underlying collection seen as an instance of `WrappedArray`. By default this is implemented as the current collection object itself, but this can be overridden.

     Attributes
       protected[this]
     Definition Classes
       WrappedArray → IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike

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

     [use case]

     [use case]
     returns

       an array containing all elements of this wrapped array. A `ClassManifest` must be available for the element type of this wrapped array.

     Definition Classes
       WrappedArray → TraversableOnce → GenTraversableOnce

150. #### def toBuffer[A1 >: T]: Buffer[A1]

     Overridden for efficiency

     Overridden for efficiency

     returns

       a buffer containing all elements of this wrapped array.

     Definition Classes
       IndexedSeqLike → TraversableOnce → GenTraversableOnce

151. #### def toCollection(repr: WrappedArray[T]): WrappedArray[T]

     A conversion from collections of type `Repr` to `WrappedArray` objects.

     A conversion from collections of type `Repr` to `WrappedArray` objects. By default this is implemented as just a cast, but this can be overridden.

     Attributes
       protected[this]
     Definition Classes
       WrappedArray → IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike

152. #### def toIndexedSeq: IndexedSeq[T]

     Converts this wrapped array to an indexed sequence.

     Converts this wrapped array to an indexed sequence.

     returns

       an indexed sequence containing all elements of this wrapped array.

     Definition Classes
       TraversableOnce → GenTraversableOnce

153. #### def toIterable: Iterable[T]

     Converts this wrapped array to an iterable collection.

     Converts this wrapped array 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).

     returns

       an `Iterable` containing all elements of this wrapped array.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

154. #### def toIterator: Iterator[T]

     Returns an Iterator over the elements in this wrapped array.

     Returns an Iterator over the elements in this wrapped array. Will return the same Iterator if this instance is already an Iterator.

     returns

       an Iterator containing all elements of this wrapped array.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

155. #### def toList: List[T]

     Converts this wrapped array to a list.

     Converts this wrapped array to a list.

     returns

       a list containing all elements of this wrapped array.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     [use case]

     [use case]
     returns

       a map of type `immutable.Map[T, U]` containing all key/value pairs of type `(T, U)` of this wrapped array.

     Definition Classes
       TraversableOnce → GenTraversableOnce

157. #### def toSeq: Seq[T]

     Converts this wrapped array to a sequence.

     Converts this wrapped array to a sequence.

     Overridden for efficiency.

     returns

       a sequence containing all elements of this wrapped array.

     Definition Classes
       SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

158. #### def toSet[B >: T]: Set[B]

     Converts this wrapped array to a set.

     Converts this wrapped array to a set.

     returns

       a set containing all elements of this wrapped array.

     Definition Classes
       TraversableOnce → GenTraversableOnce

159. #### def toStream: Stream[T]

     Converts this wrapped array to a stream.

     Converts this wrapped array to a stream.

     returns

       a stream containing all elements of this wrapped array.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

160. #### def toString(): String

     Converts this wrapped array to a string.

     Converts this wrapped array to a string.

     returns

       a string representation of this collection. By default this string consists of the `stringPrefix` of this wrapped array, followed by all elements separated by commas and enclosed in parentheses.

     Definition Classes
       SeqLike → TraversableLike → AnyRef → Any

161. #### def toTraversable: Traversable[T]

     Converts this wrapped array to an unspecified Traversable.

     Converts this wrapped array to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

     returns

       a Traversable containing all elements of this wrapped array.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

162. #### def transform(f: (T) ⇒ T): WrappedArray.this.type

     Applies a transformation function to all values contained in this sequence.

     Applies a transformation function to all values contained in this sequence. The transformation function produces new values from existing elements.

     f

       the transformation to apply

     returns

       the sequence itself.

     Definition Classes
       SeqLike

163. #### def union(that: Seq[T]): WrappedArray[T]

     [use case]

     [use case]
     that

       the sequence to add.

     returns

       a new wrapped array which contains all elements of this wrapped array followed by all elements of `that`.

     Definition Classes
       SeqLike → GenSeqLike

164. #### def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

     Converts this wrapped array of pairs into two collections of the first and second half of each pair.

     Converts this wrapped array 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 wrapped array is a pair.

     returns

       a pair wrapped arrays, containing the first, respectively second half of each element pair of this wrapped array.

     Definition Classes
       GenericTraversableTemplate

165. #### def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

     Converts this wrapped array of triples into three collections of the first, second, and third element of each triple.

     Converts this wrapped array of triples into three collections of the first, second, and third element of each triple.

     asTriple

       an implicit conversion which asserts that the element type of this wrapped array is a triple.

     returns

       a triple wrapped arrays, containing the first, second, respectively third member of each element triple of this wrapped array.

     Definition Classes
       GenericTraversableTemplate

166. #### def updated(index: Int, elem: T): WrappedArray[A]

     [use case]

     [use case]
     index

       the position of the replacement

     elem

       the replacing element

     returns

       a copy of this wrapped array with the element at position `index` replaced by `elem`.

     Definition Classes
       SeqLike → GenSeqLike

167. #### def view(from: Int, until: Int): IndexedSeqView[T, WrappedArray[T]]

     A sub-sequence view starting at index `from` and extending up to (but not including) index `until`.

     A sub-sequence view starting at index `from` and extending up to (but not including) index `until`.

     from

       The index of the first element of the slice

     until

       The index of the element following the slice

     returns

       a non-strict view of a slice of this wrapped array, starting at index `from` and extending up to (but not including) index `until`.@note The difference between `view` and `slice` is that `view` produces a view of the current sequence, whereas `slice` produces a new sequence.

     Definition Classes
       IndexedSeqLike → SeqLike → IterableLike → TraversableLike
     Note

       view(from, to) is equivalent to view.slice(from, to)

168. #### def view: IndexedSeqView[T, WrappedArray[T]]

     Creates a view of this iterable @see Iterable.

     Creates a view of this iterable @see Iterable.View

     returns

       a non-strict view of this wrapped array.

     Definition Classes
       IndexedSeqLike → SeqLike → IterableLike → TraversableLike

169. #### final def wait(): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

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

     Definition Classes
       AnyRef
     Annotations
       @throws()

171. #### final def wait(arg0: Long): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

172. #### def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, WrappedArray[T]]

     Creates a non-strict filter of this wrapped array.

     Creates a non-strict filter of this wrapped array.

     Note: the difference between `c filter p` and `c withFilter p` is that the former creates a new collection, whereas the latter only restricts the domain of subsequent `map`, `flatMap`, `foreach`, and `withFilter` operations.

     p

       the predicate used to test elements.

     returns

       an object of class `WithFilter`, which supports `map`, `flatMap`, `foreach`, and `withFilter` operations. All these operations apply to those elements of this wrapped array which satisfy the predicate `p`.

     Definition Classes
       TraversableLike → FilterMonadic

173. #### def zip[B](that: GenIterable[B]): WrappedArray[(A, B)]

     [use case]

     [use case]
     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 wrapped array containing pairs consisting of corresponding elements of this wrapped array and `that`. The length of the returned collection is the minimum of the lengths of this wrapped array and `that`.

     Definition Classes
       IndexedSeqOptimized → IterableLike → GenIterableLike

174. #### def zipAll[B](that: Iterable[B], thisElem: T, thatElem: B): WrappedArray[(A, B)]

     [use case]

     [use case]
     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     thisElem

       the element to be used to fill up the result if this wrapped array is shorter than `that`.

     thatElem

       the element to be used to fill up the result if `that` is shorter than this wrapped array.

     returns

       a new wrapped array containing pairs consisting of corresponding elements of this wrapped array and `that`. The length of the returned collection is the maximum of the lengths of this wrapped array and `that`. If this wrapped array is shorter than `that`, `thisElem` values are used to pad the result. If `that` is shorter than this wrapped array, `thatElem` values are used to pad the result.

     Definition Classes
       IterableLike → GenIterableLike

175. #### def zipWithIndex: WrappedArray[(A, Int)]

     [use case]

     [use case]
     returns

       A new wrapped array containing pairs consisting of all elements of this wrapped array paired with their index. Indices start at `0`. @example `List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))`

     Definition Classes
       IndexedSeqOptimized → IterableLike → GenIterableLike

### Inherited from CustomParallelizable[T, ParArray[T]]

### Inherited from ArrayLike[T, WrappedArray[T]]

### Inherited from IndexedSeqOptimized[T, WrappedArray[T]]

### Inherited from IndexedSeq[T]

### Inherited from IndexedSeqLike[T, WrappedArray[T]]

### Inherited from IndexedSeq[T]

### Inherited from IndexedSeqLike[T, WrappedArray[T]]

### Inherited from AbstractSeq[T]

### Inherited from Seq[T]

### Inherited from SeqLike[T, Seq[T]]

### Inherited from Cloneable[Seq[T]]

### Inherited from Iterable[T]

### Inherited from Traversable[T]

### Inherited from Mutable

### Inherited from AbstractSeq[T]

### Inherited from Seq[T]

### Inherited from SeqLike[T, WrappedArray[T]]

### Inherited from GenSeq[T]

### Inherited from GenSeqLike[T, WrappedArray[T]]

### Inherited from PartialFunction[Int, T]

### Inherited from (Int) ⇒ T

### Inherited from AbstractIterable[T]

### Inherited from Iterable[T]

### Inherited from IterableLike[T, WrappedArray[T]]

### Inherited from Equals

### Inherited from GenIterable[T]

### Inherited from GenIterableLike[T, WrappedArray[T]]

### Inherited from AbstractTraversable[T]

### Inherited from Traversable[T]

### Inherited from GenTraversable[T]

### Inherited from GenericTraversableTemplate[T, IndexedSeq]

### Inherited from TraversableLike[T, WrappedArray[T]]

### Inherited from GenTraversableLike[T, WrappedArray[T]]

### Inherited from Parallelizable[T, ParArray[T]]

### Inherited from TraversableOnce[T]

### Inherited from GenTraversableOnce[T]

### Inherited from FilterMonadic[T, WrappedArray[T]]

### Inherited from HasNewBuilder[T, WrappedArray[T]]

### Inherited from AnyRef

### Inherited from Any