row-types 1.0.1.1 → 1.0.1.2

raw patch · 5 files changed

+15/−8 lines, 5 filesdep ~basePVP: minor bump suggested

API additions: PVP suggests at least a minor version bump

Dependency ranges changed: base

API changes (from Hackage documentation)

Files

• CHANGELOG.md +6/−0
• row-types.cabal +3/−3
• src/Data/Row/Dictionaries.hs +1/−0
• src/Data/Row/Records.hs +3/−3
• src/Data/Row/Variants.hs +2/−2

@@ -1,3 +1,9 @@+## 1.0.1.2 [2021-09-10]+- Update Stack to use GHC 8.10.7+- Fix a few warnings+- Minor updates to support GHC 9.0.1++ ## 1.0.1.1 [2021-09-09] - Improved type checking performance on Diff and Merge ([Thanks ak3n!](https://github.com/target/row-types/pull/77)) 

@@ -1,5 +1,5 @@ Name:                row-types-Version:             1.0.1.1+Version:             1.0.1.2 License:             MIT License-file:        LICENSE Author:              Daniel Winograd-Cort, Matthew Farkas-Dyck@@ -7,7 +7,7 @@ homepage:            https://github.com/target/row-types Build-Type:          Simple Cabal-Version:       >=1.10-Tested-With:         GHC == 8.6.5, GHC == 8.8.3, GHC == 8.10.3+Tested-With:         GHC == 8.6.5, GHC == 8.8.3, GHC == 8.10.7, GHC == 9.0.1 Category:            Data, Data Structures Synopsis:	           Open Records and Variants Description:@@ -28,7 +28,7 @@  Library   Build-Depends:-    base >= 2 && < 5,+    base >= 2 && < 6,     constraints >= 0.11,     deepseq >= 1.4,     hashable >= 1.2,

@@ -44,6 +44,7 @@   , mapForall   , apSingleForall   , subsetJoin, subsetJoin', subsetRestrict, subsetTrans+  , mapDifference, apSingleDifference   -- ** Helper Types   , IsA(..)   , As(..)

@@ -399,7 +399,7 @@  -- | A function to map over a record given no constraint. map' :: forall f r. FreeForall r => (forall a. a -> f a) -> Rec r -> Rec (Map f r)-map' = map @Unconstrained1+map' f = map @Unconstrained1 f  -- | Lifts a natural transformation over a record.  In other words, it acts as a -- record transformer to convert a record of @f a@ values to a record of @g a@@@ -420,7 +420,7 @@  -- | A version of 'transform' for when there is no constraint. transform' :: forall r f g. FreeForall r => (forall a. f a -> g a) -> Rec (Map f r) -> Rec (Map g r)-transform' = transform @Unconstrained1 @r+transform' f = transform @Unconstrained1 @r f   data RecMapPair f g ρ = RecMapPair (Rec (Map f ρ)) (Rec (Map g ρ))@@ -445,7 +445,7 @@ -- | A version of 'zipTransform' for when there is no constraint. zipTransform' :: forall r f g h .   FreeForall r => (forall a. f a -> g a -> h a) -> Rec (Map f r) -> Rec (Map g r) -> Rec (Map h r)-zipTransform' = zipTransform @Unconstrained1 @r+zipTransform' f = zipTransform @Unconstrained1 @r f  -- | Traverse a function over a record.  Note that the fields of the record will -- be accessed in lexicographic order by the labels.

@@ -300,7 +300,7 @@  -- | A function to map over a variant given no constraint. map' :: forall f r. FreeForall r => (forall a. a -> f a) -> Var r -> Var (Map f r)-map' = map @Unconstrained1+map' f = map @Unconstrained1 f  -- | Lifts a natrual transformation over a variant.  In other words, it acts as a -- variant transformer to convert a variant of @f a@ values to a variant of @g a@@@ -325,7 +325,7 @@  -- | A form of @transformC@ that doesn't have a constraint on @a@ transform' :: forall r f g . FreeForall r => (forall a. f a -> g a) -> Var (Map f r) -> Var (Map g r)-transform' = transform @Unconstrained1 @r+transform' f = transform @Unconstrained1 @r f  -- | Traverse a function over a variant. traverse :: forall c f r. (Forall r c, Functor f) => (forall a. c a => a -> f a) -> Var r -> f (Var r)