kd-forest.git - An implementation of k-d forests

	Commit message (Collapse)	Author	Age	Files	Lines
*	Use the acap nearest neighbors implementationHEAD master	Tavian Barnes	2020-06-24	5	-971/+0
\|
*	Fix some clippy lints	Tavian Barnes	2020-05-11	2	-0/+28
\|
*	metric/forest: Use a flat staging buffer to reduce tree building overhead	Tavian Barnes	2020-05-09	1	-38/+48
\|
*	metric: Relax Distances to have only a partial order	Tavian Barnes	2020-05-05	2	-6/+4
\|
*	metric/approx: Implement approximate nearest neighbor search	Tavian Barnes	2020-05-03	1	-0/+131
\|
*	metric/soft: Implement soft deletes	Tavian Barnes	2020-05-03	1	-0/+282
\|
*	metric/forest: Optimize bulk insertion	Tavian Barnes	2020-05-03	1	-20/+27
\|
*	metric/forest: Implement dynamized forests	Tavian Barnes	2020-05-02	1	-0/+152
\|
*	metric/kd: Flatten the tree representation	Tavian Barnes	2020-05-02	1	-59/+54
\|
*	metric/vp: Flatten the tree representation	Tavian Barnes	2020-05-02	1	-82/+51
\|
*	metric/kd: Prune k-d tree searches more aggressively	Tavian Barnes	2020-05-02	1	-51/+65
\|
*	metric/kd: Implement k-d trees	Tavian Barnes	2020-05-02	1	-0/+217
\|
*	metric/vp: Implement vantage-point trees	Tavian Barnes	2020-05-02	1	-0/+168