35   for (changeset_ty::const_iterator it = S.begin(),  in Split()  local
36          ie = S.end(); it != ie; ++it, ++idx)  in Split()
37     ((idx < N) ? LHS : RHS).insert(*it);  in Split()
61   for (changesetlist_ty::const_iterator it = Sets.begin(),  in Delta()  local
62          ie = Sets.end(); it != ie; ++it)  in Delta()
63     Split(*it, SplitSets);  in Delta()
74   for (changesetlist_ty::const_iterator it = Sets.begin(),  in Search()  local
75          ie = Sets.end(); it != ie; ++it) {  in Search()
77     if (GetTestResult(*it)) {  in Search()
79       Split(*it, Sets);  in Search()
80       Res = Delta(*it, Sets);  in Search()
90         Changes.begin(), Changes.end(), it->begin(), it->end(),  in Search()
94         ComplementSets.insert(ComplementSets.end(), Sets.begin(), it);  in Search()
95         ComplementSets.insert(ComplementSets.end(), it + 1, Sets.end());  in Search()