nmelone/GoldenCheetah
1
0
Fork 0
mirror of https://github.com/GoldenCheetah/GoldenCheetah.git synced 2026-02-13 16:18:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix misleading comment

Browse Source
This commit is contained in:
Mark Liversedge
2020-02-18 08:12:49 +00:00
parent 6fb3baae95
commit 902c18078e
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/Core/Quadtree.h
View File

@@ -41,7 +41,7 @@ class QuadtreeNode
// do we overlap with the search space - when looking
bool intersect(QRectF r) { return r.intersects(QRectF(topleft,bottomright)); }
// add a node
// add a point
void insert(Quadtree *root, QPointF value);
// get candidates in same quadrant (might be miles away for big quadrant).
@@ -53,7 +53,7 @@ class QuadtreeNode
void split(Quadtree *root);
private:
// AABB - index into nodes on Quadtree class.
// AABB children (also in a freelist in Quadtree)
QuadtreeNode *aabb[4];
// the points in this quadrant
@@ -75,8 +75,8 @@ class Quadtree
// add a point
void insert(QPointF x);
// find points in same quadrant as cursor, of course might be long way away...
int candidates(QRectF point, QList<QPointF>&tohere) { return root->candidates(point, tohere); }
// find points in boundg rect, of course might be long way away...
int candidates(QRectF rect, QList<QPointF>&tohere) { return root->candidates(rect, tohere); }
// manage the entire child tree on a single qvector to delete quickly
QuadtreeNode *newnode(QPointF topleft, QPointF bottomright);