61   size_t NumArcs(StateId s) const { return states_[s]->arcs.size(); }  in NumArcs()
78     states_[s]->arcs.push_back(arc);  in AddArc()
98       vector<Arc> &arcs = states_[s]->arcs;  in DeleteStates()  local
100       for (size_t i = 0; i < arcs.size(); ++i) {  in DeleteStates()
101         StateId t = newid[arcs[i].nextstate];  in DeleteStates()
103           arcs[i].nextstate = t;  in DeleteStates()
105             arcs[narcs] = arcs[i];  in DeleteStates()
108           if (arcs[i].ilabel == 0)  in DeleteStates()
110           if (arcs[i].olabel == 0)  in DeleteStates()
114       arcs.resize(narcs);  in DeleteStates()
128     states_[s]->arcs.resize(states_[s]->arcs.size() - n);  in DeleteArcs()
131   void DeleteArcs(StateId s) { states_[s]->arcs.clear(); }  in DeleteArcs()
141   void ReserveArcs(StateId s, size_t n) { states_[s]->arcs.reserve(n); }  in ReserveArcs()
152     data->narcs = states_[s]->arcs.size();  in InitArcIterator()
153     data->arcs = data->narcs > 0 ? &states_[s]->arcs[0] : 0;  in InitArcIterator()
174   vector<A> arcs;            // Arcs represenation  member
239     const A *parc = state->arcs.empty() ? 0 : &(state->arcs.back());  in AddArc()
257     const vector<A> &arcs = GetState(s)->arcs;  in DeleteArcs()  local
259       size_t j = arcs.size() - i - 1;  in DeleteArcs()
260       if (arcs[j].ilabel == 0)  in DeleteArcs()
262       if (arcs[j].olabel == 0)  in DeleteArcs()
588       : arcs_(fst.GetImpl()->GetState(s)->arcs), i_(0) {}  in ArcIterator()
631   bool Done() const { return i_ >= state_->arcs.size(); }  in Done()
633   const A& Value() const { return state_->arcs[i_]; }  in Value()
644     A& oarc = state_->arcs[i_];  in SetValue()