diff options
author | Tim King <taking@cs.nyu.edu> | 2013-02-14 16:11:42 -0500 |
---|---|---|
committer | Tim King <taking@cs.nyu.edu> | 2013-02-14 16:11:42 -0500 |
commit | fc4121b761dd524ad5fe37789381e5814737e6b9 (patch) | |
tree | fec292ebddd652d5938c7e9f266b52a4770bfae1 /src/theory/bv/cd_set_collection.h | |
parent | 63ca7c0a10dcd6b3be42d4d513f842db76733392 (diff) |
Removing BVDebug and replacing with Debug.
Diffstat (limited to 'src/theory/bv/cd_set_collection.h')
-rw-r--r-- | src/theory/bv/cd_set_collection.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/theory/bv/cd_set_collection.h b/src/theory/bv/cd_set_collection.h index e4bcbca47..ec7f6d66d 100644 --- a/src/theory/bv/cd_set_collection.h +++ b/src/theory/bv/cd_set_collection.h @@ -71,7 +71,7 @@ class BacktrackableSetCollection { const tree_entry_type& node = d_memory.back(); if(Debug.isOn("cd_set_collection")) { - BVDebug("cd_set_collection") << "BacktrackableSetCollection::backtrack(): removing " << node.getValue() + Debug("cd_set_collection") << "BacktrackableSetCollection::backtrack(): removing " << node.getValue() << " from " << internalToString(getRoot(d_memory.size()-1)) << std::endl; } @@ -279,7 +279,7 @@ public: // Find the biggest node smaleer than value (it must exist) while (set != null) { if(Debug.isOn("set_collection")) { - BVDebug("set_collection") << "BacktrackableSetCollection::getPrev(" << toString(set) << "," << value << ")" << std::endl; + Debug("set_collection") << "BacktrackableSetCollection::getPrev(" << toString(set) << "," << value << ")" << std::endl; } const tree_entry_type& node = d_memory[set]; if (node.getValue() >= value) { @@ -308,7 +308,7 @@ public: // Find the smallest node bigger than value (it must exist) while (set != null) { if(Debug.isOn("set_collection")) { - BVDebug("set_collection") << "BacktrackableSetCollection::getNext(" << toString(set) << "," << value << ")" << std::endl; + Debug("set_collection") << "BacktrackableSetCollection::getNext(" << toString(set) << "," << value << ")" << std::endl; } const tree_entry_type& node = d_memory[set]; if (node.getValue() <= value) { @@ -377,7 +377,7 @@ public: Assert(isValid(set)); if(Debug.isOn("set_collection")) { - BVDebug("set_collection") << "BacktrackableSetCollection::getElements(" << toString(set) << "," << lowerBound << "," << upperBound << ")" << std::endl; + Debug("set_collection") << "BacktrackableSetCollection::getElements(" << toString(set) << "," << lowerBound << "," << upperBound << ")" << std::endl; } // Empty set no elements |