Lines Matching refs:idx
48 int idx; // Current input index into ac
289 if (idx >= len || pattern.charAt(idx++) != '{')
295 if (idx >= len || !Character.isDigit(pattern.charAt(idx)))
302 while (idx < len && Character.isDigit(pattern.charAt(idx)))
304 number.append(pattern.charAt(idx++));
316 if (idx >= len)
322 if (pattern.charAt(idx) == '}')
324 idx++;
330 if (idx >= len || pattern.charAt(idx++) != ',')
336 if (idx >= len)
342 if (pattern.charAt(idx) == '}')
344 idx++;
350 if (idx >= len || !Character.isDigit(pattern.charAt(idx)))
357 while (idx < len && Character.isDigit(pattern.charAt(idx)))
359 number.append(pattern.charAt(idx++));
377 if (idx >= len || pattern.charAt(idx++) != '}')
388 * ESC_COMPLEX or ESC_BACKREF by looking at pattern[idx - 1].
395 if (pattern.charAt(idx) != '\\')
401 if (idx + 1 == len)
407 idx += 2;
408 char escapeChar = pattern.charAt(idx - 1);
431 for ( ; idx < len && hexDigits-- > 0; idx++)
434 char c = pattern.charAt(idx);
486 if ((idx < len && Character.isDigit(pattern.charAt(idx))) || escapeChar == '0')
490 if (idx < len && Character.isDigit(pattern.charAt(idx)))
492 val = ((val << 3) + (pattern.charAt(idx++) - '0'));
493 if (idx < len && Character.isDigit(pattern.charAt(idx)))
495 val = ((val << 3) + (pattern.charAt(idx++) - '0'));
519 if (pattern.charAt(idx) != '[')
525 if ((idx + 1) >= len || pattern.charAt(++idx) == ']')
531 if (idx < len && pattern.charAt(idx) == ':')
534 idx++;
537 int idxStart = idx;
538 while (idx < len && pattern.charAt(idx) >= 'a' && pattern.charAt(idx) <= 'z')
540 idx++;
544 if ((idx + 1) < len && pattern.charAt(idx) == ':' && pattern.charAt(idx + 1) == ']')
547 String charClass = pattern.substring(idxStart, idx);
554 idx += 2;
573 int idxFirst = idx;
577 while (idx < len && pattern.charAt(idx) != ']')
583 switch (pattern.charAt(idx))
587 if (idx == idxFirst)
591 idx++;
615 switch (pattern.charAt(idx - 1))
669 if ((idx + 1) < len && pattern.charAt(++idx) == ']')
677 simpleChar = pattern.charAt(idx++);
701 if (idx >= len || pattern.charAt(idx) != '-')
710 if (idx == len)
716 idx++;
748 while (idx < len)
751 if ((idx + 1) < len)
753 char c = pattern.charAt(idx + 1);
756 if (pattern.charAt(idx) == '\\')
758 int idxEscape = idx;
760 if (idx < len)
762 c = pattern.charAt(idx);
764 idx = idxEscape;
785 switch (pattern.charAt(idx))
814 int idxBeforeEscape = idx;
821 idx = idxBeforeEscape;
834 emit(pattern.charAt(idx++));
859 switch (pattern.charAt(idx))
864 return node(pattern.charAt(idx++), 0);
893 int idxBeforeEscape = idx;
901 return node(RE.OP_ESCAPE, pattern.charAt(idx - 1));
905 char backreference = (char)(pattern.charAt(idx - 1) - '0');
918 idx = idxBeforeEscape;
940 int idxBeforeTerminal = idx;
952 if (idx >= len)
957 char closureType = pattern.charAt(idx);
969 idx++;
987 if (idx < len && pattern.charAt(idx) == '?')
989 idx++;
1006 if (bracketStart[i] == idx)
1020 bracketStart[brackets] = idx;
1022 bracketEnd[brackets] = idx;
1032 if (j != i && bracketStart[j] < idx
1043 idx = idxBeforeTerminal;
1046 idx = bracketEnd[i];
1058 idx = bracketEnd[i];
1066 idx = idxBeforeTerminal;
1069 idx = bracketEnd[i];
1081 idx = bracketEnd[i];
1172 while (idx < len && pattern.charAt(idx) != '|' && pattern.charAt(idx) != ')')
1219 if ((flags[0] & NODE_TOPLEVEL) == 0 && pattern.charAt(idx) == '(')
1222 if ( idx + 2 < len && pattern.charAt( idx + 1 ) == '?' && pattern.charAt( idx + 2 ) == ':' )
1225 idx += 3;
1231 idx++;
1249 while (idx < len && pattern.charAt(idx) == '|')
1251 idx++;
1260 if (idx < len && pattern.charAt(idx) == ')')
1262 idx++;
1319 idx = 0; // Set parsing index to the first character
1331 if (idx != len)
1333 if (pattern.charAt(idx) == ')')