K-d tree: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 381:
kdtree(iterator begin, iterator end)
{
best_ = nullptr;
best_dist_ = 0;
visited_ = 0;
nodes_.reserve(std::distance(begin, end));
for (auto i = begin; i != end; ++i)
Line 398 ⟶ 401:
kdtree(func&& f, size_t n)
{
best_ = nullptr;
best_dist_ = 0;
visited_ = 0;
nodes_.reserve(n);
for (size_t i = 0; i < n; ++i)
| |||