Test two objects for inequality.

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.

Alias for concat

Alias for concat

Alias for prependedAll

Alias for prependedAll

Alias for prepended

Alias for prepended

Alias for appended

Alias for appended

Alias for appendedAll

Alias for appendedAll

Test two objects for equality. The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

Appends this string to a string builder using a separator string.

Appends this string to a string builder.

A copy of the string with another string appended

A copy of the string with all elements from a collection appended

Get the char at the specified index.

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

Steps over characters in this string. Values are packed in Int for efficiency and compatibility with Java 8 Streams which have an efficient specialization for Int.

Steps over code points in this string.

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

Builds a new String by applying a partial function to all chars of this String on which the function is defined.

Returns a new string containing the chars from this string followed by the chars from the right hand operand.

Returns a new string containing the chars from this string followed by the chars from the right hand operand.

Returns a new collection containing the chars from this string followed by the elements from the right hand operand.

Tests whether this string contains the given character.

Copy chars of this string to an array. Fills the given array xs starting at index start with at most len chars. Copying will stop once either the entire string has been copied, or the end of the array is reached or len chars have been copied.

Copy chars of this string to an array. Fills the given array xs starting at index start. Copying will stop once either the entire string has been copied or the end of the array is reached

Copy chars of this string to an array. Fills the given array xs starting at index 0. Copying will stop once either the entire string has been copied or the end of the array is reached

Drops longest prefix of chars that satisfy a predicate.

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

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

Builds a new string by applying a function to all chars of this string and using the elements of the resulting strings.

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

Folds the chars of this string using the specified associative binary operator.

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

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

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

Apply f to each element for its side effects. Note: [U] parameter needed to help scalac's type inference.

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.

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.

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

Returns the runtime class representation of the object.

Partitions elements in fixed size strings.

Selects the first char of this string.

Optionally selects the first char.

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

Produces the range of all indices of this string.

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

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.

Selects the last char of this string.

Finds index of the last char satisfying some predicate before or at some end index.

Optionally selects the last char.

Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

val xs = List(1, 2, 3)
val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
// res == List(4, 8, 12)

Lines in this string, where a line is terminated by "\n", "\r", "\r\n", or the end of the string. A line may be empty. Line terminators are removed.

Return an iterator of all lines embedded in this string, including trailing line separator characters.

The empty string yields an empty iterator.

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

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

Returns this string

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

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

Tests whether the string is not empty.

Returns a string with a char appended until a given target length is reached.

Returns a collection with an element appended until a given target length is reached.

Applies a function f to each character of the string and returns a pair of strings: the first one made of those characters returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

Example:

val xs = "1one2two3three" partitionMap { c =>
  if (c > 'a') Left(c) else Right(c)
}
// xs == ("onetwothree", "123")

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

Patching at negative indices is the same as patching starting at 0. Patching at indices at or larger than the length of the original string appends the patch to the end. If more values are replaced than actually exist, the excess is ignored.

Produces a new collection where a slice of characters in this string is replaced by another collection.

Patching at negative indices is the same as patching starting at 0. Patching at indices at or larger than the length of the original string appends the patch to the end. If more values are replaced than actually exist, the excess is ignored.

Produces a new collection where a slice of characters in this string is replaced by another collection.

Patching at negative indices is the same as patching starting at 0. Patching at indices at or larger than the length of the original string appends the patch to the end. If more values are replaced than actually exist, the excess is ignored.

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

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.

An iterator yielding chars in reversed order.

Note: xs.reverseIterator is the same as xs.reverse.iterator but implemented more efficiently.

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

from <= indexOf(x) < until

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

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

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)

Splits this string into two at a given position. Note: c splitAt n is equivalent to (c take n, c drop n).

Stepper can be used with Java 8 Streams. This method is equivalent to a call to charStepper. See also codePointStepper.

Strip the trailing line separator from this string if there is one. The line separator is taken as "\n", "\r", or "\r\n".

For every line in this string:

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

For every line in this string:

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

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

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

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

Try to parse as a Boolean

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

Try to parse as a Byte

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

Try to parse as a Double

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

Try to parse as a Float

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

Try to parse as an Int

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

Try to parse as a Long

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

Try to parse as a Short

Returns a string representation of the object.

The default representation is platform dependent.

A copy of this string with one single replaced element.

Creates a non-strict filter of this string.

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

Iterates over combinations. A _combination_ of length n is a subsequence of the original string, with the chars 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.

Computes the multiset difference between this string and another sequence.

Selects all distinct chars of this string ignoring the duplicates.

Selects all distinct chars of this string ignoring the duplicates as determined by == after applying the transforming function f.

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

Computes the multiset intersection between this string and another sequence.

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

Iterates over distinct permutations.

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

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

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

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

Sorts this string according to a comparison function.

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.

Sorts the characters of this string according to an Ordering.

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