Lines Matching full:sets

44                       const changesetlist_ty &Sets) {
46   UpdatedSearchState(Changes, Sets);
49   if (Sets.size() <= 1)
54   if (Search(Changes, Sets, Res))
57   // Otherwise, partition the sets if possible; if not we are done.
59   for (const changeset_ty &Set : Sets)
61   if (SplitSets.size() == Sets.size())
68                             const changesetlist_ty &Sets,
71   for (changesetlist_ty::const_iterator it = Sets.begin(),
72          ie = Sets.end(); it != ie; ++it) {
75       changesetlist_ty Sets;
76       Split(*it, Sets);
77       Res = Delta(*it, Sets);
81     // Otherwise, if we have more than two sets, see if test passes on the
83     if (Sets.size() > 2) {
91         ComplementSets.insert(ComplementSets.end(), Sets.begin(), it);
92         ComplementSets.insert(ComplementSets.end(), it + 1, Sets.end());
108   changesetlist_ty Sets;
109   Split(Changes, Sets);
111   return Delta(Changes, Sets);