recursion-schemes-ext 0.1.0.1 → 0.1.0.2
raw patch · 3 files changed
+5/−3 lines, 3 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.Foldable.Functor.Examples: AddF :: r_aeDd -> r_aeDd -> BertF r_aeDd
+ Data.Foldable.Functor.Examples: AddF :: r_aeDf -> r_aeDf -> BertF r_aeDf
- Data.Foldable.Functor.Examples: BertF :: Ernie -> BertF r_aeDd
+ Data.Foldable.Functor.Examples: BertF :: Ernie -> BertF r_aeDf
- Data.Foldable.Functor.Examples: ErnieF :: Bert -> ErnieF r_aeSB
+ Data.Foldable.Functor.Examples: ErnieF :: Bert -> ErnieF r_aeSD
- Data.Foldable.Functor.Examples: ListF :: [r_aeSB] -> ErnieF r_aeSB
+ Data.Foldable.Functor.Examples: ListF :: [r_aeSD] -> ErnieF r_aeSD
- Data.Foldable.Functor.Examples: MultiplyF :: r_aeSB -> r_aeSB -> ErnieF r_aeSB
+ Data.Foldable.Functor.Examples: MultiplyF :: r_aeSD -> r_aeSD -> ErnieF r_aeSD
- Data.Foldable.Functor.Examples: NumF :: Integer -> BertF r_aeDd
+ Data.Foldable.Functor.Examples: NumF :: Integer -> BertF r_aeDf
- Data.Foldable.Functor.Examples: StringF :: String -> BertF r_aeDd
+ Data.Foldable.Functor.Examples: StringF :: String -> BertF r_aeDf
- Data.Foldable.Functor.Examples: data BertF r_aeDd
+ Data.Foldable.Functor.Examples: data BertF r_aeDf
- Data.Foldable.Functor.Examples: data ErnieF r_aeSB
+ Data.Foldable.Functor.Examples: data ErnieF r_aeSD
Files
recursion-schemes-ext.cabal view
@@ -1,5 +1,5 @@ name: recursion-schemes-ext-version: 0.1.0.1+version: 0.1.0.2 synopsis: Amateur addenda to recursion-schemes description: This package provides some exotic recursion schemes that I miss when I leave Idris. homepage: https://hub.darcs.net/vmchale/recursion-schemes-ext#readme@@ -25,7 +25,7 @@ hs-source-dirs: src exposed-modules: Data.Foldable.Functor.Extensions Data.Foldable.Functor.Examples- build-depends: base >= 4.7 && < 5+ build-depends: base >= 4.9 && < 5 , recursion-schemes , composition-prelude default-language: Haskell2010
src/Data/Foldable/Functor/Extensions.hs view
@@ -54,6 +54,8 @@ -> b -> t' chema = ana .* homoCo +-- FIXME maybe run the catamorphism on the inner bit?+ -- | A dendromorphism allows us to entangle two catamorphisms dendro :: (SubHom (Base t) (Base t') a b, Recursive t') => t -- ^ dummy type
stack.yaml view
@@ -2,7 +2,7 @@ packages: - '.' extra-deps:- - composition-prelude-0.1.0.0+ - composition-prelude-0.1.0.1 - recursion-schemes-ext-0.1.0.0 flags: recursion-schemes-ext: