packages feed

kdt 0.2.3 → 0.2.4

raw patch · 3 files changed

+12/−3 lines, 3 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Data.KdMap.Dynamic: instance (NFData a, NFData p, NFData v) => NFData (KdMap a p v)
- Data.KdMap.Dynamic: instance (Show a, Show p, Show v) => Show (KdMap a p v)
- Data.KdMap.Dynamic: instance Constructor C1_0KdMap
- Data.KdMap.Dynamic: instance Datatype D1KdMap
- Data.KdMap.Dynamic: instance Foldable (KdMap a p)
- Data.KdMap.Dynamic: instance Functor (KdMap a p)
- Data.KdMap.Dynamic: instance Generic (KdMap a p v)
- Data.KdMap.Dynamic: instance Selector S1_0_0KdMap
- Data.KdMap.Dynamic: instance Selector S1_0_1KdMap
- Data.KdMap.Dynamic: instance Selector S1_0_2KdMap
- Data.KdMap.Dynamic: instance Selector S1_0_3KdMap
- Data.KdMap.Dynamic: instance Traversable (KdMap a p)
- Data.KdMap.Static: instance (NFData a, NFData p, NFData v) => NFData (KdMap a p v)
- Data.KdMap.Static: instance (NFData a, NFData p, NFData v) => NFData (TreeNode a p v)
- Data.KdMap.Static: instance (Read a, Read p, Read v) => Read (TreeNode a p v)
- Data.KdMap.Static: instance (Show a, Show p, Show v) => Show (KdMap a p v)
- Data.KdMap.Static: instance (Show a, Show p, Show v) => Show (TreeNode a p v)
- Data.KdMap.Static: instance Constructor C1_0KdMap
- Data.KdMap.Static: instance Constructor C1_0TreeNode
- Data.KdMap.Static: instance Constructor C1_1TreeNode
- Data.KdMap.Static: instance Datatype D1KdMap
- Data.KdMap.Static: instance Datatype D1TreeNode
- Data.KdMap.Static: instance Foldable (KdMap a p)
- Data.KdMap.Static: instance Functor (KdMap a p)
- Data.KdMap.Static: instance Generic (KdMap a p v)
- Data.KdMap.Static: instance Generic (TreeNode a p v)
- Data.KdMap.Static: instance Selector S1_0_0KdMap
- Data.KdMap.Static: instance Selector S1_0_0TreeNode
- Data.KdMap.Static: instance Selector S1_0_1KdMap
- Data.KdMap.Static: instance Selector S1_0_1TreeNode
- Data.KdMap.Static: instance Selector S1_0_2KdMap
- Data.KdMap.Static: instance Selector S1_0_2TreeNode
- Data.KdMap.Static: instance Selector S1_0_3KdMap
- Data.KdMap.Static: instance Selector S1_0_3TreeNode
- Data.KdMap.Static: instance Traversable (KdMap a p)
- Data.KdTree.Dynamic: instance (Show a, Show p) => Show (KdTree a p)
- Data.KdTree.Dynamic: instance Foldable (KdTree a)
- Data.KdTree.Static: instance (NFData a, NFData p) => NFData (KdTree a p)
- Data.KdTree.Static: instance (Show a, Show p) => Show (KdTree a p)
- Data.KdTree.Static: instance Constructor C1_0KdTree
- Data.KdTree.Static: instance Datatype D1KdTree
- Data.KdTree.Static: instance Foldable (KdTree a)
- Data.KdTree.Static: instance Generic (KdTree a p)
+ Data.KdMap.Dynamic: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData p, Control.DeepSeq.NFData v) => Control.DeepSeq.NFData (Data.KdMap.Dynamic.KdMap a p v)
+ Data.KdMap.Dynamic: instance (GHC.Show.Show a, GHC.Show.Show p, GHC.Show.Show v) => GHC.Show.Show (Data.KdMap.Dynamic.KdMap a p v)
+ Data.KdMap.Dynamic: instance Data.Foldable.Foldable (Data.KdMap.Dynamic.KdMap a p)
+ Data.KdMap.Dynamic: instance Data.Traversable.Traversable (Data.KdMap.Dynamic.KdMap a p)
+ Data.KdMap.Dynamic: instance GHC.Base.Functor (Data.KdMap.Dynamic.KdMap a p)
+ 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.Generic (Data.KdMap.Dynamic.KdMap a p v)
+ 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: Empty :: TreeNode a p v
+ Data.KdMap.Static: TreeNode :: TreeNode a p v -> (p, v) -> a -> TreeNode a p v -> TreeNode a p v
+ Data.KdMap.Static: [_axisValue] :: TreeNode a p v -> a
+ Data.KdMap.Static: [_treeLeft] :: TreeNode a p v -> TreeNode a p v
+ Data.KdMap.Static: [_treePoint] :: TreeNode a p v -> (p, v)
+ Data.KdMap.Static: [_treeRight] :: TreeNode a p v -> TreeNode a p v
+ Data.KdMap.Static: data TreeNode a p v
+ Data.KdMap.Static: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData p, Control.DeepSeq.NFData v) => Control.DeepSeq.NFData (Data.KdMap.Static.KdMap a p v)
+ Data.KdMap.Static: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData p, Control.DeepSeq.NFData v) => Control.DeepSeq.NFData (Data.KdMap.Static.TreeNode a p v)
+ 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.KdMap 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 Data.Foldable.Foldable (Data.KdMap.Static.KdMap a p)
+ Data.KdMap.Static: instance Data.Traversable.Traversable (Data.KdMap.Static.KdMap a p)
+ Data.KdMap.Static: instance GHC.Base.Functor (Data.KdMap.Static.KdMap a p)
+ 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.Generic (Data.KdMap.Static.KdMap a p v)
+ Data.KdMap.Static: instance GHC.Generics.Generic (Data.KdMap.Static.TreeNode a p v)
+ 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.Dynamic: instance (GHC.Show.Show a, GHC.Show.Show p) => GHC.Show.Show (Data.KdTree.Dynamic.KdTree a p)
+ Data.KdTree.Dynamic: instance Data.Foldable.Foldable (Data.KdTree.Dynamic.KdTree a)
+ Data.KdTree.Static: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData p) => Control.DeepSeq.NFData (Data.KdTree.Static.KdTree a p)
+ Data.KdTree.Static: instance (GHC.Show.Show a, GHC.Show.Show p) => GHC.Show.Show (Data.KdTree.Static.KdTree a p)
+ Data.KdTree.Static: instance Data.Foldable.Foldable (Data.KdTree.Static.KdTree a)
+ Data.KdTree.Static: instance GHC.Generics.Constructor Data.KdTree.Static.C1_0KdTree
+ Data.KdTree.Static: instance GHC.Generics.Datatype Data.KdTree.Static.D1KdTree
+ Data.KdTree.Static: instance GHC.Generics.Generic (Data.KdTree.Static.KdTree a p)

Files

changelog.md view
@@ -1,3 +1,6 @@+# 0.2.4+* Now exporting KdMap.Static.TreeNode to facilitate advanced usage of the library.+ # 0.2.3 * For internal priority queue implementation, use the heap library instead of pqueue library in order to build on ghc 7.10.
kdt.cabal view
@@ -2,7 +2,7 @@ -- see http://haskell.org/cabal/users-guide/  name:                kdt-version:             0.2.3+version:             0.2.4 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@@ -34,7 +34,7 @@   -- other-modules:   other-extensions:    DeriveGeneric, TemplateHaskell   ghc-options:         -Wall -O3-  ghc-prof-options:    -Wall -O3 -fprof-auto+  -- ghc-prof-options:    -Wall -O3 -fprof-auto   build-depends:       base >=4.6 && <5,                        deepseq >=1.3,                        heap >=1.0.0,@@ -74,7 +74,7 @@   other-modules:        Data.Point2d   hs-source-dirs:       app-src   ghc-options:          -Wall -O3-  ghc-prof-options:     -Wall -O3 -fprof-auto+  -- ghc-prof-options:     -Wall -O3 -fprof-auto                         "-with-rtsopts=-p"   build-depends:        base >=4.6 && <5,                         kdt -any,
lib-src/Data/KdMap/Static.hs view
@@ -34,6 +34,8 @@        , foldrWithKey          -- ** Utilities        , defaultSqrDist+         -- ** Advanced+       , TreeNode(..)          -- ** Internal (for testing)        , isValid        ) where@@ -85,6 +87,10 @@ -- [Point3d {x = 0.0, y = 0.0, z = 0.0}, \"First\"] -- @ +-- | A node of a /k/-d tree structure that stores a point of type @p@+-- with axis values of type @a@. Additionally, each point is+-- associated with a value of type @v@. Note: users typically will not+-- need to use this type, but we export it just in case. data TreeNode a p v = TreeNode { _treeLeft :: TreeNode a p v                                , _treePoint :: (p, v)                                , _axisValue :: a