diff options
| author | Dejan Jovanović <dejan.jovanovic@gmail.com> | 2011-03-22 02:11:09 +0000 |
|---|---|---|
| committer | Dejan Jovanović <dejan.jovanovic@gmail.com> | 2011-03-22 02:11:09 +0000 |
| commit | 74084011310e0af055c0055378620a5d19de1e52 (patch) | |
| tree | a169dcaac2c5b0581145aee4444823a6d6d2d678 /src/theory/bv/cd_set_collection.h | |
| parent | 75adfe4e8ef1fab4b9cd4c31d40c15e9a1637a5e (diff) | |
updating debug output usage to eliviate impact of bug 252
Diffstat (limited to 'src/theory/bv/cd_set_collection.h')
| -rw-r--r-- | src/theory/bv/cd_set_collection.h | 9 |
1 files changed, 5 insertions, 4 deletions
diff --git a/src/theory/bv/cd_set_collection.h b/src/theory/bv/cd_set_collection.h index d020ef362..217ebadcd 100644 --- a/src/theory/bv/cd_set_collection.h +++ b/src/theory/bv/cd_set_collection.h @@ -9,6 +9,7 @@ #include <iostream> #include "context/cdo.h" +#include "theory/bv/theory_bv_utils.h" namespace CVC4 { namespace context { @@ -50,7 +51,7 @@ class BacktrackableSetCollection { while (d_nodesInserted < d_memory.size()) { const tree_entry_type& node = d_memory.back(); - Debug("cd_set_collection") << "BacktrackableSetCollection::backtrack(): removing " << node.getValue() + BVDebug("cd_set_collection") << "BacktrackableSetCollection::backtrack(): removing " << node.getValue() << " from " << internalToString(getRoot(d_memory.size()-1)) << std::endl; if (node.hasParent()) { @@ -256,7 +257,7 @@ public: // Find the biggest node smaleer than value (it must exist) while (set != null) { - Debug("set_collection") << "BacktrackableSetCollection::getPrev(" << toString(set) << "," << value << ")" << std::endl; + BVDebug("set_collection") << "BacktrackableSetCollection::getPrev(" << toString(set) << "," << value << ")" << std::endl; const tree_entry_type& node = d_memory[set]; if (node.getValue() >= value) { // If the node is bigger than the value, we need a smaller one @@ -283,7 +284,7 @@ public: // Find the smallest node bigger than value (it must exist) while (set != null) { - Debug("set_collection") << "BacktrackableSetCollection::getNext(" << toString(set) << "," << value << ")" << std::endl; + BVDebug("set_collection") << "BacktrackableSetCollection::getNext(" << toString(set) << "," << value << ")" << std::endl; const tree_entry_type& node = d_memory[set]; if (node.getValue() <= value) { // If the node is smaller than the value, we need a bigger one @@ -350,7 +351,7 @@ public: backtrack(); Assert(isValid(set)); - Debug("set_collection") << "BacktrackableSetCollection::getElements(" << toString(set) << "," << lowerBound << "," << upperBound << ")" << std::endl; + BVDebug("set_collection") << "BacktrackableSetCollection::getElements(" << toString(set) << "," << lowerBound << "," << upperBound << ")" << std::endl; // Empty set no elements if (set == null) { |