scala.collection.immutable

StringLike

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

A trait describing stringlike collections.

Repr

The type of the actual collection inheriting StringLike.

go to: companion
linear super types: Ordered[String], Comparable[String], IndexedSeqOptimized[Char, Repr], IndexedSeqLike[Char, Repr], SeqLike[Char, Repr], IterableLike[Char, Repr], TraversableLike[Char, Repr], TraversableOnce[Char], FilterMonadic[Char, Repr], HasNewBuilder[Char, Repr], Equals, AnyRef, Any
known subclasses: StringOps, WrappedString
self type: StringLike[Repr]
source: StringLike.scala
    since
  1. 2.8

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. StringLike
  2. Ordered
  3. Comparable
  4. IndexedSeqOptimized
  5. IndexedSeqLike
  6. SeqLike
  7. IterableLike
  8. TraversableLike
  9. TraversableOnce
  10. FilterMonadic
  11. HasNewBuilder
  12. Equals
  13. AnyRef
  14. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Type Members

  1. class Elements extends BufferedIterator[A]

    The class of the iterator returned by the iterator method.

  2. type Self = Repr

    The type implementing this traversable

    The type implementing this traversable

    attributes: protected
    definition classes: TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

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

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

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

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

    arg0

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

    returns

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

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

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

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

    attributes: final
    definition classes: AnyRef
  6. def * (n: Int) : String

    Return the current string concatenated n times.

    Return the current string concatenated n times.

  7. def ++ (that: TraversableOnce[Char]) : String[Char]

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

    [use case]

    Concatenates this string with the elements of a traversable collection.

    that

    the traversable to append.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  8. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]) : That

    Concatenates this string with the elements of a traversable collection.

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

    definition classes: TraversableLike
  9. def +: (elem: Char) : String[Char]

    [use case] Prepends an element to this string

    [use case]

    Prepends an element to this string

    elem

    the prepended element

    returns

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

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

    Prepends an element to this string

    Prepends an element to this string

    B

    the element type of the returned string.

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

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

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

    Applies a binary operator to a start value and all elements of this string, 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 string, 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 string.

    definition classes: TraversableOnce
  12. def :+ (elem: Char) : String[Char]

    [use case] Appends an element to this string

    [use case]

    Appends an element to this string

    elem

    the appended element

    returns

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

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

    Appends an element to this string

    Appends an element to this string

    B

    the element type of the returned string.

    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 string followed by elem.

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

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

    Applies a binary operator to all elements of this string 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 string, 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 string.

    definition classes: TraversableOnce
  15. def < (that: String) : Boolean

    definition classes: Ordered
  16. def <= (that: String) : Boolean

    definition classes: Ordered
  17. def == (arg0: AnyRef) : Boolean

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

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

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: Any
  19. def > (that: String) : Boolean

    definition classes: Ordered
  20. def >= (that: String) : Boolean

    definition classes: Ordered
  21. def addString (b: StringBuilder) : StringBuilder

    Appends all elements of this string to a string builder.

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

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  22. def addString (b: StringBuilder, sep: String) : StringBuilder

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

    Appends all elements of this string 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 string, separated by the string sep.

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  23. def addString (b: StringBuilder, start: String, sep: String, end: String) : StringBuilder

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

    Appends all elements of this string 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 string are separated by the string sep.

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  24. def apply (n: Int) : Char

    Return element at index n

    Return element at index n

    definition classes: StringLikeSeqLike
  25. def asInstanceOf [T0] : T0

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

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

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  26. def canEqual (that: Any) : Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this string should be compared

    returns

    true, if this string can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
  27. def capitalize : String

    Returns this string with first character converted to upper case

    Returns this string with first character converted to upper case

  28. def clone () : AnyRef

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

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

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    attributes: protected
    definition classes: AnyRef
  29. def collect [B] (pf: PartialFunction[Char, B]) : String[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the string.

    returns

    a new string 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
    definition classes: TraversableLike
  30. def collect [B, That] (pf: PartialFunction[Char, B])(implicit bf: CanBuildFrom[Repr, B, That]) : That

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

    Builds a new collection by applying a partial function to all elements of this string 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 string.

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

    definition classes: StringLikeOrdered
  32. def compareTo (that: String) : Int

    definition classes: Ordered → Comparable
  33. def contains (elem: Any) : Boolean

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

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

    elem

    the element to test.

    returns

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

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

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

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

    that

    the sequence to test

    returns

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

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

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    attributes: abstract
    definition classes: TraversableLike
  36. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int) : Unit

    Copies elements of this string to an array.

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

  37. def copyToArray (xs: Array[Char]) : Unit

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

    [use case]

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

    xs

    the array to fill.

    attributes: abstract
    definition classes: TraversableOnce
  38. def copyToArray [B >: A] (xs: Array[B]) : Unit

    Copies values of this string to an array.

    Copies values of this string to an array. Fills the given array xs with values of this string. Copying will stop once either the end of the current string 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: TraversableOnce
  39. def copyToArray (xs: Array[Char], start: Int) : Unit

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

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

    Copies values of this string to an array.

    Copies values of this string to an array. Fills the given array xs with values of this string, after skipping start values. Copying will stop once either the end of the current string 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: TraversableOnce
  41. def copyToBuffer [B >: A] (dest: Buffer[B]) : Unit

    Copies all elements of this string to a buffer.

    Copies all elements of this string to a buffer.

    dest

    The buffer to which elements are copied.

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

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

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

    definition classes: SeqLike
  43. def count (p: (Char) ⇒ Boolean) : Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableOnce
  44. def diff (that: Seq[Char]) : String[Char]

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

    [use case]

    Computes the multiset difference between this string and another sequence.

    that

    the sequence of elements to remove

    returns

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

    attributes: abstract
    definition classes: SeqLike
  45. def diff [B >: A] (that: Seq[B]) : Repr

    Computes the multiset difference between this string and another sequence.

    Computes the multiset difference between this string and another sequence.

    B

    the element type of the returned string.

    that

    the sequence of elements to remove

    returns

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

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

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

    returns

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

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

    returns

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

    definition classes: IndexedSeqOptimizedTraversableLike
  48. def dropRight (n: Int) : Repr

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

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

    definition classes: IndexedSeqOptimizedIterableLike
  49. 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 string whose first element does not satisfy the predicate p.

    definition classes: IndexedSeqOptimizedTraversableLike
  50. def elements : Iterator[Char]

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

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

    Tests whether this string ends with the given sequence.

    Tests whether this string ends with the given sequence.

    that

    the sequence to test

    returns

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

    definition classes: IndexedSeqOptimizedSeqLike
  52. def eq (arg0: AnyRef) : Boolean

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

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

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

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    arg0

    the object to compare against this object for reference equality.

    returns

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

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

    The equality method defined in AnyRef.

    The equality method defined in AnyRef.@return true if the receiver object is equivalent to the argument; false otherwise. */

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

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

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

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

  55. def exists (p: (Char) ⇒ Boolean) : Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

  56. def filter (p: (Char) ⇒ Boolean) : Repr

    Selects all elements of this string which satisfy a predicate.

    Selects all elements of this string which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  57. def filterNot (p: (Char) ⇒ Boolean) : Repr

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

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

    p

    the predicate used to test elements.

    returns

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

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

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

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

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

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

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

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

    p

    the predicate used to test elements.

    returns

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

  60. def findIndexOf (p: (Char) ⇒ Boolean) : Int

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

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

    definition classes: SeqLike
  61. def findLastIndexOf (p: (Char) ⇒ Boolean) : Int

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

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

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  62. def first : Char

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

  63. def firstOption : Option[Char]

    None if iterable is empty.

    None if iterable is empty.

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

  64. def flatMap [B] (f: (Char) ⇒ Traversable[B]) : String[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  65. def flatMap [B, That] (f: (Char) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]) : That

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

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

    definition classes: TraversableLikeFilterMonadic
  66. def foldLeft [B] (z: B)(op: (B, Char) ⇒ B) : B

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

    Applies a binary operator to a start value and all elements of this string, 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 string, 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 string.

    definition classes: IndexedSeqOptimizedTraversableOnce
  67. def foldRight [B] (z: B)(op: (Char, B) ⇒ B) : B

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

    Applies a binary operator to all elements of this string 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 string, 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 string.

    definition classes: IndexedSeqOptimizedIterableLikeTraversableOnce
  68. def forall (p: (Char) ⇒ Boolean) : Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

  69. def foreach (f: (Char) ⇒ Unit) : Unit

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

    [use case]

    Applies a function f to all elements of this string.

    f

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

    attributes: abstract
    definition classes: IterableLike
  70. def foreach [U] (f: (Char) ⇒ U) : Unit

    Applies a function f to all elements of this string.

    Applies a function f to all elements of this string.

    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.

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

  72. def formatLocal (l: Locale, args: Any*) : String

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

    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.

  73. def getClass () : java.lang.Class[_ <: java.lang.Object]

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

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

    The nature of the representation is platform dependent.

    returns

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

    attributes: final
    definition classes: AnyRef
  74. def groupBy [K] (f: (Char) ⇒ K) : Map[K, Repr]

    Partitions this string into a map of strings according to some discriminator function.

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

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

    definition classes: TraversableLike
  75. def grouped (size: Int) : Iterator[Repr]

    Partitions elements in fixed size strings.

    Partitions elements in fixed size strings.

    size

    the number of elements per group

    returns

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

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

  76. def hasDefiniteSize : Boolean

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

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

    Note: many collection methods will not work on collections of infinite sizes.

    returns

    true if this collection is known to have finite size, false otherwise.

    definition classes: TraversableLikeTraversableOnce
  77. def hashCode () : Int

    Hashcodes for String produce a value from the hashcodes of all the elements of the string.

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

    definition classes: SeqLike → AnyRef → Any
  78. def head : Char

    Selects the first element of this string.

    Selects the first element of this string.

    returns

    the first element of this string.

    definition classes: IndexedSeqOptimizedIterableLikeTraversableLike
  79. def headOption : Option[Char]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    definition classes: TraversableLike
  80. def indexOf (elem: Char, from: Int) : Int

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

    [use case]

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

    elem

    the element value to search for.

    from

    the start index

    returns

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

    attributes: abstract
    definition classes: SeqLike
  81. def indexOf [B >: A] (elem: B, from: Int) : Int

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

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

    definition classes: SeqLike
  82. def indexOf (elem: Char) : Int

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

    [use case]

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

    elem

    the element value to search for.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  83. def indexOf [B >: A] (elem: B) : Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

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

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

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

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

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

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

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  86. 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 string that satisfies the predicate p, or -1, if none exists.

    definition classes: IndexedSeqOptimizedSeqLike
  87. 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 string that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  88. def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

    a Range value from 0 to one less than the length of this string.

    definition classes: SeqLike
  89. def init : Repr

    Selects all elements except the last.

    Selects all elements except the last.

    returns

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

    definition classes: IndexedSeqOptimizedTraversableLike
  90. def intersect (that: Seq[Char]) : String[Char]

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

    [use case]

    Computes the multiset intersection between this string and another sequence.

    that

    the sequence of elements to intersect with.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  91. def intersect [B >: A] (that: Seq[B]) : Repr

    Computes the multiset intersection between this string and another sequence.

    Computes the multiset intersection between this string and another sequence.

    B

    the element type of the returned string.

    that

    the sequence of elements to intersect with.

    returns

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

    Tests whether this string contains given index.

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

    definition classes: SeqLike
  93. def isEmpty : Boolean

    Tests whether this string is empty.

    Tests whether this string is empty.

    returns

    true if the string contain no elements, false otherwise.

  94. def isInstanceOf [T0] : Boolean

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

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

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

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

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

    Tests whether this string can be repeatedly traversed.

    Tests whether this string can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  96. 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.

    returns

    the new iterator

    definition classes: IndexedSeqLikeIterableLike
  97. def last : Char

    Selects the last element.

    Selects the last element.

    returns

    The last element of this string.

    definition classes: IndexedSeqOptimizedTraversableLike
  98. def lastIndexOf (elem: Char, end: Int) : Int

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

    [use case]

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

    elem

    the element value to search for.

    end

    the end index.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  99. def lastIndexOf [B >: A] (elem: B, end: Int) : Int

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

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

    definition classes: SeqLike
  100. def lastIndexOf (elem: Char) : Int

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

    [use case]

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

    elem

    the element value to search for.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  101. def lastIndexOf [B >: A] (elem: B) : Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

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

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

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

    that

    the sequence to test

    end

    the end index

    returns

    the last index <= end such that the elements of this string starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

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

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

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

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  104. 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 string that satisfies the predicate p, or -1, if none exists.

    definition classes: IndexedSeqOptimizedSeqLike
  105. 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 string that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  106. def lastOption : Option[Char]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

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

    definition classes: TraversableLike
  107. def length : Int

    The length of the string.

    The length of the string.

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

    returns

    the number of elements in this string.

    definition classes: StringLikeSeqLike
  108. def lengthCompare (len: Int) : Int

    Compares the length of this string to a test value.

    Compares the length of this string to a test value.

    len

    the test value that gets compared with the length.

    returns

    A value x where x < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap.

    definition classes: IndexedSeqOptimizedSeqLike
  109. 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.

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

  111. 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)
  112. def map [B] (f: (Char) ⇒ B) : String[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  113. def map [B, That] (f: (Char) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]) : That

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

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

    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 string and collecting the results.

    definition classes: TraversableLikeFilterMonadic
  114. def max : Char

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this string.

    attributes: abstract
    definition classes: TraversableOnce
  115. def max [B >: A] (implicit 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 string with respect to the ordering cmp.

    definition classes: TraversableOnce
  116. def min : Char

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this string

    attributes: abstract
    definition classes: TraversableOnce
  117. def min [B >: A] (implicit 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 string with respect to the ordering cmp.

    definition classes: TraversableOnce
  118. def mkString : String

    Displays all elements of this string in a string.

    Displays all elements of this string in a string.

    returns

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

    definition classes: StringLikeTraversableOnce
  119. def mkString (sep: String) : String

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

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

    sep

    the separator string.

    returns

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

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

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

    Displays all elements of this string 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 string. 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 string are separated by the string sep.

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

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

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

    arg0

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

    returns

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

    attributes: final
    definition classes: AnyRef
  122. def newBuilder : Builder[Char, Repr]

    Creates a string builder buffer as builder for this class

    Creates a string builder buffer as builder for this class

    attributes: protected[this] abstract
    definition classes: StringLikeTraversableLikeHasNewBuilder
  123. def nonEmpty : Boolean

    Tests whether the string is not empty.

    Tests whether the string is not empty.

    returns

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

    definition classes: TraversableOnce
  124. def notify () : Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  125. def notifyAll () : Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  126. def padTo (len: Int, elem: Char) : String[Char]

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

    [use case]

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

    len

    the target length

    elem

    the padding value

    returns

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

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

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

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

    B

    the element type of the returned string.

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

    definition classes: SeqLike
  128. def partition (p: (Char) ⇒ Boolean) : (Repr, Repr)

    Partitions this string in two strings according to a predicate.

    Partitions this string in two strings according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    definition classes: TraversableLike
  129. def patch (from: Int, that: Seq[Char], replaced: Int) : String[Char]

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original string

    returns

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

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

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

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

    B

    the element type of the returned string.

    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 string

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

    definition classes: SeqLike
  131. def prefixLength (p: (Char) ⇒ Boolean) : Int

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: SeqLike
  132. def product : Char

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

    [use case]

    Multiplies up the elements of this collection.

    returns

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

    attributes: abstract
    definition classes: TraversableOnce
  133. def product [B >: A] (implicit num: Numeric[B]) : B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

    the product of all elements of this string with respect to the * operator in num.

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

  135. def r : Regex

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

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

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

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

    Applies a binary operator to all elements of this string, 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 string, going left to right: op(...(op(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this string.

    definition classes: IndexedSeqOptimizedTraversableOnce
  137. def reduceLeftOption [B >: A] (op: (B, Char) ⇒ B) : Option[B]

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

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

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

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

    Applies a binary operator to all elements of this string, 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 string, going right to left: op(x1, op(x2, ..., op(xn-1, xn)...)) where x,,1,,, ..., x,,n,, are the elements of this string.

    definition classes: IndexedSeqOptimizedIterableLikeTraversableOnce
  139. def reduceRightOption [B >: A] (op: (Char, B) ⇒ B) : Option[B]

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

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

    definition classes: TraversableOnce
  140. def repr : Repr

    The collection of type string underlying this TraversableLike object.

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

    definition classes: TraversableLike
  141. def reverse : Repr

    Returns new string wih elements in reversed order.

    Returns new string wih elements in reversed order.

    returns

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

    definition classes: IndexedSeqOptimizedSeqLike
  142. 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.

    returns

    an iterator yielding the elements of this string in reversed order

    definition classes: IndexedSeqOptimizedSeqLike
  143. def reverseMap [B] (f: (Char) ⇒ B) : String[B]

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

    [use case]

    Builds a new collection by applying a function to all elements of this string 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 string resulting from applying the given function f to each element of this string and collecting the results in reversed order.

    attributes: abstract
    definition classes: SeqLike
  144. def reverseMap [B, That] (f: (Char) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]) : That

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

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

    definition classes: SeqLike
  145. def reversed : List[Char]

    attributes: protected[this]
    definition classes: TraversableOnce
  146. def reversedElements : Iterator[Char]

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

  147. def sameElements (that: Iterable[Char]) : Boolean

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

    [use case]

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

    that

    the collection to compare with.

    returns

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

    attributes: abstract
    definition classes: IterableLike
  148. def sameElements [B >: A] (that: Iterable[B]) : Boolean

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

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    definition classes: IndexedSeqOptimizedIterableLike
  149. def scanLeft [B, That] (z: B)(op: (B, Char) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]) : That

    Produces a collection containing cummulative results of applying the operator going left to right.

    Produces a collection containing cummulative results of applying the operator going left to right.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    definition classes: TraversableLike
  150. def scanRight [B, That] (z: B)(op: (Char, B) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]) : That

    Produces a collection containing cummulative results of applying the operator going right to left.

    Produces a collection containing cummulative results of applying the operator going right to left.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    definition classes: TraversableLike
  151. def segmentLength (p: (Char) ⇒ Boolean, from: Int) : Int

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

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

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

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

    definition classes: IndexedSeqOptimizedSeqLike
  152. def size : Int

    The size of this string, equivalent to length.

    The size of this string, equivalent to length.

    returns

    the number of elements in this string.

    definition classes: SeqLikeTraversableOnce
  153. 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 string.

    until

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

    returns

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

    definition classes: IndexedSeqOptimizedIterableLikeTraversableLike
  154. def sliding [B >: A] (size: Int, step: Int) : Iterator[Repr]

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

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

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

    size

    the number of elements per group

    returns

    An iterator producing strings of size size, except the last and the only element will be truncated if there are fewer elements than size.

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

  156. def sortBy [B] (f: (Char) ⇒ B)(implicit ord: Ordering[B]) : Repr

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

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

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

  157. def sortWith (lt: (Char, Char) ⇒ Boolean) : Repr

    Sorts this string according to a comparison function.

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

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

    Sorts this string according to an Ordering.

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

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

  159. def span (p: (Char) ⇒ Boolean) : (Repr, Repr)

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

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

    definition classes: IndexedSeqOptimizedTraversableLike
  160. def split (separators: Array[Char]) : Array[String]

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

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

    Splits this string into two at a given position.

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

    definition classes: IndexedSeqOptimizedTraversableLike
  163. def startsWith [B] (that: Seq[B], offset: Int) : Boolean

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

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

    definition classes: IndexedSeqOptimizedSeqLike
  164. def startsWith [B] (that: Seq[B]) : Boolean

    Tests whether this string starts with the given sequence.

    Tests whether this string starts with the given sequence.

    that

    the sequence to test

    returns

    true if this collection has that as a prefix, false otherwise.

    definition classes: SeqLike
  165. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this string. By default the string prefix is the simple name of the collection class string.

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

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

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

  169. def stripPrefix (prefix: String) : String

    Returns this string with the given prefix stripped.

    Returns this string with the given prefix stripped.

  170. def stripSuffix (suffix: String) : String

    Returns this string with the given suffix stripped.

    Returns this string with the given suffix stripped. If this string does not end with suffix, it is returned unchanged.

  171. def sum : Char

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

    [use case]

    Sums up the elements of this collection.

    returns

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

    attributes: abstract
    definition classes: TraversableOnce
  172. def sum [B >: A] (implicit num: Numeric[B]) : B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

    the sum of all elements of this string with respect to the + operator in num.

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

    attributes: final
    definition classes: AnyRef
  174. def tail : Repr

    Selects all elements except the first.

    Selects all elements except the first.

    returns

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

    definition classes: IndexedSeqOptimizedTraversableLike
  175. def take (n: Int) : Repr

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this string.

    returns

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

    definition classes: IndexedSeqOptimizedIterableLikeTraversableLike
  176. def takeRight (n: Int) : Repr

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

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

    definition classes: IndexedSeqOptimizedIterableLike
  177. 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 string whose elements all satisfy the predicate p.

    definition classes: IndexedSeqOptimizedIterableLikeTraversableLike
  178. def thisCollection : IndexedSeq[Char]

    The underlying collection seen as an instance of String.

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

    attributes: protected[this]
    definition classes: IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  179. def toArray : Array[Char]

    [use case] Converts this string to an array.

    [use case]

    Converts this string to an array.

    returns

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

    attributes: abstract
    definition classes: TraversableOnce
  180. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    Converts this string to an array.

    Converts this string 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 string.

    definition classes: TraversableOnce
  181. def toBoolean : Boolean

  182. def toBuffer [B >: A] : Buffer[B]

    Converts this string to a mutable buffer.

    Converts this string to a mutable buffer.

    returns

    a buffer containing all elements of this string.

    definition classes: TraversableOnce
  183. def toByte : Byte

  184. def toCollection (repr: Repr) : IndexedSeq[Char]

    A conversion from collections of type Repr to String objects.

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

    attributes: protected[this]
    definition classes: IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  185. def toDouble : Double

  186. def toFloat : Float

  187. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this string to an indexed sequence.

    Converts this string to an indexed sequence.

    returns

    an indexed sequence containing all elements of this string.

    definition classes: TraversableOnce
  188. def toInt : Int

  189. def toIterable : Iterable[Char]

    Converts this string to an iterable collection.

    Converts this string to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this string.

    definition classes: IterableLikeTraversableOnce
  190. def toIterator : Iterator[Char]

    Returns an Iterator over the elements in this string.

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

    returns

    an Iterator containing all elements of this string.

    definition classes: TraversableLikeTraversableOnce
  191. def toList : List[Char]

    Converts this string to a list.

    Converts this string to a list.

    returns

    a list containing all elements of this string.

    definition classes: TraversableOnce
  192. def toLong : Long

  193. def toMap [T, U] (implicit ev: <:<[Char, (T, U)]) : Map[T, U]

    Converts this string to a map.

    Converts this string 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.

    returns

    a map containing all elements of this string.

    definition classes: TraversableOnce
  194. def toSeq : Seq[Char]

    Converts this string to a sequence.

    Converts this string to a sequence.

    Overridden for efficiency.@return a sequence containing all the elements of this string.

    definition classes: SeqLikeIterableLikeTraversableOnce
  195. def toSet [B >: A] : Set[B]

    Converts this string to a set.

    Converts this string to a set.

    returns

    a set containing all elements of this string.

    definition classes: TraversableOnce
  196. def toShort : Short

  197. def toStream : Stream[Char]

    Converts this string to a stream.

    Converts this string to a stream.

    returns

    a stream containing all elements of this string.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  198. def toString () : String

    Converts this string to a string.

    Converts this string to a string.

    returns

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

    definition classes: SeqLikeTraversableLike → AnyRef → Any
  199. def toTraversable : Traversable[Char]

    Converts this string to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this string.

    definition classes: TraversableLikeTraversableOnce
  200. def union (that: Seq[Char]) : String[Char]

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

    [use case]

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

    that

    the sequence to add.

    returns

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

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

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

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

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

    B

    the element type of the returned string.

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

    definition classes: SeqLike
  202. def updated (index: Int, elem: Char) : String[Char]

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

    [use case]

    A copy of this string with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

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

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

    A copy of this string with one single replaced element.

    A copy of this string with one single replaced element.

    B

    the element type of the returned string.

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

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

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

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

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

    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 string, starting at index from and extending up to (but not including) index until.

    definition classes: SeqLikeIterableLikeTraversableLike
  205. def view : SeqView[Char, Repr]

    Creates a non-strict view of this string.

    Creates a non-strict view of this string.

    returns

    a non-strict view of this string.

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

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

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

    attributes: final
    definition classes: AnyRef
  209. def withFilter (p: (Char) ⇒ Boolean) : FilterMonadic[Char, Repr]

    Creates a non-strict filter of this string.

    Creates a non-strict filter of this string.

    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 string which satisfy the predicate p.

    definition classes: TraversableLikeFilterMonadic
  210. def zip [B] (that: Iterable[B]) : String[(Char, B)]

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

    [use case]

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

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

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

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

    definition classes: IndexedSeqOptimizedIterableLike
  212. def zipAll [B] (that: Iterable[B], thisElem: Char, thatElem: B) : String[(Char, B)]

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

    [use case]

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

    thatElem

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

    returns

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

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

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

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

    thatElem

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

    returns

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

    definition classes: IterableLike
  214. def zipWithIndex : String[(Char, Int)]

    [use case] Zips this string with its indices.

    [use case]

    Zips this string with its indices.

    returns

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

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

    Zips this string with its indices.

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

    definition classes: IndexedSeqOptimizedIterableLike

Inherited from Ordered[String]

Inherited from Comparable[String]

Inherited from IndexedSeqOptimized[Char, Repr]

Inherited from IndexedSeqLike[Char, Repr]

Inherited from SeqLike[Char, Repr]

Inherited from IterableLike[Char, Repr]

Inherited from TraversableLike[Char, Repr]

Inherited from TraversableOnce[Char]

Inherited from FilterMonadic[Char, Repr]

Inherited from HasNewBuilder[Char, Repr]

Inherited from Equals

Inherited from AnyRef

Inherited from Any