HomeSort by relevance Sort by last modified time
    Searched refs:fTransitions (Results 1 - 6 of 6) sorted by null

  /external/skia/src/sksl/lex/
DFA.h 21 , fTransitions(transitions)
24 // maps chars to the row index of fTransitions, as multiple characters may map to the same row.
26 // fTransitions[fCharMappings[c]][s].
30 std::vector<std::vector<int>> fTransitions;
NFAtoDFA.h 54 for (const auto& row : fTransitions) {
57 return DFA(fCharMappings, fTransitions, fAccepts);
91 while (fTransitions.size() <= (size_t) c) {
92 fTransitions.push_back(std::vector<int>());
94 std::vector<int>& row = fTransitions[c];
139 for (size_t i = 0; i < fTransitions.size(); ++i) {
142 if (*uniques[j] == fTransitions[i]) {
149 uniques.push_back(&fTransitions[i]);
157 fTransitions = newTransitions;
162 std::vector<std::vector<int>> fTransitions;
    [all...]
Main.cpp 98 for (const auto& row : dfa.fTransitions) {
108 out << "static int16_t transitions[" << dfa.fTransitions.size() << "][" << states << "] = {\n";
109 for (size_t c = 0; c < dfa.fTransitions.size(); ++c) {
112 if ((size_t) c < dfa.fTransitions.size() && j < dfa.fTransitions[c].size()) {
113 out << " " << dfa.fTransitions[c][j] << ",";
  /external/skqp/src/sksl/lex/
DFA.h 21 , fTransitions(transitions)
24 // maps chars to the row index of fTransitions, as multiple characters may map to the same row.
26 // fTransitions[fCharMappings[c]][s].
30 std::vector<std::vector<int>> fTransitions;
NFAtoDFA.h 54 for (const auto& row : fTransitions) {
57 return DFA(fCharMappings, fTransitions, fAccepts);
91 while (fTransitions.size() <= (size_t) c) {
92 fTransitions.push_back(std::vector<int>());
94 std::vector<int>& row = fTransitions[c];
139 for (size_t i = 0; i < fTransitions.size(); ++i) {
142 if (*uniques[j] == fTransitions[i]) {
149 uniques.push_back(&fTransitions[i]);
157 fTransitions = newTransitions;
162 std::vector<std::vector<int>> fTransitions;
    [all...]
Main.cpp 98 for (const auto& row : dfa.fTransitions) {
108 out << "static int16_t transitions[" << dfa.fTransitions.size() << "][" << states << "] = {\n";
109 for (size_t c = 0; c < dfa.fTransitions.size(); ++c) {
112 if ((size_t) c < dfa.fTransitions.size() && j < dfa.fTransitions[c].size()) {
113 out << " " << dfa.fTransitions[c][j] << ",";

Completed in 711 milliseconds