Lines Matching refs:length

93         {'f',    0xDC00,  0xD800, 0xDC00,  0xDE02,  0xDC10}, // codePointAt(length-1)
102 for (int i = 0; i < input.length; i++) {
110 testCodePoint(At, s, s.length()-1, golden1[2][i]);
117 testCodePoint(At, s, s.length());
132 {'f', 0xDC00, 0xD800, 0x10000, 0xE0202, 0x10010},// codePointBefore(length)
141 for (int i = 0; i < input.length; i++) {
149 testCodePoint(Before, s, s.length(), golden2[2][i]);
156 testCodePoint(Before, s, s.length()+1);
198 for (int i = 0; i < input.length; i++) {
223 for (int i = 0; i < input.length; i++) {
231 for (int j = 2; j < golden3[i].length; j++) {
241 testIndexOf(s, s.length(), ch,
242 golden3[i][golden3[i].length-1]);
261 for (int i = 0; i < input.length; i++) {
268 golden3[i][golden3[i].length-2]);
287 for (int i = 0; i < input.length; i++) {
290 int len = s.length();
296 for (int j = golden3[i].length - 2; j > 0; j--) {
306 testLastIndexOf(s, len, ch, golden3[i][golden3[i].length-2]);
324 for (int i = 0; i < input.length; i++) {
328 for (int j = 0; j < s.length(); j += Character.charCount(c)) {
334 for (int j = 0; j < s.length(); j += Character.charCount(c)) {
335 if (mid == 0 && j >= s.length()/2) {
372 for (int i = 0; i < x.length; i++)
375 final String s = new String(x, 0, x.length);
376 check(s.codePointCount(0, s.length()) != x.length,
377 "s.codePointCount(0, s.length()) != x.length");
378 check(s.length() <= x.length,
379 "s.length() <= x.length");
380 for (int i = 0, j = 0; i < x.length; i++) {
396 for (int i = 0; i < input.length; i++) {
398 int length = str.length();
399 for (int j = 0; j <= length; j++) {
400 int result = str.codePointCount(j, length);
401 int expected = Character.codePointCount(str, j, length);
402 check(result != expected, "codePointCount(input["+i+"], "+j+", "+length+")",
406 String substr = str.substring(j, length);
407 result = substr.codePointCount(0, substr.length());
408 check(result != expected, "substring:codePointCount(input["+i+"], "+j+", "+length+")",
411 for (int j = length; j >= 0; j--) {
417 result = substr.codePointCount(0, substr.length());
424 testCodePointCount(str, -1, length, IndexOutOfBoundsException.class);
425 testCodePointCount(str, 0, length+1, IndexOutOfBoundsException.class);
426 testCodePointCount(str, length, length-1, IndexOutOfBoundsException.class);
438 for (int i = 0; i < input.length; i++) {
440 int length = str.length();
441 for (int j = 0; j <= length; j++) {
442 int nCodePoints = Character.codePointCount(str, j, length);
444 check(result != length,
446 result, length);
447 result = str.offsetByCodePoints(length, -nCodePoints);
449 if (j > 0 && j < length) {
459 for (int j = length; j >= 0; j--) {
463 if (j > 0 && j < length) {
480 testOffsetByCodePoints(str, -1, length, IndexOutOfBoundsException.class);
481 testOffsetByCodePoints(str, 0, length+1, IndexOutOfBoundsException.class);
483 testOffsetByCodePoints(str, length, length-1, IndexOutOfBoundsException.class);
484 testOffsetByCodePoints(str, length, -(length+1), IndexOutOfBoundsException.class);
497 for (int i = 0; i < input.length; i++) {
499 String str = wholeString.substring(header.length());
500 int length = str.length();
501 for (int j = 0; j <= length; j++) {
502 int nCodePoints = Character.codePointCount(str, j, length);
504 check(result != length,
506 result, length);
507 result = str.offsetByCodePoints(length, -nCodePoints);
509 if (j > 0 && j < length) {
519 for (int j = length; j >= 0; j--) {
523 if (j > 0 && j < length) {
596 testLastIndexOf2(s + new String(surrogates), c, s.length());