Crate regex_automata
source ·Expand description
This crate provides an “expert” API for executing regular expressions using finite automata.
WARNING: This 0.2
release of regex-automata
was published
before it was ready to unblock work elsewhere that needed some
of the new APIs in this release. At the time of writing, it is
strongly preferred that you continue using the
regex-automata 0.1
release. Since this release represents an unfinished state, please do not
create issues for this release unless it’s for a critical bug.
Modules
- dfa
dfa-search
ordfa-onepass
A module for building and searching with determinstic finite automata (DFAs). - hybrid
hybrid
A module for building and searching with lazy determinstic finite automata (DFAs). - meta
meta
Provides a regex matcher that composes several other regex matchers automatically. - nfa
nfa-thompson
Provides non-deterministic finite automata (NFA) and regex engines that use them. - A collection of modules that provide APIs that are useful across many regex engines.
Structs
- A representation of “half” of a match reported by a DFA.
- The parameters for a regex search including the haystack to search.
- A representation of a match reported by a regex engine.
- An error indicating that a search stopped before reporting whether a match exists or not.
- The identifier of a regex pattern, represented by a
SmallIndex
. - PatternSet
alloc
A set ofPatternID
s. - An error that occurs when a
PatternID
failed to insert into aPatternSet
. - PatternSetIter
alloc
An iterator over all pattern identifiers in aPatternSet
. - A representation of a span reported by a regex engine.
Enums
- The type of anchored search to perform.
- The underlying kind of a
MatchError
. - The kind of match semantics to use for a regex pattern.