Lines Matching defs:arcs
230 state->arcs.push_back(arc);
237 const Arc *parc = state->arcs.empty() ? 0 : &(state->arcs.back());
253 state->arcs.push_back(arc);
256 // Marks arcs of state s as cached and does cache book-keeping after all
260 vector<Arc> &arcs = state->arcs;
262 for (size_t a = 0; a < arcs.size(); ++a) {
263 const Arc &arc = arcs[a];
275 cache_size_ += arcs.capacity() * sizeof(Arc);
283 state->arcs.reserve(n);
288 const vector<Arc> &arcs = state->arcs;
290 size_t j = arcs.size() - i - 1;
291 if (arcs[j].ilabel == 0)
293 if (arcs[j].olabel == 0)
297 state->arcs.resize(arcs.size() - n);
308 size_t n = state->arcs.size();
311 state->arcs.clear();
383 // Are arcs of state s cached?
401 return state->arcs.size();
418 data->narcs = state->arcs.size();
419 data->arcs = data->narcs > 0 ? &(state->arcs[0]) : 0;
474 static const uint32 kCacheArcs = 0x0002; // Arcs have been cached
535 cache_first_state_->arcs.capacity() * sizeof(Arc);
576 cache_size_ -= sizeof(S) + state->arcs.capacity() * sizeof(Arc);
608 // Arcs implemented by an STL vector per state. Similar to VectorState
621 arcs.resize(0);
625 vector<A> arcs; // Arcs represenation
727 bool Done() const { return i_ >= state_->arcs.size(); }
729 const Arc& Value() const { return state_->arcs[i_]; }
775 bool Done() const { return i_ >= state_->arcs.size(); }
777 const Arc& Value() const { return state_->arcs[i_]; }
790 Arc& oarc = state_->arcs[i_];
