emul/src/main/java/java/lang/String.java
author Jaroslav Tulach <jaroslav.tulach@apidesign.org>
Mon, 08 Oct 2012 17:10:27 -0700
branchemul
changeset 93 a236a9f137ac
parent 84 d65b3a2fbfaf
child 104 1376481f15e7
permissions -rw-r--r--
Concatanation of strings sort of works (but produces wrong result)
jaroslav@49
     1
/*
jaroslav@49
     2
 * Copyright (c) 1994, 2010, Oracle and/or its affiliates. All rights reserved.
jaroslav@49
     3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
jaroslav@49
     4
 *
jaroslav@49
     5
 * This code is free software; you can redistribute it and/or modify it
jaroslav@49
     6
 * under the terms of the GNU General Public License version 2 only, as
jaroslav@49
     7
 * published by the Free Software Foundation.  Oracle designates this
jaroslav@49
     8
 * particular file as subject to the "Classpath" exception as provided
jaroslav@49
     9
 * by Oracle in the LICENSE file that accompanied this code.
jaroslav@49
    10
 *
jaroslav@49
    11
 * This code is distributed in the hope that it will be useful, but WITHOUT
jaroslav@49
    12
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
jaroslav@49
    13
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
jaroslav@49
    14
 * version 2 for more details (a copy is included in the LICENSE file that
jaroslav@49
    15
 * accompanied this code).
jaroslav@49
    16
 *
jaroslav@49
    17
 * You should have received a copy of the GNU General Public License version
jaroslav@49
    18
 * 2 along with this work; if not, write to the Free Software Foundation,
jaroslav@49
    19
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
jaroslav@49
    20
 *
jaroslav@49
    21
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
jaroslav@49
    22
 * or visit www.oracle.com if you need additional information or have any
jaroslav@49
    23
 * questions.
jaroslav@49
    24
 */
jaroslav@49
    25
jaroslav@49
    26
package java.lang;
jaroslav@49
    27
jaroslav@93
    28
import org.apidesign.bck2brwsr.core.ExtraJavaScript;
jaroslav@49
    29
import java.util.Comparator;
jaroslav@49
    30
jaroslav@49
    31
/**
jaroslav@49
    32
 * The <code>String</code> class represents character strings. All
jaroslav@49
    33
 * string literals in Java programs, such as <code>"abc"</code>, are
jaroslav@49
    34
 * implemented as instances of this class.
jaroslav@49
    35
 * <p>
jaroslav@49
    36
 * Strings are constant; their values cannot be changed after they
jaroslav@49
    37
 * are created. String buffers support mutable strings.
jaroslav@49
    38
 * Because String objects are immutable they can be shared. For example:
jaroslav@49
    39
 * <p><blockquote><pre>
jaroslav@49
    40
 *     String str = "abc";
jaroslav@49
    41
 * </pre></blockquote><p>
jaroslav@49
    42
 * is equivalent to:
jaroslav@49
    43
 * <p><blockquote><pre>
jaroslav@49
    44
 *     char data[] = {'a', 'b', 'c'};
jaroslav@49
    45
 *     String str = new String(data);
jaroslav@49
    46
 * </pre></blockquote><p>
jaroslav@49
    47
 * Here are some more examples of how strings can be used:
jaroslav@49
    48
 * <p><blockquote><pre>
jaroslav@49
    49
 *     System.out.println("abc");
jaroslav@49
    50
 *     String cde = "cde";
jaroslav@49
    51
 *     System.out.println("abc" + cde);
jaroslav@49
    52
 *     String c = "abc".substring(2,3);
jaroslav@49
    53
 *     String d = cde.substring(1, 2);
jaroslav@49
    54
 * </pre></blockquote>
jaroslav@49
    55
 * <p>
jaroslav@49
    56
 * The class <code>String</code> includes methods for examining
jaroslav@49
    57
 * individual characters of the sequence, for comparing strings, for
jaroslav@49
    58
 * searching strings, for extracting substrings, and for creating a
jaroslav@49
    59
 * copy of a string with all characters translated to uppercase or to
jaroslav@49
    60
 * lowercase. Case mapping is based on the Unicode Standard version
jaroslav@49
    61
 * specified by the {@link java.lang.Character Character} class.
jaroslav@49
    62
 * <p>
jaroslav@49
    63
 * The Java language provides special support for the string
jaroslav@49
    64
 * concatenation operator (&nbsp;+&nbsp;), and for conversion of
jaroslav@49
    65
 * other objects to strings. String concatenation is implemented
jaroslav@49
    66
 * through the <code>StringBuilder</code>(or <code>StringBuffer</code>)
jaroslav@49
    67
 * class and its <code>append</code> method.
jaroslav@49
    68
 * String conversions are implemented through the method
jaroslav@49
    69
 * <code>toString</code>, defined by <code>Object</code> and
jaroslav@49
    70
 * inherited by all classes in Java. For additional information on
jaroslav@49
    71
 * string concatenation and conversion, see Gosling, Joy, and Steele,
jaroslav@49
    72
 * <i>The Java Language Specification</i>.
jaroslav@49
    73
 *
jaroslav@49
    74
 * <p> Unless otherwise noted, passing a <tt>null</tt> argument to a constructor
jaroslav@49
    75
 * or method in this class will cause a {@link NullPointerException} to be
jaroslav@49
    76
 * thrown.
jaroslav@49
    77
 *
jaroslav@49
    78
 * <p>A <code>String</code> represents a string in the UTF-16 format
jaroslav@49
    79
 * in which <em>supplementary characters</em> are represented by <em>surrogate
jaroslav@49
    80
 * pairs</em> (see the section <a href="Character.html#unicode">Unicode
jaroslav@49
    81
 * Character Representations</a> in the <code>Character</code> class for
jaroslav@49
    82
 * more information).
jaroslav@49
    83
 * Index values refer to <code>char</code> code units, so a supplementary
jaroslav@49
    84
 * character uses two positions in a <code>String</code>.
jaroslav@49
    85
 * <p>The <code>String</code> class provides methods for dealing with
jaroslav@49
    86
 * Unicode code points (i.e., characters), in addition to those for
jaroslav@49
    87
 * dealing with Unicode code units (i.e., <code>char</code> values).
jaroslav@49
    88
 *
jaroslav@49
    89
 * @author  Lee Boynton
jaroslav@49
    90
 * @author  Arthur van Hoff
jaroslav@49
    91
 * @author  Martin Buchholz
jaroslav@49
    92
 * @author  Ulf Zibis
jaroslav@49
    93
 * @see     java.lang.Object#toString()
jaroslav@49
    94
 * @see     java.lang.StringBuffer
jaroslav@49
    95
 * @see     java.lang.StringBuilder
jaroslav@49
    96
 * @see     java.nio.charset.Charset
jaroslav@49
    97
 * @since   JDK1.0
jaroslav@49
    98
 */
jaroslav@49
    99
jaroslav@93
   100
@ExtraJavaScript(
jaroslav@93
   101
    resource="/org/apidesign/vm4brwsr/emul/java_lang_String.js",
jaroslav@93
   102
    processByteCode=false
jaroslav@93
   103
)
jaroslav@49
   104
public final class String
jaroslav@49
   105
    implements java.io.Serializable, Comparable<String>, CharSequence
jaroslav@49
   106
{
jaroslav@49
   107
    /** The value is used for character storage. */
jaroslav@49
   108
    private final char value[];
jaroslav@49
   109
jaroslav@49
   110
    /** The offset is the first index of the storage that is used. */
jaroslav@49
   111
    private final int offset;
jaroslav@49
   112
jaroslav@49
   113
    /** The count is the number of characters in the String. */
jaroslav@49
   114
    private final int count;
jaroslav@49
   115
jaroslav@49
   116
    /** Cache the hash code for the string */
jaroslav@49
   117
    private int hash; // Default to 0
jaroslav@49
   118
jaroslav@49
   119
    /** use serialVersionUID from JDK 1.0.2 for interoperability */
jaroslav@49
   120
    private static final long serialVersionUID = -6849794470754667710L;
jaroslav@49
   121
jaroslav@49
   122
    /**
jaroslav@49
   123
     * Class String is special cased within the Serialization Stream Protocol.
jaroslav@49
   124
     *
jaroslav@49
   125
     * A String instance is written initially into an ObjectOutputStream in the
jaroslav@49
   126
     * following format:
jaroslav@49
   127
     * <pre>
jaroslav@49
   128
     *      <code>TC_STRING</code> (utf String)
jaroslav@49
   129
     * </pre>
jaroslav@49
   130
     * The String is written by method <code>DataOutput.writeUTF</code>.
jaroslav@49
   131
     * A new handle is generated to  refer to all future references to the
jaroslav@49
   132
     * string instance within the stream.
jaroslav@49
   133
     */
jaroslav@65
   134
//    private static final ObjectStreamField[] serialPersistentFields =
jaroslav@65
   135
//        new ObjectStreamField[0];
jaroslav@49
   136
jaroslav@49
   137
    /**
jaroslav@49
   138
     * Initializes a newly created {@code String} object so that it represents
jaroslav@49
   139
     * an empty character sequence.  Note that use of this constructor is
jaroslav@49
   140
     * unnecessary since Strings are immutable.
jaroslav@49
   141
     */
jaroslav@49
   142
    public String() {
jaroslav@49
   143
        this.offset = 0;
jaroslav@49
   144
        this.count = 0;
jaroslav@49
   145
        this.value = new char[0];
jaroslav@49
   146
    }
jaroslav@49
   147
jaroslav@49
   148
    /**
jaroslav@49
   149
     * Initializes a newly created {@code String} object so that it represents
jaroslav@49
   150
     * the same sequence of characters as the argument; in other words, the
jaroslav@49
   151
     * newly created string is a copy of the argument string. Unless an
jaroslav@49
   152
     * explicit copy of {@code original} is needed, use of this constructor is
jaroslav@49
   153
     * unnecessary since Strings are immutable.
jaroslav@49
   154
     *
jaroslav@49
   155
     * @param  original
jaroslav@49
   156
     *         A {@code String}
jaroslav@49
   157
     */
jaroslav@49
   158
    public String(String original) {
jaroslav@49
   159
        int size = original.count;
jaroslav@49
   160
        char[] originalValue = original.value;
jaroslav@49
   161
        char[] v;
jaroslav@49
   162
        if (originalValue.length > size) {
jaroslav@49
   163
            // The array representing the String is bigger than the new
jaroslav@49
   164
            // String itself.  Perhaps this constructor is being called
jaroslav@49
   165
            // in order to trim the baggage, so make a copy of the array.
jaroslav@49
   166
            int off = original.offset;
jaroslav@61
   167
            v = copyOfRange(originalValue, off, off+size);
jaroslav@49
   168
        } else {
jaroslav@49
   169
            // The array representing the String is the same
jaroslav@49
   170
            // size as the String, so no point in making a copy.
jaroslav@49
   171
            v = originalValue;
jaroslav@49
   172
        }
jaroslav@49
   173
        this.offset = 0;
jaroslav@49
   174
        this.count = size;
jaroslav@49
   175
        this.value = v;
jaroslav@49
   176
    }
jaroslav@49
   177
jaroslav@49
   178
    /**
jaroslav@49
   179
     * Allocates a new {@code String} so that it represents the sequence of
jaroslav@49
   180
     * characters currently contained in the character array argument. The
jaroslav@49
   181
     * contents of the character array are copied; subsequent modification of
jaroslav@49
   182
     * the character array does not affect the newly created string.
jaroslav@49
   183
     *
jaroslav@49
   184
     * @param  value
jaroslav@49
   185
     *         The initial value of the string
jaroslav@49
   186
     */
jaroslav@49
   187
    public String(char value[]) {
jaroslav@49
   188
        int size = value.length;
jaroslav@49
   189
        this.offset = 0;
jaroslav@49
   190
        this.count = size;
jaroslav@61
   191
        this.value = copyOf(value, size);
jaroslav@49
   192
    }
jaroslav@49
   193
jaroslav@49
   194
    /**
jaroslav@49
   195
     * Allocates a new {@code String} that contains characters from a subarray
jaroslav@49
   196
     * of the character array argument. The {@code offset} argument is the
jaroslav@49
   197
     * index of the first character of the subarray and the {@code count}
jaroslav@49
   198
     * argument specifies the length of the subarray. The contents of the
jaroslav@49
   199
     * subarray are copied; subsequent modification of the character array does
jaroslav@49
   200
     * not affect the newly created string.
jaroslav@49
   201
     *
jaroslav@49
   202
     * @param  value
jaroslav@49
   203
     *         Array that is the source of characters
jaroslav@49
   204
     *
jaroslav@49
   205
     * @param  offset
jaroslav@49
   206
     *         The initial offset
jaroslav@49
   207
     *
jaroslav@49
   208
     * @param  count
jaroslav@49
   209
     *         The length
jaroslav@49
   210
     *
jaroslav@49
   211
     * @throws  IndexOutOfBoundsException
jaroslav@49
   212
     *          If the {@code offset} and {@code count} arguments index
jaroslav@49
   213
     *          characters outside the bounds of the {@code value} array
jaroslav@49
   214
     */
jaroslav@49
   215
    public String(char value[], int offset, int count) {
jaroslav@49
   216
        if (offset < 0) {
jaroslav@49
   217
            throw new StringIndexOutOfBoundsException(offset);
jaroslav@49
   218
        }
jaroslav@49
   219
        if (count < 0) {
jaroslav@49
   220
            throw new StringIndexOutOfBoundsException(count);
jaroslav@49
   221
        }
jaroslav@49
   222
        // Note: offset or count might be near -1>>>1.
jaroslav@49
   223
        if (offset > value.length - count) {
jaroslav@49
   224
            throw new StringIndexOutOfBoundsException(offset + count);
jaroslav@49
   225
        }
jaroslav@49
   226
        this.offset = 0;
jaroslav@49
   227
        this.count = count;
jaroslav@61
   228
        this.value = copyOfRange(value, offset, offset+count);
jaroslav@49
   229
    }
jaroslav@49
   230
jaroslav@49
   231
    /**
jaroslav@49
   232
     * Allocates a new {@code String} that contains characters from a subarray
jaroslav@49
   233
     * of the <a href="Character.html#unicode">Unicode code point</a> array
jaroslav@49
   234
     * argument.  The {@code offset} argument is the index of the first code
jaroslav@49
   235
     * point of the subarray and the {@code count} argument specifies the
jaroslav@49
   236
     * length of the subarray.  The contents of the subarray are converted to
jaroslav@49
   237
     * {@code char}s; subsequent modification of the {@code int} array does not
jaroslav@49
   238
     * affect the newly created string.
jaroslav@49
   239
     *
jaroslav@49
   240
     * @param  codePoints
jaroslav@49
   241
     *         Array that is the source of Unicode code points
jaroslav@49
   242
     *
jaroslav@49
   243
     * @param  offset
jaroslav@49
   244
     *         The initial offset
jaroslav@49
   245
     *
jaroslav@49
   246
     * @param  count
jaroslav@49
   247
     *         The length
jaroslav@49
   248
     *
jaroslav@49
   249
     * @throws  IllegalArgumentException
jaroslav@49
   250
     *          If any invalid Unicode code point is found in {@code
jaroslav@49
   251
     *          codePoints}
jaroslav@49
   252
     *
jaroslav@49
   253
     * @throws  IndexOutOfBoundsException
jaroslav@49
   254
     *          If the {@code offset} and {@code count} arguments index
jaroslav@49
   255
     *          characters outside the bounds of the {@code codePoints} array
jaroslav@49
   256
     *
jaroslav@49
   257
     * @since  1.5
jaroslav@49
   258
     */
jaroslav@49
   259
    public String(int[] codePoints, int offset, int count) {
jaroslav@49
   260
        if (offset < 0) {
jaroslav@49
   261
            throw new StringIndexOutOfBoundsException(offset);
jaroslav@49
   262
        }
jaroslav@49
   263
        if (count < 0) {
jaroslav@49
   264
            throw new StringIndexOutOfBoundsException(count);
jaroslav@49
   265
        }
jaroslav@49
   266
        // Note: offset or count might be near -1>>>1.
jaroslav@49
   267
        if (offset > codePoints.length - count) {
jaroslav@49
   268
            throw new StringIndexOutOfBoundsException(offset + count);
jaroslav@49
   269
        }
jaroslav@49
   270
jaroslav@49
   271
        final int end = offset + count;
jaroslav@49
   272
jaroslav@49
   273
        // Pass 1: Compute precise size of char[]
jaroslav@49
   274
        int n = count;
jaroslav@49
   275
        for (int i = offset; i < end; i++) {
jaroslav@49
   276
            int c = codePoints[i];
jaroslav@49
   277
            if (Character.isBmpCodePoint(c))
jaroslav@49
   278
                continue;
jaroslav@49
   279
            else if (Character.isValidCodePoint(c))
jaroslav@49
   280
                n++;
jaroslav@49
   281
            else throw new IllegalArgumentException(Integer.toString(c));
jaroslav@49
   282
        }
jaroslav@49
   283
jaroslav@49
   284
        // Pass 2: Allocate and fill in char[]
jaroslav@49
   285
        final char[] v = new char[n];
jaroslav@49
   286
jaroslav@49
   287
        for (int i = offset, j = 0; i < end; i++, j++) {
jaroslav@49
   288
            int c = codePoints[i];
jaroslav@49
   289
            if (Character.isBmpCodePoint(c))
jaroslav@49
   290
                v[j] = (char) c;
jaroslav@49
   291
            else
jaroslav@49
   292
                Character.toSurrogates(c, v, j++);
jaroslav@49
   293
        }
jaroslav@49
   294
jaroslav@49
   295
        this.value  = v;
jaroslav@49
   296
        this.count  = n;
jaroslav@49
   297
        this.offset = 0;
jaroslav@49
   298
    }
jaroslav@49
   299
jaroslav@49
   300
    /**
jaroslav@49
   301
     * Allocates a new {@code String} constructed from a subarray of an array
jaroslav@49
   302
     * of 8-bit integer values.
jaroslav@49
   303
     *
jaroslav@49
   304
     * <p> The {@code offset} argument is the index of the first byte of the
jaroslav@49
   305
     * subarray, and the {@code count} argument specifies the length of the
jaroslav@49
   306
     * subarray.
jaroslav@49
   307
     *
jaroslav@49
   308
     * <p> Each {@code byte} in the subarray is converted to a {@code char} as
jaroslav@49
   309
     * specified in the method above.
jaroslav@49
   310
     *
jaroslav@49
   311
     * @deprecated This method does not properly convert bytes into characters.
jaroslav@49
   312
     * As of JDK&nbsp;1.1, the preferred way to do this is via the
jaroslav@49
   313
     * {@code String} constructors that take a {@link
jaroslav@49
   314
     * java.nio.charset.Charset}, charset name, or that use the platform's
jaroslav@49
   315
     * default charset.
jaroslav@49
   316
     *
jaroslav@49
   317
     * @param  ascii
jaroslav@49
   318
     *         The bytes to be converted to characters
jaroslav@49
   319
     *
jaroslav@49
   320
     * @param  hibyte
jaroslav@49
   321
     *         The top 8 bits of each 16-bit Unicode code unit
jaroslav@49
   322
     *
jaroslav@49
   323
     * @param  offset
jaroslav@49
   324
     *         The initial offset
jaroslav@49
   325
     * @param  count
jaroslav@49
   326
     *         The length
jaroslav@49
   327
     *
jaroslav@49
   328
     * @throws  IndexOutOfBoundsException
jaroslav@49
   329
     *          If the {@code offset} or {@code count} argument is invalid
jaroslav@49
   330
     *
jaroslav@49
   331
     * @see  #String(byte[], int)
jaroslav@49
   332
     * @see  #String(byte[], int, int, java.lang.String)
jaroslav@49
   333
     * @see  #String(byte[], int, int, java.nio.charset.Charset)
jaroslav@49
   334
     * @see  #String(byte[], int, int)
jaroslav@49
   335
     * @see  #String(byte[], java.lang.String)
jaroslav@49
   336
     * @see  #String(byte[], java.nio.charset.Charset)
jaroslav@49
   337
     * @see  #String(byte[])
jaroslav@49
   338
     */
jaroslav@49
   339
    @Deprecated
jaroslav@49
   340
    public String(byte ascii[], int hibyte, int offset, int count) {
jaroslav@49
   341
        checkBounds(ascii, offset, count);
jaroslav@49
   342
        char value[] = new char[count];
jaroslav@49
   343
jaroslav@49
   344
        if (hibyte == 0) {
jaroslav@49
   345
            for (int i = count ; i-- > 0 ;) {
jaroslav@49
   346
                value[i] = (char) (ascii[i + offset] & 0xff);
jaroslav@49
   347
            }
jaroslav@49
   348
        } else {
jaroslav@49
   349
            hibyte <<= 8;
jaroslav@49
   350
            for (int i = count ; i-- > 0 ;) {
jaroslav@49
   351
                value[i] = (char) (hibyte | (ascii[i + offset] & 0xff));
jaroslav@49
   352
            }
jaroslav@49
   353
        }
jaroslav@49
   354
        this.offset = 0;
jaroslav@49
   355
        this.count = count;
jaroslav@49
   356
        this.value = value;
jaroslav@49
   357
    }
jaroslav@49
   358
jaroslav@49
   359
    /**
jaroslav@49
   360
     * Allocates a new {@code String} containing characters constructed from
jaroslav@49
   361
     * an array of 8-bit integer values. Each character <i>c</i>in the
jaroslav@49
   362
     * resulting string is constructed from the corresponding component
jaroslav@49
   363
     * <i>b</i> in the byte array such that:
jaroslav@49
   364
     *
jaroslav@49
   365
     * <blockquote><pre>
jaroslav@49
   366
     *     <b><i>c</i></b> == (char)(((hibyte &amp; 0xff) &lt;&lt; 8)
jaroslav@49
   367
     *                         | (<b><i>b</i></b> &amp; 0xff))
jaroslav@49
   368
     * </pre></blockquote>
jaroslav@49
   369
     *
jaroslav@49
   370
     * @deprecated  This method does not properly convert bytes into
jaroslav@49
   371
     * characters.  As of JDK&nbsp;1.1, the preferred way to do this is via the
jaroslav@49
   372
     * {@code String} constructors that take a {@link
jaroslav@49
   373
     * java.nio.charset.Charset}, charset name, or that use the platform's
jaroslav@49
   374
     * default charset.
jaroslav@49
   375
     *
jaroslav@49
   376
     * @param  ascii
jaroslav@49
   377
     *         The bytes to be converted to characters
jaroslav@49
   378
     *
jaroslav@49
   379
     * @param  hibyte
jaroslav@49
   380
     *         The top 8 bits of each 16-bit Unicode code unit
jaroslav@49
   381
     *
jaroslav@49
   382
     * @see  #String(byte[], int, int, java.lang.String)
jaroslav@49
   383
     * @see  #String(byte[], int, int, java.nio.charset.Charset)
jaroslav@49
   384
     * @see  #String(byte[], int, int)
jaroslav@49
   385
     * @see  #String(byte[], java.lang.String)
jaroslav@49
   386
     * @see  #String(byte[], java.nio.charset.Charset)
jaroslav@49
   387
     * @see  #String(byte[])
jaroslav@49
   388
     */
jaroslav@49
   389
    @Deprecated
jaroslav@49
   390
    public String(byte ascii[], int hibyte) {
jaroslav@49
   391
        this(ascii, hibyte, 0, ascii.length);
jaroslav@49
   392
    }
jaroslav@49
   393
jaroslav@49
   394
    /* Common private utility method used to bounds check the byte array
jaroslav@49
   395
     * and requested offset & length values used by the String(byte[],..)
jaroslav@49
   396
     * constructors.
jaroslav@49
   397
     */
jaroslav@49
   398
    private static void checkBounds(byte[] bytes, int offset, int length) {
jaroslav@49
   399
        if (length < 0)
jaroslav@49
   400
            throw new StringIndexOutOfBoundsException(length);
jaroslav@49
   401
        if (offset < 0)
jaroslav@49
   402
            throw new StringIndexOutOfBoundsException(offset);
jaroslav@49
   403
        if (offset > bytes.length - length)
jaroslav@49
   404
            throw new StringIndexOutOfBoundsException(offset + length);
jaroslav@49
   405
    }
jaroslav@49
   406
jaroslav@49
   407
    /**
jaroslav@49
   408
     * Constructs a new {@code String} by decoding the specified subarray of
jaroslav@49
   409
     * bytes using the specified charset.  The length of the new {@code String}
jaroslav@49
   410
     * is a function of the charset, and hence may not be equal to the length
jaroslav@49
   411
     * of the subarray.
jaroslav@49
   412
     *
jaroslav@49
   413
     * <p> The behavior of this constructor when the given bytes are not valid
jaroslav@49
   414
     * in the given charset is unspecified.  The {@link
jaroslav@49
   415
     * java.nio.charset.CharsetDecoder} class should be used when more control
jaroslav@49
   416
     * over the decoding process is required.
jaroslav@49
   417
     *
jaroslav@49
   418
     * @param  bytes
jaroslav@49
   419
     *         The bytes to be decoded into characters
jaroslav@49
   420
     *
jaroslav@49
   421
     * @param  offset
jaroslav@49
   422
     *         The index of the first byte to decode
jaroslav@49
   423
     *
jaroslav@49
   424
     * @param  length
jaroslav@49
   425
     *         The number of bytes to decode
jaroslav@49
   426
jaroslav@49
   427
     * @param  charsetName
jaroslav@49
   428
     *         The name of a supported {@linkplain java.nio.charset.Charset
jaroslav@49
   429
     *         charset}
jaroslav@49
   430
     *
jaroslav@49
   431
     * @throws  UnsupportedEncodingException
jaroslav@49
   432
     *          If the named charset is not supported
jaroslav@49
   433
     *
jaroslav@49
   434
     * @throws  IndexOutOfBoundsException
jaroslav@49
   435
     *          If the {@code offset} and {@code length} arguments index
jaroslav@49
   436
     *          characters outside the bounds of the {@code bytes} array
jaroslav@49
   437
     *
jaroslav@49
   438
     * @since  JDK1.1
jaroslav@49
   439
     */
jaroslav@74
   440
//    public String(byte bytes[], int offset, int length, String charsetName)
jaroslav@74
   441
//        throws UnsupportedEncodingException
jaroslav@74
   442
//    {
jaroslav@74
   443
//        if (charsetName == null)
jaroslav@74
   444
//            throw new NullPointerException("charsetName");
jaroslav@74
   445
//        checkBounds(bytes, offset, length);
jaroslav@74
   446
//        char[] v = StringCoding.decode(charsetName, bytes, offset, length);
jaroslav@74
   447
//        this.offset = 0;
jaroslav@74
   448
//        this.count = v.length;
jaroslav@74
   449
//        this.value = v;
jaroslav@74
   450
//    }
jaroslav@49
   451
jaroslav@49
   452
    /**
jaroslav@49
   453
     * Constructs a new {@code String} by decoding the specified subarray of
jaroslav@49
   454
     * bytes using the specified {@linkplain java.nio.charset.Charset charset}.
jaroslav@49
   455
     * The length of the new {@code String} is a function of the charset, and
jaroslav@49
   456
     * hence may not be equal to the length of the subarray.
jaroslav@49
   457
     *
jaroslav@49
   458
     * <p> This method always replaces malformed-input and unmappable-character
jaroslav@49
   459
     * sequences with this charset's default replacement string.  The {@link
jaroslav@49
   460
     * java.nio.charset.CharsetDecoder} class should be used when more control
jaroslav@49
   461
     * over the decoding process is required.
jaroslav@49
   462
     *
jaroslav@49
   463
     * @param  bytes
jaroslav@49
   464
     *         The bytes to be decoded into characters
jaroslav@49
   465
     *
jaroslav@49
   466
     * @param  offset
jaroslav@49
   467
     *         The index of the first byte to decode
jaroslav@49
   468
     *
jaroslav@49
   469
     * @param  length
jaroslav@49
   470
     *         The number of bytes to decode
jaroslav@49
   471
     *
jaroslav@49
   472
     * @param  charset
jaroslav@49
   473
     *         The {@linkplain java.nio.charset.Charset charset} to be used to
jaroslav@49
   474
     *         decode the {@code bytes}
jaroslav@49
   475
     *
jaroslav@49
   476
     * @throws  IndexOutOfBoundsException
jaroslav@49
   477
     *          If the {@code offset} and {@code length} arguments index
jaroslav@49
   478
     *          characters outside the bounds of the {@code bytes} array
jaroslav@49
   479
     *
jaroslav@49
   480
     * @since  1.6
jaroslav@49
   481
     */
jaroslav@61
   482
    /* don't want dependnecy on Charset
jaroslav@49
   483
    public String(byte bytes[], int offset, int length, Charset charset) {
jaroslav@49
   484
        if (charset == null)
jaroslav@49
   485
            throw new NullPointerException("charset");
jaroslav@49
   486
        checkBounds(bytes, offset, length);
jaroslav@49
   487
        char[] v = StringCoding.decode(charset, bytes, offset, length);
jaroslav@49
   488
        this.offset = 0;
jaroslav@49
   489
        this.count = v.length;
jaroslav@49
   490
        this.value = v;
jaroslav@49
   491
    }
jaroslav@61
   492
    */
jaroslav@49
   493
jaroslav@49
   494
    /**
jaroslav@49
   495
     * Constructs a new {@code String} by decoding the specified array of bytes
jaroslav@49
   496
     * using the specified {@linkplain java.nio.charset.Charset charset}.  The
jaroslav@49
   497
     * length of the new {@code String} is a function of the charset, and hence
jaroslav@49
   498
     * may not be equal to the length of the byte array.
jaroslav@49
   499
     *
jaroslav@49
   500
     * <p> The behavior of this constructor when the given bytes are not valid
jaroslav@49
   501
     * in the given charset is unspecified.  The {@link
jaroslav@49
   502
     * java.nio.charset.CharsetDecoder} class should be used when more control
jaroslav@49
   503
     * over the decoding process is required.
jaroslav@49
   504
     *
jaroslav@49
   505
     * @param  bytes
jaroslav@49
   506
     *         The bytes to be decoded into characters
jaroslav@49
   507
     *
jaroslav@49
   508
     * @param  charsetName
jaroslav@49
   509
     *         The name of a supported {@linkplain java.nio.charset.Charset
jaroslav@49
   510
     *         charset}
jaroslav@49
   511
     *
jaroslav@49
   512
     * @throws  UnsupportedEncodingException
jaroslav@49
   513
     *          If the named charset is not supported
jaroslav@49
   514
     *
jaroslav@49
   515
     * @since  JDK1.1
jaroslav@49
   516
     */
jaroslav@74
   517
//    public String(byte bytes[], String charsetName)
jaroslav@74
   518
//        throws UnsupportedEncodingException
jaroslav@74
   519
//    {
jaroslav@74
   520
//        this(bytes, 0, bytes.length, charsetName);
jaroslav@74
   521
//    }
jaroslav@49
   522
jaroslav@49
   523
    /**
jaroslav@49
   524
     * Constructs a new {@code String} by decoding the specified array of
jaroslav@49
   525
     * bytes using the specified {@linkplain java.nio.charset.Charset charset}.
jaroslav@49
   526
     * The length of the new {@code String} is a function of the charset, and
jaroslav@49
   527
     * hence may not be equal to the length of the byte array.
jaroslav@49
   528
     *
jaroslav@49
   529
     * <p> This method always replaces malformed-input and unmappable-character
jaroslav@49
   530
     * sequences with this charset's default replacement string.  The {@link
jaroslav@49
   531
     * java.nio.charset.CharsetDecoder} class should be used when more control
jaroslav@49
   532
     * over the decoding process is required.
jaroslav@49
   533
     *
jaroslav@49
   534
     * @param  bytes
jaroslav@49
   535
     *         The bytes to be decoded into characters
jaroslav@49
   536
     *
jaroslav@49
   537
     * @param  charset
jaroslav@49
   538
     *         The {@linkplain java.nio.charset.Charset charset} to be used to
jaroslav@49
   539
     *         decode the {@code bytes}
jaroslav@49
   540
     *
jaroslav@49
   541
     * @since  1.6
jaroslav@49
   542
     */
jaroslav@61
   543
    /* don't want dep on Charset
jaroslav@49
   544
    public String(byte bytes[], Charset charset) {
jaroslav@49
   545
        this(bytes, 0, bytes.length, charset);
jaroslav@49
   546
    }
jaroslav@61
   547
    */
jaroslav@49
   548
jaroslav@49
   549
    /**
jaroslav@49
   550
     * Constructs a new {@code String} by decoding the specified subarray of
jaroslav@49
   551
     * bytes using the platform's default charset.  The length of the new
jaroslav@49
   552
     * {@code String} is a function of the charset, and hence may not be equal
jaroslav@49
   553
     * to the length of the subarray.
jaroslav@49
   554
     *
jaroslav@49
   555
     * <p> The behavior of this constructor when the given bytes are not valid
jaroslav@49
   556
     * in the default charset is unspecified.  The {@link
jaroslav@49
   557
     * java.nio.charset.CharsetDecoder} class should be used when more control
jaroslav@49
   558
     * over the decoding process is required.
jaroslav@49
   559
     *
jaroslav@49
   560
     * @param  bytes
jaroslav@49
   561
     *         The bytes to be decoded into characters
jaroslav@49
   562
     *
jaroslav@49
   563
     * @param  offset
jaroslav@49
   564
     *         The index of the first byte to decode
jaroslav@49
   565
     *
jaroslav@49
   566
     * @param  length
jaroslav@49
   567
     *         The number of bytes to decode
jaroslav@49
   568
     *
jaroslav@49
   569
     * @throws  IndexOutOfBoundsException
jaroslav@49
   570
     *          If the {@code offset} and the {@code length} arguments index
jaroslav@49
   571
     *          characters outside the bounds of the {@code bytes} array
jaroslav@49
   572
     *
jaroslav@49
   573
     * @since  JDK1.1
jaroslav@49
   574
     */
jaroslav@49
   575
    public String(byte bytes[], int offset, int length) {
jaroslav@49
   576
        checkBounds(bytes, offset, length);
jaroslav@75
   577
        char[] v  = new char[length];
jaroslav@75
   578
        for (int i = 0; i < length; i++) {
jaroslav@75
   579
            v[i] = (char)bytes[offset++];
jaroslav@75
   580
        }
jaroslav@49
   581
        this.offset = 0;
jaroslav@49
   582
        this.count = v.length;
jaroslav@49
   583
        this.value = v;
jaroslav@49
   584
    }
jaroslav@49
   585
jaroslav@49
   586
    /**
jaroslav@49
   587
     * Constructs a new {@code String} by decoding the specified array of bytes
jaroslav@49
   588
     * using the platform's default charset.  The length of the new {@code
jaroslav@49
   589
     * String} is a function of the charset, and hence may not be equal to the
jaroslav@49
   590
     * length of the byte array.
jaroslav@49
   591
     *
jaroslav@49
   592
     * <p> The behavior of this constructor when the given bytes are not valid
jaroslav@49
   593
     * in the default charset is unspecified.  The {@link
jaroslav@49
   594
     * java.nio.charset.CharsetDecoder} class should be used when more control
jaroslav@49
   595
     * over the decoding process is required.
jaroslav@49
   596
     *
jaroslav@49
   597
     * @param  bytes
jaroslav@49
   598
     *         The bytes to be decoded into characters
jaroslav@49
   599
     *
jaroslav@49
   600
     * @since  JDK1.1
jaroslav@49
   601
     */
jaroslav@49
   602
    public String(byte bytes[]) {
jaroslav@49
   603
        this(bytes, 0, bytes.length);
jaroslav@49
   604
    }
jaroslav@49
   605
jaroslav@49
   606
    /**
jaroslav@49
   607
     * Allocates a new string that contains the sequence of characters
jaroslav@49
   608
     * currently contained in the string buffer argument. The contents of the
jaroslav@49
   609
     * string buffer are copied; subsequent modification of the string buffer
jaroslav@49
   610
     * does not affect the newly created string.
jaroslav@49
   611
     *
jaroslav@49
   612
     * @param  buffer
jaroslav@49
   613
     *         A {@code StringBuffer}
jaroslav@49
   614
     */
jaroslav@49
   615
    public String(StringBuffer buffer) {
jaroslav@49
   616
        String result = buffer.toString();
jaroslav@49
   617
        this.value = result.value;
jaroslav@49
   618
        this.count = result.count;
jaroslav@49
   619
        this.offset = result.offset;
jaroslav@49
   620
    }
jaroslav@49
   621
jaroslav@49
   622
    /**
jaroslav@49
   623
     * Allocates a new string that contains the sequence of characters
jaroslav@49
   624
     * currently contained in the string builder argument. The contents of the
jaroslav@49
   625
     * string builder are copied; subsequent modification of the string builder
jaroslav@49
   626
     * does not affect the newly created string.
jaroslav@49
   627
     *
jaroslav@49
   628
     * <p> This constructor is provided to ease migration to {@code
jaroslav@49
   629
     * StringBuilder}. Obtaining a string from a string builder via the {@code
jaroslav@49
   630
     * toString} method is likely to run faster and is generally preferred.
jaroslav@49
   631
     *
jaroslav@49
   632
     * @param   builder
jaroslav@49
   633
     *          A {@code StringBuilder}
jaroslav@49
   634
     *
jaroslav@49
   635
     * @since  1.5
jaroslav@49
   636
     */
jaroslav@49
   637
    public String(StringBuilder builder) {
jaroslav@49
   638
        String result = builder.toString();
jaroslav@49
   639
        this.value = result.value;
jaroslav@49
   640
        this.count = result.count;
jaroslav@49
   641
        this.offset = result.offset;
jaroslav@49
   642
    }
jaroslav@49
   643
jaroslav@49
   644
jaroslav@49
   645
    // Package private constructor which shares value array for speed.
jaroslav@49
   646
    String(int offset, int count, char value[]) {
jaroslav@49
   647
        this.value = value;
jaroslav@49
   648
        this.offset = offset;
jaroslav@49
   649
        this.count = count;
jaroslav@49
   650
    }
jaroslav@49
   651
jaroslav@49
   652
    /**
jaroslav@49
   653
     * Returns the length of this string.
jaroslav@49
   654
     * The length is equal to the number of <a href="Character.html#unicode">Unicode
jaroslav@49
   655
     * code units</a> in the string.
jaroslav@49
   656
     *
jaroslav@49
   657
     * @return  the length of the sequence of characters represented by this
jaroslav@49
   658
     *          object.
jaroslav@49
   659
     */
jaroslav@49
   660
    public int length() {
jaroslav@49
   661
        return count;
jaroslav@49
   662
    }
jaroslav@49
   663
jaroslav@49
   664
    /**
jaroslav@49
   665
     * Returns <tt>true</tt> if, and only if, {@link #length()} is <tt>0</tt>.
jaroslav@49
   666
     *
jaroslav@49
   667
     * @return <tt>true</tt> if {@link #length()} is <tt>0</tt>, otherwise
jaroslav@49
   668
     * <tt>false</tt>
jaroslav@49
   669
     *
jaroslav@49
   670
     * @since 1.6
jaroslav@49
   671
     */
jaroslav@49
   672
    public boolean isEmpty() {
jaroslav@49
   673
        return count == 0;
jaroslav@49
   674
    }
jaroslav@49
   675
jaroslav@49
   676
    /**
jaroslav@49
   677
     * Returns the <code>char</code> value at the
jaroslav@49
   678
     * specified index. An index ranges from <code>0</code> to
jaroslav@49
   679
     * <code>length() - 1</code>. The first <code>char</code> value of the sequence
jaroslav@49
   680
     * is at index <code>0</code>, the next at index <code>1</code>,
jaroslav@49
   681
     * and so on, as for array indexing.
jaroslav@49
   682
     *
jaroslav@49
   683
     * <p>If the <code>char</code> value specified by the index is a
jaroslav@49
   684
     * <a href="Character.html#unicode">surrogate</a>, the surrogate
jaroslav@49
   685
     * value is returned.
jaroslav@49
   686
     *
jaroslav@49
   687
     * @param      index   the index of the <code>char</code> value.
jaroslav@49
   688
     * @return     the <code>char</code> value at the specified index of this string.
jaroslav@49
   689
     *             The first <code>char</code> value is at index <code>0</code>.
jaroslav@49
   690
     * @exception  IndexOutOfBoundsException  if the <code>index</code>
jaroslav@49
   691
     *             argument is negative or not less than the length of this
jaroslav@49
   692
     *             string.
jaroslav@49
   693
     */
jaroslav@49
   694
    public char charAt(int index) {
jaroslav@49
   695
        if ((index < 0) || (index >= count)) {
jaroslav@49
   696
            throw new StringIndexOutOfBoundsException(index);
jaroslav@49
   697
        }
jaroslav@49
   698
        return value[index + offset];
jaroslav@49
   699
    }
jaroslav@49
   700
jaroslav@49
   701
    /**
jaroslav@49
   702
     * Returns the character (Unicode code point) at the specified
jaroslav@49
   703
     * index. The index refers to <code>char</code> values
jaroslav@49
   704
     * (Unicode code units) and ranges from <code>0</code> to
jaroslav@49
   705
     * {@link #length()}<code> - 1</code>.
jaroslav@49
   706
     *
jaroslav@49
   707
     * <p> If the <code>char</code> value specified at the given index
jaroslav@49
   708
     * is in the high-surrogate range, the following index is less
jaroslav@49
   709
     * than the length of this <code>String</code>, and the
jaroslav@49
   710
     * <code>char</code> value at the following index is in the
jaroslav@49
   711
     * low-surrogate range, then the supplementary code point
jaroslav@49
   712
     * corresponding to this surrogate pair is returned. Otherwise,
jaroslav@49
   713
     * the <code>char</code> value at the given index is returned.
jaroslav@49
   714
     *
jaroslav@49
   715
     * @param      index the index to the <code>char</code> values
jaroslav@49
   716
     * @return     the code point value of the character at the
jaroslav@49
   717
     *             <code>index</code>
jaroslav@49
   718
     * @exception  IndexOutOfBoundsException  if the <code>index</code>
jaroslav@49
   719
     *             argument is negative or not less than the length of this
jaroslav@49
   720
     *             string.
jaroslav@49
   721
     * @since      1.5
jaroslav@49
   722
     */
jaroslav@49
   723
    public int codePointAt(int index) {
jaroslav@49
   724
        if ((index < 0) || (index >= count)) {
jaroslav@49
   725
            throw new StringIndexOutOfBoundsException(index);
jaroslav@49
   726
        }
jaroslav@49
   727
        return Character.codePointAtImpl(value, offset + index, offset + count);
jaroslav@49
   728
    }
jaroslav@49
   729
jaroslav@49
   730
    /**
jaroslav@49
   731
     * Returns the character (Unicode code point) before the specified
jaroslav@49
   732
     * index. The index refers to <code>char</code> values
jaroslav@49
   733
     * (Unicode code units) and ranges from <code>1</code> to {@link
jaroslav@49
   734
     * CharSequence#length() length}.
jaroslav@49
   735
     *
jaroslav@49
   736
     * <p> If the <code>char</code> value at <code>(index - 1)</code>
jaroslav@49
   737
     * is in the low-surrogate range, <code>(index - 2)</code> is not
jaroslav@49
   738
     * negative, and the <code>char</code> value at <code>(index -
jaroslav@49
   739
     * 2)</code> is in the high-surrogate range, then the
jaroslav@49
   740
     * supplementary code point value of the surrogate pair is
jaroslav@49
   741
     * returned. If the <code>char</code> value at <code>index -
jaroslav@49
   742
     * 1</code> is an unpaired low-surrogate or a high-surrogate, the
jaroslav@49
   743
     * surrogate value is returned.
jaroslav@49
   744
     *
jaroslav@49
   745
     * @param     index the index following the code point that should be returned
jaroslav@49
   746
     * @return    the Unicode code point value before the given index.
jaroslav@49
   747
     * @exception IndexOutOfBoundsException if the <code>index</code>
jaroslav@49
   748
     *            argument is less than 1 or greater than the length
jaroslav@49
   749
     *            of this string.
jaroslav@49
   750
     * @since     1.5
jaroslav@49
   751
     */
jaroslav@49
   752
    public int codePointBefore(int index) {
jaroslav@49
   753
        int i = index - 1;
jaroslav@49
   754
        if ((i < 0) || (i >= count)) {
jaroslav@49
   755
            throw new StringIndexOutOfBoundsException(index);
jaroslav@49
   756
        }
jaroslav@49
   757
        return Character.codePointBeforeImpl(value, offset + index, offset);
jaroslav@49
   758
    }
jaroslav@49
   759
jaroslav@49
   760
    /**
jaroslav@49
   761
     * Returns the number of Unicode code points in the specified text
jaroslav@49
   762
     * range of this <code>String</code>. The text range begins at the
jaroslav@49
   763
     * specified <code>beginIndex</code> and extends to the
jaroslav@49
   764
     * <code>char</code> at index <code>endIndex - 1</code>. Thus the
jaroslav@49
   765
     * length (in <code>char</code>s) of the text range is
jaroslav@49
   766
     * <code>endIndex-beginIndex</code>. Unpaired surrogates within
jaroslav@49
   767
     * the text range count as one code point each.
jaroslav@49
   768
     *
jaroslav@49
   769
     * @param beginIndex the index to the first <code>char</code> of
jaroslav@49
   770
     * the text range.
jaroslav@49
   771
     * @param endIndex the index after the last <code>char</code> of
jaroslav@49
   772
     * the text range.
jaroslav@49
   773
     * @return the number of Unicode code points in the specified text
jaroslav@49
   774
     * range
jaroslav@49
   775
     * @exception IndexOutOfBoundsException if the
jaroslav@49
   776
     * <code>beginIndex</code> is negative, or <code>endIndex</code>
jaroslav@49
   777
     * is larger than the length of this <code>String</code>, or
jaroslav@49
   778
     * <code>beginIndex</code> is larger than <code>endIndex</code>.
jaroslav@49
   779
     * @since  1.5
jaroslav@49
   780
     */
jaroslav@49
   781
    public int codePointCount(int beginIndex, int endIndex) {
jaroslav@49
   782
        if (beginIndex < 0 || endIndex > count || beginIndex > endIndex) {
jaroslav@49
   783
            throw new IndexOutOfBoundsException();
jaroslav@49
   784
        }
jaroslav@49
   785
        return Character.codePointCountImpl(value, offset+beginIndex, endIndex-beginIndex);
jaroslav@49
   786
    }
jaroslav@49
   787
jaroslav@49
   788
    /**
jaroslav@49
   789
     * Returns the index within this <code>String</code> that is
jaroslav@49
   790
     * offset from the given <code>index</code> by
jaroslav@49
   791
     * <code>codePointOffset</code> code points. Unpaired surrogates
jaroslav@49
   792
     * within the text range given by <code>index</code> and
jaroslav@49
   793
     * <code>codePointOffset</code> count as one code point each.
jaroslav@49
   794
     *
jaroslav@49
   795
     * @param index the index to be offset
jaroslav@49
   796
     * @param codePointOffset the offset in code points
jaroslav@49
   797
     * @return the index within this <code>String</code>
jaroslav@49
   798
     * @exception IndexOutOfBoundsException if <code>index</code>
jaroslav@49
   799
     *   is negative or larger then the length of this
jaroslav@49
   800
     *   <code>String</code>, or if <code>codePointOffset</code> is positive
jaroslav@49
   801
     *   and the substring starting with <code>index</code> has fewer
jaroslav@49
   802
     *   than <code>codePointOffset</code> code points,
jaroslav@49
   803
     *   or if <code>codePointOffset</code> is negative and the substring
jaroslav@49
   804
     *   before <code>index</code> has fewer than the absolute value
jaroslav@49
   805
     *   of <code>codePointOffset</code> code points.
jaroslav@49
   806
     * @since 1.5
jaroslav@49
   807
     */
jaroslav@49
   808
    public int offsetByCodePoints(int index, int codePointOffset) {
jaroslav@49
   809
        if (index < 0 || index > count) {
jaroslav@49
   810
            throw new IndexOutOfBoundsException();
jaroslav@49
   811
        }
jaroslav@49
   812
        return Character.offsetByCodePointsImpl(value, offset, count,
jaroslav@49
   813
                                                offset+index, codePointOffset) - offset;
jaroslav@49
   814
    }
jaroslav@49
   815
jaroslav@49
   816
    /**
jaroslav@49
   817
     * Copy characters from this string into dst starting at dstBegin.
jaroslav@49
   818
     * This method doesn't perform any range checking.
jaroslav@49
   819
     */
jaroslav@49
   820
    void getChars(char dst[], int dstBegin) {
jaroslav@72
   821
        arraycopy(value, offset, dst, dstBegin, count);
jaroslav@49
   822
    }
jaroslav@49
   823
jaroslav@49
   824
    /**
jaroslav@49
   825
     * Copies characters from this string into the destination character
jaroslav@49
   826
     * array.
jaroslav@49
   827
     * <p>
jaroslav@49
   828
     * The first character to be copied is at index <code>srcBegin</code>;
jaroslav@49
   829
     * the last character to be copied is at index <code>srcEnd-1</code>
jaroslav@49
   830
     * (thus the total number of characters to be copied is
jaroslav@49
   831
     * <code>srcEnd-srcBegin</code>). The characters are copied into the
jaroslav@49
   832
     * subarray of <code>dst</code> starting at index <code>dstBegin</code>
jaroslav@49
   833
     * and ending at index:
jaroslav@49
   834
     * <p><blockquote><pre>
jaroslav@49
   835
     *     dstbegin + (srcEnd-srcBegin) - 1
jaroslav@49
   836
     * </pre></blockquote>
jaroslav@49
   837
     *
jaroslav@49
   838
     * @param      srcBegin   index of the first character in the string
jaroslav@49
   839
     *                        to copy.
jaroslav@49
   840
     * @param      srcEnd     index after the last character in the string
jaroslav@49
   841
     *                        to copy.
jaroslav@49
   842
     * @param      dst        the destination array.
jaroslav@49
   843
     * @param      dstBegin   the start offset in the destination array.
jaroslav@49
   844
     * @exception IndexOutOfBoundsException If any of the following
jaroslav@49
   845
     *            is true:
jaroslav@49
   846
     *            <ul><li><code>srcBegin</code> is negative.
jaroslav@49
   847
     *            <li><code>srcBegin</code> is greater than <code>srcEnd</code>
jaroslav@49
   848
     *            <li><code>srcEnd</code> is greater than the length of this
jaroslav@49
   849
     *                string
jaroslav@49
   850
     *            <li><code>dstBegin</code> is negative
jaroslav@49
   851
     *            <li><code>dstBegin+(srcEnd-srcBegin)</code> is larger than
jaroslav@49
   852
     *                <code>dst.length</code></ul>
jaroslav@49
   853
     */
jaroslav@49
   854
    public void getChars(int srcBegin, int srcEnd, char dst[], int dstBegin) {
jaroslav@49
   855
        if (srcBegin < 0) {
jaroslav@49
   856
            throw new StringIndexOutOfBoundsException(srcBegin);
jaroslav@49
   857
        }
jaroslav@49
   858
        if (srcEnd > count) {
jaroslav@49
   859
            throw new StringIndexOutOfBoundsException(srcEnd);
jaroslav@49
   860
        }
jaroslav@49
   861
        if (srcBegin > srcEnd) {
jaroslav@49
   862
            throw new StringIndexOutOfBoundsException(srcEnd - srcBegin);
jaroslav@49
   863
        }
jaroslav@72
   864
        arraycopy(value, offset + srcBegin, dst, dstBegin,
jaroslav@49
   865
             srcEnd - srcBegin);
jaroslav@49
   866
    }
jaroslav@49
   867
jaroslav@49
   868
    /**
jaroslav@49
   869
     * Copies characters from this string into the destination byte array. Each
jaroslav@49
   870
     * byte receives the 8 low-order bits of the corresponding character. The
jaroslav@49
   871
     * eight high-order bits of each character are not copied and do not
jaroslav@49
   872
     * participate in the transfer in any way.
jaroslav@49
   873
     *
jaroslav@49
   874
     * <p> The first character to be copied is at index {@code srcBegin}; the
jaroslav@49
   875
     * last character to be copied is at index {@code srcEnd-1}.  The total
jaroslav@49
   876
     * number of characters to be copied is {@code srcEnd-srcBegin}. The
jaroslav@49
   877
     * characters, converted to bytes, are copied into the subarray of {@code
jaroslav@49
   878
     * dst} starting at index {@code dstBegin} and ending at index:
jaroslav@49
   879
     *
jaroslav@49
   880
     * <blockquote><pre>
jaroslav@49
   881
     *     dstbegin + (srcEnd-srcBegin) - 1
jaroslav@49
   882
     * </pre></blockquote>
jaroslav@49
   883
     *
jaroslav@49
   884
     * @deprecated  This method does not properly convert characters into
jaroslav@49
   885
     * bytes.  As of JDK&nbsp;1.1, the preferred way to do this is via the
jaroslav@49
   886
     * {@link #getBytes()} method, which uses the platform's default charset.
jaroslav@49
   887
     *
jaroslav@49
   888
     * @param  srcBegin
jaroslav@49
   889
     *         Index of the first character in the string to copy
jaroslav@49
   890
     *
jaroslav@49
   891
     * @param  srcEnd
jaroslav@49
   892
     *         Index after the last character in the string to copy
jaroslav@49
   893
     *
jaroslav@49
   894
     * @param  dst
jaroslav@49
   895
     *         The destination array
jaroslav@49
   896
     *
jaroslav@49
   897
     * @param  dstBegin
jaroslav@49
   898
     *         The start offset in the destination array
jaroslav@49
   899
     *
jaroslav@49
   900
     * @throws  IndexOutOfBoundsException
jaroslav@49
   901
     *          If any of the following is true:
jaroslav@49
   902
     *          <ul>
jaroslav@49
   903
     *            <li> {@code srcBegin} is negative
jaroslav@49
   904
     *            <li> {@code srcBegin} is greater than {@code srcEnd}
jaroslav@49
   905
     *            <li> {@code srcEnd} is greater than the length of this String
jaroslav@49
   906
     *            <li> {@code dstBegin} is negative
jaroslav@49
   907
     *            <li> {@code dstBegin+(srcEnd-srcBegin)} is larger than {@code
jaroslav@49
   908
     *                 dst.length}
jaroslav@49
   909
     *          </ul>
jaroslav@49
   910
     */
jaroslav@49
   911
    @Deprecated
jaroslav@49
   912
    public void getBytes(int srcBegin, int srcEnd, byte dst[], int dstBegin) {
jaroslav@49
   913
        if (srcBegin < 0) {
jaroslav@49
   914
            throw new StringIndexOutOfBoundsException(srcBegin);
jaroslav@49
   915
        }
jaroslav@49
   916
        if (srcEnd > count) {
jaroslav@49
   917
            throw new StringIndexOutOfBoundsException(srcEnd);
jaroslav@49
   918
        }
jaroslav@49
   919
        if (srcBegin > srcEnd) {
jaroslav@49
   920
            throw new StringIndexOutOfBoundsException(srcEnd - srcBegin);
jaroslav@49
   921
        }
jaroslav@49
   922
        int j = dstBegin;
jaroslav@49
   923
        int n = offset + srcEnd;
jaroslav@49
   924
        int i = offset + srcBegin;
jaroslav@49
   925
        char[] val = value;   /* avoid getfield opcode */
jaroslav@49
   926
jaroslav@49
   927
        while (i < n) {
jaroslav@49
   928
            dst[j++] = (byte)val[i++];
jaroslav@49
   929
        }
jaroslav@49
   930
    }
jaroslav@49
   931
jaroslav@49
   932
    /**
jaroslav@49
   933
     * Encodes this {@code String} into a sequence of bytes using the named
jaroslav@49
   934
     * charset, storing the result into a new byte array.
jaroslav@49
   935
     *
jaroslav@49
   936
     * <p> The behavior of this method when this string cannot be encoded in
jaroslav@49
   937
     * the given charset is unspecified.  The {@link
jaroslav@49
   938
     * java.nio.charset.CharsetEncoder} class should be used when more control
jaroslav@49
   939
     * over the encoding process is required.
jaroslav@49
   940
     *
jaroslav@49
   941
     * @param  charsetName
jaroslav@49
   942
     *         The name of a supported {@linkplain java.nio.charset.Charset
jaroslav@49
   943
     *         charset}
jaroslav@49
   944
     *
jaroslav@49
   945
     * @return  The resultant byte array
jaroslav@49
   946
     *
jaroslav@49
   947
     * @throws  UnsupportedEncodingException
jaroslav@49
   948
     *          If the named charset is not supported
jaroslav@49
   949
     *
jaroslav@49
   950
     * @since  JDK1.1
jaroslav@49
   951
     */
jaroslav@74
   952
//    public byte[] getBytes(String charsetName)
jaroslav@74
   953
//        throws UnsupportedEncodingException
jaroslav@74
   954
//    {
jaroslav@74
   955
//        if (charsetName == null) throw new NullPointerException();
jaroslav@74
   956
//        return StringCoding.encode(charsetName, value, offset, count);
jaroslav@74
   957
//    }
jaroslav@49
   958
jaroslav@49
   959
    /**
jaroslav@49
   960
     * Encodes this {@code String} into a sequence of bytes using the given
jaroslav@49
   961
     * {@linkplain java.nio.charset.Charset charset}, storing the result into a
jaroslav@49
   962
     * new byte array.
jaroslav@49
   963
     *
jaroslav@49
   964
     * <p> This method always replaces malformed-input and unmappable-character
jaroslav@49
   965
     * sequences with this charset's default replacement byte array.  The
jaroslav@49
   966
     * {@link java.nio.charset.CharsetEncoder} class should be used when more
jaroslav@49
   967
     * control over the encoding process is required.
jaroslav@49
   968
     *
jaroslav@49
   969
     * @param  charset
jaroslav@49
   970
     *         The {@linkplain java.nio.charset.Charset} to be used to encode
jaroslav@49
   971
     *         the {@code String}
jaroslav@49
   972
     *
jaroslav@49
   973
     * @return  The resultant byte array
jaroslav@49
   974
     *
jaroslav@49
   975
     * @since  1.6
jaroslav@49
   976
     */
jaroslav@61
   977
    /* don't want dep on Charset
jaroslav@49
   978
    public byte[] getBytes(Charset charset) {
jaroslav@49
   979
        if (charset == null) throw new NullPointerException();
jaroslav@49
   980
        return StringCoding.encode(charset, value, offset, count);
jaroslav@49
   981
    }
jaroslav@61
   982
    */
jaroslav@49
   983
jaroslav@49
   984
    /**
jaroslav@49
   985
     * Encodes this {@code String} into a sequence of bytes using the
jaroslav@49
   986
     * platform's default charset, storing the result into a new byte array.
jaroslav@49
   987
     *
jaroslav@49
   988
     * <p> The behavior of this method when this string cannot be encoded in
jaroslav@49
   989
     * the default charset is unspecified.  The {@link
jaroslav@49
   990
     * java.nio.charset.CharsetEncoder} class should be used when more control
jaroslav@49
   991
     * over the encoding process is required.
jaroslav@49
   992
     *
jaroslav@49
   993
     * @return  The resultant byte array
jaroslav@49
   994
     *
jaroslav@49
   995
     * @since      JDK1.1
jaroslav@49
   996
     */
jaroslav@49
   997
    public byte[] getBytes() {
jaroslav@75
   998
        byte[] arr = new byte[length()];
jaroslav@75
   999
        for (int i = 0; i < arr.length; i++) {
jaroslav@75
  1000
            final char v = charAt(i);
jaroslav@75
  1001
            arr[i] = (byte)v;
jaroslav@75
  1002
        }
jaroslav@75
  1003
        return arr;
jaroslav@49
  1004
    }
jaroslav@49
  1005
jaroslav@49
  1006
    /**
jaroslav@49
  1007
     * Compares this string to the specified object.  The result is {@code
jaroslav@49
  1008
     * true} if and only if the argument is not {@code null} and is a {@code
jaroslav@49
  1009
     * String} object that represents the same sequence of characters as this
jaroslav@49
  1010
     * object.
jaroslav@49
  1011
     *
jaroslav@49
  1012
     * @param  anObject
jaroslav@49
  1013
     *         The object to compare this {@code String} against
jaroslav@49
  1014
     *
jaroslav@49
  1015
     * @return  {@code true} if the given object represents a {@code String}
jaroslav@49
  1016
     *          equivalent to this string, {@code false} otherwise
jaroslav@49
  1017
     *
jaroslav@49
  1018
     * @see  #compareTo(String)
jaroslav@49
  1019
     * @see  #equalsIgnoreCase(String)
jaroslav@49
  1020
     */
jaroslav@49
  1021
    public boolean equals(Object anObject) {
jaroslav@49
  1022
        if (this == anObject) {
jaroslav@49
  1023
            return true;
jaroslav@49
  1024
        }
jaroslav@49
  1025
        if (anObject instanceof String) {
jaroslav@49
  1026
            String anotherString = (String)anObject;
jaroslav@49
  1027
            int n = count;
jaroslav@49
  1028
            if (n == anotherString.count) {
jaroslav@49
  1029
                char v1[] = value;
jaroslav@49
  1030
                char v2[] = anotherString.value;
jaroslav@49
  1031
                int i = offset;
jaroslav@49
  1032
                int j = anotherString.offset;
jaroslav@49
  1033
                while (n-- != 0) {
jaroslav@49
  1034
                    if (v1[i++] != v2[j++])
jaroslav@49
  1035
                        return false;
jaroslav@49
  1036
                }
jaroslav@49
  1037
                return true;
jaroslav@49
  1038
            }
jaroslav@49
  1039
        }
jaroslav@49
  1040
        return false;
jaroslav@49
  1041
    }
jaroslav@49
  1042
jaroslav@49
  1043
    /**
jaroslav@49
  1044
     * Compares this string to the specified {@code StringBuffer}.  The result
jaroslav@49
  1045
     * is {@code true} if and only if this {@code String} represents the same
jaroslav@49
  1046
     * sequence of characters as the specified {@code StringBuffer}.
jaroslav@49
  1047
     *
jaroslav@49
  1048
     * @param  sb
jaroslav@49
  1049
     *         The {@code StringBuffer} to compare this {@code String} against
jaroslav@49
  1050
     *
jaroslav@49
  1051
     * @return  {@code true} if this {@code String} represents the same
jaroslav@49
  1052
     *          sequence of characters as the specified {@code StringBuffer},
jaroslav@49
  1053
     *          {@code false} otherwise
jaroslav@49
  1054
     *
jaroslav@49
  1055
     * @since  1.4
jaroslav@49
  1056
     */
jaroslav@49
  1057
    public boolean contentEquals(StringBuffer sb) {
jaroslav@49
  1058
        synchronized(sb) {
jaroslav@49
  1059
            return contentEquals((CharSequence)sb);
jaroslav@49
  1060
        }
jaroslav@49
  1061
    }
jaroslav@49
  1062
jaroslav@49
  1063
    /**
jaroslav@49
  1064
     * Compares this string to the specified {@code CharSequence}.  The result
jaroslav@49
  1065
     * is {@code true} if and only if this {@code String} represents the same
jaroslav@49
  1066
     * sequence of char values as the specified sequence.
jaroslav@49
  1067
     *
jaroslav@49
  1068
     * @param  cs
jaroslav@49
  1069
     *         The sequence to compare this {@code String} against
jaroslav@49
  1070
     *
jaroslav@49
  1071
     * @return  {@code true} if this {@code String} represents the same
jaroslav@49
  1072
     *          sequence of char values as the specified sequence, {@code
jaroslav@49
  1073
     *          false} otherwise
jaroslav@49
  1074
     *
jaroslav@49
  1075
     * @since  1.5
jaroslav@49
  1076
     */
jaroslav@49
  1077
    public boolean contentEquals(CharSequence cs) {
jaroslav@49
  1078
        if (count != cs.length())
jaroslav@49
  1079
            return false;
jaroslav@49
  1080
        // Argument is a StringBuffer, StringBuilder
jaroslav@49
  1081
        if (cs instanceof AbstractStringBuilder) {
jaroslav@49
  1082
            char v1[] = value;
jaroslav@49
  1083
            char v2[] = ((AbstractStringBuilder)cs).getValue();
jaroslav@49
  1084
            int i = offset;
jaroslav@49
  1085
            int j = 0;
jaroslav@49
  1086
            int n = count;
jaroslav@49
  1087
            while (n-- != 0) {
jaroslav@49
  1088
                if (v1[i++] != v2[j++])
jaroslav@49
  1089
                    return false;
jaroslav@49
  1090
            }
jaroslav@49
  1091
            return true;
jaroslav@49
  1092
        }
jaroslav@49
  1093
        // Argument is a String
jaroslav@49
  1094
        if (cs.equals(this))
jaroslav@49
  1095
            return true;
jaroslav@49
  1096
        // Argument is a generic CharSequence
jaroslav@49
  1097
        char v1[] = value;
jaroslav@49
  1098
        int i = offset;
jaroslav@49
  1099
        int j = 0;
jaroslav@49
  1100
        int n = count;
jaroslav@49
  1101
        while (n-- != 0) {
jaroslav@49
  1102
            if (v1[i++] != cs.charAt(j++))
jaroslav@49
  1103
                return false;
jaroslav@49
  1104
        }
jaroslav@49
  1105
        return true;
jaroslav@49
  1106
    }
jaroslav@49
  1107
jaroslav@49
  1108
    /**
jaroslav@49
  1109
     * Compares this {@code String} to another {@code String}, ignoring case
jaroslav@49
  1110
     * considerations.  Two strings are considered equal ignoring case if they
jaroslav@49
  1111
     * are of the same length and corresponding characters in the two strings
jaroslav@49
  1112
     * are equal ignoring case.
jaroslav@49
  1113
     *
jaroslav@49
  1114
     * <p> Two characters {@code c1} and {@code c2} are considered the same
jaroslav@49
  1115
     * ignoring case if at least one of the following is true:
jaroslav@49
  1116
     * <ul>
jaroslav@49
  1117
     *   <li> The two characters are the same (as compared by the
jaroslav@49
  1118
     *        {@code ==} operator)
jaroslav@49
  1119
     *   <li> Applying the method {@link
jaroslav@49
  1120
     *        java.lang.Character#toUpperCase(char)} to each character
jaroslav@49
  1121
     *        produces the same result
jaroslav@49
  1122
     *   <li> Applying the method {@link
jaroslav@49
  1123
     *        java.lang.Character#toLowerCase(char)} to each character
jaroslav@49
  1124
     *        produces the same result
jaroslav@49
  1125
     * </ul>
jaroslav@49
  1126
     *
jaroslav@49
  1127
     * @param  anotherString
jaroslav@49
  1128
     *         The {@code String} to compare this {@code String} against
jaroslav@49
  1129
     *
jaroslav@49
  1130
     * @return  {@code true} if the argument is not {@code null} and it
jaroslav@49
  1131
     *          represents an equivalent {@code String} ignoring case; {@code
jaroslav@49
  1132
     *          false} otherwise
jaroslav@49
  1133
     *
jaroslav@49
  1134
     * @see  #equals(Object)
jaroslav@49
  1135
     */
jaroslav@49
  1136
    public boolean equalsIgnoreCase(String anotherString) {
jaroslav@49
  1137
        return (this == anotherString) ? true :
jaroslav@49
  1138
               (anotherString != null) && (anotherString.count == count) &&
jaroslav@49
  1139
               regionMatches(true, 0, anotherString, 0, count);
jaroslav@49
  1140
    }
jaroslav@49
  1141
jaroslav@49
  1142
    /**
jaroslav@49
  1143
     * Compares two strings lexicographically.
jaroslav@49
  1144
     * The comparison is based on the Unicode value of each character in
jaroslav@49
  1145
     * the strings. The character sequence represented by this
jaroslav@49
  1146
     * <code>String</code> object is compared lexicographically to the
jaroslav@49
  1147
     * character sequence represented by the argument string. The result is
jaroslav@49
  1148
     * a negative integer if this <code>String</code> object
jaroslav@49
  1149
     * lexicographically precedes the argument string. The result is a
jaroslav@49
  1150
     * positive integer if this <code>String</code> object lexicographically
jaroslav@49
  1151
     * follows the argument string. The result is zero if the strings
jaroslav@49
  1152
     * are equal; <code>compareTo</code> returns <code>0</code> exactly when
jaroslav@49
  1153
     * the {@link #equals(Object)} method would return <code>true</code>.
jaroslav@49
  1154
     * <p>
jaroslav@49
  1155
     * This is the definition of lexicographic ordering. If two strings are
jaroslav@49
  1156
     * different, then either they have different characters at some index
jaroslav@49
  1157
     * that is a valid index for both strings, or their lengths are different,
jaroslav@49
  1158
     * or both. If they have different characters at one or more index
jaroslav@49
  1159
     * positions, let <i>k</i> be the smallest such index; then the string
jaroslav@49
  1160
     * whose character at position <i>k</i> has the smaller value, as
jaroslav@49
  1161
     * determined by using the &lt; operator, lexicographically precedes the
jaroslav@49
  1162
     * other string. In this case, <code>compareTo</code> returns the
jaroslav@49
  1163
     * difference of the two character values at position <code>k</code> in
jaroslav@49
  1164
     * the two string -- that is, the value:
jaroslav@49
  1165
     * <blockquote><pre>
jaroslav@49
  1166
     * this.charAt(k)-anotherString.charAt(k)
jaroslav@49
  1167
     * </pre></blockquote>
jaroslav@49
  1168
     * If there is no index position at which they differ, then the shorter
jaroslav@49
  1169
     * string lexicographically precedes the longer string. In this case,
jaroslav@49
  1170
     * <code>compareTo</code> returns the difference of the lengths of the
jaroslav@49
  1171
     * strings -- that is, the value:
jaroslav@49
  1172
     * <blockquote><pre>
jaroslav@49
  1173
     * this.length()-anotherString.length()
jaroslav@49
  1174
     * </pre></blockquote>
jaroslav@49
  1175
     *
jaroslav@49
  1176
     * @param   anotherString   the <code>String</code> to be compared.
jaroslav@49
  1177
     * @return  the value <code>0</code> if the argument string is equal to
jaroslav@49
  1178
     *          this string; a value less than <code>0</code> if this string
jaroslav@49
  1179
     *          is lexicographically less than the string argument; and a
jaroslav@49
  1180
     *          value greater than <code>0</code> if this string is
jaroslav@49
  1181
     *          lexicographically greater than the string argument.
jaroslav@49
  1182
     */
jaroslav@49
  1183
    public int compareTo(String anotherString) {
jaroslav@49
  1184
        int len1 = count;
jaroslav@49
  1185
        int len2 = anotherString.count;
jaroslav@49
  1186
        int n = Math.min(len1, len2);
jaroslav@49
  1187
        char v1[] = value;
jaroslav@49
  1188
        char v2[] = anotherString.value;
jaroslav@49
  1189
        int i = offset;
jaroslav@49
  1190
        int j = anotherString.offset;
jaroslav@49
  1191
jaroslav@49
  1192
        if (i == j) {
jaroslav@49
  1193
            int k = i;
jaroslav@49
  1194
            int lim = n + i;
jaroslav@49
  1195
            while (k < lim) {
jaroslav@49
  1196
                char c1 = v1[k];
jaroslav@49
  1197
                char c2 = v2[k];
jaroslav@49
  1198
                if (c1 != c2) {
jaroslav@49
  1199
                    return c1 - c2;
jaroslav@49
  1200
                }
jaroslav@49
  1201
                k++;
jaroslav@49
  1202
            }
jaroslav@49
  1203
        } else {
jaroslav@49
  1204
            while (n-- != 0) {
jaroslav@49
  1205
                char c1 = v1[i++];
jaroslav@49
  1206
                char c2 = v2[j++];
jaroslav@49
  1207
                if (c1 != c2) {
jaroslav@49
  1208
                    return c1 - c2;
jaroslav@49
  1209
                }
jaroslav@49
  1210
            }
jaroslav@49
  1211
        }
jaroslav@49
  1212
        return len1 - len2;
jaroslav@49
  1213
    }
jaroslav@49
  1214
jaroslav@49
  1215
    /**
jaroslav@49
  1216
     * A Comparator that orders <code>String</code> objects as by
jaroslav@49
  1217
     * <code>compareToIgnoreCase</code>. This comparator is serializable.
jaroslav@49
  1218
     * <p>
jaroslav@49
  1219
     * Note that this Comparator does <em>not</em> take locale into account,
jaroslav@49
  1220
     * and will result in an unsatisfactory ordering for certain locales.
jaroslav@49
  1221
     * The java.text package provides <em>Collators</em> to allow
jaroslav@49
  1222
     * locale-sensitive ordering.
jaroslav@49
  1223
     *
jaroslav@49
  1224
     * @see     java.text.Collator#compare(String, String)
jaroslav@49
  1225
     * @since   1.2
jaroslav@49
  1226
     */
jaroslav@49
  1227
    public static final Comparator<String> CASE_INSENSITIVE_ORDER
jaroslav@49
  1228
                                         = new CaseInsensitiveComparator();
jaroslav@49
  1229
    private static class CaseInsensitiveComparator
jaroslav@49
  1230
                         implements Comparator<String>, java.io.Serializable {
jaroslav@49
  1231
        // use serialVersionUID from JDK 1.2.2 for interoperability
jaroslav@49
  1232
        private static final long serialVersionUID = 8575799808933029326L;
jaroslav@49
  1233
jaroslav@49
  1234
        public int compare(String s1, String s2) {
jaroslav@49
  1235
            int n1 = s1.length();
jaroslav@49
  1236
            int n2 = s2.length();
jaroslav@49
  1237
            int min = Math.min(n1, n2);
jaroslav@49
  1238
            for (int i = 0; i < min; i++) {
jaroslav@49
  1239
                char c1 = s1.charAt(i);
jaroslav@49
  1240
                char c2 = s2.charAt(i);
jaroslav@49
  1241
                if (c1 != c2) {
jaroslav@49
  1242
                    c1 = Character.toUpperCase(c1);
jaroslav@49
  1243
                    c2 = Character.toUpperCase(c2);
jaroslav@49
  1244
                    if (c1 != c2) {
jaroslav@49
  1245
                        c1 = Character.toLowerCase(c1);
jaroslav@49
  1246
                        c2 = Character.toLowerCase(c2);
jaroslav@49
  1247
                        if (c1 != c2) {
jaroslav@49
  1248
                            // No overflow because of numeric promotion
jaroslav@49
  1249
                            return c1 - c2;
jaroslav@49
  1250
                        }
jaroslav@49
  1251
                    }
jaroslav@49
  1252
                }
jaroslav@49
  1253
            }
jaroslav@49
  1254
            return n1 - n2;
jaroslav@49
  1255
        }
jaroslav@49
  1256
    }
jaroslav@49
  1257
jaroslav@49
  1258
    /**
jaroslav@49
  1259
     * Compares two strings lexicographically, ignoring case
jaroslav@49
  1260
     * differences. This method returns an integer whose sign is that of
jaroslav@49
  1261
     * calling <code>compareTo</code> with normalized versions of the strings
jaroslav@49
  1262
     * where case differences have been eliminated by calling
jaroslav@49
  1263
     * <code>Character.toLowerCase(Character.toUpperCase(character))</code> on
jaroslav@49
  1264
     * each character.
jaroslav@49
  1265
     * <p>
jaroslav@49
  1266
     * Note that this method does <em>not</em> take locale into account,
jaroslav@49
  1267
     * and will result in an unsatisfactory ordering for certain locales.
jaroslav@49
  1268
     * The java.text package provides <em>collators</em> to allow
jaroslav@49
  1269
     * locale-sensitive ordering.
jaroslav@49
  1270
     *
jaroslav@49
  1271
     * @param   str   the <code>String</code> to be compared.
jaroslav@49
  1272
     * @return  a negative integer, zero, or a positive integer as the
jaroslav@49
  1273
     *          specified String is greater than, equal to, or less
jaroslav@49
  1274
     *          than this String, ignoring case considerations.
jaroslav@49
  1275
     * @see     java.text.Collator#compare(String, String)
jaroslav@49
  1276
     * @since   1.2
jaroslav@49
  1277
     */
jaroslav@49
  1278
    public int compareToIgnoreCase(String str) {
jaroslav@49
  1279
        return CASE_INSENSITIVE_ORDER.compare(this, str);
jaroslav@49
  1280
    }
jaroslav@49
  1281
jaroslav@49
  1282
    /**
jaroslav@49
  1283
     * Tests if two string regions are equal.
jaroslav@49
  1284
     * <p>
jaroslav@49
  1285
     * A substring of this <tt>String</tt> object is compared to a substring
jaroslav@49
  1286
     * of the argument other. The result is true if these substrings
jaroslav@49
  1287
     * represent identical character sequences. The substring of this
jaroslav@49
  1288
     * <tt>String</tt> object to be compared begins at index <tt>toffset</tt>
jaroslav@49
  1289
     * and has length <tt>len</tt>. The substring of other to be compared
jaroslav@49
  1290
     * begins at index <tt>ooffset</tt> and has length <tt>len</tt>. The
jaroslav@49
  1291
     * result is <tt>false</tt> if and only if at least one of the following
jaroslav@49
  1292
     * is true:
jaroslav@49
  1293
     * <ul><li><tt>toffset</tt> is negative.
jaroslav@49
  1294
     * <li><tt>ooffset</tt> is negative.
jaroslav@49
  1295
     * <li><tt>toffset+len</tt> is greater than the length of this
jaroslav@49
  1296
     * <tt>String</tt> object.
jaroslav@49
  1297
     * <li><tt>ooffset+len</tt> is greater than the length of the other
jaroslav@49
  1298
     * argument.
jaroslav@49
  1299
     * <li>There is some nonnegative integer <i>k</i> less than <tt>len</tt>
jaroslav@49
  1300
     * such that:
jaroslav@49
  1301
     * <tt>this.charAt(toffset+<i>k</i>)&nbsp;!=&nbsp;other.charAt(ooffset+<i>k</i>)</tt>
jaroslav@49
  1302
     * </ul>
jaroslav@49
  1303
     *
jaroslav@49
  1304
     * @param   toffset   the starting offset of the subregion in this string.
jaroslav@49
  1305
     * @param   other     the string argument.
jaroslav@49
  1306
     * @param   ooffset   the starting offset of the subregion in the string
jaroslav@49
  1307
     *                    argument.
jaroslav@49
  1308
     * @param   len       the number of characters to compare.
jaroslav@49
  1309
     * @return  <code>true</code> if the specified subregion of this string
jaroslav@49
  1310
     *          exactly matches the specified subregion of the string argument;
jaroslav@49
  1311
     *          <code>false</code> otherwise.
jaroslav@49
  1312
     */
jaroslav@49
  1313
    public boolean regionMatches(int toffset, String other, int ooffset,
jaroslav@49
  1314
                                 int len) {
jaroslav@49
  1315
        char ta[] = value;
jaroslav@49
  1316
        int to = offset + toffset;
jaroslav@49
  1317
        char pa[] = other.value;
jaroslav@49
  1318
        int po = other.offset + ooffset;
jaroslav@49
  1319
        // Note: toffset, ooffset, or len might be near -1>>>1.
jaroslav@49
  1320
        if ((ooffset < 0) || (toffset < 0) || (toffset > (long)count - len)
jaroslav@49
  1321
            || (ooffset > (long)other.count - len)) {
jaroslav@49
  1322
            return false;
jaroslav@49
  1323
        }
jaroslav@49
  1324
        while (len-- > 0) {
jaroslav@49
  1325
            if (ta[to++] != pa[po++]) {
jaroslav@49
  1326
                return false;
jaroslav@49
  1327
            }
jaroslav@49
  1328
        }
jaroslav@49
  1329
        return true;
jaroslav@49
  1330
    }
jaroslav@49
  1331
jaroslav@49
  1332
    /**
jaroslav@49
  1333
     * Tests if two string regions are equal.
jaroslav@49
  1334
     * <p>
jaroslav@49
  1335
     * A substring of this <tt>String</tt> object is compared to a substring
jaroslav@49
  1336
     * of the argument <tt>other</tt>. The result is <tt>true</tt> if these
jaroslav@49
  1337
     * substrings represent character sequences that are the same, ignoring
jaroslav@49
  1338
     * case if and only if <tt>ignoreCase</tt> is true. The substring of
jaroslav@49
  1339
     * this <tt>String</tt> object to be compared begins at index
jaroslav@49
  1340
     * <tt>toffset</tt> and has length <tt>len</tt>. The substring of
jaroslav@49
  1341
     * <tt>other</tt> to be compared begins at index <tt>ooffset</tt> and
jaroslav@49
  1342
     * has length <tt>len</tt>. The result is <tt>false</tt> if and only if
jaroslav@49
  1343
     * at least one of the following is true:
jaroslav@49
  1344
     * <ul><li><tt>toffset</tt> is negative.
jaroslav@49
  1345
     * <li><tt>ooffset</tt> is negative.
jaroslav@49
  1346
     * <li><tt>toffset+len</tt> is greater than the length of this
jaroslav@49
  1347
     * <tt>String</tt> object.
jaroslav@49
  1348
     * <li><tt>ooffset+len</tt> is greater than the length of the other
jaroslav@49
  1349
     * argument.
jaroslav@49
  1350
     * <li><tt>ignoreCase</tt> is <tt>false</tt> and there is some nonnegative
jaroslav@49
  1351
     * integer <i>k</i> less than <tt>len</tt> such that:
jaroslav@49
  1352
     * <blockquote><pre>
jaroslav@49
  1353
     * this.charAt(toffset+k) != other.charAt(ooffset+k)
jaroslav@49
  1354
     * </pre></blockquote>
jaroslav@49
  1355
     * <li><tt>ignoreCase</tt> is <tt>true</tt> and there is some nonnegative
jaroslav@49
  1356
     * integer <i>k</i> less than <tt>len</tt> such that:
jaroslav@49
  1357
     * <blockquote><pre>
jaroslav@49
  1358
     * Character.toLowerCase(this.charAt(toffset+k)) !=
jaroslav@49
  1359
               Character.toLowerCase(other.charAt(ooffset+k))
jaroslav@49
  1360
     * </pre></blockquote>
jaroslav@49
  1361
     * and:
jaroslav@49
  1362
     * <blockquote><pre>
jaroslav@49
  1363
     * Character.toUpperCase(this.charAt(toffset+k)) !=
jaroslav@49
  1364
     *         Character.toUpperCase(other.charAt(ooffset+k))
jaroslav@49
  1365
     * </pre></blockquote>
jaroslav@49
  1366
     * </ul>
jaroslav@49
  1367
     *
jaroslav@49
  1368
     * @param   ignoreCase   if <code>true</code>, ignore case when comparing
jaroslav@49
  1369
     *                       characters.
jaroslav@49
  1370
     * @param   toffset      the starting offset of the subregion in this
jaroslav@49
  1371
     *                       string.
jaroslav@49
  1372
     * @param   other        the string argument.
jaroslav@49
  1373
     * @param   ooffset      the starting offset of the subregion in the string
jaroslav@49
  1374
     *                       argument.
jaroslav@49
  1375
     * @param   len          the number of characters to compare.
jaroslav@49
  1376
     * @return  <code>true</code> if the specified subregion of this string
jaroslav@49
  1377
     *          matches the specified subregion of the string argument;
jaroslav@49
  1378
     *          <code>false</code> otherwise. Whether the matching is exact
jaroslav@49
  1379
     *          or case insensitive depends on the <code>ignoreCase</code>
jaroslav@49
  1380
     *          argument.
jaroslav@49
  1381
     */
jaroslav@49
  1382
    public boolean regionMatches(boolean ignoreCase, int toffset,
jaroslav@49
  1383
                           String other, int ooffset, int len) {
jaroslav@49
  1384
        char ta[] = value;
jaroslav@49
  1385
        int to = offset + toffset;
jaroslav@49
  1386
        char pa[] = other.value;
jaroslav@49
  1387
        int po = other.offset + ooffset;
jaroslav@49
  1388
        // Note: toffset, ooffset, or len might be near -1>>>1.
jaroslav@49
  1389
        if ((ooffset < 0) || (toffset < 0) || (toffset > (long)count - len) ||
jaroslav@49
  1390
                (ooffset > (long)other.count - len)) {
jaroslav@49
  1391
            return false;
jaroslav@49
  1392
        }
jaroslav@49
  1393
        while (len-- > 0) {
jaroslav@49
  1394
            char c1 = ta[to++];
jaroslav@49
  1395
            char c2 = pa[po++];
jaroslav@49
  1396
            if (c1 == c2) {
jaroslav@49
  1397
                continue;
jaroslav@49
  1398
            }
jaroslav@49
  1399
            if (ignoreCase) {
jaroslav@49
  1400
                // If characters don't match but case may be ignored,
jaroslav@49
  1401
                // try converting both characters to uppercase.
jaroslav@49
  1402
                // If the results match, then the comparison scan should
jaroslav@49
  1403
                // continue.
jaroslav@49
  1404
                char u1 = Character.toUpperCase(c1);
jaroslav@49
  1405
                char u2 = Character.toUpperCase(c2);
jaroslav@49
  1406
                if (u1 == u2) {
jaroslav@49
  1407
                    continue;
jaroslav@49
  1408
                }
jaroslav@49
  1409
                // Unfortunately, conversion to uppercase does not work properly
jaroslav@49
  1410
                // for the Georgian alphabet, which has strange rules about case
jaroslav@49
  1411
                // conversion.  So we need to make one last check before
jaroslav@49
  1412
                // exiting.
jaroslav@49
  1413
                if (Character.toLowerCase(u1) == Character.toLowerCase(u2)) {
jaroslav@49
  1414
                    continue;
jaroslav@49
  1415
                }
jaroslav@49
  1416
            }
jaroslav@49
  1417
            return false;
jaroslav@49
  1418
        }
jaroslav@49
  1419
        return true;
jaroslav@49
  1420
    }
jaroslav@49
  1421
jaroslav@49
  1422
    /**
jaroslav@49
  1423
     * Tests if the substring of this string beginning at the
jaroslav@49
  1424
     * specified index starts with the specified prefix.
jaroslav@49
  1425
     *
jaroslav@49
  1426
     * @param   prefix    the prefix.
jaroslav@49
  1427
     * @param   toffset   where to begin looking in this string.
jaroslav@49
  1428
     * @return  <code>true</code> if the character sequence represented by the
jaroslav@49
  1429
     *          argument is a prefix of the substring of this object starting
jaroslav@49
  1430
     *          at index <code>toffset</code>; <code>false</code> otherwise.
jaroslav@49
  1431
     *          The result is <code>false</code> if <code>toffset</code> is
jaroslav@49
  1432
     *          negative or greater than the length of this
jaroslav@49
  1433
     *          <code>String</code> object; otherwise the result is the same
jaroslav@49
  1434
     *          as the result of the expression
jaroslav@49
  1435
     *          <pre>
jaroslav@49
  1436
     *          this.substring(toffset).startsWith(prefix)
jaroslav@49
  1437
     *          </pre>
jaroslav@49
  1438
     */
jaroslav@49
  1439
    public boolean startsWith(String prefix, int toffset) {
jaroslav@49
  1440
        char ta[] = value;
jaroslav@49
  1441
        int to = offset + toffset;
jaroslav@49
  1442
        char pa[] = prefix.value;
jaroslav@49
  1443
        int po = prefix.offset;
jaroslav@49
  1444
        int pc = prefix.count;
jaroslav@49
  1445
        // Note: toffset might be near -1>>>1.
jaroslav@49
  1446
        if ((toffset < 0) || (toffset > count - pc)) {
jaroslav@49
  1447
            return false;
jaroslav@49
  1448
        }
jaroslav@49
  1449
        while (--pc >= 0) {
jaroslav@49
  1450
            if (ta[to++] != pa[po++]) {
jaroslav@49
  1451
                return false;
jaroslav@49
  1452
            }
jaroslav@49
  1453
        }
jaroslav@49
  1454
        return true;
jaroslav@49
  1455
    }
jaroslav@49
  1456
jaroslav@49
  1457
    /**
jaroslav@49
  1458
     * Tests if this string starts with the specified prefix.
jaroslav@49
  1459
     *
jaroslav@49
  1460
     * @param   prefix   the prefix.
jaroslav@49
  1461
     * @return  <code>true</code> if the character sequence represented by the
jaroslav@49
  1462
     *          argument is a prefix of the character sequence represented by
jaroslav@49
  1463
     *          this string; <code>false</code> otherwise.
jaroslav@49
  1464
     *          Note also that <code>true</code> will be returned if the
jaroslav@49
  1465
     *          argument is an empty string or is equal to this
jaroslav@49
  1466
     *          <code>String</code> object as determined by the
jaroslav@49
  1467
     *          {@link #equals(Object)} method.
jaroslav@49
  1468
     * @since   1. 0
jaroslav@49
  1469
     */
jaroslav@49
  1470
    public boolean startsWith(String prefix) {
jaroslav@49
  1471
        return startsWith(prefix, 0);
jaroslav@49
  1472
    }
jaroslav@49
  1473
jaroslav@49
  1474
    /**
jaroslav@49
  1475
     * Tests if this string ends with the specified suffix.
jaroslav@49
  1476
     *
jaroslav@49
  1477
     * @param   suffix   the suffix.
jaroslav@49
  1478
     * @return  <code>true</code> if the character sequence represented by the
jaroslav@49
  1479
     *          argument is a suffix of the character sequence represented by
jaroslav@49
  1480
     *          this object; <code>false</code> otherwise. Note that the
jaroslav@49
  1481
     *          result will be <code>true</code> if the argument is the
jaroslav@49
  1482
     *          empty string or is equal to this <code>String</code> object
jaroslav@49
  1483
     *          as determined by the {@link #equals(Object)} method.
jaroslav@49
  1484
     */
jaroslav@49
  1485
    public boolean endsWith(String suffix) {
jaroslav@49
  1486
        return startsWith(suffix, count - suffix.count);
jaroslav@49
  1487
    }
jaroslav@49
  1488
jaroslav@49
  1489
    /**
jaroslav@49
  1490
     * Returns a hash code for this string. The hash code for a
jaroslav@49
  1491
     * <code>String</code> object is computed as
jaroslav@49
  1492
     * <blockquote><pre>
jaroslav@49
  1493
     * s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]
jaroslav@49
  1494
     * </pre></blockquote>
jaroslav@49
  1495
     * using <code>int</code> arithmetic, where <code>s[i]</code> is the
jaroslav@49
  1496
     * <i>i</i>th character of the string, <code>n</code> is the length of
jaroslav@49
  1497
     * the string, and <code>^</code> indicates exponentiation.
jaroslav@49
  1498
     * (The hash value of the empty string is zero.)
jaroslav@49
  1499
     *
jaroslav@49
  1500
     * @return  a hash code value for this object.
jaroslav@49
  1501
     */
jaroslav@49
  1502
    public int hashCode() {
jaroslav@49
  1503
        int h = hash;
jaroslav@49
  1504
        if (h == 0 && count > 0) {
jaroslav@49
  1505
            int off = offset;
jaroslav@49
  1506
            char val[] = value;
jaroslav@49
  1507
            int len = count;
jaroslav@49
  1508
jaroslav@49
  1509
            for (int i = 0; i < len; i++) {
jaroslav@49
  1510
                h = 31*h + val[off++];
jaroslav@49
  1511
            }
jaroslav@49
  1512
            hash = h;
jaroslav@49
  1513
        }
jaroslav@49
  1514
        return h;
jaroslav@49
  1515
    }
jaroslav@49
  1516
jaroslav@49
  1517
    /**
jaroslav@49
  1518
     * Returns the index within this string of the first occurrence of
jaroslav@49
  1519
     * the specified character. If a character with value
jaroslav@49
  1520
     * <code>ch</code> occurs in the character sequence represented by
jaroslav@49
  1521
     * this <code>String</code> object, then the index (in Unicode
jaroslav@49
  1522
     * code units) of the first such occurrence is returned. For
jaroslav@49
  1523
     * values of <code>ch</code> in the range from 0 to 0xFFFF
jaroslav@49
  1524
     * (inclusive), this is the smallest value <i>k</i> such that:
jaroslav@49
  1525
     * <blockquote><pre>
jaroslav@49
  1526
     * this.charAt(<i>k</i>) == ch
jaroslav@49
  1527
     * </pre></blockquote>
jaroslav@49
  1528
     * is true. For other values of <code>ch</code>, it is the
jaroslav@49
  1529
     * smallest value <i>k</i> such that:
jaroslav@49
  1530
     * <blockquote><pre>
jaroslav@49
  1531
     * this.codePointAt(<i>k</i>) == ch
jaroslav@49
  1532
     * </pre></blockquote>
jaroslav@49
  1533
     * is true. In either case, if no such character occurs in this
jaroslav@49
  1534
     * string, then <code>-1</code> is returned.
jaroslav@49
  1535
     *
jaroslav@49
  1536
     * @param   ch   a character (Unicode code point).
jaroslav@49
  1537
     * @return  the index of the first occurrence of the character in the
jaroslav@49
  1538
     *          character sequence represented by this object, or
jaroslav@49
  1539
     *          <code>-1</code> if the character does not occur.
jaroslav@49
  1540
     */
jaroslav@49
  1541
    public int indexOf(int ch) {
jaroslav@49
  1542
        return indexOf(ch, 0);
jaroslav@49
  1543
    }
jaroslav@49
  1544
jaroslav@49
  1545
    /**
jaroslav@49
  1546
     * Returns the index within this string of the first occurrence of the
jaroslav@49
  1547
     * specified character, starting the search at the specified index.
jaroslav@49
  1548
     * <p>
jaroslav@49
  1549
     * If a character with value <code>ch</code> occurs in the
jaroslav@49
  1550
     * character sequence represented by this <code>String</code>
jaroslav@49
  1551
     * object at an index no smaller than <code>fromIndex</code>, then
jaroslav@49
  1552
     * the index of the first such occurrence is returned. For values
jaroslav@49
  1553
     * of <code>ch</code> in the range from 0 to 0xFFFF (inclusive),
jaroslav@49
  1554
     * this is the smallest value <i>k</i> such that:
jaroslav@49
  1555
     * <blockquote><pre>
jaroslav@49
  1556
     * (this.charAt(<i>k</i>) == ch) && (<i>k</i> &gt;= fromIndex)
jaroslav@49
  1557
     * </pre></blockquote>
jaroslav@49
  1558
     * is true. For other values of <code>ch</code>, it is the
jaroslav@49
  1559
     * smallest value <i>k</i> such that:
jaroslav@49
  1560
     * <blockquote><pre>
jaroslav@49
  1561
     * (this.codePointAt(<i>k</i>) == ch) && (<i>k</i> &gt;= fromIndex)
jaroslav@49
  1562
     * </pre></blockquote>
jaroslav@49
  1563
     * is true. In either case, if no such character occurs in this
jaroslav@49
  1564
     * string at or after position <code>fromIndex</code>, then
jaroslav@49
  1565
     * <code>-1</code> is returned.
jaroslav@49
  1566
     *
jaroslav@49
  1567
     * <p>
jaroslav@49
  1568
     * There is no restriction on the value of <code>fromIndex</code>. If it
jaroslav@49
  1569
     * is negative, it has the same effect as if it were zero: this entire
jaroslav@49
  1570
     * string may be searched. If it is greater than the length of this
jaroslav@49
  1571
     * string, it has the same effect as if it were equal to the length of
jaroslav@49
  1572
     * this string: <code>-1</code> is returned.
jaroslav@49
  1573
     *
jaroslav@49
  1574
     * <p>All indices are specified in <code>char</code> values
jaroslav@49
  1575
     * (Unicode code units).
jaroslav@49
  1576
     *
jaroslav@49
  1577
     * @param   ch          a character (Unicode code point).
jaroslav@49
  1578
     * @param   fromIndex   the index to start the search from.
jaroslav@49
  1579
     * @return  the index of the first occurrence of the character in the
jaroslav@49
  1580
     *          character sequence represented by this object that is greater
jaroslav@49
  1581
     *          than or equal to <code>fromIndex</code>, or <code>-1</code>
jaroslav@49
  1582
     *          if the character does not occur.
jaroslav@49
  1583
     */
jaroslav@49
  1584
    public int indexOf(int ch, int fromIndex) {
jaroslav@49
  1585
        if (fromIndex < 0) {
jaroslav@49
  1586
            fromIndex = 0;
jaroslav@49
  1587
        } else if (fromIndex >= count) {
jaroslav@49
  1588
            // Note: fromIndex might be near -1>>>1.
jaroslav@49
  1589
            return -1;
jaroslav@49
  1590
        }
jaroslav@49
  1591
jaroslav@49
  1592
        if (ch < Character.MIN_SUPPLEMENTARY_CODE_POINT) {
jaroslav@49
  1593
            // handle most cases here (ch is a BMP code point or a
jaroslav@49
  1594
            // negative value (invalid code point))
jaroslav@49
  1595
            final char[] value = this.value;
jaroslav@49
  1596
            final int offset = this.offset;
jaroslav@49
  1597
            final int max = offset + count;
jaroslav@49
  1598
            for (int i = offset + fromIndex; i < max ; i++) {
jaroslav@49
  1599
                if (value[i] == ch) {
jaroslav@49
  1600
                    return i - offset;
jaroslav@49
  1601
                }
jaroslav@49
  1602
            }
jaroslav@49
  1603
            return -1;
jaroslav@49
  1604
        } else {
jaroslav@49
  1605
            return indexOfSupplementary(ch, fromIndex);
jaroslav@49
  1606
        }
jaroslav@49
  1607
    }
jaroslav@49
  1608
jaroslav@49
  1609
    /**
jaroslav@49
  1610
     * Handles (rare) calls of indexOf with a supplementary character.
jaroslav@49
  1611
     */
jaroslav@49
  1612
    private int indexOfSupplementary(int ch, int fromIndex) {
jaroslav@49
  1613
        if (Character.isValidCodePoint(ch)) {
jaroslav@49
  1614
            final char[] value = this.value;
jaroslav@49
  1615
            final int offset = this.offset;
jaroslav@49
  1616
            final char hi = Character.highSurrogate(ch);
jaroslav@49
  1617
            final char lo = Character.lowSurrogate(ch);
jaroslav@49
  1618
            final int max = offset + count - 1;
jaroslav@49
  1619
            for (int i = offset + fromIndex; i < max; i++) {
jaroslav@49
  1620
                if (value[i] == hi && value[i+1] == lo) {
jaroslav@49
  1621
                    return i - offset;
jaroslav@49
  1622
                }
jaroslav@49
  1623
            }
jaroslav@49
  1624
        }
jaroslav@49
  1625
        return -1;
jaroslav@49
  1626
    }
jaroslav@49
  1627
jaroslav@49
  1628
    /**
jaroslav@49
  1629
     * Returns the index within this string of the last occurrence of
jaroslav@49
  1630
     * the specified character. For values of <code>ch</code> in the
jaroslav@49
  1631
     * range from 0 to 0xFFFF (inclusive), the index (in Unicode code
jaroslav@49
  1632
     * units) returned is the largest value <i>k</i> such that:
jaroslav@49
  1633
     * <blockquote><pre>
jaroslav@49
  1634
     * this.charAt(<i>k</i>) == ch
jaroslav@49
  1635
     * </pre></blockquote>
jaroslav@49
  1636
     * is true. For other values of <code>ch</code>, it is the
jaroslav@49
  1637
     * largest value <i>k</i> such that:
jaroslav@49
  1638
     * <blockquote><pre>
jaroslav@49
  1639
     * this.codePointAt(<i>k</i>) == ch
jaroslav@49
  1640
     * </pre></blockquote>
jaroslav@49
  1641
     * is true.  In either case, if no such character occurs in this
jaroslav@49
  1642
     * string, then <code>-1</code> is returned.  The
jaroslav@49
  1643
     * <code>String</code> is searched backwards starting at the last
jaroslav@49
  1644
     * character.
jaroslav@49
  1645
     *
jaroslav@49
  1646
     * @param   ch   a character (Unicode code point).
jaroslav@49
  1647
     * @return  the index of the last occurrence of the character in the
jaroslav@49
  1648
     *          character sequence represented by this object, or
jaroslav@49
  1649
     *          <code>-1</code> if the character does not occur.
jaroslav@49
  1650
     */
jaroslav@49
  1651
    public int lastIndexOf(int ch) {
jaroslav@49
  1652
        return lastIndexOf(ch, count - 1);
jaroslav@49
  1653
    }
jaroslav@49
  1654
jaroslav@49
  1655
    /**
jaroslav@49
  1656
     * Returns the index within this string of the last occurrence of
jaroslav@49
  1657
     * the specified character, searching backward starting at the
jaroslav@49
  1658
     * specified index. For values of <code>ch</code> in the range
jaroslav@49
  1659
     * from 0 to 0xFFFF (inclusive), the index returned is the largest
jaroslav@49
  1660
     * value <i>k</i> such that:
jaroslav@49
  1661
     * <blockquote><pre>
jaroslav@49
  1662
     * (this.charAt(<i>k</i>) == ch) && (<i>k</i> &lt;= fromIndex)
jaroslav@49
  1663
     * </pre></blockquote>
jaroslav@49
  1664
     * is true. For other values of <code>ch</code>, it is the
jaroslav@49
  1665
     * largest value <i>k</i> such that:
jaroslav@49
  1666
     * <blockquote><pre>
jaroslav@49
  1667
     * (this.codePointAt(<i>k</i>) == ch) && (<i>k</i> &lt;= fromIndex)
jaroslav@49
  1668
     * </pre></blockquote>
jaroslav@49
  1669
     * is true. In either case, if no such character occurs in this
jaroslav@49
  1670
     * string at or before position <code>fromIndex</code>, then
jaroslav@49
  1671
     * <code>-1</code> is returned.
jaroslav@49
  1672
     *
jaroslav@49
  1673
     * <p>All indices are specified in <code>char</code> values
jaroslav@49
  1674
     * (Unicode code units).
jaroslav@49
  1675
     *
jaroslav@49
  1676
     * @param   ch          a character (Unicode code point).
jaroslav@49
  1677
     * @param   fromIndex   the index to start the search from. There is no
jaroslav@49
  1678
     *          restriction on the value of <code>fromIndex</code>. If it is
jaroslav@49
  1679
     *          greater than or equal to the length of this string, it has
jaroslav@49
  1680
     *          the same effect as if it were equal to one less than the
jaroslav@49
  1681
     *          length of this string: this entire string may be searched.
jaroslav@49
  1682
     *          If it is negative, it has the same effect as if it were -1:
jaroslav@49
  1683
     *          -1 is returned.
jaroslav@49
  1684
     * @return  the index of the last occurrence of the character in the
jaroslav@49
  1685
     *          character sequence represented by this object that is less
jaroslav@49
  1686
     *          than or equal to <code>fromIndex</code>, or <code>-1</code>
jaroslav@49
  1687
     *          if the character does not occur before that point.
jaroslav@49
  1688
     */
jaroslav@49
  1689
    public int lastIndexOf(int ch, int fromIndex) {
jaroslav@49
  1690
        if (ch < Character.MIN_SUPPLEMENTARY_CODE_POINT) {
jaroslav@49
  1691
            // handle most cases here (ch is a BMP code point or a
jaroslav@49
  1692
            // negative value (invalid code point))
jaroslav@49
  1693
            final char[] value = this.value;
jaroslav@49
  1694
            final int offset = this.offset;
jaroslav@49
  1695
            int i = offset + Math.min(fromIndex, count - 1);
jaroslav@49
  1696
            for (; i >= offset ; i--) {
jaroslav@49
  1697
                if (value[i] == ch) {
jaroslav@49
  1698
                    return i - offset;
jaroslav@49
  1699
                }
jaroslav@49
  1700
            }
jaroslav@49
  1701
            return -1;
jaroslav@49
  1702
        } else {
jaroslav@49
  1703
            return lastIndexOfSupplementary(ch, fromIndex);
jaroslav@49
  1704
        }
jaroslav@49
  1705
    }
jaroslav@49
  1706
jaroslav@49
  1707
    /**
jaroslav@49
  1708
     * Handles (rare) calls of lastIndexOf with a supplementary character.
jaroslav@49
  1709
     */
jaroslav@49
  1710
    private int lastIndexOfSupplementary(int ch, int fromIndex) {
jaroslav@49
  1711
        if (Character.isValidCodePoint(ch)) {
jaroslav@49
  1712
            final char[] value = this.value;
jaroslav@49
  1713
            final int offset = this.offset;
jaroslav@49
  1714
            char hi = Character.highSurrogate(ch);
jaroslav@49
  1715
            char lo = Character.lowSurrogate(ch);
jaroslav@49
  1716
            int i = offset + Math.min(fromIndex, count - 2);
jaroslav@49
  1717
            for (; i >= offset; i--) {
jaroslav@49
  1718
                if (value[i] == hi && value[i+1] == lo) {
jaroslav@49
  1719
                    return i - offset;
jaroslav@49
  1720
                }
jaroslav@49
  1721
            }
jaroslav@49
  1722
        }
jaroslav@49
  1723
        return -1;
jaroslav@49
  1724
    }
jaroslav@49
  1725
jaroslav@49
  1726
    /**
jaroslav@49
  1727
     * Returns the index within this string of the first occurrence of the
jaroslav@49
  1728
     * specified substring.
jaroslav@49
  1729
     *
jaroslav@49
  1730
     * <p>The returned index is the smallest value <i>k</i> for which:
jaroslav@49
  1731
     * <blockquote><pre>
jaroslav@49
  1732
     * this.startsWith(str, <i>k</i>)
jaroslav@49
  1733
     * </pre></blockquote>
jaroslav@49
  1734
     * If no such value of <i>k</i> exists, then {@code -1} is returned.
jaroslav@49
  1735
     *
jaroslav@49
  1736
     * @param   str   the substring to search for.
jaroslav@49
  1737
     * @return  the index of the first occurrence of the specified substring,
jaroslav@49
  1738
     *          or {@code -1} if there is no such occurrence.
jaroslav@49
  1739
     */
jaroslav@49
  1740
    public int indexOf(String str) {
jaroslav@49
  1741
        return indexOf(str, 0);
jaroslav@49
  1742
    }
jaroslav@49
  1743
jaroslav@49
  1744
    /**
jaroslav@49
  1745
     * Returns the index within this string of the first occurrence of the
jaroslav@49
  1746
     * specified substring, starting at the specified index.
jaroslav@49
  1747
     *
jaroslav@49
  1748
     * <p>The returned index is the smallest value <i>k</i> for which:
jaroslav@49
  1749
     * <blockquote><pre>
jaroslav@49
  1750
     * <i>k</i> &gt;= fromIndex && this.startsWith(str, <i>k</i>)
jaroslav@49
  1751
     * </pre></blockquote>
jaroslav@49
  1752
     * If no such value of <i>k</i> exists, then {@code -1} is returned.
jaroslav@49
  1753
     *
jaroslav@49
  1754
     * @param   str         the substring to search for.
jaroslav@49
  1755
     * @param   fromIndex   the index from which to start the search.
jaroslav@49
  1756
     * @return  the index of the first occurrence of the specified substring,
jaroslav@49
  1757
     *          starting at the specified index,
jaroslav@49
  1758
     *          or {@code -1} if there is no such occurrence.
jaroslav@49
  1759
     */
jaroslav@49
  1760
    public int indexOf(String str, int fromIndex) {
jaroslav@49
  1761
        return indexOf(value, offset, count,
jaroslav@49
  1762
                       str.value, str.offset, str.count, fromIndex);
jaroslav@49
  1763
    }
jaroslav@49
  1764
jaroslav@49
  1765
    /**
jaroslav@49
  1766
     * Code shared by String and StringBuffer to do searches. The
jaroslav@49
  1767
     * source is the character array being searched, and the target
jaroslav@49
  1768
     * is the string being searched for.
jaroslav@49
  1769
     *
jaroslav@49
  1770
     * @param   source       the characters being searched.
jaroslav@49
  1771
     * @param   sourceOffset offset of the source string.
jaroslav@49
  1772
     * @param   sourceCount  count of the source string.
jaroslav@49
  1773
     * @param   target       the characters being searched for.
jaroslav@49
  1774
     * @param   targetOffset offset of the target string.
jaroslav@49
  1775
     * @param   targetCount  count of the target string.
jaroslav@49
  1776
     * @param   fromIndex    the index to begin searching from.
jaroslav@49
  1777
     */
jaroslav@49
  1778
    static int indexOf(char[] source, int sourceOffset, int sourceCount,
jaroslav@49
  1779
                       char[] target, int targetOffset, int targetCount,
jaroslav@49
  1780
                       int fromIndex) {
jaroslav@49
  1781
        if (fromIndex >= sourceCount) {
jaroslav@49
  1782
            return (targetCount == 0 ? sourceCount : -1);
jaroslav@49
  1783
        }
jaroslav@49
  1784
        if (fromIndex < 0) {
jaroslav@49
  1785
            fromIndex = 0;
jaroslav@49
  1786
        }
jaroslav@49
  1787
        if (targetCount == 0) {
jaroslav@49
  1788
            return fromIndex;
jaroslav@49
  1789
        }
jaroslav@49
  1790
jaroslav@49
  1791
        char first  = target[targetOffset];
jaroslav@49
  1792
        int max = sourceOffset + (sourceCount - targetCount);
jaroslav@49
  1793
jaroslav@49
  1794
        for (int i = sourceOffset + fromIndex; i <= max; i++) {
jaroslav@49
  1795
            /* Look for first character. */
jaroslav@49
  1796
            if (source[i] != first) {
jaroslav@49
  1797
                while (++i <= max && source[i] != first);
jaroslav@49
  1798
            }
jaroslav@49
  1799
jaroslav@49
  1800
            /* Found first character, now look at the rest of v2 */
jaroslav@49
  1801
            if (i <= max) {
jaroslav@49
  1802
                int j = i + 1;
jaroslav@49
  1803
                int end = j + targetCount - 1;
jaroslav@49
  1804
                for (int k = targetOffset + 1; j < end && source[j] ==
jaroslav@49
  1805
                         target[k]; j++, k++);
jaroslav@49
  1806
jaroslav@49
  1807
                if (j == end) {
jaroslav@49
  1808
                    /* Found whole string. */
jaroslav@49
  1809
                    return i - sourceOffset;
jaroslav@49
  1810
                }
jaroslav@49
  1811
            }
jaroslav@49
  1812
        }
jaroslav@49
  1813
        return -1;
jaroslav@49
  1814
    }
jaroslav@49
  1815
jaroslav@49
  1816
    /**
jaroslav@49
  1817
     * Returns the index within this string of the last occurrence of the
jaroslav@49
  1818
     * specified substring.  The last occurrence of the empty string ""
jaroslav@49
  1819
     * is considered to occur at the index value {@code this.length()}.
jaroslav@49
  1820
     *
jaroslav@49
  1821
     * <p>The returned index is the largest value <i>k</i> for which:
jaroslav@49
  1822
     * <blockquote><pre>
jaroslav@49
  1823
     * this.startsWith(str, <i>k</i>)
jaroslav@49
  1824
     * </pre></blockquote>
jaroslav@49
  1825
     * If no such value of <i>k</i> exists, then {@code -1} is returned.
jaroslav@49
  1826
     *
jaroslav@49
  1827
     * @param   str   the substring to search for.
jaroslav@49
  1828
     * @return  the index of the last occurrence of the specified substring,
jaroslav@49
  1829
     *          or {@code -1} if there is no such occurrence.
jaroslav@49
  1830
     */
jaroslav@49
  1831
    public int lastIndexOf(String str) {
jaroslav@49
  1832
        return lastIndexOf(str, count);
jaroslav@49
  1833
    }
jaroslav@49
  1834
jaroslav@49
  1835
    /**
jaroslav@49
  1836
     * Returns the index within this string of the last occurrence of the
jaroslav@49
  1837
     * specified substring, searching backward starting at the specified index.
jaroslav@49
  1838
     *
jaroslav@49
  1839
     * <p>The returned index is the largest value <i>k</i> for which:
jaroslav@49
  1840
     * <blockquote><pre>
jaroslav@49
  1841
     * <i>k</i> &lt;= fromIndex && this.startsWith(str, <i>k</i>)
jaroslav@49
  1842
     * </pre></blockquote>
jaroslav@49
  1843
     * If no such value of <i>k</i> exists, then {@code -1} is returned.
jaroslav@49
  1844
     *
jaroslav@49
  1845
     * @param   str         the substring to search for.
jaroslav@49
  1846
     * @param   fromIndex   the index to start the search from.
jaroslav@49
  1847
     * @return  the index of the last occurrence of the specified substring,
jaroslav@49
  1848
     *          searching backward from the specified index,
jaroslav@49
  1849
     *          or {@code -1} if there is no such occurrence.
jaroslav@49
  1850
     */
jaroslav@49
  1851
    public int lastIndexOf(String str, int fromIndex) {
jaroslav@49
  1852
        return lastIndexOf(value, offset, count,
jaroslav@49
  1853
                           str.value, str.offset, str.count, fromIndex);
jaroslav@49
  1854
    }
jaroslav@49
  1855
jaroslav@49
  1856
    /**
jaroslav@49
  1857
     * Code shared by String and StringBuffer to do searches. The
jaroslav@49
  1858
     * source is the character array being searched, and the target
jaroslav@49
  1859
     * is the string being searched for.
jaroslav@49
  1860
     *
jaroslav@49
  1861
     * @param   source       the characters being searched.
jaroslav@49
  1862
     * @param   sourceOffset offset of the source string.
jaroslav@49
  1863
     * @param   sourceCount  count of the source string.
jaroslav@49
  1864
     * @param   target       the characters being searched for.
jaroslav@49
  1865
     * @param   targetOffset offset of the target string.
jaroslav@49
  1866
     * @param   targetCount  count of the target string.
jaroslav@49
  1867
     * @param   fromIndex    the index to begin searching from.
jaroslav@49
  1868
     */
jaroslav@49
  1869
    static int lastIndexOf(char[] source, int sourceOffset, int sourceCount,
jaroslav@49
  1870
                           char[] target, int targetOffset, int targetCount,
jaroslav@49
  1871
                           int fromIndex) {
jaroslav@49
  1872
        /*
jaroslav@49
  1873
         * Check arguments; return immediately where possible. For
jaroslav@49
  1874
         * consistency, don't check for null str.
jaroslav@49
  1875
         */
jaroslav@49
  1876
        int rightIndex = sourceCount - targetCount;
jaroslav@49
  1877
        if (fromIndex < 0) {
jaroslav@49
  1878
            return -1;
jaroslav@49
  1879
        }
jaroslav@49
  1880
        if (fromIndex > rightIndex) {
jaroslav@49
  1881
            fromIndex = rightIndex;
jaroslav@49
  1882
        }
jaroslav@49
  1883
        /* Empty string always matches. */
jaroslav@49
  1884
        if (targetCount == 0) {
jaroslav@49
  1885
            return fromIndex;
jaroslav@49
  1886
        }
jaroslav@49
  1887
jaroslav@49
  1888
        int strLastIndex = targetOffset + targetCount - 1;
jaroslav@49
  1889
        char strLastChar = target[strLastIndex];
jaroslav@49
  1890
        int min = sourceOffset + targetCount - 1;
jaroslav@49
  1891
        int i = min + fromIndex;
jaroslav@49
  1892
jaroslav@49
  1893
    startSearchForLastChar:
jaroslav@49
  1894
        while (true) {
jaroslav@49
  1895
            while (i >= min && source[i] != strLastChar) {
jaroslav@49
  1896
                i--;
jaroslav@49
  1897
            }
jaroslav@49
  1898
            if (i < min) {
jaroslav@49
  1899
                return -1;
jaroslav@49
  1900
            }
jaroslav@49
  1901
            int j = i - 1;
jaroslav@49
  1902
            int start = j - (targetCount - 1);
jaroslav@49
  1903
            int k = strLastIndex - 1;
jaroslav@49
  1904
jaroslav@49
  1905
            while (j > start) {
jaroslav@49
  1906
                if (source[j--] != target[k--]) {
jaroslav@49
  1907
                    i--;
jaroslav@49
  1908
                    continue startSearchForLastChar;
jaroslav@49
  1909
                }
jaroslav@49
  1910
            }
jaroslav@49
  1911
            return start - sourceOffset + 1;
jaroslav@49
  1912
        }
jaroslav@49
  1913
    }
jaroslav@49
  1914
jaroslav@49
  1915
    /**
jaroslav@49
  1916
     * Returns a new string that is a substring of this string. The
jaroslav@49
  1917
     * substring begins with the character at the specified index and
jaroslav@49
  1918
     * extends to the end of this string. <p>
jaroslav@49
  1919
     * Examples:
jaroslav@49
  1920
     * <blockquote><pre>
jaroslav@49
  1921
     * "unhappy".substring(2) returns "happy"
jaroslav@49
  1922
     * "Harbison".substring(3) returns "bison"
jaroslav@49
  1923
     * "emptiness".substring(9) returns "" (an empty string)
jaroslav@49
  1924
     * </pre></blockquote>
jaroslav@49
  1925
     *
jaroslav@49
  1926
     * @param      beginIndex   the beginning index, inclusive.
jaroslav@49
  1927
     * @return     the specified substring.
jaroslav@49
  1928
     * @exception  IndexOutOfBoundsException  if
jaroslav@49
  1929
     *             <code>beginIndex</code> is negative or larger than the
jaroslav@49
  1930
     *             length of this <code>String</code> object.
jaroslav@49
  1931
     */
jaroslav@49
  1932
    public String substring(int beginIndex) {
jaroslav@49
  1933
        return substring(beginIndex, count);
jaroslav@49
  1934
    }
jaroslav@49
  1935
jaroslav@49
  1936
    /**
jaroslav@49
  1937
     * Returns a new string that is a substring of this string. The
jaroslav@49
  1938
     * substring begins at the specified <code>beginIndex</code> and
jaroslav@49
  1939
     * extends to the character at index <code>endIndex - 1</code>.
jaroslav@49
  1940
     * Thus the length of the substring is <code>endIndex-beginIndex</code>.
jaroslav@49
  1941
     * <p>
jaroslav@49
  1942
     * Examples:
jaroslav@49
  1943
     * <blockquote><pre>
jaroslav@49
  1944
     * "hamburger".substring(4, 8) returns "urge"
jaroslav@49
  1945
     * "smiles".substring(1, 5) returns "mile"
jaroslav@49
  1946
     * </pre></blockquote>
jaroslav@49
  1947
     *
jaroslav@49
  1948
     * @param      beginIndex   the beginning index, inclusive.
jaroslav@49
  1949
     * @param      endIndex     the ending index, exclusive.
jaroslav@49
  1950
     * @return     the specified substring.
jaroslav@49
  1951
     * @exception  IndexOutOfBoundsException  if the
jaroslav@49
  1952
     *             <code>beginIndex</code> is negative, or
jaroslav@49
  1953
     *             <code>endIndex</code> is larger than the length of
jaroslav@49
  1954
     *             this <code>String</code> object, or
jaroslav@49
  1955
     *             <code>beginIndex</code> is larger than
jaroslav@49
  1956
     *             <code>endIndex</code>.
jaroslav@49
  1957
     */
jaroslav@49
  1958
    public String substring(int beginIndex, int endIndex) {
jaroslav@49
  1959
        if (beginIndex < 0) {
jaroslav@49
  1960
            throw new StringIndexOutOfBoundsException(beginIndex);
jaroslav@49
  1961
        }
jaroslav@49
  1962
        if (endIndex > count) {
jaroslav@49
  1963
            throw new StringIndexOutOfBoundsException(endIndex);
jaroslav@49
  1964
        }
jaroslav@49
  1965
        if (beginIndex > endIndex) {
jaroslav@49
  1966
            throw new StringIndexOutOfBoundsException(endIndex - beginIndex);
jaroslav@49
  1967
        }
jaroslav@49
  1968
        return ((beginIndex == 0) && (endIndex == count)) ? this :
jaroslav@49
  1969
            new String(offset + beginIndex, endIndex - beginIndex, value);
jaroslav@49
  1970
    }
jaroslav@49
  1971
jaroslav@49
  1972
    /**
jaroslav@49
  1973
     * Returns a new character sequence that is a subsequence of this sequence.
jaroslav@49
  1974
     *
jaroslav@49
  1975
     * <p> An invocation of this method of the form
jaroslav@49
  1976
     *
jaroslav@49
  1977
     * <blockquote><pre>
jaroslav@49
  1978
     * str.subSequence(begin,&nbsp;end)</pre></blockquote>
jaroslav@49
  1979
     *
jaroslav@49
  1980
     * behaves in exactly the same way as the invocation
jaroslav@49
  1981
     *
jaroslav@49
  1982
     * <blockquote><pre>
jaroslav@49
  1983
     * str.substring(begin,&nbsp;end)</pre></blockquote>
jaroslav@49
  1984
     *
jaroslav@49
  1985
     * This method is defined so that the <tt>String</tt> class can implement
jaroslav@49
  1986
     * the {@link CharSequence} interface. </p>
jaroslav@49
  1987
     *
jaroslav@49
  1988
     * @param      beginIndex   the begin index, inclusive.
jaroslav@49
  1989
     * @param      endIndex     the end index, exclusive.
jaroslav@49
  1990
     * @return     the specified subsequence.
jaroslav@49
  1991
     *
jaroslav@49
  1992
     * @throws  IndexOutOfBoundsException
jaroslav@49
  1993
     *          if <tt>beginIndex</tt> or <tt>endIndex</tt> are negative,
jaroslav@49
  1994
     *          if <tt>endIndex</tt> is greater than <tt>length()</tt>,
jaroslav@49
  1995
     *          or if <tt>beginIndex</tt> is greater than <tt>startIndex</tt>
jaroslav@49
  1996
     *
jaroslav@49
  1997
     * @since 1.4
jaroslav@49
  1998
     * @spec JSR-51
jaroslav@49
  1999
     */
jaroslav@49
  2000
    public CharSequence subSequence(int beginIndex, int endIndex) {
jaroslav@49
  2001
        return this.substring(beginIndex, endIndex);
jaroslav@49
  2002
    }
jaroslav@49
  2003
jaroslav@49
  2004
    /**
jaroslav@49
  2005
     * Concatenates the specified string to the end of this string.
jaroslav@49
  2006
     * <p>
jaroslav@49
  2007
     * If the length of the argument string is <code>0</code>, then this
jaroslav@49
  2008
     * <code>String</code> object is returned. Otherwise, a new
jaroslav@49
  2009
     * <code>String</code> object is created, representing a character
jaroslav@49
  2010
     * sequence that is the concatenation of the character sequence
jaroslav@49
  2011
     * represented by this <code>String</code> object and the character
jaroslav@49
  2012
     * sequence represented by the argument string.<p>
jaroslav@49
  2013
     * Examples:
jaroslav@49
  2014
     * <blockquote><pre>
jaroslav@49
  2015
     * "cares".concat("s") returns "caress"
jaroslav@49
  2016
     * "to".concat("get").concat("her") returns "together"
jaroslav@49
  2017
     * </pre></blockquote>
jaroslav@49
  2018
     *
jaroslav@49
  2019
     * @param   str   the <code>String</code> that is concatenated to the end
jaroslav@49
  2020
     *                of this <code>String</code>.
jaroslav@49
  2021
     * @return  a string that represents the concatenation of this object's
jaroslav@49
  2022
     *          characters followed by the string argument's characters.
jaroslav@49
  2023
     */
jaroslav@49
  2024
    public String concat(String str) {
jaroslav@49
  2025
        int otherLen = str.length();
jaroslav@49
  2026
        if (otherLen == 0) {
jaroslav@49
  2027
            return this;
jaroslav@49
  2028
        }
jaroslav@49
  2029
        char buf[] = new char[count + otherLen];
jaroslav@49
  2030
        getChars(0, count, buf, 0);
jaroslav@49
  2031
        str.getChars(0, otherLen, buf, count);
jaroslav@49
  2032
        return new String(0, count + otherLen, buf);
jaroslav@49
  2033
    }
jaroslav@49
  2034
jaroslav@49
  2035
    /**
jaroslav@49
  2036
     * Returns a new string resulting from replacing all occurrences of
jaroslav@49
  2037
     * <code>oldChar</code> in this string with <code>newChar</code>.
jaroslav@49
  2038
     * <p>
jaroslav@49
  2039
     * If the character <code>oldChar</code> does not occur in the
jaroslav@49
  2040
     * character sequence represented by this <code>String</code> object,
jaroslav@49
  2041
     * then a reference to this <code>String</code> object is returned.
jaroslav@49
  2042
     * Otherwise, a new <code>String</code> object is created that
jaroslav@49
  2043
     * represents a character sequence identical to the character sequence
jaroslav@49
  2044
     * represented by this <code>String</code> object, except that every
jaroslav@49
  2045
     * occurrence of <code>oldChar</code> is replaced by an occurrence
jaroslav@49
  2046
     * of <code>newChar</code>.
jaroslav@49
  2047
     * <p>
jaroslav@49
  2048
     * Examples:
jaroslav@49
  2049
     * <blockquote><pre>
jaroslav@49
  2050
     * "mesquite in your cellar".replace('e', 'o')
jaroslav@49
  2051
     *         returns "mosquito in your collar"
jaroslav@49
  2052
     * "the war of baronets".replace('r', 'y')
jaroslav@49
  2053
     *         returns "the way of bayonets"
jaroslav@49
  2054
     * "sparring with a purple porpoise".replace('p', 't')
jaroslav@49
  2055
     *         returns "starring with a turtle tortoise"
jaroslav@49
  2056
     * "JonL".replace('q', 'x') returns "JonL" (no change)
jaroslav@49
  2057
     * </pre></blockquote>
jaroslav@49
  2058
     *
jaroslav@49
  2059
     * @param   oldChar   the old character.
jaroslav@49
  2060
     * @param   newChar   the new character.
jaroslav@49
  2061
     * @return  a string derived from this string by replacing every
jaroslav@49
  2062
     *          occurrence of <code>oldChar</code> with <code>newChar</code>.
jaroslav@49
  2063
     */
jaroslav@49
  2064
    public String replace(char oldChar, char newChar) {
jaroslav@49
  2065
        if (oldChar != newChar) {
jaroslav@49
  2066
            int len = count;
jaroslav@49
  2067
            int i = -1;
jaroslav@49
  2068
            char[] val = value; /* avoid getfield opcode */
jaroslav@49
  2069
            int off = offset;   /* avoid getfield opcode */
jaroslav@49
  2070
jaroslav@49
  2071
            while (++i < len) {
jaroslav@49
  2072
                if (val[off + i] == oldChar) {
jaroslav@49
  2073
                    break;
jaroslav@49
  2074
                }
jaroslav@49
  2075
            }
jaroslav@49
  2076
            if (i < len) {
jaroslav@49
  2077
                char buf[] = new char[len];
jaroslav@49
  2078
                for (int j = 0 ; j < i ; j++) {
jaroslav@49
  2079
                    buf[j] = val[off+j];
jaroslav@49
  2080
                }
jaroslav@49
  2081
                while (i < len) {
jaroslav@49
  2082
                    char c = val[off + i];
jaroslav@49
  2083
                    buf[i] = (c == oldChar) ? newChar : c;
jaroslav@49
  2084
                    i++;
jaroslav@49
  2085
                }
jaroslav@49
  2086
                return new String(0, len, buf);
jaroslav@49
  2087
            }
jaroslav@49
  2088
        }
jaroslav@49
  2089
        return this;
jaroslav@49
  2090
    }
jaroslav@49
  2091
jaroslav@49
  2092
    /**
jaroslav@49
  2093
     * Tells whether or not this string matches the given <a
jaroslav@49
  2094
     * href="../util/regex/Pattern.html#sum">regular expression</a>.
jaroslav@49
  2095
     *
jaroslav@49
  2096
     * <p> An invocation of this method of the form
jaroslav@49
  2097
     * <i>str</i><tt>.matches(</tt><i>regex</i><tt>)</tt> yields exactly the
jaroslav@49
  2098
     * same result as the expression
jaroslav@49
  2099
     *
jaroslav@49
  2100
     * <blockquote><tt> {@link java.util.regex.Pattern}.{@link
jaroslav@49
  2101
     * java.util.regex.Pattern#matches(String,CharSequence)
jaroslav@49
  2102
     * matches}(</tt><i>regex</i><tt>,</tt> <i>str</i><tt>)</tt></blockquote>
jaroslav@49
  2103
     *
jaroslav@49
  2104
     * @param   regex
jaroslav@49
  2105
     *          the regular expression to which this string is to be matched
jaroslav@49
  2106
     *
jaroslav@49
  2107
     * @return  <tt>true</tt> if, and only if, this string matches the
jaroslav@49
  2108
     *          given regular expression
jaroslav@49
  2109
     *
jaroslav@49
  2110
     * @throws  PatternSyntaxException
jaroslav@49
  2111
     *          if the regular expression's syntax is invalid
jaroslav@49
  2112
     *
jaroslav@49
  2113
     * @see java.util.regex.Pattern
jaroslav@49
  2114
     *
jaroslav@49
  2115
     * @since 1.4
jaroslav@49
  2116
     * @spec JSR-51
jaroslav@49
  2117
     */
jaroslav@49
  2118
    public boolean matches(String regex) {
jaroslav@64
  2119
        throw new UnsupportedOperationException();
jaroslav@49
  2120
    }
jaroslav@49
  2121
jaroslav@49
  2122
    /**
jaroslav@49
  2123
     * Returns true if and only if this string contains the specified
jaroslav@49
  2124
     * sequence of char values.
jaroslav@49
  2125
     *
jaroslav@49
  2126
     * @param s the sequence to search for
jaroslav@49
  2127
     * @return true if this string contains <code>s</code>, false otherwise
jaroslav@49
  2128
     * @throws NullPointerException if <code>s</code> is <code>null</code>
jaroslav@49
  2129
     * @since 1.5
jaroslav@49
  2130
     */
jaroslav@49
  2131
    public boolean contains(CharSequence s) {
jaroslav@49
  2132
        return indexOf(s.toString()) > -1;
jaroslav@49
  2133
    }
jaroslav@49
  2134
jaroslav@49
  2135
    /**
jaroslav@49
  2136
     * Replaces the first substring of this string that matches the given <a
jaroslav@49
  2137
     * href="../util/regex/Pattern.html#sum">regular expression</a> with the
jaroslav@49
  2138
     * given replacement.
jaroslav@49
  2139
     *
jaroslav@49
  2140
     * <p> An invocation of this method of the form
jaroslav@49
  2141
     * <i>str</i><tt>.replaceFirst(</tt><i>regex</i><tt>,</tt> <i>repl</i><tt>)</tt>
jaroslav@49
  2142
     * yields exactly the same result as the expression
jaroslav@49
  2143
     *
jaroslav@49
  2144
     * <blockquote><tt>
jaroslav@49
  2145
     * {@link java.util.regex.Pattern}.{@link java.util.regex.Pattern#compile
jaroslav@49
  2146
     * compile}(</tt><i>regex</i><tt>).{@link
jaroslav@49
  2147
     * java.util.regex.Pattern#matcher(java.lang.CharSequence)
jaroslav@49
  2148
     * matcher}(</tt><i>str</i><tt>).{@link java.util.regex.Matcher#replaceFirst
jaroslav@49
  2149
     * replaceFirst}(</tt><i>repl</i><tt>)</tt></blockquote>
jaroslav@49
  2150
     *
jaroslav@49
  2151
     *<p>
jaroslav@49
  2152
     * Note that backslashes (<tt>\</tt>) and dollar signs (<tt>$</tt>) in the
jaroslav@49
  2153
     * replacement string may cause the results to be different than if it were
jaroslav@49
  2154
     * being treated as a literal replacement string; see
jaroslav@49
  2155
     * {@link java.util.regex.Matcher#replaceFirst}.
jaroslav@49
  2156
     * Use {@link java.util.regex.Matcher#quoteReplacement} to suppress the special
jaroslav@49
  2157
     * meaning of these characters, if desired.
jaroslav@49
  2158
     *
jaroslav@49
  2159
     * @param   regex
jaroslav@49
  2160
     *          the regular expression to which this string is to be matched
jaroslav@49
  2161
     * @param   replacement
jaroslav@49
  2162
     *          the string to be substituted for the first match
jaroslav@49
  2163
     *
jaroslav@49
  2164
     * @return  The resulting <tt>String</tt>
jaroslav@49
  2165
     *
jaroslav@49
  2166
     * @throws  PatternSyntaxException
jaroslav@49
  2167
     *          if the regular expression's syntax is invalid
jaroslav@49
  2168
     *
jaroslav@49
  2169
     * @see java.util.regex.Pattern
jaroslav@49
  2170
     *
jaroslav@49
  2171
     * @since 1.4
jaroslav@49
  2172
     * @spec JSR-51
jaroslav@49
  2173
     */
jaroslav@49
  2174
    public String replaceFirst(String regex, String replacement) {
jaroslav@64
  2175
        throw new UnsupportedOperationException();
jaroslav@49
  2176
    }
jaroslav@49
  2177
jaroslav@49
  2178
    /**
jaroslav@49
  2179
     * Replaces each substring of this string that matches the given <a
jaroslav@49
  2180
     * href="../util/regex/Pattern.html#sum">regular expression</a> with the
jaroslav@49
  2181
     * given replacement.
jaroslav@49
  2182
     *
jaroslav@49
  2183
     * <p> An invocation of this method of the form
jaroslav@49
  2184
     * <i>str</i><tt>.replaceAll(</tt><i>regex</i><tt>,</tt> <i>repl</i><tt>)</tt>
jaroslav@49
  2185
     * yields exactly the same result as the expression
jaroslav@49
  2186
     *
jaroslav@49
  2187
     * <blockquote><tt>
jaroslav@49
  2188
     * {@link java.util.regex.Pattern}.{@link java.util.regex.Pattern#compile
jaroslav@49
  2189
     * compile}(</tt><i>regex</i><tt>).{@link
jaroslav@49
  2190
     * java.util.regex.Pattern#matcher(java.lang.CharSequence)
jaroslav@49
  2191
     * matcher}(</tt><i>str</i><tt>).{@link java.util.regex.Matcher#replaceAll
jaroslav@49
  2192
     * replaceAll}(</tt><i>repl</i><tt>)</tt></blockquote>
jaroslav@49
  2193
     *
jaroslav@49
  2194
     *<p>
jaroslav@49
  2195
     * Note that backslashes (<tt>\</tt>) and dollar signs (<tt>$</tt>) in the
jaroslav@49
  2196
     * replacement string may cause the results to be different than if it were
jaroslav@49
  2197
     * being treated as a literal replacement string; see
jaroslav@49
  2198
     * {@link java.util.regex.Matcher#replaceAll Matcher.replaceAll}.
jaroslav@49
  2199
     * Use {@link java.util.regex.Matcher#quoteReplacement} to suppress the special
jaroslav@49
  2200
     * meaning of these characters, if desired.
jaroslav@49
  2201
     *
jaroslav@49
  2202
     * @param   regex
jaroslav@49
  2203
     *          the regular expression to which this string is to be matched
jaroslav@49
  2204
     * @param   replacement
jaroslav@49
  2205
     *          the string to be substituted for each match
jaroslav@49
  2206
     *
jaroslav@49
  2207
     * @return  The resulting <tt>String</tt>
jaroslav@49
  2208
     *
jaroslav@49
  2209
     * @throws  PatternSyntaxException
jaroslav@49
  2210
     *          if the regular expression's syntax is invalid
jaroslav@49
  2211
     *
jaroslav@49
  2212
     * @see java.util.regex.Pattern
jaroslav@49
  2213
     *
jaroslav@49
  2214
     * @since 1.4
jaroslav@49
  2215
     * @spec JSR-51
jaroslav@49
  2216
     */
jaroslav@49
  2217
    public String replaceAll(String regex, String replacement) {
jaroslav@64
  2218
        throw new UnsupportedOperationException();
jaroslav@49
  2219
    }
jaroslav@49
  2220
jaroslav@49
  2221
    /**
jaroslav@49
  2222
     * Replaces each substring of this string that matches the literal target
jaroslav@49
  2223
     * sequence with the specified literal replacement sequence. The
jaroslav@49
  2224
     * replacement proceeds from the beginning of the string to the end, for
jaroslav@49
  2225
     * example, replacing "aa" with "b" in the string "aaa" will result in
jaroslav@49
  2226
     * "ba" rather than "ab".
jaroslav@49
  2227
     *
jaroslav@49
  2228
     * @param  target The sequence of char values to be replaced
jaroslav@49
  2229
     * @param  replacement The replacement sequence of char values
jaroslav@49
  2230
     * @return  The resulting string
jaroslav@49
  2231
     * @throws NullPointerException if <code>target</code> or
jaroslav@49
  2232
     *         <code>replacement</code> is <code>null</code>.
jaroslav@49
  2233
     * @since 1.5
jaroslav@49
  2234
     */
jaroslav@49
  2235
    public String replace(CharSequence target, CharSequence replacement) {
jaroslav@64
  2236
        throw new UnsupportedOperationException("This one should be supported, but without dep on rest of regexp");
jaroslav@49
  2237
    }
jaroslav@49
  2238
jaroslav@49
  2239
    /**
jaroslav@49
  2240
     * Splits this string around matches of the given
jaroslav@49
  2241
     * <a href="../util/regex/Pattern.html#sum">regular expression</a>.
jaroslav@49
  2242
     *
jaroslav@49
  2243
     * <p> The array returned by this method contains each substring of this
jaroslav@49
  2244
     * string that is terminated by another substring that matches the given
jaroslav@49
  2245
     * expression or is terminated by the end of the string.  The substrings in
jaroslav@49
  2246
     * the array are in the order in which they occur in this string.  If the
jaroslav@49
  2247
     * expression does not match any part of the input then the resulting array
jaroslav@49
  2248
     * has just one element, namely this string.
jaroslav@49
  2249
     *
jaroslav@49
  2250
     * <p> The <tt>limit</tt> parameter controls the number of times the
jaroslav@49
  2251
     * pattern is applied and therefore affects the length of the resulting
jaroslav@49
  2252
     * array.  If the limit <i>n</i> is greater than zero then the pattern
jaroslav@49
  2253
     * will be applied at most <i>n</i>&nbsp;-&nbsp;1 times, the array's
jaroslav@49
  2254
     * length will be no greater than <i>n</i>, and the array's last entry
jaroslav@49
  2255
     * will contain all input beyond the last matched delimiter.  If <i>n</i>
jaroslav@49
  2256
     * is non-positive then the pattern will be applied as many times as
jaroslav@49
  2257
     * possible and the array can have any length.  If <i>n</i> is zero then
jaroslav@49
  2258
     * the pattern will be applied as many times as possible, the array can
jaroslav@49
  2259
     * have any length, and trailing empty strings will be discarded.
jaroslav@49
  2260
     *
jaroslav@49
  2261
     * <p> The string <tt>"boo:and:foo"</tt>, for example, yields the
jaroslav@49
  2262
     * following results with these parameters:
jaroslav@49
  2263
     *
jaroslav@49
  2264
     * <blockquote><table cellpadding=1 cellspacing=0 summary="Split example showing regex, limit, and result">
jaroslav@49
  2265
     * <tr>
jaroslav@49
  2266
     *     <th>Regex</th>
jaroslav@49
  2267
     *     <th>Limit</th>
jaroslav@49
  2268
     *     <th>Result</th>
jaroslav@49
  2269
     * </tr>
jaroslav@49
  2270
     * <tr><td align=center>:</td>
jaroslav@49
  2271
     *     <td align=center>2</td>
jaroslav@49
  2272
     *     <td><tt>{ "boo", "and:foo" }</tt></td></tr>
jaroslav@49
  2273
     * <tr><td align=center>:</td>
jaroslav@49
  2274
     *     <td align=center>5</td>
jaroslav@49
  2275
     *     <td><tt>{ "boo", "and", "foo" }</tt></td></tr>
jaroslav@49
  2276
     * <tr><td align=center>:</td>
jaroslav@49
  2277
     *     <td align=center>-2</td>
jaroslav@49
  2278
     *     <td><tt>{ "boo", "and", "foo" }</tt></td></tr>
jaroslav@49
  2279
     * <tr><td align=center>o</td>
jaroslav@49
  2280
     *     <td align=center>5</td>
jaroslav@49
  2281
     *     <td><tt>{ "b", "", ":and:f", "", "" }</tt></td></tr>
jaroslav@49
  2282
     * <tr><td align=center>o</td>
jaroslav@49
  2283
     *     <td align=center>-2</td>
jaroslav@49
  2284
     *     <td><tt>{ "b", "", ":and:f", "", "" }</tt></td></tr>
jaroslav@49
  2285
     * <tr><td align=center>o</td>
jaroslav@49
  2286
     *     <td align=center>0</td>
jaroslav@49
  2287
     *     <td><tt>{ "b", "", ":and:f" }</tt></td></tr>
jaroslav@49
  2288
     * </table></blockquote>
jaroslav@49
  2289
     *
jaroslav@49
  2290
     * <p> An invocation of this method of the form
jaroslav@49
  2291
     * <i>str.</i><tt>split(</tt><i>regex</i><tt>,</tt>&nbsp;<i>n</i><tt>)</tt>
jaroslav@49
  2292
     * yields the same result as the expression
jaroslav@49
  2293
     *
jaroslav@49
  2294
     * <blockquote>
jaroslav@49
  2295
     * {@link java.util.regex.Pattern}.{@link java.util.regex.Pattern#compile
jaroslav@49
  2296
     * compile}<tt>(</tt><i>regex</i><tt>)</tt>.{@link
jaroslav@49
  2297
     * java.util.regex.Pattern#split(java.lang.CharSequence,int)
jaroslav@49
  2298
     * split}<tt>(</tt><i>str</i><tt>,</tt>&nbsp;<i>n</i><tt>)</tt>
jaroslav@49
  2299
     * </blockquote>
jaroslav@49
  2300
     *
jaroslav@49
  2301
     *
jaroslav@49
  2302
     * @param  regex
jaroslav@49
  2303
     *         the delimiting regular expression
jaroslav@49
  2304
     *
jaroslav@49
  2305
     * @param  limit
jaroslav@49
  2306
     *         the result threshold, as described above
jaroslav@49
  2307
     *
jaroslav@49
  2308
     * @return  the array of strings computed by splitting this string
jaroslav@49
  2309
     *          around matches of the given regular expression
jaroslav@49
  2310
     *
jaroslav@49
  2311
     * @throws  PatternSyntaxException
jaroslav@49
  2312
     *          if the regular expression's syntax is invalid
jaroslav@49
  2313
     *
jaroslav@49
  2314
     * @see java.util.regex.Pattern
jaroslav@49
  2315
     *
jaroslav@49
  2316
     * @since 1.4
jaroslav@49
  2317
     * @spec JSR-51
jaroslav@49
  2318
     */
jaroslav@49
  2319
    public String[] split(String regex, int limit) {
jaroslav@64
  2320
        throw new UnsupportedOperationException("Needs regexp");
jaroslav@49
  2321
    }
jaroslav@49
  2322
jaroslav@49
  2323
    /**
jaroslav@49
  2324
     * Splits this string around matches of the given <a
jaroslav@49
  2325
     * href="../util/regex/Pattern.html#sum">regular expression</a>.
jaroslav@49
  2326
     *
jaroslav@49
  2327
     * <p> This method works as if by invoking the two-argument {@link
jaroslav@49
  2328
     * #split(String, int) split} method with the given expression and a limit
jaroslav@49
  2329
     * argument of zero.  Trailing empty strings are therefore not included in
jaroslav@49
  2330
     * the resulting array.
jaroslav@49
  2331
     *
jaroslav@49
  2332
     * <p> The string <tt>"boo:and:foo"</tt>, for example, yields the following
jaroslav@49
  2333
     * results with these expressions:
jaroslav@49
  2334
     *
jaroslav@49
  2335
     * <blockquote><table cellpadding=1 cellspacing=0 summary="Split examples showing regex and result">
jaroslav@49
  2336
     * <tr>
jaroslav@49
  2337
     *  <th>Regex</th>
jaroslav@49
  2338
     *  <th>Result</th>
jaroslav@49
  2339
     * </tr>
jaroslav@49
  2340
     * <tr><td align=center>:</td>
jaroslav@49
  2341
     *     <td><tt>{ "boo", "and", "foo" }</tt></td></tr>
jaroslav@49
  2342
     * <tr><td align=center>o</td>
jaroslav@49
  2343
     *     <td><tt>{ "b", "", ":and:f" }</tt></td></tr>
jaroslav@49
  2344
     * </table></blockquote>
jaroslav@49
  2345
     *
jaroslav@49
  2346
     *
jaroslav@49
  2347
     * @param  regex
jaroslav@49
  2348
     *         the delimiting regular expression
jaroslav@49
  2349
     *
jaroslav@49
  2350
     * @return  the array of strings computed by splitting this string
jaroslav@49
  2351
     *          around matches of the given regular expression
jaroslav@49
  2352
     *
jaroslav@49
  2353
     * @throws  PatternSyntaxException
jaroslav@49
  2354
     *          if the regular expression's syntax is invalid
jaroslav@49
  2355
     *
jaroslav@49
  2356
     * @see java.util.regex.Pattern
jaroslav@49
  2357
     *
jaroslav@49
  2358
     * @since 1.4
jaroslav@49
  2359
     * @spec JSR-51
jaroslav@49
  2360
     */
jaroslav@49
  2361
    public String[] split(String regex) {
jaroslav@49
  2362
        return split(regex, 0);
jaroslav@49
  2363
    }
jaroslav@49
  2364
jaroslav@49
  2365
    /**
jaroslav@49
  2366
     * Converts all of the characters in this <code>String</code> to lower
jaroslav@49
  2367
     * case using the rules of the given <code>Locale</code>.  Case mapping is based
jaroslav@49
  2368
     * on the Unicode Standard version specified by the {@link java.lang.Character Character}
jaroslav@49
  2369
     * class. Since case mappings are not always 1:1 char mappings, the resulting
jaroslav@49
  2370
     * <code>String</code> may be a different length than the original <code>String</code>.
jaroslav@49
  2371
     * <p>
jaroslav@49
  2372
     * Examples of lowercase  mappings are in the following table:
jaroslav@49
  2373
     * <table border="1" summary="Lowercase mapping examples showing language code of locale, upper case, lower case, and description">
jaroslav@49
  2374
     * <tr>
jaroslav@49
  2375
     *   <th>Language Code of Locale</th>
jaroslav@49
  2376
     *   <th>Upper Case</th>
jaroslav@49
  2377
     *   <th>Lower Case</th>
jaroslav@49
  2378
     *   <th>Description</th>
jaroslav@49
  2379
     * </tr>
jaroslav@49
  2380
     * <tr>
jaroslav@49
  2381
     *   <td>tr (Turkish)</td>
jaroslav@49
  2382
     *   <td>&#92;u0130</td>
jaroslav@49
  2383
     *   <td>&#92;u0069</td>
jaroslav@49
  2384
     *   <td>capital letter I with dot above -&gt; small letter i</td>
jaroslav@49
  2385
     * </tr>
jaroslav@49
  2386
     * <tr>
jaroslav@49
  2387
     *   <td>tr (Turkish)</td>
jaroslav@49
  2388
     *   <td>&#92;u0049</td>
jaroslav@49
  2389
     *   <td>&#92;u0131</td>
jaroslav@49
  2390
     *   <td>capital letter I -&gt; small letter dotless i </td>
jaroslav@49
  2391
     * </tr>
jaroslav@49
  2392
     * <tr>
jaroslav@49
  2393
     *   <td>(all)</td>
jaroslav@49
  2394
     *   <td>French Fries</td>
jaroslav@49
  2395
     *   <td>french fries</td>
jaroslav@49
  2396
     *   <td>lowercased all chars in String</td>
jaroslav@49
  2397
     * </tr>
jaroslav@49
  2398
     * <tr>
jaroslav@49
  2399
     *   <td>(all)</td>
jaroslav@49
  2400
     *   <td><img src="doc-files/capiota.gif" alt="capiota"><img src="doc-files/capchi.gif" alt="capchi">
jaroslav@49
  2401
     *       <img src="doc-files/captheta.gif" alt="captheta"><img src="doc-files/capupsil.gif" alt="capupsil">
jaroslav@49
  2402
     *       <img src="doc-files/capsigma.gif" alt="capsigma"></td>
jaroslav@49
  2403
     *   <td><img src="doc-files/iota.gif" alt="iota"><img src="doc-files/chi.gif" alt="chi">
jaroslav@49
  2404
     *       <img src="doc-files/theta.gif" alt="theta"><img src="doc-files/upsilon.gif" alt="upsilon">
jaroslav@49
  2405
     *       <img src="doc-files/sigma1.gif" alt="sigma"></td>
jaroslav@49
  2406
     *   <td>lowercased all chars in String</td>
jaroslav@49
  2407
     * </tr>
jaroslav@49
  2408
     * </table>
jaroslav@49
  2409
     *
jaroslav@49
  2410
     * @param locale use the case transformation rules for this locale
jaroslav@49
  2411
     * @return the <code>String</code>, converted to lowercase.
jaroslav@49
  2412
     * @see     java.lang.String#toLowerCase()
jaroslav@49
  2413
     * @see     java.lang.String#toUpperCase()
jaroslav@49
  2414
     * @see     java.lang.String#toUpperCase(Locale)
jaroslav@49
  2415
     * @since   1.1
jaroslav@49
  2416
     */
jaroslav@61
  2417
//    public String toLowerCase(Locale locale) {
jaroslav@61
  2418
//        if (locale == null) {
jaroslav@61
  2419
//            throw new NullPointerException();
jaroslav@61
  2420
//        }
jaroslav@61
  2421
//
jaroslav@61
  2422
//        int     firstUpper;
jaroslav@61
  2423
//
jaroslav@61
  2424
//        /* Now check if there are any characters that need to be changed. */
jaroslav@61
  2425
//        scan: {
jaroslav@61
  2426
//            for (firstUpper = 0 ; firstUpper < count; ) {
jaroslav@61
  2427
//                char c = value[offset+firstUpper];
jaroslav@61
  2428
//                if ((c >= Character.MIN_HIGH_SURROGATE) &&
jaroslav@61
  2429
//                    (c <= Character.MAX_HIGH_SURROGATE)) {
jaroslav@61
  2430
//                    int supplChar = codePointAt(firstUpper);
jaroslav@61
  2431
//                    if (supplChar != Character.toLowerCase(supplChar)) {
jaroslav@61
  2432
//                        break scan;
jaroslav@61
  2433
//                    }
jaroslav@61
  2434
//                    firstUpper += Character.charCount(supplChar);
jaroslav@61
  2435
//                } else {
jaroslav@61
  2436
//                    if (c != Character.toLowerCase(c)) {
jaroslav@61
  2437
//                        break scan;
jaroslav@61
  2438
//                    }
jaroslav@61
  2439
//                    firstUpper++;
jaroslav@61
  2440
//                }
jaroslav@61
  2441
//            }
jaroslav@61
  2442
//            return this;
jaroslav@61
  2443
//        }
jaroslav@61
  2444
//
jaroslav@61
  2445
//        char[]  result = new char[count];
jaroslav@61
  2446
//        int     resultOffset = 0;  /* result may grow, so i+resultOffset
jaroslav@61
  2447
//                                    * is the write location in result */
jaroslav@61
  2448
//
jaroslav@61
  2449
//        /* Just copy the first few lowerCase characters. */
jaroslav@72
  2450
//        arraycopy(value, offset, result, 0, firstUpper);
jaroslav@61
  2451
//
jaroslav@61
  2452
//        String lang = locale.getLanguage();
jaroslav@61
  2453
//        boolean localeDependent =
jaroslav@61
  2454
//            (lang == "tr" || lang == "az" || lang == "lt");
jaroslav@61
  2455
//        char[] lowerCharArray;
jaroslav@61
  2456
//        int lowerChar;
jaroslav@61
  2457
//        int srcChar;
jaroslav@61
  2458
//        int srcCount;
jaroslav@61
  2459
//        for (int i = firstUpper; i < count; i += srcCount) {
jaroslav@61
  2460
//            srcChar = (int)value[offset+i];
jaroslav@61
  2461
//            if ((char)srcChar >= Character.MIN_HIGH_SURROGATE &&
jaroslav@61
  2462
//                (char)srcChar <= Character.MAX_HIGH_SURROGATE) {
jaroslav@61
  2463
//                srcChar = codePointAt(i);
jaroslav@61
  2464
//                srcCount = Character.charCount(srcChar);
jaroslav@61
  2465
//            } else {
jaroslav@61
  2466
//                srcCount = 1;
jaroslav@61
  2467
//            }
jaroslav@61
  2468
//            if (localeDependent || srcChar == '\u03A3') { // GREEK CAPITAL LETTER SIGMA
jaroslav@61
  2469
//                lowerChar = ConditionalSpecialCasing.toLowerCaseEx(this, i, locale);
jaroslav@61
  2470
//            } else if (srcChar == '\u0130') { // LATIN CAPITAL LETTER I DOT
jaroslav@61
  2471
//                lowerChar = Character.ERROR;
jaroslav@61
  2472
//            } else {
jaroslav@61
  2473
//                lowerChar = Character.toLowerCase(srcChar);
jaroslav@61
  2474
//            }
jaroslav@61
  2475
//            if ((lowerChar == Character.ERROR) ||
jaroslav@61
  2476
//                (lowerChar >= Character.MIN_SUPPLEMENTARY_CODE_POINT)) {
jaroslav@61
  2477
//                if (lowerChar == Character.ERROR) {
jaroslav@61
  2478
//                     if (!localeDependent && srcChar == '\u0130') {
jaroslav@61
  2479
//                         lowerCharArray =
jaroslav@61
  2480
//                             ConditionalSpecialCasing.toLowerCaseCharArray(this, i, Locale.ENGLISH);
jaroslav@61
  2481
//                     } else {
jaroslav@61
  2482
//                        lowerCharArray =
jaroslav@61
  2483
//                            ConditionalSpecialCasing.toLowerCaseCharArray(this, i, locale);
jaroslav@61
  2484
//                     }
jaroslav@61
  2485
//                } else if (srcCount == 2) {
jaroslav@61
  2486
//                    resultOffset += Character.toChars(lowerChar, result, i + resultOffset) - srcCount;
jaroslav@61
  2487
//                    continue;
jaroslav@61
  2488
//                } else {
jaroslav@61
  2489
//                    lowerCharArray = Character.toChars(lowerChar);
jaroslav@61
  2490
//                }
jaroslav@61
  2491
//
jaroslav@61
  2492
//                /* Grow result if needed */
jaroslav@61
  2493
//                int mapLen = lowerCharArray.length;
jaroslav@61
  2494
//                if (mapLen > srcCount) {
jaroslav@61
  2495
//                    char[] result2 = new char[result.length + mapLen - srcCount];
jaroslav@72
  2496
//                    arraycopy(result, 0, result2, 0,
jaroslav@61
  2497
//                        i + resultOffset);
jaroslav@61
  2498
//                    result = result2;
jaroslav@61
  2499
//                }
jaroslav@61
  2500
//                for (int x=0; x<mapLen; ++x) {
jaroslav@61
  2501
//                    result[i+resultOffset+x] = lowerCharArray[x];
jaroslav@61
  2502
//                }
jaroslav@61
  2503
//                resultOffset += (mapLen - srcCount);
jaroslav@61
  2504
//            } else {
jaroslav@61
  2505
//                result[i+resultOffset] = (char)lowerChar;
jaroslav@61
  2506
//            }
jaroslav@61
  2507
//        }
jaroslav@61
  2508
//        return new String(0, count+resultOffset, result);
jaroslav@61
  2509
//    }
jaroslav@49
  2510
jaroslav@49
  2511
    /**
jaroslav@49
  2512
     * Converts all of the characters in this <code>String</code> to lower
jaroslav@49
  2513
     * case using the rules of the default locale. This is equivalent to calling
jaroslav@49
  2514
     * <code>toLowerCase(Locale.getDefault())</code>.
jaroslav@49
  2515
     * <p>
jaroslav@49
  2516
     * <b>Note:</b> This method is locale sensitive, and may produce unexpected
jaroslav@49
  2517
     * results if used for strings that are intended to be interpreted locale
jaroslav@49
  2518
     * independently.
jaroslav@49
  2519
     * Examples are programming language identifiers, protocol keys, and HTML
jaroslav@49
  2520
     * tags.
jaroslav@49
  2521
     * For instance, <code>"TITLE".toLowerCase()</code> in a Turkish locale
jaroslav@49
  2522
     * returns <code>"t\u005Cu0131tle"</code>, where '\u005Cu0131' is the
jaroslav@49
  2523
     * LATIN SMALL LETTER DOTLESS I character.
jaroslav@49
  2524
     * To obtain correct results for locale insensitive strings, use
jaroslav@49
  2525
     * <code>toLowerCase(Locale.ENGLISH)</code>.
jaroslav@49
  2526
     * <p>
jaroslav@49
  2527
     * @return  the <code>String</code>, converted to lowercase.
jaroslav@49
  2528
     * @see     java.lang.String#toLowerCase(Locale)
jaroslav@49
  2529
     */
jaroslav@49
  2530
    public String toLowerCase() {
jaroslav@64
  2531
        throw new UnsupportedOperationException("Should be supported but without connection to locale");
jaroslav@49
  2532
    }
jaroslav@49
  2533
jaroslav@49
  2534
    /**
jaroslav@49
  2535
     * Converts all of the characters in this <code>String</code> to upper
jaroslav@49
  2536
     * case using the rules of the given <code>Locale</code>. Case mapping is based
jaroslav@49
  2537
     * on the Unicode Standard version specified by the {@link java.lang.Character Character}
jaroslav@49
  2538
     * class. Since case mappings are not always 1:1 char mappings, the resulting
jaroslav@49
  2539
     * <code>String</code> may be a different length than the original <code>String</code>.
jaroslav@49
  2540
     * <p>
jaroslav@49
  2541
     * Examples of locale-sensitive and 1:M case mappings are in the following table.
jaroslav@49
  2542
     * <p>
jaroslav@49
  2543
     * <table border="1" summary="Examples of locale-sensitive and 1:M case mappings. Shows Language code of locale, lower case, upper case, and description.">
jaroslav@49
  2544
     * <tr>
jaroslav@49
  2545
     *   <th>Language Code of Locale</th>
jaroslav@49
  2546
     *   <th>Lower Case</th>
jaroslav@49
  2547
     *   <th>Upper Case</th>
jaroslav@49
  2548
     *   <th>Description</th>
jaroslav@49
  2549
     * </tr>
jaroslav@49
  2550
     * <tr>
jaroslav@49
  2551
     *   <td>tr (Turkish)</td>
jaroslav@49
  2552
     *   <td>&#92;u0069</td>
jaroslav@49
  2553
     *   <td>&#92;u0130</td>
jaroslav@49
  2554
     *   <td>small letter i -&gt; capital letter I with dot above</td>
jaroslav@49
  2555
     * </tr>
jaroslav@49
  2556
     * <tr>
jaroslav@49
  2557
     *   <td>tr (Turkish)</td>
jaroslav@49
  2558
     *   <td>&#92;u0131</td>
jaroslav@49
  2559
     *   <td>&#92;u0049</td>
jaroslav@49
  2560
     *   <td>small letter dotless i -&gt; capital letter I</td>
jaroslav@49
  2561
     * </tr>
jaroslav@49
  2562
     * <tr>
jaroslav@49
  2563
     *   <td>(all)</td>
jaroslav@49
  2564
     *   <td>&#92;u00df</td>
jaroslav@49
  2565
     *   <td>&#92;u0053 &#92;u0053</td>
jaroslav@49
  2566
     *   <td>small letter sharp s -&gt; two letters: SS</td>
jaroslav@49
  2567
     * </tr>
jaroslav@49
  2568
     * <tr>
jaroslav@49
  2569
     *   <td>(all)</td>
jaroslav@49
  2570
     *   <td>Fahrvergn&uuml;gen</td>
jaroslav@49
  2571
     *   <td>FAHRVERGN&Uuml;GEN</td>
jaroslav@49
  2572
     *   <td></td>
jaroslav@49
  2573
     * </tr>
jaroslav@49
  2574
     * </table>
jaroslav@49
  2575
     * @param locale use the case transformation rules for this locale
jaroslav@49
  2576
     * @return the <code>String</code>, converted to uppercase.
jaroslav@49
  2577
     * @see     java.lang.String#toUpperCase()
jaroslav@49
  2578
     * @see     java.lang.String#toLowerCase()
jaroslav@49
  2579
     * @see     java.lang.String#toLowerCase(Locale)
jaroslav@49
  2580
     * @since   1.1
jaroslav@49
  2581
     */
jaroslav@61
  2582
    /* not for javascript 
jaroslav@49
  2583
    public String toUpperCase(Locale locale) {
jaroslav@49
  2584
        if (locale == null) {
jaroslav@49
  2585
            throw new NullPointerException();
jaroslav@49
  2586
        }
jaroslav@49
  2587
jaroslav@49
  2588
        int     firstLower;
jaroslav@49
  2589
jaroslav@61
  2590
        // Now check if there are any characters that need to be changed. 
jaroslav@49
  2591
        scan: {
jaroslav@49
  2592
            for (firstLower = 0 ; firstLower < count; ) {
jaroslav@49
  2593
                int c = (int)value[offset+firstLower];
jaroslav@49
  2594
                int srcCount;
jaroslav@49
  2595
                if ((c >= Character.MIN_HIGH_SURROGATE) &&
jaroslav@49
  2596
                    (c <= Character.MAX_HIGH_SURROGATE)) {
jaroslav@49
  2597
                    c = codePointAt(firstLower);
jaroslav@49
  2598
                    srcCount = Character.charCount(c);
jaroslav@49
  2599
                } else {
jaroslav@49
  2600
                    srcCount = 1;
jaroslav@49
  2601
                }
jaroslav@49
  2602
                int upperCaseChar = Character.toUpperCaseEx(c);
jaroslav@49
  2603
                if ((upperCaseChar == Character.ERROR) ||
jaroslav@49
  2604
                    (c != upperCaseChar)) {
jaroslav@49
  2605
                    break scan;
jaroslav@49
  2606
                }
jaroslav@49
  2607
                firstLower += srcCount;
jaroslav@49
  2608
            }
jaroslav@49
  2609
            return this;
jaroslav@49
  2610
        }
jaroslav@49
  2611
jaroslav@61
  2612
        char[]  result       = new char[count]; /* may grow *
jaroslav@49
  2613
        int     resultOffset = 0;  /* result may grow, so i+resultOffset
jaroslav@61
  2614
                                    * is the write location in result *
jaroslav@49
  2615
jaroslav@61
  2616
        /* Just copy the first few upperCase characters. *
jaroslav@72
  2617
        arraycopy(value, offset, result, 0, firstLower);
jaroslav@49
  2618
jaroslav@49
  2619
        String lang = locale.getLanguage();
jaroslav@49
  2620
        boolean localeDependent =
jaroslav@49
  2621
            (lang == "tr" || lang == "az" || lang == "lt");
jaroslav@49
  2622
        char[] upperCharArray;
jaroslav@49
  2623
        int upperChar;
jaroslav@49
  2624
        int srcChar;
jaroslav@49
  2625
        int srcCount;
jaroslav@49
  2626
        for (int i = firstLower; i < count; i += srcCount) {
jaroslav@49
  2627
            srcChar = (int)value[offset+i];
jaroslav@49
  2628
            if ((char)srcChar >= Character.MIN_HIGH_SURROGATE &&
jaroslav@49
  2629
                (char)srcChar <= Character.MAX_HIGH_SURROGATE) {
jaroslav@49
  2630
                srcChar = codePointAt(i);
jaroslav@49
  2631
                srcCount = Character.charCount(srcChar);
jaroslav@49
  2632
            } else {
jaroslav@49
  2633
                srcCount = 1;
jaroslav@49
  2634
            }
jaroslav@49
  2635
            if (localeDependent) {
jaroslav@49
  2636
                upperChar = ConditionalSpecialCasing.toUpperCaseEx(this, i, locale);
jaroslav@49
  2637
            } else {
jaroslav@49
  2638
                upperChar = Character.toUpperCaseEx(srcChar);
jaroslav@49
  2639
            }
jaroslav@49
  2640
            if ((upperChar == Character.ERROR) ||
jaroslav@49
  2641
                (upperChar >= Character.MIN_SUPPLEMENTARY_CODE_POINT)) {
jaroslav@49
  2642
                if (upperChar == Character.ERROR) {
jaroslav@49
  2643
                    if (localeDependent) {
jaroslav@49
  2644
                        upperCharArray =
jaroslav@49
  2645
                            ConditionalSpecialCasing.toUpperCaseCharArray(this, i, locale);
jaroslav@49
  2646
                    } else {
jaroslav@49
  2647
                        upperCharArray = Character.toUpperCaseCharArray(srcChar);
jaroslav@49
  2648
                    }
jaroslav@49
  2649
                } else if (srcCount == 2) {
jaroslav@49
  2650
                    resultOffset += Character.toChars(upperChar, result, i + resultOffset) - srcCount;
jaroslav@49
  2651
                    continue;
jaroslav@49
  2652
                } else {
jaroslav@49
  2653
                    upperCharArray = Character.toChars(upperChar);
jaroslav@49
  2654
                }
jaroslav@49
  2655
jaroslav@61
  2656
                /* Grow result if needed *
jaroslav@49
  2657
                int mapLen = upperCharArray.length;
jaroslav@49
  2658
                if (mapLen > srcCount) {
jaroslav@49
  2659
                    char[] result2 = new char[result.length + mapLen - srcCount];
jaroslav@72
  2660
                    arraycopy(result, 0, result2, 0,
jaroslav@49
  2661
                        i + resultOffset);
jaroslav@49
  2662
                    result = result2;
jaroslav@49
  2663
                }
jaroslav@49
  2664
                for (int x=0; x<mapLen; ++x) {
jaroslav@49
  2665
                    result[i+resultOffset+x] = upperCharArray[x];
jaroslav@49
  2666
                }
jaroslav@49
  2667
                resultOffset += (mapLen - srcCount);
jaroslav@49
  2668
            } else {
jaroslav@49
  2669
                result[i+resultOffset] = (char)upperChar;
jaroslav@49
  2670
            }
jaroslav@49
  2671
        }
jaroslav@49
  2672
        return new String(0, count+resultOffset, result);
jaroslav@49
  2673
    }
jaroslav@61
  2674
    */
jaroslav@49
  2675
jaroslav@49
  2676
    /**
jaroslav@49
  2677
     * Converts all of the characters in this <code>String</code> to upper
jaroslav@49
  2678
     * case using the rules of the default locale. This method is equivalent to
jaroslav@49
  2679
     * <code>toUpperCase(Locale.getDefault())</code>.
jaroslav@49
  2680
     * <p>
jaroslav@49
  2681
     * <b>Note:</b> This method is locale sensitive, and may produce unexpected
jaroslav@49
  2682
     * results if used for strings that are intended to be interpreted locale
jaroslav@49
  2683
     * independently.
jaroslav@49
  2684
     * Examples are programming language identifiers, protocol keys, and HTML
jaroslav@49
  2685
     * tags.
jaroslav@49
  2686
     * For instance, <code>"title".toUpperCase()</code> in a Turkish locale
jaroslav@49
  2687
     * returns <code>"T\u005Cu0130TLE"</code>, where '\u005Cu0130' is the
jaroslav@49
  2688
     * LATIN CAPITAL LETTER I WITH DOT ABOVE character.
jaroslav@49
  2689
     * To obtain correct results for locale insensitive strings, use
jaroslav@49
  2690
     * <code>toUpperCase(Locale.ENGLISH)</code>.
jaroslav@49
  2691
     * <p>
jaroslav@49
  2692
     * @return  the <code>String</code>, converted to uppercase.
jaroslav@49
  2693
     * @see     java.lang.String#toUpperCase(Locale)
jaroslav@49
  2694
     */
jaroslav@49
  2695
    public String toUpperCase() {
jaroslav@61
  2696
        throw new UnsupportedOperationException();
jaroslav@49
  2697
    }
jaroslav@49
  2698
jaroslav@49
  2699
    /**
jaroslav@49
  2700
     * Returns a copy of the string, with leading and trailing whitespace
jaroslav@49
  2701
     * omitted.
jaroslav@49
  2702
     * <p>
jaroslav@49
  2703
     * If this <code>String</code> object represents an empty character
jaroslav@49
  2704
     * sequence, or the first and last characters of character sequence
jaroslav@49
  2705
     * represented by this <code>String</code> object both have codes
jaroslav@49
  2706
     * greater than <code>'&#92;u0020'</code> (the space character), then a
jaroslav@49
  2707
     * reference to this <code>String</code> object is returned.
jaroslav@49
  2708
     * <p>
jaroslav@49
  2709
     * Otherwise, if there is no character with a code greater than
jaroslav@49
  2710
     * <code>'&#92;u0020'</code> in the string, then a new
jaroslav@49
  2711
     * <code>String</code> object representing an empty string is created
jaroslav@49
  2712
     * and returned.
jaroslav@49
  2713
     * <p>
jaroslav@49
  2714
     * Otherwise, let <i>k</i> be the index of the first character in the
jaroslav@49
  2715
     * string whose code is greater than <code>'&#92;u0020'</code>, and let
jaroslav@49
  2716
     * <i>m</i> be the index of the last character in the string whose code
jaroslav@49
  2717
     * is greater than <code>'&#92;u0020'</code>. A new <code>String</code>
jaroslav@49
  2718
     * object is created, representing the substring of this string that
jaroslav@49
  2719
     * begins with the character at index <i>k</i> and ends with the
jaroslav@49
  2720
     * character at index <i>m</i>-that is, the result of
jaroslav@49
  2721
     * <code>this.substring(<i>k</i>,&nbsp;<i>m</i>+1)</code>.
jaroslav@49
  2722
     * <p>
jaroslav@49
  2723
     * This method may be used to trim whitespace (as defined above) from
jaroslav@49
  2724
     * the beginning and end of a string.
jaroslav@49
  2725
     *
jaroslav@49
  2726
     * @return  A copy of this string with leading and trailing white
jaroslav@49
  2727
     *          space removed, or this string if it has no leading or
jaroslav@49
  2728
     *          trailing white space.
jaroslav@49
  2729
     */
jaroslav@49
  2730
    public String trim() {
jaroslav@49
  2731
        int len = count;
jaroslav@49
  2732
        int st = 0;
jaroslav@49
  2733
        int off = offset;      /* avoid getfield opcode */
jaroslav@49
  2734
        char[] val = value;    /* avoid getfield opcode */
jaroslav@49
  2735
jaroslav@49
  2736
        while ((st < len) && (val[off + st] <= ' ')) {
jaroslav@49
  2737
            st++;
jaroslav@49
  2738
        }
jaroslav@49
  2739
        while ((st < len) && (val[off + len - 1] <= ' ')) {
jaroslav@49
  2740
            len--;
jaroslav@49
  2741
        }
jaroslav@49
  2742
        return ((st > 0) || (len < count)) ? substring(st, len) : this;
jaroslav@49
  2743
    }
jaroslav@49
  2744
jaroslav@49
  2745
    /**
jaroslav@49
  2746
     * This object (which is already a string!) is itself returned.
jaroslav@49
  2747
     *
jaroslav@49
  2748
     * @return  the string itself.
jaroslav@49
  2749
     */
jaroslav@49
  2750
    public String toString() {
jaroslav@49
  2751
        return this;
jaroslav@49
  2752
    }
jaroslav@49
  2753
jaroslav@49
  2754
    /**
jaroslav@49
  2755
     * Converts this string to a new character array.
jaroslav@49
  2756
     *
jaroslav@49
  2757
     * @return  a newly allocated character array whose length is the length
jaroslav@49
  2758
     *          of this string and whose contents are initialized to contain
jaroslav@49
  2759
     *          the character sequence represented by this string.
jaroslav@49
  2760
     */
jaroslav@49
  2761
    public char[] toCharArray() {
jaroslav@49
  2762
        char result[] = new char[count];
jaroslav@49
  2763
        getChars(0, count, result, 0);
jaroslav@49
  2764
        return result;
jaroslav@49
  2765
    }
jaroslav@49
  2766
jaroslav@49
  2767
    /**
jaroslav@49
  2768
     * Returns a formatted string using the specified format string and
jaroslav@49
  2769
     * arguments.
jaroslav@49
  2770
     *
jaroslav@49
  2771
     * <p> The locale always used is the one returned by {@link
jaroslav@49
  2772
     * java.util.Locale#getDefault() Locale.getDefault()}.
jaroslav@49
  2773
     *
jaroslav@49
  2774
     * @param  format
jaroslav@49
  2775
     *         A <a href="../util/Formatter.html#syntax">format string</a>
jaroslav@49
  2776
     *
jaroslav@49
  2777
     * @param  args
jaroslav@49
  2778
     *         Arguments referenced by the format specifiers in the format
jaroslav@49
  2779
     *         string.  If there are more arguments than format specifiers, the
jaroslav@49
  2780
     *         extra arguments are ignored.  The number of arguments is
jaroslav@49
  2781
     *         variable and may be zero.  The maximum number of arguments is
jaroslav@49
  2782
     *         limited by the maximum dimension of a Java array as defined by
jaroslav@49
  2783
     *         <cite>The Java&trade; Virtual Machine Specification</cite>.
jaroslav@49
  2784
     *         The behaviour on a
jaroslav@49
  2785
     *         <tt>null</tt> argument depends on the <a
jaroslav@49
  2786
     *         href="../util/Formatter.html#syntax">conversion</a>.
jaroslav@49
  2787
     *
jaroslav@49
  2788
     * @throws  IllegalFormatException
jaroslav@49
  2789
     *          If a format string contains an illegal syntax, a format
jaroslav@49
  2790
     *          specifier that is incompatible with the given arguments,
jaroslav@49
  2791
     *          insufficient arguments given the format string, or other
jaroslav@49
  2792
     *          illegal conditions.  For specification of all possible
jaroslav@49
  2793
     *          formatting errors, see the <a
jaroslav@49
  2794
     *          href="../util/Formatter.html#detail">Details</a> section of the
jaroslav@49
  2795
     *          formatter class specification.
jaroslav@49
  2796
     *
jaroslav@49
  2797
     * @throws  NullPointerException
jaroslav@49
  2798
     *          If the <tt>format</tt> is <tt>null</tt>
jaroslav@49
  2799
     *
jaroslav@49
  2800
     * @return  A formatted string
jaroslav@49
  2801
     *
jaroslav@49
  2802
     * @see  java.util.Formatter
jaroslav@49
  2803
     * @since  1.5
jaroslav@49
  2804
     */
jaroslav@49
  2805
    public static String format(String format, Object ... args) {
jaroslav@64
  2806
        throw new UnsupportedOperationException();
jaroslav@49
  2807
    }
jaroslav@49
  2808
jaroslav@49
  2809
    /**
jaroslav@49
  2810
     * Returns a formatted string using the specified locale, format string,
jaroslav@49
  2811
     * and arguments.
jaroslav@49
  2812
     *
jaroslav@49
  2813
     * @param  l
jaroslav@49
  2814
     *         The {@linkplain java.util.Locale locale} to apply during
jaroslav@49
  2815
     *         formatting.  If <tt>l</tt> is <tt>null</tt> then no localization
jaroslav@49
  2816
     *         is applied.
jaroslav@49
  2817
     *
jaroslav@49
  2818
     * @param  format
jaroslav@49
  2819
     *         A <a href="../util/Formatter.html#syntax">format string</a>
jaroslav@49
  2820
     *
jaroslav@49
  2821
     * @param  args
jaroslav@49
  2822
     *         Arguments referenced by the format specifiers in the format
jaroslav@49
  2823
     *         string.  If there are more arguments than format specifiers, the
jaroslav@49
  2824
     *         extra arguments are ignored.  The number of arguments is
jaroslav@49
  2825
     *         variable and may be zero.  The maximum number of arguments is
jaroslav@49
  2826
     *         limited by the maximum dimension of a Java array as defined by
jaroslav@49
  2827
     *         <cite>The Java&trade; Virtual Machine Specification</cite>.
jaroslav@49
  2828
     *         The behaviour on a
jaroslav@49
  2829
     *         <tt>null</tt> argument depends on the <a
jaroslav@49
  2830
     *         href="../util/Formatter.html#syntax">conversion</a>.
jaroslav@49
  2831
     *
jaroslav@49
  2832
     * @throws  IllegalFormatException
jaroslav@49
  2833
     *          If a format string contains an illegal syntax, a format
jaroslav@49
  2834
     *          specifier that is incompatible with the given arguments,
jaroslav@49
  2835
     *          insufficient arguments given the format string, or other
jaroslav@49
  2836
     *          illegal conditions.  For specification of all possible
jaroslav@49
  2837
     *          formatting errors, see the <a
jaroslav@49
  2838
     *          href="../util/Formatter.html#detail">Details</a> section of the
jaroslav@49
  2839
     *          formatter class specification
jaroslav@49
  2840
     *
jaroslav@49
  2841
     * @throws  NullPointerException
jaroslav@49
  2842
     *          If the <tt>format</tt> is <tt>null</tt>
jaroslav@49
  2843
     *
jaroslav@49
  2844
     * @return  A formatted string
jaroslav@49
  2845
     *
jaroslav@49
  2846
     * @see  java.util.Formatter
jaroslav@49
  2847
     * @since  1.5
jaroslav@49
  2848
     */
jaroslav@61
  2849
//    public static String format(Locale l, String format, Object ... args) {
jaroslav@61
  2850
//        return new Formatter(l).format(format, args).toString();
jaroslav@61
  2851
//    }
jaroslav@49
  2852
jaroslav@49
  2853
    /**
jaroslav@49
  2854
     * Returns the string representation of the <code>Object</code> argument.
jaroslav@49
  2855
     *
jaroslav@49
  2856
     * @param   obj   an <code>Object</code>.
jaroslav@49
  2857
     * @return  if the argument is <code>null</code>, then a string equal to
jaroslav@49
  2858
     *          <code>"null"</code>; otherwise, the value of
jaroslav@49
  2859
     *          <code>obj.toString()</code> is returned.
jaroslav@49
  2860
     * @see     java.lang.Object#toString()
jaroslav@49
  2861
     */
jaroslav@49
  2862
    public static String valueOf(Object obj) {
jaroslav@49
  2863
        return (obj == null) ? "null" : obj.toString();
jaroslav@49
  2864
    }
jaroslav@49
  2865
jaroslav@49
  2866
    /**
jaroslav@49
  2867
     * Returns the string representation of the <code>char</code> array
jaroslav@49
  2868
     * argument. The contents of the character array are copied; subsequent
jaroslav@49
  2869
     * modification of the character array does not affect the newly
jaroslav@49
  2870
     * created string.
jaroslav@49
  2871
     *
jaroslav@49
  2872
     * @param   data   a <code>char</code> array.
jaroslav@49
  2873
     * @return  a newly allocated string representing the same sequence of
jaroslav@49
  2874
     *          characters contained in the character array argument.
jaroslav@49
  2875
     */
jaroslav@49
  2876
    public static String valueOf(char data[]) {
jaroslav@49
  2877
        return new String(data);
jaroslav@49
  2878
    }
jaroslav@49
  2879
jaroslav@49
  2880
    /**
jaroslav@49
  2881
     * Returns the string representation of a specific subarray of the
jaroslav@49
  2882
     * <code>char</code> array argument.
jaroslav@49
  2883
     * <p>
jaroslav@49
  2884
     * The <code>offset</code> argument is the index of the first
jaroslav@49
  2885
     * character of the subarray. The <code>count</code> argument
jaroslav@49
  2886
     * specifies the length of the subarray. The contents of the subarray
jaroslav@49
  2887
     * are copied; subsequent modification of the character array does not
jaroslav@49
  2888
     * affect the newly created string.
jaroslav@49
  2889
     *
jaroslav@49
  2890
     * @param   data     the character array.
jaroslav@49
  2891
     * @param   offset   the initial offset into the value of the
jaroslav@49
  2892
     *                  <code>String</code>.
jaroslav@49
  2893
     * @param   count    the length of the value of the <code>String</code>.
jaroslav@49
  2894
     * @return  a string representing the sequence of characters contained
jaroslav@49
  2895
     *          in the subarray of the character array argument.
jaroslav@49
  2896
     * @exception IndexOutOfBoundsException if <code>offset</code> is
jaroslav@49
  2897
     *          negative, or <code>count</code> is negative, or
jaroslav@49
  2898
     *          <code>offset+count</code> is larger than
jaroslav@49
  2899
     *          <code>data.length</code>.
jaroslav@49
  2900
     */
jaroslav@49
  2901
    public static String valueOf(char data[], int offset, int count) {
jaroslav@49
  2902
        return new String(data, offset, count);
jaroslav@49
  2903
    }
jaroslav@49
  2904
jaroslav@49
  2905
    /**
jaroslav@49
  2906
     * Returns a String that represents the character sequence in the
jaroslav@49
  2907
     * array specified.
jaroslav@49
  2908
     *
jaroslav@49
  2909
     * @param   data     the character array.
jaroslav@49
  2910
     * @param   offset   initial offset of the subarray.
jaroslav@49
  2911
     * @param   count    length of the subarray.
jaroslav@49
  2912
     * @return  a <code>String</code> that contains the characters of the
jaroslav@49
  2913
     *          specified subarray of the character array.
jaroslav@49
  2914
     */
jaroslav@49
  2915
    public static String copyValueOf(char data[], int offset, int count) {
jaroslav@49
  2916
        // All public String constructors now copy the data.
jaroslav@49
  2917
        return new String(data, offset, count);
jaroslav@49
  2918
    }
jaroslav@49
  2919
jaroslav@49
  2920
    /**
jaroslav@49
  2921
     * Returns a String that represents the character sequence in the
jaroslav@49
  2922
     * array specified.
jaroslav@49
  2923
     *
jaroslav@49
  2924
     * @param   data   the character array.
jaroslav@49
  2925
     * @return  a <code>String</code> that contains the characters of the
jaroslav@49
  2926
     *          character array.
jaroslav@49
  2927
     */
jaroslav@49
  2928
    public static String copyValueOf(char data[]) {
jaroslav@49
  2929
        return copyValueOf(data, 0, data.length);
jaroslav@49
  2930
    }
jaroslav@49
  2931
jaroslav@49
  2932
    /**
jaroslav@49
  2933
     * Returns the string representation of the <code>boolean</code> argument.
jaroslav@49
  2934
     *
jaroslav@49
  2935
     * @param   b   a <code>boolean</code>.
jaroslav@49
  2936
     * @return  if the argument is <code>true</code>, a string equal to
jaroslav@49
  2937
     *          <code>"true"</code> is returned; otherwise, a string equal to
jaroslav@49
  2938
     *          <code>"false"</code> is returned.
jaroslav@49
  2939
     */
jaroslav@49
  2940
    public static String valueOf(boolean b) {
jaroslav@49
  2941
        return b ? "true" : "false";
jaroslav@49
  2942
    }
jaroslav@49
  2943
jaroslav@49
  2944
    /**
jaroslav@49
  2945
     * Returns the string representation of the <code>char</code>
jaroslav@49
  2946
     * argument.
jaroslav@49
  2947
     *
jaroslav@49
  2948
     * @param   c   a <code>char</code>.
jaroslav@49
  2949
     * @return  a string of length <code>1</code> containing
jaroslav@49
  2950
     *          as its single character the argument <code>c</code>.
jaroslav@49
  2951
     */
jaroslav@49
  2952
    public static String valueOf(char c) {
jaroslav@49
  2953
        char data[] = {c};
jaroslav@49
  2954
        return new String(0, 1, data);
jaroslav@49
  2955
    }
jaroslav@49
  2956
jaroslav@49
  2957
    /**
jaroslav@49
  2958
     * Returns the string representation of the <code>int</code> argument.
jaroslav@49
  2959
     * <p>
jaroslav@49
  2960
     * The representation is exactly the one returned by the
jaroslav@49
  2961
     * <code>Integer.toString</code> method of one argument.
jaroslav@49
  2962
     *
jaroslav@49
  2963
     * @param   i   an <code>int</code>.
jaroslav@49
  2964
     * @return  a string representation of the <code>int</code> argument.
jaroslav@49
  2965
     * @see     java.lang.Integer#toString(int, int)
jaroslav@49
  2966
     */
jaroslav@49
  2967
    public static String valueOf(int i) {
jaroslav@49
  2968
        return Integer.toString(i);
jaroslav@49
  2969
    }
jaroslav@49
  2970
jaroslav@49
  2971
    /**
jaroslav@49
  2972
     * Returns the string representation of the <code>long</code> argument.
jaroslav@49
  2973
     * <p>
jaroslav@49
  2974
     * The representation is exactly the one returned by the
jaroslav@49
  2975
     * <code>Long.toString</code> method of one argument.
jaroslav@49
  2976
     *
jaroslav@49
  2977
     * @param   l   a <code>long</code>.
jaroslav@49
  2978
     * @return  a string representation of the <code>long</code> argument.
jaroslav@49
  2979
     * @see     java.lang.Long#toString(long)
jaroslav@49
  2980
     */
jaroslav@49
  2981
    public static String valueOf(long l) {
jaroslav@49
  2982
        return Long.toString(l);
jaroslav@49
  2983
    }
jaroslav@49
  2984
jaroslav@49
  2985
    /**
jaroslav@49
  2986
     * Returns the string representation of the <code>float</code> argument.
jaroslav@49
  2987
     * <p>
jaroslav@49
  2988
     * The representation is exactly the one returned by the
jaroslav@49
  2989
     * <code>Float.toString</code> method of one argument.
jaroslav@49
  2990
     *
jaroslav@49
  2991
     * @param   f   a <code>float</code>.
jaroslav@49
  2992
     * @return  a string representation of the <code>float</code> argument.
jaroslav@49
  2993
     * @see     java.lang.Float#toString(float)
jaroslav@49
  2994
     */
jaroslav@49
  2995
    public static String valueOf(float f) {
jaroslav@49
  2996
        return Float.toString(f);
jaroslav@49
  2997
    }
jaroslav@49
  2998
jaroslav@49
  2999
    /**
jaroslav@49
  3000
     * Returns the string representation of the <code>double</code> argument.
jaroslav@49
  3001
     * <p>
jaroslav@49
  3002
     * The representation is exactly the one returned by the
jaroslav@49
  3003
     * <code>Double.toString</code> method of one argument.
jaroslav@49
  3004
     *
jaroslav@49
  3005
     * @param   d   a <code>double</code>.
jaroslav@49
  3006
     * @return  a  string representation of the <code>double</code> argument.
jaroslav@49
  3007
     * @see     java.lang.Double#toString(double)
jaroslav@49
  3008
     */
jaroslav@49
  3009
    public static String valueOf(double d) {
jaroslav@49
  3010
        return Double.toString(d);
jaroslav@49
  3011
    }
jaroslav@49
  3012
jaroslav@49
  3013
    /**
jaroslav@49
  3014
     * Returns a canonical representation for the string object.
jaroslav@49
  3015
     * <p>
jaroslav@49
  3016
     * A pool of strings, initially empty, is maintained privately by the
jaroslav@49
  3017
     * class <code>String</code>.
jaroslav@49
  3018
     * <p>
jaroslav@49
  3019
     * When the intern method is invoked, if the pool already contains a
jaroslav@49
  3020
     * string equal to this <code>String</code> object as determined by
jaroslav@49
  3021
     * the {@link #equals(Object)} method, then the string from the pool is
jaroslav@49
  3022
     * returned. Otherwise, this <code>String</code> object is added to the
jaroslav@49
  3023
     * pool and a reference to this <code>String</code> object is returned.
jaroslav@49
  3024
     * <p>
jaroslav@49
  3025
     * It follows that for any two strings <code>s</code> and <code>t</code>,
jaroslav@49
  3026
     * <code>s.intern()&nbsp;==&nbsp;t.intern()</code> is <code>true</code>
jaroslav@49
  3027
     * if and only if <code>s.equals(t)</code> is <code>true</code>.
jaroslav@49
  3028
     * <p>
jaroslav@49
  3029
     * All literal strings and string-valued constant expressions are
jaroslav@49
  3030
     * interned. String literals are defined in section 3.10.5 of the
jaroslav@49
  3031
     * <cite>The Java&trade; Language Specification</cite>.
jaroslav@49
  3032
     *
jaroslav@49
  3033
     * @return  a string that has the same contents as this string, but is
jaroslav@49
  3034
     *          guaranteed to be from a pool of unique strings.
jaroslav@49
  3035
     */
jaroslav@49
  3036
    public native String intern();
jaroslav@49
  3037
jaroslav@61
  3038
    static char[] copyOfRange(char[] original, int from, int to) {
jaroslav@61
  3039
        int newLength = to - from;
jaroslav@61
  3040
        if (newLength < 0) {
jaroslav@61
  3041
            throw new IllegalArgumentException(from + " > " + to);
jaroslav@61
  3042
        }
jaroslav@61
  3043
        char[] copy = new char[newLength];
jaroslav@72
  3044
        arraycopy(original, from, copy, 0,
jaroslav@61
  3045
            Math.min(original.length - from, newLength));
jaroslav@61
  3046
        return copy;
jaroslav@61
  3047
    }
jaroslav@61
  3048
    static char[] copyOf(char[] original, int newLength) {
jaroslav@61
  3049
        char[] copy = new char[newLength];
jaroslav@72
  3050
        arraycopy(original, 0, copy, 0,
jaroslav@61
  3051
            Math.min(original.length, newLength));
jaroslav@61
  3052
        return copy;
jaroslav@61
  3053
    }
jaroslav@72
  3054
    static void arraycopy(
jaroslav@72
  3055
        char[] value, int srcBegin, char[] dst, int dstBegin, int count
jaroslav@72
  3056
    ) {
jaroslav@73
  3057
        while (count-- > 0) {
jaroslav@73
  3058
            dst[dstBegin++] = value[srcBegin++];
jaroslav@73
  3059
        }
jaroslav@72
  3060
    }
jaroslav@84
  3061
    // access system property
jaroslav@84
  3062
    static String getProperty(String nm) {
jaroslav@84
  3063
        return null;
jaroslav@84
  3064
    }
jaroslav@49
  3065
}