| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | docs: Fix a typo in the top-level documentation | Tavian Barnes | 2021-02-24 | 1 | -2/+2 |
| | | |||||
| * | docs: Add some examples to the main page | Tavian Barnes | 2020-07-08 | 1 | -0/+27 |
| | | |||||
| * | kd: Use a more traditional k-d tree implementation | Tavian Barnes | 2020-07-06 | 1 | -3/+3 |
| | | | | | | | | | | 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 bit | Tavian Barnes | 2020-07-06 | 1 | -46/+40 |
| | | |||||
| * | Add methods for merging new neighbors into a vector in-place | Tavian Barnes | 2020-07-03 | 1 | -74/+159 |
| | | |||||
| * | Preallocate the heap for k_nearest*() | Tavian Barnes | 2020-07-02 | 1 | -3/+3 |
| | | |||||
| * | Apply some rustfmt suggestions | Tavian Barnes | 2020-06-28 | 1 | -1/+1 |
| | | |||||
| * | docs: Update some links | Tavian Barnes | 2020-06-27 | 1 | -21/+23 |
| | | |||||
| * | cos: Implement cosine and angular distance | Tavian Barnes | 2020-06-25 | 1 | -0/+1 |
| | | |||||
| * | lp: Implement general L^p spaces | Tavian Barnes | 2020-06-24 | 1 | -0/+1 |
| | | |||||
| * | hamming: Implement Hamming distance0.1.0 | Tavian Barnes | 2020-06-24 | 1 | -0/+1 |
| | | |||||
| * | chebyshev: Implement Chebyshev distance | Tavian Barnes | 2020-06-24 | 1 | -0/+1 |
| | | |||||
| * | taxi: Implement taxicab distance | Tavian Barnes | 2020-06-24 | 1 | -0/+1 |
| | | |||||
| * | Add an overview to the documentation | Tavian Barnes | 2020-06-24 | 1 | -0/+88 |
| | | |||||
| * | kd: Implement k-d trees | Tavian Barnes | 2020-06-24 | 1 | -0/+1 |
| | | |||||
| * | vp: Implement vantage-point trees | Tavian Barnes | 2020-06-24 | 1 | -0/+1 |
| | | |||||
| * | util: Add a wrapper to implement Ord on top of PartialOrd | Tavian Barnes | 2020-06-24 | 1 | -0/+2 |
| | | | | | | This allows nearest neighbors implementations to sort things by distance or coordinate. | ||||
| * | exhaustive: Implement an exhaustive search index | Tavian Barnes | 2020-06-24 | 1 | -0/+32 |
| | | |||||
| * | lib: Add NearestNeighbors trait | Tavian Barnes | 2020-06-24 | 1 | -0/+377 |
| | | |||||
| * | euclid: Implement Euclidean distance | Tavian Barnes | 2020-06-24 | 1 | -0/+2 |
| | | |||||
| * | coords: Implement coordinate spaces | Tavian Barnes | 2020-06-24 | 1 | -0/+2 |
| | | |||||
| * | distance: Implement abstract distances, proximities, metrics | Tavian Barnes | 2020-06-24 | 1 | -0/+4 |
| | | |||||
| * | Initialize a new project | Tavian Barnes | 2020-06-24 | 1 | -0/+3 |
 |
index : acap.git | |
| Nearest neighbor search in Rust |
| summaryrefslogtreecommitdiffstats |