Scala Standard Library2.12.3-1 < Back
 

# Packages

-  package root

  This is the documentation for the Scala standard library.

  This is the documentation for the Scala standard library.

  #### Package structure

  The scala package contains core types like `Int`, `Float`, `Array` or `Option` which are accessible in all Scala compilation units without explicit qualification or imports.

  Notable packages include:

  - `scala.collection` and its sub-packages contain Scala's collections framework
    - `scala.collection.immutable` - Immutable, sequential data-structures such as `Vector`, `List`, `Range`, `HashMap` or `HashSet`
    - `scala.collection.mutable` - Mutable, sequential data-structures such as `ArrayBuffer`, `StringBuilder`, `HashMap` or `HashSet`
    - `scala.collection.concurrent` - Mutable, concurrent data-structures such as `TrieMap`
    - `scala.collection.parallel.immutable` - Immutable, parallel data-structures such as `ParVector`, `ParRange`, `ParHashMap` or `ParHashSet`
    - `scala.collection.parallel.mutable` - Mutable, parallel data-structures such as `ParArray`, `ParHashMap`, `ParTrieMap` or `ParHashSet`
  - `scala.concurrent` - Primitives for concurrent programming such as `Futures` and `Promises`
  - `scala.io` - Input and output operations
  - `scala.math` - Basic math functions and additional numeric types like `BigInt` and `BigDecimal`
  - `scala.sys` - Interaction with other processes and the operating system
  - `scala.util.matching` - Regular expressions

  Other packages exist. See the complete list on the right.

  Additional parts of the standard library are shipped as separate libraries. These include:

  - `scala.reflect` - Scala's reflection API (scala-reflect.jar)
  - `scala.xml` - XML parsing, manipulation, and serialization (scala-xml.jar)
  - `scala.swing` - A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)
  - `scala.util.parsing` - Parser combinators (scala-parser-combinators.jar)

  #### Automatic imports

  Identifiers in the scala package and the `scala.Predef` object are always in scope by default.

  Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example, `List` is an alias for `scala.collection.immutable.List`.

  Other aliases refer to classes provided by the underlying platform. For example, on the JVM, `String` is an alias for `java.lang.String`.

  Definition Classes
    root
-  package scala

  Core Scala types.

  Core Scala types. They are always available without an explicit import.

  Definition Classes
    root
-  package collection

  Contains the base traits and objects needed to use and extend Scala's collection library.

  Contains the base traits and objects needed to use and extend Scala's collection library.

  #### Guide

  A detailed guide for using the collections library is available at http://docs.scala-lang.org/overviews/collections/introduction.html. Developers looking to extend the collections library can find a description of its architecture at http://docs.scala-lang.org/overviews/core/architecture-of-scala-collections.html.

  #### Using Collections

  It is convenient to treat all collections as either a scala.collection.Traversable or scala.collection.Iterable, as these traits define the vast majority of operations on a collection.

  Collections can, of course, be treated as specifically as needed, and the library is designed to ensure that the methods that transform collections will return a collection of the same type:

      scala> val array = Array(1,2,3,4,5,6)
      array: Array[Int] = Array(1, 2, 3, 4, 5, 6)

      scala> array map { _.toString }
      res0: Array[String] = Array(1, 2, 3, 4, 5, 6)

      scala> val list = List(1,2,3,4,5,6)
      list: List[Int] = List(1, 2, 3, 4, 5, 6)

      scala> list map { _.toString }
      res1: List[String] = List(1, 2, 3, 4, 5, 6)

  #### Creating Collections

  The most common way to create a collection is to use its companion object as a factory. The three most commonly used collections are scala.collection.Seq, scala.collection.immutable.Set, and scala.collection.immutable.Map. They can be used directly as shown below since their companion objects are all available as type aliases in either the scala package or in `scala.Predef`. New collections are created like this:

      scala> val seq = Seq(1,2,3,4,1)
      seq: Seq[Int] = List(1, 2, 3, 4, 1)

      scala> val set = Set(1,2,3,4,1)
      set: scala.collection.immutable.Set[Int] = Set(1, 2, 3, 4)

      scala> val map = Map(1 -> "one", 2 -> "two", 3 -> "three", 2 -> "too")
      map: scala.collection.immutable.Map[Int,String] = Map(1 -> one, 2 -> too, 3 -> three)

  It is also typical to prefer the scala.collection.immutable collections over those in scala.collection.mutable; the types aliased in the `scala.Predef` object are the immutable versions.

  Also note that the collections library was carefully designed to include several implementations of each of the three basic collection types. These implementations have specific performance characteristics which are described in the guide.

  The concrete parallel collections also have specific performance characteristics which are described in the parallel collections guide

  ##### Converting to and from Java Collections

  The scala.collection.JavaConverters object provides a collection of decorators that allow converting between Scala and Java collections using `asScala` and `asJava` methods.

  Definition Classes
    scala
-  package immutable
  Definition Classes
    collection
- ::
- AbstractMap
- BitSet
- DefaultMap
- HashMap
- HashSet
- IndexedSeq
- IntMap
- Iterable
- LinearSeq
- List
- ListMap
- ListSet
- LongMap
- Map
- MapLike
- MapProxy
- Nil
- NumericRange
- PagedSeq
- Queue
- Range
- Seq
- Set
- SetProxy
- SortedMap
- SortedSet
- Stack
- Stream
- StreamIterator
- StreamView
- StreamViewLike
- StringLike
- StringOps
- Traversable
- TreeMap
- TreeSet
- Vector
- VectorBuilder
- VectorIterator
- WrappedString

c

scala.collection.immutable

# WrappedString 

###
Companion object WrappedString

#### final class WrappedString extends AbstractSeq[Char] with IndexedSeq[Char] with StringLike[WrappedString]

This class serves as a wrapper augmenting `String`s with all the operations found in indexed sequences.

The difference between this class and `StringOps` is that calling transformer methods such as `filter` and `map` will yield an object of type `WrappedString` rather than a `String`.

Source
  WrappedString.scala
Since

  2.8

Linear Supertypes
StringLike[WrappedString], math.Ordered[String], Comparable[String], IndexedSeqOptimized[Char, WrappedString], IndexedSeq[Char], collection.IndexedSeq[Char], IndexedSeqLike[Char, WrappedString], Seq[Char], Iterable[Char], Traversable[Char], Immutable, AbstractSeq[Char], collection.Seq[Char], SeqLike[Char, WrappedString], GenSeq[Char], GenSeqLike[Char, WrappedString], PartialFunction[Int, Char], (Int) ⇒ Char, AbstractIterable[Char], collection.Iterable[Char], IterableLike[Char, WrappedString], Equals, GenIterable[Char], GenIterableLike[Char, WrappedString], AbstractTraversable[Char], collection.Traversable[Char], GenTraversable[Char], GenericTraversableTemplate[Char, IndexedSeq], TraversableLike[Char, WrappedString], GenTraversableLike[Char, WrappedString], Parallelizable[Char, ParSeq[Char]], TraversableOnce[Char], GenTraversableOnce[Char], FilterMonadic[Char, WrappedString], HasNewBuilder[Char, WrappedString], AnyRef, Any
 
Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. WrappedString
2. StringLike
3. Ordered
4. Comparable
5. IndexedSeqOptimized
6. IndexedSeq
7. IndexedSeq
8. IndexedSeqLike
9. Seq
10. Iterable
11. Traversable
12. Immutable
13. AbstractSeq
14. Seq
15. SeqLike
16. GenSeq
17. GenSeqLike
18. PartialFunction
19. Function1
20. AbstractIterable
21. Iterable
22. IterableLike
23. Equals
24. GenIterable
25. GenIterableLike
26. AbstractTraversable
27. Traversable
28. GenTraversable
29. GenericTraversableTemplate
30. TraversableLike
31. GenTraversableLike
32. Parallelizable
33. TraversableOnce
34. GenTraversableOnce
35. FilterMonadic
36. HasNewBuilder
37. AnyRef
38. Any

Implicitly

1. by SeqCharSequence
2. by unwrapString
3. by CollectionsHaveToParArray
4. by MonadOps
5. by any2stringadd
6. by StringFormat
7. by Ensuring
8. by ArrowAssoc
9. by alternateImplicit

1. Hide All
2. Show All

Visibility

1. Public
2. All

### Instance Constructors

1.  new WrappedString(self: String)

   self

     a string contained within this wrapped string

### Type Members

1.  class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable

   The class of the iterator returned by the `iterator` method.

   The class of the iterator returned by the `iterator` method. multiple `take`, `drop`, and `slice` operations on this iterator are bunched together for better efficiency.

   Attributes
     protected
   Definition Classes
     IndexedSeqLike
   Annotations
     @SerialVersionUID()
2.  class WithFilter extends FilterMonadic[A, Repr]

   A class supporting filtered operations.

   A class supporting filtered operations. Instances of this class are returned by method `withFilter`.

   Definition Classes
     TraversableLike
3.  type Self = WrappedString

   The type implementing this traversable

   The type implementing this traversable

   Attributes
     protected[this]
   Definition Classes
     TraversableLike

### Value Members

1.  final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     AnyRef → Any
2.  final def ##(): Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any
3.  def *(n: Int): String

   Return the current string concatenated `n` times.

   Return the current string concatenated `n` times.

   Definition Classes
     StringLike
4.  def ++[B >: Char, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[WrappedString, B, That]): That

   Returns a new traversable collection containing the elements from the left hand operand followed by the elements from the right hand operand.

   Returns a new traversable collection containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the traversable collection is the most specific superclass encompassing the element types of the two operands.

   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 traversable collection followed by all elements of `that`.

   Definition Classes
     TraversableLike → GenTraversableLike
5.  def ++:[B >: Char, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[WrappedString, B, That]): That

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   It differs from `++` in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

   Example:

       scala> val x = List(1)
       x: List[Int] = List(1)

       scala> val y = LinkedList(2)
       y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

       scala> val z = x ++: y
       z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

   This overload exists because: for the implementation of `++:` we should reuse that of `++` because many collections override it with more efficient versions.

   Since `TraversableOnce` has no `++` method, we have to implement that directly, but `Traversable` and down can use the overload.

   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 traversable collection followed by all elements of `that`.

   Definition Classes
     TraversableLike
6.  def ++:[B](that: TraversableOnce[B]): WrappedString[B]

   [use case] As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   [use case]

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   It differs from `++` in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

   Example:

       scala> val x = List(1)
       x: List[Int] = List(1)

       scala> val y = LinkedList(2)
       y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

       scala> val z = x ++: y
       z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Definition Classes
     TraversableLike
    Full Signature

   #### def ++:[B >: Char, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[WrappedString, B, That]): That

7.  def +:(elem: A): WrappedString[A]

   [use case] A copy of the wrapped string with an element prepended.

   [use case]

   A copy of the wrapped string with an element prepended.

   Note that :-ending operators are right associative (see example). A mnemonic for `+:` vs. `:+` is: the COLon goes on the COLlection side.

   Also, the original wrapped string is not modified, so you will want to capture the result.

   Example:

       scala> val x = List(1)
       x: List[Int] = List(1)

       scala> val y = 2 +: x
       y: List[Int] = List(2, 1)

       scala> println(x)
       List(1)

   elem

     the prepended element

   returns

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

   Definition Classes
     SeqLike → GenSeqLike
    Full Signature

   #### def +:[B >: Char, That](elem: B)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

8.  def ->[B](y: B): (WrappedString, B)
   Implicit
     This member is added by an implicit conversion from WrappedString to ArrowAssoc[WrappedString] performed by method ArrowAssoc in scala.Predef.
   Definition Classes
     ArrowAssoc
   Annotations
     @inline()
9.  def /:[B](z: B)(op: (B, Char) ⇒ B): B

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

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

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

   Examples:

   Note that the folding function used to compute b is equivalent to that used to compute c.

       scala> val a = List(1,2,3,4)
       a: List[Int] = List(1, 2, 3, 4)

       scala> val b = (5 /: a)(_+_)
       b: Int = 15

       scala> val c = (5 /: a)((x,y) => x + y)
       c: Int = 15

   Note: will not terminate for infinite-sized collections.

   Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

   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 traversable or iterator, going left to right with the start value `z` on the left:

         op(...op(op(z, x_1), x_2), ..., x_n)

     where `x1, ..., xn` are the elements of this traversable or iterator.

   Definition Classes
     TraversableOnce → GenTraversableOnce
10.  def :+(elem: A): WrappedString[A]

    [use case] A copy of this wrapped string with an element appended.

    [use case]

    A copy of this wrapped string with an element appended.

    A mnemonic for `+:` vs. `:+` is: the COLon goes on the COLlection side.

    Example:

        scala> val a = List(1)
        a: List[Int] = List(1)

        scala> val b = a :+ 2
        b: List[Int] = List(1, 2)

        scala> println(a)
        List(1)

    elem

      the appended element

    returns

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

    Definition Classes
      SeqLike → GenSeqLike
     Full Signature

    #### def :+[B >: Char, That](elem: B)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

11.  def :\[B](z: B)(op: (Char, B) ⇒ B): B

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

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

        scala> val b = (a :\ 5)(_+_)
        b: Int = 15

        scala> val c = (a :\ 5)((x,y) => x + y)
        c: Int = 15

    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 traversable or iterator, going right to left with the start value `z` on the right:

          op(x_1, op(x_2, ... op(x_n, z)...))

      where `x1, ..., xn` are the elements of this traversable or iterator.

    Definition Classes
      TraversableOnce → GenTraversableOnce
12.  def <(that: String): Boolean

    Returns true if `this` is less than `that`

    Returns true if `this` is less than `that`

    Definition Classes
      Ordered
13.  def <=(that: String): Boolean

    Returns true if `this` is less than or equal to `that`.

    Returns true if `this` is less than or equal to `that`.

    Definition Classes
      Ordered
14.  final def ==(arg0: Any): Boolean

    The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    returns

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

    Definition Classes
      AnyRef → Any
15.  def >(that: String): Boolean

    Returns true if `this` is greater than `that`.

    Returns true if `this` is greater than `that`.

    Definition Classes
      Ordered
16.  def >=(that: String): Boolean

    Returns true if `this` is greater than or equal to `that`.

    Returns true if `this` is greater than or equal to `that`.

    Definition Classes
      Ordered
17.  def addString(b: StringBuilder): StringBuilder

    Appends all elements of this traversable or iterator to a string builder.

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

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

        scala> val b = new StringBuilder()
        b: StringBuilder =

        scala> val h = a.addString(b)
        h: StringBuilder = 1234

    b

      the string builder to which elements are appended.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce
18.  def addString(b: StringBuilder, sep: String): StringBuilder

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

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

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

        scala> val b = new StringBuilder()
        b: StringBuilder =

        scala> a.addString(b, ", ")
        res0: StringBuilder = 1, 2, 3, 4

    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
19.  def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

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

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

        scala> val b = new StringBuilder()
        b: StringBuilder =

        scala> a.addString(b , "List(" , ", " , ")")
        res5: StringBuilder = List(1, 2, 3, 4)

    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
20.  def aggregate[B](z: ⇒ B)(seqop: (B, Char) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of `fold` and `reduce`. It is similar to `foldLeft` in that it doesn't require the result to be a supertype of the element type. In addition, it allows parallel collections to be processed in chunks, and then combines the intermediate results.

    `aggregate` splits the traversable or iterator into partitions and processes each partition by sequentially applying `seqop`, starting with `z` (like `foldLeft`). Those intermediate results are then combined by using `combop` (like `fold`). The implementation of this operation may operate on an arbitrary number of collection partitions (even 1), so `combop` may be invoked an arbitrary number of times (even 0).

    As an example, consider summing up the integer values of a list of chars. The initial value for the sum is 0. First, `seqop` transforms each input character to an Int and adds it to the sum (of the partition). Then, `combop` just needs to sum up the intermediate results of the partitions:

        List('a', 'b', 'c').aggregate(0)({ (sum, ch) => sum + ch.toInt }, { (p1, p2) => p1 + p2 })

    B

      the type of accumulated results

    z

      the initial value for the accumulated result of the partition - this will typically be the neutral element for the `seqop` operator (e.g. `Nil` for list concatenation or `0` for summation) and may be evaluated more than once

    seqop

      an operator used to accumulate results within a partition

    combop

      an associative operator used to combine results from different partitions

    Definition Classes
      TraversableOnce → GenTraversableOnce
21.  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
      PartialFunction → Function1
22.  def apply(n: Int): Char

    Return element at index `n`

    Return element at index `n`

    returns

      the element of this string at index `idx`, where `0` indicates the first element.

    Definition Classes
      StringLike → SeqLike → GenSeqLike
    Exceptions thrown

      `IndexOutOfBoundsException` if the index is not valid

23.  def applyOrElse[A1 <: Int, B1 >: Char](x: A1, default: (A1) ⇒ B1): B1

    Applies this partial function to the given argument when it is contained in the function domain.

    Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.

    Note that expression `pf.applyOrElse(x, default)` is equivalent to

        if(pf isDefinedAt x) pf(x) else default(x)

    except that `applyOrElse` method can be implemented more efficiently. For all partial function literals the compiler generates an `applyOrElse` implementation which avoids double evaluation of pattern matchers and guards. This makes `applyOrElse` the basis for the efficient implementation for many operations and scenarios, such as:

    - combining partial functions into `orElse`/`andThen` chains does not lead to excessive `apply`/`isDefinedAt` evaluation
    - `lift` and `unlift` do not evaluate source functions twice on each invocation
    - `runWith` allows efficient imperative-style combining of partial functions with conditionally applied actions

    For non-literal partial function classes with nontrivial `isDefinedAt` method it is recommended to override `applyOrElse` with custom implementation that avoids double `isDefinedAt` evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.

    x

      the function argument

    default

      the fallback function

    returns

      the result of this function or fallback function application.

    Definition Classes
      PartialFunction
    Since

      2.10

24.  final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type `T0`.

    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 expression `1.asInstanceOf[String]` will throw a `ClassCastException` at runtime, while the expression `List(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 type.

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown

      `ClassCastException` if the receiver object is not an instance of the erasure of type `T0`.

25.  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 iterable collection should be compared

    returns

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

    Definition Classes
      IterableLike → Equals
26.  def capitalize: String

    Returns this string with first character converted to upper case.

    Returns this string with first character converted to upper case. If the first character of the string is capitalized, it is returned unchanged. This method does not convert characters outside the Basic Multilingual Plane (BMP).

    Definition Classes
      StringLike
27.  def clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
    Note

      not specified by SLS as a member of AnyRef

28.  def codePointAt(arg0: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
29.  def codePointBefore(arg0: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
30.  def codePointCount(arg0: Int, arg1: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
31.  def collect[B](pf: PartialFunction[A, B]): WrappedString[B]

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

    [use case]

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

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the wrapped string.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike
     Full Signature

    #### def collect[B, That](pf: PartialFunction[Char, B])(implicit bf: CanBuildFrom[WrappedString, B, That]): That

32.  def collectFirst[B](pf: PartialFunction[Char, B]): Option[B]

    Finds the first element of the traversable or iterator for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the traversable or iterator for which the given partial function is defined, and applies the partial function to it.

    Note: may not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    pf

      the partial function

    returns

      an option value containing pf applied to the first value for which it is defined, or `None` if none exists.

    Definition Classes
      TraversableOnce
    Example:

    1. `Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)`

33.  def combinations(n: Int): Iterator[WrappedString]

    Iterates over combinations.

    Iterates over combinations. A _combination_ of length `n` is a subsequence of the original sequence, with the elements taken in order. Thus, `"xy"` and `"yy"` are both length-2 combinations of `"xyy"`, but `"yx"` is not. If there is more than one way to generate the same subsequence, only one will be returned.

    For example, `"xyyy"` has three different ways to generate `"xy"` depending on whether the first, second, or third `"y"` is selected. However, since all are identical, only one will be chosen. Which of the three will be taken is an implementation detail that is not defined.

    returns

      An Iterator which traverses the possible n-element combinations of this sequence.

    Definition Classes
      SeqLike
    Example:

    1. `"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)`

34.  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
      IndexedSeq → IndexedSeq → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
35.  def compare(other: String): Int

    Result of comparing `this` with operand `that`.

    Result of comparing `this` with operand `that`.

    Implement this method to determine how instances of A will be sorted.

    Returns `x` where:

    - `x < 0` when `this < that`
    - `x == 0` when `this == that`
    - `x > 0` when `this > that`
    Definition Classes
      StringLike → Ordered
36.  def compareTo(that: String): Int

    Result of comparing `this` with operand `that`.

    Result of comparing `this` with operand `that`.

    Definition Classes
      Ordered → Comparable
37.  def compareToIgnoreCase(arg0: String): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
38.  def compose[A](g: (A) ⇒ Int): (A) ⇒ Char

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

      a new function `f` such that `f(x) == apply(g(x))`

    Definition Classes
      Function1
    Annotations
      @unspecialized()
39.  def concat(arg0: String): String
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
40.  def contains[A1 >: Char](elem: A1): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    elem

      the element to test.

    returns

      `true` if this sequence has an element that is equal (as determined by `==`) to `elem`, `false` otherwise.

    Definition Classes
      SeqLike
41.  def containsSlice[B](that: GenSeq[B]): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike
42.  def contentEquals(arg0: CharSequence): Boolean
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
43.  def contentEquals(arg0: StringBuffer): Boolean
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
44.  def copyToArray(xs: Array[A], start: Int, len: Int): Unit

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

    [use case]

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

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
     Full Signature

    #### def copyToArray[B >: Char](xs: Array[B], start: Int, len: Int): Unit

45.  def copyToArray(xs: Array[A]): Unit

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

    [use case]

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

    xs

      the array to fill.

    Definition Classes
      TraversableOnce → GenTraversableOnce
     Full Signature

    #### def copyToArray[B >: Char](xs: Array[B]): Unit

46.  def copyToArray(xs: Array[A], start: Int): Unit

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

    [use case]

    Copies the elements of this wrapped string to an array. Fills the given array `xs` with values of this wrapped string, beginning at index `start`. Copying will stop once either the end of the current wrapped string is reached, or the end of the target array is reached.

    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      TraversableOnce → GenTraversableOnce
     Full Signature

    #### def copyToArray[B >: Char](xs: Array[B], start: Int): Unit

47.  def copyToBuffer[B >: Char](dest: Buffer[B]): Unit

    Copies all elements of this traversable or iterator to a buffer.

    Copies all elements of this traversable or iterator to a buffer.

    Note: will not terminate for infinite-sized collections.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableOnce
48.  def corresponds[B](that: GenSeq[B])(p: (Char, B) ⇒ Boolean): Boolean

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

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

    B

      the type of the elements of `that`

    that

      the other sequence

    p

      the test predicate, which relates elements from both sequences

    returns

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

    Definition Classes
      SeqLike → GenSeqLike
49.  def count(p: (Char) ⇒ Boolean): Int

    Counts the number of elements in the traversable or iterator which satisfy a predicate.

    Counts the number of elements in the traversable or iterator which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      TraversableOnce → GenTraversableOnce
50.  def diff(that: collection.Seq[Char]): WrappedString[Char]

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

    [use case]

    Computes the multiset difference between this wrapped string and another sequence.

    that

      the sequence of elements to remove

    returns

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

    Definition Classes
      SeqLike → GenSeqLike
     Full Signature

    #### def diff[B >: Char](that: GenSeq[B]): WrappedString

51.  def distinct: WrappedString

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

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

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
      SeqLike → GenSeqLike
52.  def drop(n: Int): WrappedString

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

      the number of elements to drop from this sequence.

    returns

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

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
53.  def dropRight(n: Int): WrappedString

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      The number of elements to take

    returns

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

    Definition Classes
      IndexedSeqOptimized → IterableLike
54.  def dropWhile(p: (Char) ⇒ Boolean): WrappedString

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

      the longest suffix of this sequence whose first element does not satisfy the predicate `p`.

    Definition Classes
      IndexedSeqOptimized → TraversableLike → GenTraversableLike
55.  def endsWith[B](that: GenSeq[B]): Boolean

    Tests whether this sequence ends with the given sequence.

    Tests whether this sequence ends with the given sequence.

    that

      the sequence to test

    returns

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

    Definition Classes
      IndexedSeqOptimized → SeqLike → GenSeqLike
56.  def ensuring(cond: (WrappedString) ⇒ Boolean, msg: ⇒ Any): WrappedString
    Implicit
      This member is added by an implicit conversion from WrappedString to Ensuring[WrappedString] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
57.  def ensuring(cond: (WrappedString) ⇒ Boolean): WrappedString
    Implicit
      This member is added by an implicit conversion from WrappedString to Ensuring[WrappedString] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
58.  def ensuring(cond: Boolean, msg: ⇒ Any): WrappedString
    Implicit
      This member is added by an implicit conversion from WrappedString to Ensuring[WrappedString] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
59.  def ensuring(cond: Boolean): WrappedString
    Implicit
      This member is added by an implicit conversion from WrappedString to Ensuring[WrappedString] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
60.  final def eq(arg0: AnyRef): Boolean

    Tests whether the argument (`that`) is a reference to the receiver object (`this`).

    Tests whether the argument (`that`) is a reference to the receiver object (`this`).

    The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional 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`).

    returns

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

    Definition Classes
      AnyRef
61.  def equals(that: Any): Boolean

    The equals method for arbitrary sequences.

    The equals method for arbitrary sequences. Compares this sequence to some other object.

    that

      The object to compare the sequence to

    returns

      `true` if `that` is a sequence that has the same elements as this sequence in the same order, `false` otherwise

    Definition Classes
      GenSeqLike → Equals → Any
62.  def equalsIgnoreCase(arg0: String): Boolean
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
63.  def exists(p: (Char) ⇒ Boolean): Boolean

    Tests whether a predicate holds for at least one element of this sequence.

    Tests whether a predicate holds for at least one element of this sequence.

    p

      the predicate used to test elements.

    returns

      `false` if this sequence is empty, otherwise `true` if the given predicate `p` holds for some of the elements of this sequence, otherwise `false`

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
64.  def filter(p: (Char) ⇒ Boolean): WrappedString

    Selects all elements of this traversable collection which satisfy a predicate.

    Selects all elements of this traversable collection which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike
65.  def filterNot(p: (Char) ⇒ Boolean): WrappedString

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike
66.  def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

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

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )
    Note

      not specified by SLS as a member of AnyRef

67.  def find(p: (Char) ⇒ Boolean): Option[Char]

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
68.  def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): WrappedString[B]

    [use case] Builds a new collection by applying a function to all elements of this wrapped string and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this wrapped string and using the elements of the resulting collections.

    For example:

        def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of wrapped string. This might cause unexpected results sometimes. For example:

        // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
        def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

        // lettersOf will return a Set[Char], not a Seq
        def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)

        // xs will be an Iterable[Int]
        val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)

        // ys will be a Map[Int, Int]
        val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic
     Full Signature

    #### def flatMap[B, That](f: (Char) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[WrappedString, B, That]): That

69.  def flatten[B]: WrappedString[B]

    [use case] Converts this wrapped string of traversable collections into a wrapped string formed by the elements of these traversable collections.

    [use case]

    Converts this wrapped string of traversable collections into a wrapped string formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the static type of wrapped string. For example:

        val xs = List(
                   Set(1, 2, 3),
                   Set(1, 2, 3)
                 ).flatten
        // xs == List(1, 2, 3, 1, 2, 3)

        val ys = Set(
                   List(1, 2, 3),
                   List(3, 2, 1)
                 ).flatten
        // ys == Set(1, 2, 3)

    B

      the type of the elements of each traversable collection.

    returns

      a new wrapped string resulting from concatenating all element wrapped strings.

    Definition Classes
      GenericTraversableTemplate
     Full Signature

    #### def flatten[B](implicit asTraversable: (Char) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

70.  def fold[A1 >: Char](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this traversable or iterator using the specified associative binary operator.

    Folds the elements of this traversable or iterator using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note: will not terminate for infinite-sized collections.

    A1

      a type parameter for the binary operator, a supertype of `A`.

    z

      a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., `Nil` for list concatenation, 0 for addition, or 1 for multiplication).

    op

      a binary operator that must be associative.

    returns

      the result of applying the fold operator `op` between all the elements and `z`, or `z` if this traversable or iterator is empty.

    Definition Classes
      TraversableOnce → GenTraversableOnce
71.  def foldLeft[B](z: B)(op: (B, Char) ⇒ B): B

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

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

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this sequence, going left to right with the start value `z` on the left:

          op(...op(z, x_1), x_2, ..., x_n)

      where `x1, ..., xn` are the elements of this sequence. Returns `z` if this sequence is empty.

    Definition Classes
      IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
72.  def foldRight[B](z: B)(op: (Char, B) ⇒ B): B

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

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

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this sequence, going right to left with the start value `z` on the right:

          op(x_1, op(x_2, ... op(x_n, z)...))

      where `x1, ..., xn` are the elements of this sequence. Returns `z` if this sequence is empty.

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
73.  def forall(p: (Char) ⇒ Boolean): Boolean

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
74.  def foreach(f: (A) ⇒ Unit): Unit

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

    [use case]

    Applies a function `f` to all elements of this wrapped string.

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

    f

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

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
     Full Signature

    #### def foreach[U](f: (Char) ⇒ U): Unit

75.  def format(args: Any*): String

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

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

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

    args

      the arguments used to instantiating the pattern.

    Definition Classes
      StringLike
    Exceptions thrown
76.  def formatLocal(l: Locale, args: Any*): String

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

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

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

    l

      an instance of `java.util.Locale`

    args

      the arguments used to instantiating the pattern.

    Definition Classes
      StringLike
    Exceptions thrown
77.  def formatted(fmtstr: String): String

    Returns string formatted according to given `format` string.

    Returns string formatted according to given `format` string. Format strings are as for `String.format` (@see java.lang.String.format).

    Implicit
      This member is added by an implicit conversion from WrappedString to StringFormat[WrappedString] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @inline()
78.  def genericBuilder[B]: Builder[B, IndexedSeq[B]]

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

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

    Definition Classes
      GenericTraversableTemplate
79.  def getBytes(): Array[Byte]
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
80.  def getBytes(arg0: Charset): Array[Byte]
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
81.  def getBytes(arg0: String): Array[Byte]
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
    Annotations
      @throws( ... )
82.  def getChars(arg0: Int, arg1: Int, arg2: Array[Char], arg3: Int): Unit
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
83.  final def getClass(): Class[_]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

      a class object corresponding to the runtime type of the receiver.

    Definition Classes
      AnyRef → Any
84.  def groupBy[K](f: (Char) ⇒ K): Map[K, WrappedString]

    Partitions this traversable collection into a map of traversable collections according to some discriminator function.

    Partitions this traversable collection into a map of traversable collections 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 traversable collection.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to traversable collections such that the following invariant holds:

          (xs groupBy f)(k) = xs filter (x => f(x) == k)

      That is, every key `k` is bound to a traversable collection of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      TraversableLike → GenTraversableLike
85.  def grouped(size: Int): Iterator[WrappedString]

    Partitions elements in fixed size iterable collections.

    Partitions elements in fixed size iterable collections.

    size

      the number of elements per group

    returns

      An iterator producing iterable collections of size `size`, except the last will be less than size `size` if the elements don't divide evenly.

    Definition Classes
      IterableLike
    See also

      scala.collection.Iterator, method `grouped`

86.  def hasDefiniteSize: Boolean

    Tests whether this traversable collection is known to have a finite size.

    Tests whether this traversable collection 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. Non-empty Iterators usually return `false` even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that `hasDefiniteSize` returns `true`. However, checking `hasDefiniteSize` can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

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

    Definition Classes
      TraversableLike → TraversableOnce → GenTraversableOnce
87.  def hashCode(): Int

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

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

    returns

      the hash code value for this object.

    Definition Classes
      IndexedSeqLike → GenSeqLike → Any
88.  def head: Char

    Selects the first element of this sequence.

    Selects the first element of this sequence.

    returns

      the first element of this sequence.

    Definition Classes
      IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
    Exceptions thrown

      `NoSuchElementException` if the sequence is empty.

89.  def headOption: Option[Char]

    Optionally selects the first element.

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      the first element of this traversable collection if it is nonempty, `None` if it is empty.

    Definition Classes
      TraversableLike → GenTraversableLike
90.  def indexOf(elem: Char, from: Int): Int

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

    [use case]

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

    elem

      the element value to search for.

    from

      the start index

    returns

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

    Definition Classes
      GenSeqLike
     Full Signature

    #### def indexOf[B >: Char](elem: B, from: Int): Int

91.  def indexOf(elem: Char): Int

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

    [use case]

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

    elem

      the element value to search for.

    returns

      the index of the first element of this wrapped string that is equal (as determined by `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike
     Full Signature

    #### def indexOf[B >: Char](elem: B): Int

92.  def indexOfSlice[B >: Char](that: GenSeq[B], from: Int): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    from

      the start index

    returns

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

    Definition Classes
      SeqLike
93.  def indexOfSlice[B >: Char](that: GenSeq[B]): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike
94.  def indexWhere(p: (Char) ⇒ Boolean, from: Int): Int

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

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

    p

      the predicate used to test elements.

    from

      the start index

    returns

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

    Definition Classes
      IndexedSeqOptimized → SeqLike → GenSeqLike
95.  def indexWhere(p: (Char) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      GenSeqLike
96.  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 sequence.

    Definition Classes
      SeqLike
97.  def init: WrappedString

    Selects all elements except the last.

    Selects all elements except the last.

    returns

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

    Definition Classes
      IndexedSeqOptimized → TraversableLike → GenTraversableLike
    Exceptions thrown

      `UnsupportedOperationException` if the sequence is empty.

98.  def inits: Iterator[WrappedString]

    Iterates over the inits of this traversable collection.

    Iterates over the inits of this traversable collection. The first value will be this traversable collection and the final one will be an empty traversable collection, with the intervening values the results of successive applications of `init`.

    returns

      an iterator over all the inits of this traversable collection

    Definition Classes
      TraversableLike
    Example:

    1. `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)`

99.  def intern(): String
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Definition Classes
      String
100.  def intersect(that: collection.Seq[Char]): WrappedString[Char]

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

     [use case]

     Computes the multiset intersection between this wrapped string and another sequence.

     that

       the sequence of elements to intersect with.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
      Full Signature

     #### def intersect[B >: Char](that: GenSeq[B]): WrappedString

101.  def isDefinedAt(idx: Int): Boolean

     Tests whether this general sequence contains given index.

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

     Definition Classes
       GenSeqLike
102.  def isEmpty: Boolean

     Tests whether this sequence is empty.

     Tests whether this sequence is empty.

     returns

       `true` if the sequence contain no elements, `false` otherwise.

     Definition Classes
       IndexedSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
103.  final def isInstanceOf[T0]: Boolean

     Test whether the dynamic type of the receiver object is `T0`.

     Test whether the dynamic type of the receiver object is `T0`.

     Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression `1.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 specified type.

     returns

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

     Definition Classes
       Any
104.  final def isTraversableAgain: Boolean

     Tests whether this traversable collection can be repeatedly traversed.

     Tests whether this traversable collection can be repeatedly traversed.

     returns

       `true`

     Definition Classes
       TraversableLike → GenTraversableLike → GenTraversableOnce
105.  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
       IndexedSeqLike → IterableLike → GenIterableLike
106.  def last: Char

     Selects the last element.

     Selects the last element.

     returns

       The last element of this sequence.

     Definition Classes
       IndexedSeqOptimized → TraversableLike → GenTraversableLike
     Exceptions thrown

       `NoSuchElementException` If the sequence is empty.

107.  def lastIndexOf(elem: Char, end: Int): Int

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

     [use case]

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

     elem

       the element value to search for.

     end

       the end index.

     returns

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

     Definition Classes
       GenSeqLike
      Full Signature

     #### def lastIndexOf[B >: Char](elem: B, end: Int): Int

108.  def lastIndexOf(elem: Char): Int

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

     [use case]

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

     elem

       the element value to search for.

     returns

       the index of the last element of this wrapped string that is equal (as determined by `==`) to `elem`, or `-1`, if none exists.

     Definition Classes
       GenSeqLike
      Full Signature

     #### def lastIndexOf[B >: Char](elem: B): Int

109.  def lastIndexOfSlice[B >: Char](that: GenSeq[B], end: Int): Int

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

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

     that

       the sequence to test

     end

       the end index

     returns

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

     Definition Classes
       SeqLike
110.  def lastIndexOfSlice[B >: Char](that: GenSeq[B]): Int

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

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

     Note: will not terminate for infinite-sized collections.

     that

       the sequence to test

     returns

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

     Definition Classes
       SeqLike
111.  def lastIndexWhere(p: (Char) ⇒ Boolean, end: Int): Int

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

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

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       IndexedSeqOptimized → SeqLike → GenSeqLike
112.  def lastIndexWhere(p: (Char) ⇒ Boolean): Int

     Finds index of last element satisfying some predicate.

     Finds index of last element satisfying some predicate.

     Note: will not terminate for infinite-sized collections.

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       GenSeqLike
113.  def lastOption: Option[Char]

     Optionally selects the last element.

     Optionally selects the last element.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     returns

       the last element of this traversable collection$ if it is nonempty, `None` if it is empty.

     Definition Classes
       TraversableLike → GenTraversableLike
114.  def length: Int

     The length of the wrapped string.

     The length of the wrapped string.

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

     returns

       the number of elements in this wrapped string.

     Definition Classes
       WrappedString → StringLike → SeqLike → GenSeqLike
     Exceptions thrown

       `IllegalArgumentException` if the length of the sequence cannot be represented in an `Int`, for example, `(-1 to Int.MaxValue).length`.

115.  def lengthCompare(len: Int): Int

     Compares the length of this sequence to a test value.

     Compares the length of this sequence to a test value.

     len

       the test value that gets compared with the length.

     returns

       A value `x` where

           x <  0       if this.length <  len
           x == 0       if this.length == len
           x >  0       if this.length >  len

       The method as implemented here does not call `length` directly; its running time is `O(length min len)` instead of `O(length)`. The method should be overwritten if computing `length` is cheap.

     Definition Classes
       IndexedSeqOptimized → SeqLike
116.  def lift: (Int) ⇒ Option[Char]

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

     Turns this partial function into a 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
     See also

       Function.unlift

117.  def lines: Iterator[String]

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

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

     Definition Classes
       StringLike
118.  def linesWithSeparators: Iterator[String]

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

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

     This method is analogous to `s.split(EOL).toIterator`, except that any existing line endings are preserved in the result strings, and the empty string yields an empty iterator.

     A line end character is one of

     - `LF` - line feed (`0x0A`)
     - `FF` - form feed (`0x0C`)
     Definition Classes
       StringLike
119.  def map[B](f: (A) ⇒ B): WrappedString[B]

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

     [use case]

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

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike → FilterMonadic
      Full Signature

     #### def map[B, That](f: (Char) ⇒ B)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

120.  def matches(arg0: String): Boolean
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
121.  def max: A

     [use case] Finds the largest element.

     [use case]

     Finds the largest element.

     returns

       the largest element of this wrapped string.

     Definition Classes
       TraversableOnce → GenTraversableOnce
      Full Signature

     #### def max[B >: Char](implicit cmp: Ordering[B]): Char

122.  def maxBy[B](f: (A) ⇒ B): A

     [use case] Finds the first element which yields the largest value measured by function f.

     [use case]

     Finds the first element which yields the largest value measured by function f.

     B

       The result type of the function f.

     f

       The measuring function.

     returns

       the first element of this wrapped string with the largest value measured by function f.

     Definition Classes
       TraversableOnce → GenTraversableOnce
      Full Signature

     #### def maxBy[B](f: (Char) ⇒ B)(implicit cmp: Ordering[B]): Char

123.  def min: A

     [use case] Finds the smallest element.

     [use case]

     Finds the smallest element.

     returns

       the smallest element of this wrapped string

     Definition Classes
       TraversableOnce → GenTraversableOnce
      Full Signature

     #### def min[B >: Char](implicit cmp: Ordering[B]): Char

124.  def minBy[B](f: (A) ⇒ B): A

     [use case] Finds the first element which yields the smallest value measured by function f.

     [use case]

     Finds the first element which yields the smallest value measured by function f.

     B

       The result type of the function f.

     f

       The measuring function.

     returns

       the first element of this wrapped string with the smallest value measured by function f.

     Definition Classes
       TraversableOnce → GenTraversableOnce
      Full Signature

     #### def minBy[B](f: (Char) ⇒ B)(implicit cmp: Ordering[B]): Char

125.  def mkString: String

     Displays all elements of this string in a string.

     Displays all elements of this string in a string.

     returns

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

     Definition Classes
       StringLike → TraversableOnce → GenTraversableOnce
126.  def mkString(sep: String): String

     Displays all elements of this traversable or iterator in a string using a separator string.

     Displays all elements of this traversable or iterator in a string using a separator string.

     sep

       the separator string.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

     1. `List(1, 2, 3).mkString("|") = "1|2|3"`

127.  def mkString(start: String, sep: String, end: String): String

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

     1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

128.  final def ne(arg0: AnyRef): Boolean

     Equivalent to `!(this eq that)`.

     Equivalent to `!(this eq that)`.

     returns

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

     Definition Classes
       AnyRef
129.  def newBuilder: Builder[Char, WrappedString]

     Creates a string builder buffer as builder for this class

     Creates a string builder buffer as builder for this class

     Attributes
       protected[this]
     Definition Classes
       WrappedString → StringLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
130.  def nonEmpty: Boolean

     Tests whether the traversable or iterator is not empty.

     Tests whether the traversable or iterator is not empty.

     returns

       `true` if the traversable or iterator contains at least one element, `false` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce
131.  final 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.

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

132.  final 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.

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

133.  def offsetByCodePoints(arg0: Int, arg1: Int): Int
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
134.  def orElse[A1 <: Int, B1 >: Char](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
135.  def padTo(len: Int, elem: A): WrappedString[A]

     [use case] A copy of this wrapped string with an element value appended until a given target length is reached.

     [use case]

     A copy of this wrapped string with an element value appended until a given target length is reached.

     len

       the target length

     elem

       the padding value

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
      Full Signature

     #### def padTo[B >: Char, That](len: Int, elem: B)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

136.  def par: ParSeq[Char]

     Returns a parallel implementation of this collection.

     Returns a parallel implementation of this collection.

     For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, `par` takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

     Specific collections (e.g. `ParArray` or `mutable.ParHashMap`) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, `par` takes constant or sublinear time.

     All parallel collections return a reference to themselves.

     returns

       a parallel implementation of this collection

     Definition Classes
       Parallelizable
137.  def parCombiner: Combiner[Char, ParSeq[Char]]

     The default `par` implementation uses the combiner provided by this method to create a new parallel collection.

     The default `par` implementation uses the combiner provided by this method to create a new parallel collection.

     returns

       a combiner for the parallel collection of type `ParRepr`

     Attributes
       protected[this]
     Definition Classes
       Seq → SeqLike → Iterable → TraversableLike → Parallelizable
138.  def partition(p: (Char) ⇒ Boolean): (WrappedString, WrappedString)

     Partitions this traversable collection in two traversable collections according to a predicate.

     Partitions this traversable collection in two traversable collections according to a predicate.

     p

       the predicate on which to partition.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike
139.  def patch(from: Int, that: GenSeq[A], replaced: Int): WrappedString[A]

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

     [use case]

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

     from

       the index of the first replaced element

     replaced

       the number of elements to drop in the original wrapped string

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
      Full Signature

     #### def patch[B >: Char, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

140.  def permutations: Iterator[WrappedString]

     Iterates over distinct permutations.

     Iterates over distinct permutations.

     returns

       An Iterator which traverses the distinct permutations of this sequence.

     Definition Classes
       SeqLike
     Example:

     1. `"abb".permutations = Iterator(abb, bab, bba)`

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

     Note: may not terminate for infinite-sized collections.

     p

       the predicate used to test elements.

     returns

       the length of the longest prefix of this general sequence such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       GenSeqLike
142.  def product: A

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
      Full Signature

     #### def product[B >: Char](implicit num: Numeric[B]): B

143.  def r(groupNames: String*): Regex

     You can follow a string with `.r(g1, ... , gn)`, turning it into a `Regex`, with group names g1 through gn.

     You can follow a string with `.r(g1, ... , gn)`, turning it into a `Regex`, with group names g1 through gn.

     `"""(\d\d)-(\d\d)-(\d\d\d\d)""".r("month", "day", "year")` matches dates and provides its subcomponents through groups named "month", "day" and "year".

     groupNames

       The names of the groups in the pattern, in the order they appear.

     Definition Classes
       StringLike
144.  def r: Regex

     You can follow a string with `.r`, turning it into a `Regex`.

     You can follow a string with `.r`, turning it into a `Regex`. E.g.

     `"""A\w*""".r` is the regular expression for identifiers starting with `A`.

     Definition Classes
       StringLike
145.  def reduce[A1 >: Char](op: (A1, A1) ⇒ A1): A1

     Reduces the elements of this traversable or iterator using the specified associative binary operator.

     Reduces the elements of this traversable or iterator using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     A1

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

       The result of applying reduce operator `op` between all the elements if the traversable or iterator is nonempty.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Exceptions thrown

       `UnsupportedOperationException` if this traversable or iterator is empty.

146.  def reduceLeft[B >: Char](op: (B, Char) ⇒ B): B

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

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

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this sequence, going left to right:

           op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)

       where `x1, ..., xn` are the elements of this sequence.

     Definition Classes
       IndexedSeqOptimized → TraversableOnce
     Exceptions thrown

       `UnsupportedOperationException` if this sequence is empty.

147.  def reduceLeftOption[B >: Char](op: (B, Char) ⇒ B): Option[B]

     Optionally applies a binary operator to all elements of this traversable or iterator, going left to right.

     Optionally applies a binary operator to all elements of this traversable or iterator, going left to right.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       an option value containing the result of `reduceLeft(op)` if this traversable or iterator is nonempty, `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce
148.  def reduceOption[A1 >: Char](op: (A1, A1) ⇒ A1): Option[A1]

     Reduces the elements of this traversable or iterator, if any, using the specified associative binary operator.

     Reduces the elements of this traversable or iterator, if any, using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     A1

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

       An option value containing result of applying reduce operator `op` between all the elements if the collection is nonempty, and `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce
149.  def reduceRight[B >: Char](op: (Char, B) ⇒ B): B

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

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

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this sequence, going right to left:

           op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

       where `x1, ..., xn` are the elements of this sequence.

     Definition Classes
       IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
     Exceptions thrown

       `UnsupportedOperationException` if this sequence is empty.

150.  def reduceRightOption[B >: Char](op: (Char, B) ⇒ B): Option[B]

     Optionally applies a binary operator to all elements of this traversable or iterator, going right to left.

     Optionally applies a binary operator to all elements of this traversable or iterator, going right to left.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       an option value containing the result of `reduceRight(op)` if this traversable or iterator is nonempty, `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce
151.  def regionMatches(arg0: Boolean, arg1: Int, arg2: String, arg3: Int, arg4: Int): Boolean
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
152.  def regionMatches(arg0: Int, arg1: String, arg2: Int, arg3: Int): Boolean
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
153.  def replace(arg0: CharSequence, arg1: CharSequence): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
154.  def replace(arg0: Char, arg1: Char): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
155.  def replaceAll(arg0: String, arg1: String): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
156.  def replaceAllLiterally(literal: String, replacement: String): String

     Replace all literal occurrences of `literal` with the literal string `replacement`.

     Replace all literal occurrences of `literal` with the literal string `replacement`. This method is equivalent to java.lang.String#replace.

     literal

       the string which should be replaced everywhere it occurs

     replacement

       the replacement string

     returns

       the resulting string

     Definition Classes
       StringLike
157.  def replaceFirst(arg0: String, arg1: String): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
158.  def repr: WrappedString

     The collection of type traversable collection underlying this `TraversableLike` object.

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

     Definition Classes
       TraversableLike → GenTraversableLike
159.  def reverse: WrappedString

     Returns new sequence with elements in reversed order.

     Returns new sequence with elements in reversed order.

     returns

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

     Definition Classes
       IndexedSeqOptimized → SeqLike → GenSeqLike
160.  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 sequence in reversed order

     Definition Classes
       IndexedSeqOptimized → SeqLike
161.  def reverseMap[B](f: (A) ⇒ B): WrappedString[B]

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

     [use case]

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

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

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

       a new wrapped string resulting from applying the given function `f` to each element of this wrapped string and collecting the results in reversed order.

     Definition Classes
       SeqLike → GenSeqLike
      Full Signature

     #### def reverseMap[B, That](f: (Char) ⇒ B)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

162.  def reversed: scala.List[Char]
     Attributes
       protected[this]
     Definition Classes
       TraversableOnce
163.  def runWith[U](action: (Char) ⇒ U): (Int) ⇒ Boolean

     Composes this partial function with an action function which gets applied to results of this partial function.

     Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.

     Note that expression `pf.runWith(action)(x)` is equivalent to

         if(pf isDefinedAt x) { action(pf(x)); true } else false

     except that `runWith` is implemented via `applyOrElse` and thus potentially more efficient. Using `runWith` avoids double evaluation of pattern matchers and guards for partial function literals.

     action

       the action function

     returns

       a function which maps arguments `x` to `isDefinedAt(x)`. The resulting function runs `action(this(x))` where `this` is defined.

     Definition Classes
       PartialFunction
     Since

       2.10

     See also

       `applyOrElse`.

164.  def sameElements(that: GenIterable[A]): Boolean

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

     [use case]

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

     that

       the collection to compare with.

     returns

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

     Definition Classes
       IndexedSeqOptimized → IterableLike → GenIterableLike
      Full Signature

     #### def sameElements[B >: Char](that: GenIterable[B]): Boolean

165.  def scan[B >: Char, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[WrappedString, B, That]): That

     Computes a prefix scan of the elements of the collection.

     Computes a prefix scan of the elements of the collection.

     Note: The neutral element `z` may be applied more than once.

     B

       element type of the resulting collection

     That

       type of the resulting collection

     z

       neutral element for the operator `op`

     op

       the associative operator for the scan

     cbf

       combiner factory which provides a combiner

     returns

       a new traversable collection containing the prefix scan of the elements in this traversable collection

     Definition Classes
       TraversableLike → GenTraversableLike
166.  def scanLeft[B, That](z: B)(op: (B, Char) ⇒ B)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

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

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

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     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 → GenTraversableLike
167.  def scanRight[B, That](z: B)(op: (Char, B) ⇒ B)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

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

     Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     Example:

         List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)

     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 → GenTraversableLike
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) The behavior of `scanRight` has changed. The previous behavior can be reproduced with scanRight.reverse.

168.  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 sequence starting from index `from` such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       IndexedSeqOptimized → SeqLike → GenSeqLike
169.  val self: String
170.  def seq: IndexedSeq[Char]

     A version of this collection with all of the operations implemented sequentially (i.e., in a single-threaded manner).

     A version of this collection with all of the operations implemented sequentially (i.e., in a single-threaded manner).

     This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

     returns

       a sequential view of the collection.

     Definition Classes
       IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
171.  def size: Int

     The size of this sequence, equivalent to `length`.

     The size of this sequence, equivalent to `length`.

     Note: will not terminate for infinite-sized collections.

     returns

       the number of elements in this sequence.

     Definition Classes
       SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
172.  def sizeHintIfCheap: Int

     The size of this sequence, if it can be cheaply computed

     The size of this sequence, if it can be cheaply computed

     returns

       the number of elements in this sequence, or -1 if the size cannot be determined cheaply

     Attributes
       protected[scala.collection]
     Definition Classes
       IndexedSeqLike → GenTraversableOnce
173.  def slice(from: Int, until: Int): WrappedString

     Selects an interval of elements.

     Selects an interval of elements. The returned collection is made up of all elements `x` which satisfy the invariant:

         from <= indexOf(x) < until

     returns

       a wrapped string containing the elements greater than or equal to index `from` extending up to (but not including) index `until` of this wrapped string.

     Definition Classes
       WrappedString → StringLike → IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
174.  def sliding(size: Int, step: Int): Iterator[WrappedString]

     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

     step

       the distance between the first elements of successive groups

     returns

       An iterator producing iterable collections of size `size`, except the last element (which may be the only element) will be truncated if there are fewer than `size` elements remaining to be grouped.

     Definition Classes
       IterableLike
     See also

       scala.collection.Iterator, method `sliding`

175.  def sliding(size: Int): Iterator[WrappedString]

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

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

     size

       the number of elements per group

     returns

       An iterator producing iterable collections of size `size`, except the last element (which may be the only element) will be truncated if there are fewer than `size` elements remaining to be grouped.

     Definition Classes
       IterableLike
     See also

       scala.collection.Iterator, method `sliding`

176.  def sortBy[B](f: (Char) ⇒ B)(implicit ord: math.Ordering[B]): WrappedString

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

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

     B

       the target type of the transformation `f`, and the type where the ordering `ord` is defined.

     f

       the transformation function mapping elements to some other domain `B`.

     ord

       the ordering assumed on domain `B`.

     returns

       a sequence consisting of the elements of this sequence sorted according to the ordering where `x < y` if `ord.lt(f(x), f(y))`.

     Definition Classes
       SeqLike
     Example:

     1.     val words = "The quick brown fox jumped over the lazy dog".split(' ')
            // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]]
            words.sortBy(x => (x.length, x.head))
            res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)

     See also

       scala.math.Ordering Note: will not terminate for infinite-sized collections.

177.  def sortWith(lt: (Char, Char) ⇒ Boolean): WrappedString

     Sorts this sequence according to a comparison function.

     Sorts this sequence according to a comparison function.

     Note: will not terminate for infinite-sized collections.

     The sort is stable. That is, elements that are equal (as determined by `lt`) appear in the same order in the sorted sequence as in the original.

     lt

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

     returns

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

     Definition Classes
       SeqLike
     Example:

     1.     List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
            List("Bob", "John", "Steve", "Tom")

178.  def sorted[B >: Char](implicit ord: math.Ordering[B]): WrappedString

     Sorts this sequence according to an Ordering.

     Sorts this sequence according to an Ordering.

     The sort is stable. That is, elements that are equal (as determined by `lt`) appear in the same order in the sorted sequence as in the original.

     ord

       the ordering to be used to compare elements.

     returns

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

     Definition Classes
       SeqLike
     See also

       scala.math.Ordering

179.  def span(p: (Char) ⇒ Boolean): (WrappedString, WrappedString)

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

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

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

     returns

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

     Definition Classes
       IndexedSeqOptimized → TraversableLike → GenTraversableLike
180.  def split(separators: Array[Char]): Array[String]
     Definition Classes
       StringLike
     Annotations
       @throws( clazz = ... )
181.  def split(separator: Char): Array[String]

     Split this string around the separator character

     Split this string around the separator character

     If this string is the empty string, returns an array of strings that contains a single empty string.

     If this string is not the empty string, returns an array containing the substrings terminated by the start of the string, the end of the string or the separator character, excluding empty trailing substrings

     If the separator character is a surrogate character, only split on matching surrogate characters if they are not part of a surrogate pair

     The behaviour follows, and is implemented in terms of String.split(re: String)

     separator

       the character used as a delimiter

     Definition Classes
       StringLike
     Example:

     1.     "a.b".split('.') //returns Array("a", "b")

            //splitting the empty string always returns the array with a single
            //empty string
            "".split('.') //returns Array("")

            //only trailing empty substrings are removed
            "a.".split('.') //returns Array("a")
            ".a.".split('.') //returns Array("", "a")
            "..a..".split('.') //returns Array("", "", "a")

            //all parts are empty and trailing
            ".".split('.') //returns Array()
            "..".split('.') //returns Array()

            //surrogate pairs
            val high = 0xD852.toChar
            val low = 0xDF62.toChar
            val highstring = high.toString
            val lowstring = low.toString

            //well-formed surrogate pairs are not split
            val highlow = highstring + lowstring
            highlow.split(high) //returns Array(highlow)

            //bare surrogate characters are split
            val bare = "_" + highstring + "_"
            bare.split(high) //returns Array("_", "_")

182.  def splitAt(n: Int): (WrappedString, WrappedString)

     Splits this sequence into two at a given position.

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

     n

       the position at which to split.

     returns

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

     Definition Classes
       IndexedSeqOptimized → TraversableLike → GenTraversableLike
183.  def startsWith[B](that: GenSeq[B], offset: Int): Boolean

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

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

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

     that

       the sequence to test

     offset

       the index where the sequence is searched.

     returns

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

     Definition Classes
       IndexedSeqOptimized → SeqLike → GenSeqLike
184.  def startsWith[B](that: GenSeq[B]): Boolean

     Tests whether this general sequence starts with the given sequence.

     Tests whether this general 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
       GenSeqLike
185.  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 traversable collection. By default the string prefix is the simple name of the collection class traversable collection.

     Definition Classes
       TraversableLike → GenTraversableLike
186.  def stripLineEnd: String

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

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

     A line end character is one of

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

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

     Definition Classes
       StringLike
187.  def stripMargin: String

     For every line in this string:

     For every line in this string:

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

     Definition Classes
       StringLike
188.  def stripMargin(marginChar: Char): String

     For every line in this string:

     For every line in this string:

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

     Definition Classes
       StringLike
189.  def stripPrefix(prefix: String): String

     Returns this string with the given `prefix` stripped.

     Returns this string with the given `prefix` stripped. If this string does not start with `prefix`, it is returned unchanged.

     Definition Classes
       StringLike
190.  def stripSuffix(suffix: String): String

     Returns this string with the given `suffix` stripped.

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

     Definition Classes
       StringLike
191.  def substring(arg0: Int, arg1: Int): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
192.  def substring(arg0: Int): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
193.  def sum: A

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
      Full Signature

     #### def sum[B >: Char](implicit num: Numeric[B]): B

194.  final def synchronized[T0](arg0: ⇒ T0): T0
     Definition Classes
       AnyRef
195.  def tail: WrappedString

     Selects all elements except the first.

     Selects all elements except the first.

     returns

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

     Definition Classes
       IndexedSeqOptimized → TraversableLike → GenTraversableLike
     Exceptions thrown

       ``UnsupportedOperationException`` if the sequence is empty.

196.  def tails: Iterator[WrappedString]

     Iterates over the tails of this traversable collection.

     Iterates over the tails of this traversable collection. The first value will be this traversable collection and the final one will be an empty traversable collection, with the intervening values the results of successive applications of `tail`.

     returns

       an iterator over all the tails of this traversable collection

     Definition Classes
       TraversableLike
     Example:

     1. `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`

197.  def take(n: Int): WrappedString

     Selects first n elements.

     Selects first n elements.

     n

       the number of elements to take from this sequence.

     returns

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

     Definition Classes
       IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
198.  def takeRight(n: Int): WrappedString

     Selects last n elements.

     Selects last n elements.

     n

       the number of elements to take

     returns

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

     Definition Classes
       IndexedSeqOptimized → IterableLike
199.  def takeWhile(p: (Char) ⇒ Boolean): WrappedString

     Takes longest prefix of elements that satisfy a predicate.

     Takes longest prefix of elements that satisfy a predicate.

     returns

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

     Definition Classes
       IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
200.  def thisCollection: WrappedString

     The underlying collection seen as an instance of ``WrappedString``.

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

     Attributes
       protected[this]
     Definition Classes
       WrappedString → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
201.  def to[Col[_]]: Col[A]

     [use case] Converts this wrapped string into another by copying all elements.

     [use case]

     Converts this wrapped string into another by copying all elements.

     Col

       The collection type to build.

     returns

       a new collection containing all elements of this wrapped string.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce
      Full Signature

     #### def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Char, Col[Char]]): Col[Char]

202.  def toArray: Array[A]

     [use case] Converts this wrapped string to an array.

     [use case]

     Converts this wrapped string to an array.

     returns

       an array containing all elements of this wrapped string. An `ClassTag` must be available for the element type of this wrapped string.

     Definition Classes
       StringLike → TraversableOnce → GenTraversableOnce
      Full Signature

     #### def toArray[B >: Char](implicit arg0: ClassTag[B]): Array[B]

203.  def toBoolean: Boolean

     Definition Classes
       StringLike
     Exceptions thrown

       `java.lang.IllegalArgumentException` If the string does not contain a parsable `Boolean`.

204.  def toBuffer[A1 >: Char]: Buffer[A1]

     Uses the contents of this sequence to create a new mutable buffer.

     Uses the contents of this sequence to create a new mutable buffer.

     returns

       a buffer containing all elements of this sequence.

     Definition Classes
       IndexedSeqLike → TraversableOnce → GenTraversableOnce
205.  def toByte: Byte

     Parse as a `Byte` (string must contain only decimal digits and optional leading `-`).

     Parse as a `Byte` (string must contain only decimal digits and optional leading `-`).

     Definition Classes
       StringLike
     Exceptions thrown

       `java.lang.NumberFormatException` If the string does not contain a parsable `Byte`.

206.  def toCharArray(): Array[Char]
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
207.  def toCollection(repr: WrappedString): WrappedString

     A conversion from collections of type `Repr` to ``WrappedString`` objects.

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

     Attributes
       protected[this]
     Definition Classes
       WrappedString → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
208.  def toDouble: Double

     Parse as a `Double` (surrounding whitespace is removed with a `trim`).

     Parse as a `Double` (surrounding whitespace is removed with a `trim`).

     Definition Classes
       StringLike
     Exceptions thrown

       `java.lang.NullPointerException` If the string is null.

       `java.lang.NumberFormatException` If the string does not contain a parsable `Double`.

209.  def toFloat: Float

     Parse as a `Float` (surrounding whitespace is removed with a `trim`).

     Parse as a `Float` (surrounding whitespace is removed with a `trim`).

     Definition Classes
       StringLike
     Exceptions thrown

       `java.lang.NullPointerException` If the string is null.

       `java.lang.NumberFormatException` If the string does not contain a parsable `Float`.

210.  def toIndexedSeq: IndexedSeq[Char]

     Returns this immutable sequence as an indexed sequence.

     Returns this immutable sequence as an indexed sequence.

     A new indexed sequence will not be built; lazy collections will stay lazy.

     returns

       an indexed sequence containing all elements of this immutable sequence.

     Definition Classes
       IndexedSeq → TraversableOnce → GenTraversableOnce
     Annotations
       @deprecatedOverriding( message = ... , since = "2.11.0" )
211.  def toInt: Int

     Parse as an `Int` (string must contain only decimal digits and optional leading `-`).

     Parse as an `Int` (string must contain only decimal digits and optional leading `-`).

     Definition Classes
       StringLike
     Exceptions thrown

       `java.lang.NumberFormatException` If the string does not contain a parsable `Int`.

212.  def toIterable: collection.Iterable[Char]

     Returns this iterable collection as an iterable collection.

     Returns this iterable collection as an iterable collection.

     A new collection will not be built; lazy collections will stay lazy.

     Note: will not terminate for infinite-sized collections.

     returns

       an `Iterable` containing all elements of this iterable collection.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce
213.  def toIterator: Iterator[Char]

     Returns an Iterator over the elements in this iterable collection.

     Returns an Iterator over the elements in this iterable collection. Produces the same result as `iterator`.

     Note: will not terminate for infinite-sized collections.

     returns

       an Iterator containing all elements of this iterable collection.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce
     Annotations
       @deprecatedOverriding( message = ... , since = "2.11.0" )
214.  def toList: scala.List[Char]

     Converts this traversable or iterator to a list.

     Converts this traversable or iterator to a list.

     Note: will not terminate for infinite-sized collections.

     returns

       a list containing all elements of this traversable or iterator.

     Definition Classes
       TraversableOnce → GenTraversableOnce
215.  def toLong: Long

     Parse as a `Long` (string must contain only decimal digits and optional leading `-`).

     Parse as a `Long` (string must contain only decimal digits and optional leading `-`).

     Definition Classes
       StringLike
     Exceptions thrown

       `java.lang.NumberFormatException` If the string does not contain a parsable `Long`.

216.  def toLowerCase(): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
217.  def toLowerCase(arg0: Locale): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
218.  def toMap[T, U]: collection.Map[T, U]

     [use case] Converts this wrapped string to a map.

     [use case]

     Converts this wrapped string to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) 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 of type `immutable.Map[T, U]` containing all key/value pairs of type `(T, U)` of this wrapped string.

     Definition Classes
       TraversableOnce → GenTraversableOnce
      Full Signature

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

219.  def toParArray: ParArray[T]
     Implicit
       This member is added by an implicit conversion from WrappedString to CollectionsHaveToParArray[WrappedString, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (WrappedString) ⇒ GenTraversableOnce[T] is in scope.
     Definition Classes
       CollectionsHaveToParArray
220.  def toSeq: Seq[Char]

     Converts this immutable sequence to a sequence.

     Converts this immutable sequence to a sequence.

     Note: will not terminate for infinite-sized collections.

     A new collection will not be built; in particular, lazy sequences will stay lazy.

     returns

       a sequence containing all elements of this immutable sequence.

     Definition Classes
       Seq → SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
221.  def toSet[B >: Char]: Set[B]

     Converts this traversable or iterator to a set.

     Converts this traversable or iterator to a set.

     Note: will not terminate for infinite-sized collections.

     returns

       a set containing all elements of this traversable or iterator.

     Definition Classes
       TraversableOnce → GenTraversableOnce
222.  def toShort: Short

     Parse as a `Short` (string must contain only decimal digits and optional leading `-`).

     Parse as a `Short` (string must contain only decimal digits and optional leading `-`).

     Definition Classes
       StringLike
     Exceptions thrown

       `java.lang.NumberFormatException` If the string does not contain a parsable `Short`.

223.  def toStream: Stream[Char]

     Converts this iterable collection to a stream.

     Converts this iterable collection to a stream.

     returns

       a stream containing all elements of this iterable collection.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce
224.  def toString(): String

     Converts this wrapped string to a string.

     Converts this wrapped string to a string.

     returns

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

     Definition Classes
       WrappedString → SeqLike → Function1 → TraversableLike → AnyRef → Any
225.  def toTraversable: collection.Traversable[Char]

     Converts this traversable collection to an unspecified Traversable.

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

     Note: will not terminate for infinite-sized collections.

     returns

       a Traversable containing all elements of this traversable collection.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce
     Annotations
       @deprecatedOverriding( message = ... , since = "2.11.0" )
226.  def toUpperCase(): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
227.  def toUpperCase(arg0: Locale): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
228.  def toVector: scala.Vector[Char]

     Converts this traversable or iterator to a Vector.

     Converts this traversable or iterator to a Vector.

     Note: will not terminate for infinite-sized collections.

     returns

       a vector containing all elements of this traversable or iterator.

     Definition Classes
       TraversableOnce → GenTraversableOnce
229.  def transpose[B](implicit asTraversable: (Char) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

     Transposes this collection of traversable collections into a collection of collections.

     Transposes this collection of traversable collections into a collection of collections.

     The resulting collection's type will be guided by the static type of collection. For example:

         val xs = List(
                    Set(1, 2, 3),
                    Set(4, 5, 6)).transpose
         // xs == List(
         //         List(1, 4),
         //         List(2, 5),
         //         List(3, 6))

         val ys = Vector(
                    List(1, 2, 3),
                    List(4, 5, 6)).transpose
         // ys == Vector(
         //         Vector(1, 4),
         //         Vector(2, 5),
         //         Vector(3, 6))

     B

       the type of the elements of each traversable collection.

     asTraversable

       an implicit conversion which asserts that the element type of this collection is a `Traversable`.

     returns

       a two-dimensional collection of collections which has as nth row the nth column of this collection.

     Definition Classes
       GenericTraversableTemplate
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) `transpose` throws an `IllegalArgumentException` if collections are not uniformly sized.

     Exceptions thrown

       `IllegalArgumentException` if all collections in this collection are not of the same size.

230.  def trim(): String
     Implicit
       This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
     Definition Classes
       String
231.  def union(that: collection.Seq[Char]): WrappedString[Char]

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

     [use case]

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

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

     that

       the sequence to add.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
      Full Signature

     #### def union[B >: Char, That](that: GenSeq[B])(implicit bf: CanBuildFrom[WrappedString, B, That]): That

232.  def unzip[A1, A2](implicit asPair: (Char) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

     Converts this collection of pairs into two collections of the first and second half of each pair.

     Converts this collection of pairs into two collections of the first and second half of each pair.

         val xs = Traversable(
                    (1, "one"),
                    (2, "two"),
                    (3, "three")).unzip
         // xs == (Traversable(1, 2, 3),
         //        Traversable(one, two, three))

     A1

       the type of the first half of the element pairs

     A2

       the type of the second half of the element pairs

     asPair

       an implicit conversion which asserts that the element type of this collection is a pair.

     returns

       a pair of collections, containing the first, respectively second half of each element pair of this collection.

     Definition Classes
       GenericTraversableTemplate
233.  def unzip3[A1, A2, A3](implicit asTriple: (Char) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

     Converts this collection of triples into three collections of the first, second, and third element of each triple.

     Converts this collection of triples into three collections of the first, second, and third element of each triple.

         val xs = Traversable(
                    (1, "one", '1'),
                    (2, "two", '2'),
                    (3, "three", '3')).unzip3
         // xs == (Traversable(1, 2, 3),
         //        Traversable(one, two, three),
         //        Traversable(1, 2, 3))

     A1

       the type of the first member of the element triples

     A2

       the type of the second member of the element triples

     A3

       the type of the third member of the element triples

     asTriple

       an implicit conversion which asserts that the element type of this collection is a triple.

     returns

       a triple of collections, containing the first, second, respectively third member of each element triple of this collection.

     Definition Classes
       GenericTraversableTemplate
234.  def updated(index: Int, elem: A): WrappedString[A]

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

     [use case]

     A copy of this wrapped string with one single replaced element.

     index

       the position of the replacement

     elem

       the replacing element

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
      Full Signature

     #### def updated[B >: Char, That](index: Int, elem: B)(implicit bf: CanBuildFrom[WrappedString, B, That]): That

235.  def view(from: Int, until: Int): SeqView[Char, WrappedString]

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

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

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

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

     from

       the index of the first element of the view

     until

       the index of the element following the view

     returns

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

     Definition Classes
       SeqLike → IterableLike → TraversableLike
236.  def view: SeqView[Char, WrappedString]

     Creates a non-strict view of this sequence.

     Creates a non-strict view of this sequence.

     returns

       a non-strict view of this sequence.

     Definition Classes
       SeqLike → IterableLike → TraversableLike
237.  final def wait(): Unit
     Definition Classes
       AnyRef
     Annotations
       @throws( ... )
238.  final def wait(arg0: Long, arg1: Int): Unit
     Definition Classes
       AnyRef
     Annotations
       @throws( ... )
239.  final def wait(arg0: Long): Unit
     Definition Classes
       AnyRef
     Annotations
       @throws( ... )
240.  def withFilter(p: (Char) ⇒ Boolean): FilterMonadic[Char, WrappedString]

     Creates a non-strict filter of this traversable collection.

     Creates a non-strict filter of this traversable collection.

     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.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     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 traversable collection which satisfy the predicate `p`.

     Definition Classes
       TraversableLike → FilterMonadic
241.  def zip[B](that: GenIterable[B]): WrappedString[(A, B)]

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

     [use case]

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

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

       a new wrapped string containing pairs consisting of corresponding elements of this wrapped string and `that`. The length of the returned collection is the minimum of the lengths of this wrapped string and `that`.

     Definition Classes
       IndexedSeqOptimized → IterableLike → GenIterableLike
      Full Signature

     #### def zip[A1 >: Char, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[WrappedString, (A1, B), That]): That

242.  def zipAll[B](that: collection.Iterable[B], thisElem: A, thatElem: B): WrappedString[(A, B)]

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

     [use case]

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

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     thisElem

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

     thatElem

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

     returns

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

     Definition Classes
       IterableLike → GenIterableLike
      Full Signature

     #### def zipAll[B, A1 >: Char, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[WrappedString, (A1, B), That]): That

243.  def zipWithIndex: WrappedString[(A, Int)]

     [use case] Zips this wrapped string with its indices.

     [use case]

     Zips this wrapped string with its indices.

     returns

       A new wrapped string containing pairs consisting of all elements of this wrapped string paired with their index. Indices start at `0`.

     Definition Classes
       IndexedSeqOptimized → IterableLike → GenIterableLike
      Full Signature

     #### def zipWithIndex[A1 >: Char, That](implicit bf: CanBuildFrom[WrappedString, (A1, Int), That]): That

     Example:

     1. `List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))`

244.  def →[B](y: B): (WrappedString, B)
     Implicit
       This member is added by an implicit conversion from WrappedString to ArrowAssoc[WrappedString] performed by method ArrowAssoc in scala.Predef.
     Definition Classes
       ArrowAssoc

### Shadowed Implicit Value Members

1.  final def +(arg0: Any): String
   Implicit
     This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
   Shadowing
     This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
     To access this member you can use a type ascription:

         (wrappedString: String).+(arg0)

   Definition Classes
     String
2.  def +(other: String): String
   Implicit
     This member is added by an implicit conversion from WrappedString to any2stringadd[WrappedString] performed by method any2stringadd in scala.Predef.
   Shadowing
     This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
     To access this member you can use a type ascription:

         (wrappedString: any2stringadd[WrappedString]).+(other)

   Definition Classes
     any2stringadd
3.  def charAt(index: Int): Char
   Implicit
     This member is added by an implicit conversion from WrappedString to SeqCharSequence performed by method SeqCharSequence in scala.Predef.
   Shadowing
     This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
     To access this member you can use a type ascription:

         (wrappedString: SeqCharSequence).charAt(index)

   Definition Classes
     SeqCharSequence → CharSequence
4.  def charAt(arg0: Int): Char
   Implicit
     This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
   Shadowing
     This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
     To access this member you can use a type ascription:

         (wrappedString: String).charAt(arg0)

   Definition Classes
     String → CharSequence
5.  def chars(): IntStream
   Implicit
     This member is added by an implicit conversion from WrappedString to SeqCharSequence performed by method SeqCharSequence in scala.Predef.
   Shadowing
     This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
     To access this member you can use a type ascription:

         (wrappedString: SeqCharSequence).chars()

   Definition Classes
     CharSequence
6.  def chars(): IntStream
   Implicit
     This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
   Shadowing
     This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
     To access this member you can use a type ascription:

         (wrappedString: String).chars()

   Definition Classes
     CharSequence
7.  def codePoints(): IntStream
   Implicit
     This member is added by an implicit conversion from WrappedString to SeqCharSequence performed by method SeqCharSequence in scala.Predef.
   Shadowing
     This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
     To access this member you can use a type ascription:

         (wrappedString: SeqCharSequence).codePoints()

   Definition Classes
     CharSequence
8.  def codePoints(): IntStream
   Implicit
     This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
   Shadowing
     This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
     To access this member you can use a type ascription:

         (wrappedString: String).codePoints()

   Definition Classes
     CharSequence
9.  def compareTo(arg0: String): Int
   Implicit
     This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (wrappedString: String).compareTo(arg0)

   Definition Classes
     String → Comparable
10.  def contains(arg0: CharSequence): Boolean
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).contains(arg0)

    Definition Classes
      String
11.  def endsWith(arg0: String): Boolean
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).endsWith(arg0)

    Definition Classes
      String
12.  def equals(arg0: Any): Boolean

    The equality method for reference types.

    The equality method for reference types. Default implementation delegates to `eq`.

    See also `equals` in scala.Any.

    returns

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

    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).equals(arg0)

    Definition Classes
      String → AnyRef → Any
13.  def filter(p: (Char) ⇒ Boolean): TraversableOnce[Char]
    Implicit
      This member is added by an implicit conversion from WrappedString to MonadOps[Char] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: MonadOps[Char]).filter(p)

    Definition Classes
      MonadOps
14.  def flatMap[B](f: (Char) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
      This member is added by an implicit conversion from WrappedString to MonadOps[Char] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: MonadOps[Char]).flatMap(f)

    Definition Classes
      MonadOps
15.  def hashCode(): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

      the hash code value for this object.

    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).hashCode()

    Definition Classes
      String → AnyRef → Any
16.  def indexOf(arg0: String, arg1: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).indexOf(arg0, arg1)

    Definition Classes
      String
17.  def indexOf(arg0: String): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).indexOf(arg0)

    Definition Classes
      String
18.  def indexOf(arg0: Int, arg1: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).indexOf(arg0, arg1)

    Definition Classes
      String
19.  def indexOf(arg0: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).indexOf(arg0)

    Definition Classes
      String
20.  def isEmpty(): Boolean
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).isEmpty()

    Definition Classes
      String
21.  def lastIndexOf(arg0: String, arg1: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).lastIndexOf(arg0, arg1)

    Definition Classes
      String
22.  def lastIndexOf(arg0: String): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).lastIndexOf(arg0)

    Definition Classes
      String
23.  def lastIndexOf(arg0: Int, arg1: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).lastIndexOf(arg0, arg1)

    Definition Classes
      String
24.  def lastIndexOf(arg0: Int): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).lastIndexOf(arg0)

    Definition Classes
      String
25.  def length(): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to SeqCharSequence performed by method SeqCharSequence in scala.Predef.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: SeqCharSequence).length()

    Definition Classes
      SeqCharSequence → CharSequence
26.  def length(): Int
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).length()

    Definition Classes
      String → CharSequence
27.  def map[B](f: (Char) ⇒ B): TraversableOnce[B]
    Implicit
      This member is added by an implicit conversion from WrappedString to MonadOps[Char] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: MonadOps[Char]).map(f)

    Definition Classes
      MonadOps
28.  def split(arg0: String): Array[String]
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).split(arg0)

    Definition Classes
      String
29.  def split(arg0: String, arg1: Int): Array[String]
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).split(arg0, arg1)

    Definition Classes
      String
30.  def startsWith(arg0: String): Boolean
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).startsWith(arg0)

    Definition Classes
      String
31.  def startsWith(arg0: String, arg1: Int): Boolean
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).startsWith(arg0, arg1)

    Definition Classes
      String
32.  def subSequence(start: Int, end: Int): CharSequence
    Implicit
      This member is added by an implicit conversion from WrappedString to SeqCharSequence performed by method SeqCharSequence in scala.Predef.
    Shadowing
      This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
      To access this member you can use a type ascription:

          (wrappedString: SeqCharSequence).subSequence(start, end)

    Definition Classes
      SeqCharSequence → CharSequence
33.  def subSequence(arg0: Int, arg1: Int): CharSequence
    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
      To access this member you can use a type ascription:

          (wrappedString: String).subSequence(arg0, arg1)

    Definition Classes
      String → CharSequence
34.  def toString(): String

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

      a String representation of the object.

    Implicit
      This member is added by an implicit conversion from WrappedString to SeqCharSequence performed by method SeqCharSequence in scala.Predef.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: SeqCharSequence).toString()

    Definition Classes
      SeqCharSequence → CharSequence → AnyRef → Any
35.  def toString(): String

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

      a String representation of the object.

    Implicit
      This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: String).toString()

    Definition Classes
      String → CharSequence → AnyRef → Any
36.  def withFilter(p: (Char) ⇒ Boolean): Iterator[Char]
    Implicit
      This member is added by an implicit conversion from WrappedString to MonadOps[Char] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (wrappedString: MonadOps[Char]).withFilter(p)

    Definition Classes
      MonadOps

### Deprecated Value Members

1.  def getBytes(arg0: Int, arg1: Int, arg2: Array[Byte], arg3: Int): Unit
   Implicit
     This member is added by an implicit conversion from WrappedString to String performed by method unwrapString in scala.LowPriorityImplicits.
   Definition Classes
     String
   Annotations
     @Deprecated @deprecated
   Deprecated

     (Since version ) see corresponding Javadoc for more information.

2.  def linesIterator: Iterator[String]

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

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

   Definition Classes
     StringLike
   Annotations
     @deprecated
   Deprecated

     (Since version 2.11.0) use `lines` instead

### Inherited from StringLike[WrappedString]

### Inherited from math.Ordered[String]

### Inherited from Comparable[String]

### Inherited from IndexedSeqOptimized[Char, WrappedString]

### Inherited from IndexedSeq[Char]

### Inherited from collection.IndexedSeq[Char]

### Inherited from IndexedSeqLike[Char, WrappedString]

### Inherited from Seq[Char]

### Inherited from Iterable[Char]

### Inherited from Traversable[Char]

### Inherited from Immutable

### Inherited from AbstractSeq[Char]

### Inherited from collection.Seq[Char]

### Inherited from SeqLike[Char, WrappedString]

### Inherited from GenSeq[Char]

### Inherited from GenSeqLike[Char, WrappedString]

### Inherited from PartialFunction[Int, Char]

### Inherited from (Int) ⇒ Char

### Inherited from AbstractIterable[Char]

### Inherited from collection.Iterable[Char]

### Inherited from IterableLike[Char, WrappedString]

### Inherited from Equals

### Inherited from GenIterable[Char]

### Inherited from GenIterableLike[Char, WrappedString]

### Inherited from AbstractTraversable[Char]

### Inherited from collection.Traversable[Char]

### Inherited from GenTraversable[Char]

### Inherited from GenericTraversableTemplate[Char, IndexedSeq]

### Inherited from TraversableLike[Char, WrappedString]

### Inherited from GenTraversableLike[Char, WrappedString]

### Inherited from Parallelizable[Char, ParSeq[Char]]

### Inherited from TraversableOnce[Char]

### Inherited from GenTraversableOnce[Char]

### Inherited from FilterMonadic[Char, WrappedString]

### Inherited from HasNewBuilder[Char, WrappedString]

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion SeqCharSequence from WrappedString to SeqCharSequence

### Inherited by implicit conversion unwrapString from WrappedString to String

### Inherited by implicit conversion CollectionsHaveToParArray from WrappedString to CollectionsHaveToParArray[WrappedString, T]

### Inherited by implicit conversion MonadOps from WrappedString to MonadOps[Char]

### Inherited by implicit conversion any2stringadd from WrappedString to any2stringadd[WrappedString]

### Inherited by implicit conversion StringFormat from WrappedString to StringFormat[WrappedString]

### Inherited by implicit conversion Ensuring from WrappedString to Ensuring[WrappedString]

### Inherited by implicit conversion ArrowAssoc from WrappedString to ArrowAssoc[WrappedString]

### Inherited by implicit conversion alternateImplicit from WrappedString to ForceImplicitAmbiguity

### Ungrouped