| 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 |
|
| DFACaptureGroupLazyTransition.BranchesDirect |
|
| DFACaptureGroupLazyTransition.BranchesIndirect |
|
| DFACaptureGroupLazyTransition.BranchesWithLookupTable |
|
| DFACaptureGroupLazyTransition.Single |
|
| DFACaptureGroupPartialTransition |
|
| DFACaptureGroupPartialTransition.IndexOperation |
|
| DFACaptureGroupPartialTransition.LastGroupUpdate |
|
| 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 |
|
| Matchers |
Container for character matchers of DFA transitions.
|
| SequentialMatchers |
Container for character matchers of DFA transitions, potentially specialized for a given string
encoding.
|
| SequentialMatchers.Builder |
|
| SequentialMatchers.SimpleSequentialMatchers |
|
| SequentialMatchers.UTF16Or32SequentialMatchers |
|
| SequentialMatchers.UTF16RawSequentialMatchers |
|
| SequentialMatchers.UTF8SequentialMatchers |
|
| TraceFinderDFAStateNode |
|
| TRegexDFAExecutorDebugRecorder |
|
| TRegexDFAExecutorLocals |
|
| TRegexDFAExecutorNode |
|
| TRegexDFAExecutorProperties |
|
| TRegexLazyCaptureGroupsRootNode |
|
| TRegexLazyFindStartRootNode |
|
| TRegexTraceFinderRootNode |
|