data-forest 0.1.0.5 → 0.1.0.6

raw patch · 2 files changed

+10/−6 lines, 2 filesdep ~basePVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base

API changes (from Hackage documentation)

Files

• data-forest.cabal +9/−5
• src/Data/Forest.hs +1/−1

@@ -1,9 +1,11 @@--- This file has been generated from package.yaml by hpack version 0.18.1.+-- This file has been generated from package.yaml by hpack version 0.20.0. -- -- see: https://github.com/sol/hpack+--+-- hash: 3264284ad6b263baf1c0973e2ade81a7e7531b5ad752b9568c99b8636244caed  name:           data-forest-version:        0.1.0.5+version:        0.1.0.6 synopsis:       A simple multi-way tree data structure.  description:    In some contexts, forests (collections of zero or more trees) are more important than trees. The /data-forest/ library provides a @Tree@ type much like the one from the popular /containers/ library, but it also provides a @Forest@ type with its own @Functor@ and @Foldable@ instances.@@ -22,7 +24,7 @@   default-extensions: NoImplicitPrelude   ghc-options: -Wall   build-depends:-      base >= 4.9 && < 4.10+      base >=4.9 && <4.11   exposed-modules:       Data.Forest   other-modules:@@ -37,7 +39,9 @@   default-extensions: NoImplicitPrelude   ghc-options: -Wall   build-depends:-      base >= 4.9 && < 4.10-    , doctest+      base >=4.9 && <4.11     , data-forest+    , doctest+  other-modules:+      Paths_data_forest   default-language: Haskell2010

@@ -41,7 +41,7 @@ import Data.Eq (Eq) import Data.Foldable (Foldable) import Data.Function (($))-import Data.Functor (Functor, (<$>), fmap)+import Data.Functor (Functor, fmap, (<$>)) import Data.Monoid (Monoid, mempty) import Data.Semigroup (Semigroup) import Data.Traversable (Traversable)