diff options
author | Andrew Reynolds <andrew.j.reynolds@gmail.com> | 2020-02-26 19:11:31 -0600 |
---|---|---|
committer | GitHub <noreply@github.com> | 2020-02-26 19:11:31 -0600 |
commit | d41d2a817f884e0f6c8d5cb3b87b4298bc1b56f5 (patch) | |
tree | 5cfe4336c5aa40cac613238a2625b1fb4aa55d31 /src/theory/quantifiers/sygus | |
parent | 4b7de240edeee362a0b9ca440c22a8b0744cf34b (diff) |
Initial work towards -Wshadow (#3817)
Diffstat (limited to 'src/theory/quantifiers/sygus')
-rw-r--r-- | src/theory/quantifiers/sygus/cegis_core_connective.cpp | 6 | ||||
-rw-r--r-- | src/theory/quantifiers/sygus/sygus_pbe.cpp | 4 |
2 files changed, 5 insertions, 5 deletions
diff --git a/src/theory/quantifiers/sygus/cegis_core_connective.cpp b/src/theory/quantifiers/sygus/cegis_core_connective.cpp index d1bd5db63..ad281b009 100644 --- a/src/theory/quantifiers/sygus/cegis_core_connective.cpp +++ b/src/theory/quantifiers/sygus/cegis_core_connective.cpp @@ -823,9 +823,9 @@ Node CegisCoreConnective::constructSolutionFromPool(Component& ccheck, // "Let W be a subset of D such that S ^ W is unsat." // and uasserts is set to W. uasserts.clear(); - std::unordered_set<Node, NodeHashFunction> queryAsserts; - queryAsserts.insert(d_sc); - getUnsatCore(checkSc, queryAsserts, uasserts); + std::unordered_set<Node, NodeHashFunction> queryAsserts2; + queryAsserts2.insert(d_sc); + getUnsatCore(checkSc, queryAsserts2, uasserts); falseCore = true; } } diff --git a/src/theory/quantifiers/sygus/sygus_pbe.cpp b/src/theory/quantifiers/sygus/sygus_pbe.cpp index dc290d4ba..7c1451771 100644 --- a/src/theory/quantifiers/sygus/sygus_pbe.cpp +++ b/src/theory/quantifiers/sygus/sygus_pbe.cpp @@ -229,9 +229,9 @@ bool SygusPbe::constructCandidates(const std::vector<Node>& enums, // the lemmas must be guarded by the active guard of the enumerator Node g = d_tds->getActiveGuardForEnumerator(e); Assert(!g.isNull()); - for (unsigned j = 0, size = enum_lems.size(); j < size; j++) + for (unsigned k = 0, size = enum_lems.size(); k < size; k++) { - enum_lems[j] = nm->mkNode(OR, g.negate(), enum_lems[j]); + enum_lems[k] = nm->mkNode(OR, g.negate(), enum_lems[k]); } lems.insert(lems.end(), enum_lems.begin(), enum_lems.end()); } |