Lines Matching full:required

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
117                           const changeset_ty &Required) {
118     DDA.UpdatedSearchState(Changes, Sets, Required);
142   /// \p Required changes from the cache, executing the test if necessary.
146   /// \param Required - The set of changes which have previously been
147   /// established to be required.
149   bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
156   const changeset_ty &Required;
162     DDAI.UpdatedSearchState(Changes, Sets, Required);
166     return DDAI.GetTestResult(S, Required);
171                        const changeset_ty &Required)
172       : DDAI(DDAI), Required(Required) {}
283                                           const changeset_ty &Required) {
284   changeset_ty Extended(Required);
304   // The set of required changes.
305   changeset_ty Required;
310   // Invariant:  CurrentSet intersect Required == {}
311   // Invariant:  Required == (Required union succ*(Required))
315                    << Required.size() << " required changes\n";
319     DeltaActiveSetHelper Helper(*this, Required);
322     // Update the set of required changes. Since
325     //   succ(CurrentSet) subset Required
327     //   succ(CurrentMinSet) subset Required
328     // and our invariant on Required is maintained.
329     Required.insert(CurrentMinSet.begin(), CurrentMinSet.end());
337     // FIXME: We could enforce CurrentSet intersect Required == {} here if we
341   return Required;