scala.collection

SeqView

trait SeqView[+A, +Coll] extends SeqViewLike[A, Coll, SeqView[A, Coll]]

A base trait for non-strict views of sequences .

$viewInfo All views for sequences are defined by re-interpreting the length and apply methods.

A

the element type of the view

Coll

the type of the underlying collection containing the elements .

go to: companion
known subclasses: Transformed, IndexedSeqView
source: SeqView.scala
    version
  1. 2 . 8

    since
  1. 2 . 8

    authors:
  1. Martin Odersky

Inherited
  1. Hide All
  2. Show all
  1. SeqViewLike
  2. IterableView
  3. IterableViewLike
  4. TraversableView
  5. TraversableViewLike
  6. Seq
  7. SeqLike
  8. Iterable
  9. IterableLike
  10. Equals
  11. Traversable
  12. GenericTraversableTemplate
  13. TraversableLike
  14. TraversableOnce
  15. HasNewBuilder
  16. PartialFunction
  17. Function1
  18. AnyRef
  19. Any
Visibility
  1. Public
  2. All

Type Members

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

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  2. trait DroppedWhile extends Transformed[A] with DroppedWhile

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  3. trait Filtered extends Transformed[A] with Filtered

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  4. trait FlatMapped[B] extends Transformed[B] with FlatMapped[B]

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  5. trait Forced[B] extends Transformed[B] with Forced[B]

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

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

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  7. trait Patched[B >: A] extends Transformed[B]

  8. trait Prepended[B >: A] extends Transformed[B]

  9. trait Reversed extends Transformed[A]

  10. type Self = Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]

    The type implementing this traversable

    The type implementing this traversable

    attributes: protected
    definition classes: TraversableLike
  11. trait Sliced extends Transformed[A] with Sliced

    pre: from >= 0

  12. trait TakenWhile extends Transformed[A] with TakenWhile

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  13. trait Transformed[+B] extends SeqView[B, Coll] with Transformed[B]

    The implementation base trait of this view .

  14. class WithFilter extends AnyRef

    A class supporting filtered operations .

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

    definition classes: SeqViewLikeIterableViewLike
  16. trait ZippedAll[A1 >: A, B] extends Transformed[(A1, B)] with ZippedAll[A1, B]

    definition classes: SeqViewLikeIterableViewLike

Value Members

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

    attributes: final
    definition classes: AnyRef
  2. def !=(arg0: Any): Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality .

    returns

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

    attributes: final
    definition classes: Any
  3. def ##(): Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf[T0](): T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf[T0](): Boolean

    attributes: final
    definition classes: AnyRef
  6. def ++(that: TraversableOnce[A]): Seq[A]

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

    [use case]

    Concatenates this sequence with the elements of a traversable collection .

    that

    the traversable to append .

    returns

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

    attributes: abstract
  7. def ++[B >: A, That](xs: TraversableOnce[B])(implicit bf: CanBuildFrom[This, B, That]): That

    Concatenates this sequence with the elements of a traversable collection .

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

    definition classes: TraversableViewLikeTraversableLike
  8. def ++(that: TraversableOnce[A]): Seq[A]

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

    [use case]

    Concatenates this sequence with the elements of a traversable collection .

    that

    the traversable to append .

    returns

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

    attributes: abstract
  9. def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Seq[A] with SeqView[A, Coll] with IterableView[A, Coll], B, That]): That

    Concatenates this sequence with the elements of a traversable collection .

    Concatenates this 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.

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

    definition classes: TraversableLike
  10. def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[This, B, That]): That

    definition classes: SeqViewLike
  11. def +:(elem: A): Seq[A]

    [use case] Prepends an element to this sequence

    [use case]

    Prepends an element to this sequence

    elem

    the prepended element

    returns

    a new sequence consisting of elem followed by all elements of this sequence.

    attributes: abstract
  12. def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    Prepends an element to this sequence

    Prepends an element to this sequence

    B

    the element type of the returned 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 sequence.

    definition classes: SeqLike
  13. def /:[B](z: B)(op: (B, A) ⇒ B): B

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

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    z

    the start value .

    op

    the binary operator .

    returns

    the result of inserting op between consecutive elements of this sequence, going left to right with the start value z on the left: op(...op(op(z, x1), x2), ..., xn) where x,,1,,, ..., x,,n,, are the elements of this sequence.

    definition classes: TraversableOnce
  14. def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[This, B, That]): That

    definition classes: SeqViewLike
  15. def :+(elem: A): Seq[A]

    [use case] Appends an element to this sequence

    [use case]

    Appends an element to this sequence

    Note: will not terminate for infinite-sized collections.

    elem

    the appended element

    returns

    a new sequence consisting of all elements of this sequence followed by elem.

    attributes: abstract
  16. def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    Appends an element to this sequence

    Appends an element to this sequence

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned 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 sequence followed by elem.

    definition classes: SeqLike
  17. def :\[B](z: B)(op: (A, B) ⇒ B): B

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

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this sequence, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this sequence.

    definition classes: TraversableOnce
  18. def ==(arg0: AnyRef): Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality .

    returns

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

    attributes: final
    definition classes: AnyRef
  19. def ==(arg0: Any): Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality .

    returns

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

    attributes: final
    definition classes: Any
  20. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this sequence to a string builder .

    Appends all elements of this sequence to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this 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 sequence to a string builder using a separator string .

    Appends all elements of this 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 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 addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

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

    b

    the string builder to which elements are appended .

    start

    the starting string .

    sep

    the separator string .

    end

    the ending string .

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  23. def andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]

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

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

    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 apply(idx: Int): A

    Selects an element by its index in the sequence .

    Selects an element by its index in the sequence .

    idx

    The index to select .

    returns

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

    attributes: abstract
    definition classes: SeqLike
  25. def asInstanceOf[T0]: T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to 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 expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(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 typed.

    returns

    the receiver object .

    attributes: final
    definition classes: Any
  26. 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 sequence should be compared

    returns

    true, if this 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
  27. def clone(): AnyRef

    This method creates and returns a copy of the receiver object .

    This method creates and returns a copy of the receiver object .

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object .

    attributes: protected
    definition classes: AnyRef
  28. def collect[B](pf: PartialFunction[A, B]): Seq[B]

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

    [use case]

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

    B

    the element type of the returned collection .

    pf

    the partial function which filters and maps the sequence .

    returns

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

    attributes: abstract
  29. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[This, B, That]): That

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

    Builds a new collection by applying a partial function to all elements of this 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 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
  30. def collect[B](pf: PartialFunction[A, B]): Seq[B]

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

    [use case]

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

    B

    the element type of the returned collection .

    pf

    the partial function which filters and maps the sequence .

    returns

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

    attributes: abstract
  31. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Seq[A] with SeqView[A, Coll] with IterableView[A, Coll], B, That]): That

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

    Builds a new collection by applying a partial function to all elements of this 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 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: TraversableLike
  32. def companion: GenericCompanion[Seq[A][A]]

    The factory companion object that builds instances of class Seq .

    The factory companion object that builds instances of class Seq .

    definition classes: SeqIterableTraversableGenericTraversableTemplate
  33. def compose[A](g: (A) ⇒ Int): (A) ⇒ A

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  34. def contains(elem: Any): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    elem

    the element to test .

    returns

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

    definition classes: SeqLike
  35. def containsSlice[B](that: Seq[B]): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  36. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

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

    [use case]

    Copies elements of this sequence to an array. Fills the given array xs with at most len elements of this sequence, starting at position start. Copying will stop once either the end of the current 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
  37. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this sequence to an array .

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

    Note: will not terminate for infinite-sized collections.

    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: IterableLikeTraversableLikeTraversableOnce
  38. def copyToArray(xs: Array[A]): Unit

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

    [use case]

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

    xs

    the array to fill .

    attributes: abstract
  39. def copyToArray[B >: A](xs: Array[B]): Unit

    Copies values of this sequence to an array .

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

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array .

    xs

    the array to fill .

    definition classes: TraversableOnce
  40. def copyToArray(xs: Array[A], start: Int): Unit

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

    [use case]

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

    xs

    the array to fill .

    start

    the starting index .

    attributes: abstract
  41. def copyToArray[B >: A](xs: Array[B], start: Int): Unit

    Copies values of this sequence to an array .

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

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array .

    xs

    the array to fill .

    start

    the starting index .

    definition classes: TraversableOnce
  42. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Copies all elements of this sequence to a buffer .

    Copies all elements of this sequence to a buffer .

    Note: will not terminate for infinite-sized collections.

    dest

    The buffer to which elements are copied .

    definition classes: TraversableOnce
  43. def corresponds[B](that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean

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

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

    definition classes: SeqLike
  44. def count(p: (A) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements .

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableOnce
  45. def diff(that: Seq[A]): Seq[A]

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

    [use case]

    Computes the multiset difference between this sequence and another sequence .

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

    a new sequence which contains all elements of this 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
  46. def diff[B >: A](that: Seq[B]): This

    Computes the multiset difference between this sequence and another sequence .

    Computes the multiset difference between this sequence and another sequence .

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned sequence .

    that

    the sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this 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
  47. def distinct: Repr

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

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

    Note: will not terminate for infinite-sized collections.

    returns

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

    definition classes: SeqLike
  48. 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 sequence .

    returns

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

    definition classes: TraversableViewLikeTraversableLike
  49. def dropRight(n: Int): Repr

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

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

    definition classes: IterableLike
  50. def dropWhile(p: (A) ⇒ 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 sequence whose first element does not satisfy the predicate p.

    definition classes: TraversableViewLikeTraversableLike
  51. def dropWhile(p: (A) ⇒ Boolean): Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]

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

    definition classes: TraversableLike
  52. def elements: Iterator[A]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  53. def endsWith[B](that: Seq[B]): Boolean

    Tests whether this sequence ends with the given sequence .

    Tests whether this sequence ends with the given sequence .

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  54. def eq(arg0: AnyRef): Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other 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).

    arg0

    the object to compare against this object for reference equality .

    returns

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

    attributes: final
    definition classes: AnyRef
  55. def equals(that: Any): Boolean

    The equality method defined in AnyRef.

    The equality method defined in AnyRef[email protected] true if the receiver object is equivalent to the argument; false otherwise. */

    definition classes: SeqLikeEquals → AnyRef → Any
  56. def equalsWith[B](that: Seq[B])(f: (A, B) ⇒ Boolean): Boolean

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

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

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

  57. def exists(p: (A) ⇒ Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: IterableLikeTraversableLikeTraversableOnce
  58. def exists(p: (A) ⇒ Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: TraversableLikeTraversableOnce
  59. def filter(p: (A) ⇒ Boolean): This

    Selects all elements of this sequence which satisfy a predicate .

    Selects all elements of this sequence which satisfy a predicate .

    p

    the predicate used to test elements .

    returns

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

    definition classes: TraversableViewLikeTraversableLike
  60. def filter(p: (A) ⇒ Boolean): Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]

    Selects all elements of this sequence which satisfy a predicate .

    Selects all elements of this sequence which satisfy a predicate .

    p

    the predicate used to test elements .

    returns

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

    definition classes: TraversableLike
  61. def filterNot(p: (A) ⇒ Boolean): Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]

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

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

    p

    the predicate used to test elements .

    returns

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

    definition classes: TraversableLike
  62. def finalize(): Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object .

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object .

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

    attributes: protected
    definition classes: AnyRef
  63. def find(p: (A) ⇒ Boolean): Option[A]

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: IterableLikeTraversableLikeTraversableOnce
  64. def find(p: (A) ⇒ Boolean): Option[A]

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: TraversableLikeTraversableOnce
  65. def findIndexOf(p: (A) ⇒ 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
  66. def findLastIndexOf(p: (A) ⇒ 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
      deprecated:
    1. use lastIndexWhere instead

  67. def first: A

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  68. def firstOption: Option[A]

    None if iterable is empty.

    None if iterable is empty.

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  69. def flatMap[B](f: (A) ⇒ Traversable[B]): Seq[B]

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

    [use case]

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

    B

    the element type of the returned collection .

    f

    the function to apply to each element .

    returns

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

    attributes: abstract
  70. def flatMap[B, That](f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[This, B, That]): That

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

    Builds a new collection by applying a function to all elements of this 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 sequence and concatenating the results.

    definition classes: TraversableViewLikeTraversableLike
  71. def flatMap[B](f: (A) ⇒ Traversable[B]): Seq[B]

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

    [use case]

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

    B

    the element type of the returned collection .

    f

    the function to apply to each element .

    returns

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

    attributes: abstract
  72. def flatMap[B, That](f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Seq[A] with SeqView[A, Coll] with IterableView[A, Coll], B, That]): That

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

    Builds a new collection by applying a function to all elements of this 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 sequence and concatenating the results.

    definition classes: TraversableLike
  73. def flatten[B]: Seq[B]

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

    [use case]

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

    B

    the type of the elements of each traversable collection .

    returns

    a new sequence resulting from concatenating all element sequences .

    attributes: abstract
  74. def flatten[B](implicit asTraversable: (A) ⇒ Traversable[B]): Seq[B]

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

    Converts this sequence of traversable collections into a 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 sequence is a Traversable.

    returns

    a new sequence resulting from concatenating all element sequences .

    definition classes: GenericTraversableTemplate
  75. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    z

    the start value .

    op

    the binary operator .

    returns

    the result of inserting op between consecutive elements of this sequence, going left to right with the start value z on the left: op(...op(z, x1), x2, ..., xn) where x,,1,,, ..., x,,n,, are the elements of this sequence.

    definition classes: TraversableOnce
  76. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    z

    the start value .

    op

    the binary operator .

    returns

    the result of inserting op between consecutive elements of this sequence, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this sequence.

    definition classes: IterableLikeTraversableOnce
  77. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    z

    the start value .

    op

    the binary operator .

    returns

    the result of inserting op between consecutive elements of this sequence, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this sequence.

    definition classes: TraversableOnce
  78. def forall(p: (A) ⇒ Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: IterableLikeTraversableLikeTraversableOnce
  79. def forall(p: (A) ⇒ Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: TraversableLikeTraversableOnce
  80. def force[B >: A, That](implicit bf: CanBuildFrom[Coll, B, That]): That

    definition classes: TraversableViewLike
  81. def foreach(f: (A) ⇒ Unit): Unit

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

    [use case]

    Applies a function f to all elements of this sequence.

    f

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

    attributes: abstract
  82. def foreach[U](f: (A) ⇒ U): Unit

    Applies a function f to all elements of this sequence.

    Applies a function f to all elements of this sequence.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    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: IterableLikeTraversableLikeTraversableOnce
  83. def foreach(f: (A) ⇒ Unit): Unit

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

    [use case]

    Applies a function f to all elements of this sequence.

    f

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

    attributes: abstract
  84. def foreach[U](f: (A) ⇒ U): Unit

    Applies a function f to all elements of this sequence.

    Applies a function f to all elements of this 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.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  85. def genericBuilder[B]: Builder[B, Seq[B]]

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

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

    definition classes: GenericTraversableTemplate
  86. def getClass(): java.lang.Class[_ <: java.lang.Object]

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

    Returns 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
  87. def groupBy[K](f: (A) ⇒ K): Map[K, This]

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

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

    K

    the type of keys returned by the discriminator function .

    f

    the discriminator function .

    returns

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

    definition classes: TraversableViewLikeTraversableLike
  88. def groupBy[K](f: (A) ⇒ K): Map[K, Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]]

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

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

    K

    the type of keys returned by the discriminator function .

    f

    the discriminator function .

    returns

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

    definition classes: TraversableLike
  89. def grouped(size: Int): Iterator[This]

    Partitions elements in fixed size sequences .

    Partitions elements in fixed size sequences .

    size

    the number of elements per group

    returns

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

    definition classes: IterableViewLikeIterableLike
      see also:
    1. Iterator#grouped

  90. def hasDefiniteSize: Boolean

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

    Tests whether this 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: TraversableLikeTraversableOnce
  91. def hashCode(): Int

    Hashcodes for Seq produce a value from the hashcodes of all the elements of the sequence .

    Hashcodes for Seq produce a value from the hashcodes of all the elements of the sequence . @return the hash code value for the object. */

    definition classes: SeqLike → AnyRef → Any
  92. def head: A

    Selects the first element of this sequence .

    Selects the first element of this sequence .

    returns

    the first element of this sequence .

    definition classes: IterableLikeTraversableLike
  93. def headOption: Option[A]

    Optionally selects the first element .

    Optionally selects the first element .

    returns

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

    definition classes: TraversableLike
  94. def indexOf(elem: A, from: Int): Int

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

    [use case]

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

    attributes: abstract
  95. def indexOf[B >: A](elem: B, from: Int): Int

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

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

    Note: may not terminate for infinite-sized collections.

    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 sequence that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  96. def indexOf(elem: A): Int

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

    [use case]

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

    elem

    the element value to search for .

    returns

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

    attributes: abstract
  97. def indexOf[B >: A](elem: B): Int

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

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

    Note: may not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for .

    returns

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

    definition classes: SeqLike
  98. def indexOfSlice[B >: A](that: Seq[B], from: Int): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    from

    the start index

    returns

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

    definition classes: SeqLike
  99. def indexOfSlice[B >: A](that: Seq[B]): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  100. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    from

    the start index

    returns

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

    definition classes: SeqLike
  101. def indexWhere(p: (A) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate .

    Finds index of first element satisfying some predicate .

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: SeqLike
  102. 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 sequence.

    definition classes: SeqLike
  103. def init: This

    Selects all elements except the last .

    Selects all elements except the last .

    returns

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

    definition classes: TraversableViewLikeTraversableLike
  104. def intersect(that: Seq[A]): Seq[A]

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

    [use case]

    Computes the multiset intersection between this sequence and another sequence .

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with .

    returns

    a new sequence which contains all elements of this 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
  105. def intersect[B >: A](that: Seq[B]): This

    Computes the multiset intersection between this sequence and another sequence .

    Computes the multiset intersection between this sequence and another sequence .

    Note: may not terminate for infinite-sized collections.

    B

    the element type of the returned sequence .

    that

    the sequence of elements to intersect with .

    returns

    a new collection of type That which contains all elements of this 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
  106. def isDefinedAt(idx: Int): Boolean

    Tests whether this sequence contains given index .

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

    definition classes: SeqLike
  107. def isEmpty: Boolean

    Tests whether this sequence is empty .

    Tests whether this sequence is empty .

    returns

    true if the sequence contain no elements, false otherwise.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  108. def isInstanceOf[T0]: Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.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 requested typed.

    returns

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

    attributes: final
    definition classes: Any
  109. def isTraversableAgain: Boolean

    Tests whether this sequence can be repeatedly traversed .

    Tests whether this sequence can be repeatedly traversed .

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  110. def iterator: Iterator[A]

    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

    attributes: abstract
    definition classes: IterableLike
  111. def last: A

    Selects the last element .

    Selects the last element .

    returns

    the first element of this sequence .

    definition classes: TraversableLike
  112. def lastIndexOf(elem: A, end: Int): Int

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

    [use case]

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

    attributes: abstract
  113. def lastIndexOf[B >: A](elem: B, end: Int): Int

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

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

    definition classes: SeqLike
  114. def lastIndexOf(elem: A): Int

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

    [use case]

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

    elem

    the element value to search for .

    returns

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

    attributes: abstract
  115. def lastIndexOf[B >: A](elem: B): Int

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for .

    returns

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

    definition classes: SeqLike
  116. def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int

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

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

    definition classes: SeqLike
  117. def lastIndexOfSlice[B >: A](that: Seq[B]): Int

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

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

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  118. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int

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

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

    p

    the predicate used to test elements .

    returns

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

    definition classes: SeqLike
  119. def lastIndexWhere(p: (A) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate .

    Finds index of last element satisfying some predicate .

    Note: will not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: SeqLike
  120. def lastOption: Option[A]

    Optionally selects the last element .

    Optionally selects the last element .

    returns

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

    definition classes: TraversableLike
  121. def length: Int

    The length of the sequence .

    The length of the sequence .

    Note: will not terminate for infinite-sized collections.

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

    returns

    the number of elements in this sequence .

    attributes: abstract
    definition classes: SeqLike
  122. def lengthCompare(len: Int): Int

    Compares the length of this sequence to a test value .

    Compares the length of this 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: SeqLike
  123. def lift: (Int) ⇒ Option[A]

    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
  124. def map[B](f: (A) ⇒ B): Seq[B]

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

    [use case]

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

    B

    the element type of the returned collection .

    f

    the function to apply to each element .

    returns

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

    attributes: abstract
  125. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[This, B, That]): That

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

    Builds a new collection by applying a function to all elements of this 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 sequence and collecting the results.

    definition classes: TraversableViewLikeTraversableLike
  126. def map[B](f: (A) ⇒ B): Seq[B]

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

    [use case]

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

    B

    the element type of the returned collection .

    f

    the function to apply to each element .

    returns

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

    attributes: abstract
  127. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Seq[A] with SeqView[A, Coll] with IterableView[A, Coll], B, That]): That

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

    Builds a new collection by applying a function to all elements of this 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 sequence and collecting the results.

    definition classes: TraversableLike
  128. def max: A

    [use case] Finds the largest element .

    [use case]

    Finds the largest element .

    returns

    the largest element of this sequence .

    attributes: abstract
  129. def max[B >: A](implicit cmp: Ordering[B]): A

    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 sequence with respect to the ordering cmp.

    definition classes: TraversableOnce
  130. def min: A

    [use case] Finds the smallest element .

    [use case]

    Finds the smallest element .

    returns

    the smallest element of this sequence

    attributes: abstract
  131. def min[B >: A](implicit cmp: Ordering[B]): A

    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 sequence with respect to the ordering cmp.

    definition classes: TraversableOnce
  132. def mkString: String

    Displays all elements of this sequence in a string .

    Displays all elements of this sequence in a string .

    returns

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

    definition classes: TraversableOnce
  133. def mkString(sep: String): String

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

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

    sep

    the separator string .

    returns

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

    definition classes: TraversableOnce
  134. def mkString(start: String, sep: String, end: String): String

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

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

    start

    the starting string .

    sep

    the separator string .

    end

    the ending string .

    returns

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

    definition classes: TraversableOnce
  135. def ne(arg0: AnyRef): Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality .

    returns

    false if the argument is not a reference to the receiver object; true otherwise.

    attributes: final
    definition classes: AnyRef
  136. def newAppended[B >: A](that: Traversable[B]): Transformed[B]

    attributes: protected
    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  137. def newBuilder: Builder[A, This]

    The builder that builds instances of type Seq[A]

    The builder that builds instances of type Seq[A]

    attributes: protected[this]
  138. def newDroppedWhile(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: SeqViewLike
  139. def newDroppedWhile(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: IterableViewLikeTraversableViewLike
  140. def newDroppedWhile(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: TraversableViewLike
  141. def newFiltered(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: SeqViewLike
  142. def newFiltered(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: IterableViewLikeTraversableViewLike
  143. def newFiltered(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: TraversableViewLike
  144. def newFlatMapped[B](f: (A) ⇒ Traversable[B]): Transformed[B]

    attributes: protected
    definition classes: SeqViewLike
  145. def newFlatMapped[B](f: (A) ⇒ Traversable[B]): Transformed[B]

    attributes: protected
    definition classes: IterableViewLikeTraversableViewLike
  146. def newFlatMapped[B](f: (A) ⇒ Traversable[B]): Transformed[B]

    attributes: protected
    definition classes: TraversableViewLike
  147. def newForced[B](xs: ⇒ Seq[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
  148. def newMapped[B](f: (A) ⇒ B): Transformed[B]

    attributes: protected
    definition classes: SeqViewLike
  149. def newMapped[B](f: (A) ⇒ B): Transformed[B]

    attributes: protected
    definition classes: IterableViewLikeTraversableViewLike
  150. def newMapped[B](f: (A) ⇒ B): Transformed[B]

    attributes: protected
    definition classes: TraversableViewLike
  151. def newPatched[B >: A](_from: Int, _patch: Seq[B], _replaced: Int): Transformed[B]

    attributes: protected
    definition classes: SeqViewLike
  152. def newPrepended[B >: A](elem: B): Transformed[B]

    attributes: protected
    definition classes: SeqViewLike
  153. def newReversed: Transformed[A]

    attributes: protected
    definition classes: SeqViewLike
  154. def newSliced(_from: Int, _until: Int): Transformed[A]

    attributes: protected
    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  155. def newTakenWhile(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: SeqViewLike
  156. def newTakenWhile(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: IterableViewLikeTraversableViewLike
  157. def newTakenWhile(p: (A) ⇒ Boolean): Transformed[A]

    attributes: protected
    definition classes: TraversableViewLike
  158. def newZipped[B](that: Iterable[B]): Transformed[(A, B)]

    attributes: protected
    definition classes: SeqViewLikeIterableViewLike
  159. def newZippedAll[A1 >: A, B](that: Iterable[B], _thisElem: A1, _thatElem: B): Transformed[(A1, B)]

    attributes: protected
    definition classes: SeqViewLikeIterableViewLike
  160. def nonEmpty: Boolean

    Tests whether the sequence is not empty .

    Tests whether the sequence is not empty .

    returns

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

    definition classes: TraversableOnce
  161. 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
  162. 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
  163. def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined .

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined .

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

    a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.

    definition classes: PartialFunction
  164. def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[This, B, That]): That

    definition classes: SeqViewLike
  165. def padTo(len: Int, elem: A): Seq[A]

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

    [use case]

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

    len

    the target length

    elem

    the padding value

    returns

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

    attributes: abstract
  166. def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That

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

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

    B

    the element type of the returned 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 sequence followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    definition classes: SeqLike
  167. def partition(p: (A) ⇒ Boolean): (This, This)

    Partitions this sequence in two sequences according to a predicate .

    Partitions this sequence in two sequences according to a predicate .

    p

    the predicate on which to partition .

    returns

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

    definition classes: TraversableViewLikeTraversableLike
  168. def partition(p: (A) ⇒ Boolean): (Seq[A] with SeqView[A, Coll] with IterableView[A, Coll], Seq[A] with SeqView[A, Coll] with IterableView[A, Coll])

    Partitions this sequence in two sequences according to a predicate .

    Partitions this sequence in two sequences according to a predicate .

    p

    the predicate on which to partition .

    returns

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

    definition classes: TraversableLike
  169. def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[This, B, That]): That

    definition classes: SeqViewLike
  170. def patch(from: Int, that: Seq[A], replaced: Int): Seq[A]

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original sequence

    returns

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

    attributes: abstract
  171. def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Repr, B, That]): That

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

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

    B

    the element type of the returned 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 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 sequence consisting of all elements of this sequence except that replaced elements starting from from are replaced by patch.

    definition classes: SeqLike
  172. def prefixLength(p: (A) ⇒ Boolean): Int

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    returns

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

    definition classes: SeqLike
  173. def product: Int

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

    [use case]

    Multiplies up the elements of this collection .

    returns

    the product of all elements in this sequence of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the sequence and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
  174. def product[B >: A](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 sequence with respect to the * operator in num.

    definition classes: TraversableOnce
  175. def projection: SeqView[A, Repr]

    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
      deprecated:
    1. use view' instead

  176. def reduceLeft[B >: A](op: (B, A) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    op

    the binary operator .

    returns

    the result of inserting op between consecutive elements of this sequence, going left to right: op(...(op(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this sequence.

    definition classes: TraversableOnce
  177. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    op

    the binary operator .

    returns

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

    definition classes: TraversableOnce
  178. def reduceRight[B >: A](op: (A, B) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    op

    the binary operator .

    returns

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

    definition classes: IterableLikeTraversableOnce
  179. def reduceRight[B >: A](op: (A, B) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    op

    the binary operator .

    returns

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

    definition classes: TraversableOnce
  180. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator .

    op

    the binary operator .

    returns

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

    definition classes: TraversableOnce
  181. def repr: Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]

    The collection of type sequence underlying this TraversableLike object.

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

    definition classes: TraversableLike
  182. def reverse: This

    Returns new sequence wih elements in reversed order .

    Returns new sequence wih elements in reversed order .

    Note: will not terminate for infinite-sized collections.

    returns

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

    definition classes: SeqViewLikeSeqLike
  183. def reverseIterator: Iterator[A]

    An iterator yielding elements in reversed order .

    An iterator yielding elements in reversed order .

    Note: will not terminate for infinite-sized collections.

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

    returns

    an iterator yielding the elements of this sequence in reversed order

    definition classes: SeqLike
  184. def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[This, B, That]): That

    definition classes: SeqViewLike
  185. def reverseMap[B](f: (A) ⇒ B): Seq[B]

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

    [use case]

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

    B

    the element type of the returned collection .

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

    f

    the function to apply to each element .

    returns

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

    attributes: abstract
  186. def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That

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

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

    Note: will not terminate for infinite-sized collections.

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

    definition classes: SeqLike
  187. def reversed: List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  188. def reversedElements: Iterator[A]

    definition classes: SeqLike
      deprecated:
    1. use reverseIterator' instead

  189. def sameElements(that: Iterable[A]): Boolean

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

    [use case]

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

    that

    the collection to compare with .

    returns

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

    attributes: abstract
  190. def sameElements[B >: A](that: Iterable[B]): Boolean

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

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

    Note: will not terminate for infinite-sized collections.

    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: IterableLike
  191. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[This, 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 .

    Note: will not terminate for infinite-sized collections.

    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
  192. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Seq[A] with SeqView[A, Coll] with IterableView[A, 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 .

    Note: will not terminate for infinite-sized collections.

    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: TraversableLike
  193. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[This, 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 .

    Note: will not terminate for infinite-sized collections.

    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
  194. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Seq[A] with SeqView[A, Coll] with IterableView[A, 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 .

    Note: will not terminate for infinite-sized collections.

    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: TraversableLike
  195. def segmentLength(p: (A) ⇒ 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 .

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements .

    from

    the index where the search starts .

    returns

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

    definition classes: SeqLike
  196. def size: Int

    The size of this sequence, equivalent to length.

    The size of this sequence, equivalent to length.

    Note: will not terminate for infinite-sized [email protected] the number of elements in this sequence.

    definition classes: SeqLikeTraversableOnce
  197. def slice(from: Int, until: Int): This

    Selects an interval of elements .

    Selects an interval of elements .

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    from

    the index of the first returned element in this sequence .

    until

    the index one past the last returned element in this sequence .

    returns

    a sequence containing the elements starting at index from and extending up to (but not including) index until of this sequence.

    definition classes: TraversableViewLikeTraversableLike
  198. def sliding[B >: A](size: Int, step: Int): Iterator[This]

    definition classes: IterableViewLikeIterableLike
  199. def sliding[B >: A](size: Int): Iterator[Repr]

    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 sequences of size size, except the last will be truncated if the elements don't divide evenly.

    definition classes: IterableLike
      see also:
    1. Iterator#sliding

  200. def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): Repr

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

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

    definition classes: SeqLike
      see also:
    1. scala . math.Ordering

      Note: will not terminate for infinite-sized collections.

  201. def sortWith(lt: (A, A) ⇒ Boolean): Repr

    Sorts this sequence according to a comparison function .

    Sorts this sequence according to a comparison function .

    Note: will not terminate for infinite-sized collections.

    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 sequence consisting of the elements of this sequence sorted according to the comparison function lt.

    definition classes: SeqLike
  202. def sorted[B >: A](implicit ord: Ordering[B]): This

    Sorts this sequence according to an Ordering .

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

    definition classes: SeqViewLikeSeqLike
      see also:
    1. scala . math.Ordering

  203. def span(p: (A) ⇒ Boolean): (This, This)

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

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

    definition classes: TraversableViewLikeTraversableLike
  204. def span(p: (A) ⇒ Boolean): (Seq[A] with SeqView[A, Coll] with IterableView[A, Coll], Seq[A] with SeqView[A, Coll] with IterableView[A, Coll])

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

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

    definition classes: TraversableLike
  205. def splitAt(n: Int): (This, This)

    Splits this sequence into two at a given position .

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

    definition classes: TraversableViewLikeTraversableLike
  206. def startsWith[B](that: Seq[B]): Boolean

    Tests whether this sequence starts with the given sequence .

    Tests whether this 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: SeqLike
  207. def startsWith[B](that: Seq[B], offset: Int): Boolean

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

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

    definition classes: SeqLike
  208. 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 sequence. By default the string prefix is the simple name of the collection class sequence.

  209. def sum: Int

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

    [use case]

    Sums up the elements of this collection .

    returns

    the sum of all elements in this sequence of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the sequence and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
  210. def sum[B >: A](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 sequence with respect to the + operator in num.

    definition classes: TraversableOnce
  211. def synchronized[T0](arg0: T0): T0

    attributes: final
    definition classes: AnyRef
  212. def tail: Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]

    Selects all elements except the first .

    Selects all elements except the first .

    returns

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

    definition classes: TraversableLike
  213. def take(n: Int): This

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this sequence .

    returns

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

    definition classes: TraversableViewLikeTraversableLike
  214. def takeRight(n: Int): Repr

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

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

    definition classes: IterableLike
  215. def takeWhile(p: (A) ⇒ 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 sequence whose elements all satisfy the predicate p.

    definition classes: TraversableViewLikeTraversableLike
  216. def takeWhile(p: (A) ⇒ Boolean): Repr

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

    definition classes: IterableLikeTraversableLike
  217. def takeWhile(p: (A) ⇒ Boolean): Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]

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

    definition classes: TraversableLike
  218. def thisCollection: Seq[A]

    The underlying collection seen as an instance of Seq.

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

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  219. def thisSeq: Seq[A]

    attributes: protected[this]
    definition classes: TraversableViewLike
  220. def toArray: Array[A]

    [use case] Converts this sequence to an array .

    [use case]

    Converts this sequence to an array .

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this sequence. A ClassManifest must be available for the element type of this sequence.

    attributes: abstract
  221. def toArray[B >: A](implicit arg0: ClassManifest[B]): Array[B]

    Converts this sequence to an array .

    Converts this sequence to an array .

    Note: will not terminate for infinite-sized collections.

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

    definition classes: TraversableOnce
  222. def toCollection(repr: Repr): Seq[A]

    A conversion from collections of type Repr to Seq objects.

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

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  223. def toCollection(repr: Repr): Iterable[A]

    A conversion from collections of type Repr to Seq objects.

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

    attributes: protected[this]
    definition classes: IterableLikeTraversableLike
  224. def toCollection(repr: Seq[A] with SeqView[A, Coll] with IterableView[A, Coll]): Traversable[A]

    A conversion from collections of type Repr to Seq objects.

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

    attributes: protected[this]
    definition classes: TraversableLike
  225. def toIndexedSeq[B >: A]: IndexedSeq[B]

    Converts this sequence to an indexed sequence .

    Converts this sequence to an indexed sequence .

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this sequence .

    definition classes: TraversableOnce
  226. def toIterable: Iterable[A]

    Converts this sequence to an iterable collection .

    Converts this sequence to an iterable collection .

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterable containing all elements of this sequence.

    definition classes: IterableLikeTraversableOnce
  227. def toIterator: Iterator[A]

    Returns an Iterator over the elements in this sequence .

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

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterator containing all elements of this sequence .

    definition classes: TraversableLikeTraversableOnce
  228. def toList: List[A]

    Converts this sequence to a list .

    Converts this sequence to a list .

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this sequence .

    definition classes: TraversableOnce
  229. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

    Converts this sequence to a map .

    Converts this sequence to a map . This method is unavailable unless the elements are members of Tuple2, each ((K, V)) 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.

    Note: will not terminate for infinite-sized collections.

    returns

    a map containing all elements of this sequence .

    definition classes: TraversableOnce
  230. def toSeq: Seq[A]

    Converts this sequence to a sequence .

    Converts this sequence to a sequence .

    Note: will not terminate for infinite-sized collections.

    Overridden for [email protected] a sequence containing all elements of this sequence.

    definition classes: SeqLikeTraversableOnce
  231. def toSet[B >: A]: Set[B]

    Converts this sequence to a set .

    Converts this sequence to a set .

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this sequence .

    definition classes: TraversableOnce
  232. def toStream: Stream[A]

    Converts this sequence to a stream .

    Converts this sequence to a stream .

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this sequence .

    definition classes: IterableLikeTraversableOnce
  233. def toString(): String

    Converts this sequence to a string .

    Converts this sequence to a string .

    returns

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

    definition classes: SeqLikeTraversableLike → AnyRef → Any
  234. def toTraversable: Traversable[A]

    Converts this sequence to an unspecified Traversable .

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

    Note: will not terminate for infinite-sized collections.

    returns

    a Traversable containing all elements of this sequence .

    definition classes: TraversableLikeTraversableOnce
  235. def transpose[B](implicit asTraversable: (A) ⇒ Traversable[B]): Seq[Seq[B]]

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

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

    B

    the type of the elements of each traversable collection .

    asTraversable

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

    returns

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

    definition classes: GenericTraversableTemplate
  236. def underlying: Coll

    attributes: protected abstract
    definition classes: TraversableViewLike
  237. def union[B >: A, That](that: Seq[B])(implicit bf: CanBuildFrom[This, B, That]): That

    definition classes: SeqViewLike
  238. def union(that: Seq[A]): Seq[A]

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

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to add .

    returns

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

    attributes: abstract
  239. def union[B >: A, That](that: Seq[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

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

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

    Note: will not terminate for infinite-sized collections.

    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.

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned 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 sequence followed by all elements of that.

    definition classes: SeqLike
  240. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Seq[A1], Seq[A2])

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

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

    asPair

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

    returns

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

    definition classes: GenericTraversableTemplate
  241. def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[This, B, That]): That

    definition classes: SeqViewLike
  242. def updated(index: Int, elem: A): Seq[A]

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

    [use case]

    A copy of this sequence with one single replaced element .

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this sequence with the element at position index replaced by elem.

    attributes: abstract
  243. def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    A copy of this sequence with one single replaced element .

    A copy of this sequence with one single replaced element .

    B

    the element type of the returned 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 sequence which is a copy of this sequence with the element at position index replaced by elem.

    definition classes: SeqLike
  244. def view(from: Int, until: Int): SeqView[A, Repr]

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

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

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

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

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

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

    definition classes: SeqLikeIterableLikeTraversableLike
  245. def view: SeqView[A, Repr]

    Creates a non-strict view of this sequence .

    Creates a non-strict view of this sequence .

    returns

    a non-strict view of this sequence .

    definition classes: SeqLikeIterableLikeTraversableLike
  246. def wait(): Unit

    attributes: final
    definition classes: AnyRef
  247. def wait(arg0: Long, arg1: Int): Unit

    attributes: final
    definition classes: AnyRef
  248. def wait(arg0: Long): Unit

    attributes: final
    definition classes: AnyRef
  249. def withFilter(p: (A) ⇒ Boolean): WithFilter

    Creates a non-strict filter of this sequence .

    Creates a non-strict filter of this 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 sequence which satisfy the predicate p.

    definition classes: TraversableLike
  250. def zip[B](that: Iterable[B]): Seq[(A, B)]

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

    [use case]

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

    attributes: abstract
  251. def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[This, (A1, B), That]): That

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

    Returns a sequence formed from this 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 sequence and that. The length of the returned collection is the minimum of the lengths of this sequence and that.

    definition classes: IterableViewLikeIterableLike
  252. def zip[B](that: Iterable[B]): Seq[(A, B)]

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

    [use case]

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

    attributes: abstract
  253. def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That

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

    Returns a sequence formed from this 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 sequence and that. The length of the returned collection is the minimum of the lengths of this sequence and that.

    definition classes: IterableLike
  254. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): Seq[(A, B)]

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

    [use case]

    Returns a sequence formed from this 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.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    attributes: abstract
  255. def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[This, (A1, B), That]): That

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

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

    thatElem

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

    returns

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

    definition classes: IterableViewLikeIterableLike
  256. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): Seq[(A, B)]

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

    [use case]

    Returns a sequence formed from this 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.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    attributes: abstract
  257. def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That

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

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

    thatElem

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

    returns

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

    definition classes: IterableLike
  258. def zipWithIndex: Seq[(A, Int)]

    [use case] Zips this sequence with its indices .

    [use case]

    Zips this sequence with its indices .

    returns

    A new sequence containing pairs consisting of all elements of this sequence paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
  259. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[This, (A1, Int), That]): That

    Zips this sequence with its indices .

    Zips this 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 sequence paired with their index. Indices start at 0.

    definition classes: IterableViewLikeIterableLike
  260. def zipWithIndex: Seq[(A, Int)]

    [use case] Zips this sequence with its indices .

    [use case]

    Zips this sequence with its indices .

    returns

    A new sequence containing pairs consisting of all elements of this sequence paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
  261. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Repr, (A1, Int), That]): That

    Zips this sequence with its indices .

    Zips this 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 sequence paired with their index. Indices start at 0.

    definition classes: IterableLike