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