Lines Matching refs:length

77         int n = input.length();
103 StringBuilder sb = new StringBuilder(input.length());
132 byte[] ba = new byte[(int)(ca.length * (double)ce.maxBytesPerChar())];
151 // trim result to actual length if required
153 if (len != ba.length)
216 while (index < path.length) {
220 while (index < path.length && path[index] != '/')
230 while (index < path.length) {
236 while (index < path.length && path[index] != '/')
249 return path.length == 0;
264 if (path.length > 0 && path[0] == '/') {
275 int count = offsets.length;
282 if (count == 1 && path.length > 0 && path[0] != '/')
286 int len = path.length - lastOffset;
296 int count = offsets.length;
314 return offsets.length;
322 if (index >= offsets.length)
327 if (index == (offsets.length-1)) {
328 len = path.length - begin;
345 if (beginIndex >= offsets.length)
347 if (endIndex > offsets.length)
353 // starting offset and length
356 if (endIndex == offsets.length) {
357 len = path.length - begin;
370 return (path.length > 0 && path[0] == '/');
375 int baseLength = base.length;
376 int childLength = child.length;
389 result[base.length] = '/';
398 if (other.length > 0 && other[0] == '/')
447 int len = dotdots*3 + remainder.path.length;
464 System.arraycopy(remainder.path, 0, result, pos, remainder.path.length);
489 int[] size = new int[count]; // length of name
495 // 1. compute length of names
501 if (i == (offsets.length-1)) {
502 len = path.length - begin;
580 // compute length of result
614 if (that.path.length > path.length)
631 (path.length != that.path.length)) {
645 while (i < that.path.length) {
652 if (i < path.length && this.path[i] != '/')
664 int thisLen = path.length;
665 int thatLen = that.path.length;
717 int len1 = path.length;
718 int len2 = ((UnixPath) other).path.length;
749 for (int i = 0; i< path.length; i++) {
848 if ((element.asByteArray().length == 1) && (element.asByteArray()[0] == '.'))
852 if ((element.asByteArray().length == 2) && (element.asByteArray()[0] == '.') &&