Searched refs:DFA (Results 1 - 9 of 9) sorted by relevance
| /third_party/rust/crates/aho-corasick/src/ |
| H A D | dfa.rs | 13 pub enum DFA<S> { enum
20 impl<S: StateID> DFA<S> { impls
23 DFA::Standard(ref dfa) => dfa.repr(), in repr()
24 DFA::ByteClass(ref dfa) => dfa.repr(), in repr()
25 DFA::Premultiplied(ref dfa) => dfa.repr(), in repr()
26 DFA::PremultipliedByteClass(ref dfa) => dfa.repr(), in repr()
64 DFA::Standard(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
71 DFA::ByteClass(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
78 DFA::Premultiplied(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
85 DFA in overlapping_find_at()
[all...] |
| H A D | ahocorasick.rs | 5 use crate::dfa::{self, DFA};
24 /// determined, simple case insensitivity, whether to use a DFA or not and
37 /// [DFA](struct.AhoCorasickBuilder.html#method.dfa)
1015 Imp::DFA(ref dfa) => dfa.heap_bytes(), in heap_bytes()
1021 /// a DFA. The NFA is slower but uses less memory. The DFA is faster but uses
1026 DFA(DFA<S>),
1034 Imp::DFA(ref dfa) => dfa.match_kind(), in match_kind()
1042 Imp::DFA(re in start_state()
[all...] |
| /third_party/skia/src/sksl/lex/ |
| H A D | TransitionTable.h | 13 struct DFA;
15 void WriteTransitionTable(std::ofstream& out, const DFA& dfa, size_t states);
|
| H A D | DFA.h | 17 struct DFA { struct
18 DFA(std::vector<int> charMappings, std::vector<std::vector<int>> transitions, in DFA() function
|
| H A D | Main.cpp | 34 static void writeH(const DFA& dfa, const char* lexer, const char* token, in writeH()
104 static void writeCPP(const DFA& dfa, const char* lexer, const char* token, const char* include, in writeCPP()
221 DFA dfa = converter.convert(); in process()
|
| H A D | NFAtoDFA.h | 10 #include "src/sksl/lex/DFA.h"
26 * nodes are our DFA nodes, since we can only be in one such unique set of NFA states at a time.
41 * Returns a DFA created from the NFA.
43 DFA convert() { in convert()
59 return DFA(fCharMappings, fTransitions, fAccepts); in convert()
|
| H A D | TransitionTable.cpp | 8 #include "src/sksl/lex/DFA.h"
109 void WriteTransitionTable(std::ofstream& out, const DFA& dfa, size_t states) { in WriteTransitionTable()
|
| /third_party/ffmpeg/tests/fate/ |
| H A D | dfa.mak | 34 FATE_DFA-$(call FRAMECRC, DFA, DFA, SCALE_FILTER) += $(FATE_DFA)
|
| /third_party/pcre2/pcre2/ |
| H A D | RunTest.bat | 339 call :runsub 6 testout "DFA matching main non-UTF, non-UCP functionality" -q
347 call :runsub 7 testout "DFA matching with UTF-%bits% and Unicode property support" -q
411 call :runsub 13 testout "DFA specials for the basic 16/32-bit library" -q
419 call :runsub 14 testout "DFA specials for UTF and UCP support" -q
480 call :runsub 21 testout "Backslash-C tests without UTF (DFA)" -q -dfa
|
Completed in 5 milliseconds