Lines Matching defs:Changes
64 const changeset_ty &Changes;
119 void UpdatedSearchState(const changeset_ty &Changes,
122 DDA.UpdatedSearchState(Changes, Sets, Required);
146 /// GetTestResult - Get the test result for the active set \p Changes with
149 /// \param Changes - The set of active changes being minimized, which should
154 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
165 virtual void UpdatedSearchState(const changeset_ty &Changes,
167 DDAI.UpdatedSearchState(Changes, Sets, Required);
187 Changes(_Changes),
190 for (changeset_ty::const_iterator it = Changes.begin(),
191 ie = Changes.end(); it != ie; ++it) {
202 for (changeset_ty::const_iterator it = Changes.begin(),
203 ie = Changes.end(); it != ie; ++it)
223 for (changeset_ty::const_iterator it = Changes.begin(),
224 ie = Changes.end(); it != ie; ++it)
226 for (changeset_ty::const_iterator it = Changes.begin(),
227 ie = Changes.end(); it != ie; ++it)
235 llvm::errs() << "Changes: [";
236 for (changeset_ty::const_iterator it = Changes.begin(),
237 ie = Changes.end(); it != ie; ++it) {
238 if (it != Changes.begin()) llvm::errs() << ", ";
262 for (changeset_ty::const_iterator it = Changes.begin(),
263 ie = Changes.end(); it != ie; ++it) {
274 for (changeset_ty::const_iterator it = Changes.begin(),
275 ie = Changes.end(); it != ie; ++it) {
289 bool DAGDeltaAlgorithmImpl::GetTestResult(const changeset_ty &Changes,
292 Extended.insert(Changes.begin(), Changes.end());
293 for (changeset_ty::const_iterator it = Changes.begin(),
294 ie = Changes.end(); it != ie; ++it)
357 DAGDeltaAlgorithm::Run(const changeset_ty &Changes,
359 return DAGDeltaAlgorithmImpl(*this, Changes, Dependencies).Run();