| /third_party/re2/re2/ |
| D | nfa.cc | 46 class NFA { class
48 NFA(Prog* prog);
49 ~NFA();
125 NFA(const NFA&) = delete;
126 NFA& operator=(const NFA&) = delete;
129 NFA::NFA(Prog* prog) { in NFA() function in re2::NFA
149 NFA::~NFA() { in ~NFA()
159 NFA::Thread* NFA::AllocThread() { in AllocThread()
172 NFA::Thread* NFA::Incref(Thread* t) { in Incref()
178 void NFA::Decref(Thread* t) { in Decref()
[all …]
|
| /third_party/flutter/skia/src/sksl/lex/ |
| D | RegexNode.h | 14 struct NFA;
64 std::vector<int> createStates(NFA* nfa, const std::vector<int>& accept) const;
|
| D | NFAtoDFA.h | 37 NFAtoDFA(NFA* nfa) in NFAtoDFA()
162 const NFA& fNFA;
|
| D | NFA.h | 18 struct NFA { struct
|
| D | NFA.cpp | 10 int NFA::match(std::string s) const { in match()
|
| D | RegexNode.cpp | 12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const { in createStates()
|
| D | Main.cpp | 175 NFA nfa; in process()
|
| /third_party/skia/src/sksl/lex/ |
| D | RegexNode.h | 14 struct NFA;
64 std::vector<int> createStates(NFA* nfa, const std::vector<int>& accept) const;
|
| D | NFAtoDFA.h | 37 NFAtoDFA(NFA* nfa) in NFAtoDFA()
162 const NFA& fNFA;
|
| D | NFA.h | 18 struct NFA { struct
|
| D | NFA.cpp | 10 int NFA::match(std::string s) const { in match()
|
| D | RegexNode.cpp | 12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const { in createStates()
|
| D | Main.cpp | 186 NFA nfa; in process()
|
| /third_party/skia/src/sksl/ |
| D | BUILD.bazel | 186 "lex/NFA.cpp",
187 "lex/NFA.h",
|
| /third_party/mesa3d/src/gallium/drivers/r600/sb/ |
| D | sb_bc_fmt_def.inc | 422 BC_FIELD(VTX_WORD1_GPR, NUM_FORMAT_ALL, NFA, 29, 28)
436 BC_FIELD(VTX_WORD1_SEM, NUM_FORMAT_ALL, NFA, 29, 28)
598 BC_FIELD(MEM_RD_WORD1, NUM_FORMAT_ALL, NFA, 29, 28)
|
| /third_party/pcre2/pcre2/ |
| D | HACKING | 44 matches individual wild portions of the pattern. This is an "NFA algorithm" in
321 it implements an NFA algorithm, similar to the original Henry Spencer algorithm
|
| /third_party/skia/ |
| D | BUILD.gn | 612 "src/sksl/lex/NFA.cpp",
613 "src/sksl/lex/NFA.h",
|
| /third_party/icu/docs/userguide/strings/ |
| D | regexp.md | 381 (NFA) style matching engine. This section gives some suggestion on how to avoid
|
| /third_party/flutter/skia/ |
| D | BUILD.gn | 459 "src/sksl/lex/NFA.cpp",
|
| /third_party/protobuf/ |
| D | CHANGES.txt | 2266 rather than building an NFA). Worked around by making use of possessive
|
| /third_party/flutter/engine/flutter/ci/licenses_golden/ |
| D | licenses_skia | 3539 FILE: ../../../third_party/skia/src/sksl/lex/NFA.cpp
3540 FILE: ../../../third_party/skia/src/sksl/lex/NFA.h
|
| /third_party/chromium/patch/ |
| D | 0003-3.2-Beta3-1115.patch | 82926 +** A nondeterministic finite automaton (NFA) is used for matching, so the
82976 +/* The NFA is implemented as sequence of opcodes taken from the following
83002 +/* Each opcode is a "state" in the NFA */
83009 +/* Because this is an NFA and not a DFA, multiple states can be active at
83011 +** the NFA. The implementation is optimized for the common case where the
83028 +/* A compiled NFA (or an NFA that is in the process of being compiled) is
86767 -** A nondeterministic finite automaton (NFA) is used for matching, so the
86808 -/* The NFA is implemented as sequence of opcodes taken from the following
86833 -/* Each opcode is a "state" in the NFA */
86844 -/* Because this is an NFA and not a DFA, multiple states can be active at
[all …]
|
| D | 0001-cve.patch | 91519 - validation without using an ugly NFA -> DFA algo in the source.
|
| /third_party/pcre2/pcre2/doc/ |
| D | pcre2.txt | 5644 sions", the standard algorithm is an "NFA algorithm". It conducts a
|