data-r-tree
R-Tree is a spatial data structure similar to Quadtrees or B-Trees. An R-Tree is a balanced tree and optimized for lookups. This implemetation useses an R-Tree to privide a map to arbitrary values.
Ecosystem
hackage.haskell.org
hackage.haskell.org
Latest Release
about 6 years ago
0.6.0
about 6 years ago
Versions
6
6
Downloads
7,279 total
7,279 total
Dependent Repos
2
2
Loading...
Readme
Loading...
Links
| Registry | hackage.haskell.org |
| Source | Repository |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:hackage/data-r-tree
spec |
| License | MIT |
| First Release | almost 12 years ago |
| Last Synced | 17 days ago |
Repository
| Stars | 12 on GitHub |
| Forks | 12 on GitHub |
| Commits | 63 |
| Committers | 7 |
| Avg per Author | 9.0 |
| DDS | 0.317 |