This is an automated email from the git hooks/post-receive script. It was
generated because a ref change was pushed to the repository containing
the project "UNNAMED PROJECT".
The branch, feature_4 has been updated
via 97546ec52c3562408c478e2676a56d7ed61d55fa (commit)
via 504267583320e1390243b6155ddb58be825a678b (commit)
from a4880a6715da215a7f8725c082f0f65a951ea706 (commit)
Those revisions listed above that are new to this repository have
not appeared on any other notification email; so we list those
revisions in full, below.
- Log -----------------------------------------------------------------
commit 97546ec52c3562408c478e2676a56d7ed61d55fa
Author: Sylvain Bougerel <syl...@gm...>
Date: Thu Nov 26 01:40:31 2015 +0800
Finally, we got the fast results expect from nearest/lower_bound/upper_bound neighbor expected. This is by using the near-pre-order tree walk.
The iterators have been ported to near-pre-order tree walking however there is currently an implementation mistake which results in core dump for the iterators.
commit 504267583320e1390243b6155ddb58be825a678b
Author: Sylvain Bougerel <syl...@gm...>
Date: Tue Nov 24 23:58:04 2015 +0800
At this point, I realized that the solution 2 commits ago was a more performant one:
moving 'forward' what in the nearest nodes first wins.
-----------------------------------------------------------------------
Summary of changes:
examples/CMakeLists.txt | 2 +
...ce.cpp => lower_bound_neighbor_performance.cpp} | 23 +-
...ce.cpp => upper_bound_neighbor_performance.cpp} | 23 +-
src/bits/spatial_neighbor.hpp | 384 ++++++++------------
tests/bits/spatial_test_neighbor.hpp | 27 ++-
5 files changed, 192 insertions(+), 267 deletions(-)
copy examples/performance/{farthest_neighbor_performance.cpp => lower_bound_neighbor_performance.cpp} (86%)
copy examples/performance/{farthest_neighbor_performance.cpp => upper_bound_neighbor_performance.cpp} (86%)
hooks/post-receive
--
UNNAMED PROJECT
|
