Lines Matching full:states
72 // represents the possible resource states that can result from adding a L_or_M
76 // two states [0x01] and [0x10] into a DFA with a single state [0x01, 0x10].
79 // a map from inputs to new states.
104 // PossibleStates is the set of valid resource states that ensue from valid
133 // Set of states. Need to keep this sorted to emit the transition table.
135 StateSet states;
184 // Iterate over all resource states in currentState.
242 auto IterPair = states.insert(State());
268 DFA::StateSet::iterator SI = states.begin();
271 std::vector<int> StateEntry(states.size());
279 for (unsigned i = 0; i < states.size(); ++i, ++SI) {
310 for (unsigned i = 0; i < states.size(); ++i)
454 // S' = state with resource states = {S Union C}
475 assert(!NewStateResources.empty() && "New states must be generated");
