summaryrefslogtreecommitdiff
path: root/src/expr/node.cpp
diff options
context:
space:
mode:
authorDejan Jovanović <dejan.jovanovic@gmail.com>2010-02-12 01:07:22 +0000
committerDejan Jovanović <dejan.jovanovic@gmail.com>2010-02-12 01:07:22 +0000
commit8316697801a73a14a2fe3845e0d0f5add63a18be (patch)
tree4b50ab2a0f9fa8e3d95e3c72e26eca17e29019c6 /src/expr/node.cpp
parentced51432b424f23e9ecea71566777bcd4e042800 (diff)
Changes to hashing that solve the xinetd boolean benchmark in 14s (from ~25min). Switched to standard hash_set, hash_map, new hash for the vector of node values (from boost), changed the hash for nodes to be over id's, all the hash values are now size_t. The parser is down from 11s to 10s on the benchmark, so most of the solve time is parsing and we need to figure this out.
Diffstat (limited to 'src/expr/node.cpp')
-rw-r--r--src/expr/node.cpp5
1 files changed, 0 insertions, 5 deletions
diff --git a/src/expr/node.cpp b/src/expr/node.cpp
index 6f1c525ca..f3115b17e 100644
--- a/src/expr/node.cpp
+++ b/src/expr/node.cpp
@@ -96,11 +96,6 @@ Node& Node::operator=(const Node& e) {
return *this;
}
-uint64_t Node::hash() const {
- Assert(d_ev != NULL, "Expecting a non-NULL expression value!");
- return d_ev->hash();
-}
-
Node Node::eqExpr(const Node& right) const {
return NodeManager::currentNM()->mkNode(EQUAL, *this, right);
}
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback