Lines Matching defs:depth
40 private int depth;
90 depth++;
93 if (indent.length <= depth) {
94 boolean[] hlp = new boolean[depth + 4];
95 System.arraycopy(indent, 0, hlp, 0, depth);
98 indent[depth] = indent[depth - 1];
100 for (int i = nspCounts[depth - 1]; i < nspCounts[depth]; i++) {
113 if (nspCounts.length <= depth + 1) {
114 int[] hlp = new int[depth + 8];
115 System.arraycopy(nspCounts, 0, hlp, 0, depth + 1);
119 nspCounts[depth + 1] = nspCounts[depth];
120 // nspCounts[depth + 2] = nspCounts[depth];
189 for (int i = 0; i < depth; i++)
200 while (depth > 0) {
201 endTag(elementStack[depth * 3 - 3], elementStack[depth * 3 - 1]);
219 ? indent[depth]
238 for (int i = nspCounts[depth + 1] * 2 - 2;
245 j < nspCounts[depth + 1] * 2;
267 for (int i = nspCounts[depth + 1] * 2 - 2;
298 indent[depth] = value;
325 int pos = (nspCounts[depth + 1]++) << 1;
353 depth = 0;
403 if (indent[depth]) {
405 for (int i = 0; i < depth; i++)
409 int esp = depth * 3;
423 for (int i = nspCounts[depth];
424 i < nspCounts[depth + 1];
457 // int cnt = nspCounts[depth];
462 // depth--;
471 // depth++;
473 /* if (cnt != nspCounts[depth]) {
515 depth--;
520 && elementStack[depth * 3] != null)
522 && !namespace.equals(elementStack[depth * 3]))
523 || !elementStack[depth * 3 + 2].equals(name))
528 depth--;
531 if (indent[depth + 1]) {
533 for (int i = 0; i < depth; i++)
538 String prefix = elementStack[depth * 3 + 1];
547 nspCounts[depth + 1] = nspCounts[depth];
560 return pending ? depth + 1 : depth;
565 indent[depth] = false;