summaryrefslogtreecommitdiffstats
path: root/src
Commit message (Collapse)AuthorAgeFilesLines
* vp: Add a non-consuming iter() to VpTree and FlatVpTreeTavian Barnes2021-02-241-0/+92
|
* kd: Add a non-consuming iter() to KdTree and FlatKdTreeTavian Barnes2021-02-241-2/+72
|
* exhaustive: Add a non-consuming iter()Tavian Barnes2021-02-241-3/+37
|
* exhaustive: Add a wrapper type for IntoIteratorTavian Barnes2021-02-241-9/+13
|
* docs: Fix a typo in the top-level documentationTavian Barnes2021-02-241-2/+2
|
* ks: Use sort_unstable_by_key rather than sort_by_cached_keyTavian Barnes2020-11-181-4/+4
| | | | | The comparison key is just a single coordinate, no need for the overhead of caching.
* vp: Fix FlatVpTree Debug field nameTavian Barnes2020-10-131-1/+1
|
* docs: Add some examples to the main pageTavian Barnes2020-07-081-0/+27
|
* kd: Use a more traditional k-d tree implementationTavian Barnes2020-07-069-118/+84
| | | | | | | | | The slight extra pruning possible in the previous implementation didn't seem to be worth it. The new, simpler implementation is also about 30% faster in most of the benchmarks. This gets rid of Coordinate{Proximity,Metric} as they're not necessary any more (and the old ExactNeighbors impl was too restrictive anyway).
* Clean up merge_k_nearest*() interface a bitTavian Barnes2020-07-061-46/+40
|
* Add methods for merging new neighbors into a vector in-placeTavian Barnes2020-07-031-74/+159
|
* Preallocate the heap for k_nearest*()Tavian Barnes2020-07-021-3/+3
|
* distance: Expand the Distance docsTavian Barnes2020-06-291-3/+9
|
* distance: Expand the Proximity docsTavian Barnes2020-06-291-6/+49
|
* Apply some rustfmt suggestionsTavian Barnes2020-06-288-18/+16
|
* cos: Add a TryFrom<T> impl for AngularDistance<T>Tavian Barnes2020-06-271-1/+20
|
* Fix some clippy lintsTavian Barnes2020-06-272-5/+17
|
* docs: Update some linksTavian Barnes2020-06-2710-63/+73
|
* docs: Integrate KaTeX and add some formulasTavian Barnes2020-06-277-18/+116
|
* euclid: Fix a doc typo (s/Createa/Creates/)Tavian Barnes2020-06-251-1/+1
|
* cos: Add prenormalized cosine/angular distances, and an order embeddingTavian Barnes2020-06-251-16/+332
|
* cos: Implement cosine and angular distanceTavian Barnes2020-06-252-0/+196
|
* Add links to module summariesTavian Barnes2020-06-248-8/+8
|
* lp: Implement general L^p spacesTavian Barnes2020-06-242-0/+59
|
* hamming: Implement Hamming distance0.1.0Tavian Barnes2020-06-242-0/+77
|
* chebyshev: Implement Chebyshev distanceTavian Barnes2020-06-242-0/+121
|
* taxi: Implement taxicab distanceTavian Barnes2020-06-242-0/+117
|
* Add an overview to the documentationTavian Barnes2020-06-241-0/+88
|
* kd: Implement flat k-d treesTavian Barnes2020-06-241-0/+155
|
* kd: Implement k-d treesTavian Barnes2020-06-242-0/+358
|
* vp: Implement flat VP treesTavian Barnes2020-06-241-1/+182
|
* vp: Implement vantage-point treesTavian Barnes2020-06-242-0/+373
|
* util: Add a wrapper to implement Ord on top of PartialOrdTavian Barnes2020-06-242-0/+56
| | | | | This allows nearest neighbors implementations to sort things by distance or coordinate.
* exhaustive: Implement an exhaustive search indexTavian Barnes2020-06-242-0/+121
|
* lib: Add NearestNeighbors traitTavian Barnes2020-06-241-0/+377
|
* euclid: Implement Euclidean distanceTavian Barnes2020-06-242-0/+392
|
* coords: Implement coordinate spacesTavian Barnes2020-06-242-0/+115
|
* distance: Implement abstract distances, proximities, metricsTavian Barnes2020-06-242-0/+107
|
* Initialize a new projectTavian Barnes2020-06-241-0/+3
generated by cgit v1.2.3 (git 2.39.1) at 2024-11-14 05:22:58 +0000