archive-gh-me/flatbush
1
0
Fork 0
mirror of https://github.com/mourner/flatbush.git synced 2025-12-08 17:36:26 +00:00
Code Issues Projects Releases Wiki Activity
85 Commits 8 Branches 27 Tags
Commit Graph

45 Commits

Author SHA1 Message Date
Vladimir Agafonkin
f1c16d550d slightly faster knn search 2018-11-08 14:58:25 +01:00
Vladimir Agafonkin
eb61250246 expand documentation 2018-10-10 13:35:28 +03:00
Vladimir Agafonkin
f87c6fbd1f implement kNN queries 2018-10-10 11:30:40 +03:00
Vladimir Agafonkin
a5ffcdc445 clean up, modernize 2018-09-05 14:56:33 +03:00
Vladimir Agafonkin
40c08182b2 check ArrayType in constructor 2018-05-07 19:33:13 +03:00
Vladimir Agafonkin
b7b1eca826 add magic number + version to the header 2018-05-07 13:18:35 +03:00
Vladimir Agafonkin
45b00ece3b simplify slightly 2018-05-07 11:34:47 +03:00
Vladimir Agafonkin
4267248414 add a header to the buffer; close #12 2018-05-07 11:34:34 +03:00
Vladimir Agafonkin
724fab44b8 simplify 2018-05-04 12:46:32 +03:00
Martin Raifer
0f7d35c366 we don't need an "alignment margin"; indices can't be larger than 32bit 
as array indices can never be larger than 32 bit integers, the typed arrays always align correctly in the "data" array buffer (note that the boxes always come in multiples of four entries)

see https://github.com/mourner/flatbush/pull/11#discussion_r185742889
 2018-05-04 10:35:37 +02:00
Martin Raifer
7ef566ef7e fix alignment margin calculation 
see https://github.com/mourner/flatbush/pull/11#discussion_r184096261
 2018-04-25 17:08:22 +02:00
Martin Raifer
1075031900 decouple indices from coordinates 
This allows to use an independent array type for indices (which are always unsigned integers for which the smallest fitting type is automatically chosen).

see https://github.com/mourner/flatbush/pull/4#issuecomment-383980084
 2018-04-25 10:37:53 +02:00
Vladimir Agafonkin
ade1fdfbee safeguard against infinite loop 2018-03-21 17:31:46 +02:00
Vladimir Agafonkin
6fabe76fcd fix error reporting on search 2018-03-21 16:46:55 +02:00
Vladimir Agafonkin
8720096e89 remove binary search for level bound 
slightly improves search performance, closes #6
 2018-03-21 15:11:30 +02:00
Vladimir Agafonkin
5edf164ba2 optimize search queue 2018-03-21 14:19:37 +02:00
Vladimir Agafonkin
b90298988f minor code cleanup 2018-03-21 14:18:15 +02:00
Vladimir Agafonkin
8492c77481 use rectangle centers instead of corners for packing 2018-03-21 13:43:13 +02:00
Vladimir Agafonkin
682036eb6a accept array views for deserialization 2018-03-21 12:33:31 +02:00
Vladimir Agafonkin
a056d5567f use let/const instead of var everywhere 2018-03-21 12:12:47 +02:00
Vladimir Agafonkin
6d283bdfaa use class syntax 2018-03-21 12:02:35 +02:00
Vladimir Agafonkin
3bb64a7257 (breaking!) export class instead of factory 2018-03-21 12:01:00 +02:00
Vladimir Agafonkin
bf24351a75 expose minX, minY, maxX, maxY 2018-03-21 11:53:18 +02:00
Vladimir Agafonkin
ae2967afd9 expose numItems, nodeSize, ArrayType publicly 2018-03-21 11:47:13 +02:00
Vladimir Agafonkin
e94a2fbc24 accept data buffer for reconstructing index 2018-03-21 11:12:49 +02:00
Vladimir Agafonkin
6f15f398db discard hilbert values after indexing 2018-03-21 11:01:10 +02:00
Vladimir Agafonkin
bb9d5e607e calculate level bounds in constructor 2018-03-21 10:57:22 +02:00
Vladimir Agafonkin
7d07e9b8a6 better pivot for quicksort 2018-03-18 22:39:38 +02:00
Vladimir Agafonkin
3a08ca8198
Fix sorting bug that hindered search performance (#7) 
* fix a bug in quicksort

* fix tests

* update benchmarks
 2018-03-18 16:50:26 +02:00
Vladimir Agafonkin
7cc362a3e4
ES modules + browser build (#5) 
* ES modules + browser build
* minor tweaks
 2018-03-01 16:59:50 +02:00
Martin Raifer
1262897f36 allow overriding internal data array type (#4) 
similar to https://github.com/mourner/kdbush#api (if input coordinates are integer values, using an `Int32Array` can make things a bit faster)
 2018-03-01 11:56:32 +02:00
Vladimir Agafonkin
bf0b547d3b fix bad performance on certain inputs 2018-02-28 18:17:03 +02:00
Vladimir Agafonkin
2cdfe58d80 better search API 2018-02-28 17:49:35 +02:00
Vladimir Agafonkin
c4cc716e4e better error handling 2018-02-28 13:17:39 +02:00
Vladimir Agafonkin
d73ba9caa0 another small optimization 2018-02-28 12:44:43 +02:00
Vladimir Agafonkin
611b54cf03 add rbush to bench 2018-02-27 23:16:48 +02:00
Vladimir Agafonkin
05ed0dea5b one more search optimization 2018-02-27 21:12:03 +02:00
Vladimir Agafonkin
8375d316a8 slightly faster search 2018-02-27 20:43:43 +02:00
Vladimir Agafonkin
59971eef1e fix search, add tests 2018-02-27 19:54:04 +02:00
Vladimir Agafonkin
9ba7973ec4 add some code comments 2018-02-27 17:23:42 +02:00
Vladimir Agafonkin
4bccce8727 no need for hilber order less than 16 2018-02-27 17:05:12 +02:00
Vladimir Agafonkin
61a495df58 add search 2018-02-27 16:44:23 +02:00
Vladimir Agafonkin
f3c1843986 generate tree nodes 2018-02-27 13:12:54 +02:00
Vladimir Agafonkin
7f42b8dd97 add basic package.json 2018-02-27 11:01:33 +02:00
Vladimir Agafonkin
fc8d6cfbbd first commit 2018-02-27 10:56:10 +02:00