data-r-tree

R-Tree is a spatial data structure similar to Quadtrees or B-Trees. https://github.com/sebastian-philipp/r-tree

Latest on Hackage:0.0.5.0

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

MIT licensed by Sebastian Philipp, Birte Wagner

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.

Changes

0.0.4.0

  • Added Data.RTree.Strict

  • Added Data.Binary interface for GHC 7.6

0.0.5.0

  • changed the Functor instance of Data.RTree.Strict to be strict

  • Data.RTree.Strict.RTree is now a newtype of Data.RTree.RTree

Depends on:
Used by 1 package:
comments powered byDisqus