kdt 0.2.4 → 0.2.5
raw patch · 3 files changed
+12/−9 lines, 3 filesdep ~deepseq-genericsPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: deepseq-generics
API changes (from Hackage documentation)
- Data.KdMap.Dynamic: instance GHC.Generics.Constructor Data.KdMap.Dynamic.C1_0KdMap
- Data.KdMap.Dynamic: instance GHC.Generics.Datatype Data.KdMap.Dynamic.D1KdMap
- Data.KdMap.Dynamic: instance GHC.Generics.Selector Data.KdMap.Dynamic.S1_0_0KdMap
- Data.KdMap.Dynamic: instance GHC.Generics.Selector Data.KdMap.Dynamic.S1_0_1KdMap
- Data.KdMap.Dynamic: instance GHC.Generics.Selector Data.KdMap.Dynamic.S1_0_2KdMap
- Data.KdMap.Dynamic: instance GHC.Generics.Selector Data.KdMap.Dynamic.S1_0_3KdMap
- Data.KdMap.Static: instance (GHC.Read.Read a, GHC.Read.Read p, GHC.Read.Read v) => GHC.Read.Read (Data.KdMap.Static.TreeNode a p v)
- Data.KdMap.Static: instance (GHC.Show.Show a, GHC.Show.Show p, GHC.Show.Show v) => GHC.Show.Show (Data.KdMap.Static.TreeNode a p v)
- Data.KdMap.Static: instance GHC.Generics.Constructor Data.KdMap.Static.C1_0KdMap
- Data.KdMap.Static: instance GHC.Generics.Constructor Data.KdMap.Static.C1_0TreeNode
- Data.KdMap.Static: instance GHC.Generics.Constructor Data.KdMap.Static.C1_1TreeNode
- Data.KdMap.Static: instance GHC.Generics.Datatype Data.KdMap.Static.D1KdMap
- Data.KdMap.Static: instance GHC.Generics.Datatype Data.KdMap.Static.D1TreeNode
- Data.KdMap.Static: instance GHC.Generics.Selector Data.KdMap.Static.S1_0_0KdMap
- Data.KdMap.Static: instance GHC.Generics.Selector Data.KdMap.Static.S1_0_0TreeNode
- Data.KdMap.Static: instance GHC.Generics.Selector Data.KdMap.Static.S1_0_1KdMap
- Data.KdMap.Static: instance GHC.Generics.Selector Data.KdMap.Static.S1_0_1TreeNode
- Data.KdMap.Static: instance GHC.Generics.Selector Data.KdMap.Static.S1_0_2KdMap
- Data.KdMap.Static: instance GHC.Generics.Selector Data.KdMap.Static.S1_0_2TreeNode
- Data.KdMap.Static: instance GHC.Generics.Selector Data.KdMap.Static.S1_0_3KdMap
- Data.KdMap.Static: instance GHC.Generics.Selector Data.KdMap.Static.S1_0_3TreeNode
- Data.KdTree.Static: instance GHC.Generics.Constructor Data.KdTree.Static.C1_0KdTree
- Data.KdTree.Static: instance GHC.Generics.Datatype Data.KdTree.Static.D1KdTree
+ Data.KdMap.Static: instance (GHC.Read.Read p, GHC.Read.Read v, GHC.Read.Read a) => GHC.Read.Read (Data.KdMap.Static.TreeNode a p v)
+ Data.KdMap.Static: instance (GHC.Show.Show p, GHC.Show.Show v, GHC.Show.Show a) => GHC.Show.Show (Data.KdMap.Static.TreeNode a p v)
Files
- changelog.md +3/−0
- kdt.cabal +6/−6
- lib-src/Data/KdMap/Dynamic.hs +3/−3
changelog.md view
@@ -1,3 +1,6 @@+# 0.2.5+* Fixed a minor compile error under GHC 9 caused by ambiguous use of "singleton".+ # 0.2.4 * Now exporting KdMap.Static.TreeNode to facilitate advanced usage of the library.
kdt.cabal view
@@ -2,7 +2,7 @@ -- see http://haskell.org/cabal/users-guide/ name: kdt-version: 0.2.4+version: 0.2.5 synopsis: Fast and flexible k-d trees for various types of point queries. description: This package includes static and dynamic versions of k-d trees, as well as \"Map\" variants that store data at each point in the@@ -38,7 +38,7 @@ build-depends: base >=4.6 && <5, deepseq >=1.3, heap >=1.0.0,- deepseq-generics >=0.1.1.1+ deepseq-generics >=0.2.0.0 hs-source-dirs: lib-src default-language: Haskell2010 @@ -52,7 +52,7 @@ kdt -any, QuickCheck >=2.5, deepseq >=1.3,- deepseq-generics >=0.1.1.1+ deepseq-generics >=0.2.0.0 default-language: Haskell2010 Test-Suite DynamicTest@@ -65,7 +65,7 @@ kdt -any, QuickCheck >=2.5, deepseq >=1.3,- deepseq-generics >=0.1.1.1+ deepseq-generics >=0.2.0.0 default-language: Haskell2010 benchmark KDTBenchmark@@ -75,7 +75,7 @@ hs-source-dirs: app-src ghc-options: -Wall -O3 -- ghc-prof-options: -Wall -O3 -fprof-auto- "-with-rtsopts=-p"+ -- "-with-rtsopts=-p" build-depends: base >=4.6 && <5, kdt -any, MonadRandom >= 0.1.12,@@ -84,5 +84,5 @@ QuickCheck >=2.5, heap >=1.0.0, deepseq >=1.3,- deepseq-generics >=0.1.1.1+ deepseq-generics >=0.2.0.0 default-language: Haskell2010
lib-src/Data/KdMap/Dynamic.hs view
@@ -49,8 +49,7 @@ import Data.Bits import Data.Function-import Data.List as L hiding (insert, null)-import qualified Data.List (null)+import qualified Data.List as L import Control.DeepSeq import Control.DeepSeq.Generics (genericRnf)@@ -161,7 +160,8 @@ nearest :: Real a => KdMap a p v -> p -> (p, v) nearest (KdMap ts _ d2 _) query = let nearests = map (`KDM.nearest` query) ts- in if Data.List.null nearests+ --in if Data.List.null nearests+ in if L.null nearests then error "Called nearest on empty KdMap." else L.minimumBy (compare `on` (d2 query . fst)) nearests