summaryrefslogtreecommitdiff
path: root/src/theory/bv/bv_solver_simple.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/bv/bv_solver_simple.cpp
parentffd7bb2069df08c31fd9d8a03d786f1e9fc7147c (diff)
Add std::hash overloads for Node, TNode and TypeNode. (#6534)
Eliminates NodeHashFunction, TNodeHashFunction and TypeNodeHashFunction.
Diffstat (limited to 'src/theory/bv/bv_solver_simple.cpp')
-rw-r--r--src/theory/bv/bv_solver_simple.cpp6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/theory/bv/bv_solver_simple.cpp b/src/theory/bv/bv_solver_simple.cpp
index 52f5d52ac..3faad29a9 100644
--- a/src/theory/bv/bv_solver_simple.cpp
+++ b/src/theory/bv/bv_solver_simple.cpp
@@ -38,10 +38,10 @@ bool isBVAtom(TNode n)
}
/* Traverse Boolean nodes and collect BV atoms. */
-void collectBVAtoms(TNode n, std::unordered_set<Node, NodeHashFunction>& atoms)
+void collectBVAtoms(TNode n, std::unordered_set<Node>& atoms)
{
std::vector<TNode> visit;
- std::unordered_set<TNode, TNodeHashFunction> visited;
+ std::unordered_set<TNode> visited;
visit.push_back(n);
@@ -138,7 +138,7 @@ bool BVSolverSimple::preNotifyFact(
d_im.trustedLemma(tlem, InferenceId::BV_SIMPLE_LEMMA);
}
- std::unordered_set<Node, NodeHashFunction> bv_atoms;
+ std::unordered_set<Node> bv_atoms;
collectBVAtoms(n, bv_atoms);
for (const Node& nn : bv_atoms)
{
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback