packages feed

data-combinator-gen 0.1.0.2 → 0.1.0.3

raw patch · 4 files changed

+10/−6 lines, 4 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

CHANGELOG.md view
@@ -1,14 +1,18 @@ # Revision history for data-combinator-gen -## 0.1.0.1 -- YYYY-mm-dd+## 0.1.0.3 -- 2019-05-26 +* Actually corrected recursion on (,) - it's now right recursive++## 0.1.0.2 -- 2019-05-26+ * Corrected recursion on (,) - it's now right recursive -## 0.1.0.1 -- YYYY-mm-dd+## 0.1.0.1 -- 2019-05-24  * Added newtype support -## 0.1.0.0 -- YYYY-mm-dd+## 0.1.0.0 -- 2019-05-22  * First version. Released on an unsuspecting world. 
README.md view
@@ -2,7 +2,7 @@  Generate a special combinator from any data type. -https://hackage.haskell.org/package/data-combinator-gen-0.1.0.0+https://hackage.haskell.org/package/data-combinator-gen-0.1.0.1  ## Description 
data-combinator-gen.cabal view
@@ -13,7 +13,7 @@ -- PVP summary:      +-+------- breaking API changes --                   | | +----- non-breaking API additions --                   | | | +--- code changes with no API change-version:             0.1.0.2+version:             0.1.0.3  -- A short (one-line) description of the package. synopsis:            Generate a special combinator from any data type.
src/Data/Combinators/TH.hs view
@@ -73,7 +73,7 @@ applyConVars :: [ExpQ] -> t -> [a] -> Int -> ExpQ applyConVars _ _ [] _             = conE (mkName "()") applyConVars varsC _ [_] n        = varsC !! n-applyConVars varsC name' (_:fs) n = tupE ([varsC !! n] ++ [applyConVars varsC name' fs (n-1)])+applyConVars varsC name' (_:fs) n = tupE ([(varsC !! n), applyConVars varsC name' fs (n-1)])  ------