Lines Matching refs:Arc
53 // garbage collection of states (not in use in an arc iterator) is
61 using FstImpl<typename S::Arc>::Type;
66 typedef typename S::Arc Arc;
67 typedef typename Arc::Weight Weight;
68 typedef typename Arc::StateId StateId;
140 cache_first_state_->arcs.capacity() * sizeof(Arc);
170 void AddArc(StateId s, const Arc &arc) {
172 state->arcs.push_back(arc);
178 vector<Arc> &arcs = state->arcs;
181 const Arc &arc = arcs[a];
182 if (arc.nextstate >= nknown_states_)
183 nknown_states_ = arc.nextstate + 1;
184 if (arc.ilabel == 0)
186 if (arc.olabel == 0)
192 cache_size_ += arcs.capacity() * sizeof(Arc);
248 // Provides information needed for generic arc iterator.
249 void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const {
288 cache_size_ -= sizeof(S) + state->arcs.capacity() * sizeof(Arc);
337 void InitStateIterator(StateIteratorData<Arc> *); // disallow
349 typedef A Arc;
390 class CacheStateIterator : public StateIteratorBase<typename F::Arc> {
392 typedef typename F::Arc Arc;
393 typedef typename Arc::StateId StateId;
425 // Use this to make an arc iterator for a CacheBaseImpl-derived Fst.
427 // define types Arc and State.
431 typedef typename F::Arc Arc;
433 typedef typename Arc::StateId StateId;
444 const Arc& Value() const { return state_->arcs[i_]; }
