Lines Matching defs:begin
143 for (vector<Node*>::iterator i = edge->inputs_.begin();
165 EdgeSet::iterator e = ready_.begin();
213 for (vector<Node*>::iterator o = edge->outputs_.begin();
231 for (vector<Edge*>::const_iterator oe = node->out_edges().begin();
262 for (vector<Edge*>::const_iterator oe = node->out_edges().begin();
276 begin = (*oe)->inputs_.begin(),
283 if (find_if(begin, end, MEM_FN(&Node::dirty)) == end) {
286 for (vector<Node*>::iterator i = begin; i != end; ++i) {
300 for (vector<Node*>::iterator o = (*oe)->outputs_.begin();
333 for (DyndepFile::const_iterator oe = ddf.begin(); oe != ddf.end(); ++oe) {
354 oei = dyndep_roots.begin(); oei != dyndep_roots.end(); ++oei) {
356 for (vector<Node*>::const_iterator i = oe->second.implicit_inputs_.begin();
366 for (vector<Edge*>::const_iterator oe = node->out_edges().begin();
375 for (set<Edge*>::iterator wi = dyndep_walk.begin();
396 for (set<Node*>::iterator i = dependents.begin();
407 for (std::vector<Node*>::iterator v = validation_nodes.begin();
435 for (vector<Edge*>::const_iterator oe = node->out_edges().begin();
445 for (vector<Node*>::iterator o = edge->outputs_.begin();
456 for (map<Edge*, Want>::const_iterator e = want_.begin(); e != want_.end(); ++e) {
480 for (map<const Subprocess*, Edge*>::iterator e = subproc_to_edge_.begin();
564 for (vector<Edge*>::iterator e = active_edges.begin();
567 for (vector<Node*>::iterator o = (*e)->outputs_.begin();
618 for (std::vector<Node*>::iterator n = validation_nodes.begin();
790 auto it = std::find_if(content_list.begin(), content_list.end(), [&](const std::string& s) {
838 for (vector<Node*>::iterator o = edge->outputs_.begin();
922 for (vector<Node*>::iterator o = edge->outputs_.begin();
962 for (std::vector<Node*>::const_iterator o = edge->outputs_.begin();
987 for (set<string>::iterator i = parser.includes_.begin();
1022 for (vector<StringPiece>::iterator i = deps.ins_.begin();