data-r-tree: R-Tree is a spatial data structure similar to Quadtrees or B-Trees.
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.
[Skip to Readme]
Downloads
- data-r-tree-0.6.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
| Versions [RSS] | 0.0.1.0, 0.0.2.0, 0.0.3.0, 0.0.4.0, 0.0.5.0, 0.6.0 |
|---|---|
| Change log | changelog.md |
| Dependencies | base (>=4 && <5), binary (>=0.8 && <0.11), deepseq (>=1.4 && <1.5) [details] |
| License | MIT |
| Copyright | Sebastian Wagner, Birte Wagner |
| Author | Sebastian Wagner, Birte Wagner |
| Maintainer | sebastian@spawnhost.de |
| Category | Data Structures |
| Home page | https://github.com/sebastian-philipp/r-tree |
| Bug tracker | https://github.com/sebastian-philipp/r-tree/issues |
| Source repo | head: git clone https://github.com/sebastian-philipp/r-tree.git |
| Uploaded | by SebastianPhilipp at 2020-01-22T10:52:31Z |
| Distributions | NixOS:0.6.0 |
| Downloads | 6492 total (36 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2020-01-22 [all 1 reports] |