| Commit message (Expand) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Use the acap nearest neighbors implementationHEADmaster | Tavian Barnes | 2020-06-24 | 1 | -546/+0 |
| * | Fix some clippy lints | Tavian Barnes | 2020-05-11 | 1 | -0/+11 |
| * | metric/forest: Use a flat staging buffer to reduce tree building overhead | Tavian Barnes | 2020-05-09 | 1 | -0/+5 |
| * | metric: Relax Distances to have only a partial order | Tavian Barnes | 2020-05-05 | 1 | -27/+20 |
| * | metric/approx: Implement approximate nearest neighbor search | Tavian Barnes | 2020-05-03 | 1 | -0/+1 |
| * | metric/soft: Implement soft deletes | Tavian Barnes | 2020-05-03 | 1 | -0/+1 |
| * | metric/forest: Implement dynamized forests | Tavian Barnes | 2020-05-02 | 1 | -0/+1 |
| * | metric/kd: Implement k-d trees | Tavian Barnes | 2020-05-02 | 1 | -0/+1 |
| * | metric/vp: Implement vantage-point trees | Tavian Barnes | 2020-05-02 | 1 | -0/+2 |
| * | metric: Add some general interfaces for metric spaces | Tavian Barnes | 2020-05-02 | 1 | -0/+531 |
 |
index : kd-forest.git | |
| An implementation of k-d forests | Tavian Barnes <tavianator@tavianator.com> |
| summaryrefslogtreecommitdiffstats |