RepLib 0.5.4 → 0.5.4.1

raw patch · 2 files changed

+45/−24 lines, 2 filesdep ~template-haskellPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: template-haskell

API changes (from Hackage documentation)

- Generics.RepLib: data (:~:) k (a :: k) (b :: k) :: forall k. k -> k -> *

- Generics.RepLib.AbstractReps: instance (Generics.RepLib.R.Rep k0, Generics.RepLib.R.Rep a0) => Generics.RepLib.R.Rep (Data.Map.Base.Map k0 a0)

- Generics.RepLib.AbstractReps: instance (Generics.RepLib.R.Rep k0, Generics.RepLib.R.Rep a0) => Generics.RepLib.R1.Rep1 ctx0 (Data.Map.Base.Map k0 a0)

- Generics.RepLib.AbstractReps: instance Generics.RepLib.R.Rep a0 => Generics.RepLib.R.Rep (Data.Set.Base.Set a0)

- Generics.RepLib.AbstractReps: instance Generics.RepLib.R.Rep a0 => Generics.RepLib.R1.Rep1 ctx0 (Data.Set.Base.Set a0)

- Generics.RepLib.Derive: instance Control.Monad.Writer.Class.MonadWriter (Data.Set.Base.Set GHC.Types.Int) Generics.RepLib.Derive.QN

- Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Enumerate a) => Generics.RepLib.Lib.Enumerate (Data.Set.Base.Set a)

- Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Generate a) => Generics.RepLib.Lib.Generate (Data.Set.Base.Set a)

- Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Lreduce b a) => Generics.RepLib.Lib.Lreduce b (Data.Set.Base.Set a)

- Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Rreduce b a) => Generics.RepLib.Lib.Rreduce b (Data.Set.Base.Set a)

- Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Shrink a) => Generics.RepLib.Lib.Shrink (Data.Set.Base.Set a)

- Generics.RepLib.Lib: instance (GHC.Classes.Ord k, Generics.RepLib.Lib.Enumerate k, Generics.RepLib.Lib.Enumerate a) => Generics.RepLib.Lib.Enumerate (Data.Map.Base.Map k a)

- Generics.RepLib.Lib: instance (GHC.Classes.Ord k, Generics.RepLib.Lib.Generate k, Generics.RepLib.Lib.Generate a) => Generics.RepLib.Lib.Generate (Data.Map.Base.Map k a)

- Generics.RepLib.Lib: instance (GHC.Classes.Ord k, Generics.RepLib.Lib.Shrink k, Generics.RepLib.Lib.Shrink a) => Generics.RepLib.Lib.Shrink (Data.Map.Base.Map k a)

- Generics.RepLib.Lib: instance (Generics.RepLib.R.Rep k, Generics.RepLib.Lib.GSum a) => Generics.RepLib.Lib.GSum (Data.Map.Base.Map k a)

- Generics.RepLib.Lib: instance (Generics.RepLib.R.Rep k, Generics.RepLib.R.Rep a) => Generics.RepLib.Lib.Zero (Data.Map.Base.Map k a)

- Generics.RepLib.Lib: instance Generics.RepLib.Lib.Fold (Data.Map.Base.Map k)

- Generics.RepLib.Lib: instance Generics.RepLib.Lib.Fold Data.Set.Base.Set

- Generics.RepLib.Lib: instance Generics.RepLib.Lib.GSum a => Generics.RepLib.Lib.GSum (Data.Set.Base.Set a)

- Generics.RepLib.Lib: instance Generics.RepLib.R.Rep a => Generics.RepLib.Lib.Zero (Data.Set.Base.Set a)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R.Rep b0) => Generics.RepLib.R.Rep (Data.Either.Either a0 b0)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R.Rep b0, Generics.RepLib.R.Rep c0) => Generics.RepLib.R.Rep (a0, b0, c0)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R.Rep b0, Generics.RepLib.R.Rep c0, Generics.RepLib.R.Rep d0) => Generics.RepLib.R.Rep (a0, b0, c0, d0)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R.Rep b0, Generics.RepLib.R.Rep c0, Generics.RepLib.R.Rep d0, Generics.RepLib.R.Rep e0, Generics.RepLib.R.Rep f0, Generics.RepLib.R.Rep g0, Generics.RepLib.R1.Sat (ctx0 a0), Generics.RepLib.R1.Sat (ctx0 b0), Generics.RepLib.R1.Sat (ctx0 c0), Generics.RepLib.R1.Sat (ctx0 d0), Generics.RepLib.R1.Sat (ctx0 e0), Generics.RepLib.R1.Sat (ctx0 f0), Generics.RepLib.R1.Sat (ctx0 g0)) => Generics.RepLib.R1.Rep1 ctx0 (a0, b0, c0, d0, e0, f0, g0)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R.Rep b0, Generics.RepLib.R.Rep c0, Generics.RepLib.R.Rep d0, Generics.RepLib.R.Rep e0, Generics.RepLib.R.Rep f0, Generics.RepLib.R1.Sat (ctx0 a0), Generics.RepLib.R1.Sat (ctx0 b0), Generics.RepLib.R1.Sat (ctx0 c0), Generics.RepLib.R1.Sat (ctx0 d0), Generics.RepLib.R1.Sat (ctx0 e0), Generics.RepLib.R1.Sat (ctx0 f0)) => Generics.RepLib.R1.Rep1 ctx0 (a0, b0, c0, d0, e0, f0)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R.Rep b0, Generics.RepLib.R.Rep c0, Generics.RepLib.R.Rep d0, Generics.RepLib.R.Rep e0, Generics.RepLib.R1.Sat (ctx0 a0), Generics.RepLib.R1.Sat (ctx0 b0), Generics.RepLib.R1.Sat (ctx0 c0), Generics.RepLib.R1.Sat (ctx0 d0), Generics.RepLib.R1.Sat (ctx0 e0)) => Generics.RepLib.R1.Rep1 ctx0 (a0, b0, c0, d0, e0)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R.Rep b0, Generics.RepLib.R.Rep c0, Generics.RepLib.R1.Sat (ctx0 a0), Generics.RepLib.R1.Sat (ctx0 b0), Generics.RepLib.R1.Sat (ctx0 c0)) => Generics.RepLib.R1.Rep1 ctx0 (a0, b0, c0)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R.Rep b0, Generics.RepLib.R1.Sat (ctx0 a0), Generics.RepLib.R1.Sat (ctx0 b0)) => Generics.RepLib.R1.Rep1 ctx0 (Data.Either.Either a0 b0)

- Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a0, Generics.RepLib.R1.Sat (ctx0 a0)) => Generics.RepLib.R1.Rep1 ctx0 (GHC.Base.Maybe a0)

- Generics.RepLib.PreludeReps: instance Generics.RepLib.R.Rep a0 => Generics.RepLib.R.Rep (GHC.Base.Maybe a0)

- Generics.RepLib.PreludeReps: instance Generics.RepLib.R1.Rep1 ctx0 GHC.Types.Bool

- Generics.RepLib.PreludeReps: instance Generics.RepLib.R1.Rep1 ctx0 GHC.Types.Ordering

- Generics.RepLib.R: data (:*:) a l

+ Generics.RepLib: data (:~:) (a :: k) (b :: k) :: forall k. () => k -> k -> *

+ Generics.RepLib.AbstractReps: instance (Generics.RepLib.R.Rep k, Generics.RepLib.R.Rep a) => Generics.RepLib.R.Rep (Data.Map.Internal.Map k a)

+ Generics.RepLib.AbstractReps: instance (Generics.RepLib.R.Rep k, Generics.RepLib.R.Rep a) => Generics.RepLib.R1.Rep1 ctx (Data.Map.Internal.Map k a)

+ Generics.RepLib.AbstractReps: instance Generics.RepLib.R.Rep a => Generics.RepLib.R.Rep (Data.Set.Internal.Set a)

+ Generics.RepLib.AbstractReps: instance Generics.RepLib.R.Rep a => Generics.RepLib.R1.Rep1 ctx (Data.Set.Internal.Set a)

+ Generics.RepLib.Derive: instance Control.Monad.IO.Class.MonadIO Generics.RepLib.Derive.QN

+ Generics.RepLib.Derive: instance Control.Monad.Writer.Class.MonadWriter (Data.Set.Internal.Set GHC.Types.Int) Generics.RepLib.Derive.QN

+ Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Enumerate a) => Generics.RepLib.Lib.Enumerate (Data.Set.Internal.Set a)

+ Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Generate a) => Generics.RepLib.Lib.Generate (Data.Set.Internal.Set a)

+ Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Lreduce b a) => Generics.RepLib.Lib.Lreduce b (Data.Set.Internal.Set a)

+ Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Rreduce b a) => Generics.RepLib.Lib.Rreduce b (Data.Set.Internal.Set a)

+ Generics.RepLib.Lib: instance (GHC.Classes.Ord a, Generics.RepLib.Lib.Shrink a) => Generics.RepLib.Lib.Shrink (Data.Set.Internal.Set a)

+ Generics.RepLib.Lib: instance (GHC.Classes.Ord k, Generics.RepLib.Lib.Enumerate k, Generics.RepLib.Lib.Enumerate a) => Generics.RepLib.Lib.Enumerate (Data.Map.Internal.Map k a)

+ Generics.RepLib.Lib: instance (GHC.Classes.Ord k, Generics.RepLib.Lib.Generate k, Generics.RepLib.Lib.Generate a) => Generics.RepLib.Lib.Generate (Data.Map.Internal.Map k a)

+ Generics.RepLib.Lib: instance (GHC.Classes.Ord k, Generics.RepLib.Lib.Shrink k, Generics.RepLib.Lib.Shrink a) => Generics.RepLib.Lib.Shrink (Data.Map.Internal.Map k a)

+ Generics.RepLib.Lib: instance (Generics.RepLib.R.Rep k, Generics.RepLib.Lib.GSum a) => Generics.RepLib.Lib.GSum (Data.Map.Internal.Map k a)

+ Generics.RepLib.Lib: instance (Generics.RepLib.R.Rep k, Generics.RepLib.R.Rep a) => Generics.RepLib.Lib.Zero (Data.Map.Internal.Map k a)

+ Generics.RepLib.Lib: instance Generics.RepLib.Lib.Fold (Data.Map.Internal.Map k)

+ Generics.RepLib.Lib: instance Generics.RepLib.Lib.Fold Data.Set.Internal.Set

+ Generics.RepLib.Lib: instance Generics.RepLib.Lib.GSum a => Generics.RepLib.Lib.GSum (Data.Set.Internal.Set a)

+ Generics.RepLib.Lib: instance Generics.RepLib.R.Rep a => Generics.RepLib.Lib.Zero (Data.Set.Internal.Set a)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b) => Generics.RepLib.R.Rep (Data.Either.Either a b)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b, Generics.RepLib.R.Rep c) => Generics.RepLib.R.Rep (a, b, c)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b, Generics.RepLib.R.Rep c, Generics.RepLib.R.Rep d) => Generics.RepLib.R.Rep (a, b, c, d)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b, Generics.RepLib.R.Rep c, Generics.RepLib.R.Rep d, Generics.RepLib.R.Rep e, Generics.RepLib.R.Rep f, Generics.RepLib.R.Rep g, Generics.RepLib.R1.Sat (ctx a), Generics.RepLib.R1.Sat (ctx b), Generics.RepLib.R1.Sat (ctx c), Generics.RepLib.R1.Sat (ctx d), Generics.RepLib.R1.Sat (ctx e), Generics.RepLib.R1.Sat (ctx f), Generics.RepLib.R1.Sat (ctx g)) => Generics.RepLib.R1.Rep1 ctx (a, b, c, d, e, f, g)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b, Generics.RepLib.R.Rep c, Generics.RepLib.R.Rep d, Generics.RepLib.R.Rep e, Generics.RepLib.R.Rep f, Generics.RepLib.R1.Sat (ctx a), Generics.RepLib.R1.Sat (ctx b), Generics.RepLib.R1.Sat (ctx c), Generics.RepLib.R1.Sat (ctx d), Generics.RepLib.R1.Sat (ctx e), Generics.RepLib.R1.Sat (ctx f)) => Generics.RepLib.R1.Rep1 ctx (a, b, c, d, e, f)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b, Generics.RepLib.R.Rep c, Generics.RepLib.R.Rep d, Generics.RepLib.R.Rep e, Generics.RepLib.R1.Sat (ctx a), Generics.RepLib.R1.Sat (ctx b), Generics.RepLib.R1.Sat (ctx c), Generics.RepLib.R1.Sat (ctx d), Generics.RepLib.R1.Sat (ctx e)) => Generics.RepLib.R1.Rep1 ctx (a, b, c, d, e)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b, Generics.RepLib.R.Rep c, Generics.RepLib.R.Rep d, Generics.RepLib.R1.Sat (ctx a), Generics.RepLib.R1.Sat (ctx b), Generics.RepLib.R1.Sat (ctx c), Generics.RepLib.R1.Sat (ctx d)) => Generics.RepLib.R1.Rep1 ctx (a, b, c, d)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b, Generics.RepLib.R.Rep c, Generics.RepLib.R1.Sat (ctx a), Generics.RepLib.R1.Sat (ctx b), Generics.RepLib.R1.Sat (ctx c)) => Generics.RepLib.R1.Rep1 ctx (a, b, c)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R.Rep b, Generics.RepLib.R1.Sat (ctx a), Generics.RepLib.R1.Sat (ctx b)) => Generics.RepLib.R1.Rep1 ctx (Data.Either.Either a b)

+ Generics.RepLib.PreludeReps: instance (Generics.RepLib.R.Rep a, Generics.RepLib.R1.Sat (ctx a)) => Generics.RepLib.R1.Rep1 ctx (GHC.Base.Maybe a)

+ Generics.RepLib.PreludeReps: instance Generics.RepLib.R.Rep a => Generics.RepLib.R.Rep (GHC.Base.Maybe a)

+ Generics.RepLib.PreludeReps: instance Generics.RepLib.R1.Rep1 ctx GHC.Types.Bool

+ Generics.RepLib.PreludeReps: instance Generics.RepLib.R1.Rep1 ctx GHC.Types.Ordering

+ Generics.RepLib.R: data a (:*:) l

- Generics.RepLib: [Refl] :: (:~:) k a a

+ Generics.RepLib: [Refl] :: a :~: a

- Generics.RepLib: class TestEquality k (f :: k -> *)

+ Generics.RepLib: class TestEquality (f :: k -> *)

- Generics.RepLib: testEquality :: f a -> f b -> Maybe ((:~:) k a b)

+ Generics.RepLib: testEquality :: TestEquality f => f a -> f b -> Maybe a :~: b

- Generics.RepLib.AbstractReps: rMap :: forall k_aBud a_aBue. (Rep k_aBud, Rep a_aBue) => R (Map k_aBud a_aBue)

+ Generics.RepLib.AbstractReps: rMap :: forall k_as7N a_as7O. (Rep k_as7N, Rep a_as7O) => R (Map k_as7N a_as7O)

- Generics.RepLib.AbstractReps: rMap1 :: forall ctx_aBul k_aBud a_aBue. (Rep k_aBud, Rep a_aBue) => R1 ctx_aBul (Map k_aBud a_aBue)

+ Generics.RepLib.AbstractReps: rMap1 :: forall ctx_as81 k_as7N a_as7O. (Rep k_as7N, Rep a_as7O) => R1 ctx_as81 (Map k_as7N a_as7O)

- Generics.RepLib.AbstractReps: rSet :: forall a_acKl. Rep a_acKl => R (Set a_acKl)

+ Generics.RepLib.AbstractReps: rSet :: forall a_acXy. Rep a_acXy => R (Set a_acXy)

- Generics.RepLib.AbstractReps: rSet1 :: forall ctx_aBuz a_acKl. Rep a_acKl => R1 ctx_aBuz (Set a_acKl)

+ Generics.RepLib.AbstractReps: rSet1 :: forall ctx_as8m a_acXy. Rep a_acXy => R1 ctx_as8m (Set a_acXy)

- Generics.RepLib.Lib: GSumD :: (a -> Int) -> GSumD a

+ Generics.RepLib.Lib: GSumD :: a -> Int -> GSumD a

- Generics.RepLib.Lib: GenerateD :: (Int -> [a]) -> GenerateD a

+ Generics.RepLib.Lib: GenerateD :: Int -> [a] -> GenerateD a

- Generics.RepLib.Lib: LreduceD :: (b -> a -> b) -> LreduceD b a

+ Generics.RepLib.Lib: LreduceD :: b -> a -> b -> LreduceD b a

- Generics.RepLib.Lib: RreduceD :: (a -> b -> b) -> RreduceD b a

+ Generics.RepLib.Lib: RreduceD :: a -> b -> b -> RreduceD b a

- Generics.RepLib.Lib: ShrinkD :: (a -> [a]) -> ShrinkD a

+ Generics.RepLib.Lib: ShrinkD :: a -> [a] -> ShrinkD a

- Generics.RepLib.Lib: class Rep1 EnumerateD a => Enumerate a where enumerate = enumerateR1 rep1

+ Generics.RepLib.Lib: class Rep1 EnumerateD a => Enumerate a

- Generics.RepLib.Lib: class Rep1 GSumD a => GSum a where gsum = gsumR1 rep1

+ Generics.RepLib.Lib: class Rep1 GSumD a => GSum a

- Generics.RepLib.Lib: class Rep1 GenerateD a => Generate a where generate = generateR1 rep1

+ Generics.RepLib.Lib: class Rep1 GenerateD a => Generate a

- Generics.RepLib.Lib: class Rep1 (LreduceD b) a => Lreduce b a where lreduce = lreduceR1 rep1

+ Generics.RepLib.Lib: class Rep1 (LreduceD b) a => Lreduce b a

- Generics.RepLib.Lib: class Rep1 (RreduceD b) a => Rreduce b a where rreduce = rreduceR1 rep1

+ Generics.RepLib.Lib: class Rep1 (RreduceD b) a => Rreduce b a

- Generics.RepLib.Lib: class (Rep1 ShrinkD a) => Shrink a where shrink a = subtrees a ++ shrinkStep a where shrinkStep _t = let M _ ts = gmapM1 m a in ts m :: forall b. ShrinkD b -> b -> M b m d x = M x (shrinkD d x)

+ Generics.RepLib.Lib: class (Rep1 ShrinkD a) => Shrink a

- Generics.RepLib.Lib: class (Rep1 ZeroD a) => Zero a where zero = zeroR1 rep1

+ Generics.RepLib.Lib: class (Rep1 ZeroD a) => Zero a

- Generics.RepLib.PreludeReps: rBool1 :: forall ctx_aq1C. () -> () -> R1 ctx_aq1C Bool

+ Generics.RepLib.PreludeReps: rBool1 :: forall ctx_aokd. () -> () -> R1 ctx_aokd Bool

- Generics.RepLib.PreludeReps: rEither :: forall a_aq1V b_aq1W. (Rep a_aq1V, Rep b_aq1W) => R (Either a_aq1V b_aq1W)

+ Generics.RepLib.PreludeReps: rEither :: forall a_aokA b_aokB. (Rep a_aokA, Rep b_aokB) => R (Either a_aokA b_aokB)

- Generics.RepLib.PreludeReps: rEither1 :: forall ctx_aq23 a_aq1V b_aq1W. (Rep a_aq1V, Rep b_aq1W) => ctx_aq23 a_aq1V -> ctx_aq23 b_aq1W -> R1 ctx_aq23 (Either a_aq1V b_aq1W)

+ Generics.RepLib.PreludeReps: rEither1 :: forall ctx_aokO a_aokA b_aokB. (Rep a_aokA, Rep b_aokB) => ctx_aokO a_aokA -> ctx_aokO b_aokB -> R1 ctx_aokO (Either a_aokA b_aokB)

- Generics.RepLib.PreludeReps: rMaybe :: forall a_12. Rep a_12 => R (Maybe a_12)

+ Generics.RepLib.PreludeReps: rMaybe :: forall a_11. Rep a_11 => R (Maybe a_11)

- Generics.RepLib.PreludeReps: rMaybe1 :: forall ctx_aq1J a_12. Rep a_12 => () -> ctx_aq1J a_12 -> R1 ctx_aq1J (Maybe a_12)

+ Generics.RepLib.PreludeReps: rMaybe1 :: forall ctx_aokm a_11. Rep a_11 => () -> ctx_aokm a_11 -> R1 ctx_aokm (Maybe a_11)

- Generics.RepLib.PreludeReps: rOrdering1 :: forall ctx_aq2k. () -> () -> () -> R1 ctx_aq2k Ordering

+ Generics.RepLib.PreludeReps: rOrdering1 :: forall ctx_aol9. () -> () -> () -> R1 ctx_aol9 Ordering

- Generics.RepLib.PreludeReps: rTup3 :: forall a_12 b_13 c_14. (Rep a_12, Rep b_13, Rep c_14) => R ((,,) a_12 b_13 c_14)

+ Generics.RepLib.PreludeReps: rTup3 :: forall a_11 b_12 c_13. (Rep a_11, Rep b_12, Rep c_13) => R ((,,) a_11 b_12 c_13)

- Generics.RepLib.PreludeReps: rTup3_1 :: forall ctx_aq2u a_12 b_13 c_14. (Rep a_12, Rep b_13, Rep c_14) => (ctx_aq2u a_12, ctx_aq2u b_13, ctx_aq2u c_14) -> R1 ctx_aq2u ((,,) a_12 b_13 c_14)

+ Generics.RepLib.PreludeReps: rTup3_1 :: forall ctx_aolm a_11 b_12 c_13. (Rep a_11, Rep b_12, Rep c_13) => (ctx_aolm a_11, ctx_aolm b_12, ctx_aolm c_13) -> R1 ctx_aolm ((,,) a_11 b_12 c_13)

- Generics.RepLib.PreludeReps: rTup4 :: forall a_12 b_13 c_14 d_15. (Rep a_12, Rep b_13, Rep c_14, Rep d_15) => R ((,,,) a_12 b_13 c_14 d_15)

+ Generics.RepLib.PreludeReps: rTup4 :: forall a_11 b_12 c_13 d_14. (Rep a_11, Rep b_12, Rep c_13, Rep d_14) => R ((,,,) a_11 b_12 c_13 d_14)

- Generics.RepLib.PreludeReps: rTup4_1 :: forall ctx_aq2N a_12 b_13 c_14 d_15. (Rep a_12, Rep b_13, Rep c_14, Rep d_15) => (ctx_aq2N a_12, ctx_aq2N b_13, ctx_aq2N c_14, ctx_aq2N d_15) -> R1 ctx_aq2N ((,,,) a_12 b_13 c_14 d_15)

+ Generics.RepLib.PreludeReps: rTup4_1 :: forall ctx_aolM a_11 b_12 c_13 d_14. (Rep a_11, Rep b_12, Rep c_13, Rep d_14) => (ctx_aolM a_11, ctx_aolM b_12, ctx_aolM c_13, ctx_aolM d_14) -> R1 ctx_aolM ((,,,) a_11 b_12 c_13 d_14)

- Generics.RepLib.PreludeReps: rTup5 :: forall a_12 b_13 c_14 d_15 e_16. (Rep a_12, Rep b_13, Rep c_14, Rep d_15, Rep e_16) => R ((,,,,) a_12 b_13 c_14 d_15 e_16)

+ Generics.RepLib.PreludeReps: rTup5 :: forall a_11 b_12 c_13 d_14 e_15. (Rep a_11, Rep b_12, Rep c_13, Rep d_14, Rep e_15) => R ((,,,,) a_11 b_12 c_13 d_14 e_15)

- Generics.RepLib.PreludeReps: rTup5_1 :: forall ctx_aq3b a_12 b_13 c_14 d_15 e_16. (Rep a_12, Rep b_13, Rep c_14, Rep d_15, Rep e_16) => (ctx_aq3b a_12, ctx_aq3b b_13, ctx_aq3b c_14, ctx_aq3b d_15, ctx_aq3b e_16) -> R1 ctx_aq3b ((,,,,) a_12 b_13 c_14 d_15 e_16)

+ Generics.RepLib.PreludeReps: rTup5_1 :: forall ctx_aomj a_11 b_12 c_13 d_14 e_15. (Rep a_11, Rep b_12, Rep c_13, Rep d_14, Rep e_15) => (ctx_aomj a_11, ctx_aomj b_12, ctx_aomj c_13, ctx_aomj d_14, ctx_aomj e_15) -> R1 ctx_aomj ((,,,,) a_11 b_12 c_13 d_14 e_15)

- Generics.RepLib.PreludeReps: rTup6 :: forall a_12 b_13 c_14 d_15 e_16 f_17. (Rep a_12, Rep b_13, Rep c_14, Rep d_15, Rep e_16, Rep f_17) => R ((,,,,,) a_12 b_13 c_14 d_15 e_16 f_17)

+ Generics.RepLib.PreludeReps: rTup6 :: forall a_11 b_12 c_13 d_14 e_15 f_16. (Rep a_11, Rep b_12, Rep c_13, Rep d_14, Rep e_15, Rep f_16) => R ((,,,,,) a_11 b_12 c_13 d_14 e_15 f_16)

- Generics.RepLib.PreludeReps: rTup6_1 :: forall ctx_aq3E a_12 b_13 c_14 d_15 e_16 f_17. (Rep a_12, Rep b_13, Rep c_14, Rep d_15, Rep e_16, Rep f_17) => (ctx_aq3E a_12, ctx_aq3E b_13, ctx_aq3E c_14, ctx_aq3E d_15, ctx_aq3E e_16, ctx_aq3E f_17) -> R1 ctx_aq3E ((,,,,,) a_12 b_13 c_14 d_15 e_16 f_17)

+ Generics.RepLib.PreludeReps: rTup6_1 :: forall ctx_aomX a_11 b_12 c_13 d_14 e_15 f_16. (Rep a_11, Rep b_12, Rep c_13, Rep d_14, Rep e_15, Rep f_16) => (ctx_aomX a_11, ctx_aomX b_12, ctx_aomX c_13, ctx_aomX d_14, ctx_aomX e_15, ctx_aomX f_16) -> R1 ctx_aomX ((,,,,,) a_11 b_12 c_13 d_14 e_15 f_16)

- Generics.RepLib.PreludeReps: rTup7 :: forall a_12 b_13 c_14 d_15 e_16 f_17 g_18. (Rep a_12, Rep b_13, Rep c_14, Rep d_15, Rep e_16, Rep f_17, Rep g_18) => R ((,,,,,,) a_12 b_13 c_14 d_15 e_16 f_17 g_18)

+ Generics.RepLib.PreludeReps: rTup7 :: forall a_11 b_12 c_13 d_14 e_15 f_16 g_17. (Rep a_11, Rep b_12, Rep c_13, Rep d_14, Rep e_15, Rep f_16, Rep g_17) => R ((,,,,,,) a_11 b_12 c_13 d_14 e_15 f_16 g_17)

- Generics.RepLib.PreludeReps: rTup7_1 :: forall ctx_aq4c a_12 b_13 c_14 d_15 e_16 f_17 g_18. (Rep a_12, Rep b_13, Rep c_14, Rep d_15, Rep e_16, Rep f_17, Rep g_18) => (ctx_aq4c a_12, ctx_aq4c b_13, ctx_aq4c c_14, ctx_aq4c d_15, ctx_aq4c e_16, ctx_aq4c f_17, ctx_aq4c g_18) -> R1 ctx_aq4c ((,,,,,,) a_12 b_13 c_14 d_15 e_16 f_17 g_18)

+ Generics.RepLib.PreludeReps: rTup7_1 :: forall ctx_aonI a_11 b_12 c_13 d_14 e_15 f_16 g_17. (Rep a_11, Rep b_12, Rep c_13, Rep d_14, Rep e_15, Rep f_16, Rep g_17) => (ctx_aonI a_11, ctx_aonI b_12, ctx_aonI c_13, ctx_aonI d_14, ctx_aonI e_15, ctx_aonI f_16, ctx_aonI g_17) -> R1 ctx_aonI ((,,,,,,) a_11 b_12 c_13 d_14 e_15 f_16 g_17)

- Generics.RepLib.R: Emb :: (l -> a) -> (a -> Maybe l) -> Maybe [String] -> String -> Fixity -> Emb l a

+ Generics.RepLib.R: Emb :: l -> a -> a -> Maybe l -> Maybe [String] -> String -> Fixity -> Emb l a

- Generics.RepLib.R: rConsEmb :: Emb (a :*: ([a] :*: Nil)) [a]

+ Generics.RepLib.R: rConsEmb :: Emb (a :*: [a] :*: Nil) [a]

- Generics.RepLib.R: rPairEmb :: Emb (a :*: (b :*: Nil)) (a, b)

+ Generics.RepLib.R: rPairEmb :: Emb (a :*: b :*: Nil) (a, b)

- Generics.RepLib.SYB.Aliases: GM :: (forall a. Rep a => a -> m a) -> GenericM' m

+ Generics.RepLib.SYB.Aliases: GM :: forall a. Rep a => a -> m a -> GenericM' m

- Generics.RepLib.SYB.Aliases: GT :: (forall a. Rep a => a -> a) -> GenericT'

+ Generics.RepLib.SYB.Aliases: GT :: forall a. Rep a => a -> a -> GenericT'

- Generics.RepLib.Unify: UnifySubD :: (Proxy (n, a) -> b -> b -> UM n a ()) -> (n -> a -> b -> b) -> (n -> Proxy a -> b -> Bool) -> UnifySubD n a b

+ Generics.RepLib.Unify: UnifySubD :: Proxy (n, a) -> b -> b -> UM n a () -> n -> a -> b -> b -> n -> Proxy a -> b -> Bool -> UnifySubD n a b

Files

Generics/RepLib/Derive.hs +39/−21
RepLib.cabal +6/−3

Generics/RepLib/Derive.hs view

@@ -52,6 +52,10 @@ import Control.Monad.Fail ( MonadFail ) #endif +#if MIN_VERSION_template_haskell(2,13,0)+import Control.Monad.IO.Class ( MonadIO )+#endif+ -- | Given a type, produce its representation. repty :: Type -> Exp repty ty = SigE (VarE (mkName "rep")) ((ConT ''R) `AppT` ty)@@ -89,6 +93,9 @@ #if MIN_VERSION_template_haskell(2,11,0)            , MonadFail #endif+#if MIN_VERSION_template_haskell(2,13,0)+           , MonadIO+#endif #if MIN_VERSION_template_haskell(2,7,0)            , Applicative #endif@@ -101,35 +108,46 @@ runQN = runWriterT . unQN  instance Quasi QN where-  qNewName s            = liftQN $ qNewName s-  qReport b s           = liftQN $ qReport b s-  qRecover              = error "qRecover not implemented for QN"-  qReify n              = liftQN $ qReify n+  qNewName s              = liftQN $ qNewName s+  qReport b s             = liftQN $ qReport b s+  qRecover                = error "qRecover not implemented for QN"+  qReify n                = liftQN $ qReify n #if MIN_VERSION_template_haskell(2,7,0)-  qReifyInstances n tys = liftQN $ qReifyInstances n tys+  qReifyInstances n tys   = liftQN $ qReifyInstances n tys #else-  qClassInstances n tys = liftQN $ qClassInstances n tys+  qClassInstances n tys   = liftQN $ qClassInstances n tys #endif-  qLocation             = liftQN qLocation-  qRunIO io             = liftQN $ qRunIO io+  qLocation               = liftQN qLocation+  qRunIO io               = liftQN $ qRunIO io #if MIN_VERSION_template_haskell(2,7,0)-  qLookupName ns s      = liftQN $ qLookupName ns s-  qAddDependentFile fp  = liftQN $ qAddDependentFile fp+  qLookupName ns s        = liftQN $ qLookupName ns s+  qAddDependentFile fp    = liftQN $ qAddDependentFile fp #endif #if MIN_VERSION_template_haskell(2,9,0)-  qReifyRoles n         = liftQN $ qReifyRoles n-  qReifyAnnotations al  = liftQN $ qReifyAnnotations al-  qReifyModule m        = liftQN $ qReifyModule m-  qAddTopDecls ds       = liftQN $ qAddTopDecls ds-  qAddModFinalizer q    = liftQN $ qAddModFinalizer q-  qGetQ                 = liftQN $ qGetQ-  qPutQ a               = liftQN $ qPutQ a+  qReifyRoles n           = liftQN $ qReifyRoles n+  qReifyAnnotations al    = liftQN $ qReifyAnnotations al+  qReifyModule m          = liftQN $ qReifyModule m+  qAddTopDecls ds         = liftQN $ qAddTopDecls ds+  qAddModFinalizer q      = liftQN $ qAddModFinalizer q+  qGetQ                   = liftQN $ qGetQ+  qPutQ a                 = liftQN $ qPutQ a #endif #if MIN_VERSION_template_haskell(2,11,0)-  qReifyFixity n        = liftQN $ qReifyFixity n-  qReifyConStrictness n = liftQN $ qReifyConStrictness n-  qIsExtEnabled e       = liftQN $ qIsExtEnabled e-  qExtsEnabled          = liftQN $ qExtsEnabled+  qReifyFixity n          = liftQN $ qReifyFixity n+  qReifyConStrictness n   = liftQN $ qReifyConStrictness n+  qIsExtEnabled e         = liftQN $ qIsExtEnabled e+  qExtsEnabled            = liftQN $ qExtsEnabled+#endif+#if MIN_VERSION_template_haskell(2,14,0)+  qAddForeignFilePath a b = liftQN $ qAddForeignFilePath a b+#elif MIN_VERSION_template_haskell(2,12,0)+  qAddForeignFile a b     = liftQN $ qAddForeignFile a b+#endif+#if MIN_VERSION_template_haskell(2,13,0)+  qAddCorePlugin s        = liftQN $ qAddCorePlugin s+#endif+#if MIN_VERSION_template_haskell(2,14,0)+  qAddTempFile s          = liftQN $ qAddTempFile s #endif  -- Generate the representation for a data constructor.

RepLib.cabal view

@@ -1,5 +1,5 @@ name:           RepLib-version:        0.5.4+version:        0.5.4.1 license:        BSD3 license-file:   LICENSE build-type:     Simple@@ -11,7 +11,10 @@                 GHC == 7.8.1,                 GHC == 7.8.3,                 GHC == 7.10.2,-                GHC == 8.0.1+                GHC == 8.0.1,+                GHC == 8.2.2,+                GHC == 8.4.3,+                GHC == 8.6.1 author:         Stephanie Weirich maintainer:     Stephanie Weirich <sweirich@cis.upenn.edu> homepage:       https://github.com/sweirich/replib@@ -27,7 +30,7 @@  Library   build-depends: base >= 4.3 && < 5,-                 template-haskell >= 2.4 && < 2.12,+                 template-haskell >= 2.4 && < 2.15,                  mtl >= 2.0 && < 2.3,                  containers >= 0.4 && < 0.6,                  transformers