scala.collection.immutable

StringLike

trait StringLike[+Repr] extends IndexedSeqLike[Char, Repr] with Ordered[String]

known subclasses: StringOps, WrappedString
Go to: companion

Inherits

  1. Ordered
  2. Comparable
  3. IndexedSeqLike
  4. SeqLike
  5. IterableLike
  6. TraversableLike
  7. HasNewBuilder
  8. Equals
  9. AnyRef
  10. Any

Type Members

  1. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def *(n: Int): String

    return n times the current string

    return n times the current string

    Go to: companion
  2. def ++(that: Iterator[Char]): Seq[Char]

    [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
    Go to: companion
  3. def ++[B >: Char, 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
    Go to: companion
  4. def ++(that: Traversable[Char]): Seq[Char]

    [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
    Go to: companion
  5. def ++[B >: Char, 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
    Go to: companion
  6. def +:(elem: Char): Seq[Char]

    [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
    Go to: companion
  7. def +:[B >: Char, 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
    Go to: companion
  8. def /:[B](z: B)(op: (B, Char) ⇒ 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
    Go to: companion
  9. def :+(elem: Char): Seq[Char]

    [use case] Appends an element to this sequence

    [use case]

    Appends an element to this sequence

    elem

    the appended element

    returns

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

    attributes: abstract
    Go to: companion
  10. def :+[B >: Char, 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
    Go to: companion
  11. def :\[B](z: B)(op: (Char, 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
    Go to: companion
  12. def <(that: String): Boolean

  13. def <=(that: String): Boolean

  14. def >(that: String): Boolean

  15. def >=(that: String): Boolean

  16. 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
    Go to: companion
  17. 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
    Go to: companion
  18. 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
    Go to: companion
  19. def apply(n: Int): Char

    Return element at index n

    Return element at index n

    Go to: companion
  20. 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
    Go to: companion
  21. def capitalize: String

    Returns this string with first character converted to upper case

    Returns this string with first character converted to upper case

    Go to: companion
  22. def compare(other: String): Int

    Result of comparing this with operand that

    Result of comparing this with operand that. returns x where x < 0 iff this < that x == 0 iff this == that x > 0 iff this > that

    Go to: companion
  23. def compareTo(that: String): Int

  24. 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
    Go to: companion
  25. 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
    Go to: companion
  26. def copyToArray(xs: Array[Char], 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
    Go to: companion
  27. def copyToArray[B >: Char](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.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  28. def copyToArray(xs: Array[Char], 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
    Go to: companion
  29. def copyToArray[B >: Char](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
    Go to: companion
  30. def copyToArray(xs: Array[Char], 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
    Go to: companion
  31. def copyToArray[B >: Char](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
    Go to: companion
  32. def copyToBuffer[B >: Char](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
    Go to: companion
  33. def corresponds[B](that: Seq[B])(p: (Char, 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
    Go to: companion
  34. def count(p: (Char) ⇒ 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
    Go to: companion
  35. def diff[B >: Char, 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
    Go to: companion
  36. 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.

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  37. 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.

    definition classes: IndexedSeqLikeIterableLike
    Go to: companion
  38. def dropWhile(p: (Char) ⇒ 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.

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  39. def elements: Iterator[Char]

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

    definition classes: IndexedSeqLikeSeqLike
    Go to: companion
  41. def equals(that: Any): Boolean

    The equality method defined in AnyRef

    The equality method defined in AnyRef.

    definition classes: SeqLikeEquals ⇐ AnyRef ⇐ Any
    Go to: companion
  42. def equalsWith[B](that: Seq[B])(f: (Char, 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
    Go to: companion
  43. def exists(p: (Char) ⇒ 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.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  44. def filter(p: (Char) ⇒ 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
    Go to: companion
  45. def filterNot(p: (Char) ⇒ 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
    Go to: companion
  46. def find(p: (Char) ⇒ Boolean): Option[Char]

    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.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  47. def findIndexOf(p: (Char) ⇒ 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
    Go to: companion
  48. def findLastIndexOf(p: (Char) ⇒ 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
    Go to: companion
  49. def first: Char

  50. def firstOption: Option[Char]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
    Go to: companion
  51. def flatMap[B](f: (Char) ⇒ 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
    Go to: companion
  52. def flatMap[B, That](f: (Char) ⇒ 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
    Go to: companion
  53. def foldLeft[B](z: B)(op: (B, Char) ⇒ 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.

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  54. def foldRight[B](z: B)(op: (Char, 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.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  55. def forall(p: (Char) ⇒ 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.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  56. def foreach(f: (Char) ⇒ 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
    Go to: companion
  57. def foreach[U](f: (Char) ⇒ U): Unit

    Applies a function f to all elements of this sequence

    Applies a function f to all elements of this sequence.

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

    U

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

    f

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

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  58. def format(l: Locale, args: Any*): String

    Like format(args*) but takes an initial Locale parameter which influences formatting as in java

    Like format(args*) but takes an initial Locale parameter which influences formatting as in java.lang.String's format.

    The interpretation of the formatting patterns is described in java.util.Formatter, with the addition that classes deriving from ScalaNumber (such as scala.BigInt and scala.BigDecimal) are unwrapped to pass a type which Formatter understands.

    args

    the arguments used to instantiating the pattern.

    Go to: companion
  59. def format(args: Any*): String

    Uses the underlying string as a pattern (in a fashion similar to printf in C), and uses the supplied arguments to fill in the holes

    Uses the underlying string as a pattern (in a fashion similar to printf in C), and uses the supplied arguments to fill in the holes.

    The interpretation of the formatting patterns is described in java.util.Formatter, with the addition that classes deriving from ScalaNumber (such as scala.BigInt and scala.BigDecimal) are unwrapped to pass a type which Formatter understands.

    args

    the arguments used to instantiating the pattern.

    Go to: companion
  60. def groupBy[K](f: (Char) ⇒ 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
    Go to: companion
  61. def grouped(size: Int): Iterator[Repr]

    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
    Go to: companion
  62. 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
    Go to: companion
  63. 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
    Go to: companion
  64. def head: Char

    Selects the first element of this sequence

    Selects the first element of this sequence.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  65. def headOption: Option[Char]

    Optionally selects the first element

    Optionally selects the first element.

    definition classes: TraversableLike
    Go to: companion
  66. def indexOf(elem: Char): 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
    Go to: companion
  67. def indexOf[B >: Char](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
    Go to: companion
  68. def indexOf(elem: Char): 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
    Go to: companion
  69. def indexOf[B >: Char](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
    Go to: companion
  70. def indexOfSlice[B >: Char](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
    Go to: companion
  71. def indexOfSlice[B >: Char](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
    Go to: companion
  72. def indexWhere(p: (Char) ⇒ 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.

    definition classes: IndexedSeqLikeSeqLike
    Go to: companion
  73. def indexWhere(p: (Char) ⇒ 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
    Go to: companion
  74. def indices: Range

    Produces the range of all indices of this sequence

    Produces the range of all indices of this sequence.

    definition classes: SeqLike
    Go to: companion
  75. def init: Repr

    Selects all elements except the last

    Selects all elements except the last.

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  76. def intersect[B >: Char, 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
    Go to: companion
  77. 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
    Go to: companion
  78. def isEmpty: Boolean

    Tests whether this sequence is empty

    Tests whether this sequence is empty.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  79. def iterator: Iterator[Char]

    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: IndexedSeqLikeIterableLike
    Go to: companion
  80. def last: Char

    Selects the last element

    Selects the last element.

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  81. def lastIndexOf(elem: Char): 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
    Go to: companion
  82. def lastIndexOf[B >: Char](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
    Go to: companion
  83. def lastIndexOf(elem: Char): 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
    Go to: companion
  84. def lastIndexOf[B >: Char](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
    Go to: companion
  85. def lastIndexOfSlice[B >: Char](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
    Go to: companion
  86. def lastIndexOfSlice[B >: Char](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
    Go to: companion
  87. def lastIndexWhere(p: (Char) ⇒ 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: IndexedSeqLikeSeqLike
    Go to: companion
  88. def lastIndexWhere(p: (Char) ⇒ 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
    Go to: companion
  89. def lastOption: Option[Char]

    Optionally selects the last element

    Optionally selects the last element.

    definition classes: TraversableLike
    Go to: companion
  90. def length: Int

    The length of the sequence

    The length of the sequence.

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

    Go to: companion
  91. 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: IndexedSeqLikeSeqLike
    Go to: companion
  92. def lines: Iterator[String]

    Return all lines in this string in an iterator, excluding trailing line end characters, i

    Return all lines in this string in an iterator, excluding trailing line end characters, i.e. apply .stripLineEnd to all lines returned by linesWithSeparators.

    Go to: companion
  93. def linesIterator: Iterator[String]

    Return all lines in this string in an iterator, excluding trailing line end characters, i

    Return all lines in this string in an iterator, excluding trailing line end characters, i.e. apply .stripLineEnd to all lines returned by linesWithSeparators.

    Go to: companion
  94. def linesWithSeparators: Iterator[String]

    Return all lines in this string in an iterator, including trailing line end characters

    Return all lines in this string in an iterator, including trailing line end characters.

    The number of strings returned is one greater than the number of line end characters in this string. For an empty string, a single empty line is returned. A line end character is one of

    • LF - line feed (0x0A hex)
    • FF - form feed (0x0C hex)

    Go to: companion
  95. def map[B](f: (Char) ⇒ 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
    Go to: companion
  96. def map[B, That](f: (Char) ⇒ 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
    Go to: companion
  97. def max[B >: Char](cmp: Ordering[B]): Char

    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
    Go to: companion
  98. def min: Char

    [use case] Finds the largest element

    [use case]

    Finds the largest element.

    attributes: abstract
    Go to: companion
  99. def min: Char

    [use case] Finds the smallest element

    [use case]

    Finds the smallest element.

    attributes: abstract
    Go to: companion
  100. def min[B >: Char](cmp: Ordering[B]): Char

    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
    Go to: companion
  101. def mkString: String

    Displays all elements of this sequence in a string

    Displays all elements of this sequence in a string.

    Go to: companion
  102. 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
    Go to: companion
  103. 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
    Go to: companion
  104. def nonEmpty: Boolean

    Tests whether the sequence is not empty

    Tests whether the sequence is not empty.

    definition classes: TraversableLike
    Go to: companion
  105. def padTo(len: Int, elem: Char): Seq[Char]

    [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
    Go to: companion
  106. def padTo[B >: Char, 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
    Go to: companion
  107. def partialMap[B](pf: PartialFunction[Char, 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
    Go to: companion
  108. def partialMap[B, That](pf: PartialFunction[Char, 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
    Go to: companion
  109. def partition(p: (Char) ⇒ 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
    Go to: companion
  110. def patch(from: Int, that: Seq[Char], replaced: Int): Seq[Char]

    [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
    Go to: companion
  111. def patch[B >: Char, 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
    Go to: companion
  112. def prefixLength(p: (Char) ⇒ 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
    Go to: companion
  113. def product: Int

    [use case] Multiplies up the elements of this collection

    [use case]

    Multiplies up the elements of this collection.

    attributes: abstract
    Go to: companion
  114. def product[B >: Char](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
    Go to: companion
  115. def projection: SeqView[Char, 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
    Go to: companion
  116. def r: Regex

    You can follow a string with

    You can follow a string with .r', turning it into a Regex. E.g. """A\w*""".r is the regular expression for identifiers starting with A'.

    Go to: companion
  117. def reduceLeft[B >: Char](op: (B, Char) ⇒ 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.

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  118. def reduceLeftOption[B >: Char](op: (B, Char) ⇒ 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
    Go to: companion
  119. def reduceRight[B >: Char](op: (Char, 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.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  120. def reduceRightOption[B >: Char](op: (Char, 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
    Go to: companion
  121. 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
    Go to: companion
  122. 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
    Go to: companion
  123. def reverse: Repr

    Returns new sequence wih elements in reversed order

    Returns new sequence wih elements in reversed order.

    definition classes: IndexedSeqLikeSeqLike
    Go to: companion
  124. def reverseIterator: Iterator[Char]

    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.

    definition classes: IndexedSeqLikeSeqLike
    Go to: companion
  125. def reverseMap[B](f: (Char) ⇒ 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
    Go to: companion
  126. def reverseMap[B, That](f: (Char) ⇒ 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
    Go to: companion
  127. def reversedElements: Iterator[Char]

  128. def sameElements(that: Iterable[Char]): 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
    Go to: companion
  129. def sameElements[B >: Char](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.

    definition classes: IndexedSeqLikeIterableLike
    Go to: companion
  130. def segmentLength(p: (Char) ⇒ 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.

    definition classes: IndexedSeqLikeSeqLike
    Go to: companion
  131. def size: Int

    The size of this sequence, equivalent to length

    The size of this sequence, equivalent to length.

    definition classes: SeqLikeTraversableLike
    Go to: companion
  132. 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.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  133. def sliding[B >: Char](size: Int, step: Int): Iterator[Repr]

  134. def sliding[B >: Char](size: Int): Iterator[Repr]

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

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

    size

    the number of elements per group

    returns

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

    definition classes: IterableLike
    Go to: companion
  135. def sortBy[B](f: (Char) ⇒ 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
    Go to: companion
  136. def sortWith[B >: Char](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
    Go to: companion
  137. def sortWith(lt: (Char, Char) ⇒ 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
    Go to: companion
  138. def span(p: (Char) ⇒ 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.

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  139. def split(separators: Array[Char]): Array[String]

  140. def split(separator: Char): Array[String]

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

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  142. 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: IndexedSeqLikeSeqLike
    Go to: companion
  143. 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
    Go to: companion
  144. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: TraversableLike
    Go to: companion
  145. def stripLineEnd: String

    Strip trailing line end character from this string if it has one

    Strip trailing line end character from this string if it has one. A line end character is one of

    • LF - line feed (0x0A hex)
    • FF - form feed (0x0C hex)

    If a line feed character LF is preceded by a carriage return CR (0x0D hex), the CR character is also stripped (Windows convention).

    Go to: companion
  146. def stripMargin: String

    For every line in this string:

    For every line in this string:

    Strip a leading prefix consisting of blanks or control characters followed by | from the line.

    Go to: companion
  147. def stripMargin(marginChar: Char): String

    For every line in this string:

    For every line in this string:

    Strip a leading prefix consisting of blanks or control characters followed by marginChar from the line.

    Go to: companion
  148. def stripPrefix(prefix: String): String

    Returns this string with the given prefix stripped

    Returns this string with the given prefix stripped.

    Go to: companion
  149. def stripSuffix(suffix: String): String

    Returns this string with the given suffix stripped

    Returns this string with the given suffix stripped.

    Go to: companion
  150. def sum: Int

    [use case] Sums up the elements of this collection

    [use case]

    Sums up the elements of this collection.

    attributes: abstract
    Go to: companion
  151. def sum[B >: Char](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
    Go to: companion
  152. def tail: Repr

    Selects all elements except the first

    Selects all elements except the first.

    definition classes: IndexedSeqLikeTraversableLike
    Go to: companion
  153. 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.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  154. def takeRight(n: Int): Repr

    Selects last n elements

    Selects last n elements.

    n

    the number of elements to take

    returns

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

    definition classes: IndexedSeqLikeIterableLike
    Go to: companion
  155. def takeWhile(p: (Char) ⇒ Boolean): Repr

    Takes longest prefix of elements that satisfy a predicate

    Takes longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this sequence whose elements all satisfy the predicate p.

    definition classes: IndexedSeqLikeIterableLikeTraversableLike
    Go to: companion
  156. def toArray: Array[Char]

    [use case] Converts this sequence to an array

    [use case]

    Converts this sequence to an array.

    attributes: abstract
    Go to: companion
  157. def toArray[B >: Char](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
    Go to: companion
  158. def toBoolean: Boolean

  159. def toByte: Byte

  160. def toDouble: Double

  161. def toFloat: Float

  162. def toIndexedSeq[B >: Char]: IndexedSeq[B]

    Converts this sequence to an indexed sequence

    Converts this sequence to an indexed sequence.

    definition classes: TraversableLike
    Go to: companion
  163. def toInt: Int

  164. def toIterable: Iterable[Char]

    Converts this sequence to an iterable collection

    Converts this sequence to an iterable collection.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  165. def toList: List[Char]

    Converts this sequence to a list

    Converts this sequence to a list.

    definition classes: TraversableLike
    Go to: companion
  166. def toLong: Long

  167. def toMap[T, U](ev: <:<[Char, (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.

    definition classes: TraversableLike
    Go to: companion
  168. def toSeq: Seq[Char]

    Converts this sequence to a sequence

    Converts this sequence to a sequence.

    Overridden for efficiency.

    definition classes: SeqLikeTraversableLike
    Go to: companion
  169. def toSet[B >: Char]: Set[B]

    Converts this sequence to a set

    Converts this sequence to a set.

    definition classes: TraversableLike
    Go to: companion
  170. def toShort: Short

  171. def toStream: Stream[Char]

    Converts this sequence to a stream

    Converts this sequence to a stream.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  172. def toString(): String

    Converts this sequence to a string

    Converts this sequence to a string

    definition classes: SeqLikeTraversableLike ⇐ AnyRef ⇐ Any
    Go to: companion
  173. def union(that: Seq[Char]): Seq[Char]

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

    [use case]

    Computes the multiset intersection between this sequence and another sequence.

    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
    Go to: companion
  174. def union(that: Seq[Char]): Seq[Char]

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

    [use case]

    Computes the multiset difference between this sequence and another sequence.

    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
    Go to: companion
  175. def union(that: Seq[Char]): Seq[Char]

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

    that

    the sequence to add.

    returns

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

    attributes: abstract
    Go to: companion
  176. def union[B >: Char, 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
    Go to: companion
  177. def updated(index: Int, elem: Char): Seq[Char]

    [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
    Go to: companion
  178. def updated[B >: Char, 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
    Go to: companion
  179. def view(from: Int, until: Int): IndexedSeqView[Char, Repr]

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

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

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

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

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

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

    definition classes: IndexedSeqLikeSeqLikeIterableLikeTraversableLike
    Go to: companion
  180. def view: IndexedSeqView[Char, Repr]

    Creates a non-strict view of this sequence

    Creates a non-strict view of this sequence.

    definition classes: IndexedSeqLikeSeqLikeIterableLikeTraversableLike
    Go to: companion
  181. def withFilter(p: (Char) ⇒ 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
    Go to: companion
  182. def zip[B](that: Iterable[B]): Seq[(Char, 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
    Go to: companion
  183. def zip[A1 >: Char, 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.

    definition classes: IndexedSeqLikeIterableLike
    Go to: companion
  184. def zipAll[B](that: Iterable[B], thisElem: Char, thatElem: B): Seq[(Char, 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
    Go to: companion
  185. def zipAll[B, A1 >: Char, 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
    Go to: companion
  186. def zipWithIndex: Seq[(Char, Int)]

    [use case] Zips this sequence with its indices

    [use case]

    Zips this sequence with its indices.

    attributes: abstract
    Go to: companion
  187. def zipWithIndex[A1 >: Char, 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.

    definition classes: IndexedSeqLikeIterableLike
    Go to: companion