Lines Matching refs:next
443 * <li> A next-line character (<tt>'\u0085'</tt>),
1464 String next = base + perms[x];
1466 result.append("|"+next);
1467 next = composeOneStep(next);
1468 if (next != null)
1469 result.append("|"+produceEquivalentAlternation(next));
1662 matchRoot.next = lastAccept;
1725 System.out.println("Tail next is "+node.next);
1730 node = node.next;
1732 System.out.println("->next:");
1775 * Match next character, signal error if failed.
1794 * Peek the next character, and do not advance the cursor.
1804 * Read the next character, and advance the cursor by one.
1814 * Read the next character, and advance the cursor by one,
1823 * Advance the cursor by one, and peek the next character.
1825 private int next() {
1833 * Advance the cursor by one, and peek the next character,
1903 * Read the character after the next one, and advance the cursor by two.
1913 * Unread one next character, and retreat cursor by one.
1973 branchConn.next = end;
1978 // the branch to indicate to go "next" directly.
1981 // the "tail.next" of each atom goes to branchConn
1982 nodeTail.next = branchConn;
1990 // replace the "end" with "branchConn" at its tail.next
1992 firstTail.next = branchConn;
2000 next();
2025 tail.next = node;
2037 ch = next(); // Consume { if present
2050 next();
2061 next();
2068 next();
2089 next();
2106 tail.next = node;
2113 tail.next = end;
2154 ch = next(); // Consume { if present
2191 ch = next();
2432 int ch = next();
2440 ch = next();
2458 ch = next();
2460 ch = next();
2499 next();
2569 ch = next();
2591 next();
2612 next();
2623 next();
2763 int ch = next();
2770 head.next = expr(tail);
2776 head.next = expr(tail);
2786 head.next = expr(tail);
2801 head.next = expr(tail);
2807 head.next = expr(tail);
2808 tail.next = lookbehindEnd;
2847 head.next = expr(tail);
2854 head.next = expr(tail);
2877 tail.next = new BranchConn();
2878 tail = tail.next;
2896 head = root = new GroupCurly(head.next, curly.cmin,
2914 tail.next = loop;
2971 ch = next();
2976 ch = next();
3014 ch = next();
3029 * Processes repetition. If the next character peeked is a quantifier
3038 ch = next();
3040 next();
3043 next();
3048 ch = next();
3050 next();
3053 next();
3058 ch = next();
3060 next();
3063 next();
3094 next();
3097 next();
3346 Node next;
3348 next = Pattern.accept;
3363 if (next != null) {
3364 return next.study(info);
3396 this.next = node;
3398 next.study(info);
3408 if (next.match(matcher, i, seq)) {
3419 next.study(info);
3440 //if ((ret = next.match(matcher, i, seq)) || i == guard)
3441 if (next.match(matcher, i, seq)) {
3449 // Optimization to move to the next character. This is
3472 if (i == fromIndex && next.match(matcher, i, seq)) {
3493 return next.match(matcher, i, seq);
3527 return next.match(matcher, i, seq);
3553 return next.match(matcher, i, seq);
3565 return next.match(matcher, i, seq);
3617 return next.match(matcher, i, seq);
3621 return next.match(matcher, i, seq);
3631 return next.match(matcher, i, seq);
3634 next.study(info);
3658 // If multiline return next.match without setting
3661 return next.match(matcher, i, seq);
3672 return next.match(matcher, i, seq);
3675 next.study(info);
3695 && next.match(matcher, i+Character.charCount(ch), seq);
3704 return next.study(info);
3716 && next.match(matcher, i+1, seq);
3847 return next.study(info);
3870 return next.match(matcher, i+len, seq);
3895 return next.match(matcher, i+len, seq);
3920 return next.match(matcher, i+len, seq);
3949 return next.match(matcher, x, seq);
3981 return next.match(matcher, x, seq);
4079 return (atom.match(matcher, i, seq) && next.match(matcher, matcher.last, seq))
4080 || next.match(matcher, i, seq);
4082 return next.match(matcher, i, seq)
4083 || (atom.match(matcher, i, seq) && next.match(matcher, matcher.last, seq));
4086 return next.match(matcher, i, seq);
4088 return atom.match(matcher, i, seq) && next.match(matcher, matcher.last, seq);
4097 return next.study(info);
4100 return next.study(info);
4145 return next.match(matcher, i, seq);
4170 if (next.match(matcher, i, seq))
4177 return next.match(matcher, i, seq);
4185 if (next.match(matcher, i, seq))
4209 return next.match(matcher, i, seq);
4242 return next.study(info);
4360 if (next.match(matcher, i, seq)) {
4382 return next.match(matcher, i, seq);
4387 if (next.match(matcher, i, seq))
4418 return next.match(matcher, i, seq);
4452 return next.study(info);
4459 * "next" but not the "study", so we can collect the TreeInfo
4461 * "next".
4466 return next.match(matcher, i, seq);
4500 if (conn.next.match(matcher, i, seq))
4529 conn.next.study(info);
4556 boolean ret = next.match(matcher, i, seq);
4563 boolean ret = next.match(matcher, i, seq);
4581 && next.match(matcher, matcher.last, seq);
4586 return next.study(info);
4615 if (next.match(matcher, i, seq)) {
4692 return next.match(matcher, i, seq);
4704 ret = next.match(matcher, i, seq);
4706 ret = next.match(matcher, i, seq);
4741 if (next.match(matcher, i, seq))
4754 return next.match(matcher, i, seq);
4762 } else if (next.match(matcher, i, seq)) {
4810 return next.match(matcher, i+groupSize, seq);
4814 return next.study(info);
4865 return next.match(matcher, i+groupSize, seq);
4869 return next.study(info);
4874 * Searches until the next instance of its atom. This is useful for
4887 && next.match(matcher, matcher.last, seq);
4895 return next.match(matcher, matcher.last, seq);
4905 return next.study(info);
4940 return next.study(info);
4965 return conditionMatched && next.match(matcher, i, seq);
4997 return conditionMatched && next.match(matcher, i, seq);
5040 return conditionMatched && next.match(matcher, i, seq);
5074 return conditionMatched && next.match(matcher, i, seq);
5107 return !conditionMatched && next.match(matcher, i, seq);
5140 return !conditionMatched && next.match(matcher, i, seq);
5229 && next.match(matcher, i, seq);
5271 * line the pattern up with the next occurrence of that character.
5277 * next occurrence of the subset in the pattern.
5341 return new BnMS(src, lastOcc, optoSft, node.next);
5342 return new BnM(src, lastOcc, optoSft, node.next);
5344 BnM(int[] src, int[] lastOcc, int[] optoSft, Node next) {
5348 this.next = next;
5369 boolean ret = next.match(matcher, i + patternLength, seq);
5387 return next.study(info);
5398 BnMS(int[] src, int[] lastOcc, int[] optoSft, Node next) {
5399 super(src, lastOcc, optoSft, next);
5426 boolean ret = next.match(matcher, i + lengthInChars, seq);