Lines Matching refs:DFA

31 we fall back to an Aho-Corasick DFA using the aho-corasick crate. For one
48 Lastly, the real workhorse of this library is the "lazy" DFA in src/dfa.rs.
49 It is distinct from the Pike VM in that the DFA is explicitly represented in
51 the DFA is computed as text is searched, where each byte in the search text
52 results in at most one new DFA state. It is made fast by caching states. DFAs
55 avoid using a lot of memory, the lazy DFA uses a bounded cache. Once the cache
57 wiped too frequently, then the DFA gives up and searching falls back to one of
128 either Unicode or byte based programs except for the lazy DFA, which requires
130 lazy DFA requires byte based programs so that states can be encoded in a memory
140 need to compile two programs; one for NFA execution and one for the lazy DFA.
142 In fact, it is worse than that: the lazy DFA is not capable of finding the
159 4. Lazy DFA (no support for Unicode word boundary assertions).
174 part of src/exec.rs by far is the execution of the lazy DFA, since it requires
180 DFA, it contains compiled states that are reused on subsequent searches).
204 engines (DFA, bounded backtracker) and sophisticated literal optimizations.
258 The lazy DFA and pure literal engines are absent from this list because
260 `tests/test_dynamic.rs` to test the lazy DFA and literal engines when possible.