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

make MinHeap more efficient by calling push_heap instead of make_heap

release/4.3a0
Varun Agrawal 2024-11-06 19:23:26 -05:00
parent 9666725473
commit ae43b2ade7
1 changed files with 9 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
gtsam/discrete/DecisionTreeFactor.cpp
View File

@ -363,13 +363,15 @@ namespace gtsam {
/// Push value onto the heap
void push(double x) {
v_.push_back(x);
std::make_heap(v_.begin(), v_.end(), std::greater<double>{});
std::push_heap(v_.begin(), v_.end(), std::greater<double>{});
}
/// Push value `x`, `n` number of times.
void push(double x, size_t n) {
v_.insert(v_.end(), n, x);
std::make_heap(v_.begin(), v_.end(), std::greater<double>{});
for (size_t i = 0; i < n; ++i) {
v_.push_back(x);
std::push_heap(v_.begin(), v_.end(), std::greater<double>{});
}
}
/// Pop the top value of the heap.
@ -390,10 +392,11 @@ namespace gtsam {
*/
void print(const std::string& s = "") {
std::cout << (s.empty() ? "" : s + " ");
for (size_t i = 0; i < v_.size() - 1; i++) {
std::cout << v_.at(i) << ",";
for (size_t i = 0; i < v_.size(); i++) {
std::cout << v_.at(i);
if (v_.size() > 1 && i < v_.size() - 1) std::cout << ", ";
}
std::cout << v_.at(v_.size() - 1) << std::endl;
std::cout << std::endl;
}
/// Return true if heap is empty.