Lines Matching refs:length

77         {'f',    0xDC00,  0xD800, 0xDC00,  0xDE02},  // codePointAt(length-1)
85 for (int i = 0; i < input.length; i++) {
93 testCodePoint(At, sb, sb.length()-1, golden1[2][i]);
99 testCodePoint(At, sb, sb.length());
114 {'f', 0xDC00, 0xD800, 0x10000, 0xE0202}, // codePointBefore(length)
122 for (int i = 0; i < input.length; i++) {
130 testCodePoint(Before, sb, sb.length(), golden2[2][i]);
136 testCodePoint(Before, sb, sb.length()+1);
175 for (int i = 0; i < input.length; i++) {
183 for (int i = 0; i < testdata1.length; i++) {
196 for (int i = 0; i < input.length; i++) {
200 for (int j = 0; j < s.length(); j += Character.charCount(c)) {
224 for (int i = 0; i < input.length; i++) {
227 int length = sb.length();
228 for (int j = 0; j <= length; j++) {
229 int result = sb.codePointCount(j, length);
230 int expected = Character.codePointCount(sb, j, length);
231 check(result != expected, "codePointCount(input["+i+"], "+j+", "+length+")",
234 for (int j = length; j >= 0; j--) {
243 testCodePointCount(sb, -1, length, IndexOutOfBoundsException.class);
244 testCodePointCount(sb, 0, length+1, IndexOutOfBoundsException.class);
245 testCodePointCount(sb, length, length-1, IndexOutOfBoundsException.class);
257 for (int i = 0; i < input.length; i++) {
260 int length = s.length();
261 for (int j = 0; j <= length; j++) {
262 int nCodePoints = Character.codePointCount(sb, j, length);
264 check(result != length,
266 result, length);
267 result = sb.offsetByCodePoints(length, -nCodePoints);
269 if (j > 0 && j < length) {
279 for (int j = length; j >= 0; j--) {
283 if (j > 0 && j < length) {
300 testOffsetByCodePoints(sb, -1, length, IndexOutOfBoundsException.class);
301 testOffsetByCodePoints(sb, 0, length+1, IndexOutOfBoundsException.class);
303 testOffsetByCodePoints(sb, length, length-1, IndexOutOfBoundsException.class);
304 testOffsetByCodePoints(sb, length, -(length+1), IndexOutOfBoundsException.class);
405 for (int i = 0; i < s.length(); i++) {