| java.lang.Object
 java.util.regex.AbstractSet
java.util.regex.LeafSet
All known Subclasses: java.util.regex.RangeSet, java.util.regex.CICharSet, java.util.regex.SequenceSet, java.util.regex.UCISequenceSet, java.util.regex.UCICharSet, java.util.regex.EmptySet, java.util.regex.UCIRangeSet, java.util.regex.CISequenceSet, java.util.regex.CharSet, java.util.regex.UCISupplCharSet, java.util.regex.SupplCharSet,
| LeafSet | | abstract class LeafSet extends AbstractSet (Code) | | Base class for nodes representing leaf tokens of the RE, those who consumes
fixed number of characters.
author:
Nikolay A. Kuznetsov
version:
$Revision: 1.10.2.2 $ |
| Method Summary | |
| abstract public int | accepts(int stringIndex, CharSequence testString)
Returns "shift", the number of accepted chars commonly internal function,
but called by quantifiers. | | public int | charCount()
Returns number of characters this node consumes. | | public boolean | hasConsumed(MatchResultImpl mr)
| | public int | matches(int stringIndex, CharSequence testString, MatchResultImpl matchResult)
Checks if we can enter this state and pass the control to the next one. |
| charCount | | protected int charCount(Code) | | |
| accepts | | abstract public int accepts(int stringIndex, CharSequence testString)(Code) | | Returns "shift", the number of accepted chars commonly internal function,
but called by quantifiers.
|
| charCount | | public int charCount()(Code) | | Returns number of characters this node consumes.
number of characters this node consumes. |
| matches | | public int matches(int stringIndex, CharSequence testString, MatchResultImpl matchResult)(Code) | | Checks if we can enter this state and pass the control to the next one.
Return positive value if match succeeds, negative otherwise.
|
|
|