| /external/rust/crates/csv-core/benches/ |
| D | bench.rs | 20 ($name:ident, $data:ident, $counter:ident, $result:expr, NFA) => {
38 bench!(count_nfl_field_copy_nfa, NFL, count_fields, 130000, NFA);
40 bench!(count_nfl_record_copy_nfa, NFL, count_records, 10000, NFA);
43 bench!(count_game_field_copy_nfa, GAME, count_fields, 600000, NFA);
45 bench!(count_game_record_copy_nfa, GAME, count_records, 100000, NFA);
48 bench!(count_pop_field_copy_nfa, POP, count_fields, 140007, NFA);
50 bench!(count_pop_record_copy_nfa, POP, count_records, 20001, NFA);
53 bench!(count_mbta_field_copy_nfa, MBTA, count_fields, 90000, NFA);
55 bench!(count_mbta_record_copy_nfa, MBTA, count_records, 10000, NFA);
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | nfa.cc | 47 class NFA { class
49 NFA(Prog* prog);
50 ~NFA();
129 NFA(const NFA&) = delete;
130 NFA& operator=(const NFA&) = delete;
133 NFA::NFA(Prog* prog) { in NFA() function in re2::NFA
153 NFA::~NFA() { in ~NFA()
159 NFA::Thread* NFA::AllocThread() { in AllocThread()
175 NFA::Thread* NFA::Incref(Thread* t) { in Incref()
181 void NFA::Decref(Thread* t) { in Decref()
[all …]
|
| /external/rust/crates/regex-automata/src/nfa/ |
| D | mod.rs | 18 pub struct NFA { struct
44 impl NFA { argument
46 pub fn always_match() -> NFA { in always_match()
47 NFA { in always_match()
56 pub fn never_match() -> NFA { in never_match()
57 NFA { in never_match()
93 impl fmt::Debug for NFA { implementation
229 let nfa = NFA::always_match(); in always_match()
242 let nfa = NFA::never_match(); in never_match()
|
| D | compiler.rs | 44 use nfa::{State, StateID, Transition, NFA};
85 pub fn build(&self, expr: &Hir) -> Result<NFA> { in build() argument
86 let mut nfa = NFA::always_match(); in build()
107 nfa: &mut NFA, in build_with() argument
286 fn compile(&self, nfa: &mut NFA, expr: &Hir) -> Result<()> { in compile() argument
309 fn finish(&self, nfa: &mut NFA) { in finish() argument
1005 use super::{Builder, State, StateID, Transition, NFA};
1011 fn build(pattern: &str) -> NFA { in build() argument
|
| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestDFAMatching.java | 31 import org.antlr.analysis.NFA;
54 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER); in testSimpleAltCharTest()
81 checkPrediction(dfa,"q", NFA.INVALID_ALT_NUMBER); in testFiniteCommonLeftPrefixes()
94 checkPrediction(dfa,".2", NFA.INVALID_ALT_NUMBER); in testSimpleLoops()
|
| /external/rust/crates/regex-automata/ |
| D | TODO | 3 * Consider refactoring the NFA representation such that it can be instantly
5 could negatively impact using the NFA with deserialization costs. Before
8 * Add captures and anchors to NFA.
|
| /external/rust/crates/aho-corasick/src/ |
| D | ahocorasick.rs | 7 use nfa::{self, NFA};
1026 Imp::NFA(ref nfa) => nfa.heap_bytes(), in heap_bytes()
1037 NFA(NFA<S>), enumerator
1045 Imp::NFA(ref nfa) => nfa.match_kind(), in match_kind()
1053 Imp::NFA(ref nfa) => nfa.start_state(), in start_state()
1063 Imp::NFA(ref nfa) => nfa.max_pattern_len(), in max_pattern_len()
1073 Imp::NFA(ref nfa) => nfa.pattern_count(), in pattern_count()
1082 Imp::NFA(ref nfa) => nfa.prefilter(), in prefilter()
1106 Imp::NFA(ref nfa) => nfa.overlapping_find_at( in overlapping_find_at()
1132 Imp::NFA(ref nfa) => { in earliest_find_at()
[all …]
|
| D | nfa.rs | 47 pub struct NFA<S> { struct
90 impl<S: StateID> NFA<S> { impl
217 impl<S: StateID> Automaton for NFA<S> { implementation
501 nfa: &'a mut NFA<S>,
507 fn new(nfa: &'a mut NFA<S>, state_id: S) -> IterTransitionsMut<'a, S> { in new()
511 fn nfa(&mut self) -> &mut NFA<S> { in nfa()
574 pub fn build<I, P, S: StateID>(&self, patterns: I) -> Result<NFA<S>> in build()
615 nfa: NFA<S>,
625 nfa: NFA { in new()
640 fn compile<I, P>(mut self, patterns: I) -> Result<NFA<S>> in compile()
[all …]
|
| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| D | DFAState.java | 67 public static final int PREDICTED_ALT_UNSET = NFA.INVALID_ALT_NUMBER-1;
434 int alt = NFA.INVALID_ALT_NUMBER; in getUniquelyPredictedAlt()
444 if ( alt==NFA.INVALID_ALT_NUMBER ) { in getUniquelyPredictedAlt()
448 return NFA.INVALID_ALT_NUMBER; in getUniquelyPredictedAlt()
460 int alt = NFA.INVALID_ALT_NUMBER; in getUniqueAlt()
464 if ( alt==NFA.INVALID_ALT_NUMBER ) { in getUniqueAlt()
468 return NFA.INVALID_ALT_NUMBER; in getUniqueAlt()
|
| D | NFA.java | 38 public class NFA { class
49 public NFA(Grammar g) { in NFA() method in NFA
|
| D | NFAState.java | 57 public NFA nfa = null;
108 public NFAState(NFA nfa) { in NFAState()
|
| /external/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()
|
| /external/skqp/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 | 35 NFAtoDFA(NFA* nfa) in NFAtoDFA()
160 const NFA& fNFA;
|
| D | NFA.h | 18 struct NFA { struct
|
| D | NFA.cpp | 10 int NFA::match(std::string s) const { in match()
|
| /external/rust/crates/regex-automata/src/ |
| D | determinize.rs | 7 use nfa::{self, NFA};
29 nfa: &'a NFA,
63 pub fn new(nfa: &'a NFA) -> Determinizer<'a, S> { in new()
|
| /external/antlr/tool/src/main/java/org/antlr/codegen/ |
| D | ACyclicDFACodeGenerator.java | 95 int EOTPredicts = NFA.INVALID_ALT_NUMBER; in walkFixedDFAGeneratingStateMachine()
159 if ( EOTPredicts!=NFA.INVALID_ALT_NUMBER ) { in walkFixedDFAGeneratingStateMachine()
|
| /external/python/cpython3/Parser/pgen/ |
| D | metaparser.py | 6 from .automata import NFA, NFAState
41 yield NFA(a, z)
|
| D | automata.py | 3 class NFA: class
223 assert isinstance(nfa, NFA)
|
| /external/rust/crates/regex/ |
| D | Cargo.toml.orig | 137 # based on the regex. We test both of the NFA implementations by forcing their
149 # Run the test suite on the NFA algorithm over Unicode codepoints.
154 # Run the test suite on the NFA algorithm over bytes that match UTF-8 only.
159 # Run the test suite on the NFA algorithm over arbitrary bytes.
|
| /external/antlr/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| D | dot.stg | 34 digraph NFA {
43 digraph NFA {
|