diff options
| author | Liana Hadarean <lianahady@gmail.com> | 2013-04-16 11:17:36 -0400 |
|---|---|---|
| committer | lianah <lianahady@gmail.com> | 2013-04-30 15:54:24 -0400 |
| commit | cf99724618884765ce692cec8916d80607de4026 (patch) | |
| tree | d80b5851d897942a53aec6011b95a4c443c0861e | |
| parent | 95a876e4931b94ab97ff40988ce23e34a046387d (diff) | |
fixed compile error
| -rw-r--r-- | src/theory/bv/bv_to_bool.cpp | 4 | ||||
| -rw-r--r-- | src/theory/bv/bv_to_bool.h | 2 | ||||
| -rw-r--r-- | src/theory/theory_engine.cpp | 2 | ||||
| -rw-r--r-- | src/theory/theory_engine.h | 2 |
4 files changed, 5 insertions, 5 deletions
diff --git a/src/theory/bv/bv_to_bool.cpp b/src/theory/bv/bv_to_bool.cpp index 7d3f58c8e..44c4bd021 100644 --- a/src/theory/bv/bv_to_bool.cpp +++ b/src/theory/bv/bv_to_bool.cpp @@ -241,7 +241,7 @@ bool BvToBoolPreprocessor::matchesBooleanPatern(TNode current) { } -void BvToBoolPreprocessor::liftBoolToBV(const std::vector<TNode>& assertions, std::vector<Node>& new_assertions) { +void BvToBoolPreprocessor::liftBoolToBV(const std::vector<Node>& assertions, std::vector<Node>& new_assertions) { TNodeNodeMap candidates; for (unsigned i = 0; i < assertions.size(); ++i) { if (matchesBooleanPatern(assertions[i])) { @@ -249,7 +249,7 @@ void BvToBoolPreprocessor::liftBoolToBV(const std::vector<TNode>& assertions, st TNode bv_var = assertion[0][0]; Assert (bv_var.getKind() == kind::VARIABLE && bv_var.getType().isBitVector() && - bv_bar.getType().getBitVectorSize() == 1); + bv_var.getType().getBitVectorSize() == 1); TNode bool_cond = assertion[1]; Assert (bool_cond.getType().isBoolean()); if (candidates.find(bv_var) == candidates.end()) { diff --git a/src/theory/bv/bv_to_bool.h b/src/theory/bv/bv_to_bool.h index 9b1534b41..39c6b4251 100644 --- a/src/theory/bv/bv_to_bool.h +++ b/src/theory/bv/bv_to_bool.h @@ -65,7 +65,7 @@ public: BvToBoolPreprocessor() {} ~BvToBoolPreprocessor() {} - void liftBoolToBV(const std::vector<TNode>& assertions, std::vector<Node>& new_assertions); + void liftBoolToBV(const std::vector<Node>& assertions, std::vector<Node>& new_assertions); }; diff --git a/src/theory/theory_engine.cpp b/src/theory/theory_engine.cpp index 8c430d6d4..22a0b00ed 100644 --- a/src/theory/theory_engine.cpp +++ b/src/theory/theory_engine.cpp @@ -1277,7 +1277,7 @@ void TheoryEngine::conflict(TNode conflict, TheoryId theoryId) { } } -void TheoryEngine::ppBvToBool(const std::vector<TNode>& assertions, std::vector<Node> new_assertions) { +void TheoryEngine::ppBvToBool(const std::vector<Node>& assertions, std::vector<Node> new_assertions) { d_bvToBoolPreprocessor.liftBoolToBV(assertions, new_assertions); } diff --git a/src/theory/theory_engine.h b/src/theory/theory_engine.h index d581aeda2..6d355ccce 100644 --- a/src/theory/theory_engine.h +++ b/src/theory/theory_engine.h @@ -753,7 +753,7 @@ private: theory::bv::BvToBoolPreprocessor d_bvToBoolPreprocessor; public: - void ppBvToBool(const std::vector<TNode>& assertions, std::vector<Node> new_assertions); + void ppBvToBool(const std::vector<Node>& assertions, std::vector<Node> new_assertions); Node ppSimpITE(TNode assertion); void ppUnconstrainedSimp(std::vector<Node>& assertions); |