* 
* 
* 
* 
String class represents character strings. All
* string literals in Java programs, such as "abc", are
* implemented as instances of this class.
* * Strings are constant; their values cannot be changed after they * are created. String buffers support mutable strings. * Because String objects are immutable they can be shared. For example: *
* String str = "abc"; *
* is equivalent to: *
* char data[] = {'a', 'b', 'c'};
* String str = new String(data);
* * Here are some more examples of how strings can be used: *
* System.out.println("abc");
* String cde = "cde";
* System.out.println("abc" + cde);
* String c = "abc".substring(2,3);
* String d = cde.substring(1, 2);
*
* 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.
*
*
Unless otherwise noted, passing a null argument to a constructor * or method in this class will cause a {@link NullPointerException} to be * thrown. * * @author Lee Boynton * @author Arthur van Hoff * @version 1.152, 02/01/03 * @see java.lang.Object#toString() * @see java.lang.StringBuffer * @see java.lang.StringBuffer#append(boolean) * @see java.lang.StringBuffer#append(char) * @see java.lang.StringBuffer#append(char[]) * @see java.lang.StringBuffer#append(char[], int, int) * @see java.lang.StringBuffer#append(double) * @see java.lang.StringBuffer#append(float) * @see java.lang.StringBuffer#append(int) * @see java.lang.StringBuffer#append(long) * @see java.lang.StringBuffer#append(java.lang.Object) * @see java.lang.StringBuffer#append(java.lang.String) * @see java.nio.charset.Charset * @since JDK1.0 */ public final class String implements java.io.Serializable, Comparable, CharSequence { /** The value is used for character storage. */ private char value[]; /** The offset is the first index of the storage that is used. */ private int offset; /** The count is the number of characters in the String. */ private int count; /** Cache the hash code for the string */ private int hash = 0; /** use serialVersionUID from JDK 1.0.2 for interoperability */ private static final long serialVersionUID = -6849794470754667710L; /** * Class String is special cased within the Serialization Stream Protocol. * * A String instance is written intially into an ObjectOutputStream in the * following format: *
* TC_STRING (utf String)
*
* 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.
*/
/*KML
private static final ObjectStreamField[] serialPersistentFields =
new ObjectStreamField[0];
KML*/
/**
* 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.
*
* Each byte in the subarray is converted to a
* char as specified in the method above.
*
* @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.
* @param offset the initial offset.
* @param count the length.
* @exception IndexOutOfBoundsException if the offset
* or count argument is invalid.
* @see java.lang.String#String(byte[], int)
* @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, int offset, int count) {
checkBounds(ascii, offset, count);
char value[] = new char[count];
this.count = count;
this.value = value;
if (hibyte == 0) {
for (int i = count ; i-- > 0 ;) {
value[i] = (char) (ascii[i + offset] & 0xff);
}
} else {
hibyte <<= 8;
for (int i = count ; i-- > 0 ;) {
value[i] = (char) (hibyte | (ascii[i + offset] & 0xff));
}
}
}
/**
* Allocates a new String containing characters
* constructed from an array of 8-bit integer values. Each character
* cin the resulting string is constructed from the
* corresponding component b in the byte array such that:
*
* c == (char)(((hibyte & 0xff) << 8)
* | (b & 0xff))
* 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 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 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 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
* The first character to be copied is at index
* The first character to be copied is at index 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 The behavior of this method when this string cannot be encoded in
* the default charset is unspecified. The {@link
* java.nio.charset.CharsetEncoder} class should be used when more control
* over the encoding process is required.
*
* @return The resultant byte array
*
* @since JDK1.1
*/
public byte[] getBytes() {
return StringCoding.encode(value, offset, count);
}
/**
* Compares this string to the specified object.
* The result is
* Two characters
* 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,
* Note that this Comparator 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.
*
* @see java.text.Collator#compare(String, String)
* @since 1.2
*/
/* KML
public static final Comparator CASE_INSENSITIVE_ORDER
= new CaseInsensitiveComparator();
private static class CaseInsensitiveComparator
implements Comparator, java.io.Serializable {
// use serialVersionUID from JDK 1.2.2 for interoperability
private static final long serialVersionUID = 8575799808933029326L;
public int compare(Object o1, Object o2) {
String s1 = (String) o1;
String s2 = (String) o2;
int n1=s1.length(), n2=s2.length();
for (int i1=0, i2=0; i1}
* @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.
*
* 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.
*
* charsetoffset 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.
*
* 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.
* 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:
*
*
* @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:
*
* dstbegin + (srcEnd-srcBegin) - 1
*
*/
public void getChars(int srcBegin, int srcEnd, char dst[], int dstBegin) {
if (srcBegin < 0) {
throw new StringIndexOutOfBoundsException(srcBegin);
}
if (srcEnd > count) {
throw new StringIndexOutOfBoundsException(srcEnd);
}
if (srcBegin > srcEnd) {
throw new StringIndexOutOfBoundsException(srcEnd - srcBegin);
}
System.arraycopy(value, offset + srcBegin, dst, dstBegin,
srcEnd - srcBegin);
}
/**
* Copies characters from this string into the destination byte
* array. Each byte receives the 8 low-order bits of the
* corresponding character. The eight high-order bits of each character
* are not copied and do not participate in the transfer in any way.
* srcBegin is negative.
* srcBegin is greater than srcEnd
* srcEnd is greater than the length of this
* string
* dstBegin is negative
* dstBegin+(srcEnd-srcBegin) is larger than
* dst.lengthsrcBegin;
* 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:
*
*
* @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
* dstbegin + (srcEnd-srcBegin) - 1
* 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:
*
*/
public void getBytes(int srcBegin, int srcEnd, byte dst[], int dstBegin) {
if (srcBegin < 0) {
throw new StringIndexOutOfBoundsException(srcBegin);
}
if (srcEnd > count) {
throw new StringIndexOutOfBoundsException(srcEnd);
}
if (srcBegin > srcEnd) {
throw new StringIndexOutOfBoundsException(srcEnd - srcBegin);
}
int j = dstBegin;
int n = offset + srcEnd;
int i = offset + srcBegin;
char[] val = value; /* avoid getfield opcode */
while (i < n) {
dst[j++] = (byte)val[i++];
}
}
/**
* Encodes this String into a sequence of bytes using the
* named charset, storing the result into a new byte array.
*
* srcBegin is negative
* srcBegin is greater than srcEnd
* srcEnd is greater than the length of this
* String
* dstBegin is negative
* dstBegin+(srcEnd-srcBegin) is larger than
* dst.length}
*
* @return The resultant byte array
*
* @exception UnsupportedEncodingException
* If the named charset is not supported
*
* @since JDK1.1
*/
public byte[] getBytes(String charsetName)
throws UnsupportedEncodingException
{
return StringCoding.encode(charsetName, value, offset, count);
}
/**
* Encodes this String into a sequence of bytes using the
* platform's default charset, storing the result into a new byte array.
*
* with normalized versions of the strings
* where case differences have been eliminated by calling
* true if and only if the argument is not
* null and is a String object that represents
* the same sequence of characters as this object.
*
* @param anObject the object to compare this String
* against.
* @return true if the String are equal;
* false otherwise.
* @see java.lang.String#compareTo(java.lang.String)
* @see java.lang.String#equalsIgnoreCase(java.lang.String)
*/
public boolean equals(Object anObject) {
if (this == anObject) {
return true;
}
if (anObject instanceof String) {
String anotherString = (String)anObject;
int n = count;
if (n == anotherString.count) {
char v1[] = value;
char v2[] = anotherString.value;
int i = offset;
int j = anotherString.offset;
while (n-- != 0) {
if (v1[i++] != v2[j++])
return false;
}
return true;
}
}
return false;
}
/**
* Returns true if and only if this String represents
* the same sequence of characters as the specified StringBuffer.
*
* @param sb the StringBuffer to compare to.
* @return true if and only if this String represents
* the same sequence of characters as the specified
* StringBuffer, otherwise false.
* @since 1.4
*/
public boolean contentEquals(StringBuffer sb) {
synchronized(sb) {
if (count != sb.length())
return false;
char v1[] = value;
char v2[] = sb.getValue();
int i = offset;
int j = 0;
int n = count;
while (n-- != 0) {
if (v1[i++] != v2[j++])
return false;
}
}
return true;
}
/**
* Compares this String to another String,
* ignoring case considerations. Two strings are considered equal
* ignoring case if they are of the same length, and corresponding
* characters in the two strings are equal ignoring case.
* c1 and c2 are considered
* the same, ignoring case if at least one of the following is true:
*
*
* @param anotherString the == operator).
* 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.
* compareTo returns the
* difference of the two character values at position k in
* the two string -- that is, the value:
*
* If there is no index position at which they differ, then the shorter
* string lexicographically precedes the longer string. In this case,
*
* this.charAt(k)-anotherString.charAt(k)
* compareTo returns the difference of the lengths of the
* strings -- that is, the value:
*
*
* @param anotherString the
* this.length()-anotherString.length()
* String to be compared.
* @return the value 0 if the argument string is equal to
* this string; a value less than 0 if this string
* is lexicographically less than the string argument; and a
* value greater than 0 if this string is
* lexicographically greater than the string argument.
*/
public int compareTo(String anotherString) {
int len1 = count;
int len2 = anotherString.count;
int n = Math.min(len1, len2);
char v1[] = value;
char v2[] = anotherString.value;
int i = offset;
int j = anotherString.offset;
if (i == j) {
int k = i;
int lim = n + i;
while (k < lim) {
char c1 = v1[k];
char c2 = v2[k];
if (c1 != c2) {
return c1 - c2;
}
k++;
}
} else {
while (n-- != 0) {
char c1 = v1[i++];
char c2 = v2[j++];
if (c1 != c2) {
return c1 - c2;
}
}
}
return len1 - len2;
}
/**
* Compares this String to another Object. If the Object is a String,
* this function behaves like compareTo(String). Otherwise,
* it throws a ClassCastException (as Strings are comparable
* only to other Strings).
*
* @param o the Object to be compared.
* @return the value 0 if the argument is a string
* lexicographically equal to this string; a value less than
* 0 if the argument is a string lexicographically
* greater than this string; and a value greater than
* 0 if the argument is a string lexicographically
* less than this string.
* @exception ClassCastException if the argument is not a
* String.
* @see java.lang.Comparable
* @since 1.2
*/
public int compareTo(Object o) {
return compareTo((String)o);
}
/**
* A Comparator that orders String objects as by
* compareToIgnoreCase. This comparator is serializable.
* 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: *
true if the specified subregion of this string
* exactly matches the specified subregion of the string argument;
* false otherwise.
*/
public boolean regionMatches(int toffset, String other, int ooffset,
int len) {
char ta[] = value;
int to = offset + toffset;
char pa[] = other.value;
int po = other.offset + ooffset;
// Note: toffset, ooffset, or len might be near -1>>>1.
if ((ooffset < 0) || (toffset < 0) || (toffset > (long)count - len)
|| (ooffset > (long)other.count - len)) {
return false;
}
while (len-- > 0) {
if (ta[to++] != pa[po++]) {
return false;
}
}
return true;
}
/**
* 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 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: *
* this.charAt(toffset+k) != other.charAt(ooffset+k)
*
* Character.toLowerCase(this.charAt(toffset+k)) !=
Character.toLowerCase(other.charAt(ooffset+k))
*
* Character.toUpperCase(this.charAt(toffset+k)) !=
* Character.toUpperCase(other.charAt(ooffset+k))
* true, ignore case when comparing
* characters.
* @param toffset the starting offset of the subregion in this
* string.
* @param other the string argument.
* @param ooffset the starting offset of the subregion in the string
* argument.
* @param len the number of characters to compare.
* @return true if the specified subregion of this string
* matches the specified subregion of the string argument;
* false otherwise. Whether the matching is exact
* or case insensitive depends on the ignoreCase
* argument.
*/
public boolean regionMatches(boolean ignoreCase, int toffset,
String other, int ooffset, int len) {
char ta[] = value;
int to = offset + toffset;
char pa[] = other.value;
int po = other.offset + ooffset;
// Note: toffset, ooffset, or len might be near -1>>>1.
if ((ooffset < 0) || (toffset < 0) || (toffset > (long)count - len) ||
(ooffset > (long)other.count - len)) {
return false;
}
while (len-- > 0) {
char c1 = ta[to++];
char c2 = pa[po++];
if (c1 == c2) {
continue;
}
if (ignoreCase) {
// If characters don't match but case may be ignored,
// try converting both characters to uppercase.
// If the results match, then the comparison scan should
// continue.
char u1 = Character.toUpperCase(c1);
char u2 = Character.toUpperCase(c2);
if (u1 == u2) {
continue;
}
// Unfortunately, conversion to uppercase does not work properly
// for the Georgian alphabet, which has strange rules about case
// conversion. So we need to make one last check before
// exiting.
if (Character.toLowerCase(u1) == Character.toLowerCase(u2)) {
continue;
}
}
return false;
}
return true;
}
/**
* Tests if this string starts with the specified prefix beginning
* a specified index.
*
* @param prefix the prefix.
* @param toffset where to begin looking in the string.
* @return true if the character sequence represented by the
* argument is a prefix of the substring of this object starting
* at index toffset; false otherwise.
* The result is false if toffset is
* negative or greater than the length of this
* String object; otherwise the result is the same
* as the result of the expression
*
* this.subString(toffset).startsWith(prefix)
*
*/
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]
* 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
* 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)
* 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
* -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)
* 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)
* 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:
*
* k >= Math.min(fromIndex, str.length()) && this.startsWith(str, k)
* this.length().
* The returned index is the largest value k such that
*
* this.startsWith(str, k)
* -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:
*
* k <= Math.min(fromIndex, str.length()) && this.startsWith(str, k)
* * Examples: *
* "unhappy".substring(2) returns "happy"
* "Harbison".substring(3) returns "bison"
* "emptiness".substring(9) returns "" (an empty string)
* 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.
* * Examples: *
* "hamburger".substring(4, 8) returns "urge"
* "smiles".substring(1, 5) returns "mile"
* beginIndex is negative, or
* endIndex is larger than the length of
* this String object, or
* beginIndex is larger than
* endIndex.
*/
public String substring(int beginIndex, int endIndex) {
if (beginIndex < 0) {
throw new StringIndexOutOfBoundsException(beginIndex);
}
if (endIndex > count) {
throw new StringIndexOutOfBoundsException(endIndex);
}
if (beginIndex > endIndex) {
throw new StringIndexOutOfBoundsException(endIndex - beginIndex);
}
return ((beginIndex == 0) && (endIndex == count)) ? this :
new String(offset + beginIndex, endIndex - beginIndex, value);
}
/**
* Returns a new character sequence that is a subsequence of this sequence.
*
* An invocation of this method of the form * *
* str.subSequence(begin, end)
* str.substring(begin, end)
* 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.
* Examples: *
* "cares".concat("s") returns "caress"
* "to".concat("get").concat("her") returns "together"
* String that is concatenated to the end
* of this String.
* @return a string that represents the concatenation of this object's
* characters followed by the string argument's characters.
*/
public String concat(String str) {
int otherLen = str.length();
if (otherLen == 0) {
return this;
}
char buf[] = new char[count + otherLen];
getChars(0, count, buf, 0);
str.getChars(0, otherLen, buf, count);
return new String(0, count + otherLen, buf);
}
/**
* Returns a new string resulting from replacing all occurrences of
* oldChar in this string with newChar.
*
* 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.
*
* Examples: *
* "mesquite in your cellar".replace('e', 'o')
* returns "mosquito in your collar"
* "the war of baronets".replace('r', 'y')
* returns "the way of bayonets"
* "sparring with a purple porpoise".replace('p', 't')
* returns "starring with a turtle tortoise"
* "JonL".replace('q', 'x') returns "JonL" (no change)
* oldChar with newChar.
*/
public String replace(char oldChar, char newChar) {
if (oldChar != newChar) {
int len = count;
int i = -1;
char[] val = value; /* avoid getfield opcode */
int off = offset; /* avoid getfield opcode */
while (++i < len) {
if (val[off + i] == oldChar) {
break;
}
}
if (i < len) {
char buf[] = new char[len];
for (int j = 0 ; j < i ; j++) {
buf[j] = val[off+j];
}
while (i < len) {
char c = val[off + i];
buf[i] = (c == oldChar) ? newChar : c;
i++;
}
return new String(0, len, buf);
}
}
return this;
}
/**
* Tells whether or not this string matches the given regular expression.
*
* An invocation of this method of the form * str.matches(regex) yields exactly the * same result as the expression * *
{@link java.util.regex.Pattern}.{@link * java.util.regex.Pattern#matches(String,CharSequence) * matches}(regex, str)* * @param regex * the regular expression to which this string is to be matched * * @return true if, and only if, this string matches 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 boolean matches(String regex) { return Pattern.matches(regex, this); } /** * Replaces the first substring of this string that matches the given regular expression with the * given replacement. * *
An invocation of this method of the form * str.replaceFirst(regex, repl) * yields exactly the same result as the expression * *
* {@link java.util.regex.Pattern}.{@link java.util.regex.Pattern#compile * compile}(regex).{@link * java.util.regex.Pattern#matcher(java.lang.CharSequence) * matcher}(str).{@link java.util.regex.Matcher#replaceFirst * replaceFirst}(repl)* * @param regex * the regular expression to which this string is to be matched * * @return The resulting String * * @throws PatternSyntaxException * if the regular expression's syntax is invalid * * @see java.util.regex.Pattern * * @since 1.4 * @spec JSR-51 */ public String replaceFirst(String regex, String replacement) { return Pattern.compile(regex).matcher(this).replaceFirst(replacement); } /** * Replaces each substring of this string that matches the given regular expression with the * given replacement. * *
An invocation of this method of the form * str.replaceAll(regex, repl) * yields exactly the same result as the expression * *
* {@link java.util.regex.Pattern}.{@link java.util.regex.Pattern#compile * compile}(regex).{@link * java.util.regex.Pattern#matcher(java.lang.CharSequence) * matcher}(str).{@link java.util.regex.Matcher#replaceAll * replaceAll}(repl)* * @param regex * the regular expression to which this string is to be matched * * @return The resulting String * * @throws PatternSyntaxException * if the regular expression's syntax is invalid * * @see java.util.regex.Pattern * * @since 1.4 * @spec JSR-51 */ public String replaceAll(String regex, String replacement) { return Pattern.compile(regex).matcher(this).replaceAll(replacement); } /** * Splits this string around matches of the given regular expression. * *
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 * *
* {@link java.util.regex.Pattern}.{@link java.util.regex.Pattern#compile * compile}(regex).{@link * java.util.regex.Pattern#split(java.lang.CharSequence,int) * split}(str, n) ** * * @param regex * the delimiting regular expression * * @param limit * the result threshold, as described above * * @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, int limit) { return Pattern.compile(regex).split(this, limit); } /** * Splits this string around matches of the given regular 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: * *
* * * @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*
* *Regex *Result ** : *{ "boo", "and", "foo" } * o *{ "b", "", ":and:f" }
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.
* * Examples of lowercase mappings are in the following table: *
| Language Code of Locale | *Upper Case | *Lower Case | *Description | *
|---|---|---|---|
| tr (Turkish) | *\u0130 | *\u0069 | *capital letter I with dot above -> small letter i | *
| tr (Turkish) | *\u0049 | *\u0131 | *capital letter I -> small letter dotless i | *
| (all) | *French Fries | *french fries | *lowercased all chars in String | *
| (all) | *
*
* |
*
*
* |
* lowercased all chars in String | *
String, converted to lowercase.
* @see java.lang.String#toLowerCase()
* @see java.lang.String#toUpperCase()
* @see java.lang.String#toUpperCase(Locale)
* @since 1.1
*/
/*KML
public String toLowerCase(Locale locale) {
if (locale == null)
throw new NullPointerException();
int len = count;
int off = offset;
char[] val = value;
int firstUpper;
/* Now check if there are any characters that need to be changed. *KML/
scan: {
for (firstUpper = 0 ; firstUpper < len ; firstUpper++) {
char c = value[off+firstUpper];
if (c != Character.toLowerCase(c)) {break scan;}
}
return this;
}
char[] result = new char[count];
/* Just copy the first few lowerCase characters. *KML/
System.arraycopy(val, off, result, 0, firstUpper);
if (locale.getLanguage().equals("tr")) {
// special loop for Turkey
for (int i = firstUpper; i < len; ++i) {
char ch = val[off+i];
if (ch == 'I') {
result[i] = '\u0131'; // dotless small i
continue;
}
if (ch == '\u0130') { // dotted I
result[i] = 'i'; // dotted i
continue;
}
result[i] = Character.toLowerCase(ch);
}
} else {
// normal, fast loop
for (int i = firstUpper; i < len; ++i) {
result[i] = Character.toLowerCase(val[off+i]);
}
}
return new String(0, result.length, result);
}
KML*/
/**
* Converts all of the characters in this String to lower
* case using the rules of the default locale. This is equivalent to calling
* toLowerCase(Locale.getDefault()).
*
* @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. *
*
| Language Code of Locale | *Lower Case | *Upper Case | *Description | *
|---|---|---|---|
| tr (Turkish) | *\u0069 | *\u0130 | *small letter i -> capital letter I with dot above | *
| tr (Turkish) | *\u0131 | *\u0049 | *small letter dotless i -> capital letter I | *
| (all) | *\u00df | *\u0053 \u0053 | *small letter sharp s -> two letters: SS | *
| (all) | *Fahrvergnügen | *FAHRVERGNÜGEN | ** |
String, converted to uppercase.
* @see java.lang.String#toUpperCase()
* @see java.lang.String#toLowerCase()
* @see java.lang.String#toLowerCase(Locale)
* @since 1.1
*/
/*KML
public String toUpperCase(Locale locale) {
int len = count;
int off = offset;
char[] val = value;
int firstLower;
/* Now check if there are any characters that need changing. *KML/
scan: {
char upperCaseChar;
char c;
for (firstLower = 0 ; firstLower < len ; firstLower++) {
c = value[off+firstLower];
upperCaseChar = Character.toUpperCaseEx(c);
if (upperCaseChar == Character.CHAR_ERROR || c != upperCaseChar) {
break scan;
}
}
return this;
}
char[] result = new char[len]; /* might grow! *KML/
int resultOffset = 0; /* result grows, so i+resultOffset
* is the write location in result *KML/
/* Just copy the first few upperCase characters. *KML/
System.arraycopy(val, off, result, 0, firstLower);
if (locale.getLanguage().equals("tr")) {
// special loop for Turkey
char[] upperCharArray;
char upperChar;
char ch;
for (int i = firstLower; i < len; ++i) {
ch = val[off+i];
if (ch == 'i') {
result[i+resultOffset] = '\u0130'; // dotted cap i
continue;
}
if (ch == '\u0131') { // dotless i
result[i+resultOffset] = 'I'; // cap I
continue;
}
upperChar = Character.toUpperCaseEx(ch);
if (upperChar == Character.CHAR_ERROR) {
upperCharArray = Character.toUpperCaseCharArray(ch);
/* Grow result. *KML/
int mapLen = upperCharArray.length;
char[] result2 = new char[result.length + mapLen - 1];
System.arraycopy(result, 0, result2, 0,
i + 1 + resultOffset);
for (int x=0; xtoUpperCase(Locale.getDefault()).
*
* @return the String, converted to uppercase.
* @see java.lang.String#toUpperCase(Locale)
*/
public String toUpperCase() {
return toUpperCase(Locale.getDefault());
}
/**
* Returns a copy of the string, with leading and trailing whitespace
* omitted.
*
* 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).
*
* This method may be used to trim
* {@link Character#isSpace(char) whitespace} from the beginning and end
* of a string; in fact, it trims all ASCII control characters as well.
*
* @return A copy of this string with leading and trailing white
* space removed, or this string if it has no leading or
* trailing white space.
*/
public String trim() {
int len = count;
int st = 0;
int off = offset; /* avoid getfield opcode */
char[] val = value; /* avoid getfield opcode */
while ((st < len) && (val[off + st] <= ' ')) {
st++;
}
while ((st < len) && (val[off + len - 1] <= ' ')) {
len--;
}
return ((st > 0) || (len < count)) ? substring(st, len) : this;
}
/**
* This object (which is already a string!) is itself returned.
*
* @return the string itself.
*/
public String toString() {
return this;
}
/**
* Converts this string to a new character array.
*
* @return a newly allocated character array whose length is the length
* of this string and whose contents are initialized to contain
* the character sequence represented by this string.
*/
public char[] toCharArray() {
char result[] = new char[count];
getChars(0, count, result, 0);
return result;
}
/**
* Returns the string representation of the Object argument.
*
* @param obj an Object.
* @return if the argument is null, then a string equal to
* "null"; otherwise, the value of
* obj.toString() is returned.
* @see java.lang.Object#toString()
*/
public static String valueOf(Object obj) {
return (obj == null) ? "null" : obj.toString();
}
/**
* Returns the string representation of the char array
* argument. The contents of the character array are copied; subsequent
* modification of the character array does not affect the newly
* created string.
*
* @param data a char array.
* @return a newly allocated string representing the same sequence of
* characters contained in the character array argument.
*/
public static String valueOf(char data[]) {
return new String(data);
}
/**
* Returns the string representation of a specific subarray of the
* char array argument.
*
* 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(); }