25 // the required set, we no longer consider them for elimination. For strictly
28 // this by allowing the required set to be minimized as well, but need more test
118                           const changeset_ty &Required) {  in UpdatedSearchState()  argument
119     DDA.UpdatedSearchState(Changes, Sets, Required);  in UpdatedSearchState()
143   /// \p Required changes from the cache, executing the test if necessary.
147   /// \param Required - The set of changes which have previously been
148   /// established to be required.
150   bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
157   const changeset_ty &Required;  member in __anon988b2cab0111::DeltaActiveSetHelper
163     DDAI.UpdatedSearchState(Changes, Sets, Required);  in UpdatedSearchState()
167     return DDAI.GetTestResult(S, Required);  in ExecuteOneTest()
172                        const changeset_ty &Required)  in DeltaActiveSetHelper()  argument
173       : DDAI(DDAI), Required(Required) {}  in DeltaActiveSetHelper()
284                                           const changeset_ty &Required) {  in GetTestResult()  argument
285   changeset_ty Extended(Required);  in GetTestResult()
305   // The set of required changes.  in Run()
306   changeset_ty Required;  in Run()  local
311   // Invariant:  CurrentSet intersect Required == {}  in Run()
312   // Invariant:  Required == (Required union succ*(Required))  in Run()
316                    << Required.size() << " required changes\n";  in Run()
320     DeltaActiveSetHelper Helper(*this, Required);  in Run()
323     // Update the set of required changes. Since  in Run()
326     //   succ(CurrentSet) subset Required  in Run()
328     //   succ(CurrentMinSet) subset Required  in Run()
329     // and our invariant on Required is maintained.  in Run()
330     Required.insert(CurrentMinSet.begin(), CurrentMinSet.end());  in Run()
338     // FIXME: We could enforce CurrentSet intersect Required == {} here if we  in Run()
342   return Required;  in Run()