composition-tree 0.2.0.2 → 0.2.0.3
raw patch · 2 files changed
+6/−3 lines, 2 filesdep ~basePVP ok
version bump matches the API change (PVP)
Dependency ranges changed: base
API changes (from Hackage documentation)
Files
Data/Compositions/Internal.hs view
@@ -121,6 +121,8 @@ -- -- prop> \(l :: [Element]) n -> drop n (fromList l) == fromList (List.drop n l) -- prop> \(Compositions l) n -> toList (drop n l) == List.drop n (toList l)++{-# NOINLINE[0] drop #-} drop :: Monoid a => Int -> Compositions a -> Compositions a drop i = Tree . go i . unwrap where go n xs | n <= 0 = xs@@ -149,6 +151,7 @@ -- prop> \(Compositions l) n -> toList (take n l) == List.take n (toList l) -- -- prop> \(Compositions l) (Positive n) -> take n l <> drop n l == l+{-# NOINLINE take #-} take :: Monoid a => Int -> Compositions a -> Compositions a take i = go i . unwrap where go n _ | n <= 0 = mempty
composition-tree.cabal view
@@ -1,5 +1,5 @@ name: composition-tree-version: 0.2.0.2+version: 0.2.0.3 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@@ -21,12 +21,12 @@ Data.Compositions.Snoc Data.Compositions.Snoc.Internal other-extensions: ScopedTypeVariables, DeriveFunctor, GeneralizedNewtypeDeriving- build-depends: base >=4.7 && <4.9+ build-depends: base >=4.7 && <4.10 default-language: Haskell2010 test-suite test-comp-tree type: exitcode-stdio-1.0 main-is: tests.hs- build-depends: base >= 4.7 && < 4.9, QuickCheck >= 2.7 && < 2.9, composition-tree, doctest >= 0.9 && < 0.12+ build-depends: base >= 4.7 && < 4.10, QuickCheck >= 2.7 && < 2.9, composition-tree, doctest >= 0.9 && < 0.12 default-language: Haskell2010