ilusha/Modules
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Lovelly bug in Interval Tree

Browse source
This commit is contained in:
IlyaShurupov 2024-10-08 14:39:30 +03:00 • committed by Ilya Shurupov
parent 5e3f5594b8
commit 3f49ee11ae
2 changed files with 8 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

4
Containers/public/IntervalTree.hpp
View file

@ -2,6 +2,8 @@
#include "Tree.hpp"
#include <limits>
namespace tp {
template <typename tType>
@ -31,7 +33,7 @@ namespace tp {
template <typename tTreeNodeType>
inline void updateNodeCache(const tTreeNodeType* node) {
mMax = 0;
mMax = std::numeric_limits<tType>::min();
if (node->mRight && node->mRight->key.mMax > mMax) mMax = node->mRight->key.mMax;
if (node->mLeft && node->mLeft->key.mMax > mMax) mMax = node->mLeft->key.mMax;
if (mMax < mEnd) mMax = mEnd;

7
Containers/tests/IntervalTreeTests.cpp
View file

@ -16,8 +16,11 @@ struct Interval {
bool ignore = false;
void random(halnf span, halnf scale = 1.f) {
start = ((halnf) randomFloat()) * (span);
end = ((halnf) randomFloat()) * (span);
auto offset = 0;
start = ((halnf) randomFloat()) * (span) - offset;
end = ((halnf) randomFloat()) * (span) - offset;
if (start > end) swap(start, end);
auto len = (end - start) * scale * 0.5f;