Expand description
The user-facing handle: a compiled language with matching, minimal automaton and fingerprint.
Structs§
- Language
- A pattern compiled to a term and a lazily built automaton.
- Resolved
- A pattern resolved for backtracking analysis, with the store its zero-width terms live in.
Enums§
- Mode
- Full: the pattern must match the entire input. Search: any substring may match (FR-A11).
Functions§
- fingerprint_
term - Fingerprint of a term that lives in a caller-owned store. Equal results
mean equal languages over
alphabet(the canonical form is the authority; seeMinDfa::canonical_form). - lower_
into - Lower a pattern into an existing store, so several patterns can be analysed
together (equivalence, comparison).
storemust have been created withalphabet.universe(). - minimal_
of_ term - Minimal automaton of a term that lives in a caller-owned store.
- resolve
- Resolve
pfor analysis (does not build any automaton).