Lines Matching refs:states_
45 for (StateId s = 0; s < (StateId)states_.size(); ++s)
46 delete states_[s];
51 Weight Final(StateId s) const { return states_[s]->final; }
53 StateId NumStates() const { return states_.size(); }
55 size_t NumArcs(StateId s) const { return states_[s]->arcs.size(); }
59 void SetFinal(StateId s, Weight w) { states_[s]->final = w; }
62 states_.push_back(new State);
63 return states_.size() - 1;
67 states_.push_back(state);
68 return states_.size() - 1;
72 states_[s]->arcs.push_back(arc);
76 vector<StateId> newid(states_.size(), 0);
80 for (StateId s = 0; s < (StateId)states_.size(); ++s) {
84 states_[nstates] = states_[s];
87 delete states_[s];
90 states_.resize(nstates);
91 for (StateId s = 0; s < (StateId)states_.size(); ++s) {
92 vector<Arc> &arcs = states_[s]->arcs;
103 --states_[s]->niepsilons;
105 --states_[s]->noepsilons;
115 for (StateId s = 0; s < (StateId)states_.size(); ++s)
116 delete states_[s];
117 states_.clear();
122 states_[s]->arcs.resize(states_[s]->arcs.size() - n);
125 void DeleteArcs(StateId s) { states_[s]->arcs.clear(); }
127 State *GetState(StateId s) { return states_[s]; }
129 const State *GetState(StateId s) const { return states_[s]; }
131 void SetState(StateId s, State *state) { states_[s] = state; }
133 void ReserveStates(StateId n) { states_.reserve(n); }
135 void ReserveArcs(StateId s, size_t n) { states_[s]->arcs.reserve(n); }
140 data->nstates = states_.size();
146 data->narcs = states_[s]->arcs.size();
147 data->arcs = data->narcs > 0 ? &states_[s]->arcs[0] : 0;
152 vector<State *> states_; // States represenation.
