Class/Object

scala

Array

Related Docs: object Array | package scala

Permalink

final class Array[T] extends java.io.Serializable with java.lang.Cloneable

Arrays are mutable, indexed collections of values. Array[T] is Scala's representation for Java's T[].

val numbers = Array(1, 2, 3, 4)
val first = numbers(0) // read the first element
numbers(3) = 100 // replace the 4th array element with 100
val biggerNumbers = numbers.map(_ * 2) // multiply all numbers by two

Arrays make use of two common pieces of Scala syntactic sugar, shown on lines 2 and 3 of the above example code. Line 2 is translated into a call to apply(Int), while line 3 is translated into a call to update(Int, T).

Two implicit conversions exist in scala.Predef that are frequently applied to arrays: a conversion to scala.collection.mutable.ArrayOps (shown on line 4 of the example above) and a conversion to scala.collection.mutable.WrappedArray (a subtype of scala.collection.Seq). Both types make available many of the standard operations found in the Scala collections API. The conversion to ArrayOps is temporary, as all operations defined on ArrayOps return an Array, while the conversion to WrappedArray is permanent as all operations return a WrappedArray.

The conversion to ArrayOps takes priority over the conversion to WrappedArray. For instance, consider the following code:

val arr = Array(1, 2, 3)
val arrReversed = arr.reverse
val seqReversed : Seq[Int] = arr.reverse

Value arrReversed will be of type Array[Int], with an implicit conversion to ArrayOps occurring to perform the reverse operation. The value of seqReversed, on the other hand, will be computed by converting to WrappedArray first and invoking the variant of reverse that returns another WrappedArray.

Source
Array.scala
Version

1.0

See also

"The Scala 2.8 Collections' API" section on Array by Martin Odersky for more information.

"Scala 2.8 Arrays" the Scala Improvement Document detailing arrays since Scala 2.8.

Scala Language Specification, for in-depth information on the transformations the Scala compiler makes on Arrays (Sections 6.6 and 6.15 respectively.)

Linear Supertypes
java.lang.Cloneable, java.io.Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Array
  2. Cloneable
  3. Serializable
  4. AnyRef
  5. Any
Implicitly
  1. by _unitArrayOps
  2. by _shortArrayOps
  3. by _refArrayOps
  4. by _longArrayOps
  5. by _intArrayOps
  6. by _floatArrayOps
  7. by _doubleArrayOps
  8. by _charArrayOps
  9. by _byteArrayOps
  10. by _booleanArrayOps
  11. by genericArrayOps
  12. by ArrayCharSequence
  13. by any2stringadd
  14. by StringFormat
  15. by Ensuring
  16. by ArrowAssoc
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Array(_length: Int)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink

    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
  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to any2stringadd[Array[T]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Unit], B, That]): That

  5. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Short], B, That]): That

  6. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

  7. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Long], B, That]): That

  8. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Int], B, That]): That

  9. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Float], B, That]): That

  10. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Double], B, That]): That

  11. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Char], B, That]): That

  12. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Byte], B, That]): That

  13. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Boolean], B, That]): That

  14. def ++[B](that: GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the array is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

  15. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Unit], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableLike
  16. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Unit], B, That]): That

  17. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Short], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableLike
  18. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Short], B, That]): That

  19. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    TraversableLike
  20. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

  21. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Long], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableLike
  22. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Long], B, That]): That

  23. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Int], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableLike
  24. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Int], B, That]): That

  25. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Float], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableLike
  26. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Float], B, That]): That

  27. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Double], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableLike
  28. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Double], B, That]): That

  29. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Char], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableLike
  30. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Char], B, That]): That

  31. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Byte], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableLike
  32. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Byte], B, That]): That

  33. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Boolean], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableLike
  34. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[Boolean], B, That]): That

  35. def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

    Permalink

    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 mutable indexed sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    TraversableLike
  36. def ++:[B](that: collection.TraversableOnce[B]): Array[B]

    Permalink

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

  37. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    ArrayOps
  38. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    ArrayOps
  39. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    ArrayOps
  40. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    ArrayOps
  41. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    ArrayOps
  42. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    ArrayOps
  43. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    ArrayOps
  44. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    ArrayOps
  45. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    ArrayOps
  46. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    ArrayOps
  47. def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    ArrayOps
  48. def ->[B](y: B): (Array[T], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrowAssoc[Array[T]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  49. def /:[B](z: B)(op: (B, Unit) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableOnceGenTraversableOnce
  50. def /:[B](z: B)(op: (B, Short) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableOnceGenTraversableOnce
  51. def /:[B](z: B)(op: (B, Long) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableOnceGenTraversableOnce
  52. def /:[B](z: B)(op: (B, Int) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableOnceGenTraversableOnce
  53. def /:[B](z: B)(op: (B, Float) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableOnceGenTraversableOnce
  54. def /:[B](z: B)(op: (B, Double) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableOnceGenTraversableOnce
  55. def /:[B](z: B)(op: (B, Char) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableOnceGenTraversableOnce
  56. def /:[B](z: B)(op: (B, Byte) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableOnceGenTraversableOnce
  57. def /:[B](z: B)(op: (B, Boolean) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableOnceGenTraversableOnce
  58. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    ArrayOps
  59. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    ArrayOps
  60. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    ArrayOps
  61. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    ArrayOps
  62. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    ArrayOps
  63. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    ArrayOps
  64. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    ArrayOps
  65. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    ArrayOps
  66. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    ArrayOps
  67. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    ArrayOps
  68. def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    ArrayOps
  69. def :\[B](z: B)(op: (Unit, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableOnceGenTraversableOnce
  70. def :\[B](z: B)(op: (Short, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableOnceGenTraversableOnce
  71. def :\[B](z: B)(op: (Long, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableOnceGenTraversableOnce
  72. def :\[B](z: B)(op: (Int, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableOnceGenTraversableOnce
  73. def :\[B](z: B)(op: (Float, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableOnceGenTraversableOnce
  74. def :\[B](z: B)(op: (Double, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableOnceGenTraversableOnce
  75. def :\[B](z: B)(op: (Char, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableOnceGenTraversableOnce
  76. def :\[B](z: B)(op: (Byte, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableOnceGenTraversableOnce
  77. def :\[B](z: B)(op: (Boolean, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 = List(1,2,3,4)
    a: List[Int] = List(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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableOnceGenTraversableOnce
  78. final def ==(arg0: Any): Boolean

    Permalink

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    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
    AnyRef → Any
  79. def aggregate[B](z: ⇒ B)(seqop: (B, Unit) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableOnceGenTraversableOnce
  80. def aggregate[B](z: ⇒ B)(seqop: (B, Short) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableOnceGenTraversableOnce
  81. def aggregate[B](z: ⇒ B)(seqop: (B, Long) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableOnceGenTraversableOnce
  82. def aggregate[B](z: ⇒ B)(seqop: (B, Int) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableOnceGenTraversableOnce
  83. def aggregate[B](z: ⇒ B)(seqop: (B, Float) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableOnceGenTraversableOnce
  84. def aggregate[B](z: ⇒ B)(seqop: (B, Double) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableOnceGenTraversableOnce
  85. def aggregate[B](z: ⇒ B)(seqop: (B, Char) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableOnceGenTraversableOnce
  86. def aggregate[B](z: ⇒ B)(seqop: (B, Byte) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableOnceGenTraversableOnce
  87. def aggregate[B](z: ⇒ B)(seqop: (B, Boolean) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink

    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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableOnceGenTraversableOnce
  88. def apply(i: Int): T

    Permalink

    The element at given index.

    The element at given index.

    Indices start at 0; xs.apply(0) is the first element of array xs. Note the indexing syntax xs(i) is a shorthand for xs.apply(i).

    i

    the index

    returns

    the element at the given index

    Exceptions thrown

    ArrayIndexOutOfBoundsException if i < 0 or length <= i

  89. final def asInstanceOf[T0]: T0

    Permalink

    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.

  90. def charAt(index: Int): Char

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayCharSequence performed by method ArrayCharSequence in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    ArrayCharSequence → CharSequence
  91. def chars(): IntStream

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayCharSequence performed by method ArrayCharSequence in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    CharSequence
  92. def clone(): Array[T]

    Permalink

    Clone the Array.

    Clone the Array.

    returns

    A clone of the Array.

    Definition Classes
    Array → AnyRef
  93. def codePoints(): IntStream

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayCharSequence performed by method ArrayCharSequence in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    CharSequence
  94. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Unit, B])(implicit bf: CanBuildFrom[Array[Unit], B, That]): That

  95. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Short, B])(implicit bf: CanBuildFrom[Array[Short], B, That]): That

  96. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

  97. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Long, B])(implicit bf: CanBuildFrom[Array[Long], B, That]): That

  98. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[Array[Int], B, That]): That

  99. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Float, B])(implicit bf: CanBuildFrom[Array[Float], B, That]): That

  100. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Double, B])(implicit bf: CanBuildFrom[Array[Double], B, That]): That

  101. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Char, B])(implicit bf: CanBuildFrom[Array[Char], B, That]): That

  102. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Byte, B])(implicit bf: CanBuildFrom[Array[Byte], B, That]): That

  103. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Boolean, B])(implicit bf: CanBuildFrom[Array[Boolean], B, That]): That

  104. def collect[B](pf: PartialFunction[A, B]): Array[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the array.

    returns

    a new 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

  105. def collectFirst[B](pf: PartialFunction[Unit, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  106. def collectFirst[B](pf: PartialFunction[Short, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  107. def collectFirst[B](pf: PartialFunction[Long, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  108. def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  109. def collectFirst[B](pf: PartialFunction[Float, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  110. def collectFirst[B](pf: PartialFunction[Double, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  111. def collectFirst[B](pf: PartialFunction[Char, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  112. def collectFirst[B](pf: PartialFunction[Byte, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  113. def collectFirst[B](pf: PartialFunction[Boolean, B]): Option[B]

    Permalink

    Finds the first element of the mutable indexed sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable indexed sequence 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  114. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    SeqLike
  115. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    SeqLike
  116. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    SeqLike
  117. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    SeqLike
  118. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    SeqLike
  119. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    SeqLike
  120. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    SeqLike
  121. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    SeqLike
  122. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    SeqLike
  123. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    SeqLike
  124. def contains[A1 >: A](elem: A1): Boolean

    Permalink

    Tests whether this mutable indexed sequence contains a given value as an element.

    Tests whether this mutable indexed sequence contains a given value as an element.

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    SeqLike
  125. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableOnce
  126. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableOnce
  127. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    TraversableOnce
  128. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableOnce
  129. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableOnce
  130. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableOnce
  131. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableOnce
  132. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableOnce
  133. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableOnce
  134. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableOnce
  135. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    TraversableOnce
  136. def corresponds[B](that: GenSeq[B])(p: (Unit, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    SeqLikeGenSeqLike
  137. def corresponds[B](that: GenSeq[B])(p: (Short, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    SeqLikeGenSeqLike
  138. def corresponds[B](that: GenSeq[B])(p: (Long, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    SeqLikeGenSeqLike
  139. def corresponds[B](that: GenSeq[B])(p: (Int, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    SeqLikeGenSeqLike
  140. def corresponds[B](that: GenSeq[B])(p: (Float, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    SeqLikeGenSeqLike
  141. def corresponds[B](that: GenSeq[B])(p: (Double, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    SeqLikeGenSeqLike
  142. def corresponds[B](that: GenSeq[B])(p: (Char, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    SeqLikeGenSeqLike
  143. def corresponds[B](that: GenSeq[B])(p: (Byte, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    SeqLikeGenSeqLike
  144. def corresponds[B](that: GenSeq[B])(p: (Boolean, B) ⇒ Boolean): Boolean

    Permalink

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

    Tests whether every element of this mutable indexed sequence 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 mutable indexed sequence and y of that, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    SeqLikeGenSeqLike
  145. def count(p: (Unit) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableOnceGenTraversableOnce
  146. def count(p: (Short) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableOnceGenTraversableOnce
  147. def count(p: (Long) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableOnceGenTraversableOnce
  148. def count(p: (Int) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableOnceGenTraversableOnce
  149. def count(p: (Float) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableOnceGenTraversableOnce
  150. def count(p: (Double) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableOnceGenTraversableOnce
  151. def count(p: (Char) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableOnceGenTraversableOnce
  152. def count(p: (Byte) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableOnceGenTraversableOnce
  153. def count(p: (Boolean) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    Counts the number of elements in the mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableOnceGenTraversableOnce
  154. def diff(that: collection.Seq[Unit]): Array[Unit]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Unit]

  155. def diff(that: collection.Seq[Short]): Array[Short]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Short]

  156. def diff(that: collection.Seq[Long]): Array[Long]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Long]

  157. def diff(that: collection.Seq[Int]): Array[Int]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Int]

  158. def diff(that: collection.Seq[Float]): Array[Float]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Float]

  159. def diff(that: collection.Seq[Double]): Array[Double]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Double]

  160. def diff(that: collection.Seq[Char]): Array[Char]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Char]

  161. def diff(that: collection.Seq[Byte]): Array[Byte]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Byte]

  162. def diff(that: collection.Seq[Boolean]): Array[Boolean]

    Permalink

    [use case] Computes the multiset difference between this array and another sequence.

    [use case]

    Computes the multiset difference between this array and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array which contains all elements of this 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.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): Array[Boolean]

  163. def dropWhile(p: (Unit) ⇒ Boolean): Array[Unit]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  164. def dropWhile(p: (Short) ⇒ Boolean): Array[Short]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  165. def dropWhile(p: (Long) ⇒ Boolean): Array[Long]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  166. def dropWhile(p: (Int) ⇒ Boolean): Array[Int]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  167. def dropWhile(p: (Float) ⇒ Boolean): Array[Float]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  168. def dropWhile(p: (Double) ⇒ Boolean): Array[Double]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  169. def dropWhile(p: (Char) ⇒ Boolean): Array[Char]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  170. def dropWhile(p: (Byte) ⇒ Boolean): Array[Byte]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  171. def dropWhile(p: (Boolean) ⇒ Boolean): Array[Boolean]

    Permalink

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this mutable indexed sequence whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  172. def ensuring(cond: (Array[T]) ⇒ Boolean, msg: ⇒ Any): Array[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to Ensuring[Array[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  173. def ensuring(cond: (Array[T]) ⇒ Boolean): Array[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to Ensuring[Array[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  174. def ensuring(cond: Boolean, msg: ⇒ Any): Array[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to Ensuring[Array[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  175. def ensuring(cond: Boolean): Array[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Array[T] to Ensuring[Array[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  176. final def eq(arg0: AnyRef): Boolean

    Permalink

    Tests whether the argument (that) is a reference to the receiver object (this).

    Tests whether the argument (that) 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
  177. def equals(arg0: Any): Boolean

    Permalink

    The equality method for reference types.

    The equality method for reference types. Default implementation delegates to eq.

    See also equals in scala.Any.

    returns

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

    Definition Classes
    AnyRef → Any
  178. def exists(p: (Unit) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  179. def exists(p: (Short) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  180. def exists(p: (Long) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  181. def exists(p: (Int) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  182. def exists(p: (Float) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  183. def exists(p: (Double) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  184. def exists(p: (Char) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  185. def exists(p: (Byte) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  186. def exists(p: (Boolean) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    false if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for some of the elements of this mutable indexed sequence, otherwise false

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  187. def filter(p: (Unit) ⇒ Boolean): Array[Unit]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableLikeGenTraversableLike
  188. def filter(p: (Short) ⇒ Boolean): Array[Short]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableLikeGenTraversableLike
  189. def filter(p: (Long) ⇒ Boolean): Array[Long]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableLikeGenTraversableLike
  190. def filter(p: (Int) ⇒ Boolean): Array[Int]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableLikeGenTraversableLike
  191. def filter(p: (Float) ⇒ Boolean): Array[Float]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableLikeGenTraversableLike
  192. def filter(p: (Double) ⇒ Boolean): Array[Double]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableLikeGenTraversableLike
  193. def filter(p: (Char) ⇒ Boolean): Array[Char]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableLikeGenTraversableLike
  194. def filter(p: (Byte) ⇒ Boolean): Array[Byte]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableLikeGenTraversableLike
  195. def filter(p: (Boolean) ⇒ Boolean): Array[Boolean]

    Permalink

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableLikeGenTraversableLike
  196. def filterNot(p: (Unit) ⇒ Boolean): Array[Unit]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableLikeGenTraversableLike
  197. def filterNot(p: (Short) ⇒ Boolean): Array[Short]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableLikeGenTraversableLike
  198. def filterNot(p: (Long) ⇒ Boolean): Array[Long]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableLikeGenTraversableLike
  199. def filterNot(p: (Int) ⇒ Boolean): Array[Int]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableLikeGenTraversableLike
  200. def filterNot(p: (Float) ⇒ Boolean): Array[Float]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableLikeGenTraversableLike
  201. def filterNot(p: (Double) ⇒ Boolean): Array[Double]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableLikeGenTraversableLike
  202. def filterNot(p: (Char) ⇒ Boolean): Array[Char]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableLikeGenTraversableLike
  203. def filterNot(p: (Byte) ⇒ Boolean): Array[Byte]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableLikeGenTraversableLike
  204. def filterNot(p: (Boolean) ⇒ Boolean): Array[Boolean]

    Permalink

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    Selects all elements of this mutable indexed sequence which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence that do not satisfy the given predicate p. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableLikeGenTraversableLike
  205. def finalize(): Unit

    Permalink

    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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
    Note

    not specified by SLS as a member of AnyRef

  206. def find(p: (Unit) ⇒ Boolean): Option[Unit]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  207. def find(p: (Short) ⇒ Boolean): Option[Short]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  208. def find(p: (Long) ⇒ Boolean): Option[Long]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  209. def find(p: (Int) ⇒ Boolean): Option[Int]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  210. def find(p: (Float) ⇒ Boolean): Option[Float]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  211. def find(p: (Double) ⇒ Boolean): Option[Double]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  212. def find(p: (Char) ⇒ Boolean): Option[Char]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  213. def find(p: (Byte) ⇒ Boolean): Option[Byte]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  214. def find(p: (Boolean) ⇒ Boolean): Option[Boolean]

    Permalink

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    Finds the first element of the mutable indexed sequence satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable indexed sequence that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  215. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Unit) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Unit], B, That]): That

  216. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Short) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Short], B, That]): That

  217. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

  218. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Long) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Long], B, That]): That

  219. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Int) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Int], B, That]): That

  220. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Float) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Float], B, That]): That

  221. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Double) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Double], B, That]): That

  222. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Char) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Char], B, That]): That

  223. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Byte) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Byte], B, That]): That

  224. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Boolean) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Boolean], B, That]): That

  225. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this array and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of array. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That

  226. def flatten[U](implicit asTrav: (Unit) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    ArrayOps
  227. def flatten[U](implicit asTrav: (Short) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    ArrayOps
  228. def flatten[U](implicit asTrav: (Long) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    ArrayOps
  229. def flatten[U](implicit asTrav: (Int) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    ArrayOps
  230. def flatten[U](implicit asTrav: (Float) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    ArrayOps
  231. def flatten[U](implicit asTrav: (Double) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    ArrayOps
  232. def flatten[U](implicit asTrav: (Char) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    ArrayOps
  233. def flatten[U](implicit asTrav: (Byte) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    ArrayOps
  234. def flatten[U](implicit asTrav: (Boolean) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]

    Permalink

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    Flattens a two-dimensional array by concatenating all its rows into a single array.

    U

    Type of row elements.

    asTrav

    A function that converts elements of this array to rows - arrays of type U.

    returns

    An array obtained by concatenating rows of this array.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    ArrayOps
  235. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableOnceGenTraversableOnce
  236. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableOnceGenTraversableOnce
  237. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofRef[T] performed by method _refArrayOps in scala.Predef. This conversion will take place only if T is a subclass of AnyRef (T <: AnyRef).
    Definition Classes
    TraversableOnceGenTraversableOnce
  238. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableOnceGenTraversableOnce
  239. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableOnceGenTraversableOnce
  240. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableOnceGenTraversableOnce
  241. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableOnceGenTraversableOnce
  242. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableOnceGenTraversableOnce
  243. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableOnceGenTraversableOnce
  244. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableOnceGenTraversableOnce
  245. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink

    Folds the elements of this mutable indexed sequence using the specified associative binary operator.

    Folds the elements of this mutable indexed sequence 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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ArrayOps[T] performed by method genericArrayOps in scala.Predef.
    Definition Classes
    TraversableOnceGenTraversableOnce
  246. def foldLeft[B](z: B)(op: (B, Unit) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  247. def foldLeft[B](z: B)(op: (B, Short) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  248. def foldLeft[B](z: B)(op: (B, Long) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  249. def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  250. def foldLeft[B](z: B)(op: (B, Float) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  251. def foldLeft[B](z: B)(op: (B, Double) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  252. def foldLeft[B](z: B)(op: (B, Char) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  253. def foldLeft[B](z: B)(op: (B, Byte) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  254. def foldLeft[B](z: B)(op: (B, Boolean) ⇒ B): B

    Permalink

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, going left to right.

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  255. def foldRight[B](z: B)(op: (Unit, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  256. def foldRight[B](z: B)(op: (Short, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  257. def foldRight[B](z: B)(op: (Long, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  258. def foldRight[B](z: B)(op: (Int, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  259. def foldRight[B](z: B)(op: (Float, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  260. def foldRight[B](z: B)(op: (Double, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  261. def foldRight[B](z: B)(op: (Char, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  262. def foldRight[B](z: B)(op: (Byte, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  263. def foldRight[B](z: B)(op: (Boolean, B) ⇒ B): B

    Permalink

    Applies a binary operator to all elements of this mutable indexed sequence and a start value, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this mutable indexed sequence.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  264. def forall(p: (Unit) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  265. def forall(p: (Short) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  266. def forall(p: (Long) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  267. def forall(p: (Int) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  268. def forall(p: (Float) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  269. def forall(p: (Double) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  270. def forall(p: (Char) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  271. def forall(p: (Byte) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  272. def forall(p: (Boolean) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    Tests whether a predicate holds for all elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

    true if this mutable indexed sequence is empty, otherwise true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  273. def formatted(fmtstr: String): String

    Permalink

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit information
    This member is added by an implicit conversion from Array[T] to StringFormat[Array[T]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  274. final def getClass(): Class[_]

    Permalink

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes
    AnyRef → Any
  275. def groupBy[K](f: (Unit) ⇒ K): Map[K, Array[Unit]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    TraversableLikeGenTraversableLike
  276. def groupBy[K](f: (Short) ⇒ K): Map[K, Array[Short]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    TraversableLikeGenTraversableLike
  277. def groupBy[K](f: (Long) ⇒ K): Map[K, Array[Long]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    TraversableLikeGenTraversableLike
  278. def groupBy[K](f: (Int) ⇒ K): Map[K, Array[Int]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    TraversableLikeGenTraversableLike
  279. def groupBy[K](f: (Float) ⇒ K): Map[K, Array[Float]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    TraversableLikeGenTraversableLike
  280. def groupBy[K](f: (Double) ⇒ K): Map[K, Array[Double]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    TraversableLikeGenTraversableLike
  281. def groupBy[K](f: (Char) ⇒ K): Map[K, Array[Char]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    TraversableLikeGenTraversableLike
  282. def groupBy[K](f: (Byte) ⇒ K): Map[K, Array[Byte]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    TraversableLikeGenTraversableLike
  283. def groupBy[K](f: (Boolean) ⇒ K): Map[K, Array[Boolean]]

    Permalink

    Partitions this mutable indexed sequence into a map of mutable indexed sequences according to some discriminator function.

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    TraversableLikeGenTraversableLike
  284. def hashCode(): Int

    Permalink

    The hashCode method for reference types.

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

    returns

    the hash code value for this object.

    Definition Classes
    AnyRef → Any
  285. def indexOf(elem: Unit, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  286. def indexOf(elem: Unit): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofUnit performed by method _unitArrayOps in scala.Predef. This conversion will take place only if T is Unit (T =:= Unit).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  287. def indexOf(elem: Short, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  288. def indexOf(elem: Short): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofShort performed by method _shortArrayOps in scala.Predef. This conversion will take place only if T is Short (T =:= Short).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  289. def indexOf(elem: Long, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  290. def indexOf(elem: Long): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofLong performed by method _longArrayOps in scala.Predef. This conversion will take place only if T is Long (T =:= Long).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  291. def indexOf(elem: Int, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  292. def indexOf(elem: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofInt performed by method _intArrayOps in scala.Predef. This conversion will take place only if T is Int (T =:= Int).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  293. def indexOf(elem: Float, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  294. def indexOf(elem: Float): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofFloat performed by method _floatArrayOps in scala.Predef. This conversion will take place only if T is Float (T =:= Float).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  295. def indexOf(elem: Double, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  296. def indexOf(elem: Double): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofDouble performed by method _doubleArrayOps in scala.Predef. This conversion will take place only if T is Double (T =:= Double).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  297. def indexOf(elem: Char, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  298. def indexOf(elem: Char): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofChar performed by method _charArrayOps in scala.Predef. This conversion will take place only if T is Char (T =:= Char).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  299. def indexOf(elem: Byte, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  300. def indexOf(elem: Byte): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofByte performed by method _byteArrayOps in scala.Predef. This conversion will take place only if T is Byte (T =:= Byte).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  301. def indexOf(elem: Boolean, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this array after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from Array[T] to ofBoolean performed by method _booleanArrayOps in scala.Predef. This conversion will take place only if T is Boolean (T =:= Boolean).
    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  302. def indexOf(elem: Boolean): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this array.

    [use case]

    Finds index of first occurrence of some value in this array.

    elem

    the element value to search for.

    returns

    the index of the first element of this array that is equal (as determined by ==) to elem, or -1, if none exists.