mono-traversable 0.10.0 → 0.10.0.1

raw patch · 4 files changed

+9/−3 lines, 4 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• ChangeLog.md +4/−0
• mono-traversable.cabal +1/−1
• src/Data/MonoTraversable.hs +1/−2
• test/Spec.hs +3/−0

@@ -1,3 +1,7 @@+## 0.10.0.1++* Instance for Data.Sequence.Seq is incorrect. [#83](https://github.com/snoyberg/mono-traversable/issues/83)+ ## 0.10.0  * Remove `Functor` instance for `MinLen` [#82](https://github.com/snoyberg/mono-traversable/issues/82)

@@ -1,5 +1,5 @@ name:                mono-traversable-version:             0.10.0+version:             0.10.0.1 synopsis:            Type classes for mapping, folding, and traversing monomorphic containers description:         Monomorphic variants of the Functor, Foldable, and Traversable typeclasses. If you understand Haskell's basic typeclasses, you understand mono-traversable. In addition to what you are used to, it adds on an IsSequence typeclass and has code for marking data structures as non-empty. homepage:            https://github.com/snoyberg/mono-traversable

@@ -571,7 +571,7 @@     {-# INLINE omapM_ #-} instance MonoFoldable (Tree a) instance MonoFoldable (Seq a) where-    headEx = flip Seq.index 1+    headEx = flip Seq.index 0     lastEx xs = Seq.index xs (Seq.length xs - 1)     {-# INLINE headEx #-}     {-# INLINE lastEx #-}@@ -1297,4 +1297,3 @@                        EmptyR  -> Seq.empty                        ys :> y -> ys Seq.|> y         ) :> f w-

@@ -457,3 +457,6 @@         it "#31 find doesn't infinitely loop on NonEmpty" $             find (== "a") ("a" NE.:| ["d","fgf"]) @?= Just "a" +        it "#83 head on Seq works correctly" $ do+            headEx (Seq.fromList [1 :: Int,2,3]) @?= (1 :: Int)+            headMay (Seq.fromList [] :: Seq.Seq Int) @?= Nothing