scala.collection

IndexedSeqLike

trait IndexedSeqLike[+A, +Repr] extends SeqLike[A, Repr]

A template trait for indexed sequences of type IndexedSeq[A].

$indexedSeqInfo

known subclasses: StringLike, IndexedSeq, IndexedSeq, IndexedSeqLike, IndexedSeqViewLike

Inherits

  1. SeqLike
  2. IterableLike
  3. TraversableLike
  4. HasNewBuilder
  5. Equals
  6. AnyRef
  7. Any

Type Members

  1. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def ++[B >: A, That](that: Iterator[B])(bf: CanBuildFrom[Repr, 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: TraversableLike
  2. def ++[B >: A, That](that: Traversable[B])(bf: CanBuildFrom[Repr, 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
  3. def +:[B >: A, That](elem: B)(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
  4. 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.

    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
  5. def :+[B >: A, That](elem: B)(bf: CanBuildFrom[Repr, B, That]): That

    Appends an element to this sequence

    Appends 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 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
  6. 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.

    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
  7. 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
  8. 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
  9. 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
  10. 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
  11. 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
  12. 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.

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

    that

    the sequence to test

    returns

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

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

    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.

  15. def copyToArray[B >: A](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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableLike
  16. def copyToArray[B >: A](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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

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

    dest

    The buffer to which elements are copied.

    definition classes: TraversableLike
  18. 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
  19. 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: TraversableLike
  20. def diff[B >: A, That](that: Seq[B]): Repr

    Computes the multiset difference between this sequence and another sequence

    Computes the multiset difference between this sequence and 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.

    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
  21. def drop(n: Int): Repr

    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.

  22. def dropRight(n: Int): Repr

    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.

  23. def dropWhile(p: (A) ⇒ Boolean): Repr

    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.

  24. def elements: Iterator[A]

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

    that

    the sequence to test

    returns

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

  26. def equals(that: Any): Boolean

    The equality method defined in AnyRef

    The equality method defined in AnyRef.

    definition classes: SeqLikeEquals ⇐ AnyRef ⇐ Any
  27. 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
  28. 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.

    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.

  29. def filter(p: (A) ⇒ Boolean): Repr

    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
  30. def filterNot(p: (A) ⇒ Boolean): Repr

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

    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.

  32. def findIndexOf(p: (A) ⇒ 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
  33. def findLastIndexOf(p: (A) ⇒ 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
  34. def first: A

  35. def firstOption: Option[A]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
  36. def flatMap[B, That](f: (A) ⇒ Traversable[B])(bf: CanBuildFrom[Repr, 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
  37. 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.

    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.

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

    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.

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

    p

    the predicate used to test elements.

    returns

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

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

  41. def groupBy[K](f: (A) ⇒ K): Map[K, Repr]

    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
  42. 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
  43. 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
  44. def head: A

    Selects the first element of this sequence

    Selects the first element of this sequence.

  45. def headOption: Option[A]

    Optionally selects the first element

    Optionally selects the first element.

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

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

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

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

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

    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.

  51. def indexWhere(p: (A) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate

    Finds index of first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

    definition classes: SeqLike
  52. def indices: Range

    Produces the range of all indices of this sequence

    Produces the range of all indices of this sequence.

    definition classes: SeqLike
  53. def init: Repr

    Selects all elements except the last

    Selects all elements except the last.

  54. def intersect[B >: A, That](that: Seq[B]): Repr

    Computes the multiset intersection between this sequence and another sequence

    Computes the multiset intersection between this sequence and 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.

    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
  55. 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
  56. def isEmpty: Boolean

    Tests whether this sequence is empty

    Tests whether this sequence is empty.

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

  58. def last: A

    Selects the last element

    Selects the last element.

  59. 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
  60. 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.

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

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

  64. def lastIndexWhere(p: (A) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate

    Finds index of last element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

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

    Optionally selects the last element

    Optionally selects the last element.

    definition classes: TraversableLike
  66. def length: Int

    The length of the sequence

    The length of the sequence.

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

    attributes: abstract
    definition classes: SeqLike
  67. 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.

  68. def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[Repr, 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
  69. def max[B >: A](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: TraversableLike
  70. def min[B >: A](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: TraversableLike
  71. def mkString: String

    Displays all elements of this sequence in a string

    Displays all elements of this sequence in a string.

    definition classes: TraversableLike
  72. 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
  73. 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
  74. def nonEmpty: Boolean

    Tests whether the sequence is not empty

    Tests whether the sequence is not empty.

    definition classes: TraversableLike
  75. def padTo[B >: A, That](len: Int, elem: B)(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
  76. def partialMap[B, That](pf: PartialFunction[A, B])(bf: CanBuildFrom[Repr, 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
  77. def partition(p: (A) ⇒ Boolean): (Repr, Repr)

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

    definition classes: SeqLike
  79. def prefixLength(p: (A) ⇒ 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.

    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
  80. def product[B >: A](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
  81. 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
  82. 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.

    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.

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

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

    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.

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

    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
  86. def removeDuplicates: Repr

    Builds a new sequence from this sequence without any duplicate elements

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

    definition classes: SeqLike
  87. def repr: Repr

    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
  88. def reverse: Repr

    Returns new sequence wih elements in reversed order

    Returns new sequence wih elements in reversed order.

  89. def reverseIterator: Iterator[A]

    An iterator yielding elements in reversed order

    An iterator yielding elements in reversed order.

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

  90. def reverseMap[B, That](f: (A) ⇒ B)(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: 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
  91. def reversedElements: Iterator[A]

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

    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.

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

    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.

  94. def size: Int

    The size of this sequence, equivalent to length

    The size of this sequence, equivalent to length.

    definition classes: SeqLikeTraversableLike
  95. def slice(from: Int, until: Int): Repr

    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.

  96. def sortBy[B](f: (A) ⇒ B)(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
  97. def sortWith[B >: A](ord: Ordering[B]): Repr

    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
  98. def sortWith(lt: (A, A) ⇒ Boolean): Repr

    Sorts this sequence according to a comparison function

    Sorts this sequence according to a comparison function.

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

    lt

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

    returns

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

    definition classes: SeqLike
  99. def span(p: (A) ⇒ Boolean): (Repr, Repr)

    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.

  100. def splitAt(n: Int): (Repr, Repr)

    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.

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

  102. 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
  103. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: TraversableLike
  104. def sum[B >: A](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
  105. def tail: Repr

    Selects all elements except the first

    Selects all elements except the first.

  106. def take(n: Int): Repr

    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.

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

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

  109. def toArray[B >: A](arg0: ClassManifest[B]): Array[B]

    Converts this sequence to an array

    Converts this sequence to an array.

    B

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

    returns

    an array containing all elements of this sequence.

    definition classes: TraversableLike
  110. def toIndexedSeq[B >: A]: IndexedSeq[B]

    Converts this sequence to an indexed sequence

    Converts this sequence to an indexed sequence.

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

    definition classes: IterableLikeTraversableLike
  112. def toList: List[A]

    Converts this sequence to a list

    Converts this sequence to a list.

    definition classes: TraversableLike
  113. def toSeq: Seq[A]

    Converts this sequence to a sequence

    Converts this sequence to a sequence.

    Overridden for efficiency.

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

    Converts this sequence to a set

    Converts this sequence to a set.

    definition classes: TraversableLike
  115. def toStream: Stream[A]

    Converts this sequence to a stream

    Converts this sequence to a stream.

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

    Converts this sequence to a string

    Converts this sequence to a string

    definition classes: SeqLikeTraversableLike ⇐ AnyRef ⇐ Any
  117. def union[B >: A, That](that: Seq[B])(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.

    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.

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

    definition classes: SeqLike
  119. def view(from: Int, until: Int): IndexedSeqView[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.

  120. def view: IndexedSeqView[A, Repr]

    Creates a non-strict view of this sequence

    Creates a non-strict view of this sequence.

  121. 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 satify the predicate p.

    definition classes: TraversableLike
  122. def zip[A1 >: A, B, That](that: Iterable[B])(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.

  123. def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(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
  124. def zipWithIndex[A1 >: A, That](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.