| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Move soft deletion into the forest implementationmain | Tavian Barnes | 2023-12-05 | 1 | -8/+2 |
| | | | | | This allows us to filter out deleted items whenever we rebuild a tree. | ||||
| * | frontier: Remove unused is_empty() method | Tavian Barnes | 2023-11-21 | 1 | -4/+0 |
| | | |||||
| * | Bump dependencies | Tavian Barnes | 2021-10-24 | 1 | -1/+1 |
| | | |||||
| * | Bump acap to 0.2.0 | Tavian Barnes | 2020-08-24 | 1 | -3/+12 |
| | | | | | | This requires adapting to the new k-d trees, which are significantly faster. | ||||
| * | Use the acap nearest neighbors implementationHEADmaster | Tavian Barnes | 2020-06-24 | 1 | -9/+10 |
| | | |||||
| * | Fix some clippy lints | Tavian Barnes | 2020-05-11 | 1 | -0/+4 |
| | | |||||
| * | frontier/mean: Implement mean selection | Tavian Barnes | 2020-05-03 | 1 | -0/+140 |
 |
index : kd-forest.git | |
| An implementation of k-d forests | Tavian Barnes <tavianator@tavianator.com> |
| summaryrefslogtreecommitdiffstats |