Scala Standard Library 2.13.16 - scala.collection.immutable.ArraySeq.ofRef
Keywords: Scala Standard Library 2.13.16 scala.collection.immutable.ArraySeq.ofRef

Scala Standard Library2.13.16 < Back


# Packages

-  package root

  This is the documentation for the Scala standard library.

  This is the documentation for the Scala standard library.

  #### Package structure

  The scala package contains core types like `Int`, `Float`, `Array` or `Option` which are accessible in all Scala compilation units without explicit qualification or imports.

  Notable packages include:

  - `scala.collection` and its sub-packages contain Scala's collections framework
    - `scala.collection.immutable` - Immutable, sequential data-structures such as `Vector`, `List`, `Range`, `HashMap` or `HashSet`
    - `scala.collection.mutable` - Mutable, sequential data-structures such as `ArrayBuffer`, `StringBuilder`, `HashMap` or `HashSet`
    - `scala.collection.concurrent` - Mutable, concurrent data-structures such as `TrieMap`
  - `scala.concurrent` - Primitives for concurrent programming such as `Futures` and `Promises`
  - `scala.io` - Input and output operations
  - `scala.math` - Basic math functions and additional numeric types like `BigInt` and `BigDecimal`
  - `scala.sys` - Interaction with other processes and the operating system
  - `scala.util.matching` - Regular expressions

  Other packages exist. See the complete list on the right.

  Additional parts of the standard library are shipped as separate libraries. These include:

  - `scala.reflect` - Scala's reflection API (scala-reflect.jar)
  - `scala.xml` - XML parsing, manipulation, and serialization (scala-xml.jar)
  - `scala.collection.parallel` - Parallel collections (scala-parallel-collections.jar)
  - `scala.util.parsing` - Parser combinators (scala-parser-combinators.jar)
  - `scala.swing` - A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)

  #### Automatic imports

  Identifiers in the scala package and the `scala.Predef` object are always in scope by default.

  Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example, `List` is an alias for `scala.collection.immutable.List`.

  Other aliases refer to classes provided by the underlying platform. For example, on the JVM, `String` is an alias for `java.lang.String`.

  Definition Classes
    root
-  package scala

  Core Scala types.

  Core Scala types. They are always available without an explicit import.

  Definition Classes
    root
-  package collection
  Definition Classes
    scala
-  package immutable
  Definition Classes
    collection
-  object ArraySeq extends StrictOptimizedClassTagSeqFactory[ArraySeq]

  This object provides a set of operations to create `ArraySeq` values.

  This object provides a set of operations to create `ArraySeq` values.

  Definition Classes
    immutable
  Annotations
    @SerialVersionUID()
- ofBoolean
- ofByte
- ofChar
- ofDouble
- ofFloat
- ofInt
- ofLong
- ofRef
- ofShort
- ofUnit

c

scala.collection.immutable.ArraySeq

# ofRef

###

#### final class ofRef[T <: AnyRef] extends ArraySeq[T]

Annotations
  @SerialVersionUID()
Source
  ArraySeq.scala

Linear Supertypes
ArraySeq[T], java.io.Serializable, EvidenceIterableFactoryDefaults[T, ArraySeq, ClassTag], StrictOptimizedSeqOps[T, ArraySeq, ArraySeq[T]], collection.StrictOptimizedSeqOps[T, ArraySeq, ArraySeq[T]], StrictOptimizedIterableOps[T, ArraySeq, ArraySeq[T]], IndexedSeq[T], IndexedSeqOps[T, [_]ArraySeq[_], ArraySeq[T]], collection.IndexedSeq[T], collection.IndexedSeqOps[T, [_]ArraySeq[_], ArraySeq[T]], AbstractSeq[T], Seq[T], SeqOps[T, [_]ArraySeq[_], ArraySeq[T]], Iterable[T], collection.AbstractSeq[T], collection.Seq[T], Equals, collection.SeqOps[T, [_]ArraySeq[_], ArraySeq[T]], PartialFunction[Int, T], (Int) => T, AbstractIterable[T], collection.Iterable[T], IterableFactoryDefaults[T, [x]IndexedSeq[x]], IterableOps[T, [_]ArraySeq[_], ArraySeq[T]], IterableOnceOps[T, [_]ArraySeq[_], ArraySeq[T]], IterableOnce[T], AnyRef, Any
Type Hierarchy

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. ofRef
2. ArraySeq
3. Serializable
4. EvidenceIterableFactoryDefaults
5. StrictOptimizedSeqOps
6. StrictOptimizedSeqOps
7. StrictOptimizedIterableOps
8. IndexedSeq
9. IndexedSeqOps
10. IndexedSeq
11. IndexedSeqOps
12. AbstractSeq
13. Seq
14. SeqOps
15. Iterable
16. AbstractSeq
17. Seq
18. Equals
19. SeqOps
20. PartialFunction
21. Function1
22. AbstractIterable
23. Iterable
24. IterableFactoryDefaults
25. IterableOps
26. IterableOnceOps
27. IterableOnce
28. AnyRef
29. Any

Implicitly

1. by UnliftOps
2. by iterableOnceExtensionMethods
3. by any2stringadd
4. by StringFormat
5. by Ensuring
6. by ArrowAssoc

1. Hide All
2. Show All

Visibility

1. Public
2. Protected

### Instance Constructors

1.  new ofRef(unsafeArray: Array[T])

### Value Members

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

   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

   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
   Implicit
     This member is added by an implicit conversion from ofRef[T] toany2stringadd[ofRef[T]] performed by method any2stringadd in scala.Predef.
   Definition Classes
     any2stringadd
4.  final def ++[B >: T](suffix: IterableOnce[B]): ArraySeq[B]

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     IterableOps
   Annotations
     @inline()
5.  final def ++:[B >: T](prefix: IterableOnce[B]): ArraySeq[B]

   Alias for `prependedAll`.

   Alias for `prependedAll`.

   Definition Classes
     SeqOps → IterableOps
   Annotations
     @inline()
6.  final def +:[B >: T](elem: B): ArraySeq[B]

   Alias for `prepended`.

   Alias for `prepended`.

   Note that :-ending operators are right associative (see example). A mnemonic for `+:` vs. `:+` is: the COLon goes on the COLlection side.

   Definition Classes
     SeqOps
   Annotations
     @inline()
7.  def ->[B](y: B): (ofRef[T], B)
   Implicit
     This member is added by an implicit conversion from ofRef[T] toArrowAssoc[ofRef[T]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if T is a subclass of Option[Nothing] (T <: Option[Nothing]).
   Definition Classes
     ArrowAssoc
   Annotations
     @inline()
8.  final def :+[B >: T](elem: B): ArraySeq[B]

   Alias for `appended`.

   Alias for `appended`.

   Note that :-ending operators are right associative (see example). A mnemonic for `+:` vs. `:+` is: the COLon goes on the COLlection side.

   Definition Classes
     SeqOps
   Annotations
     @inline()
9.  final def :++[B >: T](suffix: IterableOnce[B]): ArraySeq[B]

   Alias for `appendedAll`.

   Alias for `appendedAll`.

   Definition Classes
     SeqOps
   Annotations
     @inline()
10.  final def ==(arg0: Any): Boolean

    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
11.  final def addString(b: mutable.StringBuilder): b.type

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

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

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

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

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

    b

      the string builder to which elements are appended.

    returns

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

    Definition Classes
      IterableOnceOps
    Annotations
      @inline()
12.  final def addString(b: mutable.StringBuilder, sep: String): b.type

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

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

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

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

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

    b

      the string builder to which elements are appended.

    sep

      the separator string.

    returns

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

    Definition Classes
      IterableOnceOps
    Annotations
      @inline()
13.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type

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

    Appends all elements of this immutable array to a string builder using start, end, and separator strings. The written text begins with the string `start` and ends with the string `end`. Inside, the string representations (w.r.t. the method `toString`) of all elements of this immutable array are separated by the string `sep`.

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

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

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

    b

      the string builder to which elements are appended.

    start

      the starting string.

    sep

      the separator string.

    end

      the ending string.

    returns

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

    Definition Classes
      IterableOnceOps
14.  def andThen[C](k: PartialFunction[T, C]): PartialFunction[Int, C]

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

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

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. For efficiency, it is recommended to call applyOrElse instead of isDefinedAt or apply.

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

      a partial function with the domain of this partial function narrowed by other partial function, which maps arguments `x` to `k(this(x))`.

    Definition Classes
      PartialFunction
15.  def andThen[C](k: (T) => C): PartialFunction[Int, C]

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

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

    If the runtime type of the function is a `PartialFunction` then the other `andThen` method is used (note its cautions).

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

      a partial function with the domain of this partial function, possibly narrowed by the specified function, which maps arguments `x` to `k(this(x))`.

    Definition Classes
      PartialFunction → Function1
16.  def appended[B >: T](elem: B): ArraySeq[B]

    A copy of this immutable array with an element appended.

    A copy of this immutable array with an element appended.

    Note: will not terminate for infinite-sized collections.

    Example:

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

        scala> val b = a :+ 2
        b: List[Int] = List(1, 2)

        scala> println(a)
        List(1)

    B

      the element type of the returned immutable array.

    elem

      the appended element

    returns

      a new immutable array consisting of all elements of this immutable array followed by `value`.

    Definition Classes
      ArraySeq → StrictOptimizedSeqOps → SeqOps
17.  def appendedAll[B >: T](suffix: IterableOnce[B]): ArraySeq[B]

    Returns a new immutable array containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    B

      the element type of the returned collection.

    suffix

      the iterable to append.

    returns

      a new collection of type `CC[B]` which contains all elements of this immutable array followed by all elements of `suffix`.

    Definition Classes
      ArraySeq → StrictOptimizedSeqOps → SeqOps
18.  def apply(i: Int): T

    Gets the element at the specified index.

    Gets the element at the specified index. This operation is provided for convenience in `Seq`. It should not be assumed to be efficient unless you have an `IndexedSeq`.

    Definition Classes
      ofRef → ArraySeq → SeqOps → Function1
    Annotations
      @throws(cause = scala.this.throws.<init>$default$1[ArrayIndexOutOfBoundsException])
19.  def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) => B1): B1

    Applies this partial function to the given argument when it is contained in the function domain.

    Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.

    Note that expression `pf.applyOrElse(x, default)` is equivalent to

        if(pf isDefinedAt x) pf(x) else default(x)

    except that `applyOrElse` method can be implemented more efficiently. For all partial function literals the compiler generates an `applyOrElse` implementation which avoids double evaluation of pattern matchers and guards. This makes `applyOrElse` the basis for the efficient implementation for many operations and scenarios, such as:

    - combining partial functions into `orElse`/`andThen` chains does not lead to excessive `apply`/`isDefinedAt` evaluation
    - `lift` and `unlift` do not evaluate source functions twice on each invocation
    - `runWith` allows efficient imperative-style combining of partial functions with conditionally applied actions

    For non-literal partial function classes with nontrivial `isDefinedAt` method it is recommended to override `applyOrElse` with custom implementation that avoids double `isDefinedAt` evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.

    x

      the function argument

    default

      the fallback function

    returns

      the result of this function or fallback function application.

    Definition Classes
      PartialFunction
20.  final def applyPreferredMaxLength: Int

    a hint to the runtime when scanning values apply is preferred for scan with a max index less than this value iterator is preferred for scans above this range

    a hint to the runtime when scanning values apply is preferred for scan with a max index less than this value iterator is preferred for scans above this range

    returns

      a hint about when to use apply or iterator

    Attributes
      protected
    Definition Classes
      ArraySeq → IndexedSeq
21.  final def asInstanceOf[T0]: T0

    Forces the compiler to treat the receiver object as having type `T0`, even though doing so may violate type safety.

    Forces the compiler to treat the receiver object as having type `T0`, even though doing so may violate type safety.

    This method is useful when you believe you have type information the compiler doesn't, and it also isn't possible to check the type at runtime. In such situations, skipping type safety is the only option.

    It is platform dependent whether `asInstanceOf` has any effect at runtime. It might do a runtime type test on the erasure of `T0`, insert a conversion (such as boxing/unboxing), fill in a default value, or do nothing at all.

    In particular, `asInstanceOf` is not a type test. It does **not** mean:

        this match {
         case x: T0 => x
         case _     => throw ClassCastException("...")

    Use pattern matching or isInstanceOf for type testing instead.

    Situations where `asInstanceOf` is useful:

    - when flow analysis fails to deduce `T0` automatically
    - when down-casting a type parameter or an abstract type member (which cannot be checked at runtime due to type erasure) If there is any doubt and you are able to type test instead, you should do so.

    Be careful of using `asInstanceOf` when `T0` is a primitive type. When `T0` is primitive, `asInstanceOf` may insert a conversion instead of a type test. If your intent is to convert, use a `toT` method (`x.toChar`, `x.toByte`, etc.).

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown

      `ClassCastException` if the receiver is not an instance of the erasure of `T0`, if that can be checked on this platform

22.  def canEqual(that: Any): Boolean

    Checks whether this instance can possibly equal `that`.

    Checks whether this instance can possibly equal `that`.

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

    that

      the value being probed for possible equality

    returns

      true if this instance can possibly equal `that`, otherwise false

    Definition Classes
      IndexedSeq → Seq → Equals
23.  def className: String

    Defines the prefix of this object's `toString` representation.

    Defines the prefix of this object's `toString` representation.

    It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for `ListMap` this method should return `"ListMap"`, not `"Map"` (the supertype) or `"Node"` (an implementation subclass).

    The default implementation returns "Iterable". It is overridden for the basic collection kinds "Seq", "IndexedSeq", "LinearSeq", "Buffer", "Set", "Map", "SortedSet", "SortedMap" and "View".

    returns

      a string representation which starts the result of `toString` applied to this immutable array. By default the string prefix is the simple name of the collection class immutable array.

    Attributes
      protected[this]
    Definition Classes
      ArraySeq → Iterable
24.  def clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws(classOf[java.lang.CloneNotSupportedException]) @native()
    Note

      not specified by SLS as a member of AnyRef

25.  final def coll: ofRef.this.type

    returns

      This collection as a `C`.

    Attributes
      protected
    Definition Classes
      Iterable → IterableOps
26.  def collect[B](pf: PartialFunction[T, B]): ArraySeq[B]

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

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

    B

      the element type of the returned immutable array.

    pf

      the partial function which filters and maps the immutable array.

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
27.  def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

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

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

    Note: may not terminate for infinite-sized collections.

    pf

      the partial function

    returns

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

    Definition Classes
      IterableOnceOps
    Example:

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

28.  def combinations(n: Int): Iterator[ArraySeq[T]]

    Iterates over combinations of elements.

    Iterates over combinations of elements.

    A combination of length `n` is a sequence of `n` elements selected in order of their first index in this sequence.

    For example, `"xyx"` has two combinations of length 2. The `x` is selected first: `"xx"`, `"xy"`. The sequence `"yx"` is not returned as a combination because it is subsumed by `"xy"`.

    If there is more than one way to generate the same combination, only one will be returned.

    For example, the result `"xy"` arbitrarily selected one of the `x` elements.

    As a further illustration, `"xyxx"` has three different ways to generate `"xy"` because there are three elements `x` to choose from. Moreover, there are three unordered pairs `"xx"` but only one is returned.

    It is not specified which of these equal combinations is returned. It is an implementation detail that should not be relied on. For example, the combination `"xx"` does not necessarily contain the first `x` in this sequence. This behavior is observable if the elements compare equal but are not identical.

    As a consequence, `"xyx".combinations(3).next()` is `"xxy"`: the combination does not reflect the order of the original sequence, but the order in which elements were selected, by "first index"; the order of each `x` element is also arbitrary.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

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

    Definition Classes
      SeqOps
    Example:

    1.     Seq('a', 'b', 'b', 'b', 'c').combinations(2).foreach(println)
           // List(a, b)
           // List(a, c)
           // List(b, b)
           // List(b, c)
           Seq('b', 'a', 'b').combinations(2).foreach(println)
           // List(b, b)
           // List(b, a)

29.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, T]

    Composes another partial function `k` with this partial function so that this partial function gets applied to results of `k`.

    Composes another partial function `k` with this partial function so that this partial function gets applied to results of `k`.

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. For efficiency, it is recommended to call applyOrElse instead of isDefinedAt or apply.

    R

      the parameter type of the transformation function.

    k

      the transformation function

    returns

      a partial function with the domain of other partial function narrowed by this partial function, which maps arguments `x` to `this(k(x))`.

    Definition Classes
      PartialFunction
30.  def compose[A](g: (A) => Int): (A) => T

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

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

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

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

    Definition Classes
      Function1
    Annotations
      @unspecialized()
31.  final def concat[B >: T](suffix: IterableOnce[B]): ArraySeq[B]

    Returns a new immutable array containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    B

      the element type of the returned collection.

    suffix

      the iterable to append.

    returns

      a new immutable array which contains all elements of this immutable array followed by all elements of `suffix`.

    Definition Classes
      SeqOps → IterableOps
    Annotations
      @inline()
32.  def contains[A1 >: T](elem: A1): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    elem

      the element to test.

    returns

      `true` if this immutable array has an element that is equal (as determined by `==`) to `elem`, `false` otherwise.

    Definition Classes
      SeqOps
33.  def containsSlice[B >: T](that: collection.Seq[B]): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqOps
34.  def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with at most `len` elements of this immutable array.

    Copying will stop once either all the elements of this immutable array have been copied, or the end of the array is reached, or `len` elements have been copied.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index of xs.

    len

      the maximal number of elements to copy.

    returns

      the number of elements written to the array

    Definition Classes
      ArraySeq → IterableOnceOps
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

35.  def copyToArray[B >: T](xs: Array[B], start: Int): Int

    Copies elements to an array, returning the number of elements written.

    Copies elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with values of this immutable array.

    Copying will stop once either all the elements of this immutable array have been copied, or the end of the array is reached.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index of xs.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

36.  def copyToArray[B >: T](xs: Array[B]): Int

    Copies elements to an array, returning the number of elements written.

    Copies elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with values of this immutable array.

    Copying will stop once either all the elements of this immutable array have been copied, or the end of the array is reached.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

37.  def corresponds[B](that: collection.Seq[B])(p: (T, B) => Boolean): Boolean

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

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

    B

      the type of the elements of `that`

    that

      the other sequence

    p

      the test predicate, which relates elements from both sequences

    returns

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

    Definition Classes
      SeqOps
38.  def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Note: will not terminate for infinite-sized collections.

    B

      the type of the elements of `that`

    that

      the other collection

    p

      the test predicate, which relates elements from both collections

    returns

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

    Definition Classes
      IterableOnceOps
39.  def count(p: (T) => Boolean): Int

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

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

    Note: will not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      IterableOnceOps
40.  def diff[B >: T](that: collection.Seq[B]): ArraySeq[T]

    Computes the multiset difference between this immutable array and another sequence.

    Computes the multiset difference between this immutable array and another sequence.

    that

      the sequence of elements to remove

    returns

      a new immutable array which contains all elements of this immutable array except some of occurrences of elements that also appear in `that`. If an element value `x` appears n times in `that`, then the first n occurrences of `x` will not form part of the result, but any following occurrences will.

    Definition Classes
      StrictOptimizedSeqOps → SeqOps
41.  def distinct: ArraySeq[T]

    Selects all the elements of this immutable array ignoring the duplicates.

    Selects all the elements of this immutable array ignoring the duplicates.

    returns

      a new immutable array consisting of all the elements of this immutable array without duplicates.

    Definition Classes
      SeqOps
42.  def distinctBy[B](f: (T) => B): ArraySeq[T]

    Selects all the elements of this immutable array ignoring the duplicates as determined by `==` after applying the transforming function `f`.

    Selects all the elements of this immutable array ignoring the duplicates as determined by `==` after applying the transforming function `f`.

    B

      the type of the elements after being transformed by `f`

    f

      The transforming function whose result is used to determine the uniqueness of each element

    returns

      a new immutable array consisting of all the elements of this immutable array without duplicates.

    Definition Classes
      StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
43.  def drop(n: Int): ArraySeq[T]

    Selects all elements except the first `n` ones.

    Selects all elements except the first `n` ones.

    n

      the number of elements to drop from this immutable array.

    returns

      a immutable array consisting of all elements of this immutable array except the first `n` ones, or else the empty immutable array, if this immutable array has less than `n` elements. If `n` is negative, don't drop any elements.

    Definition Classes
      ArraySeq → IndexedSeqOps → IterableOps → IterableOnceOps
44.  def dropRight(n: Int): ArraySeq[T]

    The rest of the collection without its `n` last elements.

    The rest of the collection without its `n` last elements. For linear, immutable collections this should avoid making a copy.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    n

      the number of elements to drop from this immutable array.

    returns

      a immutable array consisting of all elements of this immutable array except the last `n` ones, or else the empty immutable array, if this immutable array has less than `n` elements. If `n` is negative, don't drop any elements.

    Definition Classes
      ArraySeq → StrictOptimizedIterableOps → IndexedSeqOps → IterableOps
45.  def dropWhile(p: (T) => Boolean): ArraySeq[T]

    Selects all elements except the longest prefix that satisfies a predicate.

    Selects all elements except the longest prefix that satisfies a predicate.

    The matching prefix starts with the first element of this immutable array, and the element following the prefix is the first element that does not satisfy the predicate. The matching prefix may be empty, so that this method returns the entire immutable array.

    Example:

        scala> List(1, 2, 3, 100, 4).dropWhile(n => n < 10)
        val res0: List[Int] = List(100, 4)

        scala> List(1, 2, 3, 100, 4).dropWhile(n => n == 0)
        val res1: List[Int] = List(1, 2, 3, 100, 4)

    Use span to obtain both the prefix and suffix. Use filterNot to drop all elements that satisfy the predicate.

    p

      The predicate used to test elements.

    returns

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

    Definition Classes
      IterableOps → IterableOnceOps
46.  def elemTag: ClassTag[T]

    The tag of the element type.

    The tag of the element type. This does not have to be equal to the element type of this ArraySeq. A primitive ArraySeq can be backed by an array of boxed values and a reference ArraySeq can be backed by an array of a supertype or subtype of the element type.

    Definition Classes
      ofRef → ArraySeq
47.  def elementWise: ElementWiseExtractor[Int, T]

    Returns an extractor object with a `unapplySeq` method, which extracts each element of a sequence data.

    Returns an extractor object with a `unapplySeq` method, which extracts each element of a sequence data.

    Definition Classes
      PartialFunction
    Example:

    1.     val firstChar: String => Option[Char] = _.headOption

           Seq("foo", "bar", "baz") match {
             case firstChar.unlift.elementWise(c0, c1, c2) =>
               println(s"$c0, $c1, $c2") // Output: f, b, b
           }

48.  def empty: ArraySeq[T]

    The empty iterable of the same type as this iterable.

    The empty iterable of the same type as this iterable.

    returns

      an empty iterable of type `C`.

    Definition Classes
      EvidenceIterableFactoryDefaults → IterableOps
49.  def endsWith[B >: T](that: collection.Iterable[B]): Boolean

    Tests whether this immutable array ends with the given sequence.

    Tests whether this immutable array ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqOps
50.  def ensuring(cond: (ofRef[T]) => Boolean, msg: => Any): ofRef[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toEnsuring[ofRef[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
51.  def ensuring(cond: (ofRef[T]) => Boolean): ofRef[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toEnsuring[ofRef[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
52.  def ensuring(cond: Boolean, msg: => Any): ofRef[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toEnsuring[ofRef[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
53.  def ensuring(cond: Boolean): ofRef[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toEnsuring[ofRef[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
54.  final def eq(arg0: AnyRef): Boolean

    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
55.  def equals(that: Any): Boolean

    Checks whether this instance is equal to `that`.

    Checks whether this instance is equal to `that`. This universal equality method is defined in `AnyRef`.

    Definition Classes
      ofRef → Seq → Equals → AnyRef → Any
56.  def evidenceIterableFactory: ArraySeq.type
    Attributes
      protected
    Definition Classes
      ArraySeq → EvidenceIterableFactoryDefaults
57.  def exists(p: (T) => Boolean): Boolean

    Tests whether a predicate holds for at least one element of this immutable array.

    Tests whether a predicate holds for at least one element of this immutable array.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      `true` if the given predicate `p` is satisfied by at least one element of this immutable array, otherwise `false`

    Definition Classes
      IterableOnceOps
58.  def filter(pred: (T) => Boolean): ArraySeq[T]

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

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

    returns

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

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
59.  def filterImpl(pred: (T) => Boolean, isFlipped: Boolean): ArraySeq[T]
    Attributes
      protected[collection]
    Definition Classes
      StrictOptimizedIterableOps
60.  def filterNot(pred: (T) => Boolean): ArraySeq[T]

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

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

    pred

      the predicate used to test elements.

    returns

      a new immutable array consisting of all elements of this immutable array that do not satisfy the given predicate `pred`. Their order may not be preserved.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
61.  def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the `finalize` method is invoked, as well as the interaction between `finalize` and non-local returns and exceptions, are all platform dependent.

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws(classOf[java.lang.Throwable])
    Note

      not specified by SLS as a member of AnyRef

62.  def find(p: (T) => Boolean): Option[T]

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableOnceOps
63.  def findLast(p: (T) => Boolean): Option[T]

    Finds the last element of the immutable array satisfying a predicate, if any.

    Finds the last element of the immutable array satisfying a predicate, if any.

    Note: will not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      SeqOps
64.  def flatMap[B](f: (T) => IterableOnce[B]): ArraySeq[B]

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

    Builds a new immutable array by applying a function to all elements of this immutable 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 immutable 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: String) => 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 immutable array resulting from applying the given collection-valued function `f` to each element of this immutable array and concatenating the results.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
65.  def flatten[B](implicit toIterableOnce: (T) => IterableOnce[B]): ArraySeq[B]

    Converts this immutable array of iterable collections into a immutable array formed by the elements of these iterable collections.

    Converts this immutable array of iterable collections into a immutable array formed by the elements of these iterable collections.

    The resulting collection's type will be guided by the type of immutable array. For example:

        val xs = List(
                   Set(1, 2, 3),
                   Set(1, 2, 3)
                 ).flatten
        // xs == List(1, 2, 3, 1, 2, 3)

        val ys = Set(
                   List(1, 2, 3),
                   List(3, 2, 1)
                 ).flatten
        // ys == Set(1, 2, 3)

    B

      the type of the elements of each iterable collection.

    returns

      a new immutable array resulting from concatenating all element immutable arrays.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
66.  def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1

    Applies the given binary operator `op` to the given initial value `z` and all elements of this immutable array.

    Applies the given binary operator `op` to the given initial value `z` and all elements of this immutable array.

    For each application of the operator, each operand is either an element of this immutable array, the initial value, or another such application of the operator.

    The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation. The initial value may be used an arbitrary number of times, but at least once.

    If this collection is ordered, then for any application of the operator, the element(s) appearing in the left operand will precede those in the right.

    Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative. In either case, it is also necessary that the initial value be a neutral value for the operator, e.g. `Nil` for `List` concatenation or `1` for multiplication.

    The default implementation in `IterableOnce` is equivalent to `foldLeft` but may be overridden for more efficient traversal orders.

    Note: will not terminate for infinite-sized collections.

    A1

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

    z

      An initial value; may be used an arbitrary number of times in the computation of the result; must be a neutral value for `op` for the result to always be the same across runs.

    op

      A binary operator; must be associative for the result to always be the same across runs.

    returns

      The result of applying `op` between all the elements and `z`, or `z` if this immutable array is empty.

    Definition Classes
      IterableOnceOps
67.  def foldLeft[B](z: B)(f: (B, T) => B): B

    Applies the given binary operator `op` to the given initial value `z` and all elements of this immutable array, going left to right.

    Applies the given binary operator `op` to the given initial value `z` and all elements of this immutable array, going left to right. Returns the initial value if this immutable array is empty.

    "Going left to right" only makes sense if this collection is ordered: then if `x1`, `x2`, ..., `xn` are the elements of this immutable array, the result is `op( op( ... op( op(z, x1), x2) ... ), xn)`.

    If this collection is not ordered, then for each application of the operator, each right operand is an element. In addition, the leftmost operand is the initial value, and each other left operand is itself an application of the operator. The elements of this immutable array and the initial value all appear exactly once in the computation.

    Note: will not terminate for infinite-sized collections.

    B

      The result type of the binary operator.

    z

      An initial value.

    returns

      The result of applying `op` to `z` and all elements of this immutable array, going left to right. Returns `z` if this immutable array is empty.

    Definition Classes
      ArraySeq → IterableOnceOps
68.  def foldRight[B](z: B)(f: (T, B) => B): B

    Applies the given binary operator `op` to all elements of this immutable array and the given initial value `z`, going right to left.

    Applies the given binary operator `op` to all elements of this immutable array and the given initial value `z`, going right to left. Returns the initial value if this immutable array is empty.

    "Going right to left" only makes sense if this collection is ordered: then if `x1`, `x2`, ..., `xn` are the elements of this immutable array, the result is `op(x1, op(x2, op( ... op(xn, z) ... )))`.

    If this collection is not ordered, then for each application of the operator, each left operand is an element. In addition, the rightmost operand is the initial value, and each other right operand is itself an application of the operator. The elements of this immutable array and the initial value all appear exactly once in the computation.

    Note: will not terminate for infinite-sized collections.

    B

      The result type of the binary operator.

    z

      An initial value.

    returns

      The result of applying `op` to all elements of this immutable array and `z`, going right to left. Returns `z` if this immutable array is empty.

    Definition Classes
      ArraySeq → IndexedSeqOps → IterableOnceOps
69.  def forall(p: (T) => Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      `true` if this immutable array is empty or the given predicate `p` holds for all elements of this immutable array, otherwise `false`.

    Definition Classes
      IterableOnceOps
70.  def foreach[U](f: (T) => U): Unit

    Applies `f` to each element for its side effects.

    Applies `f` to each element for its side effects. Note: `U` parameter needed to help scalac's type inference.

    Definition Classes
      IterableOnceOps
71.  def fromSpecific(coll: IterableOnce[T]): ArraySeq[T]

    Defines how to turn a given `Iterable[A]` into a collection of type `C`.

    Defines how to turn a given `Iterable[A]` into a collection of type `C`.

    This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.

    Attributes
      protected
    Definition Classes
      EvidenceIterableFactoryDefaults → IterableOps
    Note

      When implementing a custom collection type and refining `C` to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where `C =:= CC[A]`, this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

      ,

      As witnessed by the `@uncheckedVariance` annotation, using this method might be unsound. However, as long as it is called with an `Iterable[A]` obtained from `this` collection (as it is the case in the implementations of operations where we use a `View[A]`), it is safe.

72.  final def getClass(): Class[_ <: AnyRef]

    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
    Annotations
      @native()
73.  def groupBy[K](f: (T) => K): Map[K, ArraySeq[T]]

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

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

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

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

    Definition Classes
      IterableOps
74.  def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, ArraySeq[B]]

    Partitions this immutable array into a map of immutable arrays according to a discriminator function `key`.

    Partitions this immutable array into a map of immutable arrays according to a discriminator function `key`. Each element in a group is transformed into a value of type `B` using the `value` function.

    It is equivalent to `groupBy(key).mapValues(_.map(f))`, but more efficient.

        case class User(name: String, age: Int)

        def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
          users.groupMap(_.age)(_.name)

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    K

      the type of keys returned by the discriminator function

    B

      the type of values returned by the transformation function

    key

      the discriminator function

    f

      the element transformation function

    Definition Classes
      IterableOps
75.  def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]

    Partitions this immutable array into a map according to a discriminator function `key`.

    Partitions this immutable array into a map according to a discriminator function `key`. All the values that have the same discriminator are then transformed by the `f` function and then reduced into a single value with the `reduce` function.

    It is equivalent to `groupBy(key).mapValues(_.map(f).reduce(reduce))`, but more efficient.

        def occurrences[A](as: Seq[A]): Map[A, Int] =
          as.groupMapReduce(identity)(_ => 1)(_ + _)

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Definition Classes
      IterableOps
76.  def grouped(size: Int): Iterator[ArraySeq[T]]

    Partitions elements in fixed size immutable arrays.

    Partitions elements in fixed size immutable arrays.

    size

      the number of elements per group

    returns

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

    Definition Classes
      IterableOps
    See also

      scala.collection.Iterator, method `grouped`

77.  def hashCode(): Int

    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
      ofRef → Seq → AnyRef → Any
78.  def head: T

    Selects the first element of this immutable array.

    Selects the first element of this immutable array.

    returns

      the first element of this immutable array.

    Definition Classes
      IndexedSeqOps → IterableOps
    Exceptions thrown

      `NoSuchElementException` if the immutable array is empty.

79.  def headOption: Option[T]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    Definition Classes
      IndexedSeqOps → IterableOps
80.  def indexOf[B >: T](elem: B): Int

    Finds index of first occurrence of some value in this immutable array.

    Finds index of first occurrence of some value in this immutable array.

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    returns

      the index `>= 0` of the first element of this immutable array that is equal (as determined by `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      SeqOps
    Annotations
      @deprecatedOverriding()
81.  def indexOf[B >: T](elem: B, from: Int): Int

    Finds index of first occurrence of some value in this immutable array after or at some start index.

    Finds index of first occurrence of some value in this immutable array after or at some start index.

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    from

      the start index

    returns

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

    Definition Classes
      SeqOps
82.  def indexOfSlice[B >: T](that: collection.Seq[B]): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqOps
    Annotations
      @deprecatedOverriding()
83.  def indexOfSlice[B >: T](that: collection.Seq[B], from: Int): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    from

      the start index

    returns

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

    Definition Classes
      SeqOps
84.  def indexWhere(p: (T) => Boolean): Int

    Finds index of the first element satisfying some predicate.

    Finds index of the first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      SeqOps
    Annotations
      @deprecatedOverriding()
85.  def indexWhere(p: (T) => Boolean, from: Int): Int

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    from

      the start index

    returns

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

    Definition Classes
      SeqOps
86.  def indices: Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

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

    Definition Classes
      SeqOps
87.  def init: ArraySeq[T]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Definition Classes
      IterableOps
88.  def inits: Iterator[ArraySeq[T]]

    Iterates over the inits of this immutable array.

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

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

      an iterator over all the inits of this immutable array

    Definition Classes
      IterableOps
    Example:

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

89.  def intersect[B >: T](that: collection.Seq[B]): ArraySeq[T]

    Computes the multiset intersection between this immutable array and another sequence.

    Computes the multiset intersection between this immutable array and another sequence.

    that

      the sequence of elements to intersect with.

    returns

      a new immutable array which contains all elements of this immutable array which also appear in `that`. If an element value `x` appears n times in `that`, then the first n occurrences of `x` will be retained in the result, but any following occurrences will be omitted.

    Definition Classes
      StrictOptimizedSeqOps → SeqOps
90.  def isDefinedAt(idx: Int): Boolean

    Tests whether this immutable array contains given index.

    Tests whether this immutable array contains given index.

    The implementations of methods `apply` and `isDefinedAt` turn a `Seq[A]` into a `PartialFunction[Int, A]`.

    idx

      the index to test

    returns

      `true` if this immutable array contains an element at position `idx`, `false` otherwise.

    Definition Classes
      SeqOps
91.  def isEmpty: Boolean

    Tests whether the immutable array is empty.

    Tests whether the immutable array is empty.

    Note: The default implementation creates and discards an iterator.

    Note: Implementations in subclasses that are not repeatedly iterable must take care not to consume any elements when `isEmpty` is called.

    returns

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

    Definition Classes
      SeqOps → IterableOnceOps
92.  final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object has the same erasure as `T0`.

    Test whether the dynamic type of the receiver object has the same erasure as `T0`.

    Depending on what `T0` is, the test is done in one of the below ways:

    - `T0` is a non-parameterized class type, e.g. `BigDecimal`: this method returns `true` if the value of the receiver object is a `BigDecimal` or a subtype of `BigDecimal`.
    - `T0` is a parameterized class type, e.g. `List[Int]`: this method returns `true` if the value of the receiver object is some `List[X]` for any `X`. For example, `List(1, 2, 3).isInstanceOf[List[String]]` will return true.
    - `T0` is some singleton type `x.type` or literal `x`: this method returns `this.eq(x)`. For example, `x.isInstanceOf[1]` is equivalent to `x.eq(1)`
    - `T0` is an intersection `X with Y` or `X & Y: this method is equivalent to` x.isInstanceOf[X] && x.isInstanceOf[Y]``
    - `T0` is a union `X | Y`: this method is equivalent to `x.isInstanceOf[X] || x.isInstanceOf[Y]`
    - `T0` is a type parameter or an abstract type member: this method is equivalent to `isInstanceOf[U]` where `U` is `T0`'s upper bound, `Any` if `T0` is unbounded. For example, `x.isInstanceOf[A]` where `A` is an unbounded type parameter will return true for any value of `x`.

    This is exactly equivalent to the type pattern `_: T0`

    returns

      `true` if the receiver object is an instance of erasure of type `T0`; `false` otherwise.

    Definition Classes
      Any
    Note

      due to the unexpectedness of `List(1, 2, 3).isInstanceOf[List[String]]` returning true and `x.isInstanceOf[A]` where `A` is a type parameter or abstract member returning true, these forms issue a warning.

93.  def isTraversableAgain: Boolean

    Tests whether this immutable array can be repeatedly traversed.

    Tests whether this immutable array can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.

    returns

      `true` if it is repeatedly traversable, `false` otherwise.

    Definition Classes
      IterableOps → IterableOnceOps
94.  def iterableEvidence: ClassTag[T]
    Attributes
      protected
    Definition Classes
      ArraySeq → EvidenceIterableFactoryDefaults
95.  def iterableFactory: SeqFactory[ArraySeq]

    The companion object of this immutable array, providing various factory methods.

    The companion object of this immutable array, providing various factory methods.

    Definition Classes
      ArraySeq → IndexedSeq → IndexedSeq → Seq → Iterable → Seq → Iterable → IterableOps
    Note

      When implementing a custom collection type and refining `CC` to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

96.  def iterator: Iterator[T]

    An scala.collection.Iterator over the elements of this immutable array.

    An scala.collection.Iterator over the elements of this immutable array.

    If an `IterableOnce` object is in fact an scala.collection.Iterator, this method always returns itself, in its current state, but if it is an scala.collection.Iterable, this method always returns a new scala.collection.Iterator.

    Definition Classes
      ofRef → IndexedSeqOps → IterableOnce
97.  def knownSize: Int

    The number of elements in this immutable array, if it can be cheaply computed, -1 otherwise.

    The number of elements in this immutable array, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

    Definition Classes
      IndexedSeqOps → IterableOnce
98.  def last: T

    Selects the last element.

    Selects the last element.

    returns

      The last element of this immutable array.

    Definition Classes
      IndexedSeqOps → IterableOps
    Exceptions thrown

      `NoSuchElementException` If the immutable array is empty.

99.  def lastIndexOf[B >: T](elem: B, end: Int = length - 1): Int

    Finds index of last occurrence of some value in this immutable array before or at a given end index.

    Finds index of last occurrence of some value in this immutable array before or at a given end index.

    Note: will not terminate for infinite-sized collections.

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    end

      the end index.

    returns

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

    Definition Classes
      SeqOps
100.  def lastIndexOfSlice[B >: T](that: collection.Seq[B]): Int

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

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

     Note: will not terminate for infinite-sized collections.

     that

       the sequence to test

     returns

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

     Definition Classes
       SeqOps
     Annotations
       @deprecatedOverriding()
101.  def lastIndexOfSlice[B >: T](that: collection.Seq[B], end: Int): Int

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

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

     Note: will not terminate for infinite-sized collections.

     that

       the sequence to test

     end

       the end index

     returns

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

     Definition Classes
       SeqOps
102.  def lastIndexWhere(p: (T) => Boolean): Int

     Finds index of last element satisfying some predicate.

     Finds index of last element satisfying some predicate.

     Note: will not terminate for infinite-sized collections.

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       SeqOps
     Annotations
       @deprecatedOverriding()
103.  def lastIndexWhere(p: (T) => Boolean, end: Int): Int

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

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

     Note: will not terminate for infinite-sized collections.

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       SeqOps
104.  def lastOption: Option[T]

     Optionally selects the last element.

     Optionally selects the last element.

     returns

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

     Definition Classes
       IterableOps
105.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[T, B, ofRef.this.type]

     Analogous to `zip` except that the elements in each collection are not consumed until a strict operation is invoked on the returned `LazyZip2` decorator.

     Analogous to `zip` except that the elements in each collection are not consumed until a strict operation is invoked on the returned `LazyZip2` decorator.

     Calls to `lazyZip` can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

         val xs = List(1, 2, 3)
         val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
         // res == List(4, 8, 12)

     B

       the type of the second element in each eventual pair

     that

       the iterable providing the second element of each eventual pair

     returns

       a decorator `LazyZip2` that allows strict operations to be performed on the lazily evaluated pairs or chained calls to `lazyZip`. Implicit conversion to `Iterable[(A, B)]` is also supported.

     Definition Classes
       Iterable
106.  def length: Int

     The length (number of elements) of the immutable array.

     The length (number of elements) of the immutable array. `size` is an alias for `length` in `Seq` collections.

     Definition Classes
       ofRef → SeqOps
107.  final def lengthCompare(that: collection.Iterable[_]): Int

     Compares the length of this immutable array to the size of another `Iterable`.

     Compares the length of this immutable array to the size of another `Iterable`.

     that

       the `Iterable` whose size is compared with this immutable array's length.

     returns

       A value `x` where

           x <  0       if this.length <  that.size
           x == 0       if this.length == that.size
           x >  0       if this.length >  that.size

       The method as implemented here does not call `length` or `size` directly; its running time is `O(this.length min that.size)` instead of `O(this.length + that.size)`. The method should be overridden if computing `size` is cheap and `knownSize` returns `-1`.

     Definition Classes
       IndexedSeqOps → SeqOps
108.  final def lengthCompare(len: Int): Int

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

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

     len

       the test value that gets compared with the length.

     returns

       A value `x` where

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

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

     Definition Classes
       IndexedSeqOps → SeqOps
     See also

       lengthIs

109.  final def lengthIs: SizeCompareOps

     Returns a value class containing operations for comparing the length of this immutable array to a test value.

     Returns a value class containing operations for comparing the length of this immutable array to a test value.

     These operations are implemented in terms of `lengthCompare(Int)`, and allow the following more readable usages:

         this.lengthIs < len     // this.lengthCompare(len) < 0
         this.lengthIs <= len    // this.lengthCompare(len) <= 0
         this.lengthIs == len    // this.lengthCompare(len) == 0
         this.lengthIs != len    // this.lengthCompare(len) != 0
         this.lengthIs >= len    // this.lengthCompare(len) >= 0
         this.lengthIs > len     // this.lengthCompare(len) > 0

     Definition Classes
       SeqOps
     Annotations
       @inline()
110.  def lift: (Int) => Option[T]

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

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

     returns

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

     Definition Classes
       PartialFunction
     See also

       Function.unlift

111.  def map[B](f: (T) => B): ArraySeq[B]

     Builds a new immutable array by applying a function to all elements of this immutable array.

     Builds a new immutable array by applying a function to all elements of this immutable array.

     B

       the element type of the returned immutable array.

     f

       the function to apply to each element.

     returns

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

     Definition Classes
       ArraySeq → StrictOptimizedIterableOps → IndexedSeqOps → IterableOps → IterableOnceOps
112.  def max[B >: T](implicit ord: math.Ordering[B]): T

     Finds the largest element.

     Finds the largest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       the largest element of this immutable array with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable array is empty.

113.  def maxBy[B](f: (T) => B)(implicit ord: math.Ordering[B]): T

     Finds the first element which yields the largest value measured by function `f`.

     Finds the first element which yields the largest value measured by function `f`.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the function `f`.

     f

       The measuring function.

     returns

       the first element of this immutable array with the largest value measured by function `f` with respect to the ordering `cmp`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable array is empty.

114.  def maxByOption[B](f: (T) => B)(implicit ord: math.Ordering[B]): Option[T]

     Finds the first element which yields the largest value measured by function `f`.

     Finds the first element which yields the largest value measured by function `f`.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the function `f`.

     f

       The measuring function.

     returns

       an option value containing the first element of this immutable array with the largest value measured by function `f` with respect to the ordering `cmp`.

     Definition Classes
       IterableOnceOps
115.  def maxOption[B >: T](implicit ord: math.Ordering[B]): Option[T]

     Finds the largest element.

     Finds the largest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       an option value containing the largest element of this immutable array with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
116.  def min[B >: T](implicit ord: math.Ordering[B]): T

     Finds the smallest element.

     Finds the smallest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       the smallest element of this immutable array with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable array is empty.

117.  def minBy[B](f: (T) => B)(implicit ord: math.Ordering[B]): T

     Finds the first element which yields the smallest value measured by function `f`.

     Finds the first element which yields the smallest value measured by function `f`.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the function `f`.

     f

       The measuring function.

     returns

       the first element of this immutable array with the smallest value measured by function `f` with respect to the ordering `cmp`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable array is empty.

118.  def minByOption[B](f: (T) => B)(implicit ord: math.Ordering[B]): Option[T]

     Finds the first element which yields the smallest value measured by function `f`.

     Finds the first element which yields the smallest value measured by function `f`.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the function `f`.

     f

       The measuring function.

     returns

       an option value containing the first element of this immutable array with the smallest value measured by function `f` with respect to the ordering `cmp`.

     Definition Classes
       IterableOnceOps
119.  def minOption[B >: T](implicit ord: math.Ordering[B]): Option[T]

     Finds the smallest element.

     Finds the smallest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       an option value containing the smallest element of this immutable array with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
120.  final def mkString: String

     Displays all elements of this immutable array in a string.

     Displays all elements of this immutable array in a string.

     Delegates to addString, which can be overridden.

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
121.  final def mkString(sep: String): String

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

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

     Delegates to addString, which can be overridden.

     sep

       the separator string.

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
     Example:

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

122.  final def mkString(start: String, sep: String, end: String): String

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

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

     Delegates to addString, which can be overridden.

     start

       the starting string.

     sep

       the separator string.

     end

       the ending string.

     returns

       a string representation of this immutable array. The resulting string begins with the string `start` and ends with the string `end`. Inside, the string representations (w.r.t. the method `toString`) of all elements of this immutable array are separated by the string `sep`.

     Definition Classes
       IterableOnceOps
     Example:

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

123.  final def ne(arg0: AnyRef): Boolean

     Equivalent to `!(this eq that)`.

     Equivalent to `!(this eq that)`.

     returns

       `true` if the argument is not a reference to the receiver object; `false` otherwise.

     Definition Classes
       AnyRef
124.  def newSpecificBuilder: Builder[T, ArraySeq[T]]

     returns

       a strict builder for the same collection type. Note that in the case of lazy collections (e.g. scala.collection.View or scala.collection.immutable.LazyList), it is possible to implement this method but the resulting `Builder` will break laziness. As a consequence, operations should preferably be implemented with `fromSpecific` instead of this method.

     Attributes
       protected
     Definition Classes
       EvidenceIterableFactoryDefaults → IterableOps
     Note

       When implementing a custom collection type and refining `C` to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where `C =:= CC[A]`, this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

       ,

       As witnessed by the `@uncheckedVariance` annotation, using this method might be unsound. However, as long as the returned builder is only fed with `A` values taken from `this` instance, it is safe.

125.  def nonEmpty: Boolean

     Tests whether the immutable array is not empty.

     Tests whether the immutable array is not empty.

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @deprecatedOverriding()
126.  final def notify(): Unit

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

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

     Definition Classes
       AnyRef
     Annotations
       @native()
     Note

       not specified by SLS as a member of AnyRef

127.  final def notifyAll(): Unit

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

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

     Definition Classes
       AnyRef
     Annotations
       @native()
     Note

       not specified by SLS as a member of AnyRef

128.  def occCounts[B](sq: collection.Seq[B]): mutable.Map[B, Int]
     Attributes
       protected[collection]
     Definition Classes
       SeqOps
129.  def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

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

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

     A1

       the argument type of the fallback function

     B1

       the result type of the fallback function

     that

       the fallback function

     returns

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

     Definition Classes
       PartialFunction
130.  def padTo[B >: T](len: Int, elem: B): ArraySeq[B]

     A copy of this immutable array with an element value appended until a given target length is reached.

     A copy of this immutable array with an element value appended until a given target length is reached.

     B

       the element type of the returned immutable array.

     len

       the target length

     elem

       the padding value

     returns

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

     Definition Classes
       StrictOptimizedSeqOps → SeqOps
131.  def partition(p: (T) => Boolean): (ArraySeq[T], ArraySeq[T])

     A pair of, first, all elements that satisfy predicate `p` and, second, all elements that do not.

     A pair of, first, all elements that satisfy predicate `p` and, second, all elements that do not.

     The two immutable array correspond to the result of filter and filterNot, respectively.

     The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of `partition` in `StrictOptimizedIterableOps`, which requires only a single traversal.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
132.  def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (ArraySeq[A1], ArraySeq[A2])

     Applies a function `f` to each element of the immutable array and returns a pair of immutable arrays: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

     Applies a function `f` to each element of the immutable array and returns a pair of immutable arrays: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

     Example:

         val xs = `ArraySeq`(1, "one", 2, "two", 3, "three") partitionMap {
          case i: Int => Left(i)
          case s: String => Right(s)
         }
         // xs == (`ArraySeq`(1, 2, 3),
         //        `ArraySeq`(one, two, three))

     A1

       the element type of the first resulting collection

     A2

       the element type of the second resulting collection

     f

       the 'split function' mapping the elements of this immutable array to an scala.util.Either

     returns

       a pair of immutable arrays: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
133.  def patch[B >: T](from: Int, other: IterableOnce[B], replaced: Int): ArraySeq[B]

     Produces a new immutable array where a slice of elements in this immutable array is replaced by another sequence.

     Produces a new immutable array where a slice of elements in this immutable array is replaced by another sequence.

     Patching at negative indices is the same as patching starting at 0. Patching at indices at or larger than the length of the original immutable array appends the patch to the end. If the `replaced` count would exceed the available elements, the difference in excess is ignored.

     B

       the element type of the returned immutable array.

     from

       the index of the first replaced element

     other

       the replacement sequence

     replaced

       the number of elements to drop in the original immutable array

     returns

       a new immutable array consisting of all elements of this immutable array except that `replaced` elements starting from `from` are replaced by all the elements of `other`.

     Definition Classes
       StrictOptimizedSeqOps → SeqOps
134.  def permutations: Iterator[ArraySeq[T]]

     Iterates over distinct permutations of elements.

     Iterates over distinct permutations of elements.

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     returns

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

     Definition Classes
       SeqOps
     Example:

     1.     Seq('a', 'b', 'b').permutations.foreach(println)
            // List(a, b, b)
            // List(b, a, b)
            // List(b, b, a)

135.  def prepended[B >: T](elem: B): ArraySeq[B]

     A copy of the immutable array with an element prepended.

     A copy of the immutable array with an element prepended.

     Also, the original immutable array is not modified, so you will want to capture the result.

     Example:

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

         scala> val y = 2 +: x
         y: List[Int] = List(2, 1)

         scala> println(x)
         List(1)

     B

       the element type of the returned immutable array.

     elem

       the prepended element

     returns

       a new immutable array consisting of `value` followed by all elements of this immutable array.

     Definition Classes
       ArraySeq → StrictOptimizedSeqOps → IndexedSeqOps → SeqOps
136.  def prependedAll[B >: T](prefix: IterableOnce[B]): ArraySeq[B]

     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.

     B

       the element type of the returned collection.

     prefix

       the iterable to prepend.

     returns

       a new immutable array which contains all elements of `prefix` followed by all the elements of this immutable array.

     Definition Classes
       ArraySeq → StrictOptimizedSeqOps → SeqOps
137.  def product[B >: T](implicit num: math.Numeric[B]): B

     Multiplies together the elements of this collection.

     Multiplies together the elements of this collection.

     The default implementation uses `reduce` for a known non-empty collection, `foldLeft` otherwise.

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the `*` operator.

     num

       an implicit parameter defining a set of numeric operations which includes the `*` operator to be used in forming the product.

     returns

       the product of all elements of this immutable array with respect to the `*` operator in `num`.

     Definition Classes
       IterableOnceOps
138.  def reduce[B >: T](op: (B, B) => B): B

     Applies the given binary operator `op` to all elements of this immutable array.

     Applies the given binary operator `op` to all elements of this immutable array.

     For each application of the operator, each operand is either an element of this immutable array or another such application of the operator. The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation.

     If this collection is ordered, then for any application of the operator, the element(s) appearing in the left operand will precede those in the right.

     Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative.

     Note: will not terminate for infinite-sized collections.

     B

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

     op

       A binary operator; must be associative for the result to always be the same across runs.

     returns

       The result of applying `op` between all the elements if the immutable array is nonempty.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable array is empty.

139.  def reduceLeft[B >: T](op: (B, T) => B): B

     Applies the given binary operator `op` to all elements of this immutable array, going left to right.

     Applies the given binary operator `op` to all elements of this immutable array, going left to right.

     "Going left to right" only makes sense if this collection is ordered: then if `x1`, `x2`, ..., `xn` are the elements of this immutable array, the result is `op( op( op( ... op(x1, x2) ... ), xn-1), xn)`.

     If this collection is not ordered, then for each application of the operator, each right operand is an element. In addition, the leftmost operand is the first element of this immutable array and each other left operand is itself an application of the operator. Each element appears exactly once in the computation.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the binary operator, a supertype of `A`.

     op

       A binary operator.

     returns

       The result of applying `op` to all elements of this immutable array, going left to right.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable array is empty.

140.  def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]

     If this immutable array is nonempty, reduces it with the given binary operator `op`, going left to right.

     If this immutable array is nonempty, reduces it with the given binary operator `op`, going left to right.

     The behavior is the same as reduceLeft except that the value is `None` if the immutable array is empty. Each element appears exactly once in the computation.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the binary operator, a supertype of `A`.

     op

       A binary operator.

     returns

       The result of reducing this immutable array with `op` going left to right if the immutable array is nonempty, inside a `Some`, and `None` otherwise.

     Definition Classes
       IterableOnceOps
141.  def reduceOption[B >: T](op: (B, B) => B): Option[B]

     If this immutable array is nonempty, reduces it with the given binary operator `op`.

     If this immutable array is nonempty, reduces it with the given binary operator `op`.

     The behavior is the same as reduce except that the value is `None` if the immutable array is empty. The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation.

     Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative.

     Note: will not terminate for infinite-sized collections.

     B

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

     op

       A binary operator; must be associative for the result to always be the same across runs.

     returns

       The result of reducing this immutable array with `op` if the immutable array is nonempty, inside a `Some`, and `None` otherwise.

     Definition Classes
       IterableOnceOps
142.  def reduceRight[B >: T](op: (T, B) => B): B

     Applies the given binary operator `op` to all elements of this immutable array, going right to left.

     Applies the given binary operator `op` to all elements of this immutable array, going right to left.

     "Going right to left" only makes sense if this collection is ordered: then if `x1`, `x2`, ..., `xn` are the elements of this immutable array, the result is `op(x1, op(x2, op( ... op(xn-1, xn) ... )))`.

     If this collection is not ordered, then for each application of the operator, each left operand is an element. In addition, the rightmost operand is the last element of this immutable array and each other right operand is itself an application of the operator. Each element appears exactly once in the computation.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the binary operator, a supertype of `A`.

     op

       A binary operator.

     returns

       The result of applying `op` to all elements of this immutable array, going right to left.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable array is empty.

143.  def reduceRightOption[B >: T](op: (T, B) => B): Option[B]

     If this immutable array is nonempty, reduces it with the given binary operator `op`, going right to left.

     If this immutable array is nonempty, reduces it with the given binary operator `op`, going right to left.

     The behavior is the same as reduceRight except that the value is `None` if the immutable array is empty. Each element appears exactly once in the computation.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the binary operator, a supertype of `A`.

     op

       A binary operator.

     returns

       The result of reducing this immutable array with `op` going right to left if the immutable array is nonempty, inside a `Some`, and `None` otherwise.

     Definition Classes
       IterableOnceOps
144.  def reverse: ArraySeq[T]

     Returns a new immutable array with the elements of this immutable array in reverse order.

     Returns a new immutable array with the elements of this immutable array in reverse order.

     Note: will not terminate for infinite-sized collections.

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     returns

       a new immutable array with all elements of this immutable array in reverse order.

     Definition Classes
       ArraySeq → IndexedSeqOps → SeqOps
145.  def reverseIterator: Iterator[T]

     An iterator yielding the elements of this immutable array in reverse order.

     An iterator yielding the elements of this immutable array in reverse order.

     Note: will not terminate for infinite-sized collections.

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

     returns

       an iterator yielding the elements of this immutable array in reverse order.

     Definition Classes
       IndexedSeqOps → SeqOps
146.  def reversed: collection.Iterable[T]
     Attributes
       protected
     Definition Classes
       IndexedSeqOps → IterableOnceOps
147.  def runWith[U](action: (T) => U): (Int) => Boolean

     Composes this partial function with an action function which gets applied to results of this partial function.

     Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.

     Note that expression `pf.runWith(action)(x)` is equivalent to

         if(pf isDefinedAt x) { action(pf(x)); true } else false

     except that `runWith` is implemented via `applyOrElse` and thus potentially more efficient. Using `runWith` avoids double evaluation of pattern matchers and guards for partial function literals.

     action

       the action function

     returns

       a function which maps arguments `x` to `isDefinedAt(x)`. The resulting function runs `action(this(x))` where `this` is defined.

     Definition Classes
       PartialFunction
     See also

       `applyOrElse`.

148.  def sameElements[B >: T](o: IterableOnce[B]): Boolean

     Tests whether the elements of this collection are the same (and in the same order) as those of `that`.

     Tests whether the elements of this collection are the same (and in the same order) as those of `that`.

     Definition Classes
       IndexedSeq → SeqOps
149.  def scan[B >: T](z: B)(op: (B, B) => B): ArraySeq[B]

     Computes a prefix scan of the elements of the collection.

     Computes a prefix scan of the elements of the collection.

     Note: The neutral element `z` may be applied more than once.

     B

       element type of the resulting collection

     z

       neutral element for the operator `op`

     op

       the associative operator for the scan

     returns

       a new immutable array containing the prefix scan of the elements in this immutable array

     Definition Classes
       IterableOps
150.  def scanLeft[B](z: B)(op: (B, T) => B): ArraySeq[B]

     Produces a immutable array containing cumulative results of applying the operator going left to right, including the initial value.

     Produces a immutable array containing cumulative results of applying the operator going left to right, including the initial value.

     Note: will not terminate for infinite-sized collections.

     B

       the type of the elements in the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     returns

       collection with intermediate results

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
151.  def scanRight[B](z: B)(op: (T, B) => B): ArraySeq[B]

     Produces a collection containing cumulative results of applying the operator going right to left.

     Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.

     Note: will not terminate for infinite-sized collections.

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     Example:

         List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)

     B

       the type of the elements in the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     returns

       collection with intermediate results

     Definition Classes
       IterableOps
152.  def search[B >: T](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult

     Searches within an interval in this sorted sequence for a specific element.

     Searches within an interval in this sorted sequence for a specific element. If this sequence is an `IndexedSeq`, a binary search is used. Otherwise, a linear search is used.

     The sequence should be sorted with the same `Ordering` before calling; otherwise, the results are undefined.

     elem

       the element to find.

     from

       the index where the search starts.

     to

       the index following where the search ends.

     ord

       the ordering to be used to compare elements.

     returns

       a `Found` value containing the index corresponding to the element in the sequence, or the `InsertionPoint` where the element would be inserted if the element is not in the sequence.

     Definition Classes
       IndexedSeqOps → SeqOps
     Note

       if `to <= from`, the search space is empty, and an `InsertionPoint` at `from` is returned

     See also

       scala.collection.IndexedSeq

       scala.math.Ordering

       scala.collection.SeqOps, method `sorted`

153.  def search[B >: T](elem: B)(implicit ord: math.Ordering[B]): SearchResult

     Searches this sorted sequence for a specific element.

     Searches this sorted sequence for a specific element. If the sequence is an `IndexedSeq`, a binary search is used. Otherwise, a linear search is used.

     The sequence should be sorted with the same `Ordering` before calling; otherwise, the results are undefined.

     elem

       the element to find.

     ord

       the ordering to be used to compare elements.

     returns

       a `Found` value containing the index corresponding to the element in the sequence, or the `InsertionPoint` where the element would be inserted if the element is not in the sequence.

     Definition Classes
       IndexedSeqOps → SeqOps
     See also

       scala.collection.IndexedSeq

       scala.math.Ordering

       scala.collection.SeqOps, method `sorted`

154.  def segmentLength(p: (T) => Boolean, from: Int): Int

     Computes the length of the longest segment that starts from some index and whose elements all satisfy some predicate.

     Computes the length of the longest segment that starts from some index and whose elements all satisfy some predicate.

     Note: may not terminate for infinite-sized collections.

     p

       the predicate used to test elements.

     from

       the index where the search starts.

     returns

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

     Definition Classes
       SeqOps
155.  final def segmentLength(p: (T) => Boolean): Int

     Computes the length of the longest segment that starts from the first element and whose elements all satisfy some predicate.

     Computes the length of the longest segment that starts from the first element and whose elements all satisfy some predicate.

     Note: may not terminate for infinite-sized collections.

     p

       the predicate used to test elements.

     returns

       the length of the longest segment of this immutable array that starts from the first element such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       SeqOps
156.  final def size: Int

     The size of this immutable array.

     The size of this immutable array.

     Note: will not terminate for infinite-sized collections.

     returns

       the number of elements in this immutable array.

     Definition Classes
       SeqOps → IterableOnceOps
157.  final def sizeCompare(that: collection.Iterable[_]): Int

     Compares the size of this immutable array to the size of another `Iterable`.

     Compares the size of this immutable array to the size of another `Iterable`.

     that

       the `Iterable` whose size is compared with this immutable array's size.

     returns

       A value `x` where

           x <  0       if this.size <  that.size
           x == 0       if this.size == that.size
           x >  0       if this.size >  that.size

       The method as implemented here does not call `size` directly; its running time is `O(this.size min that.size)` instead of `O(this.size + that.size)`. The method should be overridden if computing `size` is cheap and `knownSize` returns `-1`.

     Definition Classes
       SeqOps → IterableOps
158.  final def sizeCompare(otherSize: Int): Int

     Compares the size of this immutable array to a test value.

     Compares the size of this immutable array to a test value.

     otherSize

       the test value that gets compared with the size.

     returns

       A value `x` where

           x <  0       if this.size <  otherSize
           x == 0       if this.size == otherSize
           x >  0       if this.size >  otherSize

       The method as implemented here does not call `size` directly; its running time is `O(size min otherSize)` instead of `O(size)`. The method should be overridden if computing `size` is cheap and `knownSize` returns `-1`.

     Definition Classes
       SeqOps → IterableOps
     See also

       sizeIs

159.  final def sizeIs: SizeCompareOps

     Returns a value class containing operations for comparing the size of this immutable array to a test value.

     Returns a value class containing operations for comparing the size of this immutable array to a test value.

     These operations are implemented in terms of `sizeCompare(Int)`, and allow the following more readable usages:

         this.sizeIs < size     // this.sizeCompare(size) < 0
         this.sizeIs <= size    // this.sizeCompare(size) <= 0
         this.sizeIs == size    // this.sizeCompare(size) == 0
         this.sizeIs != size    // this.sizeCompare(size) != 0
         this.sizeIs >= size    // this.sizeCompare(size) >= 0
         this.sizeIs > size     // this.sizeCompare(size) > 0

     Definition Classes
       IterableOps
     Annotations
       @inline()
160.  def slice(from: Int, until: Int): ArraySeq[T]

     Selects an interval of elements.

     Selects an interval of elements. The returned immutable array is made up of all elements `x` which satisfy the invariant:

         from <= indexOf(x) < until

     from

       the lowest index to include from this immutable array.

     until

       the lowest index to EXCLUDE from this immutable array.

     returns

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

     Definition Classes
       ArraySeq → IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
161.  def sliding(size: Int, step: Int): Iterator[ArraySeq[T]]

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

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

     The returned iterator will be empty when called on an empty collection. The last element the iterator produces may be smaller than the window size when the original collection isn't exhausted by the window before it and its last element isn't skipped by the step before it.

     size

       the number of elements per group

     step

       the distance between the first elements of successive groups

     returns

       An iterator producing immutable arrays of size `size`, except the last element (which may be the only element) will be smaller if there are fewer than `size` elements remaining to be grouped.

     Definition Classes
       IterableOps
     Examples:

     1. `List(1, 2, 3, 4, 5).sliding(2, 2) = Iterator(List(1, 2), List(3, 4), List(5))`

     ,

     2. `List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))`

     See also

       scala.collection.Iterator, method `sliding`

162.  def sliding(size: Int): Iterator[ArraySeq[T]]

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

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

     An empty collection returns an empty iterator, and a non-empty collection containing fewer elements than the window size returns an iterator that will produce the original collection as its only element.

     size

       the number of elements per group

     returns

       An iterator producing immutable arrays of size `size`, except for a non-empty collection with less than `size` elements, which returns an iterator that produces the source collection itself as its only element.

     Definition Classes
       IterableOps
     Examples:

     1. `List().sliding(2) = empty iterator`

     ,

     2. `List(1).sliding(2) = Iterator(List(1))`

     ,

     3. `List(1, 2).sliding(2) = Iterator(List(1, 2))`

     ,

     4. `List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))`

     See also

       scala.collection.Iterator, method `sliding`

163.  def sortBy[B](f: (T) => B)(implicit ord: Ordering[B]): ArraySeq[T]

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

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

     Note: will not terminate for infinite-sized collections.

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     The sort is stable. That is, elements that are equal (as determined by `ord.compare`) appear in the same order in the sorted sequence as in the original.

     B

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

     f

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

     ord

       the ordering assumed on domain `B`.

     returns

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

     Definition Classes
       SeqOps
     Example:

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

     See also

       scala.math.Ordering

164.  def sortWith(lt: (T, T) => Boolean): ArraySeq[T]

     Sorts this immutable array according to a comparison function.

     Sorts this immutable array according to a comparison function.

     Note: will not terminate for infinite-sized collections.

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     The sort is stable. That is, elements that are equal (`lt` returns false for both directions of comparison) appear in the same order in the sorted sequence as in the original.

     lt

       a predicate that is true if its first argument strictly precedes its second argument in the desired ordering.

     returns

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

     Definition Classes
       SeqOps
     Example:

     1.     List("Steve", "Bobby", "Tom", "John", "Bob").sortWith((x, y) => x.take(3).compareTo(y.take(3)) < 0) =
            List("Bobby", "Bob", "John", "Steve", "Tom")

165.  def sorted[B >: T](implicit ord: Ordering[B]): ofRef[T]

     Sorts this immutable array according to an Ordering.

     Sorts this immutable array according to an Ordering.

     The sort is stable. That is, elements that are equal (as determined by `ord.compare`) appear in the same order in the sorted sequence as in the original.

     ord

       the ordering to be used to compare elements.

     returns

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

     Definition Classes
       ofRef → ArraySeq → StrictOptimizedSeqOps → SeqOps
     See also

       scala.math.Ordering Note: Even when applied to a view or a lazy collection it will always force the elements.

166.  def span(p: (T) => Boolean): (ArraySeq[T], ArraySeq[T])

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

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

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

     p

       the test predicate

     returns

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
167.  def splitAt(n: Int): (ArraySeq[T], ArraySeq[T])

     Splits this immutable array into a prefix/suffix pair at a given position.

     Splits this immutable array into a prefix/suffix pair at a given position.

     Note: `c splitAt n` is equivalent to (but possibly more efficient than) `(c take n, c drop n)`.

     n

       the position at which to split.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
168.  def startsWith[B >: T](that: IterableOnce[B], offset: Int = 0): Boolean

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

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

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

     that

       the sequence to test

     offset

       the index where the sequence is searched.

     returns

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

     Definition Classes
       SeqOps
169.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S with EfficientSplit

     Returns a scala.collection.Stepper for the elements of this collection.

     Returns a scala.collection.Stepper for the elements of this collection.

     The Stepper enables creating a Java stream to operate on the collection, see scala.jdk.StreamConverters. For collections holding primitive values, the Stepper can be used as an iterator which doesn't box the elements.

     The implicit scala.collection.StepperShape parameter defines the resulting Stepper type according to the element type of this collection.

     - For collections of `Int`, `Short`, `Byte` or `Char`, an scala.collection.IntStepper is returned
     - For collections of `Double` or `Float`, a scala.collection.DoubleStepper is returned
     - For collections of `Long` a scala.collection.LongStepper is returned
     - For any other element type, an scala.collection.AnyStepper is returned

     Note that this method is overridden in subclasses and the return type is refined to `S with EfficientSplit`, for example scala.collection.IndexedSeqOps.stepper. For Steppers marked with scala.collection.Stepper.EfficientSplit, the converters in scala.jdk.StreamConverters allow creating parallel streams, whereas bare Steppers can be converted only to sequential streams.

     Definition Classes
       ofRef → ArraySeq → IndexedSeqOps → IterableOnce
170.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[T, B]): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     pf

       Element transformation partial function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
171.  final def strictOptimizedConcat[B >: T, C2](that: IterableOnce[B], b: Builder[B, C2]): C2

     B

       Type of elements of the resulting collections (e.g. `Int`)

     C2

       Type of the resulting collection (e.g. `List[Int]`)

     that

       Elements to concatenate to this collection

     b

       Builder to use to build the resulting collection

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
172.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (T) => IterableOnce[B]): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     f

       Element transformation function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
173.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (T) => IterableOnce[B]): C2

     B

       Type of elements of the resulting collection (e.g. `Int`)

     C2

       Type of the resulting collection (e.g. `List[Int]`)

     b

       Builder to use to build the resulting collection

     toIterableOnce

       Evidence that `A` can be seen as an `IterableOnce[B]`

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
174.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (T) => B): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     f

       Element transformation function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
175.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(T, B), C2]): C2

     B

       Type of elements of the second collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[(Int, String)]`)

     that

       Collection to zip with this collection

     b

       Builder to use to build the resulting collection

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
176.  def stringPrefix: String
     Attributes
       protected[this]
     Definition Classes
       IndexedSeq → Seq → Iterable
     Annotations
       @nowarn()
177.  def sum[B >: T](implicit num: math.Numeric[B]): B

     Sums the elements of this collection.

     Sums the elements of this collection.

     The default implementation uses `reduce` for a known non-empty collection, `foldLeft` otherwise.

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the `+` operator.

     num

       an implicit parameter defining a set of numeric operations which includes the `+` operator to be used in forming the sum.

     returns

       the sum of all elements of this immutable array with respect to the `+` operator in `num`.

     Definition Classes
       IterableOnceOps
178.  final def synchronized[T0](arg0: => T0): T0

     Executes the code in `body` with an exclusive lock on `this`.

     Executes the code in `body` with an exclusive lock on `this`.

     returns

       the result of `body`

     Definition Classes
       AnyRef
179.  def tail: ArraySeq[T]

     The rest of the collection without its first element.

     The rest of the collection without its first element.

     Definition Classes
       ArraySeq → IterableOps
180.  def tails: Iterator[ArraySeq[T]]

     Iterates over the tails of this immutable array.

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

     returns

       an iterator over all the tails of this immutable array

     Definition Classes
       IterableOps
     Example:

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

181.  def take(n: Int): ArraySeq[T]

     Selects the first `n` elements.

     Selects the first `n` elements.

     n

       the number of elements to take from this immutable array.

     returns

       a immutable array consisting only of the first `n` elements of this immutable array, or else the whole immutable array, if it has less than `n` elements. If `n` is negative, returns an empty immutable array.

     Definition Classes
       ArraySeq → IndexedSeqOps → IterableOps → IterableOnceOps
182.  def takeRight(n: Int): ArraySeq[T]

     A collection containing the last `n` elements of this collection.

     A collection containing the last `n` elements of this collection.

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     n

       the number of elements to take from this immutable array.

     returns

       a immutable array consisting only of the last `n` elements of this immutable array, or else the whole immutable array, if it has less than `n` elements. If `n` is negative, returns an empty immutable array.

     Definition Classes
       ArraySeq → StrictOptimizedIterableOps → IndexedSeqOps → IterableOps
183.  def takeWhile(p: (T) => Boolean): ArraySeq[T]

     Takes longest prefix of elements that satisfy a predicate.

     Takes longest prefix of elements that satisfy a predicate.

     p

       The predicate used to test elements.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
184.  def tapEach[U](f: (T) => U): ArraySeq[T]

     Applies a side-effecting function to each element in this collection.

     Applies a side-effecting function to each element in this collection. Strict collections will apply `f` to their elements immediately, while lazy collections like Views and LazyLists will only apply `f` on each element if and when that element is evaluated, and each time that element is evaluated.

     U

       the return type of f

     f

       a function to apply to each element in this immutable array

     returns

       The same logical collection as this

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
185.  def to[C1](factory: Factory[T, C1]): C1

     Given a collection factory `factory`, converts this immutable array to the appropriate representation for the current element type `A`.

     Given a collection factory `factory`, converts this immutable array to the appropriate representation for the current element type `A`. Example uses:

         xs.to(List)
         xs.to(ArrayBuffer)
         xs.to(BitSet) // for xs: Iterable[Int]

     Definition Classes
       IterableOnceOps
186.  def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

     Converts this immutable array to an `Array`.

     Converts this immutable array to an `Array`.

     Implementation note: DO NOT call Array.from from this method.

     B

       The type of elements of the result, a supertype of `A`.

     returns

       This immutable array as an `Array[B]`.

     Definition Classes
       IterableOnceOps
187.  final def toBuffer[B >: T]: Buffer[B]

     Converts this immutable array to a `Buffer`.

     Converts this immutable array to a `Buffer`.

     B

       The type of elements of the result, a supertype of `A`.

     returns

       This immutable array as a `Buffer[B]`.

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
188.  final def toIndexedSeq: IndexedSeq[T]

     Converts this immutable array to an `IndexedSeq`.

     Converts this immutable array to an `IndexedSeq`.

     returns

       This immutable array as an `IndexedSeq[A]`.

     Definition Classes
       IndexedSeq → IterableOnceOps
189.  def toList: List[T]

     Converts this immutable array to a `List`.

     Converts this immutable array to a `List`.

     returns

       This immutable array as a `List[A]`.

     Definition Classes
       IterableOnceOps
190.  def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]

     Converts this immutable array to a `Map`, given an implicit coercion from the immutable array's type to a key-value tuple.

     Converts this immutable array to a `Map`, given an implicit coercion from the immutable array's type to a key-value tuple.

     K

       The key type for the resulting map.

     V

       The value type for the resulting map.

     ev

       An implicit coercion from `A` to `[K, V]`.

     returns

       This immutable array as a `Map[K, V]`.

     Definition Classes
       IterableOnceOps
191.  final def toSeq: ofRef.this.type

     returns

       This immutable array as a `Seq[A]`. This is equivalent to `to(Seq)` but might be faster.

     Definition Classes
       Seq → IterableOnceOps
192.  def toSet[B >: T]: Set[B]

     Converts this immutable array to a `Set`.

     Converts this immutable array to a `Set`.

     B

       The type of elements of the result, a supertype of `A`.

     returns

       This immutable array as a `Set[B]`.

     Definition Classes
       IterableOnceOps
193.  def toString(): String

     Creates a String representation of this object.

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

     returns

       a String representation of the object.

     Definition Classes
       Seq → Function1 → Iterable → AnyRef → Any
194.  def toVector: Vector[T]

     Converts this immutable array to a `Vector`.

     Converts this immutable array to a `Vector`.

     returns

       This immutable array as a `Vector[A]`.

     Definition Classes
       IterableOnceOps
195.  def transpose[B](implicit asIterable: (T) => collection.Iterable[B]): ArraySeq[ArraySeq[B]]

     Transposes this immutable array of iterable collections into a immutable array of immutable arrays.

     Transposes this immutable array of iterable collections into a immutable array of immutable arrays.

     The resulting collection's type will be guided by the static type of immutable array. For example:

         val xs = List(
                    Set(1, 2, 3),
                    Set(4, 5, 6)).transpose
         // xs == List(
         //         List(1, 4),
         //         List(2, 5),
         //         List(3, 6))

         val ys = Vector(
                    List(1, 2, 3),
                    List(4, 5, 6)).transpose
         // ys == Vector(
         //         Vector(1, 4),
         //         Vector(2, 5),
         //         Vector(3, 6))

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     B

       the type of the elements of each iterable collection.

     asIterable

       an implicit conversion which asserts that the element type of this immutable array is an `Iterable`.

     returns

       a two-dimensional immutable array of immutable arrays which has as nth row the nth column of this immutable array.

     Definition Classes
       IterableOps
     Exceptions thrown

       `IllegalArgumentException` if all collections in this immutable array are not of the same size.

196.  def unapply(a: Int): Option[T]

     Tries to extract a `B` from an `A` in a pattern matching expression.

     Tries to extract a `B` from an `A` in a pattern matching expression.

     Definition Classes
       PartialFunction
197.  def unlift: PartialFunction[Int, B]

     Converts an optional function to a partial function.

     Converts an optional function to a partial function.

     Implicit
       This member is added by an implicit conversion from ofRef[T] toUnliftOps[Int, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if T is a subclass of Option[B] (T <: Option[B]).
     Definition Classes
       UnliftOps
     Example:

     1. Unlike Function.unlift, this UnliftOps.unlift method can be used in extractors.

            val of: Int => Option[String] = { i =>
              if (i == 2) {
                Some("matched by an optional function")
              } else {
                None
              }
            }

            util.Random.nextInt(4) match {
              case of.unlift(m) => // Convert an optional function to a pattern
                println(m)
              case _ =>
                println("Not matched")
            }

198.  val unsafeArray: Array[T]

     The wrapped mutable `Array` that backs this `ArraySeq`.

     The wrapped mutable `Array` that backs this `ArraySeq`. Any changes to this array will break the expected immutability. Its element type does not have to be equal to the element type of this ArraySeq. A primitive ArraySeq can be backed by an array of boxed values and a reference ArraySeq can be backed by an array of a supertype or subtype of the element type.

     Definition Classes
       ofRef → ArraySeq
199.  def unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (ArraySeq[A1], ArraySeq[A2])

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

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

         val xs = `ArraySeq`(
                    (1, "one"),
                    (2, "two"),
                    (3, "three")).unzip
         // xs == (`ArraySeq`(1, 2, 3),
         //        `ArraySeq`(one, two, three))

     A1

       the type of the first half of the element pairs

     A2

       the type of the second half of the element pairs

     asPair

       an implicit conversion which asserts that the element type of this immutable array is a pair.

     returns

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
200.  def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (ArraySeq[A1], ArraySeq[A2], ArraySeq[A3])

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

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

         val xs = `ArraySeq`(
                    (1, "one", '1'),
                    (2, "two", '2'),
                    (3, "three", '3')).unzip3
         // xs == (`ArraySeq`(1, 2, 3),
         //        `ArraySeq`(one, two, three),
         //        `ArraySeq`(1, 2, 3))

     A1

       the type of the first member of the element triples

     A2

       the type of the second member of the element triples

     A3

       the type of the third member of the element triples

     asTriple

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

     returns

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

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
201.  def updated[B >: T](index: Int, elem: B): ArraySeq[B]

     A copy of this immutable array with one single replaced element.

     A copy of this immutable array with one single replaced element.

     B

       the element type of the returned immutable array.

     index

       the position of the replacement

     elem

       the replacing element

     returns

       a new immutable array which is a copy of this immutable array with the element at position `index` replaced by `elem`.

     Definition Classes
       ArraySeq → StrictOptimizedSeqOps → SeqOps
     Exceptions thrown

       `IndexOutOfBoundsException` if `index` does not satisfy `0 <= index < length`. In case of a lazy collection this exception may be thrown at a later time or not at all (if the end of the collection is never evaluated).

202.  def view: IndexedSeqView[T]

     A view over the elements of this collection.

     A view over the elements of this collection.

     Definition Classes
       IndexedSeqOps → SeqOps → IterableOps
203.  final def wait(): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException])
     Note

       not specified by SLS as a member of AnyRef

204.  final def wait(arg0: Long, arg1: Int): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException])
     Note

       not specified by SLS as a member of AnyRef

205.  final def wait(arg0: Long): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException]) @native()
     Note

       not specified by SLS as a member of AnyRef

206.  def withFilter(p: (T) => Boolean): WithFilter[T, [_]ArraySeq[_]]

     Creates a non-strict filter of this immutable array.

     Creates a non-strict filter of this immutable array.

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

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       IterableOps
207.  def zip[B](that: IterableOnce[B]): ArraySeq[(T, B)]

     Returns a immutable array formed from this immutable array and another iterable collection by combining corresponding elements in pairs.

     Returns a immutable array formed from this immutable array and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

       a new immutable array containing pairs consisting of corresponding elements of this immutable array and `that`. The length of the returned collection is the minimum of the lengths of this immutable array and `that`.

     Definition Classes
       ArraySeq → StrictOptimizedIterableOps → IterableOps
208.  def zipAll[A1 >: T, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): ArraySeq[(A1, B)]

     Returns a immutable array formed from this immutable array and another iterable collection by combining corresponding elements in pairs.

     Returns a immutable array formed from this immutable array and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

     that

       the iterable providing the second half of each result pair

     thisElem

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

     thatElem

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

     returns

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

     Definition Classes
       IterableOps
209.  def zipWithIndex: ArraySeq[(T, Int)]

     Zips this immutable array with its indices.

     Zips this immutable array with its indices.

     returns

       A new immutable array containing pairs consisting of all elements of this immutable array paired with their index. Indices start at `0`.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
     Example:

     1. `List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))`

### Deprecated Value Members

1.  def /:[B](z: B)(op: (B, T) => B): B
   Implicit
     This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (ofRef: IterableOnceExtensionMethods[T])./:(z)(op)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldLeft instead

2.  final def /:[B](z: B)(op: (B, T) => B): B
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use foldLeft instead of /:

3.  def :\[B](z: B)(op: (T, B) => B): B
   Implicit
     This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (ofRef: IterableOnceExtensionMethods[T]).:\(z)(op)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldRight instead

4.  final def :\[B](z: B)(op: (T, B) => B): B
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use foldRight instead of :\

5.  def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B

   Aggregates the results of applying an operator to subsequent elements.

   Aggregates the results of applying an operator to subsequent elements.

   Since this method degenerates to `foldLeft` for sequential (non-parallel) collections, where the combining operation is ignored, it is advisable to prefer `foldLeft` for that case.

   For parallel collections, use the `aggregate` method specified by `scala.collection.parallel.ParIterableLike`.

   B

     the result type, produced by `seqop`, `combop`, and by this function as a final result.

   z

     the start value, a neutral element for `seqop`.

   seqop

     the binary operator used to accumulate the result.

   combop

     an associative operator for combining sequential results, unused for sequential collections.

   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) For sequential collections, prefer `foldLeft(z)(seqop)`. For parallel collections, use `ParIterableLike#aggregate`.

6.  def collectFirst[B](f: PartialFunction[T, B]): Option[B]
   Implicit
     This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (ofRef: IterableOnceExtensionMethods[T]).collectFirst(f)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use .iterator.collectFirst(...) instead

7.  def companion: IterableFactory[[_]ArraySeq[_]]
   Definition Classes
     IterableOps
   Annotations
     @deprecated @deprecatedOverriding() @inline()
   Deprecated

     (Since version 2.13.0) Use iterableFactory instead

8.  def copyToBuffer(dest: Buffer[T]): Unit
   Implicit
     This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (ofRef: IterableOnceExtensionMethods[T]).copyToBuffer(dest)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

9.  final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use `dest ++= coll` instead

10.  def count(f: (T) => Boolean): Int
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).count(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.count(...) instead

11.  def exists(f: (T) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).exists(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.exists(...) instead

12.  def filter(f: (T) => Boolean): Iterator[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).filter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.filter(...) instead

13.  def find(p: (T) => Boolean): Option[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).find(p)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.find instead

14.  def flatMap[B](f: (T) => IterableOnce[B]): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).flatMap(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

15.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).fold(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.fold instead

16.  def foldLeft[B](z: B)(op: (B, T) => B): B
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).foldLeft(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldLeft instead

17.  def foldRight[B](z: B)(op: (T, B) => B): B
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).foldRight(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldRight instead

18.  def forall(f: (T) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).forall(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.forall(...) instead

19.  def foreach[U](f: (T) => U): Unit
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).foreach(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foreach(...) instead

20.  def formatted(fmtstr: String): String

    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
      This member is added by an implicit conversion from ofRef[T] toStringFormat[ofRef[T]] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.12.16) Use `formatString.format(value)` instead of `value.formatted(formatString)`, or use the `f""` string interpolator. In Java 15 and later, `formatted` resolves to the new method in String which has reversed parameters.

21.  def hasDefiniteSize: Boolean

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

    Tests whether this immutable array is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as `Stream`, the predicate returns `true` if all elements have been computed. It returns `false` if the stream is not yet evaluated to the end. Non-empty Iterators usually return `false` even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that `hasDefiniteSize` returns `true`. However, checking `hasDefiniteSize` can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

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

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

    See also

      method `knownSize` for a more useful alternative

22.  def isEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).isEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.isEmpty instead

23.  def map[B](f: (T) => B): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).map(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

24.  def max(implicit ord: math.Ordering[T]): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).max(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.max instead

25.  def maxBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).maxBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.maxBy(...) instead

26.  def min(implicit ord: math.Ordering[T]): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).min(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.min instead

27.  def minBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).minBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.minBy(...) instead

28.  def mkString: String
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).mkString

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

29.  def mkString(sep: String): String
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).mkString(sep)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

30.  def mkString(start: String, sep: String, end: String): String
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).mkString(start, sep, end)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

31.  def nonEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).nonEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.nonEmpty instead

32.  final def prefixLength(p: (T) => Boolean): Int

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      SeqOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use segmentLength instead of prefixLength

33.  def product(implicit num: math.Numeric[T]): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).product(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.product instead

34.  def reduce(f: (T, T) => T): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).reduce(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduce(...) instead

35.  def reduceLeft(f: (T, T) => T): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).reduceLeft(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

36.  def reduceLeftOption(f: (T, T) => T): Option[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).reduceLeftOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

37.  def reduceOption(f: (T, T) => T): Option[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).reduceOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceOption(...) instead

38.  def reduceRight(f: (T, T) => T): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).reduceRight(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRight(...) instead

39.  def reduceRightOption(f: (T, T) => T): Option[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).reduceRightOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

40.  final def repr: ArraySeq[T]
    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

41.  def reverseMap[B](f: (T) => B): ArraySeq[B]
    Definition Classes
      SeqOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

42.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).sameElements(that)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sameElements instead

43.  def seq: ofRef.this.type
    Definition Classes
      Iterable
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Iterable.seq always returns the iterable itself

44.  def size: Int
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).size

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.size instead

45.  def sum(implicit num: math.Numeric[T]): T
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).sum(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sum instead

46.  def to[C1](factory: Factory[T, C1]): C1
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).to(factory)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(factory) instead

47.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toArray(arg0)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toArray

48.  def toBuffer[B >: A]: Buffer[B]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toBuffer

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

49.  def toIndexedSeq: collection.IndexedSeq[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toIndexedSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toIndexedSeq instead

50.  final def toIterable: collection.Iterable[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toIterable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

51.  final def toIterable: ofRef.this.type

    returns

      This collection as an `Iterable[A]`. No new collection will be built if `this` is already an `Iterable[A]`.

    Definition Classes
      Iterable → IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn't copy non-immutable collections

52.  def toIterator: Iterator[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toIterator

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead

53.  final def toIterator: Iterator[T]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead of .toIterator

54.  def toList: List[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toList

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(List) instead

55.  def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toMap(ev)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Map) instead

56.  def toSeq: Seq[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Seq) instead

57.  def toSet[B >: A]: Set[B]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toSet

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Set) instead

58.  def toStream: Stream[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toStream

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(LazyList) instead

59.  final def toStream: Stream[T]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .to(LazyList) instead of .toStream

60.  final def toTraversable: collection.Traversable[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toTraversable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

61.  final def toTraversable: collection.Traversable[T]

    Converts this immutable array to an unspecified Iterable.

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

    returns

      An Iterable containing all elements of this immutable array.

    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn't copy non-immutable collections

62.  def toVector: Vector[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).toVector

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Vector) instead

63.  final def union[B >: T](that: collection.Seq[B]): ArraySeq[B]

    Produces a new sequence which contains all elements of this immutable array and also all elements of a given sequence.

    Produces a new sequence which contains all elements of this immutable array and also all elements of a given sequence. `xs union ys` is equivalent to `xs ++ ys`.

    B

      the element type of the returned immutable array.

    that

      the sequence to add.

    returns

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

    Definition Classes
      SeqOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `concat` instead

64.  def view(from: Int, until: Int): IndexedSeqView[T]

    A view over a slice of the elements of this collection.

    A view over a slice of the elements of this collection.

    Definition Classes
      IndexedSeqOps → IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

65.  def withFilter(f: (T) => Boolean): Iterator[T]
    Implicit
      This member is added by an implicit conversion from ofRef[T] toIterableOnceExtensionMethods[T] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (ofRef: IterableOnceExtensionMethods[T]).withFilter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.withFilter(...) instead

66.  def →[B](y: B): (ofRef[T], B)
    Implicit
      This member is added by an implicit conversion from ofRef[T] toArrowAssoc[ofRef[T]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if T is a subclass of Option[Nothing] (T <: Option[Nothing]).
    Definition Classes
      ArrowAssoc
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use `->` instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

### Inherited from ArraySeq[T]

### Inherited from java.io.Serializable

### Inherited from EvidenceIterableFactoryDefaults[T, ArraySeq, ClassTag]

### Inherited from StrictOptimizedSeqOps[T, ArraySeq, ArraySeq[T]]

### Inherited from collection.StrictOptimizedSeqOps[T, ArraySeq, ArraySeq[T]]

### Inherited from StrictOptimizedIterableOps[T, ArraySeq, ArraySeq[T]]

### Inherited from IndexedSeq[T]

### Inherited from IndexedSeqOps[T, [_]ArraySeq[_], ArraySeq[T]]

### Inherited from collection.IndexedSeq[T]

### Inherited from collection.IndexedSeqOps[T, [_]ArraySeq[_], ArraySeq[T]]

### Inherited from AbstractSeq[T]

### Inherited from Seq[T]

### Inherited from SeqOps[T, [_]ArraySeq[_], ArraySeq[T]]

### Inherited from Iterable[T]

### Inherited from collection.AbstractSeq[T]

### Inherited from collection.Seq[T]

### Inherited from Equals

### Inherited from collection.SeqOps[T, [_]ArraySeq[_], ArraySeq[T]]

### Inherited from PartialFunction[Int, T]

### Inherited from (Int) => T

### Inherited from AbstractIterable[T]

### Inherited from collection.Iterable[T]

### Inherited from IterableFactoryDefaults[T, [x]IndexedSeq[x]]

### Inherited from IterableOps[T, [_]ArraySeq[_], ArraySeq[T]]

### Inherited from IterableOnceOps[T, [_]ArraySeq[_], ArraySeq[T]]

### Inherited from IterableOnce[T]

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion UnliftOps fromofRef[T] to UnliftOps[Int, B]

### Inherited by implicit conversion iterableOnceExtensionMethods fromofRef[T] to IterableOnceExtensionMethods[T]

### Inherited by implicit conversion any2stringadd fromofRef[T] to any2stringadd[ofRef[T]]

### Inherited by implicit conversion StringFormat fromofRef[T] to StringFormat[ofRef[T]]

### Inherited by implicit conversion Ensuring fromofRef[T] to Ensuring[ofRef[T]]

### Inherited by implicit conversion ArrowAssoc fromofRef[T] to ArrowAssoc[ofRef[T]]

### Ungrouped