Lines Matching refs:count
40 private int count;
67 throw new InvalidObjectException("count out of range");
72 count = len;
87 count = string.length();
89 value = new char[count + INITIAL_CAPACITY];
90 string.getCharsNoCheck(0, count, value, 0);
96 System.arraycopy(value, 0, newData, 0, count);
102 int newCount = count + 4;
106 value[count++] = 'n';
107 value[count++] = 'u';
108 value[count++] = 'l';
109 value[count++] = 'l';
113 int newCount = count + chars.length;
117 System.arraycopy(chars, 0, value, count, chars.length);
118 count = newCount;
123 int newCount = count + length;
127 System.arraycopy(chars, offset, value, count, length);
128 count = newCount;
132 if (count == value.length) {
133 enlargeBuffer(count + 1);
135 value[count++] = ch;
144 int newCount = count + length;
148 string.getCharsNoCheck(0, length, value, count);
149 count = newCount;
161 int newCount = count + length;
170 ((String) s).getCharsNoCheck(start, end, value, count);
173 System.arraycopy(other.value, start, value, count, length);
175 int j = count; // Destination index.
181 this.count = newCount;
200 if (index < 0 || index >= count) {
207 throw new StringIndexOutOfBoundsException(count, index);
211 throw new StringIndexOutOfBoundsException(count, start, end - start);
216 // the end index is >= count, as long as it's >= start. This means
217 // we have to clamp it to count here.
218 if (end > count) {
219 end = count;
222 if (start < 0 || start > count || start > end) {
226 // NOTE: StringBuilder#delete(int, int) throws only if start > count
227 // (start == count is considered valid, oddly enough). Since 'end' is
234 int length = count - end;
246 count -= end - start;
250 if (index < 0 || index >= count) {
296 if (start > count || end > count || start > end) {
303 if (index < 0 || index > count) {
309 count += chars.length;
314 if (index >= 0 && index <= count) {
320 count += length;
325 throw new StringIndexOutOfBoundsException("this.length=" + count
331 if (index < 0 || index > count) {
333 throw new ArrayIndexOutOfBoundsException(count, index);
337 count++;
341 if (index >= 0 && index <= count) {
349 count += min;
360 if ((index | start | end) < 0 || index > count || start > end || end > s.length()) {
372 return count;
377 if (value.length - count >= size) {
379 // index == count case is no-op
380 System.arraycopy(value, index, value, index + size, count - index);
385 newCount = Math.max(count + size, value.length*2 + 2);
390 // index == count case is no-op
391 System.arraycopy(value, index, newData, index + size, count - index);
398 if (end > count) {
399 end = count;
406 // index == count case is no-op
408 + stringLength, count - end);
412 // index == count case is no-op
414 + stringLength, count - end);
426 count -= diff;
441 if (count < 2) {
445 int end = count - 1;
449 for (int i = 0, mid = count / 2; i < mid; i++, --end) {
455 if (surAtFront && (count < 3)) {
496 if ((count & 1) == 1 && (!allowFrontSur || !allowEndSur)) {
501 for (int i = 0, end = count; i < count; i++) {
503 if ((i + 1) < count && high >= 0xd800 && high <= 0xdbff) {
529 if (index < 0 || index >= count) {
559 System.arraycopy(value, 0, newData, 0, count);
563 if (count < length) {
564 Arrays.fill(value, count, length, (char) 0);
568 count = length;
583 if (start >= 0 && start <= count) {
584 if (start == count) {
589 return new String(value, start, count - start);
608 if (start >= 0 && start <= end && end <= count) {
626 if (count == 0) {
629 return StringFactory.newStringFromChars(0, count, value);
684 if (subCount + start > count) {
692 for (; i < count; i++) {
698 if (!found || subCount + i > count) {
699 return -1; // handles subCount > count || start >= count
711 return (start < count || start == 0) ? start : count;
728 return lastIndexOf(string, count);
748 if (subCount <= count && start >= 0) {
750 if (start > count - subCount) {
751 start = count - subCount; // count and subCount are both
779 return start < count ? start : count;
791 if (count < value.length) {
792 char[] newValue = new char[count];
793 System.arraycopy(value, 0, newValue, 0, count);
813 if (index < 0 || index >= count) {
816 return Character.codePointAt(value, index, count);
833 if (index < 1 || index > count) {
857 if (start < 0 || end > count || start > end) {
870 * the number of code points to count.
883 return Character.offsetByCodePoints(value, 0, count, index,