barbies 2.1.0.0 → 2.1.1.0

raw patch · 8 files changed

+29/−5 lines, 8 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• ChangeLog.md +11/−4
• barbies.cabal +1/−1
• src/Barbies/Bi.hs +2/−0
• src/Barbies/Internal/ConstraintsB.hs +2/−0
• src/Barbies/Internal/ConstraintsT.hs +2/−0
• src/Barbies/Internal/TraversableB.hs +4/−0
• src/Barbies/Internal/TraversableT.hs +4/−0
• src/Data/Functor/Barbie.hs +3/−0

@@ -1,12 +1,19 @@ # Changelog for barbies -## 2.1.0.0-  - Remove the deprecated interface from 1.x version-  - Add flipped-argument versions of `traverse` functions )Jack Kelly).-    By analogy to `Data.Traversable.for` in `base` these are similarly-named:+## 2.1.1.0+  - Correctly export the following functions, which were not+    accessible in 2.1.0.0:     - `Data.Barbie.bfor`     - `Data.Barbie.bfor_`     - `Data.Barbie.bforC`++## 2.1.0.0+  - Remove the deprecated interface from 1.x version+  - Add flipped-argument versions of `traverse` functions (Jack Kelly).+    By analogy to `Data.Traversable.for` in `base` these are similarly-named:+    - ~~`Data.Barbie.bfor`~~+    - ~~`Data.Barbie.bfor_`~~+    - ~~`Data.Barbie.bforC`~~     - `Data.Functor.Transformer.tfor`     - `Data.Functor.Transformer.tforC`     - `Data.Functor.Transformer.tfor_`

@@ -1,5 +1,5 @@ name:           barbies-version:        2.1.0.0+version:        2.1.1.0 synopsis:       Classes for working with types that can change clothes. description:    Types that are parametric on a functor are like Barbies that have an outfit for each role. This package provides the basic abstractions to work with them comfortably. category:       Data Structures

@@ -111,6 +111,8 @@ {-# INLINE bttraverse1 #-}  -- | 'bttraverse1' with the arguments flipped.+--+-- @since 2.1.0.0 btfor1   :: ( TraversableB (b f)      , TraversableT b

@@ -154,6 +154,8 @@ -- @ -- bforC someBarbie $ \fa -> ... -- @+--+-- @since 2.1.1.0 bforC   :: forall c b f g e   .  (TraversableB b, ConstraintsB b, AllB c b, Applicative e)

@@ -124,6 +124,8 @@   = ttraverse (\(Pair (Dict :: Dict c a) x) -> f x) (taddDicts t)  -- | Like 'ttraverseC' but with the arguments flipped.+--+-- @since 2.1.0.0 tforC   :: forall c t f g e x   .  (TraversableT t, ConstraintsT t, AllT c t, Applicative e)

@@ -57,6 +57,8 @@ -- @ -- bfor someBarbie $ \fa -> ... -- @+--+-- @since 2.1.1.0 bfor   :: (TraversableB b, Applicative e)   => b f@@ -76,6 +78,8 @@   = void . btraverse (fmap (const $ Const ()) . f)  -- | 'btraverse_' with the arguments flipped.+--+-- @since 2.1.1.0 bfor_   :: (TraversableB b, Applicative e)   => b f

@@ -67,6 +67,8 @@ -- @ -- tfor someTransformer $ \fa -> ... -- @+--+-- @since 2.1.0.0 tfor   :: (TraversableT t, Applicative e)   => t f x@@ -85,6 +87,8 @@   = void . ttraverse (fmap (const $ Const ()) . f)  -- | 'ttraverse_' with the arguments flipped.+--+-- @since 2.1.0.0 tfor_   :: (TraversableT t, Applicative e)   => t f x

@@ -11,7 +11,9 @@     -- * Traversable   , Trav.TraversableB(btraverse)     -- ** Utility functions+  , Trav.bfor   , Trav.btraverse_+  , Trav.bfor_   , Trav.bfoldMap   , Trav.bsequence   , Trav.bsequence'@@ -59,6 +61,7 @@   , Cons.bmapC   , Cons.bfoldMapC   , Cons.btraverseC+  , Cons.bforC   , Cons.bpureC   , Cons.bzipWithC   , Cons.bzipWith3C