composition-tree 0.2.0.1 → 0.2.0.2

raw patch · 2 files changed

+3/−5 lines, 2 filesdep ~QuickCheckdep ~doctestPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: QuickCheck, doctest

API changes (from Hackage documentation)

Files

• Data/Compositions/Internal.hs +1/−3
• composition-tree.cabal +2/−2

@@ -10,10 +10,8 @@ import Data.Foldable hiding (length) #endif import Prelude hiding (sum, drop, take, length, concatMap, splitAt)- {-# RULES-"take/composed" [~2] forall n xs. composed (take n xs) = takeComposed n xs-  #-}+"take/composed" [~2] forall n xs. composed (take n xs) = takeComposed n xs #-} -- $setup -- >>> :set -XScopedTypeVariables -- >>> import Control.Applicative

@@ -1,5 +1,5 @@ name:                composition-tree-version:             0.2.0.1+version:             0.2.0.2 synopsis:            Composition trees for arbitrary monoids. description:         A compositions list or composition tree is a list data type where the elements are monoids, and the mconcat of any contiguous sublist can be computed in logarithmic time. A common use case of this type is in a wiki, version control system, or collaborative editor, where each change or delta would be stored in a list, and it is sometimes necessary to compute the composed delta between any two versions. license:             BSD3@@ -28,5 +28,5 @@ test-suite             test-comp-tree   type: exitcode-stdio-1.0   main-is: tests.hs-  build-depends: base >= 4.7 && < 4.9, QuickCheck >= 2.8 && < 2.9, composition-tree, doctest >= 0.10 && < 0.11+  build-depends: base >= 4.7 && < 4.9, QuickCheck >= 2.7 && < 2.9, composition-tree, doctest >= 0.9 && < 0.12   default-language:    Haskell2010