All Classes and Interfaces
Class
Description
Terminal accept state.
Aho-Corasick multi-pattern string matching algorithm.
Reduces the DFA branching factor by partitioning the character space into equivalence classes.
Anchor expression (start, end, word boundary, etc.).
Types of anchor expressions.
Match any byte.
Match any character.
A single arc in a finite-state transducer graph.
Atomic-commit instruction that enforces the no-backtrack commitment for atomic groups and
possessive quantifiers.
AST node representing an atomic group
(?>body).Backreference expression.
Backreference check instruction.
Test whether a named balance stack is non-empty, continuing on success or failing otherwise.
AST node representing a .NET balancing group operation.
Pop the top entry from a named balance stack, failing if the stack is empty.
Push the current input position onto a named balance stack.
\G anchor assertion — position equals the end of the previous match.Beginning of line assertion for
^ in MULTILINE mode.Beginning of text assertion.
Bounded-backtracking NFA interpreter for patterns that require backtracking semantics.
Byte match instruction for byte-oriented matching.
Byte range match instruction for byte-oriented matching.
Character class expression.
Matches a character in the range [lo, hi].
Character range within a char class.
Thread-safe compilation result.
Concatenation of expressions.
Conditional branch instruction for .NET
(?(condition)yes|no) subpatterns.The kind of condition tested by a
ConditionalBranchInstr.AST node representing a .NET conditional subpattern
(?(condition)yes|no).Sealed base type for conditional subpattern conditions.
Condition that tests whether a numbered capturing group participated in the current match.
Condition that tests whether a named capturing group participated or whether a balance
stack is non-empty.
Condition that tests a lookahead assertion at the current position.
One state in the lazily-constructed DFA.
End of line assertion for
$.End of text assertion.
\Z anchor assertion — end of input or before the final line terminator only.Engine interface for executing compiled programs.
Describes which execution engine is safe for a compiled pattern.
Epsilon (empty) expression.
Epsilon transition (no character consumed).
Token representing an error.
Sealed AST hierarchy representing regular expressions.
Fail state - always fails.
AST node that scopes a set of pattern flags over a body sub-expression.
Group expression with optional name and index.
Mutable analysis tree node produced by
AnalysisVisitor.Sealed instruction hierarchy for compiled programs.
AST node representing the
\K keep assertion.Lazy on-the-fly DFA engine for patterns classified as
EngineHint.DFA_SAFE or EngineHint.ONE_PASS_SAFE.Literal string expression.
Prefilter using simple String.indexOf for literal search.
Set of literals extracted from an expression.
Positive lookahead assertion.
AST node representing a lookahead assertion (
(?=body) or (?!body)).Negative lookahead assertion.
AST node representing a lookbehind assertion (
(?<=body) or (?<!body)).Negative lookbehind assertion supporting bounded variable-length patterns.
Positive lookbehind assertion supporting bounded variable-length patterns.
Matches a compiled
Pattern against an input sequence.Result of a match operation.
Thrown by
BoundedBacktrackEngine when the number of
operations performed during a single match invocation exceeds the configured backtrack
budget.Token representing a matched text.
Metadata about a compiled program.
Meta-engine that orchestrates prefilter application and engine selection.
Node types for HIR analysis.
No-op prefilter that always returns -1.
One-pass DFA engine for patterns classified as
EngineHint.ONE_PASS_SAFE.Token representing transformed output.
Transducer pair: input -> output with optional weight.
LL(1) recursive-descent parser for regular expressions.
Compiled representation of a regular expression.
Compilation flags for
Pattern.Exception thrown when a pattern cannot be parsed or compiled.
PikeVM NFA interpreter for regular expression matching.
Possessive (atomic) split instruction that commits to its first branch without
offering the second branch as a backtracking choice point.
Fully precomputed flat-array DFA for patterns classified as
ONE_PASS_SAFE.Sealed prefilter hierarchy for fast path filtering.
Compiled program - immutable instruction array.
Post-compile optimisation passes on a
Prog instruction array.Result of an epsilon-chain fold: a new instruction array and the resolved start and
accept PCs.
Represents a quantified sub-expression with optional laziness or possessive semantics.
Validates that a parsed expression tree is compatible with the RE2 engine subset.
Mandatory-repetition loop.
Body-terminator for a
RepeatMin mandatory-repetition loop.Epsilon instruction that resets the reported match start to the current input position.
Save capture group boundary (start or end).
Source code location information.
Non-deterministic split to two alternatives.
Sealed token hierarchy for structured output.
Immutable compiled transducer that maps input strings to output strings.
Thrown when an operation requires an invertible transducer but the transducer is not
invertible.
Thrown when two transducers are incompatible for composition, or when an operation that
requires a structural (non-composed) transducer is called on a runtime-chain transducer.
Thrown when an input string does not match the transducer's input pattern.
Transducer flags.
Intermediate graph representation of a finite-state transducer.
Emit output string in a transducer.
Resolves Unicode property names to lists of BMP character ranges.
Alternation of expressions.
Non-deterministic split to two alternatives, emitted specifically for regex
| union
alternation.Prefilter that scans the input for any of a set of literal strings using SIMD acceleration
via the JDK Vector API (
jdk.incubator.vector).Word boundary assertion instruction, representing either
\b or \B.