84     return Predecessors[Node].begin();  in pred_begin()
93     return PredClosure[Node].begin();  in pred_closure_begin()
102     return Successors[Node].begin();  in succ_begin()
111     return SuccClosure[Node].begin();  in succ_closure_begin()
128       for (changeset_ty::const_iterator it = S.begin(), ie = S.end(); it != ie;  in ExecuteOneTest()
184   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
189   for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(),  in DAGDeltaAlgorithmImpl()
196   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
202   std::vector<change_ty> Worklist(Roots.begin(), Roots.end());  in DAGDeltaAlgorithmImpl()
211       SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end());  in DAGDeltaAlgorithmImpl()
217   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
220   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
230     for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end();  in DAGDeltaAlgorithmImpl()
232       if (it != Changes.begin())  in DAGDeltaAlgorithmImpl()
250     for (std::vector<change_ty>::const_iterator it = Roots.begin(),  in DAGDeltaAlgorithmImpl()
253       if (it != Roots.begin())  in DAGDeltaAlgorithmImpl()
260     for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end();  in DAGDeltaAlgorithmImpl()
274     for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end();  in DAGDeltaAlgorithmImpl()
294   Extended.insert(Changes.begin(), Changes.end());  in GetTestResult()
295   for (changeset_ty::const_iterator it = Changes.begin(),  in GetTestResult()
312   changeset_ty CurrentSet(Roots.begin(), Roots.end());  in Run()
339     Required.insert(CurrentMinSet.begin(), CurrentMinSet.end());  in Run()
344     for (changeset_ty::const_iterator it = CurrentMinSet.begin(),  in Run()