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/prop/skolem_def_manager.cpp | |
parent | ffd7bb2069df08c31fd9d8a03d786f1e9fc7147c (diff) |
Add std::hash overloads for Node, TNode and TypeNode. (#6534)
Eliminates NodeHashFunction, TNodeHashFunction and TypeNodeHashFunction.
Diffstat (limited to 'src/prop/skolem_def_manager.cpp')
-rw-r--r-- | src/prop/skolem_def_manager.cpp | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/src/prop/skolem_def_manager.cpp b/src/prop/skolem_def_manager.cpp index 873a748ae..5b51d730c 100644 --- a/src/prop/skolem_def_manager.cpp +++ b/src/prop/skolem_def_manager.cpp @@ -52,7 +52,7 @@ void SkolemDefManager::notifyAsserted(TNode literal, std::vector<TNode>& activatedSkolems, bool useDefs) { - std::unordered_set<Node, NodeHashFunction> skolems; + std::unordered_set<Node> skolems; getSkolems(literal, skolems); for (const Node& k : skolems) { @@ -90,8 +90,8 @@ typedef expr::Attribute<HasSkolemComputedTag, bool> HasSkolemComputedAttr; bool SkolemDefManager::hasSkolems(TNode n) const { - std::unordered_set<TNode, TNodeHashFunction> visited; - std::unordered_set<TNode, TNodeHashFunction>::iterator it; + std::unordered_set<TNode> visited; + std::unordered_set<TNode>::iterator it; std::vector<TNode> visit; TNode cur; visit.push_back(n); @@ -145,11 +145,11 @@ bool SkolemDefManager::hasSkolems(TNode n) const return n.getAttribute(HasSkolemAttr()); } -void SkolemDefManager::getSkolems( - TNode n, std::unordered_set<Node, NodeHashFunction>& skolems) const +void SkolemDefManager::getSkolems(TNode n, + std::unordered_set<Node>& skolems) const { - std::unordered_set<TNode, TNodeHashFunction> visited; - std::unordered_set<TNode, TNodeHashFunction>::iterator it; + std::unordered_set<TNode> visited; + std::unordered_set<TNode>::iterator it; std::vector<TNode> visit; TNode cur; visit.push_back(n); |