acap.git - Nearest neighbor search in Rust

	Commit message (Collapse)	Author	Age	Files	Lines
*	hamming: Implement Hamming distance0.1.0	Tavian Barnes	2020-06-24	2	-0/+77
\|
*	chebyshev: Implement Chebyshev distance	Tavian Barnes	2020-06-24	2	-0/+121
\|
*	taxi: Implement taxicab distance	Tavian Barnes	2020-06-24	2	-0/+117
\|
*	Add an overview to the documentation	Tavian Barnes	2020-06-24	1	-0/+88
\|
*	kd: Implement flat k-d trees	Tavian Barnes	2020-06-24	1	-0/+155
\|
*	kd: Implement k-d trees	Tavian Barnes	2020-06-24	2	-0/+358
\|
*	vp: Implement flat VP trees	Tavian Barnes	2020-06-24	1	-1/+182
\|
*	vp: Implement vantage-point trees	Tavian Barnes	2020-06-24	2	-0/+373
\|
*	util: Add a wrapper to implement Ord on top of PartialOrd	Tavian Barnes	2020-06-24	2	-0/+56
\| \| \| \| \|	This allows nearest neighbors implementations to sort things by distance or coordinate.
*	exhaustive: Implement an exhaustive search index	Tavian Barnes	2020-06-24	2	-0/+121
\|
*	lib: Add NearestNeighbors trait	Tavian Barnes	2020-06-24	1	-0/+377
\|
*	euclid: Implement Euclidean distance	Tavian Barnes	2020-06-24	2	-0/+392
\|
*	coords: Implement coordinate spaces	Tavian Barnes	2020-06-24	2	-0/+115
\|
*	distance: Implement abstract distances, proximities, metrics	Tavian Barnes	2020-06-24	2	-0/+107
\|
*	Initialize a new project	Tavian Barnes	2020-06-24	1	-0/+3