functor-combinators 0.1.1.0 → 0.1.1.1
raw patch · 3 files changed
+10/−10 lines, 3 filesdep −recursion-schemesdep ~trivial-constraintPVP: minor bump suggested
API additions: PVP suggests at least a minor version bump
Dependencies removed: recursion-schemes
Dependency ranges changed: trivial-constraint
API changes (from Hackage documentation)
+ Control.Applicative.ListF: pattern ProdNonEmpty :: (f :*: ListF f) a -> NonEmptyF f a
+ Control.Monad.Freer.Church: pattern Comp :: Functor f => f (g a) -> Comp f g a
+ Data.Functor.Apply.Free: pattern DayAp1 :: Day f (Ap f) a -> Ap1 f a
+ Data.Functor.Combinator: pattern DayAp1 :: Day f (Ap f) a -> Ap1 f a
+ Data.Functor.Combinator: pattern ProdNonEmpty :: (f :*: ListF f) a -> NonEmptyF f a
+ Data.Functor.Combinator: pattern Comp :: Functor f => f (g a) -> Comp f g a
Files
- functor-combinators.cabal +6/−8
- src/Data/HFunctor/Internal.hs +2/−0
- src/Data/HFunctor/Interpret.hs +2/−2
functor-combinators.cabal view
@@ -1,13 +1,13 @@ cabal-version: 1.12 --- This file has been generated from package.yaml by hpack version 0.31.1.+-- This file has been generated from package.yaml by hpack version 0.31.2. -- -- see: https://github.com/sol/hpack ----- hash: c6b3ac6a253af1f757fe65a13f8811131ac75e448c2cba76845cde36af47fdec+-- hash: fe8311fa4240fa72d0cf9023f7b1410f94e3b6bbee3bb8ba0164ecf28d7265d0 name: functor-combinators-version: 0.1.1.0+version: 0.1.1.1 synopsis: Tools for functor combinator-based program design description: Tools for working with /functor combinators/: types that take functors (or other indexed types) and returns a new functor that "enhances" or "mixes"@@ -81,12 +81,11 @@ , nonempty-containers , pointed , profunctors- , recursion-schemes , semigroupoids , tagged , these , transformers- , trivial-constraint >=0.5.1+ , trivial-constraint >=0.6 , vinyl default-language: Haskell2010 @@ -107,11 +106,10 @@ , dependent-sum , free , functor-combinators- , hedgehog >=1.0+ , hedgehog >=0.6 , nonempty-containers , semigroupoids- , tagged , tasty- , tasty-hedgehog >=1.0+ , tasty-hedgehog , transformers default-language: Haskell2010
src/Data/HFunctor/Internal.hs view
@@ -77,6 +77,8 @@ -- -- This class is similar to 'Control.Monad.Morph.MFunctor' from -- "Control.Monad.Morph", but instances must work without a 'Monad' constraint.+--+-- This class is also found in the /hschema/ library with the same name. class HFunctor t where -- | If we can turn an @f@ into a @g@, then we can turn a @t f@ into -- a @t g@.
src/Data/HFunctor/Interpret.hs view
@@ -414,7 +414,7 @@ instance Interpret ProxyF where type C ProxyF = Impossible - retract = absurdible . reProxy+ retract = nope . reProxy reProxy :: p f a -> Proxy f reProxy _ = Proxy@@ -424,7 +424,7 @@ instance Monoid e => Interpret (ConstF e) where type C (ConstF e) = Impossible - retract = absurdible . reProxy+ retract = nope . reProxy -- | A constraint on @a@ for both @c a@ and @d a@. Requiring @'AndC' -- 'Show' 'Eq' a@ is the same as requiring @('Show' a, 'Eq' a)@.