Lines Matching refs:end
144 i != edge->inputs_.end(); ++i) {
195 assert(e != want_.end());
214 o != edge->outputs_.end(); ++o) {
232 oe != node->out_edges().end(); ++oe) {
234 if (want_e == want_.end())
263 oe != node->out_edges().end(); ++oe) {
266 if (want_e == want_.end() || want_e->second == kWantNothing)
277 end = (*oe)->inputs_.end() - (*oe)->order_only_deps_;
283 if (find_if(begin, end, MEM_FN(&Node::dirty)) == end) {
286 for (vector<Node*>::iterator i = begin; i != end; ++i) {
301 o != (*oe)->outputs_.end(); ++o) {
333 for (DyndepFile::const_iterator oe = ddf.begin(); oe != ddf.end(); ++oe) {
344 if (want_e == want_.end())
354 oei = dyndep_roots.begin(); oei != dyndep_roots.end(); ++oei) {
357 i != oe->second.implicit_inputs_.end(); ++i) {
367 oe != node->out_edges().end(); ++oe) {
369 if (want_e == want_.end())
376 wi != dyndep_walk.end(); ++wi) {
378 if (want_e == want_.end())
397 i != dependents.end(); ++i) {
408 v != validation_nodes.end(); ++v) {
425 assert(want_e != want_.end());
436 oe != node->out_edges().end(); ++oe) {
440 if (want_e == want_.end())
446 o != edge->outputs_.end(); ++o) {
456 for (map<Edge*, Want>::const_iterator e = want_.begin(); e != want_.end(); ++e) {
481 e != subproc_to_edge_.end(); ++e)
565 e != active_edges.end(); ++e) {
568 o != (*e)->outputs_.end(); ++o) {
619 n != validation_nodes.end(); ++n) {
790 auto it = std::find_if(content_list.begin(), content_list.end(), [&](const std::string& s) {
793 if (it != content_list.end()) {
839 o != edge->outputs_.end(); ++o) {
923 o != edge->outputs_.end(); ++o) {
963 o != edge->outputs_.end(); ++o) {
988 i != parser.includes_.end(); ++i) {
1023 i != deps.ins_.end(); ++i) {