Lines Matching refs:Required
26 // the required set, we no longer consider them for elimination. For strictly
29 // this by allowing the required set to be minimized as well, but need more test
121 const changeset_ty &Required) {
122 DDA.UpdatedSearchState(Changes, Sets, Required);
147 /// \p Required changes from the cache, executing the test if necessary.
151 /// \param Required - The set of changes which have previously been
152 /// established to be required.
154 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
161 const changeset_ty &Required;
167 DDAI.UpdatedSearchState(Changes, Sets, Required);
171 return DDAI.GetTestResult(S, Required);
177 : DDAI(_DDAI), Required(_Required) {}
290 const changeset_ty &Required) {
291 changeset_ty Extended(Required);
312 // The set of required changes.
313 changeset_ty Required;
318 // Invariant: CurrentSet intersect Required == {}
319 // Invariant: Required == (Required union succ*(Required))
323 << Required.size() << " required changes\n";
327 DeltaActiveSetHelper Helper(*this, Required);
330 // Update the set of required changes. Since
333 // succ(CurrentSet) subset Required
335 // succ(CurrentMinSet) subset Required
336 // and our invariant on Required is maintained.
337 Required.insert(CurrentMinSet.begin(), CurrentMinSet.end());
346 // FIXME: We could enforce CurrentSet intersect Required == {} here if we
350 return Required;
