Mirrorlandia_minetest/minetest
1
0
Fork 1
mirror of https://github.com/minetest/minetest.git synced 2024-07-02 14:10:33 +02:00
Code Issues Packages Projects Releases Wiki Activity

Eliminate risk of unwanted wraparound

Browse Source
This commit is contained in:
Lars Mueller 2024-05-18 21:24:36 +02:00
parent 8954059561
commit d33da30fed
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/util/k_d_tree.h
View File

@ -353,10 +353,11 @@ class KdTree {
}
template<typename F>
void rangeQuery(Idx root, uint8_t split,
// Note: root is of type std::size_t to avoid issues with wraparound
void rangeQuery(std::size_t root, uint8_t split,
const Point &min, const Point &max,
const F &cb) const {
if (root >= cap()) // TODO what if we overflow earlier?
if (root >= cap())
return;
const auto ptid = tree[root];
const auto coord = items.points.begin(split)[ptid];