scala.collection.SeqView

Appended

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

definition classes: SeqViewLikeIterableViewLikeTraversableViewLike

Inherits

  1. Appended
  2. Appended
  3. Transformed
  4. Transformed
  5. Transformed
  6. SeqView
  7. SeqViewLike
  8. IterableView
  9. IterableViewLike
  10. TraversableView
  11. TraversableViewLike
  12. Seq
  13. SeqLike
  14. Iterable
  15. IterableLike
  16. Equals
  17. Traversable
  18. GenericTraversableTemplate
  19. TraversableLike
  20. HasNewBuilder
  21. PartialFunction
  22. Function1
  23. AnyRef
  24. Any

Type Members

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

  2. trait DroppedWhile extends Transformed[A] with DroppedWhile

  3. trait Filtered extends Transformed[A] with Filtered

  4. trait FlatMapped[B] extends Transformed[B] with FlatMapped[B]

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

  6. trait Patched[B >: A] extends Transformed[B]

  7. trait Reversed extends Transformed[A]

  8. trait Sliced extends Transformed[A] with Sliced

    pre: from >= 0

  9. trait TakenWhile extends Transformed[A] with TakenWhile

  10. trait Transformed[+B] extends SeqView[B, Coll] with Transformed[B]

  11. class WithFilter extends AnyRef

    A class supporting filtered operations

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

  13. trait ZippedAll[A1 >: A, B] extends Transformed[(A1, B)] with ZippedAll[A1, B]

Value Members

  1. def ++(that: Iterator[B]): Seq[B]

    [use case] Concatenates this sequence with the elements of an iterator

    [use case]

    Concatenates this sequence with the elements of an iterator.

    that

    the iterator to append.

    returns

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

    attributes: abstract
  2. def ++[B >: B, That](that: Iterator[B])(bf: CanBuildFrom[SeqView[B, Coll], B, That]): That

    Concatenates this sequence with the elements of an iterator

    Concatenates this sequence with the elements of an iterator.

    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 iterator 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: TraversableViewLikeTraversableLike
  3. def ++(that: Traversable[B]): Seq[B]

    [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
  4. def ++[B >: B, That](that: Traversable[B])(bf: CanBuildFrom[SeqView[B, 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: TraversableViewLikeTraversableLike
  5. def +:(elem: B): Seq[B]

    [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
  6. def +:[B >: B, That](elem: B)(bf: CanBuildFrom[SeqView[B, Coll], 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
  7. def /:[B](z: B)(op: (B, B) ⇒ 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: TraversableLike
  8. def :+(elem: B): Seq[B]

    [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
  9. def :+[B >: B, That](elem: B)(bf: CanBuildFrom[SeqView[B, Coll], 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
  10. def :\[B](z: B)(op: (B, 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: TraversableLike
  11. 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: TraversableLike
  12. 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: TraversableLike
  13. 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: TraversableLike
  14. def andThen[C](k: (B) ⇒ C): PartialFunction[Int, C]

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

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

    definition classes: PartialFunctionFunction1
  15. def apply(idx: Int): B

    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.

  16. 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
  17. 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
  18. def compose[A](g: (A) ⇒ Int): (A) ⇒ B

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

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

    definition classes: Function1
  19. 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
  20. 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
  21. def copyToArray(xs: Array[B], 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
  22. def copyToArray[B >: B](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: IterableLikeTraversableLike
  23. def copyToArray(xs: Array[B], start: 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 all elements of this sequence, starting at position 0. 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
  24. def copyToArray[B >: B](xs: Array[B]): Unit

    Copies elements of this sequence to an array

    Copies elements of this sequence to an array. Fills the given array xs with all elements of this sequence, starting at position 0. 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: TraversableLike
  25. def copyToArray(xs: Array[B], start: 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 all 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.

    xs

    the array to fill.

    start

    the starting index.

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

    Copies elements of this sequence to an array

    Copies elements of this sequence to an array. Fills the given array xs with all 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.

    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: TraversableLike
  27. def copyToBuffer[B >: B](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: TraversableLike
  28. def corresponds[B](that: Seq[B])(p: (B, 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
  29. def count(p: (B) ⇒ 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: TraversableLike
  30. def diff[B >: B, That](that: Seq[B]): SeqView[B, Coll]

    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 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 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: SeqLike
  31. def drop(n: Int): SeqView[B, Coll]

    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
  32. def dropRight(n: Int): SeqView[B, Coll]

    Selects all elements except first n ones

    Selects all elements except first 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
  33. def dropWhile(p: (B) ⇒ Boolean): SeqView[B, 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: TraversableViewLikeTraversableLike
  34. def elements: Iterator[B]

  35. 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
  36. def equals(that: Any): Boolean

    The equality method defined in AnyRef

    The equality method defined in AnyRef.

    definition classes: SeqLikeEquals ⇐ AnyRef ⇐ Any
  37. def equalsWith[B](that: Seq[B])(f: (B, 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
  38. def exists(p: (B) ⇒ 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: IterableLikeTraversableLike
  39. def filter(p: (B) ⇒ Boolean): SeqView[B, 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: TraversableViewLikeTraversableLike
  40. def filterNot(p: (B) ⇒ Boolean): SeqView[B, 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
  41. def find(p: (B) ⇒ Boolean): Option[B]

    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: IterableLikeTraversableLike
  42. def findIndexOf(p: (B) ⇒ Boolean): Int

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

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

    definition classes: SeqLike
  43. def findLastIndexOf(p: (B) ⇒ Boolean): Int

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

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

    definition classes: SeqLike
  44. def first: B

  45. def firstOption: Option[B]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
  46. def flatMap[B](f: (B) ⇒ 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
  47. def flatMap[B, That](f: (B) ⇒ Traversable[B])(bf: CanBuildFrom[SeqView[B, 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: TraversableViewLikeTraversableLike
  48. 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
  49. def flatten[B](asTraversable: (B) ⇒ 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
  50. def foldLeft[B](z: B)(op: (B, B) ⇒ 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: TraversableLike
  51. def foldRight[B](z: B)(op: (B, 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: IterableLikeTraversableLike
  52. def forall(p: (B) ⇒ 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: IterableLikeTraversableLike
  53. def force[B >: B, That](bf: CanBuildFrom[Coll, B, That]): That

  54. def foreach(f: (B) ⇒ 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
  55. def foreach[C](f: (B) ⇒ C): Unit

    Applies a function f to all elements of this sequence

    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.

  56. 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
  57. def groupBy[K](f: (B) ⇒ K): Map[K, SeqView[B, 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
  58. def grouped(size: Int): Iterator[SeqView[B, Coll]]

    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: IterableLike
  59. 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.

    definition classes: TraversableLike
  60. 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.

    definition classes: SeqLike ⇐ AnyRef ⇐ Any
  61. def head: B

    Selects the first element of this sequence

    Selects the first element of this sequence.

    definition classes: IterableLikeTraversableLike
  62. def headOption: Option[B]

    Optionally selects the first element

    Optionally selects the first element.

    definition classes: TraversableLike
  63. def indexOf(elem: B): 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.

    returns

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

    attributes: abstract
  64. def indexOf[B >: B](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
  65. def indexOf(elem: B): 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
  66. def indexOf[B >: B](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
  67. def indexOfSlice[B >: B](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
  68. def indexOfSlice[B >: B](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
  69. def indexWhere(p: (B) ⇒ Boolean, from: Int): Int

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

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

    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
  70. def indexWhere(p: (B) ⇒ 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
  71. def indices: Range

    Produces the range of all indices of this sequence

    Produces the range of all indices of this sequence.

    definition classes: SeqLike
  72. def init: SeqView[B, Coll]

    Selects all elements except the last

    Selects all elements except the last.

    definition classes: TraversableViewLikeTraversableLike
  73. def intersect[B >: B, That](that: Seq[B]): SeqView[B, Coll]

    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 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 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: SeqLike
  74. 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
  75. def isEmpty: Boolean

    Tests whether this sequence is empty

    Tests whether this sequence is empty.

    definition classes: IterableLikeTraversableLike
  76. def iterator: Iterator[B]

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

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

    definition classes: AppendedIterableLike
  77. def last: B

    Selects the last element

    Selects the last element.

    definition classes: TraversableLike
  78. def lastIndexOf(elem: B): 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.

    returns

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

    attributes: abstract
  79. def lastIndexOf[B >: B](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
  80. def lastIndexOf(elem: B): 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
  81. def lastIndexOf[B >: B](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
  82. def lastIndexOfSlice[B >: B](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 idnex

    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
  83. def lastIndexOfSlice[B >: B](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
  84. def lastIndexWhere(p: (B) ⇒ Boolean, end: Int): Int

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: SeqLike
  85. def lastIndexWhere(p: (B) ⇒ 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
  86. def lastOption: Option[B]

    Optionally selects the last element

    Optionally selects the last element.

    definition classes: TraversableLike
  87. 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.

  88. 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
  89. def lift: (Int) ⇒ Option[B]

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

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

    definition classes: PartialFunction
  90. def map[B](f: (B) ⇒ 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
  91. def map[B, That](f: (B) ⇒ B)(bf: CanBuildFrom[SeqView[B, 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: TraversableViewLikeTraversableLike
  92. def max[B >: B](cmp: Ordering[B]): B

    Finds the largest element

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

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

    definition classes: TraversableLike
  93. def min: B

    [use case] Finds the largest element

    [use case]

    Finds the largest element.

    attributes: abstract
  94. def min: B

    [use case] Finds the smallest element

    [use case]

    Finds the smallest element.

    attributes: abstract
  95. def min[B >: B](cmp: Ordering[B]): B

    Finds the smallest element

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

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

    definition classes: TraversableLike
  96. def mkString: String

    Displays all elements of this sequence in a string

    Displays all elements of this sequence in a string.

    definition classes: TraversableLike
  97. 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: TraversableLike
  98. 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: TraversableLike
  99. def nonEmpty: Boolean

    Tests whether the sequence is not empty

    Tests whether the sequence is not empty.

    definition classes: TraversableLike
  100. def orElse[A1 <: Int, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

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

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

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

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

    definition classes: PartialFunction
  101. def padTo(len: Int, elem: B): Seq[B]

    [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
  102. def padTo[B >: B, That](len: Int, elem: B)(bf: CanBuildFrom[SeqView[B, Coll], 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: SeqViewLikeSeqLike
  103. def partialMap[B](pf: PartialFunction[B, 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
  104. def partialMap[B, That](pf: PartialFunction[B, B])(bf: CanBuildFrom[SeqView[B, 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
  105. def partition(p: (B) ⇒ Boolean): (SeqView[B, Coll], SeqView[B, 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
  106. def patch(from: Int, that: Seq[B], replaced: Int): Seq[B]

    [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
  107. def patch[B >: B, That](from: Int, patch: Seq[B], replaced: Int)(bf: CanBuildFrom[SeqView[B, Coll], 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 collection of type That consisting of all elements of this sequence except that replaced elements starting from from are replaced by patch.

    definition classes: SeqViewLikeSeqLike
  108. def prefixLength(p: (B) ⇒ Boolean): Int

    Returns the length of the longest prefix whose elements all satisfy some preficate

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

    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
  109. def product: Int

    [use case] Multiplies up the elements of this collection

    [use case]

    Multiplies up the elements of this collection.

    attributes: abstract
  110. def product[B >: B](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: TraversableLike
  111. def projection: SeqView[B, SeqView[B, Coll]]

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

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

    definition classes: SeqLikeIterableLike
  112. def reduceLeft[B >: B](op: (B, B) ⇒ 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: TraversableLike
  113. def reduceLeftOption[B >: B](op: (B, B) ⇒ 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: TraversableLike
  114. def reduceRight[B >: B](op: (B, 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: IterableLikeTraversableLike
  115. def reduceRightOption[B >: B](op: (B, 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: TraversableLike
  116. def removeDuplicates: SeqView[B, Coll]

    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.

    definition classes: SeqLike
  117. def repr: SeqView[B, 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
  118. def reverse: SeqView[B, Coll]

    Returns new sequence wih elements in reversed order

    Returns new sequence wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    definition classes: SeqViewLikeSeqLike
  119. def reverseIterator: Iterator[B]

    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.

    definition classes: SeqLike
  120. def reverseMap[B](f: (B) ⇒ 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
  121. def reverseMap[B, That](f: (B) ⇒ B)(bf: CanBuildFrom[SeqView[B, Coll], 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: SeqViewLikeSeqLike
  122. def reversedElements: Iterator[B]

  123. def sameElements(that: Iterable[B]): 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
  124. def sameElements[B >: B](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
  125. def segmentLength(p: (B) ⇒ Boolean, from: Int): Int

    Computes length of longest segment whose elements all satisfy some preficate

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

    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
  126. 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 collections.

    definition classes: SeqLikeTraversableLike
  127. def slice(from: Int, until: Int): SeqView[B, Coll]

    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
  128. def sliding[B >: B](size: Int, step: Int): Iterator[SeqView[B, Coll]]

  129. def sliding[B >: B](size: Int): Iterator[SeqView[B, Coll]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    returns

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

    definition classes: IterableLike
  130. def sortBy[B](f: (B) ⇒ B)(ord: Ordering[B]): SeqView[B, Coll]

    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
  131. def sortWith[B >: B](ord: Ordering[B]): SeqView[B, Coll]

    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: SeqLike
  132. def sortWith(lt: (B, B) ⇒ Boolean): SeqView[B, Coll]

    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
  133. def span(p: (B) ⇒ Boolean): (SeqView[B, Coll], SeqView[B, Coll])

    Spits this sequence into a prefix/suffix pair according to a predicate

    Spits 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
  134. def splitAt(n: Int): (SeqView[B, Coll], SeqView[B, Coll])

    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
  135. 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. otherwise false

    definition classes: SeqLike
  136. 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
  137. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: AppendedTraversableViewLikeTraversableLike
  138. def sum: Int

    [use case] Sums up the elements of this collection

    [use case]

    Sums up the elements of this collection.

    attributes: abstract
  139. def sum[B >: B](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: TraversableLike
  140. def tail: SeqView[B, Coll]

    Selects all elements except the first

    Selects all elements except the first.

    definition classes: TraversableLike
  141. def take(n: Int): SeqView[B, Coll]

    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
  142. def takeRight(n: Int): SeqView[B, Coll]

    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
  143. def takeWhile(p: (B) ⇒ Boolean): SeqView[B, 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: TraversableViewLikeTraversableLike
  144. def toArray: Array[B]

    [use case] Converts this sequence to an array

    [use case]

    Converts this sequence to an array.

    Note: will not terminate for infinite-sized collections.

    attributes: abstract
  145. def toArray[B >: B](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: TraversableLike
  146. def toIndexedSeq[B >: B]: IndexedSeq[B]

    Converts this sequence to an indexed sequence

    Converts this sequence to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  147. def toIterable: Iterable[B]

    Converts this sequence to an iterable collection

    Converts this sequence to an iterable collection.

    Note: will not terminate for infinite-sized collections.

    definition classes: IterableLikeTraversableLike
  148. def toList: List[B]

    Converts this sequence to a list

    Converts this sequence to a list.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  149. def toMap[T, U](ev: <:<[B, (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.

    definition classes: TraversableLike
  150. def toSeq: Seq[B]

    Converts this sequence to a sequence

    Converts this sequence to a sequence.

    Note: will not terminate for infinite-sized collections.

    Overridden for efficiency.

    definition classes: SeqLikeTraversableLike
  151. def toSet[B >: B]: Set[B]

    Converts this sequence to a set

    Converts this sequence to a set.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  152. def toStream: Stream[B]

    Converts this sequence to a stream

    Converts this sequence to a stream.

    Note: will not terminate for infinite-sized collections.

    definition classes: IterableLikeTraversableLike
  153. def toString(): String

    Converts this sequence to a string

    Converts this sequence to a string

    definition classes: SeqLikeTraversableLike ⇐ AnyRef ⇐ Any
  154. def transpose[B](asTraversable: (B) ⇒ Traversable[B]): Seq[Seq[B]]

    Transposes this sequence of traversable collections into

    Transposes this sequence of traversable collections into

    definition classes: GenericTraversableTemplate
  155. var underlying: Coll

  156. def union(that: Seq[B]): Seq[B]

    [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
  157. def union(that: Seq[B]): Seq[B]

    [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
  158. def union(that: Seq[B]): Seq[B]

    [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
  159. def union[B >: B, That](that: Seq[B])(bf: CanBuildFrom[SeqView[B, Coll], 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-oart 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
  160. def unzip[A1, A2](asPair: (B) ⇒ (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
  161. def updated(index: Int, elem: B): Seq[B]

    [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
  162. def updated[B >: B, That](index: Int, elem: B)(bf: CanBuildFrom[SeqView[B, Coll], 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 collection of type That which is a copy of this sequence with the element at position index replaced by elem.

    definition classes: SeqLike
  163. def view(from: Int, until: Int): SeqView[B, SeqView[B, Coll]]

    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
  164. def view: SeqView[B, SeqView[B, Coll]]

    Creates a non-strict view of this sequence

    Creates a non-strict view of this sequence.

    definition classes: SeqLikeIterableLikeTraversableLike
  165. def withFilter(p: (B) ⇒ 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 satify the predicate p.

    definition classes: TraversableLike
  166. def zip[B](that: Iterable[B]): Seq[(B, 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
  167. def zip[A1 >: B, B, That](that: Iterable[B])(bf: CanBuildFrom[SeqView[B, Coll], (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
  168. def zipAll[B](that: Iterable[B], thisElem: B, thatElem: B): Seq[(B, 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
  169. def zipAll[B, A1 >: B, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[SeqView[B, Coll], (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
  170. def zipWithIndex: Seq[(B, Int)]

    [use case] Zips this sequence with its indices

    [use case]

    Zips this sequence with its indices.

    attributes: abstract
  171. def zipWithIndex[A1 >: B, That](bf: CanBuildFrom[SeqView[B, Coll], (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