A fully-compiled regular expression that was generated from a string literal.
A regular expression, ready to be tested against strings, or to take part in an operation against another.
A regular expression, ready to be tested against strings, or to take part in an operation against another. Internally, instances of this type have a DFA (Deterministic Finite Automaton).
A regular expression that was generated by an operation between others (not parsing a string), so it lacks a literal expression or NFA.
Represent the set of characters that is the union of the sets of characters of a group of regular expressions.
Represent the set of characters that is the union of the sets of characters of a group of regular expressions. Regex must belong to the same Universe to be able to make operations between them.
Main package for Dregex implementation. User-facing classes reside directly in the top-level package. The rest of the sub-packages contain implementation classes.