Scala Standard Library 2.13.16 - scala.collection.immutable.Stream.Cons
Keywords: Scala Standard Library 2.13.16 scala.collection.immutable.Stream.Cons

Scala Standard Library2.13.16 < Back


# Packages

-  package root

  This is the documentation for the Scala standard library.

  This is the documentation for the Scala standard library.

  #### Package structure

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

  Notable packages include:

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

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

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

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

  #### Automatic imports

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

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

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

  Definition Classes
    root
-  package scala

  Core Scala types.

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

  Definition Classes
    root
-  package collection
  Definition Classes
    scala
-  package immutable
  Definition Classes
    collection
-  object Stream extends SeqFactory[Stream]
  Definition Classes
    immutable
  Annotations
    @deprecated @SerialVersionUID()
  Deprecated

    (Since version 2.13.0) Use LazyList (which is fully lazy) instead of Stream (which has a lazy tail only)

- #::
- Cons
- Deferrer
- Empty
- SerializationProxy
- cons

c

scala.collection.immutable.Stream

# Cons

###

#### final class Cons[A] extends Stream[A]

Annotations
  @SerialVersionUID()
Source
  Stream.scala

Linear Supertypes
Stream[A], java.io.Serializable, LinearSeq[A], LinearSeqOps[A, [X]Stream[X], Stream[A]], collection.LinearSeq[A], collection.LinearSeqOps[A, [X]Stream[X], Stream[A]], AbstractSeq[A], Seq[A], SeqOps[A, [_]Stream[_], Stream[A]], Iterable[A], collection.AbstractSeq[A], collection.Seq[A], Equals, collection.SeqOps[A, [_]Stream[_], Stream[A]], PartialFunction[Int, A], (Int) => A, AbstractIterable[A], collection.Iterable[A], IterableFactoryDefaults[A, [x]Stream[x]], IterableOps[A, [_]Stream[_], Stream[A]], IterableOnceOps[A, [_]Stream[_], Stream[A]], IterableOnce[A], AnyRef, Any
Type Hierarchy

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. Cons
2. Stream
3. Serializable
4. LinearSeq
5. LinearSeqOps
6. LinearSeq
7. LinearSeqOps
8. AbstractSeq
9. Seq
10. SeqOps
11. Iterable
12. AbstractSeq
13. Seq
14. Equals
15. SeqOps
16. PartialFunction
17. Function1
18. AbstractIterable
19. Iterable
20. IterableFactoryDefaults
21. IterableOps
22. IterableOnceOps
23. IterableOnce
24. AnyRef
25. Any

Implicitly

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

1. Hide All
2. Show All

Visibility

1. Public
2. Protected

### Instance Constructors

1.  new Cons(head: A, tl: => Stream[A])

### 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 #::[B >: A](elem: B): Stream[B]

   Construct a Stream consisting of a given first element followed by elements from another Stream.

   Construct a Stream consisting of a given first element followed by elements from another Stream.

   Implicit
     This member is added by an implicit conversion from Cons[A] toDeferrer[A] performed by method toDeferrer in scala.collection.immutable.Stream.
   Definition Classes
     Deferrer
4.  def #::[B >: A](elem: B): Stream[B]

   Construct a Stream consisting of a given first element followed by elements from another Stream.

   Construct a Stream consisting of a given first element followed by elements from another Stream.

   Implicit
     This member is added by an implicit conversion from Cons[A] toDeferrer[A] performed by method toDeferrer in scala.collection.immutable.Stream.
   Definition Classes
     Deferrer
5.  def #:::[B >: A](prefix: Stream[B]): Stream[B]

   Construct a Stream consisting of the concatenation of the given Stream and another Stream.

   Construct a Stream consisting of the concatenation of the given Stream and another Stream.

   Implicit
     This member is added by an implicit conversion from Cons[A] toDeferrer[A] performed by method toDeferrer in scala.collection.immutable.Stream.
   Definition Classes
     Deferrer
6.  def #:::[B >: A](prefix: Stream[B]): Stream[B]

   Construct a Stream consisting of the concatenation of the given Stream and another Stream.

   Construct a Stream consisting of the concatenation of the given Stream and another Stream.

   Implicit
     This member is added by an implicit conversion from Cons[A] toDeferrer[A] performed by method toDeferrer in scala.collection.immutable.Stream.
   Definition Classes
     Deferrer
7.  def +(other: String): String
   Implicit
     This member is added by an implicit conversion from Cons[A] toany2stringadd[Cons[A]] performed by method any2stringadd in scala.Predef.
   Definition Classes
     any2stringadd
8.  final def ++[B >: A](suffix: IterableOnce[B]): Stream[B]

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     IterableOps
   Annotations
     @inline()
9.  final def ++:[B >: A](prefix: IterableOnce[B]): Stream[B]

   Alias for `prependedAll`.

   Alias for `prependedAll`.

   Definition Classes
     SeqOps → IterableOps
   Annotations
     @inline()
10.  final def +:[B >: A](elem: B): Stream[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()
11.  def ->[B](y: B): (Cons[A], B)
    Implicit
      This member is added by an implicit conversion from Cons[A] toArrowAssoc[Cons[A]] 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()
12.  final def :+[B >: A](elem: B): Stream[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()
13.  final def :++[B >: A](suffix: IterableOnce[B]): Stream[B]

    Alias for `appendedAll`.

    Alias for `appendedAll`.

    Definition Classes
      SeqOps
    Annotations
      @inline()
14.  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
15.  def addString(sb: mutable.StringBuilder, start: String, sep: String, end: String): sb.type

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

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

    Undefined elements are represented with `"_"`, an undefined tail is represented with `"<not computed>"`, and cycles are represented with `"<cycle>"`.

    sb

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

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

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

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

    Appends all elements of this immutable sequence to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this immutable sequence, 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()
18.  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
19.  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
20.  def appended[B >: A](elem: B): Stream[B]

    A copy of this immutable sequence with an element appended.

    A copy of this immutable sequence with an element appended.

    Note: will not terminate for infinite-sized collections.

    Example:

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

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

        scala> println(a)
        List(1)

    B

      the element type of the returned immutable sequence.

    elem

      the appended element

    returns

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

    Definition Classes
      SeqOps
21.  def appendedAll[B >: A](suffix: IterableOnce[B]): Stream[B]

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

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

    B

      the element type of the returned collection.

    suffix

      the iterable to append.

    returns

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

    Definition Classes
      SeqOps
22.  def apply(n: Int): A

    Gets the element at the specified index.

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

    Definition Classes
      LinearSeqOps → SeqOps
    Annotations
      @throws(cause = scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
23.  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
24.  final def asInstanceOf[T0]: T0

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

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

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

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

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

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

    Use pattern matching or isInstanceOf for type testing instead.

    Situations where `asInstanceOf` is useful:

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

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

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown

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

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

    Checks whether this instance can possibly equal `that`.

    Checks whether this instance can possibly equal `that`.

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

    that

      the value being probed for possible equality

    returns

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

    Definition Classes
      Seq → Equals
26.  def className: String

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

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

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

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

    returns

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

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

    Create a copy of the receiver object.

    Create a copy of the receiver object.

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

    returns

      a copy of the receiver object.

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

      not specified by SLS as a member of AnyRef

28.  final def coll: Cons.this.type

    returns

      This collection as a `C`.

    Attributes
      protected
    Definition Classes
      Iterable → IterableOps
29.  final def collect[B](pf: PartialFunction[A, B]): Stream[B]

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

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

    B

      the element type of the returned immutable sequence.

    pf

      the partial function which filters and maps the immutable sequence.

    returns

      a new immutable sequence 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
      Stream → IterableOps → IterableOnceOps
    Annotations
      @tailrec()
30.  final def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

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

    Finds the first element of the immutable sequence 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
      Stream → IterableOnceOps
    Annotations
      @tailrec()
    Example:

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

31.  def combinations(n: Int): Iterator[Stream[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 immutable sequence.

    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)

32.  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
33.  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()
34.  final def concat[B >: A](suffix: IterableOnce[B]): Stream[B]

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

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

    B

      the element type of the returned collection.

    suffix

      the iterable to append.

    returns

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    elem

      the element to test.

    returns

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqOps
37.  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 immutable sequence.

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

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

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

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

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

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

39.  def copyToArray[B >: A](xs: Array[B]): Int

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

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

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

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

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

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

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

    B

      the type of the elements of `that`

    that

      the other sequence

    p

      the test predicate, which relates elements from both sequences

    returns

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

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

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

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

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

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

    that

      the sequence of elements to remove

    returns

      a new immutable sequence which contains all elements of this immutable sequence 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
44.  def distinct: Stream[A]

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

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

    returns

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

    Definition Classes
      SeqOps
45.  def distinctBy[B](f: (A) => B): Stream[A]

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

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

    B

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

    f

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

    returns

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

    Definition Classes
      SeqOps
46.  def drop(n: Int): Stream[A]

    Selects all elements except the first `n` ones.

    Selects all elements except the first `n` ones.

    n

      the number of elements to drop from this immutable sequence.

    returns

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

    Definition Classes
      IterableOps → IterableOnceOps
47.  def dropRight(n: Int): Stream[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      the number of elements to drop from this immutable sequence.

    returns

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

    Definition Classes
      IterableOps
48.  def dropWhile(p: (A) => Boolean): Stream[A]

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

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

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

    Example:

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

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

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

    p

      The predicate used to test elements.

    returns

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

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

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

    Tests whether this immutable sequence ends with the given sequence.

    Tests whether this immutable sequence ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

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

    Checks whether this instance is equal to `that`.

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOps → IterableOnceOps
59.  def filter(pred: (A) => Boolean): Stream[A]

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

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

    returns

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

    Definition Classes
      Stream → IterableOps → IterableOnceOps
60.  def filterNot(pred: (A) => Boolean): Stream[A]

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

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

    pred

      the predicate used to test elements.

    returns

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

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

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

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

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

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

      not specified by SLS as a member of AnyRef

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

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      Stream → LinearSeqOps → IterableOnceOps
    Annotations
      @tailrec()
63.  def findLast(p: (A) => Boolean): Option[A]

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

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

    Note: will not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOps → SeqOps
64.  final def flatMap[B](f: (A) => IterableOnce[B]): Stream[B]

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

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

    For example:

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

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

        // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
        def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

        // lettersOf will return a Set[Char], not a Seq
        def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => word.toSeq)

        // xs will be an Iterable[Int]
        val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)

        // ys will be a Map[Int, Int]
        val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      Stream → IterableOps → IterableOnceOps
65.  def flatten[B](implicit asIterable: (A) => IterableOnce[B]): Stream[B]

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

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

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

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

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

    B

      the type of the elements of each iterable collection.

    asIterable

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

    returns

      a new immutable sequence resulting from concatenating all element immutable sequences.

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

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

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

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

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

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

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

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

    Note: will not terminate for infinite-sized collections.

    A1

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

    z

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

    op

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

    returns

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

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

    Stream specialization of foldLeft which allows GC to collect along the way.

    Stream specialization of foldLeft which allows GC to collect along the way.

    B

      The type of value being accumulated.

    z

      The initial value seeded into the function `op`.

    op

      The operation to perform on successive elements of the `Stream`.

    returns

      The accumulated value from successive applications of `op`.

    Definition Classes
      Stream → LinearSeqOps → IterableOnceOps
    Annotations
      @tailrec()
68.  def foldRight[B](z: B)(op: (A, B) => B): B

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

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

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

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

    Note: will not terminate for infinite-sized collections.

    B

      The result type of the binary operator.

    z

      An initial value.

    op

      A binary operator.

    returns

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOps → IterableOnceOps
70.  def force: Cons.this.type

    Forces evaluation of the whole `Stream` and returns it.

    Forces evaluation of the whole `Stream` and returns it.

    returns

      The fully realized `Stream`.

    Definition Classes
      Cons → Stream
    Note

      Often we use `Stream`s to represent an infinite set or series. If that's the case for your particular `Stream` then this function will never return and will probably crash the VM with an `OutOfMemory` exception. This function will not hang on a finite cycle, however.

71.  final def foreach[U](f: (A) => U): Unit

    Apply the given function `f` to each element of this linear sequence (while respecting the order of the elements).

    Apply the given function `f` to each element of this linear sequence (while respecting the order of the elements).

    f

      The treatment to apply to each element.

    Definition Classes
      Stream → LinearSeqOps → IterableOnceOps
    Annotations
      @tailrec()
    Note

      Overridden here as final to trigger tail-call optimization, which replaces 'this' with 'tail' at each iteration. This is absolutely necessary for allowing the GC to collect the underlying Stream as elements are consumed.

      ,

      This function will force the realization of the entire Stream unless the `f` throws an exception.

72.  def fromSpecific(coll: IterableOnce[A]): Stream[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.

73.  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()
74.  def groupBy[K](f: (A) => K): Map[K, Stream[A]]

    Partitions this immutable sequence into a map of immutable sequences according to some discriminator function.

    Partitions this immutable sequence into a map of immutable sequences according to some discriminator function.

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

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to immutable sequences such that the following invariant holds:

          (xs groupBy f)(k) = xs filter (x => f(x) == k)

      That is, every key `k` is bound to a immutable sequence of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      IterableOps
75.  def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Stream[B]]

    Partitions this immutable sequence into a map of immutable sequences according to a discriminator function `key`.

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

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

    Partitions this immutable sequence 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
77.  def grouped(size: Int): Iterator[Stream[A]]

    Partitions elements in fixed size immutable sequences.

    Partitions elements in fixed size immutable sequences.

    size

      the number of elements per group

    returns

      An iterator producing immutable sequences 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`

78.  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
79.  val head: A

    <invalid inheritdoc annotation>

    <invalid inheritdoc annotation>

    Note: *Must* be overridden in subclasses. The default implementation is inherited from IterableOps.

    Definition Classes
      Cons → LinearSeqOps → IterableOps
80.  def headOption: Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

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

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

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

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    returns

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

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

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

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

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    from

      the start index

    returns

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    from

      the start index

    returns

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

    Definition Classes
      SeqOps
85.  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 immutable sequence that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      LinearSeqOps → SeqOps
86.  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 immutable sequence that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      SeqOps
    Annotations
      @deprecatedOverriding()
87.  def indices: Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

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

    returns

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

    Definition Classes
      SeqOps
88.  def init: Stream[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
89.  def inits: Iterator[Stream[A]]

    Iterates over the inits of this immutable sequence.

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

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

    returns

      an iterator over all the inits of this immutable sequence

    Definition Classes
      IterableOps
    Example:

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

90.  def intersect[B >: A](that: collection.Seq[B]): Stream[A]

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

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

    that

      the sequence of elements to intersect with.

    returns

      a new immutable sequence which contains all elements of this immutable sequence 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
91.  def isDefinedAt(x: Int): Boolean

    Tests whether this immutable sequence contains given index.

    Tests whether this immutable sequence contains given index.

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

    returns

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

    Definition Classes
      LinearSeqOps → SeqOps
92.  def isEmpty: Boolean

    <invalid inheritdoc annotation>

    <invalid inheritdoc annotation>

    Note: *Must* be overridden in subclasses. The default implementation that is inherited from SeqOps uses `lengthCompare`, which is defined here to use `isEmpty`.

    Definition Classes
      Cons → LinearSeqOps → SeqOps → IterableOnceOps
93.  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.

94.  def isTraversableAgain: Boolean

    Tests whether this immutable sequence can be repeatedly traversed.

    Tests whether this immutable sequence 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
95.  def iterableFactory: SeqFactory[Stream]

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

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

    Definition Classes
      Stream → LinearSeq → LinearSeq → Seq → Iterable → Seq → Iterable → IterableOps
    Note

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

96.  def iterator: Iterator[A]

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

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

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

    Definition Classes
      LinearSeqOps → IterableOnce
97.  def knownSize: Int

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

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

    Definition Classes
      IterableOnce
98.  def last: A

    Selects the last element.

    Selects the last element.

    returns

      The last element of this immutable sequence.

    Definition Classes
      LinearSeqOps → IterableOps
    Exceptions thrown

      `NoSuchElementException` If the immutable sequence is empty.

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

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

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

    Note: will not terminate for infinite-sized collections.

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    end

      the end index.

    returns

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

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

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

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

     Note: will not terminate for infinite-sized collections.

     that

       the sequence to test

     returns

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

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

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

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

     Note: will not terminate for infinite-sized collections.

     that

       the sequence to test

     end

       the end index

     returns

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

     Definition Classes
       SeqOps
102.  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 immutable sequence that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       LinearSeqOps → SeqOps
103.  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 immutable sequence that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       SeqOps
     Annotations
       @deprecatedOverriding()
104.  def lastOption: Option[A]

     Optionally selects the last element.

     Optionally selects the last element.

     returns

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

     Definition Classes
       IterableOps
105.  def lazyAppendedAll[B >: A](suffix: => IterableOnce[B]): Stream[B]

     The stream resulting from the concatenation of this stream with the argument stream.

     The stream resulting from the concatenation of this stream with the argument stream.

     suffix

       The collection that gets appended to this stream

     returns

       The stream containing elements of this stream and the iterable object.

     Definition Classes
       Stream
106.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, Cons.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
107.  def length: Int

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

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

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

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

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

     that

       the `Iterable` whose size is compared with this immutable sequence'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
       LinearSeqOps → SeqOps
109.  def lengthCompare(len: Int): Int

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

     Compares the length of this immutable sequence 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
       LinearSeqOps → SeqOps
     See also

       lengthIs

110.  final def lengthIs: SizeCompareOps

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

     Returns a value class containing operations for comparing the length of this immutable sequence 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()
111.  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

112.  final def map[B](f: (A) => B): Stream[B]

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

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

     B

       the element type of the returned immutable sequence.

     f

       the function to apply to each element.

     returns

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

     Definition Classes
       Stream → IterableOps → IterableOnceOps
113.  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 immutable sequence with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable sequence is empty.

114.  def maxBy[B](f: (A) => B)(implicit ord: 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.

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable sequence is empty.

115.  def maxByOption[B](f: (A) => B)(implicit ord: 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.

     returns

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

     Definition Classes
       IterableOnceOps
116.  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 immutable sequence with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
117.  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 immutable sequence with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable sequence is empty.

118.  def minBy[B](f: (A) => B)(implicit ord: 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.

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable sequence is empty.

119.  def minByOption[B](f: (A) => B)(implicit ord: 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.

     returns

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

     Definition Classes
       IterableOnceOps
120.  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 immutable sequence with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
121.  final def mkString: String

     Displays all elements of this immutable sequence in a string.

     Displays all elements of this immutable sequence in a string.

     Delegates to addString, which can be overridden.

     returns

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

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

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

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

     Delegates to addString, which can be overridden.

     sep

       the separator string.

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
     Example:

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

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

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

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

     Delegates to addString, which can be overridden.

     start

       the starting string.

     sep

       the separator string.

     end

       the ending string.

     returns

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

     Definition Classes
       IterableOnceOps
     Example:

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

124.  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
125.  def newSpecificBuilder: Builder[A, Stream[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.

126.  def nonEmpty: Boolean

     Tests whether the immutable sequence is not empty.

     Tests whether the immutable sequence is not empty.

     returns

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

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

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

129.  def occCounts[B](sq: collection.Seq[B]): mutable.Map[B, Int]
     Attributes
       protected[collection]
     Definition Classes
       SeqOps
130.  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
131.  def padTo[B >: A](len: Int, elem: B): Stream[B]

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

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

     B

       the element type of the returned immutable sequence.

     len

       the target length

     elem

       the padding value

     returns

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

     Definition Classes
       SeqOps
132.  def partition(p: (A) => Boolean): (Stream[A], Stream[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.

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

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

     Definition Classes
       Stream → IterableOps
133.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Stream[A1], Stream[A2])

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

     Applies a function `f` to each element of the immutable sequence and returns a pair of immutable sequences: 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 = `immutable.Seq`(1, "one", 2, "two", 3, "three") partitionMap {
          case i: Int => Left(i)
          case s: String => Right(s)
         }
         // xs == (`immutable.Seq`(1, 2, 3),
         //        `immutable.Seq`(one, two, three))

     A1

       the element type of the first resulting collection

     A2

       the element type of the second resulting collection

     f

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

     returns

       a pair of immutable sequences: 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
134.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): Stream[B]

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

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

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

     B

       the element type of the returned immutable sequence.

     from

       the index of the first replaced element

     other

       the replacement sequence

     replaced

       the number of elements to drop in the original immutable sequence

     returns

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

     Definition Classes
       SeqOps
135.  def permutations: Iterator[Stream[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 immutable sequence.

     Definition Classes
       SeqOps
     Example:

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

136.  final def prepended[B >: A](elem: B): Stream[B]

     A copy of the immutable sequence with an element prepended.

     A copy of the immutable sequence with an element prepended.

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

     Example:

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

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

         scala> println(x)
         List(1)

     B

       the element type of the returned immutable sequence.

     elem

       the prepended element

     returns

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

     Definition Classes
       Stream → SeqOps
137.  def prependedAll[B >: A](prefix: IterableOnce[B]): Stream[B]

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

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

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

     B

       the element type of the returned collection.

     prefix

       the iterable to prepend.

     returns

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

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

     Multiplies together the elements of this collection.

     Multiplies together the elements of this collection.

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the `*` operator.

     num

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

     returns

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

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

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

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

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

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

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

     Note: will not terminate for infinite-sized collections.

     B

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

     op

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

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable sequence is empty.

140.  final def reduceLeft[B >: A](f: (B, A) => B): B

     Stream specialization of reduceLeft which allows GC to collect along the way.

     Stream specialization of reduceLeft which allows GC to collect along the way.

     B

       The type of value being accumulated.

     f

       The operation to perform on successive elements of the `Stream`.

     returns

       The accumulated value from successive applications of `f`.

     Definition Classes
       Stream → IterableOnceOps
141.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]

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

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

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

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

     Note: will not terminate for infinite-sized collections.

     B

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

     op

       A binary operator.

     returns

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

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

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

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

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

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

     Note: will not terminate for infinite-sized collections.

     B

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

     op

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

     returns

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

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

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

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

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

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

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

     Note: will not terminate for infinite-sized collections.

     B

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

     op

       A binary operator.

     returns

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

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this immutable sequence is empty.

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

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

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

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

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

     Note: will not terminate for infinite-sized collections.

     B

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

     op

       A binary operator.

     returns

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

     Definition Classes
       IterableOnceOps
145.  def reverse: Stream[A]

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

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

     Note: will not terminate for infinite-sized collections.

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

     returns

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

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

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

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

     Note: will not terminate for infinite-sized collections.

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

     returns

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

     Definition Classes
       SeqOps
147.  def reversed: collection.Iterable[A]
     Attributes
       protected
     Definition Classes
       IterableOnceOps
148.  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`.

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

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

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

     Definition Classes
       LinearSeqOps → SeqOps
150.  def scan[B >: A](z: B)(op: (B, B) => B): Stream[B]

     Computes a prefix scan of the elements of the collection.

     Computes a prefix scan of the elements of the collection.

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

     B

       element type of the resulting collection

     z

       neutral element for the operator `op`

     op

       the associative operator for the scan

     returns

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

     Definition Classes
       IterableOps
151.  def scanLeft[B](z: B)(op: (B, A) => B): Stream[B]

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

     Produces a immutable sequence 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
       Stream → IterableOps → IterableOnceOps
152.  def scanRight[B](z: B)(op: (A, B) => B): Stream[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
153.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult

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

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

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

     elem

       the element to find.

     from

       the index where the search starts.

     to

       the index following where the search ends.

     ord

       the ordering to be used to compare elements.

     returns

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

     Definition Classes
       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`

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

     Searches this sorted sequence for a specific element.

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

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

     elem

       the element to find.

     ord

       the ordering to be used to compare elements.

     returns

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

     Definition Classes
       SeqOps
     See also

       scala.collection.IndexedSeq

       scala.math.Ordering

       scala.collection.SeqOps, method `sorted`

155.  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 immutable sequence starting from index `from` such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       LinearSeqOps → SeqOps
156.  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 immutable sequence that starts from the first element such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       SeqOps
157.  final def size: Int

     The size of this immutable sequence.

     The size of this immutable sequence.

     Note: will not terminate for infinite-sized collections.

     returns

       the number of elements in this immutable sequence.

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

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

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

     that

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

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

     Compares the size of this immutable sequence 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

160.  final def sizeIs: SizeCompareOps

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

     Returns a value class containing operations for comparing the size of this immutable sequence 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.  def slice(from: Int, until: Int): Stream[A]

     Selects an interval of elements.

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

         from <= indexOf(x) < until

     from

       the lowest index to include from this immutable sequence.

     until

       the lowest index to EXCLUDE from this immutable sequence.

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
162.  def sliding(size: Int, step: Int): Iterator[Stream[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 immutable sequences 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`

163.  def sliding(size: Int): Iterator[Stream[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 immutable sequences 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`

164.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): Stream[A]

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

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

     Note: will not terminate for infinite-sized collections.

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

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

     B

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

     f

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

     ord

       the ordering assumed on domain `B`.

     returns

       a immutable sequence consisting of the elements of this immutable sequence 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

165.  def sortWith(lt: (A, A) => Boolean): Stream[A]

     Sorts this immutable sequence according to a comparison function.

     Sorts this immutable sequence according to a comparison function.

     Note: will not terminate for infinite-sized collections.

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

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

     lt

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

     returns

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

     Definition Classes
       SeqOps
     Example:

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

166.  def sorted[B >: A](implicit ord: Ordering[B]): Stream[A]

     Sorts this immutable sequence according to an Ordering.

     Sorts this immutable sequence according to an Ordering.

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

     ord

       the ordering to be used to compare elements.

     returns

       a immutable sequence consisting of the elements of this immutable sequence 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.

167.  def span(p: (A) => Boolean): (Stream[A], Stream[A])

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

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

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

     p

       the test predicate

     returns

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

     Definition Classes
       IterableOps → IterableOnceOps
168.  def splitAt(n: Int): (Stream[A], Stream[A])

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

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

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

     n

       the position at which to split.

     returns

       a pair of immutable sequences consisting of the first `n` elements of this immutable sequence, and the other elements.

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

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

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

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

     that

       the sequence to test

     offset

       the index where the sequence is searched.

     returns

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

     Definition Classes
       SeqOps
170.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S

     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
       IterableOnce
171.  def stringPrefix: String
     Attributes
       protected[this]
     Definition Classes
       LinearSeq → Seq → Iterable
     Annotations
       @nowarn()
172.  def sum[B >: A](implicit num: math.Numeric[B]): B

     Sums the elements of this collection.

     Sums the elements of this collection.

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the `+` operator.

     num

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

     returns

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

     Definition Classes
       IterableOnceOps
173.  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
174.  def tail: Stream[A]

     <invalid inheritdoc annotation>

     <invalid inheritdoc annotation>

     Note: *Must* be overridden in subclasses. The default implementation is inherited from IterableOps.

     Definition Classes
       Cons → Stream → LinearSeqOps → IterableOps
175.  def tailDefined: Boolean
     Attributes
       protected
     Definition Classes
       Cons → Stream
176.  def tails: Iterator[Stream[A]]

     Iterates over the tails of this immutable sequence.

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

     returns

       an iterator over all the tails of this immutable sequence

     Definition Classes
       LinearSeqOps → IterableOps
     Example:

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

177.  def take(n: Int): Stream[A]

     Selects the first `n` elements.

     Selects the first `n` elements.

     n

       the number of elements to take from this immutable sequence.

     returns

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

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

     Selects the last n elements.

     Selects the last n elements.

     n

       the number of elements to take from this immutable sequence.

     returns

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

     Definition Classes
       IterableOps
179.  def takeWhile(p: (A) => Boolean): Stream[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 immutable sequence whose elements all satisfy the predicate `p`.

     Definition Classes
       IterableOps → IterableOnceOps
180.  def tapEach[U](f: (A) => U): Stream[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 immutable sequence

     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`, converts this immutable sequence to the appropriate representation for the current element type `A`.

     Given a collection factory `factory`, converts this immutable sequence 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]

     Converts this immutable sequence to an `Array`.

     Converts this immutable sequence to an `Array`.

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

     B

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

     returns

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

     Definition Classes
       IterableOnceOps
183.  final def toBuffer[B >: A]: Buffer[B]

     Converts this immutable sequence to a `Buffer`.

     Converts this immutable sequence to a `Buffer`.

     B

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

     returns

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

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
184.  def toIndexedSeq: IndexedSeq[A]

     Converts this immutable sequence to an `IndexedSeq`.

     Converts this immutable sequence to an `IndexedSeq`.

     returns

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

     Definition Classes
       IterableOnceOps
185.  def toList: List[A]

     Converts this immutable sequence to a `List`.

     Converts this immutable sequence to a `List`.

     returns

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

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

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

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

     K

       The key type for the resulting map.

     V

       The value type for the resulting map.

     ev

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

     returns

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

     Definition Classes
       IterableOnceOps
187.  final def toSeq: Cons.this.type

     returns

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

     Definition Classes
       Seq → IterableOnceOps
188.  def toSet[B >: A]: Set[B]

     Converts this immutable sequence to a `Set`.

     Converts this immutable sequence to a `Set`.

     B

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

     returns

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

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

     returns

       a string representation of this collection. Undefined elements are represented with `"_"`, an undefined tail is represented with `"<not computed>"`, and cycles are represented with `"<cycle>"` Examples:

       - `"Stream(_, <not computed>)"`, a non-empty stream, whose head has not been evaluated ;
       - `"Stream(_, 1, _, <not computed>)"`, a stream with at least three elements, the second one has been evaluated ;
       - `"Stream(1, 2, 3, <cycle>)"`, an infinite stream that contains a cycle at the fourth element.
     Definition Classes
       Stream → Seq → Function1 → Iterable → AnyRef → Any
190.  def toVector: Vector[A]

     Converts this immutable sequence to a `Vector`.

     Converts this immutable sequence to a `Vector`.

     returns

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

     Definition Classes
       IterableOnceOps
191.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): Stream[Stream[B]]

     Transposes this immutable sequence of iterable collections into a immutable sequence of immutable sequences.

     Transposes this immutable sequence of iterable collections into a immutable sequence of immutable sequences.

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

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

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

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

     B

       the type of the elements of each iterable collection.

     asIterable

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

     returns

       a two-dimensional immutable sequence of immutable sequences which has as nth row the nth column of this immutable sequence.

     Definition Classes
       IterableOps
     Exceptions thrown

       `IllegalArgumentException` if all collections in this immutable sequence 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 Cons[A] 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)): (Stream[A1], Stream[A2])

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

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

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

     A1

       the type of the first half of the element pairs

     A2

       the type of the second half of the element pairs

     asPair

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

     returns

       a pair of immutable sequences, containing the first, respectively second half of each element pair of this immutable sequence.

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

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

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

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

     A1

       the type of the first member of the element triples

     A2

       the type of the second member of the element triples

     A3

       the type of the third member of the element triples

     asTriple

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

     returns

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

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

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

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

     B

       the element type of the returned immutable sequence.

     index

       the position of the replacement

     elem

       the replacing element

     returns

       a new immutable sequence which is a copy of this immutable sequence 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.  final def withFilter(p: (A) => Boolean): collection.WithFilter[A, Stream]

     A `collection.WithFilter` which allows GC of the head of stream during processing

     A `collection.WithFilter` which allows GC of the head of stream during processing

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       Stream → IterableOps
202.  def writeReplace(): AnyRef
     Attributes
       protected[this]
     Definition Classes
       Stream
203.  final def zip[B](that: IterableOnce[B]): Stream[(A, B)]

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

     Returns a immutable sequence formed from this immutable sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

       a new immutable sequence containing pairs consisting of corresponding elements of this immutable sequence and `that`. The length of the returned collection is the minimum of the lengths of this immutable sequence and `that`.

     Definition Classes
       Stream → IterableOps
204.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Stream[(A1, B)]

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

     Returns a immutable sequence formed from this immutable sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

     that

       the iterable providing the second half of each result pair

     thisElem

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

     thatElem

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

     returns

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

     Definition Classes
       IterableOps
205.  final def zipWithIndex: Stream[(A, Int)]

     Zips this immutable sequence with its indices.

     Zips this immutable sequence with its indices.

     returns

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

     Definition Classes
       Stream → IterableOps → IterableOnceOps
     Example:

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

### Deprecated Value Members

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

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

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldLeft instead

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

     (Since version 2.13.0) Use foldLeft instead of /:

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

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

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use .iterator.foldRight instead

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

     (Since version 2.13.0) Use foldRight instead of :\

5.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B

   Aggregates the results of applying an operator to subsequent elements.

   Aggregates the results of applying an operator to subsequent elements.

   Since this method degenerates to `foldLeft` for sequential (non-parallel) collections, where the combining operation is ignored, it is advisable to prefer `foldLeft` for that case.

   For parallel collections, use the `aggregate` method specified by `scala.collection.parallel.ParIterableLike`.

   B

     the result type, produced by `seqop`, `combop`, and by this function as a final result.

   z

     the start value, a neutral element for `seqop`.

   seqop

     the binary operator used to accumulate the result.

   combop

     an associative operator for combining sequential results, unused for sequential collections.

   Definition Classes
     IterableOnceOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) For sequential collections, prefer `foldLeft(z)(seqop)`. For parallel collections, use `ParIterableLike#aggregate`.

6.  final def append[B >: A](rest: => IterableOnce[B]): Stream[B]

   The stream resulting from the concatenation of this stream with the argument stream.

   The stream resulting from the concatenation of this stream with the argument stream.

   rest

     The collection that gets appended to this stream

   returns

     The stream containing elements of this stream and the iterable object.

   Definition Classes
     Stream
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) The `append` operation has been renamed `lazyAppendedAll`

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

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

   Definition Classes
     IterableOnceExtensionMethods
   Annotations
     @deprecated
   Deprecated

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

8.  def companion: IterableFactory[[_]Stream[_]]
   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 Cons[A] 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:

         (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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): Iterator[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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) => IterableOnce[B]): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] toStringFormat[Cons[A]] 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 immutable sequence is known to have a finite size.

    Tests whether this immutable sequence 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
      Stream → 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 Cons[A] 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:

          (cons: 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): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 Cons[A] 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:

          (cons: 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 immutable sequence 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 print(sep: String): Unit

    Prints elements of this stream one by one, separated by `sep`.

    Prints elements of this stream one by one, separated by `sep`.

    sep

      The separator string printed between consecutive elements.

    Definition Classes
      Stream
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use print(stream.force.mkString(sep)) instead

35.  def print(): Unit

    Prints elements of this stream one by one, separated by commas.

    Prints elements of this stream one by one, separated by commas.

    Definition Classes
      Stream
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use print(stream.force.mkString(", ")) instead

36.  def product(implicit num: math.Numeric[A]): A
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.product instead

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

43.  final def repr: Stream[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

44.  def reverseMap[B](f: (A) => B): Stream[B]
    Definition Classes
      SeqOps
    Annotations
      @deprecated
    Deprecated

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

45.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sameElements instead

46.  def seq: Cons.this.type
    Definition Classes
      Iterable
    Annotations
      @deprecated
    Deprecated

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

47.  def size: Int
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).size

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.size instead

48.  def sum(implicit num: math.Numeric[A]): A
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sum instead

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toArray

51.  def toBuffer[B >: A]: Buffer[B]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toBuffer

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

52.  def toIndexedSeq: collection.IndexedSeq[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toIndexedSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toIndexedSeq instead

53.  final def toIterable: collection.Iterable[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toIterable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

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

54.  final def toIterable: Cons.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

55.  def toIterator: Iterator[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toIterator

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead

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

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

57.  def toList: List[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toList

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

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

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

59.  def toSeq: Seq[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

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

60.  def toSet[B >: A]: Set[B]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toSet

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

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

61.  def toStream: Stream[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toStream

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

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

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

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

63.  final def toTraversable: collection.Traversable[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toTraversable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

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

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

    Converts this immutable sequence to an unspecified Iterable.

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

    returns

      An Iterable containing all elements of this immutable sequence.

    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

65.  def toVector: Vector[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

          (cons: IterableOnceExtensionMethods[A]).toVector

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

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

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

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

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

    B

      the element type of the returned immutable sequence.

    that

      the sequence to add.

    returns

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

    Definition Classes
      SeqOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `concat` instead

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

68.  def withFilter(f: (A) => Boolean): Iterator[A]
    Implicit
      This member is added by an implicit conversion from Cons[A] 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:

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

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

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

69.  def →[B](y: B): (Cons[A], B)
    Implicit
      This member is added by an implicit conversion from Cons[A] toArrowAssoc[Cons[A]] 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 Stream[A]

### Inherited from java.io.Serializable

### Inherited from LinearSeq[A]

### Inherited from LinearSeqOps[A, [X]Stream[X], Stream[A]]

### Inherited from collection.LinearSeq[A]

### Inherited from collection.LinearSeqOps[A, [X]Stream[X], Stream[A]]

### Inherited from AbstractSeq[A]

### Inherited from Seq[A]

### Inherited from SeqOps[A, [_]Stream[_], Stream[A]]

### Inherited from Iterable[A]

### Inherited from collection.AbstractSeq[A]

### Inherited from collection.Seq[A]

### Inherited from Equals

### Inherited from collection.SeqOps[A, [_]Stream[_], Stream[A]]

### Inherited from PartialFunction[Int, A]

### Inherited from (Int) => A

### Inherited from AbstractIterable[A]

### Inherited from collection.Iterable[A]

### Inherited from IterableFactoryDefaults[A, [x]Stream[x]]

### Inherited from IterableOps[A, [_]Stream[_], Stream[A]]

### Inherited from IterableOnceOps[A, [_]Stream[_], Stream[A]]

### Inherited from IterableOnce[A]

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion UnliftOps fromCons[A] to UnliftOps[Int, B]

### Inherited by implicit conversion iterableOnceExtensionMethods fromCons[A] to IterableOnceExtensionMethods[A]

### Inherited by implicit conversion toDeferrer fromCons[A] to Deferrer[A]

### Inherited by implicit conversion any2stringadd fromCons[A] to any2stringadd[Cons[A]]

### Inherited by implicit conversion StringFormat fromCons[A] to StringFormat[Cons[A]]

### Inherited by implicit conversion Ensuring fromCons[A] to Ensuring[Cons[A]]

### Inherited by implicit conversion ArrowAssoc fromCons[A] to ArrowAssoc[Cons[A]]

### Ungrouped