The data-r-tree package

[Tags: library, mit]

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]

Properties

Versions0.0.1.0, 0.0.2.0, 0.0.3.0, 0.0.4.0, 0.0.5.0
Change logchangelog.md
Dependenciesbase (==4.*), binary (==0.*), deepseq (==1.*) [details]
LicenseMIT
CopyrightSebastian Philipp, Birte Wagner
AuthorSebastian Philipp, Birte Wagner
Maintainersebastian@spawnhost.de
CategoryData Structures
Home pagehttps://github.com/sebastian-philipp/r-tree
Bug trackerhttps://github.com/sebastian-philipp/r-tree/issues
Source repositoryhead: git clone https://github.com/sebastian-philipp/r-tree.git
UploadedFri Aug 8 14:49:37 UTC 2014 by SebastianPhilipp
DistributionsNixOS:0.0.5.0
Downloads927 total (62 in last 30 days)
Votes
0 []
StatusDocs available [build log]
Successful builds reported [all 1 reports]

Modules

[Index]

Flags

NameDescriptionDefault
test-strictDisabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for data-r-tree-0.0.5.0

R-Trees (and in the future also R*-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.

Some function names clash with "Prelude" names, therefore this module is usually imported qualified, e.g.:

> import           Data.RTree (RTree)
> import qualified Data.RTree as RT

this implemetation is incomplete at the moment. Feel free to send comments, patches or merge requests.