Home
last modified time | relevance | path

Searched refs:fStates (Results 1 – 5 of 5) sorted by relevance

/third_party/skia/src/sksl/lex/
DNFA.cpp15 if (fStates[id].accept(s[i])) { in match()
16 for (int nextId : fStates[id].fNext) { in match()
17 if (fStates[nextId].fKind != NFAState::kRemapped_Kind) { in match()
20 next.insert(next.end(), fStates[nextId].fData.begin(), in match()
21 fStates[nextId].fData.end()); in match()
33 if (fStates[id].fKind == NFAState::kAccept_Kind) { in match()
34 int result = fStates[id].fData[0]; in match()
DNFAtoDFA.h67 auto found = fStates.find(label); in getState()
68 if (found == fStates.end()) { in getState()
69 int id = fStates.size(); in getState()
70 fStates[label] = std::unique_ptr<DFAState>(new DFAState(id, label)); in getState()
71 return fStates[label].get(); in getState()
77 NFAState state = fNFA.fStates[nfaState]; in add()
108 for (int idx : state->fLabel.fStates) { in scanState()
109 const NFAState& nfaState = fNFA.fStates[idx]; in scanState()
112 if (fNFA.fStates[nextState].fKind == NFAState::kAccept_Kind) { in scanState()
113 bestAccept = std::min(bestAccept, fNFA.fStates[nextState].fData[0]); in scanState()
[all …]
DDFAState.h18 std::vector<int> fStates; member
21 : fStates(std::move(states)) {} in Label()
24 return fStates == other.fStates;
35 for (int s : fStates) { in description()
67 for (int i : s.fStates) {
DNFA.h36 fStates.push_back(std::move(s)); in addState()
37 return fStates.size() - 1; in addState()
49 std::vector<NFAState> fStates; member
DRegexNode.cpp62 nfa->fStates[id] = NFAState(result); in createStates()
78 nfa->fStates[id] = NFAState(result); in createStates()