name: data-r-tree version: 0.0.5.0 synopsis: R-Tree is a spatial data structure similar to Quadtrees or B-Trees. description: 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. license: MIT license-file: LICENSE author: Sebastian Philipp, Birte Wagner maintainer: sebastian@spawnhost.de copyright: Sebastian Philipp, Birte Wagner category: Data Structures build-type: Simple Extra-source-files: changelog.md README.md cabal-version: >=1.10 bug-reports: https://github.com/sebastian-philipp/r-tree/issues homepage: https://github.com/sebastian-philipp/r-tree -- enable with cabal test -ftest-strict flag test-strict default: False manual: True source-repository head type: git location: https://github.com/sebastian-philipp/r-tree.git library exposed-modules: Data.RTree, Data.RTree.MBB Data.RTree.Base Data.RTree.Strict -- other-modules: other-extensions: NoMonomorphismRestriction build-depends: base == 4.*, deepseq == 1.*, binary == 0.* -- hs-source-dirs: default-language: Haskell2010 ghc-options: -Wall -fwarn-tabs test-suite properties type: exitcode-stdio-1.0 main-is: RTreeProperties.hs build-depends: data-r-tree , base == 4.* , binary , HUnit >= 1.2 , QuickCheck >= 2.4 , test-framework >= 0.6 , test-framework-quickcheck2 >= 0.2 , test-framework-hunit >= 0.2 , containers -- , gnuplot >= 0.5 default-language: Haskell2010 other-extensions: NoMonomorphismRestriction ghc-options: -Wall -fwarn-tabs hs-source-dirs: test test-suite strict type: exitcode-stdio-1.0 main-is: RTreeStrict.hs if !flag(test-strict) buildable: False else build-depends: data-r-tree , base == 4.* , deepseq , ghc-heap-view >= 0.5 , HUnit >= 1.2 , QuickCheck >= 2.4 , test-framework >= 0.6 , test-framework-quickcheck2 >= 0.2 , test-framework-hunit >= 0.2 default-language: Haskell2010 ghc-options: -Wall -fwarn-tabs hs-source-dirs: test