83     return Predecessors[Node].begin();  in pred_begin()
92     return PredClosure[Node].begin();  in pred_closure_begin()
101     return Successors[Node].begin();  in succ_begin()
110     return SuccClosure[Node].begin();  in succ_closure_begin()
127       for (changeset_ty::const_iterator it = S.begin(), ie = S.end(); it != ie;  in ExecuteOneTest()
183   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
188   for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(),  in DAGDeltaAlgorithmImpl()
195   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
201   std::vector<change_ty> Worklist(Roots.begin(), Roots.end());  in DAGDeltaAlgorithmImpl()
210       SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end());  in DAGDeltaAlgorithmImpl()
216   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
219   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
229     for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end();  in DAGDeltaAlgorithmImpl()
231       if (it != Changes.begin())  in DAGDeltaAlgorithmImpl()
249     for (std::vector<change_ty>::const_iterator it = Roots.begin(),  in DAGDeltaAlgorithmImpl()
252       if (it != Roots.begin())  in DAGDeltaAlgorithmImpl()
259     for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end();  in DAGDeltaAlgorithmImpl()
273     for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end();  in DAGDeltaAlgorithmImpl()
293   Extended.insert(Changes.begin(), Changes.end());  in GetTestResult()
294   for (changeset_ty::const_iterator it = Changes.begin(),  in GetTestResult()
311   changeset_ty CurrentSet(Roots.begin(), Roots.end());  in Run()
338     Required.insert(CurrentMinSet.begin(), CurrentMinSet.end());  in Run()
343     for (changeset_ty::const_iterator it = CurrentMinSet.begin(),  in Run()