scala.collection.mutable.IndexedSeqView

Transformed

trait Transformed [B] extends IndexedSeqView[B, Coll] with Transformed[B]

The implementation base trait of this view. This trait and all its subtraits has to be re-implemented for each ViewLike class.

Definition Classes
IndexedSeqViewSeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
Source
IndexedSeqView.scala
Linear Supertypes
Transformed[B], Transformed[B], Transformed[B], Transformed[B], Transformed[B], Transformed[B], IndexedSeqView[B, Coll], SeqView[B, Coll], GenSeqView[B, Coll], SeqViewLike[B, Coll, IndexedSeqView[B, Coll]], GenSeqViewLike[B, Coll, IndexedSeqView[B, Coll]], IterableView[B, Coll], GenIterableView[B, Coll], IterableViewLike[B, Coll, IndexedSeqView[B, Coll]], GenIterableViewLike[B, Coll, IndexedSeqView[B, Coll]], TraversableView[B, Coll], GenTraversableView[B, Coll], TraversableViewLike[B, Coll, IndexedSeqView[B, Coll]], GenTraversableViewLike[B, Coll, IndexedSeqView[B, Coll]], ViewMkString[B], IndexedSeqOptimized[B, IndexedSeqView[B, Coll]], IndexedSeqOptimized[B, IndexedSeqView[B, Coll]], IndexedSeq[B], IndexedSeqLike[B, IndexedSeqView[B, Coll]], IndexedSeq[B], IndexedSeqLike[B, IndexedSeqView[B, Coll]], Seq[B], SeqLike[B, Seq[B]], Cloneable[Seq[B]], Seq[B], SeqLike[B, IndexedSeqView[B, Coll]], GenSeq[B], GenSeqLike[B, IndexedSeqView[B, Coll]], PartialFunction[Int, B], (Int) ⇒ B, Iterable[B], Iterable[B], IterableLike[B, IndexedSeqView[B, Coll]], Equals, GenIterable[B], GenIterableLike[B, IndexedSeqView[B, Coll]], Traversable[B], Mutable, Traversable[B], GenTraversable[B], GenericTraversableTemplate[B, IndexedSeq], TraversableLike[B, IndexedSeqView[B, Coll]], GenTraversableLike[B, IndexedSeqView[B, Coll]], Parallelizable[B, ParSeq[B]], TraversableOnce[B], GenTraversableOnce[B], FilterMonadic[B, IndexedSeqView[B, Coll]], HasNewBuilder[B, IndexedSeqView[B, Coll]], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Transformed
  2. Transformed
  3. Transformed
  4. Transformed
  5. Transformed
  6. Transformed
  7. Transformed
  8. IndexedSeqView
  9. SeqView
  10. GenSeqView
  11. SeqViewLike
  12. GenSeqViewLike
  13. IterableView
  14. GenIterableView
  15. IterableViewLike
  16. GenIterableViewLike
  17. TraversableView
  18. GenTraversableView
  19. TraversableViewLike
  20. GenTraversableViewLike
  21. ViewMkString
  22. IndexedSeqOptimized
  23. IndexedSeqOptimized
  24. IndexedSeq
  25. IndexedSeqLike
  26. IndexedSeq
  27. IndexedSeqLike
  28. Seq
  29. SeqLike
  30. Cloneable
  31. Seq
  32. SeqLike
  33. GenSeq
  34. GenSeqLike
  35. PartialFunction
  36. Function1
  37. Iterable
  38. Iterable
  39. IterableLike
  40. Equals
  41. GenIterable
  42. GenIterableLike
  43. Traversable
  44. Mutable
  45. Traversable
  46. GenTraversable
  47. GenericTraversableTemplate
  48. TraversableLike
  49. GenTraversableLike
  50. Parallelizable
  51. TraversableOnce
  52. GenTraversableOnce
  53. FilterMonadic
  54. HasNewBuilder
  55. AnyRef
  56. Any
Visibility
  1. Public
  2. All

Type Members

  1. trait Appended [B >: A] extends Appended[B] with Appended[B] with Transformed[B]

    Definition Classes
    SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
  2. trait DroppedWhile extends DroppedWhile with Transformed[A]

    Definition Classes
    IndexedSeqViewSeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
  3. class Elements extends BufferedIterator[A] with Serializable

    The class of the iterator returned by the iterator method.

  4. trait EmptyView extends Transformed[Nothing] with EmptyView with EmptyView

    Definition Classes
    SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
  5. trait Filtered extends Filtered with Transformed[A]

    Definition Classes
    IndexedSeqViewSeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
  6. trait FlatMapped [B] extends FlatMapped[B] with FlatMapped[B] with Transformed[B]

    Definition Classes
    SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
  7. trait Forced [B] extends Forced[B] with Forced[B] with Transformed[B]

    A fall back which forces everything into a vector and then applies an operation on it.

  8. trait Mapped [B] extends Mapped[B] with Mapped[B] with Transformed[B]

    Definition Classes
    SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
  9. trait Patched [B >: A] extends Transformed[B] with Patched[B]

    Definition Classes
    SeqViewLike → GenSeqViewLike
  10. trait Prepended [B >: A] extends Transformed[B] with Prepended[B]

    Definition Classes
    SeqViewLike → GenSeqViewLike
  11. trait Reversed extends Reversed with Transformed[A]

    Definition Classes
    IndexedSeqViewSeqViewLike → GenSeqViewLike
  12. type Self = IndexedSeqView[B, Coll]

    The type implementing this traversable

    The type implementing this traversable

    Attributes
    protected
    Definition Classes
    TraversableLike
  13. trait Sliced extends Sliced with Transformed[A]

    Definition Classes
    IndexedSeqViewSeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
  14. trait TakenWhile extends TakenWhile with Transformed[A]

    Definition Classes
    IndexedSeqViewSeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike
  15. trait Transformed [B] extends IndexedSeqView[B, Coll] with Transformed[B]

    The implementation base trait of this view.

  16. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

  17. trait Zipped [B] extends Zipped[B] with Zipped[B] with Transformed[(A, B)]

    Definition Classes
    SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike
  18. trait ZippedAll [A1 >: A, B] extends ZippedAll[A1, B] with ZippedAll[A1, B] with Transformed[(A1, B)]

    Definition Classes
    SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike

Abstract Value Members

  1. def apply (idx: Int): B

    Selects an element by its index in the mutable indexed sequence.

    Selects an element by its index in the mutable indexed sequence.

    idx

    The index to select.

    returns

    the element of this mutable indexed sequence at index idx, where 0 indicates the first element.

    Attributes
    abstract
    Definition Classes
    Transformed → Transformed → SeqLike → GenSeqLike → Function1
  2. def length : Int

    The length of the mutable indexed sequence.

    The length of the mutable indexed sequence.

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

    returns

    the number of elements in this mutable indexed sequence.

    Attributes
    abstract
    Definition Classes
    Transformed → Transformed → SeqLike → GenSeqLike
  3. def update (idx: Int, elem: B): Unit

    Replaces element at given index with a new value.

    Replaces element at given index with a new value.

    elem

    the new value.

    Attributes
    abstract
    Definition Classes
    TransformedIndexedSeqViewIndexedSeqLikeSeqLike

Concrete Value Members

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

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  3. def ## (): Int

    Equivalent to x.hashCode except for boxed numeric types.

    Equivalent to x.hashCode except for boxed numeric types. 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.

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def ++ [B] (that: GenTraversableOnce[B]): IndexedSeq[B]

    [use case] Concatenates this mutable indexed sequence with the elements of a traversable collection.

    [use case]

    Concatenates this mutable indexed sequence with the elements of a traversable collection.

    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 mutable indexed sequence followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  5. def ++ [B >: B, That] (xs: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Concatenates this mutable indexed sequence with the elements of a traversable collection.

    Concatenates this mutable indexed sequence with the elements of a traversable collection.

    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.

    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 mutable indexed sequence followed by all elements of that.

    Definition Classes
    TraversableViewLikeTraversableLike → GenTraversableLike
  6. def ++ [B >: B, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Definition Classes
    TraversableLike
    Annotations
    @bridge()
  7. def ++: [B >: B, That] (that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

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

    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.

    Definition Classes
    TraversableLike
  8. def ++: [B] (that: TraversableOnce[B]): IndexedSeq[B]

    [use case] Concatenates this mutable indexed sequence with the elements of a traversable collection.

    [use case]

    Concatenates this mutable indexed sequence with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    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 mutable indexed sequence followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    TraversableLike
  9. def ++: [B >: B, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Concatenates this mutable indexed sequence with the elements of a traversable collection.

    Concatenates this mutable indexed sequence with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    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 mutable indexed sequence followed by all elements of that.

    Definition Classes
    TraversableLike
  10. def +: (elem: B): IndexedSeq[B]

    [use case] Prepends an element to this mutable indexed sequence

    [use case]

    Prepends an element to this mutable indexed sequence

    elem

    the prepended element

    returns

    a new collection of type That consisting of elem followed by all elements of this mutable indexed sequence.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  11. def +: [B >: B, That] (elem: B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Prepends an element to this mutable indexed sequence

    Prepends an element to this mutable indexed sequence

    B

    the element type of the returned mutable indexed sequence.

    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.

    elem

    the prepended 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

    a new collection of type That consisting of elem followed by all elements of this mutable indexed sequence.

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  12. def /: [B] (z: B)(op: (B, B) ⇒ B): B

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

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

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

    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 mutable indexed sequence, going left to right with the start value z on the left:

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

    where x,,1,,, ..., x,,n,, are the elements of this mutable indexed sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  13. def /:\ [A1 >: B] (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.

    Definition Classes
    GenTraversableOnce
  14. def :+ (elem: B): IndexedSeq[B]

    [use case] Appends an element to this mutable indexed sequence

    [use case]

    Appends an element to this mutable indexed sequence

    elem

    the appended element

    returns

    a new collection of type That consisting of all elements of this mutable indexed sequence followed by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  15. def :+ [B >: B, That] (elem: B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Appends an element to this mutable indexed sequence

    Appends an element to this mutable indexed sequence

    B

    the element type of the returned mutable indexed sequence.

    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.

    elem

    the appended 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

    a new collection of type That consisting of all elements of this mutable indexed sequence followed by elem.

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  16. def :\ [B] (z: B)(op: (B, B) ⇒ B): B

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

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

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

    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 mutable indexed sequence, going right to left with the start value z on the right:

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

    where x,,1,,, ..., x,,n,, are the elements of this mutable indexed sequence.

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

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

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  19. def addString (b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    ViewMkString
  20. def addString (b: StringBuilder): StringBuilder

    Appends all elements of this mutable indexed sequence to a string builder.

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

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

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

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

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

    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
  22. def aggregate [B] (z: B)(seqop: (B, B) ⇒ 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 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).

    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
  23. def andThen [C] (k: (B) ⇒ 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
  24. 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.

    Attributes
    final
    Definition Classes
    Any
  25. 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 mutable indexed sequence should be compared

    returns

    true, if this mutable indexed sequence 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
  26. def clone (): Seq[B]

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Definition Classes
    Cloneable → AnyRef
  27. def collect [B] (pf: PartialFunction[B, B]): IndexedSeq[B]

    [use case] Builds a new collection by applying a partial function to all elements of this mutable indexed sequence on which the function is defined.

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the mutable indexed sequence.

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  28. def collect [B, That] (pf: PartialFunction[B, B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

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

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

    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.

    pf

    the partial function which filters and maps the mutable indexed sequence.

    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 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
    TraversableViewLikeTraversableLike → GenTraversableLike
  29. def collectFirst [B] (pf: PartialFunction[B, B]): Option[B]

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

    Finds the first element of the mutable indexed sequence 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)

  30. def combinations (n: Int): Iterator[IndexedSeqView[B, Coll]]

    Iterates over combinations.

    Iterates over combinations.

    returns

    An Iterator which traverses the possible n-element combinations of this mutable indexed sequence.

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

  31. def companion : GenericCompanion[IndexedSeq]

    The factory companion object that builds instances of class IndexedSeq.

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

    Definition Classes
    IndexedSeqIndexedSeqSeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  32. def compose [A] (g: (A) ⇒ Int): (A) ⇒ B

    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
  33. def contains (elem: Any): Boolean

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

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

    elem

    the element to test.

    returns

    true if this mutable indexed sequence has an element that is is equal (wrt ==) to elem, false otherwise.

    Definition Classes
    SeqLike
  34. def containsSlice [B] (that: Seq[B]): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  35. def containsSlice [B] (that: GenSeq[B]): Boolean

    Tests whether this mutable indexed sequence contains a given sequence as a slice.

    Tests whether this mutable indexed sequence contains a given sequence as a slice.

    that

    the sequence to test

    returns

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

    Definition Classes
    SeqLike
  36. def copyToArray (xs: Array[B], start: Int, len: Int): Unit

    [use case] Copies elements of this mutable indexed sequence to an array.

    [use case]

    Copies elements of this mutable indexed sequence to an array. Fills the given array xs with at most len elements of this mutable indexed sequence, starting at position start. Copying will stop once either the end of the current mutable indexed sequence is reached, or the end of the array is reached, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Attributes
    abstract
    Definition Classes
    TraversableLike
  37. def copyToArray [B >: B] (xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this mutable indexed sequence to an array.

    Copies elements of this mutable indexed sequence to an array. Fills the given array xs with at most len elements of this mutable indexed sequence, starting at position start. Copying will stop once either the end of the current mutable indexed sequence is reached, 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.

    len

    the maximal number of elements to copy.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  38. def copyToArray (xs: Array[B]): Unit

    [use case] Copies values of this mutable indexed sequence to an array.

    [use case]

    Copies values of this mutable indexed sequence to an array. Fills the given array xs with values of this mutable indexed sequence. Copying will stop once either the end of the current mutable indexed sequence is reached, or the end of the array is reached.

    xs

    the array to fill.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  39. def copyToArray [B >: B] (xs: Array[B]): Unit

    Copies values of this mutable indexed sequence to an array.

    Copies values of this mutable indexed sequence to an array. Fills the given array xs with values of this mutable indexed sequence. Copying will stop once either the end of the current mutable indexed sequence is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

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

    [use case] Copies values of this mutable indexed sequence to an array.

    [use case]

    Copies values of this mutable indexed sequence to an array. Fills the given array xs with values of this mutable indexed sequence, beginning at index start. Copying will stop once either the end of the current mutable indexed sequence is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  41. def copyToArray [B >: B] (xs: Array[B], start: Int): Unit

    Copies values of this mutable indexed sequence to an array.

    Copies values of this mutable indexed sequence to an array. Fills the given array xs with values of this mutable indexed sequence, beginning at index start. Copying will stop once either the end of the current mutable indexed sequence is reached, 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.

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

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  43. def corresponds [B] (that: Seq[B])(p: (B, B) ⇒ Boolean): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  44. def corresponds [B] (that: GenSeq[B])(p: (B, B) ⇒ Boolean): Boolean

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

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

    B

    the type of the elements of that

    that

    the other sequence

    p

    the test predicate, which relates elements from both sequences

    returns

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

    Definition Classes
    SeqLike → GenSeqLike
  45. def count (p: (B) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  46. def diff [B >: B] (that: Seq[B]): IndexedSeqView[B, Coll]

    Definition Classes
    SeqViewLikeSeqLike
    Annotations
    @bridge()
  47. def diff (that: Seq[B]): IndexedSeq[B]

    [use case] Computes the multiset difference between this mutable indexed sequence and another sequence.

    [use case]

    Computes the multiset difference between this mutable indexed sequence and another sequence.

    that

    the sequence of elements to remove

    returns

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

    Attributes
    abstract
    Definition Classes
    SeqLike
  48. def diff [B >: B] (that: GenSeq[B]): IndexedSeqView[B, Coll]

    Computes the multiset difference between this mutable indexed sequence and another sequence.

    Computes the multiset difference between this mutable indexed sequence and another sequence.

    B

    the element type of the returned mutable indexed sequence.

    that

    the sequence of elements to remove

    returns

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

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  49. def distinct : IndexedSeqView[B, Coll]

    Builds a new mutable indexed sequence from this mutable indexed sequence without any duplicate elements.

    Builds a new mutable indexed sequence from this mutable indexed sequence without any duplicate elements.

    returns

    A new mutable indexed sequence which contains the first occurrence of every element of this mutable indexed sequence.

    Definition Classes
    SeqLike → GenSeqLike
  50. def drop (n: Int): This

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this mutable indexed sequence.

    returns

    a mutable indexed sequence consisting of all elements of this mutable indexed sequence except the first n ones, or else the empty mutable indexed sequence, if this mutable indexed sequence has less than n elements.

    Definition Classes
    IndexedSeqViewIterableViewLikeTraversableViewLikeIndexedSeqOptimizedIterableLikeTraversableLike → GenTraversableLike
  51. def dropRight (n: Int): IndexedSeqView[B, Coll]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

    a mutable indexed sequence consisting of all elements of this mutable indexed sequence except the last n ones, or else the empty mutable indexed sequence, if this mutable indexed sequence has less than n elements.

    Definition Classes
    IndexedSeqOptimizedIterableLike
  52. def dropWhile (p: (B) ⇒ Boolean): This

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

    Definition Classes
    IndexedSeqViewTraversableViewLikeIndexedSeqOptimizedTraversableLike → GenTraversableLike
  53. def endsWith [B] (that: GenSeq[B]): Boolean

    Tests whether this mutable indexed sequence ends with the given sequence.

    Tests whether this mutable indexed sequence ends with the given sequence.

    that

    the sequence to test

    returns

    true if this mutable indexed sequence has that as a suffix, false otherwise.

    Definition Classes
    IndexedSeqOptimizedSeqLike → GenSeqLike
  54. def endsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  55. 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.

    Attributes
    final
    Definition Classes
    AnyRef
  56. def equals (that: Any): Boolean

    The equals method for arbitrary sequences.

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

    that

    The object to compare the sequence to

    returns

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

    Definition Classes
    GenSeqLike → Equals → AnyRef → Any
  57. def exists (p: (B) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    Tests whether a predicate holds for some of the elements of this mutable indexed sequence.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  58. def filter (p: (B) ⇒ Boolean): This

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IndexedSeqViewTraversableViewLikeTraversableLike → GenTraversableLike
  59. def filterNot (p: (B) ⇒ Boolean): IndexedSeqView[B, Coll]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  60. def finalize (): Unit

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

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

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

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  61. def find (p: (B) ⇒ Boolean): Option[B]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  62. def flatMap [B] (f: (B) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

    [use case] Builds a new collection by applying a function to all elements of this mutable indexed sequence and concatenating the results.

    [use case]

    Builds a new collection by applying a function to all elements of this mutable indexed sequence and concatenating the results.

    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 mutable indexed sequence and concatenating the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  63. def flatMap [B, That] (f: (B) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Builds a new collection by applying a function to all elements of this mutable indexed sequence and concatenating the results.

    Builds a new collection by applying a function to all elements of this mutable indexed sequence and concatenating the results.

    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.

    f

    the function to apply to each 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

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

    Definition Classes
    TraversableViewLikeTraversableLike → GenTraversableLike → FilterMonadic
  64. def flatten [B] : IndexedSeq[B]

    [use case] Converts this mutable indexed sequence of traversable collections into a mutable indexed sequence in which all element collections are concatenated.

    [use case]

    Converts this mutable indexed sequence of traversable collections into a mutable indexed sequence in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

    a new mutable indexed sequence resulting from concatenating all element mutable indexed sequences.

    Attributes
    abstract
    Definition Classes
    GenericTraversableTemplate
  65. def flatten [B] (implicit asTraversable: (B) ⇒ TraversableOnce[B]): Traversable[B]

    Converts this mutable indexed sequence of traversable collections into a mutable indexed sequence in which all element collections are concatenated.

    Converts this mutable indexed sequence of traversable collections into a mutable indexed sequence in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this mutable indexed sequence is a Traversable.

    returns

    a new mutable indexed sequence resulting from concatenating all element mutable indexed sequences.

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  66. def fold [A1 >: B] (z: A1)(op: (A1, A1) ⇒ A1): A1

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

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the foldLeft and foldRight methods of the trait Traversable. The result of folding may only be a supertype of this parallel collection's type parameter T.

    z

    a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing 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
  67. def foldLeft [B] (z: B)(op: (B, B) ⇒ B): B

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

    Applies a binary operator to a start value and all elements of this mutable indexed sequence, 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 mutable indexed sequence, going left to right with the start value z on the left:

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

    where x,,1,,, ..., x,,n,, are the elements of this mutable indexed sequence.

    Definition Classes
    IndexedSeqOptimizedTraversableOnceGenTraversableOnce
  68. def foldRight [B] (z: B)(op: (B, B) ⇒ B): B

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

    Applies a binary operator to all elements of this mutable indexed sequence 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 mutable indexed sequence, going right to left with the start value z on the right:

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

    where x,,1,,, ..., x,,n,, are the elements of this mutable indexed sequence.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  69. def forall (p: (B) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this mutable indexed sequence, otherwise false.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  70. def force [B >: B, That] (implicit bf: CanBuildFrom[Coll, B, That]): That

    Definition Classes
    TraversableViewLike → GenTraversableViewLike
  71. def foreach (f: (B) ⇒ Unit): Unit

    [use case] Applies a function f to all elements of this mutable indexed sequence.

    [use case]

    Applies a function f to all elements of this mutable indexed sequence.

    f

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

    Attributes
    abstract
    Definition Classes
    IterableLike
  72. def foreach [U] (f: (B) ⇒ U): Unit

    Applies a function f to all elements of this mutable indexed sequence.

    Applies a function f to all elements of this mutable indexed sequence.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

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

    Definition Classes
    Transformed → Transformed → Transformed → Transformed → IterableLikeGenericTraversableTemplateTraversableLike → GenTraversableLike → TraversableOnceGenTraversableOnceFilterMonadic
  73. def genericBuilder [B] : Builder[B, IndexedSeq[B]]

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

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

    Definition Classes
    GenericTraversableTemplate
  74. def getClass (): java.lang.Class[_ <: java.lang.Object]

    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.

    Attributes
    final
    Definition Classes
    AnyRef
  75. def groupBy [K] (f: (B) ⇒ K): Map[K, IndexedSeqView[B, Coll]]

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

    Partitions this mutable indexed sequence into a map of mutable indexed sequences 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 mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences 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 mutable indexed sequence of those elements x for which f(x) equals k.

    Definition Classes
    TraversableViewLikeTraversableLike → GenTraversableLike
  76. def grouped (size: Int): Iterator[IndexedSeqView[B, Coll]]

    Partitions elements in fixed size mutable indexed sequences.

    Partitions elements in fixed size mutable indexed sequences.

    size

    the number of elements per group

    returns

    An iterator producing mutable indexed sequences of size size, except the last will be truncated if the elements don't divide evenly.

    Definition Classes
    IterableViewLikeIterableLike
    See also

    Iterator#grouped

  77. def hasDefiniteSize : Boolean

    Tests whether this mutable indexed sequence is known to have a finite size.

    Tests whether this mutable indexed sequence is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    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
  78. def hashCode (): Int

    Hashcodes for IndexedSeq produce a value from the hashcodes of all the elements of the mutable indexed sequence.

    Hashcodes for IndexedSeq produce a value from the hashcodes of all the elements of the mutable indexed sequence.

    returns

    the hash code value for this object.

    Definition Classes
    GenSeqLike → AnyRef → Any
  79. def head : B

    Selects the first element of this mutable indexed sequence.

    Selects the first element of this mutable indexed sequence.

    returns

    the first element of this mutable indexed sequence.

    Definition Classes
    IndexedSeqOptimizedIterableLike → GenIterableLike → TraversableLike → GenTraversableLike
  80. def headOption : Option[B]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this mutable indexed sequence if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLike
  81. def indexOf (elem: B, from: Int): Int

    [use case] Finds index of first occurrence of some value in this mutable indexed sequence after or at some start index.

    [use case]

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

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this mutable indexed sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  82. def indexOf [B >: B] (elem: B, from: Int): Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this mutable indexed sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  83. def indexOf (elem: B): Int

    [use case] Finds index of first occurrence of some value in this mutable indexed sequence.

    [use case]

    Finds index of first occurrence of some value in this mutable indexed sequence.

    elem

    the element value to search for.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  84. def indexOf [B >: B] (elem: B): Int

    Finds index of first occurrence of some value in this mutable indexed sequence.

    Finds index of first occurrence of some value in this mutable indexed sequence.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
  85. def indexOfSlice [B >: B] (that: Seq[B], from: Int): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  86. def indexOfSlice [B >: B] (that: GenSeq[B], from: Int): Int

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

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

    Definition Classes
    SeqLike
  87. def indexOfSlice [B >: B] (that: Seq[B]): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  88. def indexOfSlice [B >: B] (that: GenSeq[B]): Int

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

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

    that

    the sequence to test

    returns

    the first index such that the elements of this mutable indexed sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    Definition Classes
    SeqLike
  89. def indexWhere (p: (B) ⇒ 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 mutable indexed sequence that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    IndexedSeqOptimizedSeqLike → GenSeqLike
  90. def indexWhere (p: (B) ⇒ 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 mutable indexed sequence that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    GenSeqLike
  91. 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 mutable indexed sequence.

    Definition Classes
    SeqLike
  92. def init : This

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a mutable indexed sequence consisting of all elements of this mutable indexed sequence except the last one.

    Definition Classes
    IndexedSeqViewTraversableViewLikeIndexedSeqOptimizedTraversableLike
  93. def inits : Iterator[IndexedSeqView[B, Coll]]

    Iterates over the inits of this mutable indexed sequence.

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

    returns

    an iterator over all the inits of this mutable indexed sequence

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

  94. def intersect [B >: B] (that: Seq[B]): IndexedSeqView[B, Coll]

    Definition Classes
    SeqViewLikeSeqLike
    Annotations
    @bridge()
  95. def intersect (that: Seq[B]): IndexedSeq[B]

    [use case] Computes the multiset intersection between this mutable indexed sequence and another sequence.

    [use case]

    Computes the multiset intersection between this mutable indexed sequence and another sequence.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That which contains all elements of this mutable indexed sequence which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

    Attributes
    abstract
    Definition Classes
    SeqLike
  96. def intersect [B >: B] (that: GenSeq[B]): IndexedSeqView[B, Coll]

    Computes the multiset intersection between this mutable indexed sequence and another sequence.

    Computes the multiset intersection between this mutable indexed sequence and another sequence.

    B

    the element type of the returned mutable indexed sequence.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That which contains all elements of this mutable indexed sequence which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  97. def isDefinedAt (idx: Int): Boolean

    Tests whether this mutable indexed sequence contains given index.

    Tests whether this mutable indexed sequence 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 mutable indexed sequence contains an element at position idx, false otherwise.

    Definition Classes
    GenSeqLike
  98. def isEmpty : Boolean

    Tests whether the mutable indexed sequence is empty.

    Tests whether the mutable indexed sequence is empty.

    returns

    true if the mutable indexed sequence contains no elements, false otherwise.

    Definition Classes
    IndexedSeqOptimizedIterableLike → GenIterableLike → TraversableLikeTraversableOnceGenTraversableOnce
  99. 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.

    Attributes
    final
    Definition Classes
    Any
  100. def isTraversableAgain : Boolean

    Tests whether this mutable indexed sequence can be repeatedly traversed.

    Tests whether this mutable indexed sequence can be repeatedly traversed.

    returns

    true

    Attributes
    final
    Definition Classes
    GenTraversableLike → GenTraversableOnce
  101. def iterator : Iterator[B]

    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
    IndexedSeqLikeIterableLike → GenIterableLike
  102. def last : B

    Selects the last element.

    Selects the last element.

    returns

    The last element of this mutable indexed sequence.

    Definition Classes
    IndexedSeqOptimizedTraversableLike
  103. def lastIndexOf (elem: B, end: Int): Int

    [use case] Finds index of last occurrence of some value in this mutable indexed sequence before or at a given end index.

    [use case]

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

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this mutable indexed sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  104. def lastIndexOf [B >: B] (elem: B, end: Int): Int

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

    Finds index of last occurrence of some value in this mutable indexed sequence 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 mutable indexed sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  105. def lastIndexOf (elem: B): Int

    [use case] Finds index of last occurrence of some value in this mutable indexed sequence.

    [use case]

    Finds index of last occurrence of some value in this mutable indexed sequence.

    elem

    the element value to search for.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  106. def lastIndexOf [B >: B] (elem: B): Int

    Finds index of last occurrence of some value in this mutable indexed sequence.

    Finds index of last occurrence of some value in this mutable indexed sequence.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
  107. def lastIndexOfSlice [B >: B] (that: Seq[B], end: Int): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  108. def lastIndexOfSlice [B >: B] (that: GenSeq[B], end: Int): Int

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

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

    Definition Classes
    SeqLike
  109. def lastIndexOfSlice [B >: B] (that: Seq[B]): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  110. def lastIndexOfSlice [B >: B] (that: GenSeq[B]): Int

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

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

    that

    the sequence to test

    returns

    the last index such that the elements of this mutable indexed sequence starting a this index match the elements of sequence that, or -1 of no such subsequence exists.

    Definition Classes
    SeqLike
  111. def lastIndexWhere (p: (B) ⇒ 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 mutable indexed sequence that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    IndexedSeqOptimizedSeqLike → GenSeqLike
  112. def lastIndexWhere (p: (B) ⇒ 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 mutable indexed sequence that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    GenSeqLike
  113. def lastOption : Option[B]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this mutable indexed sequence$ if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLike
  114. def lengthCompare (len: Int): Int

    Compares the length of this mutable indexed sequence to a test value.

    Compares the length of this mutable indexed sequence to a test value.

    len

    the test value that gets compared with the length.

    returns

    A value x where

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

    The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap.

    Definition Classes
    IndexedSeqOptimizedSeqLike
  115. def lift : (Int) ⇒ Option[B]

    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

  116. def map [B] (f: (B) ⇒ B): IndexedSeq[B]

    [use case] Builds a new collection by applying a function to all elements of this mutable indexed sequence.

    [use case]

    Builds a new collection by applying a function to all elements of this mutable indexed sequence.

    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 mutable indexed sequence and collecting the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  117. def map [B, That] (f: (B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Builds a new collection by applying a function to all elements of this mutable indexed sequence.

    Builds a new collection by applying a function to all elements of this mutable indexed sequence.

    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.

    f

    the function to apply to each 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

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

    Definition Classes
    TraversableViewLikeTraversableLike → GenTraversableLike → FilterMonadic
  118. def max : B

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this mutable indexed sequence with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  119. def max [B >: B] (implicit cmp: Ordering[B]): B

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this mutable indexed sequence with respect to the ordering cmp.

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  121. def min : B

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this mutable indexed sequence with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  122. def min [B >: B] (implicit cmp: Ordering[B]): B

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this mutable indexed sequence with respect to the ordering cmp.

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  124. def mkString (start: String, sep: String, end: String): String

    Definition Classes
    ViewMkString
  125. def mkString (sep: String): String

    Definition Classes
    ViewMkString
  126. def mkString : String

    Definition Classes
    ViewMkString
  127. 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.

    Attributes
    final
    Definition Classes
    AnyRef
  128. def newAppended [B >: B] (that: GenTraversable[B]): Transformed[B]

    Attributes
    protected
    Definition Classes
    SeqViewLikeIterableViewLikeTraversableViewLike
  129. def newBuilder : Builder[B, IndexedSeqView[B, Coll]]

    The builder that builds instances of type IndexedSeq[A]

    The builder that builds instances of type IndexedSeq[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableViewLikeGenericTraversableTemplateTraversableLikeHasNewBuilder
  130. def newDropped (n: Int): Transformed[B]

    Attributes
    protected
    Definition Classes
    SeqViewLikeIterableViewLikeTraversableViewLike
  131. def newDroppedWhile (p: (B) ⇒ Boolean): Transformed[B]

    Attributes
    protected
    Definition Classes
    IndexedSeqViewSeqViewLikeIterableViewLikeTraversableViewLike
  132. def newFiltered (p: (B) ⇒ Boolean): Transformed[B]

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    Attributes
    protected
    Definition Classes
    IndexedSeqViewSeqViewLikeIterableViewLikeTraversableViewLike
  133. def newFlatMapped [B] (f: (B) ⇒ GenTraversableOnce[B]): Transformed[B]

    Attributes
    protected
    Definition Classes
    SeqViewLikeIterableViewLikeTraversableViewLike
  134. def newForced [B] (xs: ⇒ GenSeq[B]): Transformed[B]

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    Attributes
    protected
    Definition Classes
    SeqViewLikeIterableViewLikeTraversableViewLike
  135. def newMapped [B] (f: (B) ⇒ B): Transformed[B]

    Attributes
    protected
    Definition Classes
    SeqViewLikeIterableViewLikeTraversableViewLike
  136. def newPatched [B >: B] (_from: Int, _patch: GenSeq[B], _replaced: Int): Transformed[B]

    Attributes
    protected
    Definition Classes
    SeqViewLike
  137. def newPrepended [B >: B] (elem: B): Transformed[B]

    Attributes
    protected
    Definition Classes
    SeqViewLike
  138. def newReversed : Transformed[B]

    Attributes
    protected
    Definition Classes
    IndexedSeqViewSeqViewLike
  139. def newSliced (_endpoints: SliceInterval): Transformed[B]

    Attributes
    protected
    Definition Classes
    IndexedSeqViewSeqViewLikeIterableViewLikeTraversableViewLike
  140. def newTaken (n: Int): Transformed[B]

    Attributes
    protected
    Definition Classes
    SeqViewLikeIterableViewLikeTraversableViewLike
  141. def newTakenWhile (p: (B) ⇒ Boolean): Transformed[B]

    Attributes
    protected
    Definition Classes
    IndexedSeqViewSeqViewLikeIterableViewLikeTraversableViewLike
  142. def newZipped [B] (that: GenIterable[B]): Transformed[(B, B)]

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    Attributes
    protected
    Definition Classes
    SeqViewLikeIterableViewLike
  143. def newZippedAll [A1 >: B, B] (that: GenIterable[B], _thisElem: A1, _thatElem: B): Transformed[(A1, B)]

    Attributes
    protected
    Definition Classes
    SeqViewLikeIterableViewLike
  144. def nonEmpty : Boolean

    Tests whether the mutable indexed sequence is not empty.

    Tests whether the mutable indexed sequence is not empty.

    returns

    true if the mutable indexed sequence contains at least one element, false otherwise.

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

    Attributes
    final
    Definition Classes
    AnyRef
  146. 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.

    Attributes
    final
    Definition Classes
    AnyRef
  147. def orElse [A1 <: Int, B1 >: B] (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
  148. def padTo (len: Int, elem: B): IndexedSeq[B]

    [use case] Appends an element value to this mutable indexed sequence until a given target length is reached.

    [use case]

    Appends an element value to this mutable indexed sequence until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

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

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  149. def padTo [B >: B, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Appends an element value to this mutable indexed sequence until a given target length is reached.

    Appends an element value to this mutable indexed sequence until a given target length is reached.

    B

    the element type of the returned mutable indexed sequence.

    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.

    len

    the target length

    elem

    the padding value

    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 consisting of all elements of this mutable indexed sequence followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  150. def par : ParSeq[B]

    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
    Parallelizable
  151. def parCombiner : Combiner[B, ParSeq[B]]

    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
    SeqLikeSeqLikeTraversableLikeParallelizable
  152. def partition (p: (B) ⇒ Boolean): (IndexedSeqView[B, Coll], IndexedSeqView[B, Coll])

    Partitions this mutable indexed sequence in two mutable indexed sequences according to a predicate.

    Partitions this mutable indexed sequence in two mutable indexed sequences according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    Definition Classes
    TraversableViewLikeTraversableLike → GenTraversableLike
  153. def patch (from: Int, that: GenSeq[B], replaced: Int): IndexedSeq[B]

    [use case] Produces a new mutable indexed sequence where a slice of elements in this mutable indexed sequence is replaced by another sequence.

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original mutable indexed sequence

    returns

    a new mutable indexed sequence consisting of all elements of this mutable indexed sequence except that replaced elements starting from from are replaced by patch.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  154. def patch [B >: B, That] (from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

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

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

    B

    the element type of the returned mutable indexed sequence.

    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.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original mutable indexed sequence

    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 mutable indexed sequence consisting of all elements of this mutable indexed sequence except that replaced elements starting from from are replaced by patch.

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  155. def patch [B >: B, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  156. def permutations : Iterator[IndexedSeqView[B, Coll]]

    Iterates over distinct permutations.

    Iterates over distinct permutations.

    returns

    An Iterator which traverses the distinct permutations of this mutable indexed sequence.

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

  157. def prefixLength (p: (B) ⇒ 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 mutable indexed sequence such that every element of the segment satisfies the predicate p.

    Definition Classes
    GenSeqLike
  158. def product : B

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements of this mutable indexed sequence with respect to the * operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  159. def product [B >: B] (implicit num: Numeric[B]): B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

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

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

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

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

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

    Note this method has a different signature than the reduceLeft and reduceRight methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  161. def reduceLeft [B >: B] (op: (B, B) ⇒ B): B

    Definition Classes
    IndexedSeqOptimizedTraversableOnce
  162. def reduceLeftOption [B >: B] (op: (B, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this mutable indexed sequence, going left to right.

    Optionally applies a binary operator to all elements of this mutable indexed sequence, 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 mutable indexed sequence is nonempty, None otherwise.

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

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    Optionally reduces the elements of this sequence using the specified associative binary operator.

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

    Note this method has a different signature than the reduceLeftOption and reduceRightOption methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    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
  164. def reduceRight [B >: B] (op: (B, B) ⇒ B): B

    Applies a binary operator to all elements of this mutable indexed sequence, going right to left.

    Applies a binary operator to all elements of this mutable indexed sequence, 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 mutable indexed sequence, going right to left:

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

    where x,,1,,, ..., x,,n,, are the elements of this mutable indexed sequence.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  165. def reduceRightOption [B >: B] (op: (B, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this mutable indexed sequence, going right to left.

    Optionally applies a binary operator to all elements of this mutable indexed sequence, 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 mutable indexed sequence is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  166. def repr : IndexedSeqView[B, Coll]

    The collection of type mutable indexed sequence underlying this TraversableLike object.

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

    Definition Classes
    TraversableLike → GenTraversableLike
  167. def reverse : This

    Returns new mutable indexed sequence wih elements in reversed order.

    Returns new mutable indexed sequence wih elements in reversed order.

    returns

    A new mutable indexed sequence with all elements of this mutable indexed sequence in reversed order.

    Definition Classes
    IndexedSeqViewSeqViewLikeIndexedSeqOptimizedSeqLike → GenSeqLike
  168. def reverseIterator : Iterator[B]

    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 mutable indexed sequence in reversed order

    Definition Classes
    IndexedSeqOptimizedSeqLike
  169. def reverseMap [B] (f: (B) ⇒ B): IndexedSeq[B]

    [use case] Builds a new collection by applying a function to all elements of this mutable indexed sequence and collecting the results in reversed order.

    [use case]

    Builds a new collection by applying a function to all elements of this mutable indexed sequence and collecting the results in reversed order.

    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 mutable indexed sequence and collecting the results in reversed order.

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

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  170. def reverseMap [B, That] (f: (B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Builds a new collection by applying a function to all elements of this mutable indexed sequence and collecting the results in reversed order.

    Builds a new collection by applying a function to all elements of this mutable indexed sequence and collecting the results in reversed order.

    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.

    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.

    f

    the function to apply to each 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

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

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  171. def reversed : List[B]

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

    [use case] Checks if the other iterable collection contains the same elements in the same order as this mutable indexed sequence.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this mutable indexed sequence.

    that

    the collection to compare with.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  173. def sameElements [B >: B] (that: GenIterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this mutable indexed sequence.

    Checks if the other iterable collection contains the same elements in the same order as this mutable indexed sequence.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLike → GenIterableLike
  174. def sameElements [B >: B] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  175. def scan [B >: B, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeqView[B, Coll], 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 mutable indexed sequence containing the prefix scan of the elements in this mutable indexed sequence

    Definition Classes
    TraversableLike → GenTraversableLike
  176. def scanLeft [B, That] (z: B)(op: (B, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], 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
    TraversableViewLikeTraversableLike → GenTraversableLike
  177. def scanRight [B, That] (z: B)(op: (B, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], 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
    TraversableViewLikeTraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

  178. def segmentLength (p: (B) ⇒ 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 mutable indexed sequence starting from index from such that every element of the segment satisfies the predicate p.

    Definition Classes
    IndexedSeqOptimizedSeqLike → GenSeqLike
  179. def seq : Seq[B]

    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
    SeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  180. def size : Int

    The size of this mutable indexed sequence, equivalent to length.

    The size of this mutable indexed sequence, equivalent to length.

    returns

    the number of elements in this mutable indexed sequence.

    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnceGenTraversableOnce
  181. def slice (from: Int, until: Int): This

    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 mutable indexed sequence.

    until

    the highest index to EXCLUDE from this mutable indexed sequence.

    returns

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

    Definition Classes
    IndexedSeqViewTraversableViewLikeIndexedSeqOptimizedIterableLikeTraversableLike → GenTraversableLike
  182. def sliding [B >: B] (size: Int, step: Int): Iterator[IndexedSeqView[B, Coll]]

    Definition Classes
    IterableViewLikeIterableLike
  183. def sliding [B >: B] (size: Int): Iterator[IndexedSeqView[B, Coll]]

    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 mutable indexed sequences 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

  184. def sortBy [B] (f: (B) ⇒ B)(implicit ord: Ordering[B]): IndexedSeqView[B, Coll]

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

    Sorts this IndexedSeq 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 mutable indexed sequence consisting of the elements of this mutable indexed sequence 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

  185. def sortWith (lt: (B, B) ⇒ Boolean): IndexedSeqView[B, Coll]

    Sorts this mutable indexed sequence according to a comparison function.

    Sorts this mutable indexed sequence 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 mutable indexed sequence consisting of the elements of this mutable indexed sequence 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")
      
  186. def sorted [B >: B] (implicit ord: Ordering[B]): IndexedSeqView[B, Coll]

    Sorts this mutable indexed sequence according to an Ordering.

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

    Definition Classes
    SeqViewLikeSeqLike
    See also

    scala.math.Ordering

  187. def span (p: (B) ⇒ Boolean): (This, This)

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

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

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

    p

    the test predicate

    returns

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

    Definition Classes
    IndexedSeqViewTraversableViewLikeIndexedSeqOptimizedTraversableLike → GenTraversableLike
  188. def splitAt (n: Int): (This, This)

    Splits this mutable indexed sequence into two at a given position.

    Splits this mutable indexed sequence into two 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 mutable indexed sequences consisting of the first n elements of this mutable indexed sequence, and the other elements.

    Definition Classes
    IndexedSeqViewTraversableViewLikeIndexedSeqOptimizedTraversableLike → GenTraversableLike
  189. def startsWith [B] (that: GenSeq[B], offset: Int): Boolean

    Tests whether this mutable indexed sequence contains the given sequence at a given index.

    Tests whether this mutable indexed sequence contains the given sequence at a given index.

    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 mutable indexed sequence at index offset, otherwise false.

    Definition Classes
    IndexedSeqOptimizedSeqLike → GenSeqLike
  190. def startsWith [B] (that: Seq[B], offset: Int): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  191. def startsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  192. def startsWith [B] (that: GenSeq[B]): Boolean

    Tests whether this mutable indexed sequence starts with the given sequence.

    Tests whether this mutable indexed sequence 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
  193. 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 mutable indexed sequence. By default the string prefix is the simple name of the collection class mutable indexed sequence.

    Definition Classes
    Transformed → Transformed → TraversableViewLikeTraversableLike → GenTraversableLike
  194. def sum : B

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements of this mutable indexed sequence with respect to the + operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  195. def sum [B >: B] (implicit num: Numeric[B]): B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  196. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  197. def tail : IndexedSeqView[B, Coll]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

    a mutable indexed sequence consisting of all elements of this mutable indexed sequence except the first one.

    Definition Classes
    IndexedSeqOptimizedTraversableLike → GenTraversableLike
  198. def tails : Iterator[IndexedSeqView[B, Coll]]

    Iterates over the tails of this mutable indexed sequence.

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

    returns

    an iterator over all the tails of this mutable indexed sequence

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

  199. def take (n: Int): This

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this mutable indexed sequence.

    returns

    a mutable indexed sequence consisting only of the first n elements of this mutable indexed sequence, or else the whole mutable indexed sequence, if it has less than n elements.

    Definition Classes
    IndexedSeqViewIterableViewLikeTraversableViewLikeIndexedSeqOptimizedIterableLikeTraversableLike → GenTraversableLike
  200. def takeRight (n: Int): IndexedSeqView[B, Coll]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

    a mutable indexed sequence consisting only of the last n elements of this mutable indexed sequence, or else the whole mutable indexed sequence, if it has less than n elements.

    Definition Classes
    IndexedSeqOptimizedIterableLike
  201. def takeWhile (p: (B) ⇒ Boolean): This

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

    Definition Classes
    IndexedSeqViewTraversableViewLikeIndexedSeqOptimizedIterableLikeTraversableLike → GenTraversableLike
  202. def thisCollection : IndexedSeq[B]

    The underlying collection seen as an instance of IndexedSeq.

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

    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLikeIndexedSeqLikeSeqLikeIterableLikeTraversableLike
  203. def thisSeq : Seq[B]

    Attributes
    protected[this]
    Definition Classes
    ViewMkString
  204. def toArray : Array[B]

    [use case] Converts this mutable indexed sequence to an array.

    [use case]

    Converts this mutable indexed sequence to an array.

    returns

    an array containing all elements of this mutable indexed sequence.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  205. def toArray [B >: B] (implicit arg0: ClassManifest[B]): Array[B]

    Converts this mutable indexed sequence to an array.

    Converts this mutable indexed sequence to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this mutable indexed sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  206. def toBuffer [A1 >: B] : Buffer[A1]

    Overridden for efficiency

    Overridden for efficiency

    returns

    a buffer containing all elements of this mutable indexed sequence.

    Definition Classes
    IndexedSeqLikeTraversableOnceGenTraversableOnce
  207. def toCollection (repr: IndexedSeqView[B, Coll]): IndexedSeq[B]

    A conversion from collections of type Repr to IndexedSeq objects.

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

    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLikeIndexedSeqLikeSeqLikeIterableLikeTraversableLike
  208. def toIndexedSeq [B >: B] : IndexedSeq[B]

    Converts this mutable indexed sequence to an indexed sequence.

    Converts this mutable indexed sequence to an indexed sequence.

    returns

    an indexed sequence containing all elements of this mutable indexed sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  209. def toIterable : Iterable[B]

    Converts this mutable indexed sequence to an iterable collection.

    Converts this mutable indexed sequence 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 mutable indexed sequence.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  210. def toIterator : Iterator[B]

    Returns an Iterator over the elements in this mutable indexed sequence.

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

    returns

    an Iterator containing all elements of this mutable indexed sequence.

    Definition Classes
    TraversableLikeGenTraversableOnce
  211. def toList : List[B]

    Converts this mutable indexed sequence to a list.

    Converts this mutable indexed sequence to a list.

    returns

    a list containing all elements of this mutable indexed sequence.

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

    [use case] Converts this mutable indexed sequence to a map.

    [use case]

    Converts this mutable indexed sequence to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this mutable indexed sequence.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  213. def toMap [T, U] (implicit ev: <:<[B, (T, U)]): Map[T, U]

    Converts this mutable indexed sequence to a map.

    Converts this mutable indexed sequence to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this mutable indexed sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  214. def toSeq : Seq[B]

    Converts this mutable indexed sequence to a sequence.

    Converts this mutable indexed sequence to a sequence.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this mutable indexed sequence.

    Definition Classes
    SeqLike → GenSeqLike → TraversableOnceGenTraversableOnce
  215. def toSet [B >: B] : Set[B]

    Converts this mutable indexed sequence to a set.

    Converts this mutable indexed sequence to a set.

    returns

    a set containing all elements of this mutable indexed sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  216. def toStream : Stream[B]

    Converts this mutable indexed sequence to a stream.

    Converts this mutable indexed sequence to a stream.

    returns

    a stream containing all elements of this mutable indexed sequence.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  217. 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
    TransformedTransformed → Transformed → Transformed → Transformed → Transformed → Transformed → TraversableViewLikeSeqLikeFunction1TraversableLike → AnyRef → Any
  218. def toTraversable : Traversable[B]

    Converts this mutable indexed sequence to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this mutable indexed sequence.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  219. def transform (f: (B) ⇒ B): Transformed.this.type

    Applies a transformation function to all values contained in this sequence.

    Applies a transformation function to all values contained in this sequence. The transformation function produces new values from existing elements.

    f

    the transformation to apply

    returns

    the sequence itself.

    Definition Classes
    SeqLike
  220. def transpose [B] (implicit asTraversable: (B) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

    Transposes this mutable indexed sequence of traversable collections into a mutable indexed sequence of mutable indexed sequences.

    Transposes this mutable indexed sequence of traversable collections into a mutable indexed sequence of mutable indexed sequences.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this mutable indexed sequence is a Traversable.

    returns

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

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  221. lazy val underlying : Coll

    Definition Classes
    Transformed → GenTraversableViewLike
  222. def union (that: Seq[B]): IndexedSeq[B]

    [use case] Produces a new sequence which contains all elements of this mutable indexed sequence and also all elements of a given sequence.

    [use case]

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

    that

    the sequence to add.

    returns

    a new collection of type That which contains all elements of this mutable indexed sequence followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    SeqLike
  223. def union [B >: B, That] (that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

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

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

    Another way to express this is that xs union ys computes the order-presevring multi-set union of xs and ys. union is hence a counter-part of diff and intersect which also work on multi-sets.

    B

    the element type of the returned mutable indexed sequence.

    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 sequence to add.

    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 mutable indexed sequence followed by all elements of that.

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  224. def union [B >: B, That] (that: Seq[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  225. def unzip [A1, A2] (implicit asPair: (B) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

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

    Converts this mutable indexed sequence 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 mutable indexed sequence is a pair.

    returns

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

    Definition Classes
    GenericTraversableTemplate
  226. def unzip3 [A1, A2, A3] (implicit asTriple: (B) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

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

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  227. def updated (index: Int, elem: B): IndexedSeq[B]

    [use case] A copy of this mutable indexed sequence with one single replaced element.

    [use case]

    A copy of this mutable indexed sequence with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

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

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  228. def updated [B >: B, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], B, That]): That

    A copy of this mutable indexed sequence with one single replaced element.

    A copy of this mutable indexed sequence with one single replaced element.

    B

    the element type of the returned mutable indexed sequence.

    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.

    index

    the position of the replacement

    elem

    the replacing 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

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

    Definition Classes
    SeqViewLikeSeqLike → GenSeqLike
  229. def view (from: Int, until: Int): IndexedSeqView[B, IndexedSeqView[B, Coll]]

    A sub-sequence view starting at index from and extending up to (but not including) index until.

    A sub-sequence view starting at index from and extending up to (but not including) index until.

    from

    The index of the first element of the slice

    until

    The index of the element following the slice

    returns

    a non-strict view of a slice of this mutable indexed sequence, starting at index from and extending up to (but not including) index until[email protected] The difference between view and slice is that view produces a view of the current sequence, whereas slice produces a new sequence.

    Definition Classes
    IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  230. def view : IndexedSeqView[B, IndexedSeqView[B, Coll]]

    Creates a view of this iterable @see Iterable.

    Creates a view of this iterable @see Iterable.View

    returns

    a non-strict view of this mutable indexed sequence.

    Definition Classes
    IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  231. def viewIdString : String

    Attributes
    protected[this] final
    Definition Classes
    Transformed → GenTraversableViewLike
  232. def viewIdentifier : String

    Attributes
    protected[this]
    Definition Classes
    TraversableViewLike → GenTraversableViewLike
  233. def viewToString : String

    Definition Classes
    GenTraversableViewLike
  234. def wait (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  237. def withFilter (p: (B) ⇒ Boolean): IndexedSeqView[B, Coll]

    Creates a non-strict filter of this mutable indexed sequence.

    Creates a non-strict filter of this mutable indexed sequence.

    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 mutable indexed sequence which satisfy the predicate p.

    Definition Classes
    TraversableViewLikeTraversableLikeFilterMonadic
  238. def zip [B] (that: GenIterable[B]): IndexedSeq[(B, B)]

    [use case] Returns a mutable indexed sequence formed from this mutable indexed sequence and another iterable collection by combining corresponding elements in pairs.

    [use case]

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

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this mutable indexed sequence and that. The length of the returned collection is the minimum of the lengths of this mutable indexed sequence and that.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  239. def zip [A1 >: B, B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], (A1, B), That]): That

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

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    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 (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

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

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this mutable indexed sequence and that. The length of the returned collection is the minimum of the lengths of this mutable indexed sequence and that.

    Definition Classes
    IterableViewLikeIterableLike → GenIterableLike
  240. def zip [A1 >: B, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  241. def zipAll [B] (that: Iterable[B], thisElem: B, thatElem: B): IndexedSeq[(B, B)]

    [use case] Returns a mutable indexed sequence formed from this mutable indexed sequence and another iterable collection by combining corresponding elements in pairs.

    [use case]

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

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  242. def zipAll [B, A1 >: B, That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], (A1, B), That]): That

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

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

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    Definition Classes
    IterableViewLikeIterableLike → GenIterableLike
  243. def zipAll [B, A1 >: B, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  244. def zipWithIndex : IndexedSeq[(B, Int)]

    [use case] Zips this mutable indexed sequence with its indices.

    [use case]

    Zips this mutable indexed sequence with its indices.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  245. def zipWithIndex [A1 >: B, That] (implicit bf: CanBuildFrom[IndexedSeqView[B, Coll], (A1, Int), That]): That

    Zips this mutable indexed sequence with its indices.

    Zips this mutable indexed sequence with its indices.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    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 (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

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

    Definition Classes
    IterableViewLikeIterableLike → GenIterableLike
  246. def elements : Iterator[B]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

  247. def equalsWith [B] (that: Seq[B])(f: (B, B) ⇒ Boolean): Boolean

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

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

    B

    the type of the elements of that

    that

    the other sequence

    returns

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

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use corresponds instead

  248. def findIndexOf (p: (B) ⇒ Boolean): Int

    Returns index of the first element satisfying a predicate, or -1.

    Returns index of the first element satisfying a predicate, or -1.

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    Use indexWhere(p) instead.

  249. def findLastIndexOf (p: (B) ⇒ Boolean): Int

    Returns index of the last element satisfying a predicate, or -1.

    Returns index of the last element satisfying a predicate, or -1.

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use lastIndexWhere instead

  250. def first : B

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

  251. def firstOption : Option[B]

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

  252. def projection : SeqView[B, IndexedSeqView[B, Coll]]

    returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection.

    returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection.

    Definition Classes
    SeqLikeIterableLike
    Annotations
    @deprecated
    Deprecated

    use view' instead

  253. def reversedElements : Iterator[B]

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use reverseIterator' instead

Inherited from Transformed[B]

Inherited from Transformed[B]

Inherited from Transformed[B]

Inherited from Transformed[B]

Inherited from Transformed[B]

Inherited from Transformed[B]

Inherited from IndexedSeqView[B, Coll]

Inherited from SeqView[B, Coll]

Inherited from GenSeqView[B, Coll]

Inherited from SeqViewLike[B, Coll, IndexedSeqView[B, Coll]]

Inherited from GenSeqViewLike[B, Coll, IndexedSeqView[B, Coll]]

Inherited from IterableView[B, Coll]

Inherited from GenIterableView[B, Coll]

Inherited from IterableViewLike[B, Coll, IndexedSeqView[B, Coll]]

Inherited from GenIterableViewLike[B, Coll, IndexedSeqView[B, Coll]]

Inherited from TraversableView[B, Coll]

Inherited from GenTraversableView[B, Coll]

Inherited from TraversableViewLike[B, Coll, IndexedSeqView[B, Coll]]

Inherited from GenTraversableViewLike[B, Coll, IndexedSeqView[B, Coll]]

Inherited from ViewMkString[B]

Inherited from IndexedSeqOptimized[B, IndexedSeqView[B, Coll]]

Inherited from IndexedSeqOptimized[B, IndexedSeqView[B, Coll]]

Inherited from IndexedSeq[B]

Inherited from IndexedSeqLike[B, IndexedSeqView[B, Coll]]

Inherited from IndexedSeq[B]

Inherited from IndexedSeqLike[B, IndexedSeqView[B, Coll]]

Inherited from Seq[B]

Inherited from SeqLike[B, Seq[B]]

Inherited from Cloneable[Seq[B]]

Inherited from Seq[B]

Inherited from SeqLike[B, IndexedSeqView[B, Coll]]

Inherited from GenSeq[B]

Inherited from GenSeqLike[B, IndexedSeqView[B, Coll]]

Inherited from PartialFunction[Int, B]

Inherited from (Int) ⇒ B

Inherited from Iterable[B]

Inherited from Iterable[B]

Inherited from IterableLike[B, IndexedSeqView[B, Coll]]

Inherited from Equals

Inherited from GenIterable[B]

Inherited from GenIterableLike[B, IndexedSeqView[B, Coll]]

Inherited from Traversable[B]

Inherited from Mutable

Inherited from Traversable[B]

Inherited from GenTraversable[B]

Inherited from GenericTraversableTemplate[B, IndexedSeq]

Inherited from TraversableLike[B, IndexedSeqView[B, Coll]]

Inherited from GenTraversableLike[B, IndexedSeqView[B, Coll]]

Inherited from Parallelizable[B, ParSeq[B]]

Inherited from TraversableOnce[B]

Inherited from GenTraversableOnce[B]

Inherited from FilterMonadic[B, IndexedSeqView[B, Coll]]

Inherited from HasNewBuilder[B, IndexedSeqView[B, Coll]]

Inherited from AnyRef

Inherited from Any