Lines Matching refs:transitions
74 /** Track the transitions emanating from this DFA state. The List
77 protected List<Transition> transitions =
156 * can easily check for non-epsilon transitions because the only
159 * for all possible transitions. That is of the order: size(label space)
177 return (Transition)transitions.get(i);
181 return transitions.size();
185 transitions.add(t);
192 transitions.add( new Transition(label, target) );
193 return transitions.size()-1;
197 return transitions.get(trans);
201 transitions.remove(trans);
283 * As we need a deterministic set of transitions from any
289 * only care that the set of transitions out of a single state are
434 // in transitions out of this state, so must count those
531 // save the overhead. There are many o-a->o NFA transitions
682 * evaluations as it transitions to an accept state; waste to