Lines Matching refs:arcs
140 cache_first_state_->arcs.capacity() * sizeof(Arc);
172 state->arcs.push_back(arc);
175 // Marks arcs of state s as cached.
178 vector<Arc> &arcs = state->arcs;
180 for (unsigned int a = 0; a < arcs.size(); ++a) {
181 const Arc &arc = arcs[a];
192 cache_size_ += arcs.capacity() * sizeof(Arc);
200 state->arcs.reserve(n);
217 // Are arcs of state s cached?
235 return state->arcs.size();
252 data->narcs = state->arcs.size();
253 data->arcs = data->narcs > 0 ? &(state->arcs[0]) : 0;
288 cache_size_ -= sizeof(S) + state->arcs.capacity() * sizeof(Arc);
313 static const uint32 kCacheArcs = 0x0002; // Arcs have been cached
345 // Arcs implemented by an STL vector per state. Similar to VectorState
358 arcs.resize(0);
362 vector<A> arcs; // Arcs represenation
442 bool Done() const { return i_ >= state_->arcs.size(); }
444 const Arc& Value() const { return state_->arcs[i_]; }
