34   for (changeset_ty::const_iterator it = S.begin(),  in Split()  local
35          ie = S.end(); it != ie; ++it, ++idx)  in Split()
36     ((idx < N) ? LHS : RHS).insert(*it);  in Split()
60   for (changesetlist_ty::const_iterator it = Sets.begin(),  in Delta()  local
61          ie = Sets.end(); it != ie; ++it)  in Delta()
62     Split(*it, SplitSets);  in Delta()
73   for (changesetlist_ty::const_iterator it = Sets.begin(),  in Search()  local
74          ie = Sets.end(); it != ie; ++it) {  in Search()
76     if (GetTestResult(*it)) {  in Search()
78       Split(*it, Sets);  in Search()
79       Res = Delta(*it, Sets);  in Search()
89         Changes.begin(), Changes.end(), it->begin(), it->end(),  in Search()
93         ComplementSets.insert(ComplementSets.end(), Sets.begin(), it);  in Search()
94         ComplementSets.insert(ComplementSets.end(), it + 1, Sets.end());  in Search()