java.util.regex
Class Pattern.LazyLoop
java.lang.Object
java.util.regex.Pattern.Node
java.util.regex.Pattern.Loop
java.util.regex.Pattern.LazyLoop
- Enclosing class:
- Pattern
- static final class Pattern.LazyLoop
- extends Pattern.Loop
Handles the repetition count for a reluctant Curly. The matchInit
is called from the Prolog to save the index of where the group
beginning is stored. A zero length group check occurs in the
normal match but is skipped in the matchInit.
Constructor Summary |
(package private) |
Pattern.LazyLoop(int countIndex,
int beginIndex)
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
body
Pattern.Node body
countIndex
int countIndex
beginIndex
int beginIndex
cmin
int cmin
cmax
int cmax
next
Pattern.Node next
Pattern.LazyLoop
Pattern.LazyLoop(int countIndex,
int beginIndex)
match
boolean match(Matcher matcher,
int i,
CharSequence seq)
- Description copied from class:
Pattern.Node
- This method implements the classic accept node.
- Overrides:
match
in class Pattern.Loop
matchInit
boolean matchInit(Matcher matcher,
int i,
CharSequence seq)
- Overrides:
matchInit
in class Pattern.Loop
study
boolean study(Pattern.TreeInfo info)
- Description copied from class:
Pattern.Node
- This method is good for all zero length assertions.
- Overrides:
study
in class Pattern.Loop
dup
Pattern.Node dup(boolean not)