| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Use the acap nearest neighbors implementationHEADmaster | Tavian Barnes | 2020-06-24 | 1 | -224/+0 |
| | | |||||
| * | metric: Relax Distances to have only a partial order | Tavian Barnes | 2020-05-05 | 1 | -4/+2 |
| | | |||||
| * | metric/kd: Flatten the tree representation | Tavian Barnes | 2020-05-02 | 1 | -59/+54 |
| | | |||||
| * | metric/kd: Prune k-d tree searches more aggressively | Tavian Barnes | 2020-05-02 | 1 | -51/+65 |
| | | |||||
| * | metric/kd: Implement k-d trees | Tavian Barnes | 2020-05-02 | 1 | -0/+217 |
 |
index : kd-forest.git | |
| An implementation of k-d forests | Tavian Barnes <tavianator@tavianator.com> |
| summaryrefslogtreecommitdiffstats |