| AllTransitionsInOneTreeMatcher |
This class provides an alternative way of calculating the next transition - instead of checking
all transitions in sequential manner, all ranges of all transitions are merged into one sorted
array, which is then searched in tree-recursive fashion.
|
| AllTransitionsInOneTreeMatcher.AllTransitionsInOneTreeLeafMatcher |
Data structure for optimized matching of multiple ranges in one lower byte range.
|
| BackwardDFAStateNode |
|
| CGTrackingDFAStateNode |
|
| DFAAbstractStateNode |
|
| DFACaptureGroupLazyTransition |
|
| DFACaptureGroupPartialTransition |
|
| DFACaptureGroupPartialTransition.IndexOperation |
|
| DFACaptureGroupPartialTransitionDispatchNode |
|
| DFACaptureGroupTrackingData |
|
| DFAFindInnerLiteralStateNode |
|
| DFAInitialStateNode |
This state node is responsible for selecting a DFA's initial state based on the index the search
starts from.
|
| DFASimpleCG |
|
| DFASimpleCGTransition |
|
| DFAStateNode |
|
| DFAStateNode.LoopOptimizationNode |
This node is used when all except a very small set of code points will loop back to the
current DFA state.
|
| DFAStateNode.LoopOptIndexOfAnyByteNode |
Optimized search for a set of up to 4 byte values.
|
| DFAStateNode.LoopOptIndexOfAnyCharNode |
Optimized search for a set of up to 4 char values.
|
| DFAStateNode.LoopOptIndexOfAnyNode |
|
| DFAStateNode.LoopOptIndexOfStringNode |
Optimized search for a substring.
|
| Matchers |
Container for character matchers of DFA transitions, potentially specialized for a given string
encoding.
|
| Matchers.Builder |
|
| Matchers.SimpleMatchers |
|
| Matchers.UTF16Matchers |
|
| Matchers.UTF16RawMatchers |
|
| Matchers.UTF8Matchers |
|
| TraceFinderDFAStateNode |
|
| TRegexDFAExecutorDebugRecorder |
|
| TRegexDFAExecutorLocals |
|
| TRegexDFAExecutorNode |
|
| TRegexDFAExecutorProperties |
|
| TRegexLazyCaptureGroupsRootNode |
|
| TRegexLazyFindStartRootNode |
|
| TRegexTraceFinderRootNode |
|