Lines Matching full:state
54 // Computation state of the epsilon-removal algorithm.
68 // Compute arcs and final weight for state 's'
71 // Returns arcs of expanded state.
74 // Returns final weight of expanded state.
116 // Distance from state being expanded in epsilon-closure.
118 // Shortest distance algorithm computation state.
121 // in the arcs vector of the state being expanded. 'e' corresponds
123 // equal to the state being expanded.
127 vector<bool> visited_; // '[i] = true' if state 'i' has been visited
129 vector<Arc> arcs_; // Arcs of state being expanded
130 Weight final_; // Final weight of state being expanded
144 StateId state = eps_queue_.top();
147 while ((StateId)visited_.size() <= state) visited_.push_back(false);
148 visited_[state] = true;
149 visited_states_.push_front(state);
151 for (ArcIterator< Fst<Arc> > ait(fst_, state);
155 arc.weight = Times((*distance_)[state], arc.weight);
182 final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state)));
199 // during the epsilon-closure computation. The state queue discipline
247 StateId state = states.back();
249 rmeps_state.Expand(state);
250 fst->SetFinal(state, rmeps_state.Final());
251 fst->DeleteArcs(state);
254 fst->AddArc(state, arcs.back());
329 typedef CacheState<A> State;
419 // to visit an input state or arc is assumed and exclusive of caching.
435 typedef CacheState<A> State;
