packages feed

clumpiness 0.17.0.0 → 0.17.0.1

raw patch · 2 files changed

+29/−77 lines, 2 filesdep ~containersdep ~tree-funPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: containers, tree-fun

API changes (from Hackage documentation)

- Math.Clumpiness.Algorithms: relevantList :: (Eq a) => a -> a -> [(a, Int)] -> [Int]
+ Math.Clumpiness.Algorithms: relevantList :: Eq a => a -> a -> [(a, Int)] -> [Int]

Files

clumpiness.cabal view
@@ -1,72 +1,24 @@--- Initial clumpiness.cabal generated by cabal init.  For further --- documentation, see http://haskell.org/cabal/users-guide/---- The name of the package.-name:                clumpiness---- The package version.  See the Haskell package versioning policy (PVP) --- for standards guiding when and how versions should be incremented.--- http://www.haskell.org/haskellwiki/Package_versioning_policy--- PVP summary:      +-+------- breaking API changes---                   | | +----- non-breaking API additions---                   | | | +--- code changes with no API change-version:             0.17.0.0---- A short (one-line) description of the package.-synopsis:            Calculate the clumpiness of leaf properties in a tree---- A longer description of the package.--- description:         ---- The license under which the package is released.-license:             GPL-3---- The file containing the license text.-license-file:        LICENSE---- The package author(s).-author:              Gregory Schwartz---- An email address to which users can send suggestions, bug reports, and --- patches.-maintainer:          gs394@drexel.edu---- A copyright notice.--- copyright:           --category:            Math--build-type:          Simple---- Extra files to be distributed with the package, such as examples or a --- README.--- extra-source-files:  ---- Constraint on the version of Cabal needed to build this package.-cabal-version:       >=1.10-+cabal-version: >=1.10+name: clumpiness+version: 0.17.0.1+license: GPL-3+license-file: LICENSE+maintainer: gsch@mail.med.upenn.edu+author: Gregory Schwartz+synopsis: Calculate the clumpiness of leaf properties in a tree+category: Math+build-type: Simple  library-  -- Modules exported by the library.-  exposed-modules:     Math.Clumpiness.Algorithms-                     , Math.Clumpiness.Types-                     , Math.Clumpiness.Utilities-                     , Math.Clumpiness.Pinpoint-  -  -- Modules included in this library but not exported.-  -- other-modules:       -  -  -- LANGUAGE extensions used by modules in this package.-  other-extensions:    BangPatterns-  -  -- Other library packages from which modules are imported.-  build-depends:       base >=4.6 && <5-                     , containers >=0.5-                     , tree-fun >=0.7-  -  -- Directories containing source files.-  hs-source-dirs:      src-  -  -- Base language which the package is written in.-  default-language:    Haskell2010-  +    exposed-modules:+        Math.Clumpiness.Algorithms+        Math.Clumpiness.Types+        Math.Clumpiness.Utilities+        Math.Clumpiness.Pinpoint+    hs-source-dirs: src+    default-language: Haskell2010+    other-extensions: BangPatterns+    build-depends:+        base >=4.6 && <5,+        containers ==0.5.*,+        tree-fun >=0.7 && <0.9
src/Math/Clumpiness/Pinpoint.hs view
@@ -76,16 +76,16 @@     newPinpoint    = case parent of                          SuperRoot -> Nothing                          _         -> Just-                                      Pinpoint { pinpointLabel = label+                                      Pinpoint { pinpointLabel      = label                                                , pinpointClumpiness = clump                                                , pinpointLeaves = relevantLeaves                                                }-    relevantLeaves = Seq.fromList-                   . filter (viableNode viable validPropertyMap)-                   . M.keys-                   $ descendents-    clump  = Seq.fromList-           $ generateClumpMap viable validPropertyMap newTree+    relevantLeaves   = Seq.fromList+                     . filter (viableNode viable validPropertyMap)+                     . M.keys+                     $ descendents+    clump            = Seq.fromList+                     $ generateClumpMap viable validPropertyMap newTree     validPropertyMap = getValidPropertyMap newTree propertyMap     newTree          = filterRootLeaves . rootSubtree $ tree