We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
KdTree.findNearstPoint
1 parent bb4b83a commit 2cfcc21Copy full SHA for 2cfcc21
src/AtCoder/Extra/KdTree.hs
@@ -226,10 +226,10 @@ findNearestPoint KdTree {..} x y
226
-- it's a leaf
227
| dataI /= -1 = (dataI, d)
228
-- look into the children
229
- | d0 < d1 = inner (2 * i + 0) $ inner (2 * i + 1) res
230
- | otherwise = inner (2 * i + 1) $ inner (2 * i + 0) res
+ | d0 < d1 = inner (2 * i + 1) $ inner (2 * i + 0) res
+ | otherwise = inner (2 * i + 0) $ inner (2 * i + 1) res
231
where
232
d = bestDistSquared i
233
dataI = dataKt VG.! i
234
d0 = bestDistSquared (2 * i + 0)
235
- d1 = bestDistSquared (2 * i + 0)
+ d1 = bestDistSquared (2 * i + 1)
0 commit comments