Lines Matching refs:this
4 * Use of this source code is governed by a BSD-style license that can be
25 * possible combination of simultaneous NFA states and give this combination a label. These labelled
49 // this becomes state 1, our start state
51 this->scanState(start);
53 this->computeMappings();
80 this->add(next, states);
115 this->add(nextState, &next);
120 DFAState* nextState = this->getState(DFAState::Label(next));
121 this->addTransition(c, state->fId, nextState->fId);
129 this->scanState(nextState);
140 // this could be done more efficiently, but O(n^2) is plenty fast for our purposes