diff options
| author | Mathias Preiner <mathias.preiner@gmail.com> | 2021-05-12 23:33:00 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-05-13 06:33:00 +0000 |
| commit | 31242de4b423d7225174dd1672edb2dacb68f5b8 (patch) | |
| tree | 657a453475affc67628b1391909af92f3346b411 /src/theory/strings/arith_entail.cpp | |
| parent | ffd7bb2069df08c31fd9d8a03d786f1e9fc7147c (diff) | |
Add std::hash overloads for Node, TNode and TypeNode. (#6534)
Eliminates NodeHashFunction, TNodeHashFunction and TypeNodeHashFunction.
Diffstat (limited to 'src/theory/strings/arith_entail.cpp')
| -rw-r--r-- | src/theory/strings/arith_entail.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/theory/strings/arith_entail.cpp b/src/theory/strings/arith_entail.cpp index 9c9adf99e..4c3b2f17e 100644 --- a/src/theory/strings/arith_entail.cpp +++ b/src/theory/strings/arith_entail.cpp @@ -131,7 +131,7 @@ bool ArithEntail::checkApprox(Node ar) // c.isNull() means c = 1 bool isOverApprox = !c.isNull() && c.getConst<Rational>().sgn() == -1; std::vector<Node>& approx = mApprox[v]; - std::unordered_set<Node, NodeHashFunction> visited; + std::unordered_set<Node> visited; std::vector<Node> toProcess; toProcess.push_back(v); do @@ -561,7 +561,7 @@ bool ArithEntail::checkWithEqAssumption(Node assumption, Node a, bool strict) << ", strict=" << strict << std::endl; // Find candidates variables to compute substitutions for - std::unordered_set<Node, NodeHashFunction> candVars; + std::unordered_set<Node> candVars; std::vector<Node> toVisit = {assumption}; while (!toVisit.empty()) { |