scala.collection.mutable

StringBuilder

class StringBuilder extends Builder[Char, String] with CharSequence with IndexedSeq[Char] with IndexedSeqOptimized[Char, IndexedSeq[Char]]

A builder for mutable sequence of characters. This class provides an API mostly compatible with java.lang.StringBuilder, except where there are conflicts with the Scala collections API (such as the reverse method.)

attributes: final
linear super types: IndexedSeqOptimized[Char, IndexedSeq[Char]], IndexedSeqOptimized[Char, IndexedSeq[Char]], IndexedSeq[Char], IndexedSeqLike[Char, IndexedSeq[Char]], IndexedSeq[Char], IndexedSeqLike[Char, IndexedSeq[Char]], Seq[Char], Seq[Char], SeqLike[Char, IndexedSeq[Char]], PartialFunction[Int, Char], (Int) ⇒ Char, Iterable[Char], Iterable[Char], IterableLike[Char, IndexedSeq[Char]], Equals, Traversable[Char], Mutable, Traversable[Char], GenericTraversableTemplate[Char, IndexedSeq], TraversableLike[Char, IndexedSeq[Char]], TraversableOnce[Char], FilterMonadic[Char, IndexedSeq[Char]], HasNewBuilder[Char, IndexedSeq[Char]], CharSequence, Builder[Char, String], Growable[Char], AnyRef, Any
source: StringBuilder.scala
    version
  1. 2.8

    since
  1. 2.7

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. StringBuilder
  2. IndexedSeqOptimized
  3. IndexedSeqOptimized
  4. IndexedSeq
  5. IndexedSeqLike
  6. IndexedSeq
  7. IndexedSeqLike
  8. Seq
  9. Seq
  10. SeqLike
  11. PartialFunction
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableLike
  16. Equals
  17. Traversable
  18. Mutable
  19. Traversable
  20. GenericTraversableTemplate
  21. TraversableLike
  22. TraversableOnce
  23. FilterMonadic
  24. HasNewBuilder
  25. CharSequence
  26. Builder
  27. Growable
  28. AnyRef
  29. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new StringBuilder (str: String)

    Constructs a string builder with initial characters equal to characters of str.

    Constructs a string builder with initial characters equal to characters of str.

  2. new StringBuilder (capacity: Int)

    Constructs a string builder with no characters in it and an initial capacity specified by the capacity argument.

    Constructs a string builder with no characters in it and an initial capacity specified by the capacity argument.

    capacity

    the initial capacity.

  3. new StringBuilder ()

    Constructs a string builder with no characters in it and an initial capacity of 16 characters.

    Constructs a string builder with no characters in it and an initial capacity of 16 characters.

  4. new StringBuilder (initCapacity: Int, initValue: String)

    Constructs a string builder initialized with String initValue and with additional Char capacity initCapacity.

    Constructs a string builder initialized with String initValue and with additional Char capacity initCapacity.

  5. new StringBuilder (underlying: StringBuilder)

Type Members

  1. class Elements extends BufferedIterator[A]

    The class of the iterator returned by the iterator method.

  2. type Self = IndexedSeq[Char]

    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 + (x: Char) : StringBuilder.this.type

    !!! This should create a new sequence.

    !!! This should create a new sequence.

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

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

    [use case]

    Concatenates this mutable indexed sequence with the elements of a traversable collection.

    that

    the traversable to append.

    returns

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

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

    Concatenates this mutable indexed sequence with the elements of a traversable collection.

    Concatenates this mutable indexed sequence with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

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

    returns

    a new collection of type That which contains all elements of this mutable indexed sequence followed by all elements of that.

    definition classes: TraversableLike
  9. def ++= (xs: TraversableOnce[Char]) : StringBuilder.this.type

    adds all elements produced by a TraversableOnce to this mutable indexed sequence.

    adds all elements produced by a TraversableOnce to this mutable indexed sequence.

    returns

    the mutable indexed sequence itself.

    definition classes: Growable
  10. def +: (elem: Char) : IndexedSeq[Char]

    [use case] Prepends an element to this mutable indexed sequence

    [use case]

    Prepends an element to this mutable indexed sequence

    elem

    the prepended element

    returns

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

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

    Prepends an element to this mutable indexed sequence

    Prepends an element to this mutable indexed sequence

    B

    the element type of the returned mutable indexed sequence.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    elem

    the prepended element

    bf

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

    returns

    a new collection of type That consisting of elem followed by all elements of this mutable indexed sequence.

    definition classes: SeqLike
  12. def += (x: Char) : StringBuilder.this.type

    Appends the given Char to the end of the sequence.

    Appends the given Char to the end of the [email protected] the builder itself.

    definition classes: StringBuilderBuilderGrowable
  13. def += (elem1: Char, elem2: Char, elems: Char*) : StringBuilder.this.type

    adds two or more elements to this mutable indexed sequence.

    adds two or more elements to this mutable indexed sequence.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the mutable indexed sequence itself

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

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

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

    definition classes: TraversableOnce
  15. def :+ (elem: Char) : IndexedSeq[Char]

    [use case] Appends an element to this mutable indexed sequence

    [use case]

    Appends an element to this mutable indexed sequence

    elem

    the appended element

    returns

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

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

    Appends an element to this mutable indexed sequence

    Appends an element to this mutable indexed sequence

    B

    the element type of the returned mutable indexed sequence.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    elem

    the appended element

    bf

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

    returns

    a new collection of type That consisting of all elements of this mutable indexed sequence followed by elem.

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

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

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

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

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

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

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

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

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

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

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

    Appends all elements of this mutable indexed sequence to a string builder.

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

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

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

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

    Appends all elements of this mutable indexed sequence to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this mutable indexed sequence, separated by the string sep.

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

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

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

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

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

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

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

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

    definition classes: PartialFunctionFunction1
  24. def append (x: Array[Char], offset: Int, len: Int) : StringBuilder

      deprecated:
    1. "use appendAll instead. This method is deprecated because\012".+("of the possible confusion with append(Any, Int, Int)'.")

  25. def append (x: Array[Char]) : StringBuilder

      deprecated:
    1. "use appendAll instead. This method is deprecated because\012".+("of the possible confusion with append(Any)'.")

  26. def append (x: Seq[Char]) : StringBuilder

      deprecated:
    1. "Use appendAll instead. This method is deprecated because of the\012".+("possible confusion with append(Any)'.")

  27. def append (x: Char) : StringBuilder

  28. def append (x: Double) : StringBuilder

  29. def append (x: Float) : StringBuilder

  30. def append (x: Long) : StringBuilder

  31. def append (x: Int) : StringBuilder

  32. def append (x: Short) : StringBuilder

  33. def append (x: Byte) : StringBuilder

  34. def append (x: Boolean) : StringBuilder

    Append the String representation of the given primitive type to this sequence.

    Append the String representation of the given primitive type to this sequence. The argument is converted to a String with String.valueOf.

    x

    a primitive value

    returns

    This StringBuilder.

  35. def append (sb: StringBuilder) : StringBuilder

    Appends the specified string builder to this sequence.

    Appends the specified string builder to this sequence.

    sb

    @return

  36. def append (s: String) : StringBuilder

    Appends the given String to this sequence.

    Appends the given String to this sequence.

    s

    a String.

    returns

    this StringBuilder.

  37. def append (x: Any) : StringBuilder

    Appends the string representation of the given argument, which is converted to a String with String.

    Appends the string representation of the given argument, which is converted to a String with String.valueOf.

    x

    an Any object.

    returns

    this StringBuilder.

  38. def appendAll (xs: Array[Char], offset: Int, len: Int) : StringBuilder

    Appends a portion of the given Array[Char] to this sequence.

    Appends a portion of the given Array[Char] to this sequence.

    xs

    the Array containing Chars to be appended.

    offset

    the index of the first Char to append.

    len

    the numbers of Chars to append.

    returns

    this StringBuilder.

  39. def appendAll (xs: Array[Char]) : StringBuilder

    Appends all the Chars in the given Array[Char] to this sequence.

    Appends all the Chars in the given Array[Char] to this sequence.

    xs

    the characters to be appended.

    returns

    a reference to this object.

  40. def appendAll (xs: TraversableOnce[Char]) : StringBuilder

    Appends all the Chars in the given Seq[Char] to this sequence.

    Appends all the Chars in the given Seq[Char] to this sequence.

    xs

    the characters to be appended.

    returns

    this StringBuilder.

  41. def apply (index: Int) : Char

    Equivalent to charAt.

    Equivalent to [email protected] the element of this mutable indexed sequence at index idx, where 0 indicates the first element.

    definition classes: StringBuilderSeqLikeFunction1
  42. 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
  43. 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 mutable indexed sequence should be compared

    returns

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

    definition classes: IterableLikeEquals
  44. def capacity : Int

    Returns the current capacity, which is the size of the underlying array.

    Returns the current capacity, which is the size of the underlying array. A new array will be allocated if the current capacity is exceeded.

    returns

    the capacity

  45. def capacity_= (n: Int) : Unit

      deprecated:
    1. "Use ensureCapacity' instead. An assignment is misleading because\012".+("it can never decrease the capacity.")

  46. def charAt (index: Int) : Char

    Returns the Char at the specified index, counting from 0 as in Arrays.

    Returns the Char at the specified index, counting from 0 as in Arrays.

    index

    the index to look up

    returns

    the Char at the given index.

    definition classes: StringBuilder → CharSequence
  47. def clear () : Unit

    Clears the builder contents.

    Clears the builder contents.

    definition classes: StringBuilderBuilderGrowable
  48. def clone () : StringBuilder

    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.

    definition classes: StringBuilder → AnyRef
  49. def collect [B] (pf: PartialFunction[Char, B]) : IndexedSeq[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the mutable indexed sequence.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  50. def collect [B, That] (pf: PartialFunction[Char, B])(implicit bf: CanBuildFrom[IndexedSeq[Char], B, That]) : That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    pf

    the partial function which filters and maps the mutable indexed sequence.

    bf

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

    returns

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

    definition classes: TraversableLike
  51. def companion : GenericCompanion[IndexedSeq]

    The factory companion object that builds instances of class IndexedSeq.

    The factory companion object that builds instances of class IndexedSeq. (or its Iterable superclass where class IndexedSeq is not a Seq.)

    definition classes: IndexedSeqIndexedSeqSeqSeqIterableIterableTraversableTraversableGenericTraversableTemplate
  52. def compose [A] (g: (A) ⇒ Int) : (A) ⇒ Char

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

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

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

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

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

    elem

    the element to test.

    returns

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

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

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

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

    that

    the sequence to test

    returns

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

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

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

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

    Copies elements of this mutable indexed sequence to an array.

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

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

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

    [use case]

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

    xs

    the array to fill.

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

    Copies values of this mutable indexed sequence to an array.

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

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

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

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

    Copies values of this mutable indexed sequence to an array.

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

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

    Copies all elements of this mutable indexed sequence to a buffer.

    Copies all elements of this mutable indexed sequence to a buffer.

    dest

    The buffer to which elements are copied.

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

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

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

    B

    the type of the elements of that

    that

    the other sequence

    p

    the test predicate, which relates elements from both sequences

    returns

    true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this mutable indexed sequence and y of that, otherwise false.

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

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableOnce
  64. def delete (start: Int, end: Int) : StringBuilder

    Remove a subsequence of Chars from this sequence, starting at the given start index (inclusive) and extending to the end index (exclusive) or to the end of the String, whichever comes first.

    Remove a subsequence of Chars from this sequence, starting at the given start index (inclusive) and extending to the end index (exclusive) or to the end of the String, whichever comes first.

    start

    The beginning index, inclusive.

    end

    The ending index, exclusive.

    returns

    This StringBuilder.

  65. def deleteCharAt (index: Int) : StringBuilder

    Removes the Char at the specified index.

    Removes the Char at the specified index. The sequence is shortened by one.

    index

    The index to remove.

    returns

    This StringBuilder.

  66. def diff (that: Seq[Char]) : IndexedSeq[Char]

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

    [use case]

    Computes the multiset difference between this mutable indexed sequence and another sequence.

    that

    the sequence of elements to remove

    returns

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

    attributes: abstract
    definition classes: SeqLike
  67. def diff [B >: A] (that: Seq[B]) : IndexedSeq[Char]

    Computes the multiset difference between this mutable indexed sequence and another sequence.

    Computes the multiset difference between this mutable indexed sequence and another sequence.

    B

    the element type of the returned mutable indexed sequence.

    that

    the sequence of elements to remove

    returns

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

    definition classes: SeqLike
  68. def distinct : IndexedSeq[Char]

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

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

    returns

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

    definition classes: SeqLike
  69. def drop (n: Int) : IndexedSeq[Char]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this mutable indexed sequence.

    returns

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

    definition classes: IndexedSeqOptimizedTraversableLike
  70. def dropRight (n: Int) : IndexedSeq[Char]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

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

    definition classes: IndexedSeqOptimizedIterableLike
  71. def dropWhile (p: (Char) ⇒ Boolean) : IndexedSeq[Char]

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

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

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

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

    Tests whether this mutable indexed sequence ends with the given sequence.

    Tests whether this mutable indexed sequence ends with the given sequence.

    that

    the sequence to test

    returns

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

    definition classes: IndexedSeqOptimizedSeqLike
  74. def ensureCapacity (newCapacity: Int) : Unit

    Ensure that the capacity is at least the given argument.

    Ensure that the capacity is at least the given argument. If the argument is greater than the current capacity, new storage will be allocated with size equal to the given argument or to (2 * capacity + 2), whichever is larger.

    newCapacity

    the minimum desired capacity.

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

    The equality method defined in AnyRef.

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

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

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

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

    B

    the type of the elements of that

    that

    the other sequence

    returns

    true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this mutable indexed sequence and y of that, otherwise false.

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

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

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

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

    p

    the predicate used to test elements.

    returns

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

  79. def filter (p: (Char) ⇒ Boolean) : IndexedSeq[Char]

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    Selects all elements of this mutable indexed sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  80. def filterNot (p: (Char) ⇒ Boolean) : IndexedSeq[Char]

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  81. 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[lang]
    definition classes: AnyRef
  82. def find (p: (Char) ⇒ Boolean) : Option[Char]

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

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

    p

    the predicate used to test elements.

    returns

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

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

  85. def first : Char

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

  86. def firstOption : Option[Char]

    None if iterable is empty.

    None if iterable is empty.

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

  87. def flatMap [B] (f: (Char) ⇒ Traversable[B]) : IndexedSeq[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

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

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

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

    returns

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

    definition classes: TraversableLikeFilterMonadic
  89. def flatten [B] : IndexedSeq[B]

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

    [use case]

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

    B

    the type of the elements of each traversable collection.

    returns

    a new mutable indexed sequence resulting from concatenating all element mutable indexed sequences.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  90. def flatten [B] (implicit asTraversable: (Char) ⇒ Traversable[B]) : IndexedSeq[B]

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

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

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

    a new mutable indexed sequence resulting from concatenating all element mutable indexed sequences.

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

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

    p

    the predicate used to test elements.

    returns

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

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

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

    [use case]

    Applies a function f to all elements of this mutable indexed sequence.

    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
  95. def foreach [U] (f: (Char) ⇒ U) : Unit

    Applies a function f to all elements of this mutable indexed sequence.

    Applies a function f to all elements of this mutable indexed sequence.

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

    U

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

    f

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

  96. def genericBuilder [B] : Builder[B, IndexedSeq[B]]

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

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

    definition classes: GenericTraversableTemplate
  97. 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
  98. def groupBy [K] (f: (Char) ⇒ K) : Map[K, IndexedSeq[Char]]

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

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

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new mutable indexed sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable indexed sequences such that the following invariant holds: (xs partition f)(k) = xs filter (x => f(x) == k) That is, every key k is bound to a mutable indexed sequence of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  99. def grouped (size: Int) : Iterator[IndexedSeq[Char]]

    Partitions elements in fixed size mutable indexed sequences.

    Partitions elements in fixed size mutable indexed sequences.

    size

    the number of elements per group

    returns

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

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

  100. def hasDefiniteSize : Boolean

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

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

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

    returns

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

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

    Hashcodes for IndexedSeq produce a value from the hashcodes of all the elements of the mutable indexed sequence.

    Hashcodes for IndexedSeq produce a value from the hashcodes of all the elements of the mutable indexed [email protected] the hash code value for the object. */

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

    Selects the first element of this mutable indexed sequence.

    Selects the first element of this mutable indexed sequence.

    returns

    the first element of this mutable indexed sequence.

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

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    definition classes: TraversableLike
  104. def indexOf (str: String, fromIndex: Int) : Int

    Finds the index of the first occurrence of the specified substring.

    Finds the index of the first occurrence of the specified substring.

    str

    the target string to search for

    fromIndex

    the smallest index in the source string to consider

    returns

    the first applicable index where target occurs, or -1 if not found.

  105. def indexOf (str: String) : Int

    Finds the index of the first occurrence of the specified substring.

    Finds the index of the first occurrence of the specified substring.

    str

    the target string to search for

    returns

    the first applicable index where target occurs, or -1 if not found.

  106. def indexOf (elem: Char, from: Int) : Int

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

    [use case]

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

    elem

    the element value to search for.

    from

    the start index

    returns

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

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

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    from

    the start index

    returns

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

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

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

    [use case]

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

    elem

    the element value to search for.

    returns

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

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

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

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

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

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

    that

    the sequence to test

    from

    the start index

    returns

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

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

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

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

    that

    the sequence to test

    returns

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

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

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

    definition classes: SeqLike
  114. 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 mutable indexed sequence.

    definition classes: SeqLike
  115. def init : IndexedSeq[Char]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

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

    definition classes: IndexedSeqOptimizedTraversableLike
  116. def insert (at: Int, x: Array[Char]) : StringBuilder

      deprecated:
    1. "use insertAll instead. This method is deprecated because of\012".+("the possible confusion with insert(Int, Any)'.")

  117. def insert (at: Int, x: Seq[Char]) : StringBuilder

      deprecated:
    1. "use insertAll instead. This method is deprecated because of\012".+("the possible confusion with insert(Int, Any)'.")

  118. def insert (index: Int, str: Array[Char], offset: Int, len: Int) : StringBuilder

      deprecated:
    1. "use insertAll instead. This method is deprecated because of the\012".+("possible confusion with insert(Int, Any, Int, Int)'.")

  119. def insert (index: Int, x: Char) : StringBuilder

  120. def insert (index: Int, x: Double) : StringBuilder

  121. def insert (index: Int, x: Float) : StringBuilder

  122. def insert (index: Int, x: Long) : StringBuilder

  123. def insert (index: Int, x: Int) : StringBuilder

  124. def insert (index: Int, x: Short) : StringBuilder

  125. def insert (index: Int, x: Byte) : StringBuilder

  126. def insert (index: Int, x: Boolean) : StringBuilder

    Calls String.

    Calls String.valueOf on the given primitive value, and inserts the String at the given index.

    index

    the offset position.

    x

    a primitive value.

    returns

    this StringBuilder.

  127. def insert (index: Int, x: String) : StringBuilder

    Inserts the String into this character sequence.

    Inserts the String into this character sequence.

    index

    the index at which to insert.

    x

    a String.

    returns

    this StringBuilder.

  128. def insert (index: Int, x: Any) : StringBuilder

    Inserts the String representation (via String.

    Inserts the String representation (via String.valueOf) of the given argument into this sequence at the given index.

    index

    the index at which to insert.

    x

    a value.

    returns

    this StringBuilder.

  129. def insertAll (index: Int, xs: Array[Char]) : StringBuilder

    Inserts the given Array[Char] into this sequence at the given index.

    Inserts the given Array[Char] into this sequence at the given index.

    index

    the index at which to insert.

    xs

    the Array[Char].

    returns

    this StringBuilder.

  130. def insertAll (index: Int, xs: TraversableOnce[Char]) : StringBuilder

    Inserts the given Seq[Char] into this sequence at the given index.

    Inserts the given Seq[Char] into this sequence at the given index.

    index

    the index at which to insert.

    xs

    the Seq[Char].

    returns

    this StringBuilder.

  131. def insertAll (index: Int, str: Array[Char], offset: Int, len: Int) : StringBuilder

    Inserts a subarray of the given Array[Char] at the given index of this sequence.

    Inserts a subarray of the given Array[Char] at the given index of this sequence.

    index

    index at which to insert the subarray.

    str

    the Array from which Chars will be taken.

    offset

    the index of the first Char to insert.

    len

    the number of Chars from 'str' to insert.

    returns

    This StringBuilder.

  132. def intersect (that: Seq[Char]) : IndexedSeq[Char]

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

    [use case]

    Computes the multiset intersection between this mutable indexed sequence and another sequence.

    that

    the sequence of elements to intersect with.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  133. def intersect [B >: A] (that: Seq[B]) : IndexedSeq[Char]

    Computes the multiset intersection between this mutable indexed sequence and another sequence.

    Computes the multiset intersection between this mutable indexed sequence and another sequence.

    B

    the element type of the returned mutable indexed sequence.

    that

    the sequence of elements to intersect with.

    returns

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

    definition classes: SeqLike
  134. def isDefinedAt (idx: Int) : Boolean

    Tests whether this mutable indexed sequence contains given index.

    Tests whether this mutable indexed sequence contains given index.

    The implementations of methods apply and isDefinedAt turn a Seq[A] into a PartialFunction[Int, A].

    idx

    the index to test

    returns

    true if this mutable indexed sequence contains an element at position idx, false otherwise.

    definition classes: SeqLike
  135. def isEmpty : Boolean

    Tests whether this mutable indexed sequence is empty.

    Tests whether this mutable indexed sequence is empty.

    returns

    true if the mutable indexed sequence contain no elements, false otherwise.

  136. 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
  137. def isTraversableAgain : Boolean

    Tests whether this mutable indexed sequence can be repeatedly traversed.

    Tests whether this mutable indexed sequence can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  138. 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
  139. def last : Char

    Selects the last element.

    Selects the last element.

    returns

    The last element of this mutable indexed sequence.

    definition classes: IndexedSeqOptimizedTraversableLike
  140. def lastIndexOf (str: String, fromIndex: Int) : Int

    Finds the index of the last occurrence of the specified substring.

    Finds the index of the last occurrence of the specified substring.

    str

    the target string to search for

    fromIndex

    the smallest index in the source string to consider

    returns

    the last applicable index where target occurs, or -1 if not found.

  141. def lastIndexOf (str: String) : Int

    Finds the index of the last occurrence of the specified substring.

    Finds the index of the last occurrence of the specified substring.

    str

    the target string to search for

    returns

    the last applicable index where target occurs, or -1 if not found.

  142. def lastIndexOf (elem: Char, end: Int) : Int

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

    [use case]

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

    elem

    the element value to search for.

    end

    the end index.

    returns

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

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

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    end

    the end index.

    returns

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

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

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

    [use case]

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

    elem

    the element value to search for.

    returns

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

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

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

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

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

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

    that

    the sequence to test

    end

    the end index

    returns

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

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

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

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

    that

    the sequence to test

    returns

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

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

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

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

    Optionally selects the last element.

    Optionally selects the last element.

    returns

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

    definition classes: TraversableLike
  151. def length : Int

    The length of the mutable indexed sequence.

    The length of the mutable indexed sequence.

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

    returns

    the number of elements in this mutable indexed sequence.

    definition classes: StringBuilderSeqLike → CharSequence
  152. def lengthCompare (len: Int) : Int

    Compares the length of this mutable indexed sequence to a test value.

    Compares the length of this mutable indexed sequence to a test value.

    len

    the test value that gets compared with the length.

    returns

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

    definition classes: IndexedSeqOptimizedSeqLike
  153. def length_= (n: Int) : Unit

  154. def lift : (Int) ⇒ Option[Char]

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

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

    returns

    a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.

    definition classes: PartialFunction
  155. def map [B] (f: (Char) ⇒ B) : IndexedSeq[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

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

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

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

    returns

    a new collection of type That resulting from applying the given function f to each element of this mutable indexed sequence and collecting the results.

    definition classes: TraversableLikeFilterMonadic
  157. def mapResult [NewTo] (f: (String) ⇒ NewTo) : Builder[Char, NewTo]

    Creates a new builder by applying a transformation function to the results of this builder.

    Creates a new builder by applying a transformation function to the results of this builder.

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

    a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

    definition classes: Builder
  158. def max : Char

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this mutable indexed sequence.

    attributes: abstract
    definition classes: TraversableOnce
  159. 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 mutable indexed sequence with respect to the ordering cmp.

    definition classes: TraversableOnce
  160. def min : Char

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this mutable indexed sequence

    attributes: abstract
    definition classes: TraversableOnce
  161. 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 mutable indexed sequence with respect to the ordering cmp.

    definition classes: TraversableOnce
  162. def mkString : String

    Displays all elements of this mutable indexed sequence in a string.

    Displays all elements of this mutable indexed sequence in a string.

    returns

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

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

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

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

    sep

    the separator string.

    returns

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

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

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

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

    definition classes: TraversableOnce
  165. 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
  166. def newBuilder : Builder[Char, IndexedSeq[Char]]

    The builder that builds instances of type IndexedSeq[A]

    The builder that builds instances of type IndexedSeq[A]

    attributes: protected[this]
    definition classes: GenericTraversableTemplateHasNewBuilder
  167. def nonEmpty : Boolean

    Tests whether the mutable indexed sequence is not empty.

    Tests whether the mutable indexed sequence is not empty.

    returns

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

    definition classes: TraversableOnce
  168. 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
  169. 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
  170. def orElse [A1 <: A, B1 >: B] (that: PartialFunction[A1, B1]) : PartialFunction[A1, B1]

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

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

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

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

    definition classes: PartialFunction
  171. def padTo (len: Int, elem: Char) : IndexedSeq[Char]

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

    [use case]

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

    len

    the target length

    elem

    the padding value

    returns

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

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

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

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

    B

    the element type of the returned mutable indexed sequence.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    len

    the target length

    elem

    the padding value

    bf

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

    returns

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

    definition classes: SeqLike
  173. def partition (p: (Char) ⇒ Boolean) : (IndexedSeq[Char], IndexedSeq[Char])

    Partitions this mutable indexed sequence in two mutable indexed sequences according to a predicate.

    Partitions this mutable indexed sequence in two mutable indexed sequences according to a predicate.

    p

    the predicate on which to partition.

    returns

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

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

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original mutable indexed sequence

    returns

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

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

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

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

    B

    the element type of the returned mutable indexed sequence.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original mutable indexed sequence

    bf

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

    returns

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

    definition classes: SeqLike
  176. 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 mutable indexed sequence such that every element of the segment satisfies the predicate p.

    definition classes: SeqLike
  177. 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 mutable indexed sequence of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the mutable indexed sequence and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  178. 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 mutable indexed sequence with respect to the * operator in num.

    definition classes: TraversableOnce
  179. def projection : SeqView[Char, IndexedSeq[Char]]

    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

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    definition classes: TraversableOnce
  184. def replace (start: Int, end: Int, str: String) : StringBuilder

    Replaces a subsequence of Chars with the given String.

    Replaces a subsequence of Chars with the given String. The semantics are as in delete, with the String argument then inserted at index 'start'.

    start

    The beginning index, inclusive.

    end

    The ending index, exclusive.

    str

    The String to be inserted at the start index.

    returns

    This StringBuilder.

  185. def repr : IndexedSeq[Char]

    The collection of type mutable indexed sequence underlying this TraversableLike object.

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

    definition classes: TraversableLike
  186. def result () : String

    Produces a collection from the added elements.

    Produces a collection from the added elements. The builder's contents are undefined after this operation.

    returns

    a collection containing the elements added to this builder.

    definition classes: StringBuilderBuilder
  187. def reverse : StringBuilder

    Creates a new StringBuilder with the reversed contents of this one.

    Creates a new StringBuilder with the reversed contents of this one. If surrogate pairs are present, they are treated as indivisible units: each pair will appear in the same order in the updated sequence.

    returns

    the reversed StringBuilder

    definition classes: StringBuilderIndexedSeqOptimizedSeqLike
  188. def reverseContents () : StringBuilder

    Like reverse, but destructively updates the target StringBuilder.

    Like reverse, but destructively updates the target StringBuilder.

    returns

    the reversed StringBuilder (same as the target StringBuilder)

  189. 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 mutable indexed sequence in reversed order

    definition classes: IndexedSeqOptimizedSeqLike
  190. def reverseMap [B] (f: (Char) ⇒ B) : IndexedSeq[B]

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

    [use case]

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

    B

    the element type of the returned collection.

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

    f

    the function to apply to each element.

    returns

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

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

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

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

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

    returns

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

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

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

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

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

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

    [use case]

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

    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
  195. def sameElements [B >: A] (that: Iterable[B]) : Boolean

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

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    definition classes: IndexedSeqOptimizedIterableLike
  196. def scanLeft [B, That] (z: B)(op: (B, Char) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Char], 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
  197. def scanRight [B, That] (z: B)(op: (Char, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Char], 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
  198. 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 mutable indexed sequence starting from index from such that every element of the segment satisfies the predicate p.

    definition classes: IndexedSeqOptimizedSeqLike
  199. def setCharAt (index: Int, ch: Char) : Unit

    Update the sequence at the given index to hold the specified Char.

    Update the sequence at the given index to hold the specified Char.

    index

    the index to modify.

    ch

    the new Char.

  200. def setLength (len: Int) : Unit

    Sets the length of the character sequence.

    Sets the length of the character sequence. If the current sequence is shorter than the given length, it is padded with nulls; if it is longer, it is truncated.

    len

    the new length

  201. def size : Int

    The size of this mutable indexed sequence, equivalent to length.

    The size of this mutable indexed sequence, equivalent to length.

    returns

    the number of elements in this mutable indexed sequence.

    definition classes: SeqLikeTraversableOnce
  202. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int =0) : Unit

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed ot be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    coll

    the collection which serves as a hint for the result's size.

    delta

    a correction to add to the coll.size to produce the size hint.

    definition classes: Builder
  203. def sizeHint (size: Int) : Unit

    Gives a hint how many elements are expected to be added when the next result is called.

    Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    definition classes: Builder
  204. def sizeHintBounded (size: Int, boundingColl: scala.collection.TraversableLike[_, _]) : Unit

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    boundingColl

    the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

    definition classes: Builder
  205. def slice (from: Int, until: Int) : IndexedSeq[Char]

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

    until

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

    returns

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

    definition classes: IndexedSeqOptimizedIterableLikeTraversableLike
  206. def sliding [B >: A] (size: Int, step: Int) : Iterator[IndexedSeq[Char]]

    definition classes: IterableLike
  207. def sliding [B >: A] (size: Int) : Iterator[IndexedSeq[Char]]

    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 mutable indexed sequences 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

  208. def sortBy [B] (f: (Char) ⇒ B)(implicit ord: Ordering[B]) : IndexedSeq[Char]

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

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

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

  209. def sortWith (lt: (Char, Char) ⇒ Boolean) : IndexedSeq[Char]

    Sorts this mutable indexed sequence according to a comparison function.

    Sorts this mutable indexed sequence according to a comparison function.

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

    lt

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

    returns

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

    definition classes: SeqLike
  210. def sorted [B >: A] (implicit ord: Ordering[B]) : IndexedSeq[Char]

    Sorts this mutable indexed sequence according to an Ordering.

    Sorts this mutable indexed sequence according to an Ordering.

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

    ord

    the ordering to be used to compare elements.

    returns

    a mutable indexed sequence consisting of the elements of this mutable indexed sequence sorted according to the ordering ord.

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

  211. def span (p: (Char) ⇒ Boolean) : (IndexedSeq[Char], IndexedSeq[Char])

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

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

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this mutable indexed sequence whose elements all satisfy p, and the rest of this mutable indexed sequence.

    definition classes: IndexedSeqOptimizedTraversableLike
  212. def splitAt (n: Int) : (IndexedSeq[Char], IndexedSeq[Char])

    Splits this mutable indexed sequence into two at a given position.

    Splits this mutable indexed sequence into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    n

    the position at which to split.

    returns

    a pair of mutable indexed sequences consisting of the first n elements of this mutable indexed sequence, and the other elements.

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

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

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

    If the both the receiver object, this and the argument, that are infinite sequences this method may not terminate.

    that

    the sequence to test

    offset

    the index where the sequence is searched.

    returns

    true if the sequence that is contained in this mutable indexed sequence at index offset, otherwise false.

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

    Tests whether this mutable indexed sequence starts with the given sequence.

    Tests whether this mutable indexed sequence starts with the given sequence.

    that

    the sequence to test

    returns

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

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

    definition classes: TraversableLike
  216. def subSequence (start: Int, end: Int) : CharSequence

    For implementing CharSequence.

    For implementing CharSequence.

    definition classes: StringBuilder → CharSequence
  217. def substring (start: Int, end: Int) : String

    Returns a new String made up of a subsequence of this sequence, beginning at the start index (inclusive) and extending to the end index (exclusive).

    Returns a new String made up of a subsequence of this sequence, beginning at the start index (inclusive) and extending to the end index (exclusive).

    target.substring(start, end) is equivalent to target.slice(start, end).mkString

    start

    The beginning index, inclusive.

    end

    The ending index, exclusive.

    returns

    The new String.

  218. def substring (start: Int) : String

    Returns a new String made up of a subsequence of this sequence, beginning at the given index and extending to the end of the sequence.

    Returns a new String made up of a subsequence of this sequence, beginning at the given index and extending to the end of the sequence.

    target.substring(start) is equivalent to target.drop(start)

    start

    The starting index, inclusive.

    returns

    The new String.

  219. 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 mutable indexed sequence of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the mutable indexed sequence and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  220. 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 mutable indexed sequence with respect to the + operator in num.

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

    attributes: final
    definition classes: AnyRef
  222. def tail : IndexedSeq[Char]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

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

    definition classes: IndexedSeqOptimizedTraversableLike
  223. def take (n: Int) : IndexedSeq[Char]

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this mutable indexed sequence.

    returns

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

    definition classes: IndexedSeqOptimizedIterableLikeTraversableLike
  224. def takeRight (n: Int) : IndexedSeq[Char]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

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

    definition classes: IndexedSeqOptimizedIterableLike
  225. def takeWhile (p: (Char) ⇒ Boolean) : IndexedSeq[Char]

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

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

    The underlying collection seen as an instance of IndexedSeq.

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

    attributes: protected[this]
    definition classes: IndexedSeqLikeIndexedSeqLikeSeqLikeIterableLikeTraversableLike
  227. def toArray : Array[Char]

  228. def toArray : Array[Char]

    [use case] Converts this mutable indexed sequence to an array.

    [use case]

    Converts this mutable indexed sequence to an array.

    returns

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

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

    Converts this mutable indexed sequence to an array.

    Converts this mutable indexed sequence to an array.

    B

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

    returns

    an array containing all elements of this mutable indexed sequence.

    definition classes: TraversableOnce
  230. def toBuffer [B >: A] : Buffer[B]

    Converts this mutable indexed sequence to a mutable buffer.

    Converts this mutable indexed sequence to a mutable buffer.

    returns

    a buffer containing all elements of this mutable indexed sequence.

    definition classes: TraversableOnce
  231. def toCollection (repr: IndexedSeq[Char]) : IndexedSeq[Char]

    A conversion from collections of type Repr to IndexedSeq objects.

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

    attributes: protected[this]
    definition classes: IndexedSeqLikeIndexedSeqLikeSeqLikeIterableLikeTraversableLike
  232. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this mutable indexed sequence to an indexed sequence.

    Converts this mutable indexed sequence to an indexed sequence.

    returns

    an indexed sequence containing all elements of this mutable indexed sequence.

    definition classes: TraversableOnce
  233. def toIterable : Iterable[Char]

    Converts this mutable indexed sequence to an iterable collection.

    Converts this mutable indexed sequence 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 mutable indexed sequence.

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

    Returns an Iterator over the elements in this mutable indexed sequence.

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

    returns

    an Iterator containing all elements of this mutable indexed sequence.

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

    Converts this mutable indexed sequence to a list.

    Converts this mutable indexed sequence to a list.

    returns

    a list containing all elements of this mutable indexed sequence.

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

    Converts this mutable indexed sequence to a map.

    Converts this mutable indexed sequence to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this mutable indexed sequence.

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

    Converts this mutable indexed sequence to a sequence.

    Converts this mutable indexed sequence to a sequence.

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

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

    Converts this mutable indexed sequence to a set.

    Converts this mutable indexed sequence to a set.

    returns

    a set containing all elements of this mutable indexed sequence.

    definition classes: TraversableOnce
  239. def toStream : Stream[Char]

    Converts this mutable indexed sequence to a stream.

    Converts this mutable indexed sequence to a stream.

    returns

    a stream containing all elements of this mutable indexed sequence.

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

    Returns a new String representing the data in this sequence.

    Returns a new String representing the data in this sequence.

    returns

    the current contents of this sequence as a String

    definition classes: StringBuilderSeqLikeFunction1TraversableLike → CharSequence → AnyRef → Any
  241. def toTraversable : Traversable[Char]

    Converts this mutable indexed sequence to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this mutable indexed sequence.

    definition classes: TraversableLikeTraversableOnce
  242. def transpose [B] (implicit asTraversable: (Char) ⇒ Traversable[B]) : IndexedSeq[IndexedSeq[B]]

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

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

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    definition classes: GenericTraversableTemplate
  243. def union (that: Seq[Char]) : IndexedSeq[Char]

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

    [use case]

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

    that

    the sequence to add.

    returns

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

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

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

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

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

    B

    the element type of the returned mutable indexed sequence.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the sequence to add.

    bf

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

    returns

    a new collection of type That which contains all elements of this mutable indexed sequence followed by all elements of that.

    definition classes: SeqLike
  245. def unzip [A1, A2] (implicit asPair: (Char) ⇒ (A1, A2)) : (IndexedSeq[A1], IndexedSeq[A2])

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

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

    asPair

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

    returns

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

    definition classes: GenericTraversableTemplate
  246. def update (i: Int, c: Char) : Unit

    Equivalent to setCharAt.

    Equivalent to setCharAt.

    definition classes: StringBuilderIndexedSeqLikeSeq
  247. def updated (index: Int, elem: Char) : IndexedSeq[Char]

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

    [use case]

    A copy of this mutable indexed sequence with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

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

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

    A copy of this mutable indexed sequence with one single replaced element.

    A copy of this mutable indexed sequence with one single replaced element.

    B

    the element type of the returned mutable indexed sequence.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    index

    the position of the replacement

    elem

    the replacing element

    bf

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

    returns

    a new mutable indexed sequence which is a copy of this mutable indexed sequence with the element at position index replaced by elem.

    definition classes: SeqLike
  249. def view (from: Int, until: Int) : IndexedSeqView[Char, IndexedSeq[Char]]

    A sub-sequence view starting at index from and extending up to (but not including) index until.

    A sub-sequence view starting at index from and extending up to (but not including) index until.

    from

    The index of the first element of the slice

    until

    The index of the element following the slice

    returns

    a non-strict view of a slice of this mutable indexed sequence, starting at index from and extending up to (but not including) index until[email protected] The difference between view and slice is that view produces a view of the current sequence, whereas slice produces a new sequence.

    definition classes: IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  250. def view : IndexedSeqView[Char, IndexedSeq[Char]]

    Creates a view of this iterable @see Iterable.

    Creates a view of this iterable @see [email protected] a non-strict view of this mutable indexed sequence.

    definition classes: IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  251. def wait () : Unit

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

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

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

    Creates a non-strict filter of this mutable indexed sequence.

    Creates a non-strict filter of this mutable indexed sequence.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this mutable indexed sequence which satisfy the predicate p.

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

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

    [use case]

    Returns a mutable indexed sequence formed from this mutable indexed sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new mutable indexed sequence containing pairs consisting of corresponding elements of this mutable indexed sequence and that. The length of the returned collection is the minimum of the lengths of this mutable indexed sequence and that.

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

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

    Returns a mutable indexed sequence formed from this mutable indexed sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

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

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this mutable indexed sequence and that. The length of the returned collection is the minimum of the lengths of this mutable indexed sequence and that.

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

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

    [use case]

    Returns a mutable indexed sequence formed from this mutable indexed sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

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

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

    Returns a mutable indexed sequence formed from this mutable indexed sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    definition classes: IterableLike
  259. def zipWithIndex : IndexedSeq[(Char, Int)]

    [use case] Zips this mutable indexed sequence with its indices.

    [use case]

    Zips this mutable indexed sequence with its indices.

    returns

    A new mutable indexed sequence containing pairs consisting of all elements of this mutable indexed sequence 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
  260. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[IndexedSeq[Char], (A1, Int), That]) : That

    Zips this mutable indexed sequence with its indices.

    Zips this mutable indexed sequence with its indices.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

    A new collection of type That containing pairs consisting of all elements of this mutable indexed sequence paired with their index. Indices start at 0.

    definition classes: IndexedSeqOptimizedIterableLike

Inherited from IndexedSeqOptimized[Char, IndexedSeq[Char]]

Inherited from IndexedSeqOptimized[Char, IndexedSeq[Char]]

Inherited from IndexedSeq[Char]

Inherited from IndexedSeqLike[Char, IndexedSeq[Char]]

Inherited from IndexedSeq[Char]

Inherited from IndexedSeqLike[Char, IndexedSeq[Char]]

Inherited from Seq[Char]

Inherited from Seq[Char]

Inherited from SeqLike[Char, IndexedSeq[Char]]

Inherited from PartialFunction[Int, Char]

Inherited from (Int) ⇒ Char

Inherited from Iterable[Char]

Inherited from Iterable[Char]

Inherited from IterableLike[Char, IndexedSeq[Char]]

Inherited from Equals

Inherited from Traversable[Char]

Inherited from Mutable

Inherited from Traversable[Char]

Inherited from GenericTraversableTemplate[Char, IndexedSeq]

Inherited from TraversableLike[Char, IndexedSeq[Char]]

Inherited from TraversableOnce[Char]

Inherited from FilterMonadic[Char, IndexedSeq[Char]]

Inherited from HasNewBuilder[Char, IndexedSeq[Char]]

Inherited from CharSequence

Inherited from Builder[Char, String]

Inherited from Growable[Char]

Inherited from AnyRef

Inherited from Any