v1.6.0
Highlights
- performance improvement for nearest neighbor queries (kNN).
- New
lower_bound(key)
API method to find a key or the next higher (using Morton order) key. - New
DistanceChebyshev
for using Chebyshev distance with kNN - API change:
relocate()
now returnssize_t
- Several refactorings and minor changes
What's Changed
Added
- Added benchmark for bit operations in
common
. #128 - Added
lower_bounds(key)
to API. #126 - Added
bpt_fixed_vector
, a fixed size flat vector for future use. It can be dropped in for an std::vector. #124 - Added Chebyshev distance metric
DistanceChebyshev
. #129
Changed
- Changed
bpt_vector
to usestd::destroy
i.o. default dstr. #132 - Moved B+trees into own namespace. #131
- Moved some stuff in
common
intonamespace detail
. #129 - Improved kNN search implementation. This also deprecates the post-increment iterator. #118
Fixed
- Replaced deprecated
<assert.h>
imports with<cassert>
. #134 - Fixes undefined behavior in debug method. #135
- API: Fixes
relocate()
return type to besize_t
. #136 - Fix constness of B+tree
check()
. #137 - Minor fixes for next release. #140
Full Changelog: v1.5.0...v1.6.0 or CHANGELOG