scala.collection.immutable.Range

Inclusive

class Inclusive extends Range

Source
Range.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Inclusive
  2. Range
  3. Serializable
  4. Serializable
  5. CustomParallelizable
  6. IndexedSeq
  7. IndexedSeq
  8. IndexedSeqLike
  9. Seq
  10. Iterable
  11. Traversable
  12. Immutable
  13. AbstractSeq
  14. Seq
  15. SeqLike
  16. GenSeq
  17. GenSeqLike
  18. PartialFunction
  19. Function1
  20. AbstractIterable
  21. Iterable
  22. IterableLike
  23. Equals
  24. GenIterable
  25. GenIterableLike
  26. AbstractTraversable
  27. Traversable
  28. GenTraversable
  29. GenericTraversableTemplate
  30. TraversableLike
  31. GenTraversableLike
  32. Parallelizable
  33. TraversableOnce
  34. GenTraversableOnce
  35. FilterMonadic
  36. HasNewBuilder
  37. AnyRef
  38. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Inclusive(start: Int, end: Int, step: Int)

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable

    The class of the iterator returned by the iterator method.

  2. type Self = IndexedSeq[Int]

    The type implementing this traversable

    The type implementing this traversable

    Attributes
    protected
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    Any
  3. 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
  4. def ++[B](that: GenTraversableOnce[B]): Range[B]

    [use case]

    [use case]
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  5. def ++:[B >: Int, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

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

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

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

    Example:

        scala> val x = List(1)
        x: List[Int] = List(1)
    
        scala> val y = LinkedList(2)
        y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
        scala> val z = x ++: y
        z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    Since TraversableOnce has no ++ method, we have to implement that directly, but Traversable and down can use the overload.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    Definition Classes
    TraversableLike
  6. def ++:[B](that: TraversableOnce[B]): Range[B]

    [use case]

    [use case]
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Definition Classes
    TraversableLike
  7. def +:(elem: Int): Range[A]

    [use case]

    [use case]
    elem

    the prepended element

    returns

    a new collection of type That consisting of elem followed by all elements of this range.

    Definition Classes
    SeqLikeGenSeqLike
  8. def /:[B](z: B)(op: (B, Int) ⇒ B): B

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

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

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (5 /: a)(_+_)
         b: Int = 15
    
         scala> val c = (5 /: a)((x,y) => x + y)
         c: Int = 15
    
    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this range, going left to right with the start value z on the left:

                op(...op(op(z, x1), x2), ..., xn)
    

    where x1, ..., xn are the elements of this range.

    Definition Classes
    TraversableOnceGenTraversableOnce
  9. def /:\[A1 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Example:

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (a /:\ 5)(_+_)
         b: Int = 15
    
    Definition Classes
    GenTraversableOnce
  10. def :+(elem: Int): Range[A]

    [use case]

    [use case]
    elem

    the appended element

    returns

    a new collection of type That consisting of all elements of this range followed by elem.

    Definition Classes
    SeqLikeGenSeqLike
  11. def :\[B](z: B)(op: (Int, B) ⇒ B): B

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

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

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (a :\ 5)(_+_)
         b: Int = 15
    
         scala> val c = (a :\ 5)((x,y) => x + y)
         c: Int = 15
    
    
    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this range, going right to left with the start value z on the right:

                op(x1, op(x2, ... op(xn, z)...))
    

    where x1, ..., xn are the elements of this range.

    Definition Classes
    TraversableOnceGenTraversableOnce
  12. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  13. final def ==(arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality. 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
    Any
  14. def addString(b: StringBuilder): StringBuilder

    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 = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = new StringBuilder()
         b: StringBuilder =
    
         scala> val h = a.addString(b)
         b: StringBuilder = 1234
    
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, sep: String): StringBuilder

    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 = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(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
    TraversableOnce
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    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 = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = new StringBuilder()
         b: StringBuilder =
    
         scala> a.addString(b, "LinkedList(", ", ", ")")
         res1: StringBuilder = LinkedList(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
    TraversableOnce
  17. 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.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked an arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

       pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
    

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    B

    the type of accumulated results

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  18. 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.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    Definition Classes
    PartialFunctionFunction1
  19. final def apply(idx: Int): Int

    Selects an element by its index in the range.

    Selects an element by its index in the range.

    Example:

       scala> val x = LinkedList(1, 2, 3, 4, 5)
       x: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4, 5)
    
       scala> x(3)
       res1: Int = 4
    
    idx

    The index to select.

    returns

    the element of this range at index idx, where 0 indicates the first element.

    Definition Classes
    RangeSeqLikeGenSeqLikeFunction1
    Annotations
    @inline()
    Exceptions thrown
    `IndexOutOfBoundsException`

    if idx does not satisfy 0 <= idx < length.

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

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

    Definition Classes
    Range
  22. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this range should be compared

    returns

    true, if this range can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
    IterableLikeEquals
  23. 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()
    Note

    not specified by SLS as a member of AnyRef

  24. def collect[B](pf: PartialFunction[Int, B]): Range[B]

    [use case]

    [use case]
    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the range.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    TraversableLikeGenTraversableLike
  25. 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
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

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

    Iterates over combinations.

    Iterates over combinations.

    returns

    An Iterator which traverses the possible n-element combinations of this range.

    Definition Classes
    SeqLike
    Example:
    1. "abbbc".combinations(2) = Iterator(ab, ac, bb, bc)

  27. def companion: GenericCompanion[IndexedSeq]

    The factory companion object that builds instances of class Range.

    The factory companion object that builds instances of class Range. (or its Iterable superclass where class Range is not a Seq.)

    Definition Classes
    IndexedSeqIndexedSeqSeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  28. 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
  29. final def contains(x: Int): Boolean

    Definition Classes
    Range
  30. def contains(elem: Any): 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 is equal (wrt ==) to elem, false otherwise.

    Definition Classes
    SeqLike
  31. def containsSlice[B](that: GenSeq[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
    SeqLike
  32. def copy(start: Int, end: Int, step: Int): Range

    Attributes
    protected
    Definition Classes
    InclusiveRange
  33. def copyToArray(xs: Array[Int], start: Int, len: Int): Unit

    [use case]

    [use case]
    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  34. def copyToArray(xs: Array[Int]): Unit

    [use case]

    [use case]
    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
  35. def copyToArray(xs: Array[Int], start: Int): Unit

    [use case]

    [use case]
    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
  36. def copyToBuffer[B >: Int](dest: Buffer[B]): Unit

    Copies all elements of this range to a buffer.

    Copies all elements of this range to a buffer.

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  37. def corresponds[B](that: GenSeq[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
    SeqLikeGenSeqLike
  38. 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
    TraversableOnceGenTraversableOnce
  39. def diff(that: Seq[Int]): Range[Int]

    [use case]

    [use case]
    that

    the sequence of elements to remove

    returns

    a new collection of type That 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
    SeqLikeGenSeqLike
  40. def distinct: IndexedSeq[Int]

    Builds a new range from this range without any duplicate elements.

    Builds a new range from this range without any duplicate elements.

    returns

    A new range which contains the first occurrence of every element of this range.

    Definition Classes
    SeqLikeGenSeqLike
  41. 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.

    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.

    returns

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

    Definition Classes
    RangeIterableLikeTraversableLikeGenTraversableLike
  42. 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 take

    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.

    Definition Classes
    RangeIterableLike
  43. final def dropWhile(p: (Int) ⇒ Boolean): Range

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this range whose first element does not satisfy the predicate p.

    Definition Classes
    RangeTraversableLikeGenTraversableLike
  44. def endsWith[B](that: GenSeq[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
    SeqLikeGenSeqLike
  45. final def eq(arg0: AnyRef): Boolean

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

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

    The equals method for arbitrary sequences.

    The equals method for arbitrary sequences. Compares this sequence to some other object.

    returns

    true if that is a sequence that has the same elements as this sequence in the same order, false otherwise

    Definition Classes
    RangeGenSeqLikeEquals → AnyRef → Any
  47. def exists(p: (Int) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this range.

    Tests whether a predicate holds for some of the elements of this range.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this range, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  48. def filter(p: (Int) ⇒ Boolean): IndexedSeq[Int]

    Selects all elements of this range which satisfy a predicate.

    Selects all elements of this range which satisfy a predicate.

    p

    the predicate used to test elements.

    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
    TraversableLikeGenTraversableLike
  49. def filterNot(p: (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.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  50. 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()
    Note

    not specified by SLS as a member of AnyRef

  51. 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  52. def flatMap[B](f: (Int) ⇒ GenTraversableOnce[B]): Range[B]

    [use case]

    [use case]
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
  53. def fold[A1 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this range using the specified associative binary operator.

    Folds the elements of this range using the specified associative binary operator.

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

    A1

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

    z

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

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Definition Classes
    TraversableOnceGenTraversableOnce
  54. def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this range, going left to right with the start value z on the left:

                op(...op(z, x1), x2, ..., xn)
    

    where x1, ..., xn are the elements of this range.

    Definition Classes
    TraversableOnceGenTraversableOnce
  55. def foldRight[B](z: B)(op: (Int, B) ⇒ B): B

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this range, going right to left with the start value z on the right:

                op(x1, op(x2, ... op(xn, z)...))
    

    where x1, ..., xn are the elements of this range.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  56. 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 the given predicate p holds for all elements of this range, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  57. final def foreach(f: (Int) ⇒ Unit): Unit

    [use case]

    [use case]
    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    Definition Classes
    RangeIterableLikeGenericTraversableTemplateTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
  58. def genericBuilder[B]: Builder[B, IndexedSeq[B]]

    The generic builder that builds instances of Range at arbitrary element types.

    The generic builder that builds instances of Range at arbitrary element types.

    Definition Classes
    GenericTraversableTemplate
  59. final def getClass(): Class[_]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
    AnyRef → Any
    Note

    not specified by SLS as a member of AnyRef

  60. 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: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new range.

    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 partition 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
    TraversableLikeGenTraversableLike
  61. def grouped(size: Int): Iterator[IndexedSeq[Int]]

    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 truncated if the elements don't divide evenly.

    Definition Classes
    IterableLike
    See also

    Iterator#grouped

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

    Note: many collection methods will not work on collections of infinite sizes.

    returns

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

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  63. def hashCode(): Int

    Hashcodes for Range produce a value from the hashcodes of all the elements of the range.

    Hashcodes for Range produce a value from the hashcodes of all the elements of the range.

    returns

    the hash code value for this object.

    Definition Classes
    IndexedSeqLikeGenSeqLike → AnyRef → Any
  64. 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
    IterableLikeGenIterableLikeTraversableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the range is empty.

  65. 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
    TraversableLike
  66. def inclusive: Range

    Make range inclusive.

    Make range inclusive.

    Definition Classes
    Range
  67. def indexOf(elem: Int, from: Int): Int

    [use case]

    [use case]
    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 (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  68. def indexOf(elem: Int): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    returns

    the index of the first element of this range that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  69. def indexOfSlice[B >: Int](that: GenSeq[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 of no such subsequence exists.

    Definition Classes
    SeqLike
  70. def indexOfSlice[B >: Int](that: GenSeq[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 such that the elements of this range starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    Definition Classes
    SeqLike
  71. 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
    SeqLikeGenSeqLike
  72. def indexWhere(p: (Int) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  73. def indices: Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

    a Range value from 0 to one less than the length of this range.

    Definition Classes
    SeqLike
  74. 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
    RangeTraversableLike
  75. def inits: Iterator[IndexedSeq[Int]]

    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.

    returns

    an iterator over all the inits of this range

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

  76. def intersect(that: Seq[Int]): Range[Int]

    [use case]

    [use case]
    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That 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
    SeqLikeGenSeqLike
  77. 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
    GenSeqLike
  78. final val isEmpty: Boolean

    Tests whether the range is empty.

    Tests whether the range is empty.

    returns

    true if the range contains no elements, false otherwise.

    Definition Classes
    RangeIterableLikeGenIterableLikeGenericTraversableTemplateTraversableLikeTraversableOnceGenTraversableOnce
  79. def isInclusive: Boolean

    Definition Classes
    InclusiveRange
  80. final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. 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 specified type.

    returns

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

    Definition Classes
    Any
  81. final def isTraversableAgain: Boolean

    Tests whether this range can be repeatedly traversed.

    Tests whether this range can be repeatedly traversed.

    returns

    true

    Definition Classes
    GenTraversableLikeGenTraversableOnce
  82. def iterator: Iterator[Int]

    Creates a new iterator over all elements contained in this iterable object.

    Creates a new iterator over all elements contained in this iterable object.

    returns

    the new iterator

    Definition Classes
    IndexedSeqLikeIterableLikeGenIterableLike
  83. def last: Int

    Selects the last element.

    Selects the last element.

    returns

    The last element of this range.

    Definition Classes
    RangeTraversableLike
    Exceptions thrown
    NoSuchElementException

    If the range is empty.

  84. final val lastElement: Int

    Definition Classes
    Range
  85. def lastIndexOf(elem: Int, end: Int): Int

    [use case]

    [use case]
    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 (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  86. def lastIndexOf(elem: Int): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    returns

    the index of the last element of this range that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  87. def lastIndexOfSlice[B >: Int](that: GenSeq[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 of no such subsequence exists.

    Definition Classes
    SeqLike
  88. def lastIndexOfSlice[B >: Int](that: GenSeq[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 a this index match the elements of sequence that, or -1 of no such subsequence exists.

    Definition Classes
    SeqLike
  89. 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
    SeqLikeGenSeqLike
  90. 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
    GenSeqLike
  91. 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
    TraversableLike
  92. def length: Int

    The length of the range.

    The length of the range.

    Note: xs.length and xs.size yield the same result.

    returns

    the number of elements in this range.

    Definition Classes
    RangeSeqLikeGenSeqLike
  93. 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 overwritten if computing length is cheap.

    Definition Classes
    SeqLike
  94. def lift: (Int) ⇒ Option[Int]

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

    Turns this partial function into an 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

  95. def map[B](f: (Int) ⇒ B): Range[B]

    [use case]

    [use case]
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
  96. def max: A

    [use case]

    [use case]
    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  97. def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

    Definition Classes
    TraversableOnceGenTraversableOnce
  98. def min: A

    [use case]

    [use case]
    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  99. def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

    Definition Classes
    TraversableOnceGenTraversableOnce
  100. def missingCase(x: Int): Int

    Attributes
    protected
    Definition Classes
    PartialFunction
  101. def mkString: String

    Displays all elements of this range in a string.

    Displays all elements of this range in a 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 follow each other without any separator string.

    Definition Classes
    TraversableOnceGenTraversableOnce
  102. 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.

    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
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

    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
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  104. 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
  105. def newBuilder: Builder[Int, IndexedSeq[Int]]

    The builder that builds instances of type Range[A]

    The builder that builds instances of type Range[A]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplateHasNewBuilder
  106. 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
    TraversableOnceGenTraversableOnce
  107. 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
    Note

    not specified by SLS as a member of AnyRef

  108. 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
    Note

    not specified by SLS as a member of AnyRef

  109. final val numRangeElements: Int

    Definition Classes
    Range
  110. 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
  111. def orElseFast[A1 <: Int, B1 >: Int](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction
  112. def padTo(len: Int, elem: Int): Range[A]

    [use case]

    [use case]
    len

    the target length

    elem

    the padding value

    returns

    a new collection of type That 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
    SeqLikeGenSeqLike
  113. def par: ParRange

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    RangeCustomParallelizableParallelizable
  114. def parCombiner: Combiner[Int, ParRange]

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizableParallelizable
  115. def partition(p: (Int) ⇒ Boolean): (IndexedSeq[Int], IndexedSeq[Int])

    Partitions this range in two ranges according to a predicate.

    Partitions this range in two ranges according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of ranges: the first range consists of all elements that satisfy the predicate p and the second range consists of all elements that don't. The relative order of the elements in the resulting ranges is the same as in the original range.

    Definition Classes
    TraversableLikeGenTraversableLike
  116. def patch(from: Int, that: GenSeq[Int], replaced: Int): Range[A]

    [use case]

    [use case]
    from

    the index of the first replaced element

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

    Definition Classes
    SeqLikeGenSeqLike
  117. def permutations: Iterator[IndexedSeq[Int]]

    Iterates over distinct permutations.

    Iterates over distinct permutations.

    returns

    An Iterator which traverses the distinct permutations of this range.

    Definition Classes
    SeqLike
    Example:
    1. "abb".permutations = Iterator(abb, bab, bba)

  118. 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
    GenSeqLike
  119. def product: A

    [use case]

    [use case]
    returns

    the product of all elements of this range with respect to the * operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  120. def reduce[A1 >: Int](op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this range using the specified associative binary operator.

    Reduces the elements of this range using the specified associative binary operator.

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

    A1

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

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the range is nonempty.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this range is empty.

  121. def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B

    Definition Classes
    TraversableOnce
  122. def reduceLeftOption[B >: Int](op: (B, Int) ⇒ B): Option[B]

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this range is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  123. def reduceOption[A1 >: Int](op: (A1, A1) ⇒ A1): Option[A1]

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

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

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

    A1

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  124. def reduceRight[B >: Int](op: (Int, B) ⇒ B): B

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this range, going right to left:

                op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
    

    where x1, ..., xn are the elements of this range.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this range is empty.

  125. def reduceRightOption[B >: Int](op: (Int, B) ⇒ B): Option[B]

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this range is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  126. def repr: IndexedSeq[Int]

    The collection of type range underlying this TraversableLike object.

    The collection of type range underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    Definition Classes
    TraversableLikeGenTraversableLike
  127. final def reverse: Range

    Returns the reverse of this range.

    Returns the reverse of this range.

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

    returns

    A new range with all elements of this range in reversed order.

    Definition Classes
    RangeSeqLikeGenSeqLike
  128. def reverseIterator: Iterator[Int]

    An iterator yielding elements in reversed order.

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

    Definition Classes
    SeqLike
  129. def reverseMap[B](f: (Int) ⇒ B): Range[B]

    [use case] Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

    [use case]

    Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given function f to each element of this range and collecting the results in reversed order.

    Definition Classes
    SeqLikeGenSeqLike
  130. def reversed: List[Int]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  131. def sameElements(that: GenIterable[Int]): Boolean

    [use case]

    [use case]
    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Definition Classes
    IterableLikeGenIterableLike
  132. def scan[B >: Int, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[Int], B, That]): That

    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

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new range containing the prefix scan of the elements in this range

    Definition Classes
    TraversableLikeGenTraversableLike
  133. def scanLeft[B, That](z: B)(op: (B, Int) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
  134. def scanRight[B, That](z: B)(op: (Int, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Int], B, That]): That

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

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

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  135. def segmentLength(p: (Int) ⇒ Boolean, from: Int): Int

    Computes length of longest segment whose elements all satisfy some predicate.

    Computes length of longest segment 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
    SeqLikeGenSeqLike
  136. def seq: IndexedSeq[Int]

    A version of this collection with all of the operations implemented sequentially (i.

    A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

    This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

    returns

    a sequential view of the collection.

    Definition Classes
    IndexedSeqIndexedSeqIndexedSeqLikeSeqSeqGenSeqGenSeqLikeIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  137. def size: Int

    The size of this range, equivalent to length.

    The size of this range, equivalent to length.

    returns

    the number of elements in this range.

    Definition Classes
    RangeSeqLikeGenTraversableLikeTraversableOnceGenTraversableOnce
  138. def slice(from: Int, until: Int): IndexedSeq[Int]

    Selects an interval of elements.

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

       from <= indexOf(x) < until
    
    from

    the lowest index to include from this range.

    until

    the highest index to EXCLUDE from this range.

    returns

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

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

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

    size

    the number of elements per group

    returns

    An iterator producing ranges of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    Iterator#sliding

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

    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
    SeqLike
    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

  142. def sortWith(lt: (Int, Int) ⇒ Boolean): IndexedSeq[Int]

    Sorts this range according to a comparison function.

    Sorts this range according to a comparison function.

    The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original.

    lt

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

    returns

    a range consisting of the elements of this range sorted according to the comparison function lt.

    Definition Classes
    SeqLike
    Example:
    1.    List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
         List("Bob", "John", "Steve", "Tom")
      
  143. 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 wrt lt 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
    SeqLike
    See also

    scala.math.Ordering

  144. 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
    RangeTraversableLikeGenTraversableLike
  145. final def splitAt(n: Int): (Range, Range)

    Creates a pair of new ranges, first consisting of elements before n, and the second of elements after n.

    Creates a pair of new ranges, first consisting of elements before n, and the second of elements after n.

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

    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
    RangeTraversableLikeGenTraversableLike
  146. def startsWith[B](that: GenSeq[B], offset: Int): 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
    SeqLikeGenSeqLike
  147. def startsWith[B](that: GenSeq[B]): Boolean

    Tests whether this range starts with the given sequence.

    Tests whether this range starts with the given sequence.

    that

    the sequence to test

    returns

    true if this collection has that as a prefix, false otherwise.

    Definition Classes
    GenSeqLike
  148. def stringPrefix: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    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.

    Definition Classes
    TraversableLikeGenTraversableLike
  149. final def sum: A

    [use case]

    [use case]
    returns

    the sum of all elements of this range with respect to the + operator in num.

    Definition Classes
    RangeTraversableOnceGenTraversableOnce
  150. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  151. 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
    RangeTraversableLikeGenTraversableLike
  152. def tails: Iterator[IndexedSeq[Int]]

    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
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

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

    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.

    returns

    a new range consisting of n first elements.

    Definition Classes
    RangeIterableLikeTraversableLikeGenTraversableLike
  154. final def takeRight(n: Int): Range

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

    Creates a new range consisting of the length - n last 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

    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.

    Definition Classes
    RangeIterableLike
  155. 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
    RangeIterableLikeTraversableLikeGenTraversableLike
  156. final val terminalElement: Int

    Definition Classes
    Range
  157. def thisCollection: IndexedSeq[Int]

    The underlying collection seen as an instance of Range.

    The underlying collection seen as an instance of Range. By default this is implemented as the current collection object itself, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  158. def toArray: Array[A]

    [use case]

    [use case]
    returns

    an array containing all elements of this range.

    Definition Classes
    TraversableOnceGenTraversableOnce
  159. def toBuffer[A1 >: Int]: Buffer[A1]

    Overridden for efficiency

    Overridden for efficiency

    returns

    a buffer containing all elements of this range.

    Definition Classes
    IndexedSeqLikeTraversableOnceGenTraversableOnce
  160. def toCollection(repr: IndexedSeq[Int]): IndexedSeq[Int]

    A conversion from collections of type Repr to Range objects.

    A conversion from collections of type Repr to Range objects. By default this is implemented as just a cast, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  161. def toIndexedSeq: IndexedSeq[Int]

    Converts this range to an indexed sequence.

    Converts this range to an indexed sequence.

    returns

    an indexed sequence containing all elements of this range.

    Definition Classes
    IndexedSeqTraversableOnceGenTraversableOnce
  162. def toIterable: Range

    Converts this range to an iterable collection.

    Converts this range to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this range.

    Definition Classes
    RangeIterableLikeTraversableOnceGenTraversableOnce
  163. def toIterator: Iterator[Int]

    Returns an Iterator over the elements in this range.

    Returns an Iterator over the elements in this range. Will return the same Iterator if this instance is already an Iterator.

    returns

    an Iterator containing all elements of this range.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  164. def toList: List[Int]

    Converts this range to a list.

    Converts this range to a list.

    returns

    a list containing all elements of this range.

    Definition Classes
    TraversableOnceGenTraversableOnce
  165. def toMap[T, U]: Map[T, U]

    [use case]

    [use case]
    returns

    a map containing all elements of this range.

    Definition Classes
    TraversableOnceGenTraversableOnce
  166. def toSeq: Range

    Converts this range to a sequence.

    Converts this range to a sequence.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this range.

    Definition Classes
    RangeSeqSeqLikeGenSeqLikeTraversableOnceGenTraversableOnce
  167. def toSet[B >: Int]: Set[B]

    Converts this range to a set.

    Converts this range to a set.

    returns

    a set containing all elements of this range.

    Definition Classes
    TraversableOnceGenTraversableOnce
  168. def toStream: Stream[Int]

    Converts this range to a stream.

    Converts this range to a stream.

    returns

    a stream containing all elements of this range.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  169. def toString(): String

    Note: hashCode can't be overridden without breaking Seq's equals contract.

    Note: hashCode can't be overridden without breaking Seq's equals contract.

    returns

    a string representation of this collection. By default this string consists of the stringPrefix of this range, followed by all elements separated by commas and enclosed in parentheses.

    Definition Classes
    RangeSeqLikeFunction1TraversableLike → AnyRef → Any
  170. def toTraversable: Traversable[Int]

    Converts this range to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this range.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  171. def union(that: Seq[Int]): Range[Int]

    [use case]

    [use case]
    that

    the sequence to add.

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  172. 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.

    asPair

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  173. 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.

    asTriple

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  174. def updated(index: Int, elem: Int): Range[A]

    [use case]

    [use case]
    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
    SeqLikeGenSeqLike
  175. def validateRangeBoundaries(f: (Int) ⇒ Any): Boolean

    Definition Classes
    Range
  176. def view(from: Int, until: Int): SeqView[Int, IndexedSeq[Int]]

    Creates a non-strict view of a slice of this range.

    Creates a non-strict view of a slice of this range.

    Note: the difference between view and slice is that view produces a view of the current range, whereas slice produces a new range.

    Note: view(from, to) is equivalent to view.slice(from, to)

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this range, starting at index from and extending up to (but not including) index until.

    Definition Classes
    SeqLikeIterableLikeTraversableLike
  177. def view: SeqView[Int, IndexedSeq[Int]]

    Creates a non-strict view of this range.

    Creates a non-strict view of this range.

    returns

    a non-strict view of this range.

    Definition Classes
    SeqLikeIterableLikeTraversableLike
  178. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  179. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  180. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  181. def withFilter(p: (Int) ⇒ Boolean): FilterMonadic[Int, IndexedSeq[Int]]

    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
    TraversableLikeFilterMonadic
  182. def zip[B](that: GenIterable[B]): Range[(A, B)]

    [use case]

    [use case]
    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 collection of type That 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
    IterableLikeGenIterableLike
  183. def zipAll[B](that: Iterable[B], thisElem: Int, thatElem: B): Range[(A, B)]

    [use case]

    [use case]
    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
    IterableLikeGenIterableLike
  184. def zipWithIndex: Range[(A, Int)]

    [use case]

    [use case]
    returns

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

    Definition Classes
    IterableLikeGenIterableLike

Inherited from Range

Inherited from Serializable

Inherited from Serializable

Inherited from CustomParallelizable[Int, ParRange]

Inherited from IndexedSeq[Int]

Inherited from IndexedSeq[Int]

Inherited from IndexedSeqLike[Int, IndexedSeq[Int]]

Inherited from Seq[Int]

Inherited from Iterable[Int]

Inherited from Traversable[Int]

Inherited from Immutable

Inherited from AbstractSeq[Int]

Inherited from Seq[Int]

Inherited from SeqLike[Int, IndexedSeq[Int]]

Inherited from GenSeq[Int]

Inherited from GenSeqLike[Int, IndexedSeq[Int]]

Inherited from PartialFunction[Int, Int]

Inherited from (Int) ⇒ Int

Inherited from AbstractIterable[Int]

Inherited from Iterable[Int]

Inherited from IterableLike[Int, IndexedSeq[Int]]

Inherited from Equals

Inherited from GenIterable[Int]

Inherited from GenIterableLike[Int, IndexedSeq[Int]]

Inherited from AbstractTraversable[Int]

Inherited from Traversable[Int]

Inherited from GenTraversable[Int]

Inherited from TraversableLike[Int, IndexedSeq[Int]]

Inherited from GenTraversableLike[Int, IndexedSeq[Int]]

Inherited from Parallelizable[Int, ParRange]

Inherited from TraversableOnce[Int]

Inherited from GenTraversableOnce[Int]

Inherited from FilterMonadic[Int, IndexedSeq[Int]]

Inherited from HasNewBuilder[Int, IndexedSeq[Int]]

Inherited from AnyRef

Inherited from Any