Home
last modified time | relevance | path

Searched refs:DFA (Results 1 – 25 of 93) sorted by relevance

1234

/third_party/icu/icu4c/source/data/unidata/
DNormalizationTest.txt13652 F93A;9DFA;9DFA;9DFA;9DFA;
17149 0061 059A 0316 1DFA 0316 0062;0061 1DFA 0316 0316 059A 0062;0061 1DFA 0316 0316 059A 0062;0061 1DFA…
17150 0061 0316 059A 0316 1DFA 0062;0061 1DFA 0316 0316 059A 0062;0061 1DFA 0316 0316 059A 0062;0061 1DFA…
17151 0061 059A 0316 1DFA 0317 0062;0061 1DFA 0316 0317 059A 0062;0061 1DFA 0316 0317 059A 0062;0061 1DFA…
17152 0061 0317 059A 0316 1DFA 0062;0061 1DFA 0317 0316 059A 0062;0061 1DFA 0317 0316 059A 0062;0061 1DFA…
17153 0061 059A 0316 1DFA 0318 0062;0061 1DFA 0316 0318 059A 0062;0061 1DFA 0316 0318 059A 0062;0061 1DFA…
17154 0061 0318 059A 0316 1DFA 0062;0061 1DFA 0318 0316 059A 0062;0061 1DFA 0318 0316 059A 0062;0061 1DFA…
17155 0061 059A 0316 1DFA 0319 0062;0061 1DFA 0316 0319 059A 0062;0061 1DFA 0316 0319 059A 0062;0061 1DFA…
17156 0061 0319 059A 0316 1DFA 0062;0061 1DFA 0319 0316 059A 0062;0061 1DFA 0319 0316 059A 0062;0061 1DFA…
17159 0061 1DFA 031B 1DCE 031B 0062;0061 1DCE 031B 031B 1DFA 0062;0061 1DCE 031B 031B 1DFA 0062;0061 1DCE…
[all …]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/data/unicode/
DNormalizationTest.txt13652 F93A;9DFA;9DFA;9DFA;9DFA;
17149 0061 059A 0316 1DFA 0316 0062;0061 1DFA 0316 0316 059A 0062;0061 1DFA 0316 0316 059A 0062;0061 1DFA…
17150 0061 0316 059A 0316 1DFA 0062;0061 1DFA 0316 0316 059A 0062;0061 1DFA 0316 0316 059A 0062;0061 1DFA…
17151 0061 059A 0316 1DFA 0317 0062;0061 1DFA 0316 0317 059A 0062;0061 1DFA 0316 0317 059A 0062;0061 1DFA…
17152 0061 0317 059A 0316 1DFA 0062;0061 1DFA 0317 0316 059A 0062;0061 1DFA 0317 0316 059A 0062;0061 1DFA…
17153 0061 059A 0316 1DFA 0318 0062;0061 1DFA 0316 0318 059A 0062;0061 1DFA 0316 0318 059A 0062;0061 1DFA…
17154 0061 0318 059A 0316 1DFA 0062;0061 1DFA 0318 0316 059A 0062;0061 1DFA 0318 0316 059A 0062;0061 1DFA…
17155 0061 059A 0316 1DFA 0319 0062;0061 1DFA 0316 0319 059A 0062;0061 1DFA 0316 0319 059A 0062;0061 1DFA…
17156 0061 0319 059A 0316 1DFA 0062;0061 1DFA 0319 0316 059A 0062;0061 1DFA 0319 0316 059A 0062;0061 1DFA…
17159 0061 1DFA 031B 1DCE 031B 0062;0061 1DCE 031B 031B 1DFA 0062;0061 1DCE 031B 031B 1DFA 0062;0061 1DCE…
[all …]
/third_party/rust/crates/aho-corasick/src/
Ddfa.rs13 pub enum DFA<S> { enum
20 impl<S: StateID> DFA<S> { impl
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::PremultipliedByteClass(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
[all …]
Dahocorasick.rs5 use crate::dfa::{self, DFA};
1015 Imp::DFA(ref dfa) => dfa.heap_bytes(), in heap_bytes()
1026 DFA(DFA<S>), enumerator
1034 Imp::DFA(ref dfa) => dfa.match_kind(), in match_kind()
1042 Imp::DFA(ref dfa) => dfa.start_state(), in start_state()
1052 Imp::DFA(ref dfa) => dfa.max_pattern_len(), in max_pattern_len()
1062 Imp::DFA(ref dfa) => dfa.pattern_count(), in pattern_count()
1071 Imp::DFA(ref dfa) => dfa.prefilter(), in prefilter()
1101 Imp::DFA(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
1123 Imp::DFA(ref dfa) => { in earliest_find_at()
[all …]
/third_party/rust/crates/regex/
DPERFORMANCE.md99 *during search*. For example, when executing a DFA, its states are computed
151 leftmost-first match. It can use the DFA matcher for this, but must run it
159 spend a lot of time shuffling states around. The DFA limits the performance hit
201 ## Unicode word boundaries may prevent the DFA from being used
206 It's a sad state of the current implementation. At the moment, the DFA will try
208 If the DFA comes across any non-ASCII byte, it will quit and fall back to an
214 expression. Even though the DFA may not be used, specialized routines will
221 can be transformed into a regex that uses the DFA with `(?-u:\b).+(?-u:\b)`. It
228 boundary in the first place, since the DFA will speculatively interpret it as
230 boundary is used explicitly, then the DFA won't quit in the presence of
[all …]
DHACKING.md31 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.
[all …]
DCHANGELOG.md98 Namely, for certain regexes on certain inputs, it's possible for the lazy DFA
516 Improve lazy DFA construction for large regex sets.
1007 Fixes bugs #264, #268 and an unreported where the DFA cache size could be
1034 Implements NFA state compression in the lazy DFA.
1043 Add upper limit (from the DFA) to capture search (for the NFA).
1053 Fixed a bug in the handling of word boundaries in the DFA.
1064 More improvements to DFA performance. Competitive with RE2. See PR for
1073 * Speculative support for Unicode word boundaries was added to the DFA. This
1074 should remove the last common case that disqualified use of the DFA.
1081 The inner loop of the DFA was heavily optimized to improve cache locality
[all …]
DCargo.toml59 # Enables use of a lazy DFA when possible.
139 # usage with the test definitions below. (We can't test the DFA implementations
/third_party/skia/src/sksl/lex/
DTransitionTable.h13 struct DFA;
15 void WriteTransitionTable(std::ofstream& out, const DFA& dfa, size_t states);
DDFA.h17 struct DFA { struct
18 DFA(std::vector<int> charMappings, std::vector<std::vector<int>> transitions, in DFA() function
DMain.cpp34 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()
DNFAtoDFA.h43 DFA convert() { in convert()
59 return DFA(fCharMappings, fTransitions, fAccepts); in convert()
/third_party/node/deps/v8/src/third_party/utf8-decoder/
DREADME.v81 Name: DFA UTF-8 Decoder
13 - Rejection state has been mapped to row 0 (instead of row 1) of the DFA,
/third_party/rust/crates/aho-corasick/
DDESIGN.md18 * Aho-Corasick as a DFA. (An NFA is slower to search, but cheaper to construct
20 * A DFA with pre-multiplied state identifiers. This saves a multiplication
22 * A DFA with equivalence classes of bytes as the alphabet, instead of the
23 traditional 256-byte alphabet. This shrinks the size of the DFA in memory,
216 automata (NFA) and deterministic finite automata (DFA). The difference between
221 a particular state transitions to multiple distinct states.) In contrast, a DFA
222 can only ever be in one state at a time. A DFA has no epsilon transitions, and
241 A DFA's search code, by contrast, looks like this:
243 fn contains(dfa: &DFA, haystack: &[u8]) -> bool {
250 // An Aho-Corasick DFA *never* has a missing state that requires
[all …]
/third_party/ffmpeg/tests/fate/
Ddfa.mak34 FATE_DFA-$(call FRAMECRC, DFA, DFA, SCALE_FILTER) += $(FATE_DFA)
/third_party/pcre2/pcre2/testdata/
Dtestinput141 # These test special UTF and UCP features of DFA matching. The output is
8 # non-DFA matching.
Dtestoutput14-161 # These test special UTF and UCP features of DFA matching. The output is
8 # non-DFA matching.
Dtestoutput14-321 # These test special UTF and UCP features of DFA matching. The output is
8 # non-DFA matching.
Dtestinput131 # These DFA tests are for the handling of characters greater than 255 in
Dtestoutput131 # These DFA tests are for the handling of characters greater than 255 in
Dtestoutput14-81 # These test special UTF and UCP features of DFA matching. The output is
8 # non-DFA matching.
DtestinputEBC77 # for DFA matching (otherwise it may show multiple matches).
Dtestinput222 # for DFA matching in UTF mode, so this test is not run with -dfa. The output
/third_party/pcre2/pcre2/
DRunTest.bat339 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
/third_party/libphonenumber/metadata/src/test/proto/
Dregression_test.proto43 // The input ranges (in the form of range specifications) which form the DFA

1234