Packages

sealed abstract class Range extends AbstractSeq[Int] with IndexedSeq[Int] with IndexedSeqOps[Int, IndexedSeq, IndexedSeq[Int]] with StrictOptimizedSeqOps[Int, IndexedSeq, IndexedSeq[Int]] with IterableFactoryDefaults[Int, IndexedSeq] with Serializable

The Range class represents integer values in range [start;end) with non-zero step value step. It's a special case of an indexed sequence. For example:

val r1 = 0 until 10
val r2 = r1.start until r1.end by r1.step + 1
println(r2.length) // = 5

Ranges that contain more than Int.MaxValue elements can be created, but these overfull ranges have only limited capabilities. Any method that could require a collection of over Int.MaxValue length to be created, or could be asked to index beyond Int.MaxValue elements will throw an exception. Overfull ranges can safely be reduced in size by changing the step size (e.g. by 3) or taking/dropping elements. contains, equals, and access to the ends of the range (head, last, tail, init) are also permitted on overfull ranges.

Self Type
Range
Annotations
@SerialVersionUID()
Source
Range.scala
Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Range
  2. Serializable
  3. StrictOptimizedSeqOps
  4. StrictOptimizedSeqOps
  5. StrictOptimizedIterableOps
  6. IndexedSeq
  7. IndexedSeqOps
  8. IndexedSeq
  9. IndexedSeqOps
  10. AbstractSeq
  11. Seq
  12. SeqOps
  13. Iterable
  14. AbstractSeq
  15. Seq
  16. Equals
  17. SeqOps
  18. PartialFunction
  19. Function1
  20. AbstractIterable
  21. Iterable
  22. IterableFactoryDefaults
  23. IterableOps
  24. IterableOnceOps
  25. IterableOnce
  26. AnyRef
  27. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def isInclusive: Boolean

Concrete Value Members

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

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

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

    Equivalent to x.hashCode except for boxed numeric types and null. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null returns a hashcode where null.hashCode throws a NullPointerException.

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from Range toany2stringadd[Range] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def ++[B >: Int](suffix: IterableOnce[B]): IndexedSeq[B]

    Alias for concat

    Alias for concat

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

    Alias for prependedAll.

    Alias for prependedAll.

    Definition Classes
    SeqOpsIterableOps
    Annotations
    @inline()
  6. final def +:[B >: Int](elem: B): IndexedSeq[B]

    Alias for prepended.

    Alias for prepended.

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

    Definition Classes
    SeqOps
    Annotations
    @inline()
  7. def ->[B](y: B): (Range, B)
    Implicit
    This member is added by an implicit conversion from Range toArrowAssoc[Range] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. final def :+[B >: Int](elem: B): IndexedSeq[B]

    Alias for appended.

    Alias for appended.

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

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

    Alias for appendedAll.

    Alias for appendedAll.

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

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

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

    returns

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

    Definition Classes
    AnyRef → Any
  11. final def addString(b: mutable.StringBuilder): b.type

    Appends all elements of this range to a string builder.

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

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    h: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

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

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

    Appends all elements of this range 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 range, separated by the string sep.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, ", ")
    res0: StringBuilder = 1, 2, 3, 4
    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

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

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

    Appends all elements of this range 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 range are separated by the string sep.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b , "List(" , ", " , ")")
    res5: StringBuilder = List(1, 2, 3, 4)
    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

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

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

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

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

    Definition Classes
    PartialFunction
  15. def andThen[C](k: (Int) => 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
    PartialFunctionFunction1
  16. def appended[B >: Int](elem: B): IndexedSeq[B]

    A copy of this range with an element appended.

    A copy of this range with an element appended.

    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 range.

    elem

    the appended element

    returns

    a new range consisting of all elements of this range followed by value.

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  17. def appendedAll[B >: Int](suffix: IterableOnce[B]): IndexedSeq[B]

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

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

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  18. final def apply(idx: Int): Int

    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
    RangeSeqOpsFunction1
    Annotations
    @throws(cause = scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
  19. def applyOrElse[A1 <: Int, B1 >: Int](x: A1, default: (A1) => B1): B1

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

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

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

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

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

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

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

    x

    the function argument

    default

    the fallback function

    returns

    the result of this function or fallback function application.

    Definition Classes
    PartialFunction
  20. final def applyPreferredMaxLength: Int

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

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

    returns

    a hint about when to use apply or iterator

    Attributes
    protected
    Definition Classes
    RangeIndexedSeq
  21. final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown

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

  22. final def by(step: Int): Range

    Create a new range with the start and end values of this range and a new step.

    Create a new range with the start and end values of this range and a new step.

    returns

    a new range with a different step

  23. 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
    IndexedSeqSeqEquals
  24. def className: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

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

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

    returns

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

    Attributes
    protected[this]
    Definition Classes
    RangeIterable
  25. 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

  26. final def coll: Range.this.type

    returns

    This collection as a C.

    Attributes
    protected
    Definition Classes
    IterableIterableOps
  27. def collect[B](pf: PartialFunction[Int, B]): IndexedSeq[B]

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

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

    B

    the element type of the returned range.

    pf

    the partial function which filters and maps the range.

    returns

    a new range 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
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  28. def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

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

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

    pf

    the partial function

    returns

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

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

  29. def combinations(n: Int): Iterator[IndexedSeq[Int]]

    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 range.

    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)
  30. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Int]

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

    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()
  32. final def concat[B >: Int](suffix: IterableOnce[B]): IndexedSeq[B]

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

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

    Definition Classes
    SeqOpsIterableOps
    Annotations
    @inline()
  33. final def contains[B >: Int](elem: B): Boolean

    Tests whether this range contains a given value as an element.

    Tests whether this range contains a given value as an element.

    elem

    the element to test.

    returns

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

    Definition Classes
    RangeSeqOps
  34. final def contains(x: Int): Boolean
  35. def containsSlice[B >: Int](that: collection.Seq[B]): Boolean

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

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

    that

    the sequence to test

    returns

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

    Definition Classes
    SeqOps
  36. final def copy(start: Int = start, end: Int = end, step: Int = step, isInclusive: Boolean = isInclusive): Range
    Attributes
    protected
  37. def copyToArray[B >: Int](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 range.

    Copying will stop once either all the elements of this range 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 >: Int](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 range.

    Copying will stop once either all the elements of this range 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 >: Int](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 range.

    Copying will stop once either all the elements of this range 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: (Int, B) => Boolean): Boolean

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

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

    Definition Classes
    SeqOps
  41. def corresponds[B](that: IterableOnce[B])(p: (Int, 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.

    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: (Int) => Boolean): Int

    Counts the number of elements in the range which satisfy a predicate.

    Counts the number of elements in the range which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    IterableOnceOps
  43. def diff[B >: Int](that: collection.Seq[B]): IndexedSeq[Int]

    Computes the multiset difference between this range and another sequence.

    Computes the multiset difference between this range and another sequence.

    that

    the sequence of elements to remove

    returns

    a new range which contains all elements of this range 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
    StrictOptimizedSeqOpsSeqOps
  44. def distinct: Range

    Selects all the elements of this range ignoring the duplicates.

    Selects all the elements of this range ignoring the duplicates.

    returns

    a new range consisting of all the elements of this range without duplicates.

    Definition Classes
    RangeSeqOps
  45. def distinctBy[B](f: (Int) => B): IndexedSeq[Int]

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

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

    Definition Classes
    StrictOptimizedSeqOpsStrictOptimizedSeqOpsSeqOps
  46. final def drop(n: Int): Range

    Creates a new range containing all the elements of this range except the first n elements.

    Creates a new range containing all the elements of this range except the first n elements.

    n

    the number of elements to drop.

    returns

    a new range consisting of all the elements of this range except n first elements.

    Definition Classes
    RangeIndexedSeqOpsIterableOpsIterableOnceOps
  47. final def dropRight(n: Int): Range

    Creates a new range consisting of the initial length - n elements of the range.

    Creates a new range consisting of the initial length - n elements of the range.

    Note: this method does not use builders to construct a new range, and its complexity is O(1).

    n

    the number of elements to drop from this range.

    returns

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

    Definition Classes
    RangeStrictOptimizedIterableOpsIndexedSeqOpsIterableOps
  48. final def dropWhile(p: (Int) => Boolean): Range

    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 range, 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 range.

    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 range whose first element does not satisfy the predicate p.

    Definition Classes
    RangeIterableOpsIterableOnceOps
  49. def elementWise: ElementWiseExtractor[Int, Int]

    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: IndexedSeq[Int]

    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
    IterableFactoryDefaultsIterableOps
  51. val end: Int
  52. def endsWith[B >: Int](that: collection.Iterable[B]): Boolean

    Tests whether this range ends with the given sequence.

    Tests whether this range ends with the given sequence.

    that

    the sequence to test

    returns

    true if this range has that as a suffix, false otherwise.

    Definition Classes
    SeqOps
  53. def ensuring(cond: (Range) => Boolean, msg: => Any): Range
    Implicit
    This member is added by an implicit conversion from Range toEnsuring[Range] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  54. def ensuring(cond: (Range) => Boolean): Range
    Implicit
    This member is added by an implicit conversion from Range toEnsuring[Range] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  55. def ensuring(cond: Boolean, msg: => Any): Range
    Implicit
    This member is added by an implicit conversion from Range toEnsuring[Range] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  56. def ensuring(cond: Boolean): Range
    Implicit
    This member is added by an implicit conversion from Range toEnsuring[Range] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  57. 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
  58. final def equals(other: 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
    RangeSeqEquals → AnyRef → Any
  59. def exists(p: (Int) => Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOnceOps
  60. def filter(pred: (Int) => Boolean): IndexedSeq[Int]

    Selects all elements of this range which satisfy a predicate.

    Selects all elements of this range which satisfy a predicate.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  61. def filterImpl(pred: (Int) => Boolean, isFlipped: Boolean): IndexedSeq[Int]
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  62. def filterNot(pred: (Int) => Boolean): IndexedSeq[Int]

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

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

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  63. 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

  64. def find(p: (Int) => Boolean): Option[Int]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOnceOps
  65. def findLast(p: (Int) => Boolean): Option[Int]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    SeqOps
  66. def flatMap[B](f: (Int) => IterableOnce[B]): IndexedSeq[B]

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

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  67. def flatten[B](implicit toIterableOnce: (Int) => IterableOnce[B]): IndexedSeq[B]

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

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

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

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

    the type of the elements of each iterable collection.

    returns

    a new range resulting from concatenating all element ranges.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  68. def fold[A1 >: Int](z: A1)(op: (A1, A1) => A1): A1

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

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

    For each application of the operator, each operand is either an element of this range, 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.

    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 range is empty.

    Definition Classes
    IterableOnceOps
  69. def foldLeft[B](z: B)(op: (B, Int) => B): B

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

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

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

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

    B

    The result type of the binary operator.

    z

    An initial value.

    op

    A binary operator.

    returns

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

    Definition Classes
    IterableOnceOps
  70. def foldRight[B](z: B)(op: (Int, B) => B): B

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

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

    "Going right to left" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this range, 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 range and the initial value all appear exactly once in the computation.

    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 range and z, going right to left. Returns z if this range is empty.

    Definition Classes
    IndexedSeqOpsIterableOnceOps
  71. def forall(p: (Int) => Boolean): Boolean

    Tests whether a predicate holds for all elements of this range.

    Tests whether a predicate holds for all elements of this range.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOnceOps
  72. final def foreach[U](f: (Int) => U): Unit

    Applies f to each element for its side effects.

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

    Definition Classes
    RangeIterableOnceOps
  73. def fromSpecific(coll: IterableOnce[Int]): IndexedSeq[Int]

    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
    IterableFactoryDefaultsIterableOps
    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.

  74. 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()
  75. def groupBy[K](f: (Int) => K): Map[K, IndexedSeq[Int]]

    Partitions this range into a map of ranges according to some discriminator function.

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

    Definition Classes
    IterableOps
  76. def groupMap[K, B](key: (Int) => K)(f: (Int) => B): Map[K, IndexedSeq[B]]

    Partitions this range into a map of ranges according to a discriminator function key.

    Partitions this range into a map of ranges 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
  77. def groupMapReduce[K, B](key: (Int) => K)(f: (Int) => B)(reduce: (B, B) => B): Map[K, B]

    Partitions this range into a map according to a discriminator function key.

    Partitions this range 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
  78. def grouped(size: Int): Iterator[Range]

    Partitions elements in fixed size ranges.

    Partitions elements in fixed size ranges.

    size

    the number of elements per group

    returns

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

    Definition Classes
    RangeIterableOps
    See also

    scala.collection.Iterator, method grouped

  79. final 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
    RangeSeq → AnyRef → Any
  80. final def head: Int

    Selects the first element of this range.

    Selects the first element of this range.

    returns

    the first element of this range.

    Definition Classes
    RangeIndexedSeqOpsIterableOps
    Exceptions thrown

    NoSuchElementException if the range is empty.

  81. def headOption: Option[Int]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this range if it is nonempty, None if it is empty.

    Definition Classes
    IndexedSeqOpsIterableOps
  82. final def inclusive: Range

    Make range inclusive.

  83. final def indexOf[B >: Int](elem: B, from: Int = 0): Int

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

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

    Definition Classes
    RangeSeqOps
  84. def indexOf[B >: Int](elem: B): Int

    Finds index of first occurrence of some value in this range.

    Finds index of first occurrence of some value in this range.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  85. def indexOfSlice[B >: Int](that: collection.Seq[B]): Int

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

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

    that

    the sequence to test

    returns

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

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

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

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

    that

    the sequence to test

    from

    the start index

    returns

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

    Definition Classes
    SeqOps
  87. def indexWhere(p: (Int) => Boolean): Int

    Finds index of the first element satisfying some predicate.

    Finds index of the first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

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

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

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

    p

    the predicate used to test elements.

    from

    the start index

    returns

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

    Definition Classes
    SeqOps
  89. 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 range.

    Definition Classes
    SeqOps
  90. final def init: Range

    Creates a new range containing all the elements of this range except the last one.

    Creates a new range containing all the elements of this range except the last one.

    Note: this method does not use builders to construct a new range, and its complexity is O(1).

    returns

    a new range consisting of all the elements of this range except the last one.

    Definition Classes
    RangeIterableOps
  91. def inits: Iterator[Range]

    Iterates over the inits of this range.

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

    Definition Classes
    RangeIterableOps
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  92. def intersect[B >: Int](that: collection.Seq[B]): IndexedSeq[Int]

    Computes the multiset intersection between this range and another sequence.

    Computes the multiset intersection between this range and another sequence.

    that

    the sequence of elements to intersect with.

    returns

    a new range which contains all elements of this range 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
    StrictOptimizedSeqOpsSeqOps
  93. def isDefinedAt(idx: Int): Boolean

    Tests whether this range contains given index.

    Tests whether this range contains given index.

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

    idx

    the index to test

    returns

    true if this range contains an element at position idx, false otherwise.

    Definition Classes
    SeqOps
  94. final val isEmpty: Boolean

    Tests whether the range is empty.

    Tests whether the range is empty.

    Note: The default implementation creates and discards an iterator.

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

    returns

    true if the range contains no elements, false otherwise.

    Definition Classes
    RangeSeqOpsIterableOnceOps
  95. 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.

  96. def isTraversableAgain: Boolean

    Tests whether this range can be repeatedly traversed.

    Tests whether this range 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
    IterableOpsIterableOnceOps
  97. def iterableFactory: SeqFactory[IndexedSeq]

    The companion object of this range, providing various factory methods.

    The companion object of this range, providing various factory methods.

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

  98. final def iterator: Iterator[Int]

    An scala.collection.Iterator over the elements of this range.

    An scala.collection.Iterator over the elements of this range.

    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
    RangeIndexedSeqOpsIterableOnce
  99. def knownSize: Int

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

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

    Definition Classes
    IndexedSeqOpsIterableOnce
  100. final def last: Int

    The last element of this range.

    The last element of this range. This method will return the correct value even if there are too many elements to iterate over.

    returns

    The last element of this range.

    Definition Classes
    RangeIndexedSeqOpsIterableOps
  101. final def lastIndexOf[B >: Int](elem: B, end: Int = length - 1): Int

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

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

    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 range that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    RangeSeqOps
  102. def lastIndexOfSlice[B >: Int](that: collection.Seq[B]): Int

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

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

    that

    the sequence to test

    returns

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

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

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

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

    that

    the sequence to test

    end

    the end index

    returns

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

    Definition Classes
    SeqOps
  104. def lastIndexWhere(p: (Int) => Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

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

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    SeqOps
  106. def lastOption: Option[Int]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this range$ if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  107. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Int, B, Range.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
  108. final def length: Int

    The length (number of elements) of the range.

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

    Definition Classes
    RangeSeqOps
  109. final def lengthCompare(that: collection.Iterable[_]): Int

    Compares the length of this range to the size of another Iterable.

    Compares the length of this range to the size of another Iterable.

    that

    the Iterable whose size is compared with this range'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
    IndexedSeqOpsSeqOps
  110. final def lengthCompare(len: Int): Int

    Compares the length of this range to a test value.

    Compares the length of this range 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
    IndexedSeqOpsSeqOps
    See also

    lengthIs

  111. final def lengthIs: SizeCompareOps

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

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

    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

  113. def map[B](f: (Int) => B): IndexedSeq[B]

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

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

    B

    the element type of the returned range.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    RangeStrictOptimizedIterableOpsIndexedSeqOpsIterableOpsIterableOnceOps
  114. final def max[A1 >: Int](implicit ord: Ordering[A1]): Int

    Finds the largest element.

    Finds the largest element.

    ord

    An ordering to be used for comparing elements.

    returns

    the largest element of this range with respect to the ordering ord.

    Definition Classes
    RangeIterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this range is empty.

  115. def maxBy[B](f: (Int) => B)(implicit ord: math.Ordering[B]): Int

    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.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

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

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this range is empty.

  116. def maxByOption[B](f: (Int) => B)(implicit ord: math.Ordering[B]): Option[Int]

    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.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

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

    Definition Classes
    IterableOnceOps
  117. def maxOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]

    Finds the largest element.

    Finds the largest element.

    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 range with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  118. final def min[A1 >: Int](implicit ord: Ordering[A1]): Int

    Finds the smallest element.

    Finds the smallest element.

    ord

    An ordering to be used for comparing elements.

    returns

    the smallest element of this range with respect to the ordering ord.

    Definition Classes
    RangeIterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this range is empty.

  119. def minBy[B](f: (Int) => B)(implicit ord: math.Ordering[B]): Int

    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.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

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

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this range is empty.

  120. def minByOption[B](f: (Int) => B)(implicit ord: math.Ordering[B]): Option[Int]

    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.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

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

    Definition Classes
    IterableOnceOps
  121. def minOption[B >: Int](implicit ord: math.Ordering[B]): Option[Int]

    Finds the smallest element.

    Finds the smallest element.

    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 range with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  122. final def mkString: String

    Displays all elements of this range in a string.

    Displays all elements of this range in a string.

    Delegates to addString, which can be overridden.

    returns

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

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

    Displays all elements of this range in a string using a separator string.

    Displays all elements of this range in a string using a separator string.

    Delegates to addString, which can be overridden.

    sep

    the separator string.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

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

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

    Definition Classes
    IterableOnceOps
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  125. 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
  126. def newSpecificBuilder: Builder[Int, IndexedSeq[Int]]

    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
    IterableFactoryDefaultsIterableOps
    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.

  127. def nonEmpty: Boolean

    Tests whether the range is not empty.

    Tests whether the range is not empty.

    returns

    true if the range contains at least one element, false otherwise.

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

  129. 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

  130. def occCounts[B](sq: collection.Seq[B]): mutable.Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  131. def orElse[A1 <: Int, B1 >: Int](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
  132. def padTo[B >: Int](len: Int, elem: B): IndexedSeq[B]

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

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

    B

    the element type of the returned range.

    len

    the target length

    elem

    the padding value

    returns

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

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  133. def partition(p: (Int) => Boolean): (IndexedSeq[Int], IndexedSeq[Int])

    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 range 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
    StrictOptimizedIterableOpsIterableOps
  134. def partitionMap[A1, A2](f: (Int) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])

    Applies a function f to each element of the range and returns a pair of ranges: 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 range and returns a pair of ranges: 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 range to an scala.util.Either

    returns

    a pair of ranges: 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
    StrictOptimizedIterableOpsIterableOps
  135. def patch[B >: Int](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]

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

    Produces a new range where a slice of elements in this range 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 range 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 range.

    from

    the index of the first replaced element

    other

    the replacement sequence

    replaced

    the number of elements to drop in the original range

    returns

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

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  136. def permutations: Iterator[IndexedSeq[Int]]

    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 range.

    Definition Classes
    SeqOps
    Example:
    1. Seq('a', 'b', 'b').permutations.foreach(println)
      // List(a, b, b)
      // List(b, a, b)
      // List(b, b, a)
  137. def prepended[B >: Int](elem: B): IndexedSeq[B]

    A copy of the range with an element prepended.

    A copy of the range with an element prepended.

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

    elem

    the prepended element

    returns

    a new range consisting of value followed by all elements of this range.

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  138. def prependedAll[B >: Int](prefix: IterableOnce[B]): IndexedSeq[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 range which contains all elements of prefix followed by all the elements of this range.

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  139. def product[B >: Int](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.

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

    Definition Classes
    IterableOnceOps
  140. def reduce[B >: Int](op: (B, B) => B): B

    Applies the given binary operator op to all elements of this range.

    Applies the given binary operator op to all elements of this range.

    For each application of the operator, each operand is either an element of this range 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.

    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 range is nonempty.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this range is empty.

  141. def reduceLeft[B >: Int](op: (B, Int) => B): B

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

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

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

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

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

    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 range, going left to right.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this range is empty.

  142. def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]

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

    If this range 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 range 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.

    B

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

    op

    A binary operator.

    returns

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

    Definition Classes
    IterableOnceOps
  143. def reduceOption[B >: Int](op: (B, B) => B): Option[B]

    If this range is nonempty, reduces it with the given binary operator op.

    If this range 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 range 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.

    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 range with op if the range is nonempty, inside a Some, and None otherwise.

    Definition Classes
    IterableOnceOps
  144. def reduceRight[B >: Int](op: (Int, B) => B): B

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

    Applies the given binary operator op to all elements of this range, 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 range, 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 range 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.

    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 range, going right to left.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this range is empty.

  145. def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]

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

    If this range 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 range 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.

    B

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

    op

    A binary operator.

    returns

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

    Definition Classes
    IterableOnceOps
  146. final def reverse: Range

    Returns the reverse of this range.

    Returns the reverse of this range.

    returns

    a new range with all elements of this range in reverse order.

    Definition Classes
    RangeIndexedSeqOpsSeqOps
  147. def reverseIterator: Iterator[Int]

    An iterator yielding the elements of this range in reverse order.

    An iterator yielding the elements of this range in reverse order.

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

    returns

    an iterator yielding the elements of this range in reverse order.

    Definition Classes
    IndexedSeqOpsSeqOps
  148. def reversed: collection.Iterable[Int]
    Attributes
    protected
    Definition Classes
    IndexedSeqOpsIterableOnceOps
  149. def runWith[U](action: (Int) => 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.

  150. def sameElements[B >: Int](that: scala.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
    RangeIndexedSeqSeqOps
  151. def scan[B >: Int](z: B)(op: (B, B) => B): IndexedSeq[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 range containing the prefix scan of the elements in this range

    Definition Classes
    IterableOps
  152. def scanLeft[B](z: B)(op: (B, Int) => B): IndexedSeq[B]

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

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

    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
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  153. def scanRight[B](z: B)(op: (Int, B) => B): IndexedSeq[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: 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
  154. def search[B >: Int](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult

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

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

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

    elem

    the element to find.

    from

    the index where the search starts.

    to

    the index following where the search ends.

    ord

    the ordering to be used to compare elements.

    returns

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

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

  155. def search[B >: Int](elem: B)(implicit ord: math.Ordering[B]): SearchResult

    Searches this sorted sequence for a specific element.

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

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

    elem

    the element to find.

    ord

    the ordering to be used to compare elements.

    returns

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

    Definition Classes
    IndexedSeqOpsSeqOps
    See also

    scala.collection.IndexedSeq

    scala.math.Ordering

    scala.collection.SeqOps, method sorted

  156. def segmentLength(p: (Int) => 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.

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

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

    Definition Classes
    SeqOps
  157. final def segmentLength(p: (Int) => 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.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    SeqOps
  158. final def size: Int

    The size of this range.

    The size of this range.

    returns

    the number of elements in this range.

    Definition Classes
    SeqOpsIterableOnceOps
  159. final def sizeCompare(that: collection.Iterable[_]): Int

    Compares the size of this range to the size of another Iterable.

    Compares the size of this range to the size of another Iterable.

    that

    the Iterable whose size is compared with this range'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
    SeqOpsIterableOps
  160. final def sizeCompare(otherSize: Int): Int

    Compares the size of this range to a test value.

    Compares the size of this range 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
    SeqOpsIterableOps
    See also

    sizeIs

  161. final def sizeIs: SizeCompareOps

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

    Returns a value class containing operations for comparing the size of this range 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()
  162. final def slice(from: Int, until: Int): Range

    Creates a new range containing the elements starting at from up to but not including until.

    Creates a new range containing the elements starting at from up to but not including until.

    Note: this method does not use builders to construct a new range, and its complexity is O(1).

    from

    the element at which to start

    until

    the element at which to end (not included in the range)

    returns

    a new range consisting of a contiguous interval of values in the old range

    Definition Classes
    RangeIndexedSeqOpsIndexedSeqOpsIterableOpsIterableOnceOps
  163. def sliding(size: Int, step: Int): Iterator[IndexedSeq[Int]]

    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 ranges 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. ,
    3. List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))

    See also

    scala.collection.Iterator, method sliding

  164. def sliding(size: Int): Iterator[IndexedSeq[Int]]

    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 ranges 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. ,
    3. List(1).sliding(2) = Iterator(List(1))

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

    6. ,
    7. List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))

    See also

    scala.collection.Iterator, method sliding

  165. def sortBy[B](f: (Int) => B)(implicit ord: Ordering[B]): IndexedSeq[Int]

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

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

    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 range consisting of the elements of this range sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

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

    scala.math.Ordering

  166. def sortWith(lt: (Int, Int) => Boolean): IndexedSeq[Int]

    Sorts this range according to a comparison function.

    Sorts this range according to a comparison function.

    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 range consisting of the elements of this range 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")
  167. def sorted[B >: Int](implicit ord: Ordering[B]): IndexedSeq[Int]

    Sorts this range according to an Ordering.

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

    Definition Classes
    RangeStrictOptimizedSeqOpsSeqOps
    See also

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

  168. final def span(p: (Int) => Boolean): (Range, Range)

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

    Splits this range 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 range whose elements all satisfy p, and the rest of this range.

    Definition Classes
    RangeStrictOptimizedIterableOpsIterableOpsIterableOnceOps
  169. final def splitAt(n: Int): (Range, Range)

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

    Splits this range 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 ranges consisting of the first n elements of this range, and the other elements.

    Definition Classes
    RangeIterableOpsIterableOnceOps
  170. val start: Int
  171. def startsWith[B >: Int](that: IterableOnce[B], offset: Int = 0): Boolean

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

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

    Definition Classes
    SeqOps
  172. val step: Int
  173. final def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S with EfficientSplit

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

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

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

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

    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
    RangeIndexedSeqOpsIterableOnce
  174. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Int, B]): C2

    B

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

    C2

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

    b

    Builder to use to build the resulting collection

    pf

    Element transformation partial function

    returns

    The resulting collection

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

    B

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

    C2

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

    that

    Elements to concatenate to this collection

    b

    Builder to use to build the resulting collection

    returns

    The resulting collection

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

    B

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

    C2

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

    b

    Builder to use to build the resulting collection

    f

    Element transformation function

    returns

    The resulting collection

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

    B

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

    C2

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

    b

    Builder to use to build the resulting collection

    toIterableOnce

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

    returns

    The resulting collection

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

    B

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

    C2

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

    b

    Builder to use to build the resulting collection

    f

    Element transformation function

    returns

    The resulting collection

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

    B

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

    C2

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

    that

    Collection to zip with this collection

    b

    Builder to use to build the resulting collection

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  180. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqSeqIterable
    Annotations
    @nowarn()
  181. final def sum[B >: Int](implicit num: Numeric[B]): Int

    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.

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

    Definition Classes
    RangeIterableOnceOps
  182. 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
  183. final def tail: Range

    Creates a new range containing all the elements of this range except the first one.

    Creates a new range containing all the elements of this range except the first one.

    Note: this method does not use builders to construct a new range, and its complexity is O(1).

    returns

    a new range consisting of all the elements of this range except the first one.

    Definition Classes
    RangeIterableOps
  184. def tails: Iterator[Range]

    Iterates over the tails of this range.

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

    returns

    an iterator over all the tails of this range

    Definition Classes
    RangeIterableOps
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  185. final def take(n: Int): Range

    Creates a new range containing the first n elements of this range.

    Creates a new range containing the first n elements of this range.

    n

    the number of elements to take.

    returns

    a new range consisting of n first elements.

    Definition Classes
    RangeIndexedSeqOpsIterableOpsIterableOnceOps
  186. final def takeRight(n: Int): Range

    Creates a new range consisting of the last n elements of the range.

    Creates a new range consisting of the last n elements of the range.

    Note: this method does not use builders to construct a new range, and its complexity is O(1).

    n

    the number of elements to take from this range.

    returns

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

    Definition Classes
    RangeStrictOptimizedIterableOpsIndexedSeqOpsIterableOps
  187. final def takeWhile(p: (Int) => Boolean): Range

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

    Definition Classes
    RangeIterableOpsIterableOnceOps
  188. def tapEach[U](f: (Int) => U): IndexedSeq[Int]

    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 range

    returns

    The same logical collection as this

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  189. def to[C1](factory: Factory[Int, C1]): C1

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

    Given a collection factory factory, converts this range 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
  190. def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]

    Converts this range to an Array.

    Converts this range 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 range as an Array[B].

    Definition Classes
    IterableOnceOps
  191. final def toBuffer[B >: Int]: Buffer[B]

    Converts this range to a Buffer.

    Converts this range to a Buffer.

    B

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

    returns

    This range as a Buffer[B].

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  192. final def toIndexedSeq: IndexedSeq[Int]

    Converts this range to an IndexedSeq.

    Converts this range to an IndexedSeq.

    returns

    This range as an IndexedSeq[A].

    Definition Classes
    IndexedSeqIterableOnceOps
  193. def toList: List[Int]

    Converts this range to a List.

    Converts this range to a List.

    returns

    This range as a List[A].

    Definition Classes
    IterableOnceOps
  194. def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]

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

    Converts this range to a Map, given an implicit coercion from the range'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 range as a Map[K, V].

    Definition Classes
    IterableOnceOps
  195. final def toSeq: Range.this.type

    returns

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

    Definition Classes
    SeqIterableOnceOps
  196. def toSet[B >: Int]: Set[B]

    Converts this range to a Set.

    Converts this range to a Set.

    B

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

    returns

    This range as a Set[B].

    Definition Classes
    IterableOnceOps
  197. final def toString(): String

    Creates a String representation of this object.

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

    returns

    a String representation of the object.

    Definition Classes
    RangeSeqFunction1Iterable → AnyRef → Any
  198. def toVector: Vector[Int]

    Converts this range to a Vector.

    Converts this range to a Vector.

    returns

    This range as a Vector[A].

    Definition Classes
    IterableOnceOps
  199. def transpose[B](implicit asIterable: (Int) => collection.Iterable[B]): IndexedSeq[IndexedSeq[B]]

    Transposes this range of iterable collections into a range of ranges.

    Transposes this range of iterable collections into a range of ranges.

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

    returns

    a two-dimensional range of ranges which has as nth row the nth column of this range.

    Definition Classes
    IterableOps
    Exceptions thrown

    IllegalArgumentException if all collections in this range are not of the same size.

  200. def unapply(a: Int): Option[Int]

    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
  201. def unzip[A1, A2](implicit asPair: (Int) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

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

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

    returns

    a pair of ranges, containing the first, respectively second half of each element pair of this range.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  202. def unzip3[A1, A2, A3](implicit asTriple: (Int) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

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

    Converts this range 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 range is a triple.

    returns

    a triple of ranges, containing the first, second, respectively third member of each element triple of this range.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  203. def updated[B >: Int](index: Int, elem: B): IndexedSeq[B]

    A copy of this range with one single replaced element.

    A copy of this range with one single replaced element.

    B

    the element type of the returned range.

    index

    the position of the replacement

    elem

    the replacing element

    returns

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

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

  204. def view: IndexedSeqView[Int]

    A view over the elements of this collection.

    A view over the elements of this collection.

    Definition Classes
    IndexedSeqOpsSeqOpsIterableOps
  205. final def wait(): Unit

    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

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

    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

  207. final def wait(arg0: Long): Unit

    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

  208. def withFilter(p: (Int) => Boolean): WithFilter[Int, [_]IndexedSeq[_]]

    Creates a non-strict filter of this range.

    Creates a non-strict filter of this range.

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOps
  209. def zip[B](that: IterableOnce[B]): IndexedSeq[(Int, B)]

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

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  210. def zipAll[A1 >: Int, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]

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

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

    thatElem

    the element to be used to fill up the result if that is shorter than this range.

    returns

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

    Definition Classes
    IterableOps
  211. def zipWithIndex: IndexedSeq[(Int, Int)]

    Zips this range with its indices.

    Zips this range with its indices.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Example:
    1. List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, Int) => B): B
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int])./:(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, Int) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  3. def :\[B](z: B)(op: (Int, B) => B): B
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).:\(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: (Int, 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, Int) => B, combop: (B, B) => B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

    B

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

    z

    the start value, a neutral element for seqop.

    seqop

    the binary operator used to accumulate the result.

    combop

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

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

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

  6. def collectFirst[B](f: PartialFunction[Int, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  7. def companion: IterableFactory[[_]IndexedSeq[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  8. def copyToBuffer(dest: Buffer[Int]): Unit
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

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

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

  10. def count(f: (Int) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  11. def exists(f: (Int) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  12. def filter(f: (Int) => Boolean): Iterator[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  13. def find(p: (Int) => Boolean): Option[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  14. def flatMap[B](f: (Int) => IterableOnce[B]): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  15. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  16. def foldLeft[B](z: B)(op: (B, Int) => B): B
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  17. def foldRight[B](z: B)(op: (Int, B) => B): B
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  18. def forall(f: (Int) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  19. def foreach[U](f: (Int) => U): Unit
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  20. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit
    This member is added by an implicit conversion from Range toStringFormat[Range] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  21. def hasDefiniteSize: Boolean

    Tests whether this range is known to have a finite size.

    Tests whether this range is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

    See also

    method knownSize for a more useful alternative

  22. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  23. def map[B](f: (Int) => B): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  24. def max(implicit ord: math.Ordering[Int]): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  25. def maxBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  26. def min(implicit ord: math.Ordering[Int]): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  27. def minBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  28. def mkString: String
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  29. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  30. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  31. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  32. final def prefixLength(p: (Int) => Boolean): Int

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this range such that every element of the segment satisfies the predicate p.

    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  33. def product(implicit num: math.Numeric[Int]): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  34. def reduce(f: (Int, Int) => Int): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  35. def reduceLeft(f: (Int, Int) => Int): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  36. def reduceLeftOption(f: (Int, Int) => Int): Option[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  37. def reduceOption(f: (Int, Int) => Int): Option[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  38. def reduceRight(f: (Int, Int) => Int): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  39. def reduceRightOption(f: (Int, Int) => Int): Option[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  40. final def repr: IndexedSeq[Int]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  41. def reverseMap[B](f: (Int) => B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

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

  42. def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).sameElements(that)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  43. def seq: Range.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  44. def size: Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  45. def sum(implicit num: math.Numeric[Int]): Int
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  46. def to[C1](factory: Factory[Int, C1]): C1
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  47. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  48. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  49. def toIndexedSeq: collection.IndexedSeq[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  50. final def toIterable: collection.Iterable[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  51. final def toIterable: Range.this.type

    returns

    This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].

    Definition Classes
    IterableIterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  52. def toIterator: Iterator[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  53. final def toIterator: Iterator[Int]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  54. def toList: List[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  55. def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  56. def toSeq: Seq[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  57. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  58. def toStream: Stream[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  59. final def toStream: Stream[Int]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  60. final def toTraversable: collection.Traversable[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  61. final def toTraversable: collection.Traversable[Int]

    Converts this range to an unspecified Iterable.

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

    returns

    An Iterable containing all elements of this range.

    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  62. def toVector: Vector[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  63. final def union[B >: Int](that: collection.Seq[B]): IndexedSeq[B]

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

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

    B

    the element type of the returned range.

    that

    the sequence to add.

    returns

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

    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  64. def view(from: Int, until: Int): IndexedSeqView[Int]

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

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

    Definition Classes
    IndexedSeqOpsIterableOps
    Annotations
    @deprecated
    Deprecated

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

  65. def withFilter(f: (Int) => Boolean): Iterator[Int]
    Implicit
    This member is added by an implicit conversion from Range toIterableOnceExtensionMethods[Int] 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:
    (range: IterableOnceExtensionMethods[Int]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  66. def [B](y: B): (Range, B)
    Implicit
    This member is added by an implicit conversion from Range toArrowAssoc[Range] performed by method ArrowAssoc in scala.Predef.
    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 java.io.Serializable

Inherited from IndexedSeq[Int]

Inherited from collection.IndexedSeq[Int]

Inherited from AbstractSeq[Int]

Inherited from Seq[Int]

Inherited from SeqOps[Int, [_]IndexedSeq[_], IndexedSeq[Int]]

Inherited from Iterable[Int]

Inherited from collection.AbstractSeq[Int]

Inherited from collection.Seq[Int]

Inherited from Equals

Inherited from collection.SeqOps[Int, [_]IndexedSeq[_], IndexedSeq[Int]]

Inherited from PartialFunction[Int, Int]

Inherited from (Int) => Int

Inherited from AbstractIterable[Int]

Inherited from collection.Iterable[Int]

Inherited from IterableFactoryDefaults[Int, [x]IndexedSeq[x]]

Inherited from IterableOps[Int, [_]IndexedSeq[_], IndexedSeq[Int]]

Inherited from IterableOnceOps[Int, [_]IndexedSeq[_], IndexedSeq[Int]]

Inherited from IterableOnce[Int]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromRange to IterableOnceExtensionMethods[Int]

Inherited by implicit conversion any2stringadd fromRange to any2stringadd[Range]

Inherited by implicit conversion StringFormat fromRange to StringFormat[Range]

Inherited by implicit conversion Ensuring fromRange to Ensuring[Range]

Inherited by implicit conversion ArrowAssoc fromRange to ArrowAssoc[Range]

Ungrouped