K-d tree: Difference between revisions
m
Minor edit to C++ code
m (Reformatted to reduce line count) |
m (Minor edit to C++ code) |
||
Line 303:
node* right_;
};
node* root_ = nullptr;
node* best_ = nullptr;
double best_dist_ = 0;
size_t visited_ = 0;
std::vector<node> nodes_;
Line 358:
template<typename iterator>
kdtree(iterator begin, iterator end) {
nodes_.reserve(std::distance(begin, end));
for (auto i = begin; i != end; ++i)
Line 377 ⟶ 374:
template<typename func>
kdtree(func&& f, size_t n) {
nodes_.reserve(n);
for (size_t i = 0; i < n; ++i)
| |||