Searched refs:fTransitions (Results 1 – 7 of 7) sorted by relevance
56 for (const auto& row : fTransitions) { in convert()59 return DFA(fCharMappings, fTransitions, fAccepts); in convert()93 while (fTransitions.size() <= (size_t) c) { in addTransition()94 fTransitions.push_back(std::vector<int>()); in addTransition()96 std::vector<int>& row = fTransitions[c]; in addTransition()141 for (size_t i = 0; i < fTransitions.size(); ++i) { in computeMappings()144 if (*uniques[j] == fTransitions[i]) { in computeMappings()151 uniques.push_back(&fTransitions[i]); in computeMappings()159 fTransitions = newTransitions; in computeMappings()164 std::vector<std::vector<int>> fTransitions; variable
98 for (const auto& row : dfa.fTransitions) { in writeCPP()111 out << "static int16_t transitions[" << dfa.fTransitions.size() << "][" << states << "] = {\n"; in writeCPP()112 for (size_t c = 0; c < dfa.fTransitions.size(); ++c) { in writeCPP()115 if ((size_t) c < dfa.fTransitions.size() && j < dfa.fTransitions[c].size()) { in writeCPP()116 out << " " << dfa.fTransitions[c][j] << ","; in writeCPP()
21 , fTransitions(transitions) in DFA()30 std::vector<std::vector<int>> fTransitions; member
110 int numTransitions = dfa.fTransitions.size(); in WriteTransitionTable()123 if ((size_t) t < dfa.fTransitions.size() && s < dfa.fTransitions[t].size()) { in WriteTransitionTable()124 int value = dfa.fTransitions[t][s]; in WriteTransitionTable()
115 for (const auto& row : dfa.fTransitions) { in writeCPP()