Lines Matching defs:Character
50 * The value is used for character storage.
73 * Returns the length (character count).
169 * Attempts to reduce storage used for the character sequence.
182 * Sets the length of the character sequence.
183 * The sequence is changed to a new character sequence
185 * index <i>k</i> less than {@code newLength}, the character at
186 * index <i>k</i> in the new character sequence is the same as the
187 * character at index <i>k</i> in the old sequence if <i>k</i> is less
188 * than the length of the old character sequence; otherwise, it is the
189 * null character {@code '\u005Cu0000'}.
227 * <a href="Character.html#unicode">surrogate</a>, the surrogate
243 * Returns the character (Unicode code point) at the specified
257 * @return the code point value of the character at the
267 return Character.codePointAtImpl(value, index, count);
271 * Returns the character (Unicode code point) before the specified
296 return Character.codePointBeforeImpl(value, index, 0);
323 return Character.codePointCountImpl(value, beginIndex, endIndex-beginIndex);
349 return Character.offsetByCodePointsImpl(value, 0, count,
355 * destination character array {@code dst}. The first character to
356 * be copied is at index {@code srcBegin}; the last character to
393 * The character at the specified index is set to {@code ch}. This
394 * sequence is altered to represent a new character sequence that is
395 * identical to the old character sequence, except that it contains the
396 * character {@code ch} at position {@code index}.
401 * @param index the index of the character to modify.
402 * @param ch the new character.
418 * {@link #append(String) appended} to this character sequence.
429 * Appends the specified string to this character sequence.
436 * Let <i>n</i> be the length of this character sequence just prior to
437 * execution of the {@code append} method. Then the character at
438 * index <i>k</i> in the new character sequence is equal to the character
439 * at index <i>k</i> in the old character sequence, if <i>k</i> is less
440 * than <i>n</i>; otherwise, it is equal to the character at index
518 * Let <i>n</i> be the length of this character sequence just prior to
519 * execution of the {@code append} method. Then the character at
520 * index <i>k</i> in this character sequence becomes equal to the
521 * character at index <i>k</i> in this sequence, if <i>k</i> is less than
522 * <i>n</i>; otherwise, it is equal to the character at index
566 * {@link #append(String) appended} to this character sequence.
592 * {@link #append(String) appended} to this character sequence.
618 * {@link #append(String) appended} to this character sequence.
651 * and the character in that string were then
652 * {@link #append(String) appended} to this character sequence.
672 * {@link #append(String) appended} to this character sequence.
699 * {@link #append(String) appended} to this character sequence.
726 * {@link #append(String) appended} to this character sequence.
744 * {@link #append(String) appended} to this character sequence.
758 * the character at index {@code end - 1} or to the end of the
759 * sequence if no such character exists. If
791 * {@link Character#charCount(int) Character.charCount(codePoint)}.
795 * {@link Character#toChars(int)} and the character in that array
796 * were then {@link #append(char[]) appended} to this character
808 if (Character.isBmpCodePoint(codePoint)) {
812 } else if (Character.isValidCodePoint(codePoint)) {
814 Character.toSurrogates(codePoint, value, count);
826 * <p>Note: If the character at the given index is a supplementary
827 * character, this method does not remove the entire character. If
830 * {@code Character.charCount(thisSequence.codePointAt(index))},
851 character
853 * sequence if no such character exists. First the
890 * characters currently contained in this character sequence. The
904 * Returns a new character sequence that is a subsequence of this sequence.
938 * extends to the character at index {@code end - 1}.
998 * argument into this character sequence.
1003 * {@link #insert(int,String) inserted} into this character
1021 * Inserts the string into this character sequence.
1030 * The character at index <i>k</i> in the new character sequence is
1033 * <li>the character at index <i>k</i> in the old character sequence, if
1035 * <li>the character at index <i>k</i>{@code -offset} in the
1038 * <li>the character at index <i>k</i>{@code -str.length()} in the
1039 * old character sequence, if <i>k</i> is not less than
1077 * {@link #insert(int,String) inserted} into this character
1085 * @param str a character array.
1141 * The character at index <i>k</i> in this sequence becomes equal to:
1143 * <li>the character at index <i>k</i> in this sequence, if
1145 * <li>the character at index <i>k</i>{@code +start-dstOffset} in
1148 * <li>the character at index <i>k</i>{@code -(end-start)} in this
1203 * {@link #insert(int,String) inserted} into this character
1226 * and the character in that string were then
1227 * {@link #insert(int,String) inserted} into this character
1255 * {@link #insert(int,String) inserted} into this character
1279 * {@link #insert(int,String) inserted} into this character
1303 * {@link #insert(int,String) inserted} into this character
1327 * {@link #insert(int,String) inserted} into this character
1355 * object, then the index of the first character of the first
1395 * within this object, then the index of the first character of
1424 * Causes this character sequence to be replaced by the reverse of
1430 * Let <i>n</i> be the character length of this character sequence
1433 * character at index <i>k</i> in the new character sequence is
1434 * equal to the character at index <i>n-k-1</i> in the old
1435 * character sequence.
1455 if (Character.isSurrogate(cj) ||
1456 Character.isSurrogate(ck)) {
1470 if (Character.isLowSurrogate(c2)) {
1472 if (Character.isHighSurrogate(c1)) {
1483 * contain the character sequence currently represented by this
