Scala Standard Library2.13.9 < 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 jdk

  The jdk package contains utilities to interact with JDK classes.

  The jdk package contains utilities to interact with JDK classes.

  This packages offers a number of converters, that are able to wrap or copy types from the scala library to equivalent types in the JDK class library and vice versa:

  - CollectionConverters, converting collections like scala.collection.Seq, scala.collection.Map, scala.collection.Set, scala.collection.mutable.Buffer, scala.collection.Iterator and scala.collection.Iterable to their JDK counterparts
  - OptionConverters, converting between Option and java.util.Optional and primitive variations
  - StreamConverters, to create JDK Streams from scala collections
  - DurationConverters, for conversions between scala scala.concurrent.duration.FiniteDuration and java.time.Duration
  - FunctionConverters, from scala Functions to java java.util.function.Function, java.util.function.UnaryOperator, java.util.function.Consumer and java.util.function.Predicate, as well as primitive variations and Bi-variations.

  By convention, converters that wrap an object to provide a different interface to the same underlying data structure use .asScala and .asJava extension methods, whereas converters that copy the underlying data structure use .toScala and .toJava.

  In the javaapi package, the same converters can be found with a java-friendly interface that don't rely on implicit enrichments.

  Additionally, this package offers Accumulators, capable of efficiently traversing JDK Streams.

  Definition Classes
    scala
-  package javaapi
  Definition Classes
    jdk
- Accumulator
- AnyAccumulator
- CollectionConverters
- DoubleAccumulator
- DurationConverters
- FunctionConverters
- FunctionWrappers
- FutureConverters
- IntAccumulator
- LongAccumulator
- OptionConverters
- OptionShape
- Priority0FunctionExtensions
- Priority1FunctionExtensions
- Priority2FunctionExtensions
- Priority3FunctionExtensions
- StreamConverters

c

scala.jdk

# Accumulator

###
Companion object Accumulator

#### abstract class Accumulator[A, +CC[X] <: collection.mutable.Seq[X], +C <: collection.mutable.Seq[A]] extends collection.mutable.Seq[A] with Builder[A, C]

Accumulators are mutable sequences with two distinct features:

- An accumulator can be appended efficiently to another
- There are manually specialized Accumulators for `Int`, `Long` and `Double` that don't box the elements

These two features make Accumulators a good candidate to collect the results of a parallel Java stream pipeline into a Scala collection. The scala.collection.convert.StreamExtensions.StreamHasToScala.toScala extension method on Java streams (available by importing `scala.jdk.StreamConverters._`) is specialized for Accumulators: they are built in parallel, the parts are merged efficiently.

Building specialized Accumulators is handled transparently. As a user, using the Accumulator object as a factory automatically creates an IntAccumulator, LongAccumulator, DoubleAccumulator or AnyAccumulator depending on the element type.

Note: to run the example, start the Scala REPL with `scala -Yrepl-class-based` to avoid deadlocks, see https://github.com/scala/bug/issues/9076.

    scala> import scala.jdk.StreamConverters._
    import scala.jdk.StreamConverters._

    scala> def isPrime(n: Int): Boolean = !(2 +: (3 to Math.sqrt(n).toInt by 2) exists (n % _ == 0))
    isPrime: (n: Int)Boolean

    scala> val intAcc = (1 to 10000).asJavaParStream.filter(isPrime).toScala(scala.jdk.Accumulator)
    intAcc: scala.jdk.IntAccumulator = IntAccumulator(1, 3, 5, 7, 11, 13, 17, 19, ...

    scala> val stringAcc = (1 to 100).asJavaParStream.mapToObj("<>" * _).toScala(Accumulator)
    stringAcc: scala.jdk.AnyAccumulator[String] = AnyAccumulator(<>, <><>, <><><>, ...

There are two possibilities to process elements of a primitive Accumulator without boxing: specialized operations of the Accumulator, or the Stepper interface. The most common collection operations are overloaded or overridden in the primitive Accumulator classes, for example IntAccumulator.map or IntAccumulator.exists. Thanks to Scala's function specialization, `intAcc.exists(x => testOn(x))` does not incur boxing.

The scala.collection.Stepper interface provides iterator-like `hasStep` and `nextStep` methods, and is specialized for `Int`, `Long` and `Double`. The `intAccumulator.stepper` method creates an scala.collection.IntStepper that yields the elements of the accumulator without boxing.

Accumulators can hold more than `Int.MaxValue` elements. They have a sizeLong method that returns the size as a `Long`. Note that certain operations defined in scala.collection.Seq are implemented using length, so they will not work correctly for large accumulators.

The Accumulator class is a base class to share code between AnyAccumulator (for reference types) and the manual specializations IntAccumulator, LongAccumulator and DoubleAccumulator.

Source
  Accumulator.scala

Linear Supertypes
Builder[A, C], Growable[A], Clearable, collection.mutable.Seq[A], SeqOps[A, collection.mutable.Seq, collection.mutable.Seq[A]], collection.mutable.Cloneable[collection.mutable.Seq[A]], java.lang.Cloneable, collection.Seq[A], Equals, SeqOps[A, [_]collection.mutable.Seq[_], collection.mutable.Seq[A]], PartialFunction[Int, A], (Int) => A, collection.mutable.Iterable[A], collection.Iterable[A], IterableFactoryDefaults[A, [x]collection.mutable.Seq[x]], IterableOps[A, [_]collection.mutable.Seq[_], collection.mutable.Seq[A]], IterableOnceOps[A, [_]collection.mutable.Seq[_], collection.mutable.Seq[A]], collection.IterableOnce[A], AnyRef, Any
Known Subclasses
AnyAccumulator, DoubleAccumulator, IntAccumulator, LongAccumulator
Type Hierarchy

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. Accumulator
2. Builder
3. Growable
4. Clearable
5. Seq
6. SeqOps
7. Cloneable
8. Cloneable
9. Seq
10. Equals
11. SeqOps
12. PartialFunction
13. Function1
14. Iterable
15. Iterable
16. IterableFactoryDefaults
17. IterableOps
18. IterableOnceOps
19. IterableOnce
20. AnyRef
21. 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 Accumulator()

### Abstract Value Members

1.  abstract def addOne(elem: A): Accumulator.this.type

   Adds a single element to this growable collection.

   Adds a single element to this growable collection.

   elem

     the element to add.

   returns

     the growable collection itself

   Definition Classes
     Growable
2.  abstract def apply(i: Int): A

   Get the element at the specified index.

   Get 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
     SeqOps
   Annotations
     @throws(cause = scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
3.  abstract def efficientStepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
   Attributes
     protected
4.  abstract def iterator: collection.Iterator[A]

   Iterator can be used only once

   Iterator can be used only once

   Definition Classes
     IterableOnce
5.  abstract def result(): C

   Result collection consisting of all elements appended so far.

   Result collection consisting of all elements appended so far.

   Definition Classes
     Builder
6.  abstract def update(idx: Int, elem: A): Unit

   Replaces element at given index with a new value.

   Replaces element at given index with a new value.

   idx

     the index of the element to replace.

   elem

     the new value.

   Definition Classes
     SeqOps
   Annotations
     @throws(cause = scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
   Exceptions thrown

     `IndexOutOfBoundsException` if the index is not valid.

### Concrete 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 Accumulator[A, CC, C] toany2stringadd[Accumulator[A, CC, C]] performed by method any2stringadd in scala.Predef.
   Definition Classes
     any2stringadd
4.  final def ++[B >: A](suffix: collection.IterableOnce[B]): collection.mutable.Seq[B]

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     IterableOps
   Annotations
     @inline()
5.  final def ++:[B >: A](prefix: collection.IterableOnce[B]): collection.mutable.Seq[B]

   Alias for `prependedAll`

   Alias for `prependedAll`

   Definition Classes
     SeqOps → IterableOps
   Annotations
     @inline()
6.  final def ++=(xs: collection.IterableOnce[A]): Accumulator.this.type

   Alias for `addAll`

   Alias for `addAll`

   Definition Classes
     Growable
   Annotations
     @inline()
7.  final def +:[B >: A](elem: B): collection.mutable.Seq[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()
8.  final def +=(elem: A): Accumulator.this.type

   Alias for `addOne`

   Alias for `addOne`

   Definition Classes
     Growable
   Annotations
     @inline()
9.  def ->[B](y: B): (Accumulator[A, CC, C], B)
   Implicit
     This member is added by an implicit conversion from Accumulator[A, CC, C] toArrowAssoc[Accumulator[A, CC, C]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if A is a subclass of Option[Nothing] (A <: Option[Nothing]).
   Definition Classes
     ArrowAssoc
   Annotations
     @inline()
10.  final def :+[B >: A](elem: B): collection.mutable.Seq[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()
11.  final def :++[B >: A](suffix: collection.IterableOnce[B]): collection.mutable.Seq[B]

    Alias for `appendedAll`

    Alias for `appendedAll`

    Definition Classes
      SeqOps
    Annotations
      @inline()
12.  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
13.  def addAll(xs: collection.IterableOnce[A]): Accumulator.this.type

    Adds all elements produced by an IterableOnce to this growable collection.

    Adds all elements produced by an IterableOnce to this growable collection.

    xs

      the IterableOnce producing the elements to add.

    returns

      the growable collection itself.

    Definition Classes
      Growable
14.  final def addString(b: collection.mutable.StringBuilder): b.type

    Appends all elements of this growable collection to a string builder.

    Appends all elements of this growable collection to a string builder. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this growable collection 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()
15.  final def addString(b: collection.mutable.StringBuilder, sep: String): b.type

    Appends all elements of this growable collection to a string builder using a separator string.

    Appends all elements of this growable collection 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 growable collection, 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()
16.  def addString(b: collection.mutable.StringBuilder, start: String, sep: String, end: String): b.type

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

    Appends all elements of this growable collection 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 growable collection 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
17.  def andThen[C](k: PartialFunction[A, 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
18.  def andThen[C](k: (A) => 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
19.  def appended[B >: A](elem: B): collection.mutable.Seq[B]

    A copy of this growable collection with an element appended.

    A copy of this growable collection 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 growable collection.

    elem

      the appended element

    returns

      a new growable collection consisting of all elements of this growable collection followed by `value`.

    Definition Classes
      SeqOps
20.  def appendedAll[B >: A](suffix: collection.IterableOnce[B]): collection.mutable.Seq[B]

    Returns a new growable collection containing the elements from the left hand operand followed by the elements from the right hand operand.

    Returns a new growable collection containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the growable collection 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 growable collection followed by all elements of `suffix`.

    Definition Classes
      SeqOps
21.  def applyOrElse[A1 <: Int, B1 >: A](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
22.  final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type `T0`.

    Cast the receiver object to be of type `T0`.

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

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown

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

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

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass.

    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
      Seq → Equals
24.  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 growable collection. By default the string prefix is the simple name of the collection class growable collection.

    Attributes
      protected[this]
    Definition Classes
      Iterable
25.  def clear(): Unit

    Remove all accumulated elements from this accumulator.

    Remove all accumulated elements from this accumulator.

    Definition Classes
      Accumulator → Builder → Clearable
26.  def clone(): collection.mutable.Seq[A]

    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.

    Definition Classes
      SeqOps → Cloneable → AnyRef
    Note

      not specified by SLS as a member of AnyRef

27.  final def coll: Accumulator.this.type

    returns

      This collection as a `C`.

    Attributes
      protected
    Definition Classes
      Iterable → IterableOps
28.  def collect[B](pf: PartialFunction[A, B]): collection.mutable.Seq[B]

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

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

    B

      the element type of the returned growable collection.

    pf

      the partial function which filters and maps the growable collection.

    returns

      a new growable collection 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
      IterableOps → IterableOnceOps
29.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

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

    Finds the first element of the growable collection 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)`

30.  def combinations(n: Int): collection.Iterator[collection.mutable.Seq[A]]

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

    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)

31.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]

    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
32.  def compose[A](g: (A) => Int): (A) => A

    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()
33.  final def concat[B >: A](suffix: collection.IterableOnce[B]): collection.mutable.Seq[B]

    Returns a new growable collection containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    B

      the element type of the returned collection.

    suffix

      the traversable to append.

    returns

      a new growable collection which contains all elements of this growable collection followed by all elements of `suffix`.

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

    Tests whether this growable collection contains a given value as an element.

    Tests whether this growable collection contains a given value as an element.

    Note: may not terminate for infinite-sized collections.

    elem

      the element to test.

    returns

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

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

    Tests whether this growable collection contains a given sequence as a slice.

    Tests whether this growable collection contains a given sequence as a slice.

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqOps
36.  def copyToArray[B >: A](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 growable collection.

    Copying will stop once either all the elements of this growable collection 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
      IterableOnceOps
    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 copyToArray[B >: A](xs: Array[B], start: 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 values of this growable collection.

    Copying will stop once either all the elements of this growable collection 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.

38.  def copyToArray[B >: A](xs: Array[B]): 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 values of this growable collection.

    Copying will stop once either all the elements of this growable collection 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.

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

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

    Tests whether every element of this growable collection 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 growable collection and `y` of `that`, otherwise `false`.

    Definition Classes
      SeqOps
40.  def corresponds[B](that: collection.IterableOnce[B])(p: (A, 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
41.  def count(p: (A) => Boolean): Int

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

    Counts the number of elements in the growable collection 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
42.  def diff[B >: A](that: collection.Seq[B]): collection.mutable.Seq[A]

    Computes the multiset difference between this growable collection and another sequence.

    Computes the multiset difference between this growable collection and another sequence.

    that

      the sequence of elements to remove

    returns

      a new growable collection which contains all elements of this growable collection 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
      SeqOps
43.  def distinct: collection.mutable.Seq[A]

    Selects all the elements of this growable collection ignoring the duplicates.

    Selects all the elements of this growable collection ignoring the duplicates.

    returns

      a new growable collection consisting of all the elements of this growable collection without duplicates.

    Definition Classes
      SeqOps
44.  def distinctBy[B](f: (A) => B): collection.mutable.Seq[A]

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

    Selects all the elements of this growable collection 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 growable collection consisting of all the elements of this growable collection without duplicates.

    Definition Classes
      SeqOps
45.  def drop(n: Int): collection.mutable.Seq[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

      the number of elements to drop from this growable collection.

    returns

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

    Definition Classes
      IterableOps → IterableOnceOps
46.  def dropRight(n: Int): collection.mutable.Seq[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      the number of elements to drop from this growable collection.

    returns

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

    Definition Classes
      IterableOps
47.  def dropWhile(p: (A) => Boolean): collection.mutable.Seq[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

      The predicate used to test elements.

    returns

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

    Definition Classes
      IterableOps → IterableOnceOps
48.  def elementWise: ElementWiseExtractor[Int, A]

    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
           }

49.  def empty: collection.mutable.Seq[A]

    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
      IterableFactoryDefaults → IterableOps
50.  def endsWith[B >: A](that: collection.Iterable[B]): Boolean

    Tests whether this growable collection ends with the given sequence.

    Tests whether this growable collection ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

      `true` if this growable collection has `that` as a suffix, `false` otherwise.

    Definition Classes
      SeqOps
51.  def ensuring(cond: (Accumulator[A, CC, C]) => Boolean, msg: => Any): Accumulator[A, CC, C]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toEnsuring[Accumulator[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
52.  def ensuring(cond: (Accumulator[A, CC, C]) => Boolean): Accumulator[A, CC, C]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toEnsuring[Accumulator[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
53.  def ensuring(cond: Boolean, msg: => Any): Accumulator[A, CC, C]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toEnsuring[Accumulator[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
54.  def ensuring(cond: Boolean): Accumulator[A, CC, C]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toEnsuring[Accumulator[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
55.  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
56.  def equals(o: Any): Boolean

    The universal equality method defined in `AnyRef`.

    The universal equality method defined in `AnyRef`.

    Definition Classes
      Seq → Equals → AnyRef → Any
57.  def exists(p: (A) => Boolean): Boolean

    Tests whether a predicate holds for at least one element of this growable collection.

    Tests whether a predicate holds for at least one element of this growable collection.

    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 growable collection, otherwise `false`

    Definition Classes
      IterableOnceOps
58.  def filter(pred: (A) => Boolean): collection.mutable.Seq[A]

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

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

    returns

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

    Definition Classes
      IterableOps → IterableOnceOps
59.  def filterNot(pred: (A) => Boolean): collection.mutable.Seq[A]

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

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

    pred

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableOps → IterableOnceOps
60.  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

61.  def find(p: (A) => Boolean): Option[A]

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

    Finds the first element of the growable collection 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 growable collection that satisfies `p`, or `None` if none exists.

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

    Finds the last element of the growable collection satisfying a predicate, if any.

    Finds the last element of the growable collection 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 growable collection that satisfies `p`, or `None` if none exists.

    Definition Classes
      SeqOps
63.  def flatMap[B](f: (A) => collection.IterableOnce[B]): collection.mutable.Seq[B]

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

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

    Definition Classes
      IterableOps → IterableOnceOps
64.  def flatten[B](implicit asIterable: (A) => collection.IterableOnce[B]): collection.mutable.Seq[B]

    Converts this growable collection of traversable collections into a growable collection formed by the elements of these traversable collections.

    Converts this growable collection of traversable collections into a growable collection formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the type of growable collection. 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 traversable collection.

    asIterable

      an implicit conversion which asserts that the element type of this growable collection is a `GenTraversable`.

    returns

      a new growable collection resulting from concatenating all element growable collections.

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

    Folds the elements of this growable collection using the specified associative binary operator.

    Folds the elements of this growable collection using the specified associative binary operator. The default implementation in `IterableOnce` is equivalent to `foldLeft` but may be overridden for more efficient traversal orders.

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

    Note: will not terminate for infinite-sized collections.

    A1

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

    z

      a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., `Nil` for list concatenation, 0 for addition, or 1 for multiplication).

    op

      a binary operator that must be associative.

    returns

      the result of applying the fold operator `op` between all the elements and `z`, or `z` if this growable collection is empty.

    Definition Classes
      IterableOnceOps
66.  def foldLeft[B](z: B)(op: (B, A) => B): B

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

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

    Note: will not terminate for infinite-sized collections.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this growable collection, going left to right with the start value `z` on the left: `op(...op(z, x1), x2, ..., xn)` where `x1, ..., xn` are the elements of this growable collection. Returns `z` if this growable collection is empty.

    Definition Classes
      IterableOnceOps
67.  def foldRight[B](z: B)(op: (A, B) => B): B

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

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

    Note: will not terminate for infinite-sized collections.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this growable collection, going right to left with the start value `z` on the right: `op(x1, op(x2, ... op(xn, z)...))` where `x1, ..., xn` are the elements of this growable collection. Returns `z` if this growable collection is empty.

    Definition Classes
      IterableOnceOps
68.  def forall(p: (A) => Boolean): Boolean

    Tests whether a predicate holds for all elements of this growable collection.

    Tests whether a predicate holds for all elements of this growable collection.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

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

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

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

    Definition Classes
      IterableOnceOps
70.  def fromSpecific(coll: collection.IterableOnce[A]): collection.mutable.Seq[A]

    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
      IterableFactoryDefaults → 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.

71.  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()
72.  def groupBy[K](f: (A) => K): Map[K, collection.mutable.Seq[A]]

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

    Partitions this growable collection into a map of growable collections 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 growable collections 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 growable collection of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      IterableOps
73.  def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, collection.mutable.Seq[B]]

    Partitions this growable collection into a map of growable collections according to a discriminator function `key`.

    Partitions this growable collection into a map of growable collections 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
74.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]

    Partitions this growable collection into a map according to a discriminator function `key`.

    Partitions this growable collection 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
75.  def grouped(size: Int): collection.Iterator[collection.mutable.Seq[A]]

    Partitions elements in fixed size growable collections.

    Partitions elements in fixed size growable collections.

    size

      the number of elements per group

    returns

      An iterator producing growable collections 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`

76.  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
      Seq → AnyRef → Any
77.  def head: A

    Selects the first element of this growable collection.

    Selects the first element of this growable collection.

    returns

      the first element of this growable collection.

    Definition Classes
      IterableOps
    Exceptions thrown

      `NoSuchElementException` if the growable collection is empty.

78.  def headOption: Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

      the first element of this growable collection if it is nonempty, `None` if it is empty.

    Definition Classes
      IterableOps
79.  def indexOf[B >: A](elem: B): Int

    Finds index of first occurrence of some value in this growable collection.

    Finds index of first occurrence of some value in this growable collection.

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    returns

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

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

    Finds index of first occurrence of some value in this growable collection after or at some start index.

    Finds index of first occurrence of some value in this growable collection 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 growable collection that is equal (as determined by `==`) to `elem`, or `-1`, if none exists.

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

    Finds first index where this growable collection contains a given sequence as a slice.

    Finds first index where this growable collection 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 growable collection starting at this index match the elements of sequence `that`, or `-1` if no such subsequence exists.

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

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

    Finds first index after or at a start index where this growable collection 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 growable collection starting at this index match the elements of sequence `that`, or `-1` if no such subsequence exists.

    Definition Classes
      SeqOps
83.  def indexWhere(p: (A) => 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 growable collection that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      SeqOps
    Annotations
      @deprecatedOverriding()
84.  def indexWhere(p: (A) => 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 growable collection that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      SeqOps
85.  def indices: collection.immutable.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 growable collection.

    Definition Classes
      SeqOps
86.  def init: collection.mutable.Seq[A]

    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
87.  def inits: collection.Iterator[collection.mutable.Seq[A]]

    Iterates over the inits of this growable collection.

    Iterates over the inits of this growable collection. The first value will be this growable collection and the final one will be an empty growable collection, 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 growable collection

    Definition Classes
      IterableOps
    Example:

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

88.  def intersect[B >: A](that: collection.Seq[B]): collection.mutable.Seq[A]

    Computes the multiset intersection between this growable collection and another sequence.

    Computes the multiset intersection between this growable collection and another sequence.

    that

      the sequence of elements to intersect with.

    returns

      a new growable collection which contains all elements of this growable collection 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
      SeqOps
89.  def isDefinedAt(idx: Int): Boolean

    Tests whether this growable collection contains given index.

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

    Definition Classes
      SeqOps
90.  def isEmpty: Boolean

    Tests whether the growable collection is empty.

    Tests whether the growable collection is empty.

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

    returns

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

    Definition Classes
      SeqOps → IterableOnceOps
91.  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.

92.  def isTraversableAgain: Boolean

    Tests whether this growable collection can be repeatedly traversed.

    Tests whether this growable collection 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
93.  def iterableFactory: SeqFactory[collection.mutable.Seq]

    The companion object of this growable collection, providing various factory methods.

    The companion object of this growable collection, providing various factory methods.

    Definition Classes
      Seq → Seq → Iterable → 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).

94.  final def knownSize: Int

    returns

      The number of elements in the collection under construction, if it can be cheaply computed, -1 otherwise. The default implementation always returns -1.

    Definition Classes
      Accumulator → Growable → IterableOnce
95.  def last: A

    Selects the last element.

    Selects the last element.

    returns

      The last element of this growable collection.

    Definition Classes
      IterableOps
    Exceptions thrown

      `NoSuchElementException` If the growable collection is empty.

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

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

    Finds index of last occurrence of some value in this growable collection 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 growable collection that is equal (as determined by `==`) to `elem`, or `-1`, if none exists.

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

    Finds last index where this growable collection contains a given sequence as a slice.

    Finds last index where this growable collection 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 growable collection starting at this index match the elements of sequence `that`, or `-1` if no such subsequence exists.

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

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

    Finds last index before or at a given end index where this growable collection 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 growable collection starting at this index match the elements of sequence `that`, or `-1` if no such subsequence exists.

    Definition Classes
      SeqOps
99.  def lastIndexWhere(p: (A) => 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 growable collection that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      SeqOps
    Annotations
      @deprecatedOverriding()
100.  def lastIndexWhere(p: (A) => 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 growable collection that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       SeqOps
101.  def lastOption: Option[A]

     Optionally selects the last element.

     Optionally selects the last element.

     returns

       the last element of this growable collection$ if it is nonempty, `None` if it is empty.

     Definition Classes
       IterableOps
102.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, Accumulator.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
103.  final def length: Int

     The length (number of elements) of the growable collection.

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

     Definition Classes
       Accumulator → SeqOps
104.  def lengthCompare(that: collection.Iterable[_]): Int

     Compares the length of this growable collection to the size of another `Iterable`.

     Compares the length of this growable collection to the size of another `Iterable`.

     that

       the `Iterable` whose size is compared with this growable collection'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
       SeqOps
105.  def lengthCompare(len: Int): Int

     Compares the length of this growable collection to a test value.

     Compares the length of this growable collection 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
       SeqOps
     See also

       lengthIs

106.  final def lengthIs: SizeCompareOps

     Returns a value class containing operations for comparing the length of this growable collection to a test value.

     Returns a value class containing operations for comparing the length of this growable collection 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()
107.  def lift: (Int) => Option[A]

     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

108.  def map[B](f: (A) => B): collection.mutable.Seq[B]

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

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

     B

       the element type of the returned growable collection.

     f

       the function to apply to each element.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
109.  def mapResult[NewTo](f: (C) => NewTo): Builder[A, NewTo]

     A builder resulting from this builder my mapping the result using `f`.

     A builder resulting from this builder my mapping the result using `f`.

     Definition Classes
       Builder
110.  def max[B >: A](implicit ord: math.Ordering[B]): A

     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 growable collection with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this growable collection is empty.

111.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A

     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.

     cmp

       An ordering to be used for comparing elements.

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this growable collection is empty.

112.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]

     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.

     cmp

       An ordering to be used for comparing elements.

     returns

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

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

     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 growable collection with respect to the ordering `ord`.

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

     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 growable collection with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this growable collection is empty.

115.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A

     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.

     cmp

       An ordering to be used for comparing elements.

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this growable collection is empty.

116.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]

     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.

     cmp

       An ordering to be used for comparing elements.

     returns

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

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

     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 growable collection with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
118.  final def mkString: String

     Displays all elements of this growable collection in a string.

     Displays all elements of this growable collection in a string.

     Delegates to addString, which can be overridden.

     returns

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

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

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

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

     Delegates to addString, which can be overridden.

     sep

       the separator string.

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
     Example:

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

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

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

     Displays all elements of this growable collection 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 growable collection. The resulting string begins with the string `start` and ends with the string `end`. Inside, the string representations (w.r.t. the method `toString`) of all elements of this growable collection are separated by the string `sep`.

     Definition Classes
       IterableOnceOps
     Example:

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

121.  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
122.  def newSpecificBuilder: Builder[A, collection.mutable.Seq[A]]

     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
       IterableFactoryDefaults → 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.

123.  def nonEmpty: Boolean

     Tests whether the growable collection is not empty.

     Tests whether the growable collection is not empty.

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @deprecatedOverriding()
124.  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

125.  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

126.  def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
     Attributes
       protected[collection]
     Definition Classes
       SeqOps
127.  def orElse[A1 <: Int, B1 >: A](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
128.  def padTo[B >: A](len: Int, elem: B): collection.mutable.Seq[B]

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

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

     B

       the element type of the returned growable collection.

     len

       the target length

     elem

       the padding value

     returns

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

     Definition Classes
       SeqOps
129.  def partition(p: (A) => Boolean): (collection.mutable.Seq[A], collection.mutable.Seq[A])

     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. Interesting because it splits a collection in two.

     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
       IterableOps
130.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (collection.mutable.Seq[A1], collection.mutable.Seq[A2])

     Applies a function `f` to each element of the growable collection and returns a pair of growable collections: 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 growable collection and returns a pair of growable collections: 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 = `Growable`(1, "one", 2, "two", 3, "three") partitionMap {
          case i: Int => Left(i)
          case s: String => Right(s)
         }
         // xs == (`Growable`(1, 2, 3),
         //        `Growable`(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 growable collection to an scala.util.Either

     returns

       a pair of growable collections: 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
       IterableOps
131.  def patch[B >: A](from: Int, other: collection.IterableOnce[B], replaced: Int): collection.mutable.Seq[B]

     Produces a new growable collection where a slice of elements in this growable collection is replaced by another sequence.

     Produces a new growable collection where a slice of elements in this growable collection 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 growable collection appends the patch to the end. If more values are replaced than actually exist, the excess is ignored.

     B

       the element type of the returned growable collection.

     from

       the index of the first replaced element

     other

       the replacement sequence

     replaced

       the number of elements to drop in the original growable collection

     returns

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

     Definition Classes
       SeqOps
132.  def permutations: collection.Iterator[collection.mutable.Seq[A]]

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

     Definition Classes
       SeqOps
     Example:

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

133.  def prepended[B >: A](elem: B): collection.mutable.Seq[B]

     A copy of the growable collection with an element prepended.

     A copy of the growable collection with an element prepended.

     Also, the original growable collection 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 growable collection.

     elem

       the prepended element

     returns

       a new growable collection consisting of `value` followed by all elements of this growable collection.

     Definition Classes
       SeqOps
134.  def prependedAll[B >: A](prefix: collection.IterableOnce[B]): collection.mutable.Seq[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 growable collection which contains all elements of `prefix` followed by all the elements of this growable collection.

     Definition Classes
       SeqOps
135.  def product[B >: A](implicit num: math.Numeric[B]): B

     Multiplies up the elements of this collection.

     Multiplies up the elements of this collection.

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

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

     Reduces the elements of this growable collection using the specified associative binary operator.

     Reduces the elements of this growable collection using the specified associative binary operator.

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

     B

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

     op

       A binary operator that must be associative.

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this growable collection is empty.

137.  def reduceLeft[B >: A](op: (B, A) => B): B

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

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this growable collection, going left to right: `op( op( ... op(x1, x2) ..., xn-1), xn)` where `x1, ..., xn` are the elements of this growable collection.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this growable collection is empty.

138.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]

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

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

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

     Reduces the elements of this growable collection, if any, using the specified associative binary operator.

     Reduces the elements of this growable collection, if any, using the specified associative binary operator.

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

     B

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

     op

       A binary operator that must be associative.

     returns

       An option value containing result of applying reduce operator `op` between all the elements if the collection is nonempty, and `None` otherwise.

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

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

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this growable collection, going right to left: `op(x1, op(x2, ..., op(xn-1, xn)...))` where `x1, ..., xn` are the elements of this growable collection.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this growable collection is empty.

141.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]

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

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       IterableOnceOps
142.  def reverse: collection.mutable.Seq[A]

     Returns new growable collection with elements in reversed order.

     Returns new growable collection with elements in reversed 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 growable collection with all elements of this growable collection in reversed order.

     Definition Classes
       SeqOps
143.  def reverseIterator: collection.Iterator[A]

     An iterator yielding elements in reversed order.

     An iterator yielding elements in reversed 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 growable collection in reversed order

     Definition Classes
       SeqOps
144.  def reversed: collection.Iterable[A]
     Attributes
       protected
     Definition Classes
       IterableOnceOps
145.  def runWith[U](action: (A) => 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`.

146.  def sameElements[B >: A](that: collection.IterableOnce[B]): Boolean

     Are the elements of this collection the same (and in the same order) as those of `that`?

     Are the elements of this collection the same (and in the same order) as those of `that`?

     Definition Classes
       SeqOps
147.  def scan[B >: A](z: B)(op: (B, B) => B): collection.mutable.Seq[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 growable collection containing the prefix scan of the elements in this growable collection

     Definition Classes
       IterableOps
148.  def scanLeft[B](z: B)(op: (B, A) => B): collection.mutable.Seq[B]

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

     Produces a growable collection 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
       IterableOps → IterableOnceOps
149.  def scanRight[B](z: B)(op: (A, B) => B): collection.mutable.Seq[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
150.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult

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

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

151.  def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult

     Search this sorted sequence for a specific element.

     Search 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
       SeqOps
     See also

       scala.collection.IndexedSeq

       scala.math.Ordering

       scala.collection.SeqOps, method `sorted`

152.  def segmentLength(p: (A) => 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 growable collection starting from index `from` such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       SeqOps
153.  final def segmentLength(p: (A) => 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 growable collection that starts from the first element such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       SeqOps
154.  final def size: Int

     The size of this growable collection.

     The size of this growable collection.

     Note: will not terminate for infinite-sized collections.

     returns

       the number of elements in this growable collection.

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

     Compares the size of this growable collection to the size of another `Iterable`.

     Compares the size of this growable collection to the size of another `Iterable`.

     that

       the `Iterable` whose size is compared with this growable collection'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
156.  final def sizeCompare(otherSize: Int): Int

     Compares the size of this growable collection to a test value.

     Compares the size of this growable collection 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

157.  final def sizeHint(coll: collection.IterableOnce[_], delta: Int = 0): Unit

     Gives a hint that one expects the `result` of this builder to have the same size as the given collection, plus some delta.

     Gives a hint that one expects the `result` of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection has a known size Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     coll

       the collection which serves as a hint for the result's size.

     delta

       a correction to add to the `coll.size` to produce the size hint.

     Definition Classes
       Builder
158.  def sizeHint(size: Int): Unit

     Gives a hint how many elements are expected to be added when the next `result` is called.

     Gives a hint how many elements are expected to be added when the next `result` is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     size

       the hint how many elements will be added.

     Definition Classes
       Builder
159.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit

     Gives a hint how many elements are expected to be added when the next `result` is called, together with an upper bound given by the size of some other collection.

     Gives a hint how many elements are expected to be added when the next `result` is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     size

       the hint how many elements will be added.

     boundingColl

       the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

     Definition Classes
       Builder
160.  final def sizeIs: SizeCompareOps

     Returns a value class containing operations for comparing the size of this growable collection to a test value.

     Returns a value class containing operations for comparing the size of this growable collection 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()
161.  final def sizeLong: Long

     Size of the accumulated collection, as a `Long`

162.  def slice(from: Int, until: Int): collection.mutable.Seq[A]

     Selects an interval of elements.

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

         from <= indexOf(x) < until

     from

       the lowest index to include from this growable collection.

     until

       the lowest index to EXCLUDE from this growable collection.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
163.  def sliding(size: Int, step: Int): collection.Iterator[collection.mutable.Seq[A]]

     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 growable collections 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`

164.  def sliding(size: Int): collection.Iterator[collection.mutable.Seq[A]]

     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 growable collections 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`

165.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): collection.mutable.Seq[A]

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

     Sorts this growable collection 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 growable collection consisting of the elements of this growable collection 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

166.  def sortWith(lt: (A, A) => Boolean): collection.mutable.Seq[A]

     Sorts this growable collection according to a comparison function.

     Sorts this growable collection 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 (as determined by `lt`) appear in the same order in the sorted sequence as in the original.

     lt

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

     returns

       a growable collection consisting of the elements of this growable collection sorted according to the comparison function `lt`.

     Definition Classes
       SeqOps
     Example:

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

167.  def sorted[B >: A](implicit ord: Ordering[B]): collection.mutable.Seq[A]

     Sorts this growable collection according to an Ordering.

     Sorts this growable collection 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 growable collection consisting of the elements of this growable collection sorted according to the ordering `ord`.

     Definition Classes
       SeqOps
     See also

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

168.  def span(p: (A) => Boolean): (collection.mutable.Seq[A], collection.mutable.Seq[A])

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

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

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

     p

       the test predicate

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
169.  def splitAt(n: Int): (collection.mutable.Seq[A], collection.mutable.Seq[A])

     Splits this growable collection into a prefix/suffix pair at a given position.

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

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

     Tests whether this growable collection contains the given sequence at a given index.

     Tests whether this growable collection 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 growable collection at index `offset`, otherwise `false`.

     Definition Classes
       SeqOps
171.  final def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, 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
       Accumulator → IterableOnce
172.  def stringPrefix: String
     Attributes
       protected[this]
     Definition Classes
       Seq → Iterable
     Annotations
       @nowarn()
173.  def sum[B >: A](implicit num: math.Numeric[B]): B

     Sums up the elements of this collection.

     Sums up the elements of this collection.

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

     Definition Classes
       IterableOnceOps
174.  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
175.  def tail: collection.mutable.Seq[A]

     The rest of the collection without its first element.

     The rest of the collection without its first element.

     Definition Classes
       IterableOps
176.  def tails: collection.Iterator[collection.mutable.Seq[A]]

     Iterates over the tails of this growable collection.

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

     returns

       an iterator over all the tails of this growable collection

     Definition Classes
       IterableOps
     Example:

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

177.  def take(n: Int): collection.mutable.Seq[A]

     Selects the first n elements.

     Selects the first n elements.

     n

       the number of elements to take from this growable collection.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
178.  def takeRight(n: Int): collection.mutable.Seq[A]

     Selects the last n elements.

     Selects the last n elements.

     n

       the number of elements to take from this growable collection.

     returns

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

     Definition Classes
       IterableOps
179.  def takeWhile(p: (A) => Boolean): collection.mutable.Seq[A]

     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 growable collection whose elements all satisfy the predicate `p`.

     Definition Classes
       IterableOps → IterableOnceOps
180.  def tapEach[U](f: (A) => U): collection.mutable.Seq[A]

     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 growable collection

     returns

       The same logical collection as this

     Definition Classes
       IterableOps → IterableOnceOps
181.  def to[C1](factory: Factory[A, C1]): C1

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

     Given a collection factory `factory`, convert this collection 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
182.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

     Convert collection to array.

     Convert collection to array.

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

     Definition Classes
       IterableOnceOps
183.  final def toBuffer[B >: A]: Buffer[B]
     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
184.  def toIndexedSeq: collection.immutable.IndexedSeq[A]
     Definition Classes
       IterableOnceOps
185.  def toList: collection.immutable.List[A]
     Definition Classes
       IterableOnceOps
186.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
     Definition Classes
       IterableOnceOps
187.  def toSeq: collection.immutable.Seq[A]

     returns

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

     Definition Classes
       IterableOnceOps
188.  def toSet[B >: A]: Set[B]
     Definition Classes
       IterableOnceOps
189.  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
190.  def toVector: collection.immutable.Vector[A]
     Definition Classes
       IterableOnceOps
191.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): collection.mutable.Seq[collection.mutable.Seq[B]]

     Transposes this growable collection of iterable collections into a growable collection of growable collections.

     Transposes this growable collection of iterable collections into a growable collection of growable collections.

     The resulting collection's type will be guided by the static type of growable collection. 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 growable collection is an `Iterable`.

     returns

       a two-dimensional growable collection of growable collections which has as nth row the nth column of this growable collection.

     Definition Classes
       IterableOps
     Exceptions thrown

       `IllegalArgumentException` if all collections in this growable collection are not of the same size.

192.  def unapply(a: Int): Option[A]

     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
193.  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 Accumulator[A, CC, C] toUnliftOps[Int, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if A is a subclass of Option[B] (A <: 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")
            }

194.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (collection.mutable.Seq[A1], collection.mutable.Seq[A2])

     Converts this growable collection of pairs into two collections of the first and second half of each pair.

     Converts this growable collection of pairs into two collections of the first and second half of each pair.

         val xs = `Growable`(
                    (1, "one"),
                    (2, "two"),
                    (3, "three")).unzip
         // xs == (`Growable`(1, 2, 3),
         //        `Growable`(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 growable collection is a pair.

     returns

       a pair of growable collections, containing the first, respectively second half of each element pair of this growable collection.

     Definition Classes
       IterableOps
195.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (collection.mutable.Seq[A1], collection.mutable.Seq[A2], collection.mutable.Seq[A3])

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

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

         val xs = `Growable`(
                    (1, "one", '1'),
                    (2, "two", '2'),
                    (3, "three", '3')).unzip3
         // xs == (`Growable`(1, 2, 3),
         //        `Growable`(one, two, three),
         //        `Growable`(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 growable collection is a triple.

     returns

       a triple of growable collections, containing the first, second, respectively third member of each element triple of this growable collection.

     Definition Classes
       IterableOps
196.  def updated[B >: A](index: Int, elem: B): collection.mutable.Seq[B]

     A copy of this growable collection with one single replaced element.

     A copy of this growable collection with one single replaced element.

     B

       the element type of the returned growable collection.

     index

       the position of the replacement

     elem

       the replacing element

     returns

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

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

197.  def view: SeqView[A]

     A view over the elements of this collection.

     A view over the elements of this collection.

     Definition Classes
       SeqOps → IterableOps
198.  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

199.  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

200.  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

201.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]collection.mutable.Seq[_]]

     Creates a non-strict filter of this growable collection.

     Creates a non-strict filter of this growable collection.

     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 growable collection which satisfy the predicate `p`.

     Definition Classes
       IterableOps
202.  def zip[B](that: collection.IterableOnce[B]): collection.mutable.Seq[(A, B)]

     Returns a growable collection formed from this growable collection and another iterable collection by combining corresponding elements in pairs.

     Returns a growable collection formed from this growable collection 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 growable collection containing pairs consisting of corresponding elements of this growable collection and `that`. The length of the returned collection is the minimum of the lengths of this growable collection and `that`.

     Definition Classes
       IterableOps
203.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): collection.mutable.Seq[(A1, B)]

     Returns a growable collection formed from this growable collection and another iterable collection by combining corresponding elements in pairs.

     Returns a growable collection formed from this growable collection 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 growable collection is shorter than `that`.

     thatElem

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

     returns

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

     Definition Classes
       IterableOps
204.  def zipWithIndex: collection.mutable.Seq[(A, Int)]

     Zips this growable collection with its indices.

     Zips this growable collection with its indices.

     returns

       A new growable collection containing pairs consisting of all elements of this growable collection paired with their index. Indices start at `0`.

     Definition Classes
       IterableOps → IterableOnceOps
     Example:

     1. `List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))`

### Deprecated Value Members

1.  final def +=(elem1: A, elem2: A, elems: A*): Accumulator.this.type

   Adds two or more elements to this growable collection.

   Adds two or more elements to this growable collection.

   elem1

     the first element to add.

   elem2

     the second element to add.

   elems

     the remaining elements to add.

   returns

     the growable collection itself

   Definition Classes
     Growable
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use `++=` aka `addAll` instead of varargs `+=`; infix operations with an operand of multiple args will be deprecated

2.  def /:[B](z: B)(op: (B, A) => B): B
   Implicit
     This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

         (accumulator: IterableOnceExtensionMethods[A])./:(z)(op)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldLeft instead

3.  final def /:[B](z: B)(op: (B, A) => B): B
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use foldLeft instead of /:

4.  def :\[B](z: B)(op: (A, B) => B): B
   Implicit
     This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

         (accumulator: IterableOnceExtensionMethods[A]).:\(z)(op)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldRight instead

5.  final def :\[B](z: B)(op: (A, B) => B): B
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use foldRight instead of :\

6.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.

7.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
   Implicit
     This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

         (accumulator: IterableOnceExtensionMethods[A]).collectFirst(f)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use .iterator.collectFirst(...) instead

8.  def companion: IterableFactory[[_]collection.mutable.Seq[_]]
   Definition Classes
     IterableOps
   Annotations
     @deprecated @deprecatedOverriding() @inline()
   Deprecated

     (Since version 2.13.0) Use iterableFactory instead

9.  def copyToBuffer(dest: Buffer[A]): Unit
   Implicit
     This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

         (accumulator: IterableOnceExtensionMethods[A]).copyToBuffer(dest)

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

10.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `dest ++= coll` instead

11.  def count(f: (A) => Boolean): Int
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).count(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.count(...) instead

12.  def exists(f: (A) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).exists(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.exists(...) instead

13.  def filter(f: (A) => Boolean): collection.Iterator[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).filter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.filter(...) instead

14.  def find(p: (A) => Boolean): Option[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).find(p)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.find instead

15.  def flatMap[B](f: (A) => collection.IterableOnce[B]): collection.IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).flatMap(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

16.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).fold(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.fold instead

17.  def foldLeft[B](z: B)(op: (B, A) => B): B
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).foldLeft(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldLeft instead

18.  def foldRight[B](z: B)(op: (A, B) => B): B
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).foldRight(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldRight instead

19.  def forall(f: (A) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).forall(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.forall(...) instead

20.  def foreach[U](f: (A) => U): Unit
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).foreach(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foreach(...) instead

21.  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 Accumulator[A, CC, C] toStringFormat[Accumulator[A, CC, C]] 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.

22.  def hasDefiniteSize: Boolean

    Tests whether this growable collection is known to have a finite size.

    Tests whether this growable collection 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

23.  def isEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).isEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.isEmpty instead

24.  def map[B](f: (A) => B): collection.IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).map(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

25.  def max(implicit ord: math.Ordering[A]): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).max(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.max instead

26.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).maxBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.maxBy(...) instead

27.  def min(implicit ord: math.Ordering[A]): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).min(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.min instead

28.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).minBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.minBy(...) instead

29.  def mkString: String
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).mkString

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

30.  def mkString(sep: String): String
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).mkString(sep)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

31.  def mkString(start: String, sep: String, end: String): String
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).mkString(start, sep, end)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

32.  def nonEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).nonEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.nonEmpty instead

33.  final def prefixLength(p: (A) => 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 growable collection 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

34.  def product(implicit num: math.Numeric[A]): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).product(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.product instead

35.  def reduce(f: (A, A) => A): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).reduce(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduce(...) instead

36.  def reduceLeft(f: (A, A) => A): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).reduceLeft(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

37.  def reduceLeftOption(f: (A, A) => A): Option[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).reduceLeftOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

38.  def reduceOption(f: (A, A) => A): Option[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).reduceOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceOption(...) instead

39.  def reduceRight(f: (A, A) => A): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).reduceRight(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRight(...) instead

40.  def reduceRightOption(f: (A, A) => A): Option[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).reduceRightOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

41.  final def repr: collection.mutable.Seq[A]
    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

42.  def reverseMap[B](f: (A) => B): collection.mutable.Seq[B]
    Definition Classes
      SeqOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

43.  def sameElements[B >: A](that: collection.IterableOnce[B]): Boolean
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).sameElements(that)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sameElements instead

44.  def seq: Accumulator.this.type
    Definition Classes
      Iterable
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Iterable.seq always returns the iterable itself

45.  def size: Int
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).size

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.size instead

46.  def sum(implicit num: math.Numeric[A]): A
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).sum(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sum instead

47.  def to[C1](factory: Factory[A, C1]): C1
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).to(factory)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(factory) instead

48.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toArray(arg0)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toArray

49.  def toBuffer[B >: A]: Buffer[B]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toBuffer

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

50.  def toIndexedSeq: collection.IndexedSeq[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toIndexedSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toIndexedSeq instead

51.  final def toIterable: collection.Iterable[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toIterable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

52.  final def toIterable: Accumulator.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

53.  def toIterator: collection.Iterator[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toIterator

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead

54.  final def toIterator: collection.Iterator[A]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead of .toIterator

55.  def toList: collection.immutable.List[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toList

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(List) instead

56.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toMap(ev)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Map) instead

57.  def toSeq: collection.immutable.Seq[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Seq) instead

58.  def toSet[B >: A]: Set[B]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toSet

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Set) instead

59.  def toStream: collection.immutable.Stream[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toStream

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(LazyList) instead

60.  final def toStream: collection.immutable.Stream[A]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .to(LazyList) instead of .toStream

61.  final def toTraversable: collection.Traversable[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toTraversable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

62.  final def toTraversable: collection.Traversable[A]

    Converts this growable collection to an unspecified Iterable.

    Converts this growable collection to an unspecified Iterable. Will return the same collection if this instance is already Iterable.

    returns

      An Iterable containing all elements of this growable collection.

    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

63.  def toVector: collection.immutable.Vector[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).toVector

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Vector) instead

64.  final def transform(f: (A) => A): Accumulator.this.type
    Definition Classes
      SeqOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `mapInPlace` on an `IndexedSeq` instead

65.  final def union[B >: A](that: collection.Seq[B]): collection.mutable.Seq[B]

    Produces a new sequence which contains all elements of this growable collection and also all elements of a given sequence.

    Produces a new sequence which contains all elements of this growable collection and also all elements of a given sequence. `xs union ys` is equivalent to `xs ++ ys`.

    B

      the element type of the returned growable collection.

    that

      the sequence to add.

    returns

      a new collection which contains all elements of this growable collection followed by all elements of `that`.

    Definition Classes
      SeqOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `concat` instead

66.  def view(from: Int, until: Int): View[A]

    A view over a slice of the elements of this collection.

    A view over a slice of the elements of this collection.

    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

67.  def withFilter(f: (A) => Boolean): collection.Iterator[A]
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toIterableOnceExtensionMethods[A] 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:

          (accumulator: IterableOnceExtensionMethods[A]).withFilter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.withFilter(...) instead

68.  def →[B](y: B): (Accumulator[A, CC, C], B)
    Implicit
      This member is added by an implicit conversion from Accumulator[A, CC, C] toArrowAssoc[Accumulator[A, CC, C]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if A is a subclass of Option[Nothing] (A <: 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 Builder[A, C]

### Inherited from Growable[A]

### Inherited from Clearable

### Inherited from collection.mutable.Seq[A]

### Inherited from SeqOps[A, collection.mutable.Seq, collection.mutable.Seq[A]]

### Inherited from collection.mutable.Cloneable[collection.mutable.Seq[A]]

### Inherited from java.lang.Cloneable

### Inherited from collection.Seq[A]

### Inherited from Equals

### Inherited from SeqOps[A, [_]collection.mutable.Seq[_], collection.mutable.Seq[A]]

### Inherited from PartialFunction[Int, A]

### Inherited from (Int) => A

### Inherited from collection.mutable.Iterable[A]

### Inherited from collection.Iterable[A]

### Inherited from IterableFactoryDefaults[A, [x]collection.mutable.Seq[x]]

### Inherited from IterableOps[A, [_]collection.mutable.Seq[_], collection.mutable.Seq[A]]

### Inherited from IterableOnceOps[A, [_]collection.mutable.Seq[_], collection.mutable.Seq[A]]

### Inherited from collection.IterableOnce[A]

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion UnliftOps fromAccumulator[A, CC, C] to UnliftOps[Int, B]

### Inherited by implicit conversion iterableOnceExtensionMethods fromAccumulator[A, CC, C] to IterableOnceExtensionMethods[A]

### Inherited by implicit conversion any2stringadd fromAccumulator[A, CC, C] to any2stringadd[Accumulator[A, CC, C]]

### Inherited by implicit conversion StringFormat fromAccumulator[A, CC, C] to StringFormat[Accumulator[A, CC, C]]

### Inherited by implicit conversion Ensuring fromAccumulator[A, CC, C] to Ensuring[Accumulator[A, CC, C]]

### Inherited by implicit conversion ArrowAssoc fromAccumulator[A, CC, C] to ArrowAssoc[Accumulator[A, CC, C]]

### Ungrouped