summaryrefslogtreecommitdiff
path: root/src/theory/arith/nl/nl_model.cpp
diff options
context:
space:
mode:
authorMathias Preiner <mathias.preiner@gmail.com>2021-05-12 23:33:00 -0700
committerGitHub <noreply@github.com>2021-05-13 06:33:00 +0000
commit31242de4b423d7225174dd1672edb2dacb68f5b8 (patch)
tree657a453475affc67628b1391909af92f3346b411 /src/theory/arith/nl/nl_model.cpp
parentffd7bb2069df08c31fd9d8a03d786f1e9fc7147c (diff)
Add std::hash overloads for Node, TNode and TypeNode. (#6534)
Eliminates NodeHashFunction, TNodeHashFunction and TypeNodeHashFunction.
Diffstat (limited to 'src/theory/arith/nl/nl_model.cpp')
-rw-r--r--src/theory/arith/nl/nl_model.cpp8
1 files changed, 4 insertions, 4 deletions
diff --git a/src/theory/arith/nl/nl_model.cpp b/src/theory/arith/nl/nl_model.cpp
index 9b1246f67..ed4a5318f 100644
--- a/src/theory/arith/nl/nl_model.cpp
+++ b/src/theory/arith/nl/nl_model.cpp
@@ -242,7 +242,7 @@ bool NlModel::checkModel(const std::vector<Node>& assertions,
// all remaining variables are constrained to their exact model values
Trace("nl-ext-cm-debug") << " set exact bounds for remaining variables..."
<< std::endl;
- std::unordered_set<TNode, TNodeHashFunction> visited;
+ std::unordered_set<TNode> visited;
std::vector<TNode> visit;
TNode cur;
for (const Node& a : assertions)
@@ -479,10 +479,10 @@ bool NlModel::solveEqualitySimple(Node eq,
NodeManager* nm = NodeManager::currentNM();
// the list of variables that occur as a monomial in msum, and whose value
// is so far unconstrained in the model.
- std::unordered_set<Node, NodeHashFunction> unc_vars;
+ std::unordered_set<Node> unc_vars;
// the list of variables that occur as a factor in a monomial, and whose
// value is so far unconstrained in the model.
- std::unordered_set<Node, NodeHashFunction> unc_vars_factor;
+ std::unordered_set<Node> unc_vars_factor;
for (std::pair<const Node, Node>& m : msum)
{
Node v = m.first;
@@ -797,7 +797,7 @@ bool NlModel::simpleCheckModelLit(Node lit)
Trace("nl-ext-cms-debug")
<< "* Try univariate quadratic analysis..." << std::endl;
std::vector<Node> vs_invalid;
- std::unordered_set<Node, NodeHashFunction> vs;
+ std::unordered_set<Node> vs;
std::map<Node, Node> v_a;
std::map<Node, Node> v_b;
// get coefficients...
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback