12345qiupeng
/
gtsam
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

remove print statements

release/4.3a0
Varun Agrawal 2024-12-16 22:18:12 -05:00
parent 72306efe98
commit 70288bc32a
1 changed files with 0 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gtsam/discrete/TableFactor.cpp
View File

@ -262,8 +262,6 @@ DecisionTreeFactor TableFactor::toDecisionTreeFactor() const {
// k will be in reverse key order already // k will be in reverse key order already
uint64_t k; uint64_t k;
ss >> k; ss >> k;
std::cout << "ss: " << ss.str() << ", k=" << k
<< ", v=" << sparse_table_.coeff(i) << std::endl;
pair_table.push_back(std::make_pair(k, sparse_table_.coeff(i))); pair_table.push_back(std::make_pair(k, sparse_table_.coeff(i)));
} }
@ -273,10 +271,6 @@ DecisionTreeFactor TableFactor::toDecisionTreeFactor() const {
[](const std::pair<uint64_t, double>& a, [](const std::pair<uint64_t, double>& a,
const std::pair<uint64_t, double>& b) { return a.first < b.first; }); const std::pair<uint64_t, double>& b) { return a.first < b.first; });
std::cout << "Sorted pair_table:" << std::endl;
for (auto&& [k, v] : pair_table) {
std::cout << "k=" << k << ", v=" << v << std::endl;
}
// Create the table vector // Create the table vector
std::vector<double> table; std::vector<double> table;
std::for_each(pair_table.begin(), pair_table.end(), std::for_each(pair_table.begin(), pair_table.end(),