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/uf/eq_proof.h | |
| parent | ffd7bb2069df08c31fd9d8a03d786f1e9fc7147c (diff) | |
Add std::hash overloads for Node, TNode and TypeNode. (#6534)
Eliminates NodeHashFunction, TNodeHashFunction and TypeNodeHashFunction.
Diffstat (limited to 'src/theory/uf/eq_proof.h')
| -rw-r--r-- | src/theory/uf/eq_proof.h | 13 |
1 files changed, 6 insertions, 7 deletions
diff --git a/src/theory/uf/eq_proof.h b/src/theory/uf/eq_proof.h index c938c8d9d..3179da592 100644 --- a/src/theory/uf/eq_proof.h +++ b/src/theory/uf/eq_proof.h @@ -88,10 +88,9 @@ class EqProof * equalities) * @return the node that is the conclusion of the proof as added to p. */ - Node addToProof( - CDProof* p, - std::unordered_map<Node, Node, NodeHashFunction>& visited, - std::unordered_set<Node, NodeHashFunction>& assumptions) const; + Node addToProof(CDProof* p, + std::unordered_map<Node, Node>& visited, + std::unordered_set<Node>& assumptions) const; /** Removes all reflexivity steps, i.e. (= t t), from premises. */ void cleanReflPremises(std::vector<Node>& premises) const; @@ -173,7 +172,7 @@ class EqProof Node conclusion, std::vector<Node>& premises, CDProof* p, - std::unordered_set<Node, NodeHashFunction>& assumptions) const; + std::unordered_set<Node>& assumptions) const; /** Expand coarse-grained transitivity steps for theory disequalities * @@ -347,8 +346,8 @@ class EqProof Node conclusion, std::vector<std::vector<Node>>& transitivityMatrix, CDProof* p, - std::unordered_map<Node, Node, NodeHashFunction>& visited, - std::unordered_set<Node, NodeHashFunction>& assumptions, + std::unordered_map<Node, Node>& visited, + std::unordered_set<Node>& assumptions, bool isNary) const; }; /* class EqProof */ |