summaryrefslogtreecommitdiffstats
path: root/ChangeLog
diff options
context:
space:
mode:
authorTavian Barnes <tavianator@gmail.com>2009-10-26 16:35:38 -0400
committerTavian Barnes <tavianator@gmail.com>2009-10-26 16:35:38 -0400
commit4aa80fd16d2c64a4646f55138eba7c68d13d0b48 (patch)
treeac021801d5249c0e3ef8fc8e8006dd4ac41db1db /ChangeLog
parentc6612fb215d71ac2bea3b614786cf585cd1a6c74 (diff)
downloaddimension-4aa80fd16d2c64a4646f55138eba7c68d13d0b48.tar.xz
Major dmnsn_kD_splay_search() optimization.
At each level of recursion, we have to go down the right branch if it exists. But if we do this before we test the current node and the left branch, we can eliminate those tests in the likely case that we find a closer object in the geometrically larger right subtree. This gives about a 2X speed improvement according to `make bench'.
Diffstat (limited to 'ChangeLog')
0 files changed, 0 insertions, 0 deletions