public final class AllTransitionsInOneTreeMatcher extends Object
| Constructor and Description |
|---|
AllTransitionsInOneTreeMatcher(char[] sortedRanges,
short[] rangeTreeSuccessors)
Constructs a new
AllTransitionsInOneTreeMatcher. |
| Modifier and Type | Method and Description |
|---|---|
int |
checkMatchTree(TRegexDFAExecutorLocals locals,
TRegexDFAExecutorNode executor,
DFAStateNode stateNode,
char c) |
String |
toString() |
public AllTransitionsInOneTreeMatcher(char[] sortedRanges,
short[] rangeTreeSuccessors)
AllTransitionsInOneTreeMatcher.sortedRanges - a sorted list of adjacent character ranges, in the following format:
Every character in the array simultaneously represents the inclusive lower bound
of a range and the exclusive upper bound of a range. The algorithm adds an
implicit zero at the begin and an implicit Character.MAX_VALUE + 1 at the
end of the array. An array representing the ranges
[0x00-0x10][0x10-0xff][0xff-0x2000][0x2000-0x10000] (represented with
exclusive upper bound) would be: [0x10, 0xff, 0x2000].rangeTreeSuccessors - the list of successors corresponding to every range in the sorted
list of ranges. every entry in this array is an index of
DFAAbstractStateNode.getSuccessors().public int checkMatchTree(TRegexDFAExecutorLocals locals, TRegexDFAExecutorNode executor, DFAStateNode stateNode, char c)