private int single() { int ch = peek(); switch (ch) { case '\\': return escape(true, false); default: next(); return ch; } }
return; ch = next();
return; ch = next();
private int single() { int ch = peek(); switch (ch) { case '\\': return escape(true, false); default: next(); return ch; } }
boolean oneLetter = true; boolean comp = (ch == 'P'); ch = next(); // Consume { if present if (ch != '{') { unread(); next(); if (has(MULTILINE)) { if (has(UNIX_LINES)) next(); if (has(UNIX_LINES)) node = new UnixDollar(has(MULTILINE)); break; case '.': next(); if (has(DOTALL)) { node = new All(); case '*': case '+': next(); throw error("Dangling meta character '" + ((char)ch) + "'"); case 0:
boolean oneLetter = true; boolean comp = (ch == 'P'); ch = next(); // Consume { if present if (ch != '{') { unread(); next(); if (has(MULTILINE)) { if (has(UNIX_LINES)) next(); if (has(UNIX_LINES)) node = new UnixDollar(has(MULTILINE)); break; case '.': next(); if (has(DOTALL)) { node = new All(); case '*': case '+': next(); throw error("Dangling meta character '" + ((char)ch) + "'"); case 0:
switch (ch) { case '?': ch = next(); if (ch == '?') { next(); return new Ques(prev, LAZY); } else if (ch == '+') { next(); return new Ques(prev, POSSESSIVE); ch = next(); if (ch == '?') { next(); return new Curly(prev, 0, MAX_REPS, LAZY); } else if (ch == '+') { next(); return new Curly(prev, 0, MAX_REPS, POSSESSIVE); ch = next(); if (ch == '?') { next(); return new Curly(prev, 1, MAX_REPS, LAZY); } else if (ch == '+') { next(); return new Curly(prev, 1, MAX_REPS, POSSESSIVE); ch = peek(); if (ch == '?') { next();
switch (ch) { case '?': ch = next(); if (ch == '?') { next(); return new Ques(prev, LAZY); } else if (ch == '+') { next(); return new Ques(prev, POSSESSIVE); ch = next(); if (ch == '?') { next(); return new Curly(prev, 0, MAX_REPS, LAZY); } else if (ch == '+') { next(); return new Curly(prev, 0, MAX_REPS, POSSESSIVE); ch = next(); if (ch == '?') { next(); return new Curly(prev, 1, MAX_REPS, LAZY); } else if (ch == '+') { next(); return new Curly(prev, 1, MAX_REPS, POSSESSIVE); ch = peek(); if (ch == '?') { next();
boolean maybeComplement) next(); String name; CharProperty node = null;
boolean maybeComplement) next(); String name; CharProperty node = null;
boolean include = true; boolean firstInClass = true; int ch = next(); for (;;) { switch (ch) { if (temp[cursor-1] != '[') break; ch = next(); include = !include; continue; case '&': firstInClass = false; ch = next(); if (ch == '&') { ch = next(); CharProperty rightNode = null; while (ch != ']' && ch != '&') { if (prev != null) { if (consume) next(); return prev;
return prev; next();
boolean include = true; boolean firstInClass = true; int ch = next(); for (;;) { switch (ch) { if (temp[cursor-1] != '[') break; ch = next(); include = !include; continue; case '&': firstInClass = false; ch = next(); if (ch == '&') { ch = next(); CharProperty rightNode = null; while (ch != ']' && ch != '&') { if (prev != null) { if (consume) next(); return prev;
return prev; next();