/dports/net/zebra-server/idzebra-2.0.55/dfa/ |
H A D | states.c | 43 assert (dfas); in init_DFA_states() 47 *dfasp = dfas; in init_DFA_states() 48 dfas->freelist = dfas->unmarked = dfas->marked = NULL; in init_DFA_states() 51 dfas->st = st; in init_DFA_states() 52 dfas->no = 0; in init_DFA_states() 76 assert (dfas); in rm_DFA_states() 93 ifree (dfas); in rm_DFA_states() 104 assert (dfas); in add_DFA_state() 107 sip = dfas->hasharray + (hash_DFASet (dfas->st, *s) % dfas->hash); in add_DFA_state() 177 assert (dfas); in get_DFA_state() [all …]
|
/dports/x11/alacritty/alacritty-0.9.0/alacritty_terminal/src/term/ |
H A D | search.rs | 55 dfas: &RegexSearch, in search_next() 74 dfas: &RegexSearch, in next_match_right() 113 dfas: &RegexSearch, in next_match_left() 173 dfas: &RegexSearch, in regex_search_right() 438 dfas: &'a RegexSearch, field 449 dfas: &'a RegexSearch, in new() 650 let dfas = RegexSearch::new("zoo").unwrap(); in reverse_search_dead_recovery() localVariable 692 let dfas = RegexSearch::new("").unwrap(); in singlecell_fullwidth() localVariable 697 let dfas = RegexSearch::new("").unwrap(); in singlecell_fullwidth() localVariable 711 let dfas = RegexSearch::new("xxx").unwrap(); in wrapping() localVariable [all …]
|
/dports/textproc/py-parso/parso-0.8.3/parso/pgen2/ |
H A D | generator.py | 141 def _simplify_dfas(dfas): argument 155 state_j = dfas[j] 157 del dfas[j] 158 for state in dfas: 232 def _dump_dfas(dfas): argument 234 for i, state in enumerate(dfas): 253 dfas = _make_dfas(nfa_a, nfa_z) 256 _simplify_dfas(dfas) 266 for dfa_state in dfas: 320 for dfa_state in dfas: [all …]
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfa/ |
H A D | rdfa_merge.cpp | 68 Automaton_Merge(const vector<const raw_dfa *> &dfas, in Automaton_Merge() argument 315 if (dfas.size() <= 1) { in mergeDfas() 322 for (auto &dfa : dfas) { in mergeDfas() 328 dfas.clear(); in mergeDfas() 345 dfas.push_back(move(d2)); in mergeDfas() 348 dfas.push_back(move(d1)); in mergeDfas() 355 dfas.push_back(move(q.front())); in mergeDfas() 366 assert(!dfas.empty()); in mergeAllDfas() 369 const auto kind = dfas.front()->kind; in mergeAllDfas() 370 assert(all_of(begin(dfas), end(dfas), in mergeAllDfas() [all …]
|
/dports/devel/py-libcst/libcst-0.3.23/libcst/_parser/parso/pgen2/ |
H A D | generator.py | 155 def _simplify_dfas(dfas): argument 167 for i, state_i in enumerate(dfas): 169 state_j = dfas[j] 172 del dfas[j] 173 for state in dfas: 241 dfas = _make_dfas(nfa_a, nfa_z) 242 _simplify_dfas(dfas) 250 for dfa_state in dfas: 304 for dfa_state in dfas: 337 dfas = nonterminal_to_dfas[nonterminal] [all …]
|
/dports/mail/mairix/mairix-0.24/dfasyn/ |
H A D | compdfa.c | 72 DFANode *d = dfas[di]; in calculate_signatures() 126 calculate_signatures(seq, dfas, ndfas); in split_classes() 332 static void print_classes(DFANode **dfas, int ndfas)/*{{{*/ in print_classes() argument 391 if (has_any_nondefault_attribute(dfas[i])) { in find_dead_states() 398 int next_state = dfas[i]->map[j]; in find_dead_states() 419 dfas[i]->from_state = -1; in find_dead_states() 420 dfas[i]->via_token = -1; in find_dead_states() 421 dfas[i]->is_dead = 1; in find_dead_states() 423 dfas[i]->is_dead = 0; in find_dead_states() 427 int next_state = dfas[i]->map[j]; in find_dead_states() [all …]
|
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/fte/ |
H A D | fte.go | 25 dfas map[cacheKey]*DFA member 32 dfas: make(map[cacheKey]*DFA), 45 for _, dfa := range c.dfas { 50 c.dfas = nil 71 dfa := c.dfas[cacheKey{regex, n}] 76 c.dfas[cacheKey{regex, n}] = dfa
|
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/fte/ |
H A D | fte.go | 25 dfas map[cacheKey]*DFA member 32 dfas: make(map[cacheKey]*DFA), 45 for _, dfa := range c.dfas { 50 c.dfas = nil 71 dfa := c.dfas[cacheKey{regex, n}] 76 c.dfas[cacheKey{regex, n}] = dfa
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/smallwrite/ |
H A D | smallwrite_build.cpp | 234 assert(!dfas.empty()); in mergeDfas() 236 if (dfas.size() == 1) { in mergeDfas() 243 dfa_ptrs.reserve(dfas.size()); in mergeDfas() 244 for (auto &d : dfas) { in mergeDfas() 256 dfas.clear(); in mergeDfas() 318 dfas.push_back(std::move(r)); in add() 322 dfas.clear(); in add() 905 if (dfas.empty()) { in build() 911 dfas.clear(); in build() 915 assert(dfas.size() == 1); in build() [all …]
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfagraph/ |
H A D | ng_haig.cpp | 614 for (u32 d = 0; d < dfas.size(); ++d) { in haig_merge_do_preds() 618 = dfas[d]->state_som[source_nfa_states[d]].preds; in haig_merge_do_preds() 648 for (u32 d = 0; d < dfas.size(); ++d) { in haig_merge_note_starts() 670 for (u32 d = 0; d < dfas.size(); ++d) { in haig_merge_do_report() 675 : dfas[d]->state_som[source_nfa_states[d]].reports; in haig_merge_do_report() 708 assert(!dfas.empty()); in attemptToMergeHaig() 710 Automaton_Haig_Merge n(dfas); in attemptToMergeHaig() 712 DEBUG_PRINTF("merging %zu dfas\n", dfas.size()); in attemptToMergeHaig() 715 for (const auto &haig : dfas) { in attemptToMergeHaig() 717 assert(haig->kind == dfas.front()->kind); in attemptToMergeHaig() [all …]
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/rose/ |
H A D | rose_build_anchored.cpp | 145 for (auto &rdfa : dfas) { in mergeAnchoredDfas() 153 dfas.clear(); in mergeAnchoredDfas() 162 dfas.push_back(move(rdfa)); in mergeAnchoredDfas() 170 if (dfas.size() == 2) { in mergeAnchoredDfas() 171 size_t total_states = dfas[0]->states.size() + dfas[1]->states.size(); in mergeAnchoredDfas() 799 return dfas; in getAnchoredDfas() 849 vector<raw_dfa> dfas; in buildAnchoredDfas() local 853 return dfas; in buildAnchoredDfas() 867 return dfas; in buildAnchoredDfas() 875 if (dfas.empty()) { in buildAnchoredMatcher() [all …]
|
/dports/lang/python39/Python-3.9.9/Parser/pgen/ |
H A D | pgen.py | 145 self.dfas, self.startsymbol = self.create_dfas() 175 names = list(self.dfas.keys()) 185 dfa = self.dfas[name] 196 c.dfas[c.symbol2number[name]] = (states, self.make_first_sets(c, name)) 205 print("- {n_dfas} dfas".format(n_dfas=len(c.dfas))) 270 names = list(self.dfas.keys()) 281 dfa = self.dfas[name] 287 if label in self.dfas:
|
/dports/databases/py-gdbm/Python-3.8.12/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = list(self.dfas.keys()) 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = list(self.dfas.keys()) 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/lang/python310/Python-3.10.1/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = list(self.dfas.keys()) 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = list(self.dfas.keys()) 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/lang/python-legacy/Python-2.7.18/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = self.dfas.keys() 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = self.dfas.keys() 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/lang/python37/Python-3.7.12/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = list(self.dfas.keys()) 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = list(self.dfas.keys()) 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/lang/python38/Python-3.8.12/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = list(self.dfas.keys()) 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = list(self.dfas.keys()) 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/lang/python-tools/Python-3.8.12/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = list(self.dfas.keys()) 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = list(self.dfas.keys()) 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/lang/python27/Python-2.7.18/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = self.dfas.keys() 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = self.dfas.keys() 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/lang/python39/Python-3.9.9/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = list(self.dfas.keys()) 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = list(self.dfas.keys()) 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/java/eclipse-pydev/eclipse-pydev-8.2.0/plugins/org.python.pydev.core_8.2.0.202102211157/pysrc/third_party/pep8/lib2to3/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = self.dfas.keys() 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = self.dfas.keys() 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/x11-toolkits/py-tkinter/Python-3.8.12/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = list(self.dfas.keys()) 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = list(self.dfas.keys()) 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/databases/py-sqlite3/Python-3.8.12/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = list(self.dfas.keys()) 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = list(self.dfas.keys()) 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/devel/pycharm-pro/pycharm-2020.2.3/plugins/python/helpers/pydev/third_party/pep8/lib2to3/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = self.dfas.keys() 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = self.dfas.keys() 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/pgen2/ |
H A D | pgen.py | 21 self.dfas, self.startsymbol = self.parse() 29 names = self.dfas.keys() 38 dfa = self.dfas[name] 48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name)) 108 names = self.dfas.keys() 116 dfa = self.dfas[name] 122 if label in self.dfas: 146 dfas = {} 163 dfas[name] = dfa 167 return dfas, startsymbol
|