Lines Matching defs:arcs
19 // Simple concrete, mutable FST whose states and arcs are stored in STL
39 // States and arcs implemented by STL vectors, templated on the
61 size_t NumArcs(StateId s) const { return states_[s]->arcs.size(); }
78 states_[s]->arcs.push_back(arc);
98 vector<Arc> &arcs = states_[s]->arcs;
100 for (size_t i = 0; i < arcs.size(); ++i) {
101 StateId t = newid[arcs[i].nextstate];
103 arcs[i].nextstate = t;
105 arcs[narcs] = arcs[i];
108 if (arcs[i].ilabel == 0)
110 if (arcs[i].olabel == 0)
114 arcs.resize(narcs);
128 states_[s]->arcs.resize(states_[s]->arcs.size() - n);
131 void DeleteArcs(StateId s) { states_[s]->arcs.clear(); }
141 void ReserveArcs(StateId s, size_t n) { states_[s]->arcs.reserve(n); }
152 data->narcs = states_[s]->arcs.size();
153 data->arcs = data->narcs > 0 ? &states_[s]->arcs[0] : 0;
164 // Arcs implemented by an STL vector per state.
174 vector<A> arcs; // Arcs represenation
239 const A *parc = state->arcs.empty() ? 0 : &(state->arcs.back());
257 const vector<A> &arcs = GetState(s)->arcs;
259 size_t j = arcs.size() - i - 1;
260 if (arcs[j].ilabel == 0)
262 if (arcs[j].olabel == 0)
592 : arcs_(fst.GetImpl()->GetState(s)->arcs), i_(0) {}
635 bool Done() const { return i_ >= state_->arcs.size(); }
637 const A& Value() const { return state_->arcs[i_]; }
648 A& oarc = state_->arcs[i_];
