| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | kd, vp: Use as_deref() | Tavian Barnes | 2021-06-02 | 1 | -3/+2 |
| | | |||||
| * | knn: Move NearestNeighbor interfaces to a submodule | Tavian Barnes | 2021-02-25 | 1 | -2/+2 |
| | | |||||
| * | kd: Add a non-consuming iter() to KdTree and FlatKdTree | Tavian Barnes | 2021-02-24 | 1 | -2/+72 |
| | | |||||
| * | ks: Use sort_unstable_by_key rather than sort_by_cached_key | Tavian Barnes | 2020-11-18 | 1 | -4/+4 |
| | | | | | | The comparison key is just a single coordinate, no need for the overhead of caching. | ||||
| * | kd: Use a more traditional k-d tree implementation | Tavian Barnes | 2020-07-06 | 1 | -57/+35 |
| | | | | | | | | | | 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). | ||||
| * | Apply some rustfmt suggestions | Tavian Barnes | 2020-06-28 | 1 | -6/+6 |
| | | |||||
| * | Fix some clippy lints | Tavian Barnes | 2020-06-27 | 1 | -0/+6 |
| | | |||||
| * | docs: Update some links | Tavian Barnes | 2020-06-27 | 1 | -7/+7 |
| | | |||||
| * | Add links to module summaries | Tavian Barnes | 2020-06-24 | 1 | -1/+1 |
| | | |||||
| * | kd: Implement flat k-d trees | Tavian Barnes | 2020-06-24 | 1 | -0/+155 |
| | | |||||
| * | kd: Implement k-d trees | Tavian Barnes | 2020-06-24 | 1 | -0/+357 |
 |
index : acap.git | |
| Nearest neighbor search in Rust |
| summaryrefslogtreecommitdiffstats |