* The class String includes methods for examining
* individual characters of the sequence, for comparing strings, for
* searching strings, for extracting substrings, and for creating a
* copy of a string with all characters translated to uppercase or to
* lowercase. Case mapping relies heavily on the information provided
* by the Unicode Consortium's Unicode 3.0 specification. The
* specification's UnicodeData.txt and SpecialCasing.txt files are
* used extensively to provide case mapping.
*

* The Java language provides special support for the string
* concatenation operator ( + ), and for conversion of
* other objects to strings. String concatenation is implemented
* through the StringBuffer class and its
* append method.
* String conversions are implemented through the method
* toString, defined by Object and
* inherited by all classes in Java. For additional information on
* string concatenation and conversion, see Gosling, Joy, and Steele,
* The Java Language Specification.
*
*

* The String is written by method DataOutput.writeUTF.
* A new handle is generated to refer to all future references to the
* string instance within the stream.
*/
private static final ObjectStreamField[] serialPersistentFields =
new ObjectStreamField[0];
/**
* Initializes a newly created String object so that it
* represents an empty character sequence. Note that use of this
* constructor is unnecessary since Strings are immutable.
*/
public String() {
value = new char[0];
}
/**
* Initializes a newly created String object so that it
* represents the same sequence of characters as the argument; in other
* words, the newly created string is a copy of the argument string. Unless
* an explicit copy of original is needed, use of this
* constructor is unnecessary since Strings are immutable.
*
* @param original a String.
*/
public String(String original) {
this.count = original.count;
if (original.value.length > this.count) {
// The array representing the String is bigger than the new
// String itself. Perhaps this constructor is being called
// in order to trim the baggage, so make a copy of the array.
this.value = new char[this.count];
System.arraycopy(original.value, original.offset,
this.value, 0, this.count);
} else {
// The array representing the String is the same
// size as the String, so no point in making a copy.
this.value = original.value;
}
}
/**
* Allocates a new String so that it represents the
* sequence of characters currently contained in the character array
* argument. The contents of the character array are copied; subsequent
* modification of the character array does not affect the newly created
* string.
*
* @param value the initial value of the string.
*/
public String(char value[]) {
this.count = value.length;
this.value = new char[count];
System.arraycopy(value, 0, this.value, 0, count);
}
/**
* Allocates a new String that contains characters from
* a subarray of the character array argument. The offset
* argument is the index of the first character of the subarray and
* the count argument specifies the length of the
* subarray. The contents of the subarray are copied; subsequent
* modification of the character array does not affect the newly
* created string.
*
* @param value array that is the source of characters.
* @param offset the initial offset.
* @param count the length.
* @exception IndexOutOfBoundsException if the offset
* and count arguments index characters outside
* the bounds of the value array.
*/
public String(char value[], int offset, int count) {
if (offset < 0) {
throw new StringIndexOutOfBoundsException(offset);
}
if (count < 0) {
throw new StringIndexOutOfBoundsException(count);
}
// Note: offset or count might be near -1>>>1.
if (offset > value.length - count) {
throw new StringIndexOutOfBoundsException(offset + count);
}
this.value = new char[count];
this.count = count;
System.arraycopy(value, offset, this.value, 0, count);
}
/**
* Allocates a new String constructed from a subarray
* of an array of 8-bit integer values.
*

* The offset argument is the index of the first byte
* of the subarray, and the count argument specifies the
* length of the subarray.
*

*
* @deprecated This method does not properly convert bytes into characters.
* As of JDK 1.1, the preferred way to do this is via the
* String constructors that take a charset name or
* that use the platform's default charset.
*
* @param ascii the bytes to be converted to characters.
* @param hibyte the top 8 bits of each 16-bit Unicode character.
* @see java.lang.String#String(byte[], int, int, java.lang.String)
* @see java.lang.String#String(byte[], int, int)
* @see java.lang.String#String(byte[], java.lang.String)
* @see java.lang.String#String(byte[])
*/
public String(byte ascii[], int hibyte) {
this(ascii, hibyte, 0, ascii.length);
}
/* Common private utility method used to bounds check the byte array
* and requested offset & length values used by the String(byte[],..)
* constructors.
*/
private static void checkBounds(byte[] bytes, int offset, int length) {
if (length < 0)
throw new StringIndexOutOfBoundsException(length);
if (offset < 0)
throw new StringIndexOutOfBoundsException(offset);
if (offset > bytes.length - length)
throw new StringIndexOutOfBoundsException(offset + length);
}
/**
* Constructs a new String by decoding the specified subarray of
* bytes using the specified charset. The length of the new
* String is a function of the charset, and hence may not be equal
* to the length of the subarray.
*
*

The behavior of this constructor when the given bytes are not valid
* in the given charset is unspecified. The {@link
* java.nio.charset.CharsetDecoder} class should be used when more control
* over the decoding process is required.
*
* @param bytes the bytes to be decoded into characters
* @param offset the index of the first byte to decode
* @param length the number of bytes to decode
* @param charsetName the name of a supported
* {@link java.nio.charset.Charset charset}
* @throws UnsupportedEncodingException
* if the named charset is not supported
* @throws IndexOutOfBoundsException
* if the offset and length arguments
* index characters outside the bounds of the bytes
* array
* @since JDK1.1
*/
public String(byte bytes[], int offset, int length, String charsetName)
throws UnsupportedEncodingException
{
if (charsetName == null)
throw new NullPointerException("charsetName");
checkBounds(bytes, offset, length);
value = StringCoding.decode(charsetName, bytes, offset, length);
count = value.length;
}
/**
* Constructs a new String by decoding the specified array of
* bytes using the specified charset. The length of the new
* String is a function of the charset, and hence may not be equal
* to the length of the byte array.
*
*

The behavior of this constructor when the given bytes are not valid
* in the given charset is unspecified. The {@link
* java.nio.charset.CharsetDecoder} class should be used when more control
* over the decoding process is required.
*
* @param bytes the bytes to be decoded into characters
* @param charsetName the name of a supported
* {@link java.nio.charset.Charset

charset}
*
* @exception UnsupportedEncodingException
* If the named charset is not supported
* @since JDK1.1
*/
public String(byte bytes[], String charsetName)
throws UnsupportedEncodingException
{
this(bytes, 0, bytes.length, charsetName);
}
/**
* Constructs a new String by decoding the specified subarray of
* bytes using the platform's default charset. The length of the new
* String is a function of the charset, and hence may not be equal
* to the length of the subarray.
*
*

The behavior of this constructor when the given bytes are not valid
* in the default charset is unspecified. The {@link
* java.nio.charset.CharsetDecoder} class should be used when more control
* over the decoding process is required.
*
* @param bytes the bytes to be decoded into characters
* @param offset the index of the first byte to decode
* @param length the number of bytes to decode
* @throws IndexOutOfBoundsException
* if the offset and the length
* arguments index characters outside the bounds of the
* bytes array
* @since JDK1.1
*/
public String(byte bytes[], int offset, int length) {
checkBounds(bytes, offset, length);
value = StringCoding.decode(bytes, offset, length);
count = value.length;
}
/**
* Constructs a new String by decoding the specified array of
* bytes using the platform's default charset. The length of the new
* String is a function of the charset, and hence may not be equal
* to the length of the byte array.
*
*

The behavior of this constructor when the given bytes are not valid
* in the default charset is unspecified. The {@link
* java.nio.charset.CharsetDecoder} class should be used when more control
* over the decoding process is required.
*
* @param bytes the bytes to be decoded into characters
* @since JDK1.1
*/
public String(byte bytes[]) {
this(bytes, 0, bytes.length);
}
/**
* Allocates a new string that contains the sequence of characters
* currently contained in the string buffer argument. The contents of
* the string buffer are copied; subsequent modification of the string
* buffer does not affect the newly created string.
*
* @param buffer a StringBuffer.
*/
public String (StringBuffer buffer) {
synchronized(buffer) {
buffer.setShared();
this.value = buffer.getValue();
this.offset = 0;
this.count = buffer.length();
}
}
// Package private constructor which shares value array for speed.
String(int offset, int count, char value[]) {
this.value = value;
this.offset = offset;
this.count = count;
}
/**
* Returns the length of this string.
* The length is equal to the number of 16-bit
* Unicode characters in the string.
*
* @return the length of the sequence of characters represented by this
* object.
*/
public int length() {
return count;
}
/**
* Returns the character at the specified index. An index ranges
* from 0 to length() - 1. The first character
* of the sequence is at index 0, the next at index
* 1, and so on, as for array indexing.
*
* @param index the index of the character.
* @return the character at the specified index of this string.
* The first character is at index 0.
* @exception IndexOutOfBoundsException if the index
* argument is negative or not less than the length of this
* string.
*/
public char charAt(int index) {
if ((index < 0) || (index >= count)) {
throw new StringIndexOutOfBoundsException(index);
}
return value[index + offset];
}
/**
* Copies characters from this string into the destination character
* array.
*

* The first character to be copied is at index srcBegin;
* the last character to be copied is at index srcEnd-1
* (thus the total number of characters to be copied is
* srcEnd-srcBegin). The characters are copied into the
* subarray of dst starting at index dstBegin
* and ending at index:
*

* dstbegin + (srcEnd-srcBegin) - 1
*

*
* @param srcBegin index of the first character in the string
* to copy.
* @param srcEnd index after the last character in the string
* to copy.
* @param dst the destination array.
* @param dstBegin the start offset in the destination array.
* @exception IndexOutOfBoundsException If any of the following
* is true:
*

* The first character to be copied is at index srcBegin;
* the last character to be copied is at index srcEnd-1.
* The total number of characters to be copied is
* srcEnd-srcBegin. The characters, converted to bytes,
* are copied into the subarray of dst starting at index
* dstBegin and ending at index:
*

* dstbegin + (srcEnd-srcBegin) - 1
*

*
* @deprecated This method does not properly convert characters into bytes.
* As of JDK 1.1, the preferred way to do this is via the
* the getBytes() method, which uses the platform's default
* charset.
*
* @param srcBegin index of the first character in the string
* to copy.
* @param srcEnd index after the last character in the string
* to copy.
* @param dst the destination array.
* @param dstBegin the start offset in the destination array.
* @exception IndexOutOfBoundsException if any of the following
* is true:
*

The behavior of this method when this string cannot be encoded in
* the given charset is unspecified. The {@link
* java.nio.charset.CharsetEncoder} class should be used when more control
* over the encoding process is required.
*
* @param charsetName
* the name of a supported
* {@link java.nio.charset.Charset

* Two characters c1 and c2 are considered
* the same, ignoring case if at least one of the following is true:
*

The two characters are the same (as compared by the
* == operator).
*

Applying the method {@link java.lang.Character#toUpperCase(char)}
* to each character produces the same result.
*

Applying the method {@link java.lang.Character#toLowerCase(char)}
* to each character produces the same result.

*
* @param anotherString the String to compare this
* String against.
* @return true if the argument is not null
* and the Strings are equal,
* ignoring case; false otherwise.
* @see #equals(Object)
* @see java.lang.Character#toLowerCase(char)
* @see java.lang.Character#toUpperCase(char)
*/
public boolean equalsIgnoreCase(String anotherString) {
return (this == anotherString) ? true :
(anotherString != null) && (anotherString.count == count) &&
regionMatches(true, 0, anotherString, 0, count);
}
/**
* Compares two strings lexicographically.
* The comparison is based on the Unicode value of each character in
* the strings. The character sequence represented by this
* String object is compared lexicographically to the
* character sequence represented by the argument string. The result is
* a negative integer if this String object
* lexicographically precedes the argument string. The result is a
* positive integer if this String object lexicographically
* follows the argument string. The result is zero if the strings
* are equal; compareTo returns 0 exactly when
* the {@link #equals(Object)} method would return true.
*

* This is the definition of lexicographic ordering. If two strings are
* different, then either they have different characters at some index
* that is a valid index for both strings, or their lengths are different,
* or both. If they have different characters at one or more index
* positions, let k be the smallest such index; then the string
* whose character at position k has the smaller value, as
* determined by using the < operator, lexicographically precedes the
* other string. In this case, compareTo returns the
* difference of the two character values at position k in
* the two string -- that is, the value:
*

* this.charAt(k)-anotherString.charAt(k)
*

* If there is no index position at which they differ, then the shorter
* string lexicographically precedes the longer string. In this case,
* compareTo returns the difference of the lengths of the
* strings -- that is, the value:
*

with normalized versions of the strings
* where case differences have been eliminated by calling
* Character.toLowerCase(Character.toUpperCase(character)) on
* each character.
*

* Note that this method does not take locale into account,
* and will result in an unsatisfactory ordering for certain locales.
* The java.text package provides collators to allow
* locale-sensitive ordering.
*
* @param str the String to be compared.
* @return a negative integer, zero, or a positive integer as the
* the specified String is greater than, equal to, or less
* than this String, ignoring case considerations.
* @see java.text.Collator#compare(String, String)
* @since 1.2
*/
public int compareToIgnoreCase(String str) {
return CASE_INSENSITIVE_ORDER.compare(this, str);
}
/**
* Tests if two string regions are equal.
*

* A substring of this String object is compared to a substring
* of the argument other. The result is true if these substrings
* represent identical character sequences. The substring of this
* String object to be compared begins at index toffset
* and has length len. The substring of other to be compared
* begins at index ooffset and has length len. The
* result is false if and only if at least one of the following
* is true:
*

toffset is negative.
*

ooffset is negative.
*

toffset+len is greater than the length of this
* String object.
*

ooffset+len is greater than the length of the other
* argument.
*

There is some nonnegative integer k less than len
* such that:
* this.charAt(toffset+k) != other.charAt(ooffset+k)
*

* A substring of this String object is compared to a substring
* of the argument other. The result is true if these
* substrings represent character sequences that are the same, ignoring
* case if and only if ignoreCase is true. The substring of
* this String object to be compared begins at index
* toffset and has length len. The substring of
* other to be compared begins at index ooffset and
* has length len. The result is false if and only if
* at least one of the following is true:
*

toffset is negative.
*

ooffset is negative.
*

toffset+len is greater than the length of this
* String object.
*

ooffset+len is greater than the length of the other
* argument.
*

ignoreCase is false and there is some nonnegative
* integer k less than len such that:
*

* this.charAt(toffset+k) != other.charAt(ooffset+k)
*

*

ignoreCase is true and there is some nonnegative
* integer k less than len such that:
*

*/
public boolean startsWith(String prefix, int toffset) {
char ta[] = value;
int to = offset + toffset;
char pa[] = prefix.value;
int po = prefix.offset;
int pc = prefix.count;
// Note: toffset might be near -1>>>1.
if ((toffset < 0) || (toffset > count - pc)) {
return false;
}
while (--pc >= 0) {
if (ta[to++] != pa[po++]) {
return false;
}
}
return true;
}
/**
* Tests if this string starts with the specified prefix.
*
* @param prefix the prefix.
* @return true if the character sequence represented by the
* argument is a prefix of the character sequence represented by
* this string; false otherwise.
* Note also that true will be returned if the
* argument is an empty string or is equal to this
* String object as determined by the
* {@link #equals(Object)} method.
* @since 1. 0
*/
public boolean startsWith(String prefix) {
return startsWith(prefix, 0);
}
/**
* Tests if this string ends with the specified suffix.
*
* @param suffix the suffix.
* @return true if the character sequence represented by the
* argument is a suffix of the character sequence represented by
* this object; false otherwise. Note that the
* result will be true if the argument is the
* empty string or is equal to this String object
* as determined by the {@link #equals(Object)} method.
*/
public boolean endsWith(String suffix) {
return startsWith(suffix, count - suffix.count);
}
/**
* Returns a hash code for this string. The hash code for a
* String object is computed as
*

* s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]
*

* using int arithmetic, where s[i] is the
* ith character of the string, n is the length of
* the string, and ^ indicates exponentiation.
* (The hash value of the empty string is zero.)
*
* @return a hash code value for this object.
*/
public int hashCode() {
int h = hash;
if (h == 0) {
int off = offset;
char val[] = value;
int len = count;
for (int i = 0; i < len; i++) {
h = 31*h + val[off++];
}
hash = h;
}
return h;
}
/**
* Returns the index within this string of the first occurrence of the
* specified character. If a character with value ch occurs
* in the character sequence represented by this String
* object, then the index of the first such occurrence is returned --
* that is, the smallest value k such that:
*

* this.charAt(k) == ch
*

* is true. If no such character occurs in this string,
* then -1 is returned.
*
* @param ch a character.
* @return the index of the first occurrence of the character in the
* character sequence represented by this object, or
* -1 if the character does not occur.
*/
public int indexOf(int ch) {
return indexOf(ch, 0);
}
/**
* Returns the index within this string of the first occurrence of the
* specified character, starting the search at the specified index.
*

* If a character with value ch occurs in the character
* sequence represented by this String object at an index
* no smaller than fromIndex, then the index of the first
* such occurrence is returned--that is, the smallest value k
* such that:
*

* (this.charAt(k) == ch) && (k >= fromIndex)
*

* is true. If no such character occurs in this string at or after
* position fromIndex, then -1 is returned.
*

* There is no restriction on the value of fromIndex. If it
* is negative, it has the same effect as if it were zero: this entire
* string may be searched. If it is greater than the length of this
* string, it has the same effect as if it were equal to the length of
* this string: -1 is returned.
*
* @param ch a character.
* @param fromIndex the index to start the search from.
* @return the index of the first occurrence of the character in the
* character sequence represented by this object that is greater
* than or equal to fromIndex, or -1
* if the character does not occur.
*/
public int indexOf(int ch, int fromIndex) {
int max = offset + count;
char v[] = value;
if (fromIndex < 0) {
fromIndex = 0;
} else if (fromIndex >= count) {
// Note: fromIndex might be near -1>>>1.
return -1;
}
for (int i = offset + fromIndex ; i < max ; i++) {
if (v[i] == ch) {
return i - offset;
}
}
return -1;
}
/**
* Returns the index within this string of the last occurrence of the
* specified character. That is, the index returned is the largest
* value k such that:
*

* this.charAt(k) == ch
*

* is true.
* The String is searched backwards starting at the last character.
*
* @param ch a character.
* @return the index of the last occurrence of the character in the
* character sequence represented by this object, or
* -1 if the character does not occur.
*/
public int lastIndexOf(int ch) {
return lastIndexOf(ch, count - 1);
}
/**
* Returns the index within this string of the last occurrence of the
* specified character, searching backward starting at the specified
* index. That is, the index returned is the largest value k
* such that:
*

* this.charAt(k) == ch) && (k <= fromIndex)
*

* is true.
*
* @param ch a character.
* @param fromIndex the index to start the search from. There is no
* restriction on the value of fromIndex. If it is
* greater than or equal to the length of this string, it has
* the same effect as if it were equal to one less than the
* length of this string: this entire string may be searched.
* If it is negative, it has the same effect as if it were -1:
* -1 is returned.
* @return the index of the last occurrence of the character in the
* character sequence represented by this object that is less
* than or equal to fromIndex, or -1
* if the character does not occur before that point.
*/
public int lastIndexOf(int ch, int fromIndex) {
int min = offset;
char v[] = value;
for (int i = offset + ((fromIndex >= count) ? count - 1 : fromIndex) ; i >= min ; i--) {
if (v[i] == ch) {
return i - offset;
}
}
return -1;
}
/**
* Returns the index within this string of the first occurrence of the
* specified substring. The integer returned is the smallest value
* k such that:
*

* this.startsWith(str, k)
*

* is true.
*
* @param str any string.
* @return if the string argument occurs as a substring within this
* object, then the index of the first character of the first
* such substring is returned; if it does not occur as a
* substring, -1 is returned.
*/
public int indexOf(String str) {
return indexOf(str, 0);
}
/**
* Returns the index within this string of the first occurrence of the
* specified substring, starting at the specified index. The integer
* returned is the smallest value k for which:
*

* is true.
*
* @param str the substring to search for.
* @return if the string argument occurs one or more times as a substring
* within this object, then the index of the first character of
* the last such substring is returned. If it does not occur as
* a substring, -1 is returned.
*/
public int lastIndexOf(String str) {
return lastIndexOf(str, count);
}
/**
* Returns the index within this string of the last occurrence of the
* specified substring, searching backward starting at the specified index.
* The integer returned is the largest value k such that:
*

*
* @param beginIndex the beginning index, inclusive.
* @return the specified substring.
* @exception IndexOutOfBoundsException if
* beginIndex is negative or larger than the
* length of this String object.
*/
public String substring(int beginIndex) {
return substring(beginIndex, count);
}
/**
* Returns a new string that is a substring of this string. The
* substring begins at the specified beginIndex and
* extends to the character at index endIndex - 1.
* Thus the length of the substring is endIndex-beginIndex.
*

* If the length of the argument string is 0, then this
* String object is returned. Otherwise, a new
* String object is created, representing a character
* sequence that is the concatenation of the character sequence
* represented by this String object and the character
* sequence represented by the argument string.

* If the character oldChar does not occur in the
* character sequence represented by this String object,
* then a reference to this String object is returned.
* Otherwise, a new String object is created that
* represents a character sequence identical to the character sequence
* represented by this String object, except that every
* occurrence of oldChar is replaced by an occurrence
* of newChar.
*

The array returned by this method contains each substring of this
* string that is terminated by another substring that matches the given
* expression or is terminated by the end of the string. The substrings in
* the array are in the order in which they occur in this string. If the
* expression does not match any part of the input then the resulting array
* has just one element, namely this string.
*
*

The limit parameter controls the number of times the
* pattern is applied and therefore affects the length of the resulting
* array. If the limit n is greater than zero then the pattern
* will be applied at most n - 1 times, the array's
* length will be no greater than n, and the array's last entry
* will contain all input beyond the last matched delimiter. If n
* is non-positive then the pattern will be applied as many times as
* possible and the array can have any length. If n is zero then
* the pattern will be applied as many times as possible, the array can
* have any length, and trailing empty strings will be discarded.
*
*

The string "boo:and:foo", for example, yields the
* following results with these parameters:
*
*

*

*

Regex

*

Limit

*

Result

*

*

:

*

2

*

{ "boo", "and:foo" }

*

:

*

5

*

{ "boo", "and", "foo" }

*

:

*

-2

*

{ "boo", "and", "foo" }

*

o

*

5

*

{ "b", "", ":and:f", "", "" }

*

o

*

-2

*

{ "b", "", ":and:f", "", "" }

*

o

*

0

*

{ "b", "", ":and:f" }

*

*
*

An invocation of this method of the form
* str.split(regex,n)
* yields the same result as the expression
*
*

This method works as if by invoking the two-argument {@link
* #split(String, int) split} method with the given expression and a limit
* argument of zero. Trailing empty strings are therefore not included in
* the resulting array.
*
*

The string "boo:and:foo", for example, yields the following
* results with these expressions:
*
*

*

*

Regex

*

Result

*

*

:

*

{ "boo", "and", "foo" }

*

o

*

{ "b", "", ":and:f" }

*

*
*
* @param regex
* the delimiting regular expression
*
* @return the array of strings computed by splitting this string
* around matches of the given regular expression
*
* @throws PatternSyntaxException
* if the regular expression's syntax is invalid
*
* @see java.util.regex.Pattern
*
* @since 1.4
* @spec JSR-51
*/
public String[] split(String regex) {
return split(regex, 0);
}
/**
* Converts all of the characters in this String to lower
* case using the rules of the given Locale. Case mappings rely
* heavily on the Unicode specification's character data. Since case
* mappings are not always 1:1 char mappings, the resulting String
* may be a different length than the original String.
*

* @return the String, converted to lowercase.
* @see java.lang.String#toLowerCase(Locale)
*/
public String toLowerCase() {
return toLowerCase(Locale.getDefault());
}
/**
* Converts all of the characters in this String to upper
* case using the rules of the given Locale. Case mappings rely
* heavily on the Unicode specification's character data. Since case mappings
* are not always 1:1 char mappings, the resulting String may
* be a different length than the original String.
*

* Examples of locale-sensitive and 1:M case mappings are in the following table.
*

* If this String object represents an empty character
* sequence, or the first and last characters of character sequence
* represented by this String object both have codes
* greater than '\u0020' (the space character), then a
* reference to this String object is returned.
*

* Otherwise, if there is no character with a code greater than
* '\u0020' in the string, then a new
* String object representing an empty string is created
* and returned.
*

* Otherwise, let k be the index of the first character in the
* string whose code is greater than '\u0020', and let
* m be the index of the last character in the string whose code
* is greater than '\u0020'. A new String
* object is created, representing the substring of this string that
* begins with the character at index k and ends with the
* character at index m-that is, the result of
* this.substring(k, m+1).
*

* The offset argument is the index of the first
* character of the subarray. The count argument
* specifies the length of the subarray. The contents of the subarray
* are copied; subsequent modification of the character array does not
* affect the newly created string.
*
* @param data the character array.
* @param offset the initial offset into the value of the
* String.
* @param count the length of the value of the String.
* @return a string representing the sequence of characters contained
* in the subarray of the character array argument.
* @exception IndexOutOfBoundsException if offset is
* negative, or count is negative, or
* offset+count is larger than
* data.length.
*/
public static String valueOf(char data[], int offset, int count) {
return new String(data, offset, count);
}
/**
* Returns a String that represents the character sequence in the
* array specified.
*
* @param data the character array.
* @param offset initial offset of the subarray.
* @param count length of the subarray.
* @return a String that contains the characters of the
* specified subarray of the character array.
*/
public static String copyValueOf(char data[], int offset, int count) {
// All public String constructors now copy the data.
return new String(data, offset, count);
}
/**
* Returns a String that represents the character sequence in the
* array specified.
*
* @param data the character array.
* @return a String that contains the characters of the
* character array.
*/
public static String copyValueOf(char data[]) {
return copyValueOf(data, 0, data.length);
}
/**
* Returns the string representation of the boolean argument.
*
* @param b a boolean.
* @return if the argument is true, a string equal to
* "true" is returned; otherwise, a string equal to
* "false" is returned.
*/
public static String valueOf(boolean b) {
return b ? "true" : "false";
}
/**
* Returns the string representation of the char
* argument.
*
* @param c a char.
* @return a string of length 1 containing
* as its single character the argument c.
*/
public static String valueOf(char c) {
char data[] = {c};
return new String(0, 1, data);
}
/**
* Returns the string representation of the int argument.
*

* The representation is exactly the one returned by the
* Integer.toString method of one argument.
*
* @param i an int.
* @return a string representation of the int argument.
* @see java.lang.Integer#toString(int, int)
*/
public static String valueOf(int i) {
return Integer.toString(i, 10);
}
/**
* Returns the string representation of the long argument.
*

* The representation is exactly the one returned by the
* Long.toString method of one argument.
*
* @param l a long.
* @return a string representation of the long argument.
* @see java.lang.Long#toString(long)
*/
public static String valueOf(long l) {
return Long.toString(l, 10);
}
/**
* Returns the string representation of the float argument.
*

* The representation is exactly the one returned by the
* Float.toString method of one argument.
*
* @param f a float.
* @return a string representation of the float argument.
* @see java.lang.Float#toString(float)
*/
public static String valueOf(float f) {
return Float.toString(f);
}
/**
* Returns the string representation of the double argument.
*

* The representation is exactly the one returned by the
* Double.toString method of one argument.
*
* @param d a double.
* @return a string representation of the double argument.
* @see java.lang.Double#toString(double)
*/
public static String valueOf(double d) {
return Double.toString(d);
}
/**
* Returns a canonical representation for the string object.
*

* A pool of strings, initially empty, is maintained privately by the
* class String.
*

* When the intern method is invoked, if the pool already contains a
* string equal to this String object as determined by
* the {@link #equals(Object)} method, then the string from the pool is
* returned. Otherwise, this String object is added to the
* pool and a reference to this String object is returned.
*

* It follows that for any two strings s and t,
* s.intern() == t.intern() is true
* if and only if s.equals(t) is true.
*

* All literal strings and string-valued constant expressions are
* interned. String literals are defined in §3.10.5 of the
* Java Language
* Specification
*
* @return a string that has the same contents as this string, but is
* guaranteed to be from a pool of unique strings.
*/
public native String intern();
}