From fe67b6a39f82be71ce02c41ea40bbcf7a6f4a46e Mon Sep 17 00:00:00 2001 From: Sebastian Wagner Date: Wed, 22 Jan 2020 10:51:24 +0100 Subject: [PATCH] Changelog: 0.6.0 Signed-off-by: Sebastian Wagner --- .gitignore | 3 ++- changelog.md | 10 +++++++++- data-r-tree.cabal | 2 +- 3 files changed, 12 insertions(+), 3 deletions(-) diff --git a/.gitignore b/.gitignore index e68c5fe..00c233e 100644 --- a/.gitignore +++ b/.gitignore @@ -1,4 +1,5 @@ /dist/ /.cabal-sandbox/ /cabal.sandbox.config -/.stack-work/ \ No newline at end of file +/.stack-work/ +stack.yaml.lock \ No newline at end of file diff --git a/changelog.md b/changelog.md index c381ffd..2448ea1 100644 --- a/changelog.md +++ b/changelog.md @@ -8,4 +8,12 @@ * changed the Functor instance of Data.RTree.Strict to be strict -* Data.RTree.Strict.RTree is now a newtype of Data.RTree.RTree \ No newline at end of file +* Data.RTree.Strict.RTree is now a newtype of Data.RTree.RTree + +## 0.6.0 + +* Add `lookupContainsRange` and `lookupContainsRangeWithKey`. +* Add `intersectWithKey` and `intersect`. +* Now supports GHC 8.4, 8.5 and 8.6. +* Removed `test-strict` flag. +* Minimal Bounding Box is now also an instance of `Ord` \ No newline at end of file diff --git a/data-r-tree.cabal b/data-r-tree.cabal index 6c386aa..82c2a62 100644 --- a/data-r-tree.cabal +++ b/data-r-tree.cabal @@ -1,7 +1,7 @@ cabal-version: 2.2 name: data-r-tree -version: 0.0.6.0 +version: 0.6.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.