Lines Matching defs:Sets
45 const changesetlist_ty &Sets) {
47 UpdatedSearchState(Changes, Sets);
50 if (Sets.size() <= 1)
55 if (Search(Changes, Sets, Res))
58 // Otherwise, partition the sets if possible; if not we are done.
60 for (changesetlist_ty::const_iterator it = Sets.begin(),
61 ie = Sets.end(); it != ie; ++it)
63 if (SplitSets.size() == Sets.size())
70 const changesetlist_ty &Sets,
73 for (changesetlist_ty::const_iterator it = Sets.begin(),
74 ie = Sets.end(); it != ie; ++it) {
77 changesetlist_ty Sets;
78 Split(*it, Sets);
79 Res = Delta(*it, Sets);
83 // Otherwise, if we have more than two sets, see if test passes on the
85 if (Sets.size() > 2) {
93 ComplementSets.insert(ComplementSets.end(), Sets.begin(), it);
94 ComplementSets.insert(ComplementSets.end(), it + 1, Sets.end());
110 changesetlist_ty Sets;
111 Split(Changes, Sets);
113 return Delta(Changes, Sets);
