summaryrefslogtreecommitdiff
path: root/src/smt/smt_engine.cpp
diff options
context:
space:
mode:
authorTim King <taking@cs.nyu.edu>2013-11-19 20:57:15 -0500
committerTim King <taking@cs.nyu.edu>2013-11-20 15:37:18 -0500
commitbd8e9319aab69db90692f72bc52288329879eefc (patch)
tree7bfee530c06836827378fd5b9bd1f47bb4f1eea1 /src/smt/smt_engine.cpp
parentf806a8eedf01753116c225b4c1a5e29543fda370 (diff)
Changing the number of bits allocated per field in node values.
Diffstat (limited to 'src/smt/smt_engine.cpp')
-rw-r--r--src/smt/smt_engine.cpp8
1 files changed, 5 insertions, 3 deletions
diff --git a/src/smt/smt_engine.cpp b/src/smt/smt_engine.cpp
index 0cfb674cf..21f2d9209 100644
--- a/src/smt/smt_engine.cpp
+++ b/src/smt/smt_engine.cpp
@@ -369,7 +369,7 @@ private:
// trace nodes back to their assertions using CircuitPropagator's BackEdgesMap
void traceBackToAssertions(const std::vector<Node>& nodes, std::vector<TNode>& assertions);
// remove conjuncts in toRemove from conjunction n; return # of removed conjuncts
- size_t removeFromConjunction(Node& n, const std::hash_set<unsigned>& toRemove);
+ size_t removeFromConjunction(Node& n, const std::hash_set<unsigned long>& toRemove);
// scrub miplib encodings
void doMiplibTrick();
@@ -408,6 +408,8 @@ public:
{
d_smt.d_nodeManager->subscribeEvents(this);
d_true = NodeManager::currentNM()->mkConst(true);
+
+ Chat() << "NodeValue width" << sizeof(expr::NodeValue) << std::endl;
}
~SmtEnginePrivate() {
@@ -2120,7 +2122,7 @@ void SmtEnginePrivate::traceBackToAssertions(const std::vector<Node>& nodes, std
}
}
-size_t SmtEnginePrivate::removeFromConjunction(Node& n, const std::hash_set<unsigned>& toRemove) {
+size_t SmtEnginePrivate::removeFromConjunction(Node& n, const std::hash_set<unsigned long>& toRemove) {
Assert(n.getKind() == kind::AND);
size_t removals = 0;
for(Node::iterator j = n.begin(); j != n.end(); ++j) {
@@ -2175,7 +2177,7 @@ void SmtEnginePrivate::doMiplibTrick() {
Assert(!options::incrementalSolving());
const booleans::CircuitPropagator::BackEdgesMap& backEdges = d_propagator.getBackEdges();
- hash_set<unsigned> removeAssertions;
+ hash_set<unsigned long> removeAssertions;
NodeManager* nm = NodeManager::currentNM();
Node zero = nm->mkConst(Rational(0)), one = nm->mkConst(Rational(1));
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback