{"diffoscope-json-version": 1, "source1": "/srv/reproducible-results/rbuild-debian/r-b-build.3FWrN8Ub/b1/haskell-barbies_2.0.5.0-1_amd64.changes", "source2": "/srv/reproducible-results/rbuild-debian/r-b-build.3FWrN8Ub/b2/haskell-barbies_2.0.5.0-1_amd64.changes", "unified_diff": null, "details": [{"source1": "Files", "source2": "Files", "unified_diff": "@@ -1,4 +1,4 @@\n \n- 38e8488784dd823a67e1d7eada1279bd 319076 haskell optional libghc-barbies-dev_2.0.5.0-1_amd64.deb\n- b9e813af2bbea91222364fcd522553f7 208724 doc optional libghc-barbies-doc_2.0.5.0-1_all.deb\n- 97b7b424a5ad165270f7837df1fc484b 323736 haskell optional libghc-barbies-prof_2.0.5.0-1_amd64.deb\n+ fd8db6c73a1c6e24433b90bf60c826e4 318992 haskell optional libghc-barbies-dev_2.0.5.0-1_amd64.deb\n+ 6759cc16db825741a7d6e882f5632ed3 208728 doc optional libghc-barbies-doc_2.0.5.0-1_all.deb\n+ 5af8e33233354ce067f9507f7f74247c 323728 haskell optional libghc-barbies-prof_2.0.5.0-1_amd64.deb\n"}, {"source1": "libghc-barbies-dev_2.0.5.0-1_amd64.deb", "source2": "libghc-barbies-dev_2.0.5.0-1_amd64.deb", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,3 +1,3 @@\n -rw-r--r-- 0 0 0 4 2024-09-21 21:52:34.000000 debian-binary\n--rw-r--r-- 0 0 0 2968 2024-09-21 21:52:34.000000 control.tar.xz\n--rw-r--r-- 0 0 0 315916 2024-09-21 21:52:34.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 2948 2024-09-21 21:52:34.000000 control.tar.xz\n+-rw-r--r-- 0 0 0 315852 2024-09-21 21:52:34.000000 data.tar.xz\n"}, {"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./control", "source2": "./control", "unified_diff": "@@ -1,19 +1,19 @@\n Package: libghc-barbies-dev\n Source: haskell-barbies\n Version: 2.0.5.0-1\n Architecture: amd64\n Maintainer: Debian Haskell Group \n Installed-Size: 3967\n Depends: libghc-base-dev-4.18.2.1-8e81e, libghc-distributive-dev-0.6.2.1-d9a73, libghc-transformers-dev-0.6.1.0-5335d, libc6 (>= 2.2.5), libgmp10 (>= 2:6.3.0+dfsg)\n-Provides: libghc-barbies-dev-2.0.5.0-7837f\n+Provides: libghc-barbies-dev-2.0.5.0-06da0\n Section: haskell\n Priority: optional\n Homepage: https://github.com/jcpetruzza/barbies#readme\n Description: Classes for working with types that can change clothes\n Types that are parametric on a functor are like Barbies that have an outfit\n for each role. This package provides the basic abstractions to work with them\n comfortably.\n .\n This package provides a library for the Haskell programming language.\n See http://www.haskell.org/ for more information on Haskell.\n-Ghc-Package: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\n+Ghc-Package: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\n"}, {"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}, {"source1": "line order", "source2": "line order", "unified_diff": "@@ -1,82 +1,82 @@\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Constraints.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Constraints.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.dyn_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/libHSbarbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe.a\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/libHSbarbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe-ghc9.6.6.so\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Constraints.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Constraints.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.dyn_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/libHSbarbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U.a\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/libHSbarbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U-ghc9.6.6.so\n usr/share/doc/libghc-barbies-dev/changelog.Debian.gz\n usr/share/doc/libghc-barbies-dev/changelog.gz\n usr/share/doc/libghc-barbies-dev/copyright\n var/lib/ghc/package.conf.d/barbies-2.0.5.0.conf\n"}]}]}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,101 +1,101 @@\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/\n--rw-r--r-- 0 root (0) root (0) 1687 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 1686 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.hi\n--rw-r--r-- 0 root (0) root (0) 46230 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 46227 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.hi\n--rw-r--r-- 0 root (0) root (0) 1747 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 1746 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/\n--rw-r--r-- 0 root (0) root (0) 30280 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 30279 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.hi\n--rw-r--r-- 0 root (0) root (0) 15424 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 15423 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.hi\n--rw-r--r-- 0 root (0) root (0) 19795 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 19791 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.hi\n--rw-r--r-- 0 root (0) root (0) 13325 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 13324 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.hi\n--rw-r--r-- 0 root (0) root (0) 17112 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 17111 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.hi\n--rw-r--r-- 0 root (0) root (0) 18881 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 18877 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/\n--rw-r--r-- 0 root (0) root (0) 52353 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 52352 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.hi\n--rw-r--r-- 0 root (0) root (0) 61384 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 61380 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.hi\n--rw-r--r-- 0 root (0) root (0) 41144 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 41143 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.hi\n--rw-r--r-- 0 root (0) root (0) 45521 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 45518 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.hi\n--rw-r--r-- 0 root (0) root (0) 38686 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 38683 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.hi\n--rw-r--r-- 0 root (0) root (0) 76651 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 76648 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.hi\n--rw-r--r-- 0 root (0) root (0) 10056 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 10052 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.hi\n--rw-r--r-- 0 root (0) root (0) 30008 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 30007 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.hi\n--rw-r--r-- 0 root (0) root (0) 45650 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 45645 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.hi\n--rw-r--r-- 0 root (0) root (0) 28005 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 28004 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.hi\n--rw-r--r-- 0 root (0) root (0) 38170 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 38165 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.hi\n--rw-r--r-- 0 root (0) root (0) 18896 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 18892 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.hi\n--rw-r--r-- 0 root (0) root (0) 35905 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 35904 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.hi\n--rw-r--r-- 0 root (0) root (0) 42211 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 42208 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.hi\n--rw-r--r-- 0 root (0) root (0) 49688 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 49684 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.hi\n--rw-r--r-- 0 root (0) root (0) 4692 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 4689 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.hi\n--rw-r--r-- 0 root (0) root (0) 17559 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 17555 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.hi\n--rw-r--r-- 0 root (0) root (0) 9282 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 9281 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.hi\n--rw-r--r-- 0 root (0) root (0) 7194 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 7193 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.hi\n--rw-r--r-- 0 root (0) root (0) 6616 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 6615 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/\n--rw-r--r-- 0 root (0) root (0) 1751 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 1750 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.hi\n--rw-r--r-- 0 root (0) root (0) 2633 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Constraints.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 2632 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Constraints.hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/\n--rw-r--r-- 0 root (0) root (0) 52237 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 52234 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.hi\n--rw-r--r-- 0 root (0) root (0) 24252 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 24249 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.hi\n--rw-r--r-- 0 root (0) root (0) 8204 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 8203 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/\n--rw-r--r-- 0 root (0) root (0) 3473 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 3472 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.hi\n--rw-r--r-- 0 root (0) root (0) 91719 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 91715 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.hi\n--rw-r--r-- 0 root (0) root (0) 3751 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 3750 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/\n--rw-r--r-- 0 root (0) root (0) 12700 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.dyn_hi\n--rw-r--r-- 0 root (0) root (0) 12697 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.hi\n--rw-r--r-- 0 root (0) root (0) 1205116 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/libHSbarbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe.a\n--rw-r--r-- 0 root (0) root (0) 728792 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/libHSbarbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe-ghc9.6.6.so\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/\n+-rw-r--r-- 0 root (0) root (0) 1686 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 1685 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.hi\n+-rw-r--r-- 0 root (0) root (0) 46231 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 46228 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.hi\n+-rw-r--r-- 0 root (0) root (0) 1745 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 1744 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/\n+-rw-r--r-- 0 root (0) root (0) 30280 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 30279 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.hi\n+-rw-r--r-- 0 root (0) root (0) 15422 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 15421 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.hi\n+-rw-r--r-- 0 root (0) root (0) 19807 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 19803 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.hi\n+-rw-r--r-- 0 root (0) root (0) 13332 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 13331 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.hi\n+-rw-r--r-- 0 root (0) root (0) 17108 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 17107 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.hi\n+-rw-r--r-- 0 root (0) root (0) 18869 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 18865 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/\n+-rw-r--r-- 0 root (0) root (0) 52358 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 52357 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.hi\n+-rw-r--r-- 0 root (0) root (0) 61385 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 61381 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.hi\n+-rw-r--r-- 0 root (0) root (0) 41149 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 41148 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.hi\n+-rw-r--r-- 0 root (0) root (0) 45520 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 45517 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.hi\n+-rw-r--r-- 0 root (0) root (0) 38685 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 38682 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.hi\n+-rw-r--r-- 0 root (0) root (0) 76650 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 76647 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.hi\n+-rw-r--r-- 0 root (0) root (0) 10052 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 10048 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.hi\n+-rw-r--r-- 0 root (0) root (0) 30019 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 30018 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.hi\n+-rw-r--r-- 0 root (0) root (0) 45657 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 45652 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.hi\n+-rw-r--r-- 0 root (0) root (0) 28007 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 28006 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.hi\n+-rw-r--r-- 0 root (0) root (0) 38170 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 38165 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.hi\n+-rw-r--r-- 0 root (0) root (0) 18888 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 18884 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.hi\n+-rw-r--r-- 0 root (0) root (0) 35910 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 35909 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.hi\n+-rw-r--r-- 0 root (0) root (0) 42224 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 42221 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.hi\n+-rw-r--r-- 0 root (0) root (0) 49703 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 49699 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.hi\n+-rw-r--r-- 0 root (0) root (0) 4698 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 4695 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.hi\n+-rw-r--r-- 0 root (0) root (0) 17560 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 17556 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.hi\n+-rw-r--r-- 0 root (0) root (0) 9286 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 9285 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.hi\n+-rw-r--r-- 0 root (0) root (0) 7206 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 7205 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.hi\n+-rw-r--r-- 0 root (0) root (0) 6597 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 6596 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/\n+-rw-r--r-- 0 root (0) root (0) 1751 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 1750 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.hi\n+-rw-r--r-- 0 root (0) root (0) 2634 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Constraints.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 2633 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Constraints.hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/\n+-rw-r--r-- 0 root (0) root (0) 52236 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 52233 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.hi\n+-rw-r--r-- 0 root (0) root (0) 24253 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 24250 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.hi\n+-rw-r--r-- 0 root (0) root (0) 8201 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 8200 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/\n+-rw-r--r-- 0 root (0) root (0) 3468 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 3467 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.hi\n+-rw-r--r-- 0 root (0) root (0) 91726 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 91722 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.hi\n+-rw-r--r-- 0 root (0) root (0) 3748 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 3747 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/\n+-rw-r--r-- 0 root (0) root (0) 12703 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.dyn_hi\n+-rw-r--r-- 0 root (0) root (0) 12700 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.hi\n+-rw-r--r-- 0 root (0) root (0) 1205116 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/libHSbarbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U.a\n+-rw-r--r-- 0 root (0) root (0) 728792 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/libHSbarbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U-ghc9.6.6.so\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/share/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/share/doc/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/share/doc/libghc-barbies-dev/\n -rw-r--r-- 0 root (0) root (0) 381 2024-09-21 21:52:34.000000 ./usr/share/doc/libghc-barbies-dev/changelog.Debian.gz\n -rw-r--r-- 0 root (0) root (0) 2015 2023-10-21 11:51:17.000000 ./usr/share/doc/libghc-barbies-dev/changelog.gz\n -rw-r--r-- 0 root (0) root (0) 1967 2024-09-21 21:52:34.000000 ./usr/share/doc/libghc-barbies-dev/copyright\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./var/\n"}, {"source1": "./var/lib/ghc/package.conf.d/barbies-2.0.5.0.conf", "source2": "./var/lib/ghc/package.conf.d/barbies-2.0.5.0.conf", "unified_diff": "@@ -1,23 +1,23 @@\n name: barbies\n version: 2.0.5.0\n visibility: public\n-id: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\n-key: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\n+id: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\n+key: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\n license: BSD-3-Clause\n copyright: 2018 Daniel Gorin\n maintainer: jcpetruzza@gmail.com\n author: Daniel Gorin\n homepage: https://github.com/jcpetruzza/barbies#readme\n synopsis: Classes for working with types that can change clothes.\n description:\n Types that are parametric on a functor are like Barbies that have an outfit for each role. This package provides the basic abstractions to work with them comfortably.\n \n category: Data Structures\n-abi: 7837fb26dac62a51d227dc0975afaa0d\n+abi: 06da0f2a56bcc822aefd768919a86f1d\n exposed: True\n exposed-modules:\n Barbies Barbies.Bare Barbies.Bi Barbies.Constraints\n Barbies.Internal Data.Barbie Data.Barbie.Bare\n Data.Barbie.Constraints Data.Functor.Barbie Data.Functor.Prod\n Data.Functor.Transformer\n \n@@ -34,24 +34,24 @@\n Barbies.Internal.TraversableB Barbies.Internal.TraversableT\n Barbies.Internal.Trivial Barbies.Internal.Wear\n Barbies.Internal.Wrappers Barbies.Internal.Writer\n Data.Generics.GenericN Data.Barbie.Internal.Product\n Data.Barbie.Internal.ProductC\n \n import-dirs:\n- /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\n+ /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\n \n library-dirs:\n- /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\n+ /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\n \n library-dirs-static:\n- /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\n+ /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\n \n dynamic-library-dirs: /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6\n data-dir: /usr/share/barbies\n-hs-libraries: HSbarbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\n+hs-libraries: HSbarbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\n depends:\n base-4.18.2.1 distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k\n transformers-0.6.1.0\n \n haddock-interfaces: /usr/lib/ghc-doc/haddock/barbies-2.0.5.0/barbies.haddock\n haddock-html: /usr/share/doc/libghc-barbies-doc/html/\n"}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.hi", "comments": ["Files 83% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Bare 9066\n- interface hash: baef616789e5c11ea5872ea3fa451b6a\n- ABI hash: b1553b4d0f6339dbe5a558e849477bcd\n- export-list hash: 3317a58afd59c101e4cfa353df6e1b14\n+ interface hash: 24df5058fb3c3ba6ba52fcfecf4851cc\n+ ABI hash: 8cfda8bf9b04003a9068b08aeef806d0\n+ export-list hash: 6cfb974e26ac71a46e68af091722ea15\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n+ flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 7c5d95ad0ce22d00d6e54b77dd65cdf6\n sig of: Nothing\n used TH splices: False\n where\n@@ -21,61 +21,61 @@\n Barbies.Internal.BareB.bcoverWith\n Barbies.Internal.BareB.bstripFrom\n Barbies.Internal.BareB.BareB{Barbies.Internal.BareB.bcover Barbies.Internal.BareB.bstrip}\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n Barbies.Internal.Wear.WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.BareB Barbies.Internal.FunctorB GHC.Base\n GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 38a94147d4ffbde195fb7c8c1cfe9808\n- exports: f8d13d389494b14dd924f2036dae95e2\n- BareB bcf15620d7682b808f4118663aa4e5cc\n- bcover 198ecd8709fc5a3bf8de7330e38a5522\n- bcoverWith 9708da690fb1f9a60bcfc18b74176b54\n- bstrip a458980907496fffc06b45bda97b3249\n- bstripFrom 753b1d3583db6faad7e7a3c7cfc8582a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n- WearTwo d06bb9da09839e1cb4a0a098d403587b\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB d3e28c114fb0832862f8cddb8501b23d\n+ exports: a7b9fd0c1d317c912311e4de9dfc94ac\n+ BareB 58d9792e504da07df01978f0d0a5f22f\n+ bcover 993c344d1317b0735c2d10c73f2e02a1\n+ bcoverWith 5c6dd91de74c772d93b84a17d8555354\n+ bstrip 1f66cbff218c6a12bd58100fc40354d3\n+ bstripFrom eb6b6f334cf2a31b9d24a4025731c738\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n+ WearTwo d957b83cc662451223c70d0fed19a0ad\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-2f52703c5b140ac7c7ec2e82a2887c62\n+4440dc3a99dd3a84f5c99d2d5f39123f\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-400bdbce2e1cdaf1c2b2d330625a3940\n+19ef4d2a2c8a4be887dc2c4049bd09bf\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d1e61337c18380f950923843cee1239c\n+14ef2080bf78a831f1d77a8999d4bf85\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Bare\"#]\n-1f06eba38f30e49937023092c8f65bf6\n+d4a7aa5b39994a75edcd60ae67a9a410\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-6e5b963ca06d1ec9f36bcf71b6dbb835\n+ea9b6594da57ea6a95f9ba0592783949\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.dyn_hi", "comments": ["Files 82% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Bare 9066\n- interface hash: baef616789e5c11ea5872ea3fa451b6a\n- ABI hash: b1553b4d0f6339dbe5a558e849477bcd\n- export-list hash: 3317a58afd59c101e4cfa353df6e1b14\n+ interface hash: 24df5058fb3c3ba6ba52fcfecf4851cc\n+ ABI hash: 8cfda8bf9b04003a9068b08aeef806d0\n+ export-list hash: 6cfb974e26ac71a46e68af091722ea15\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: f3ef90b23a8894f3c8a76d060589be75\n+ flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 7c5d95ad0ce22d00d6e54b77dd65cdf6\n sig of: Nothing\n used TH splices: False\n where\n@@ -21,61 +21,61 @@\n Barbies.Internal.BareB.bcoverWith\n Barbies.Internal.BareB.bstripFrom\n Barbies.Internal.BareB.BareB{Barbies.Internal.BareB.bcover Barbies.Internal.BareB.bstrip}\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n Barbies.Internal.Wear.WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.BareB Barbies.Internal.FunctorB GHC.Base\n GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 38a94147d4ffbde195fb7c8c1cfe9808\n- exports: f8d13d389494b14dd924f2036dae95e2\n- BareB bcf15620d7682b808f4118663aa4e5cc\n- bcover 198ecd8709fc5a3bf8de7330e38a5522\n- bcoverWith 9708da690fb1f9a60bcfc18b74176b54\n- bstrip a458980907496fffc06b45bda97b3249\n- bstripFrom 753b1d3583db6faad7e7a3c7cfc8582a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n- WearTwo d06bb9da09839e1cb4a0a098d403587b\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB d3e28c114fb0832862f8cddb8501b23d\n+ exports: a7b9fd0c1d317c912311e4de9dfc94ac\n+ BareB 58d9792e504da07df01978f0d0a5f22f\n+ bcover 993c344d1317b0735c2d10c73f2e02a1\n+ bcoverWith 5c6dd91de74c772d93b84a17d8555354\n+ bstrip 1f66cbff218c6a12bd58100fc40354d3\n+ bstripFrom eb6b6f334cf2a31b9d24a4025731c738\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n+ WearTwo d957b83cc662451223c70d0fed19a0ad\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-2f52703c5b140ac7c7ec2e82a2887c62\n+4440dc3a99dd3a84f5c99d2d5f39123f\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-400bdbce2e1cdaf1c2b2d330625a3940\n+19ef4d2a2c8a4be887dc2c4049bd09bf\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d1e61337c18380f950923843cee1239c\n+14ef2080bf78a831f1d77a8999d4bf85\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Bare\"#]\n-1f06eba38f30e49937023092c8f65bf6\n+d4a7aa5b39994a75edcd60ae67a9a410\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-6e5b963ca06d1ec9f36bcf71b6dbb835\n+ea9b6594da57ea6a95f9ba0592783949\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Bi 9066\n- interface hash: 18fb10cbe8d3edeb31f0ad40d22e6f12\n- ABI hash: 604a1d41e05e1d123fdb2fac9fd8f040\n- export-list hash: 7b265b9f77349ea169ef59918f8772f0\n+ interface hash: 082c1962ec0142a182a4de7431955ab9\n+ ABI hash: ce67569e93ab0ed6a906de485fde3d62\n+ export-list hash: a9bfde5a4613e09bfb2c8fc0be8120dd\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: d453dea9a2a287814335211db4ab1b67\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 230f04ad0eff370d4fb01f412f4dab2e\n sig of: Nothing\n@@ -24,18 +24,18 @@\n btprod\n btpure\n btpure1\n bttraverse\n bttraverse1\n bttraverse_\n Flip{Flip runFlip}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.ConstraintsB\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveB\n Barbies.Internal.DistributiveT Barbies.Internal.FunctorB\n@@ -54,52 +54,52 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- ApplicativeT a99ce0340646a38f9575b049182a8def\n- tprod 94d237cedb9b905a9c75a58fc4be2d84\n- tpure 3d2d76935d5f8427ccff8120f17ee9cb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- DistributiveB e01ed0fa1927b910f29b673ced05da93\n- bdistribute 5b40d11ac15b14f1ed4a3c11011331d8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT 2d87ad7b0d939518df31ee312faa9bf2\n- DistributiveT 375f90ea1d05e60dc2c4545948c0f64a\n- tdistribute ac2e5b8fba24fb8dcfa0e8bfe938022d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- TraversableT 5f45683a672c1e8b493f3644d95842b8\n- ttraverse d3238a3d0af65058271e05836e392ec5\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit a4df766290f2aea4bc82298ff16dbd46\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 4b8cfed320a9759153c9f2e1178f5919\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr c0469e5e8a962b81eaa1e5c9b2f08584\n- tell 318bc913c1a4613db9a7000eccfc0ab8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 8580d8e7c5c9c44a5534809ebf1907d2\n- exports: b2c90f3ed7344f6cbd155b29f58a4f5d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer 12cc87af2ef508ba724114c0268390b0\n- exports: 4730a0f9a2e2a68edc332389a361be24\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ ApplicativeT 074070de79264540541cf796d013c0ef\n+ tprod afb228a962be5d495a61627aaf4064db\n+ tpure 45b5a8f3e24017491bb877f3c054cbb9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ DistributiveB b7a598d798980f56a6401cbf7835693e\n+ bdistribute 61b5bf0b84e4754f2266e05a24600562\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT d42051f3b0e0718fa7a27a87fb621d9a\n+ DistributiveT bc1ead53dbcac53eb866a8dcc1c81565\n+ tdistribute b68f74dc7b1ae0f6c5b72deaf1396df6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ TraversableT 85e954d72370c1d24f1ff0e67fec5163\n+ ttraverse 7d33e27d536aa9640cd0d31bd3eaff70\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit ae7009495dd3ca0664463506cc352eb5\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer 1ac8301754bf8fc4ae662af9201e1b17\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 56d7951edbc29f9bb80efe13a3b090ce\n+ tell 44d33a86554f81bd08a29cb9f096fae7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie dad1ef832afa2c721a22049834cc9dd4\n+ exports: b3763818b9e315ec61a28b921995582d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer 14df9c3ebd1edd9c535cf1dfeaaf95c6\n+ exports: 3239be74cd8260541a54d1361d625cef\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Control.Monad a8552ca25f5dcd7ee6fb611cbb0ec055\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Monoid 672247a2f00dd02f4a07408e39ac3b93\n import -/ Data.Semigroup.Internal b9587b96cd753f58ca99258378fd0556\n@@ -107,17 +107,17 @@\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.ParserCombinators.ReadPrec a657147dbd7291808782bfe31b23cd99\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-e7fa8010c22dcdba2911aef100ad808d\n+8d7e8a0ec14d9dcfc79793008156dd09\n $fApplicativeBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n Barbies.Internal.ApplicativeB.ApplicativeB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -147,15 +147,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fApplicativeBkFlip_$cbpure @k @k1 @b @f v)\n ($fApplicativeBkFlip_$cbprod @k @k1 @b @f v)]\n-9df2a9746a00ea25eb2bb80f83662636\n+3c9591d9750f48d2b3a343d176871d4f\n $fApplicativeBkFlip_$cbprod ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *)\n (g :: k1 -> *).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n Flip b f f1\n -> Flip b f g -> Flip b f (Data.Functor.Product.Product f1 g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -192,15 +192,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-d4f5216b124d4f5ce5347802e6cbf484\n+27fb366f515903883331d568492414a9\n $fApplicativeBkFlip_$cbpure ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n (forall (a :: k1). f1 a) -> Flip b f f1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -228,15 +228,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-69bda5ee1cc715da36ccf14dbef2d677\n+69dca1b7a5ff6dae1b8b4317de52e968\n $fApplicativeTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n Barbies.Internal.ApplicativeT.ApplicativeT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -268,15 +268,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTkk'Flip_$ctpure @k' @k @b v)\n ($fApplicativeTkk'Flip_$ctprod @k' @k @b v)]\n-e709edc7ca66e4c40e497983d621a9c5\n+9cee07a549f96143e8347225ca0670ad\n $fApplicativeTkk'Flip_$ctprod ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (x :: k')\n (g :: k -> *).\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n Flip b f x\n -> Flip b g x -> Flip b (Data.Functor.Product.Product f g) x\n@@ -312,15 +312,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-920ad6fe9dd4989432ed2a57626c6a6b\n+d133f4d78c75907cddd6b1dddc7a7e33\n $fApplicativeTkk'Flip_$ctpure ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (x :: k').\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n (forall (a :: k). f a) -> Flip b f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A)>, Inline: (sat-args=1),\n@@ -342,15 +342,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-7d6be3a82974c44df506e2562bf2f470\n+711c4a965ad9ace7635259a400ec216b\n $fDistributiveBTYPEFlip ::\n forall k (b :: (* -> *) -> k -> *) (f :: k).\n Barbies.Internal.DistributiveT.DistributiveT b =>\n Barbies.Internal.DistributiveB.DistributiveB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -378,29 +378,29 @@\n (forall (f1 :: <* -> *>_N) (g :: <* -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n <* -> *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] <*>_N _N))\n ($fDistributiveBTYPEFlip_$cbdistribute @k @b @f v)]\n-1d897a88e8087d2955a41f34a425ae8c\n+655da2dc4800c1f48edd37d4be4e5597\n $fDistributiveBTYPEFlip1 ::\n forall {k1} {k2} {b :: k1 -> k2 -> *} {l :: k2} {r :: k1}.\n Flip b l r -> Flip b l r\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @k1\n @b :: k -> k1 -> *\n @l :: k1\n @r :: k\n (ds2['GHC.Types.Many] :: Flip b l r) ->\n ds2]\n-1f2eaf34db3dc9c3c6d2fc06e58cc8f3\n+1536f58d56f1da2a98e11c25e58f709a\n $fDistributiveBTYPEFlip_$cbdistribute ::\n forall k (b :: (* -> *) -> k -> *) (f :: k) (f1 :: * -> *)\n (g :: * -> *).\n (Barbies.Internal.DistributiveT.DistributiveT b,\n GHC.Base.Functor f1) =>\n f1 (Flip b f g) -> Flip b f (Data.Functor.Compose.Compose f1 g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -443,15 +443,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n <* -> *>_N\n _N\n _R\n _N\n _N))]\n-8d07227dcb51efc4a53a9e4369a7c436\n+761a010e80b1fb53ffa94b2670e940a8\n $fDistributiveTiFlip ::\n forall i (b :: i -> (* -> *) -> *).\n (forall (f :: i).\n Barbies.Internal.DistributiveB.DistributiveB (b f)) =>\n Barbies.Internal.DistributiveT.DistributiveT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -483,15 +483,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N <* -> *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N _N _N))\n ($fDistributiveTiFlip_$ctdistribute @i @b v)]\n-b11a1c33f1744460c4ba63ae7d3f8a54\n+bbc0e0fc22cb9e895dce43c1cac97505\n $fDistributiveTiFlip_$ctdistribute ::\n forall i (b :: i -> (* -> *) -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (forall (f :: i).\n Barbies.Internal.DistributiveB.DistributiveB (b f),\n GHC.Base.Functor f) =>\n f (Flip b g x) -> Flip b (Data.Functor.Compose.Compose f g) x\n@@ -534,15 +534,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n <* -> *>_N\n _R\n _N\n _N))]\n-155659467b621fdf3a4f7a731e41c43b\n+f09b6253722fb8ebfaa91c315e83ab20\n $fEqFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Eq (b r l) =>\n GHC.Classes.Eq (Flip b l r)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -561,15 +561,15 @@\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b r l) v)\n `cast`\n (Sym (N:Flip[0] _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-327810441d72b0d1561e9db6a0114fd6\n+c0587a7379cad21ebcf761fb2d6c2747\n $fFunctorBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.FunctorT.FunctorT b =>\n Barbies.Internal.FunctorB.FunctorB (Flip b f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=0),\n@@ -577,15 +577,15 @@\n $fFunctorBkFlip_$cbmap\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (b :: <(k -> *)\n -> k1 -> *>_N) (f :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))]\n-206a41e5e7ec10a114994fee9e7972fd\n+be5a9871225b3fbe66bd008792138874\n $fFunctorBkFlip_$cbmap ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *)\n (g :: k1 -> *).\n Barbies.Internal.FunctorT.FunctorT b =>\n (forall (a :: k1). f1 a -> g a) -> Flip b f f1 -> Flip b f g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=2),\n@@ -618,30 +618,30 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-c9fa6776e9bf47a4e9ad7d544469f59b\n+a2653dcd4377b8c02cc0fb128640b8e9\n $fFunctorTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k'). Barbies.Internal.FunctorB.FunctorB (b f)) =>\n Barbies.Internal.FunctorT.FunctorT (Flip b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseTrue>\n $fFunctorTkk'Flip_$ctmap\n `cast`\n (forall (k' :: <*>_N) (k :: <*>_N) (b :: (k -> *) -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))]\n-df3d0f9106a92c7f64a1de33bfe9e4ca\n+141672b14b4a65a49aaa631c708bb2b7\n $fFunctorTkk'Flip_$ctmap ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (forall (f :: k'). Barbies.Internal.FunctorB.FunctorB (b f)) =>\n (forall (a :: k). f a -> g a) -> Flip b f x -> Flip b g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=2),\n@@ -672,15 +672,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-55765655192104bdc97a949af9ca4eee\n+f9a7503136e3c91ea14beaf0bedd84f8\n $fOrdFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Ord (b r l) =>\n GHC.Classes.Ord (Flip b l r)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -733,30 +733,30 @@\n (GHC.Classes.min @(b r l) v)\n `cast`\n (Sym (N:Flip[0] _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N))]\n-f40e6fd2fd2c22ed81fb0e0e400eb9ba\n+d886a01b7f0063ba9b5ca0959298e2a4\n $fOrdFlip_$cp1Ord ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Ord (b r l) =>\n GHC.Classes.Eq (Flip b l r)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k\n @k1\n @b :: k1 -> k -> *\n @l :: k\n @r :: k1\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord (b r l)) ->\n $fEqFlip @k @k1 @b @l @r (GHC.Classes.$p1Ord @(b r l) $dOrd)]\n-c3bf1081dcfa93f3ad331bbe72e1e8e9\n+d13c4dc3cb8bcafc09b06b318bc21d13\n $fReadFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n GHC.Read.Read (Flip b l r)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n@@ -773,25 +773,25 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadFlip_$creadListPrec @k @k1 @b @l @r v)]\n-d429ff46ed50c937178e62ce3b912159\n+37f5436801845b133796977ae3693885\n $fReadFlip1 ::\n forall {k1} {k2} {b :: k2 -> k1 -> *} {l :: k1} {r :: k2}.\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (Flip b l r -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-acdeda71cc79652157d32b03fc16d888\n+8ac527d28174224c002ccc84b2a3281b\n $fReadFlip_$creadList ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadP.ReadS [Flip b l r]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -816,15 +816,15 @@\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Flip b l r]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Flip b l r]>_R)\n @[Flip b l r]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[Flip b l r]))]\n-95426c64fdf283fdf8471a232af6eb7f\n+5168a97f687631452d44256ea48f009c\n $fReadFlip_$creadListPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [Flip b l r]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -839,15 +839,15 @@\n ($fReadFlip1 @k @k1 @b @l @r $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-d2182812bafb7ff533c2c0e7666acfe1\n+26225212a060715a939d44406dcffc8c\n $fReadFlip_$creadsPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Flip b l r)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -867,15 +867,15 @@\n @l\n @r\n $dRead\n eta\n @(Flip b l r)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Flip b l r)))]\n-72f4ad9fe18c337bc6353102b9427ff8\n+e2dc0925a72aaefc7aca5fb01b19aba9\n $fShowFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n GHC.Show.Show (Flip b l r)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n@@ -885,32 +885,32 @@\n @l :: k\n @r :: k1\n (v['GHC.Types.Many] :: GHC.Show.Show (b r l)).\n @(Flip b l r)\n ($fShowFlip_$cshowsPrec @k @k1 @b @l @r v)\n ($fShowFlip_$cshow @k @k1 @b @l @r v)\n ($fShowFlip_$cshowList @k @k1 @b @l @r v)]\n-d181d1a610be85ba52e10e617386e3c2\n+aa6732ec5c544da0aabd0de2a3f96f4c\n $fShowFlip1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"}\"#]\n-c4dbb9dbd7e56b3fd0240cccc794202a\n+b301dbf2249114aae578ff5c802d7234\n $fShowFlip2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Flip {runFlip = \"#]\n-7139e4da256a5ee153be66976bbddf0a\n+2e0f2ed4c46bfb4b21e11d02cb6e9fd6\n $fShowFlip3 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-d3a02b0d3fa324f6ae28f467d5f70d58\n+4ade2b920c468740ac8a14d5b3192d40\n $fShowFlip4 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShowFlip1]\n-cfad4b21032776db5b3baf0b7d6bb8fc\n+50706f7591839b4a1c90a6971e7ba0c9\n $fShowFlip_$cshow ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n Flip b l r -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -925,15 +925,15 @@\n $fShowFlip2\n (GHC.Show.showsPrec\n @(b r l)\n $dShow\n $fShowFlip3\n x `cast` (N:Flip[0] _N _N _R _N _N)\n $fShowFlip4)]\n-8517402d9e56ecb2aa8041c9c82ad99e\n+5ee6b2546fd6c03cd14096636d0d1feb\n $fShowFlip_$cshowList ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n [Flip b l r] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -947,15 +947,15 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Flip b l r)\n (\\ (ds2['GHC.Types.Many] :: Flip b l r) ->\n $w$cshowsPrec @k @k1 @b @l @r $dShow 0# ds2)\n ls\n s]\n-17b8f603177bd0dcc399f0596fd54a2b\n+04fdc04bcca96bc71bcf9b081ebf3a41\n $fShowFlip_$cshowsPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n GHC.Types.Int -> Flip b l r -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n@@ -965,15 +965,15 @@\n @l :: k\n @r :: k1\n ($dShow['GHC.Types.Many] :: GHC.Show.Show (b r l))\n (a['GHC.Types.Many] :: GHC.Types.Int)\n (ds2['GHC.Types.Many] :: Flip b l r) ->\n case a of wild { GHC.Types.I# ww ->\n $w$cshowsPrec @k @k1 @b @l @r $dShow ww ds2 }]\n-161366bbb7d35ceb34c788dba68b8e8e\n+57d38a0802897877317ede5ce0516504\n $fTraversableBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.TraversableT.TraversableT b =>\n Barbies.Internal.TraversableB.TraversableB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -1002,15 +1002,15 @@\n (forall (f1 :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkFlip_$cbtraverse @k @k1 @b @f v)]\n-352b761c9912a8d750f8a3aba393a86e\n+b0b73e27be440c946af82fbee6aa7548\n $fTraversableBkFlip_$cbtraverse ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (e :: * -> *)\n (f1 :: k1 -> *) (g :: k1 -> *).\n (Barbies.Internal.TraversableT.TraversableT b,\n GHC.Base.Applicative e) =>\n (forall (a :: k1). f1 a -> e (g a))\n -> Flip b f f1 -> e (Flip b f g)\n@@ -1048,15 +1048,15 @@\n @e\n @f1\n @g\n @f\n $dApplicative\n eta\n eta1 `cast` (N:Flip[0] *>_N _N _R _N _N))]\n-2d62c01d3108a31377b2a673574162ef\n+798d35bf6d2c769faa1cf10c9bdd3d04\n $fTraversableTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k').\n Barbies.Internal.TraversableB.TraversableB (b f)) =>\n Barbies.Internal.TraversableT.TraversableT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -1087,15 +1087,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTkk'Flip_$cttraverse @k' @k @b v)]\n-bf93639222480e4410cb9d6ba5a70c7c\n+f55bcd6da2637ee87a7168c80dba7407\n $fTraversableTkk'Flip_$cttraverse ::\n forall k' k (b :: k' -> (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (forall (f :: k').\n Barbies.Internal.TraversableB.TraversableB (b f),\n GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e (g a)) -> Flip b f x -> e (Flip b g x)\n@@ -1131,89 +1131,89 @@\n (df @x)\n @e\n @f\n @g\n $dApplicative\n eta\n eta1 `cast` (N:Flip[0] _N *>_N _R _N _N))]\n-3a5890873c5b8ec56ba5947e769f5a8e\n+e5ae62cc08285eca3255d96f1b83bdda\n $tc'Flip :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2198245352559246084#Word64\n- 4307912401912817915#Word64\n+ 10936034090562563506#Word64\n+ 3726073953954584908#Word64\n $trModule\n $tc'Flip2\n 5#\n $tc'Flip1]\n-51da3ba6efb25c86fd328e82827f4e87\n+56923ea65452ac1fc94b896643483e92\n $tc'Flip1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-7590ef136c2c6a3dce4b26dfc53fc922\n+d7055a74bc1f5a58c170cb2cd862ebed\n $tc'Flip2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Flip3]\n-64af20d224c1289ac47068e67d863351\n+952c2a29a888b767470bbb0ddcec6366\n $tc'Flip3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Flip\"#]\n-3799348e6fe6ce3f2bc4aed54511f168\n+8ace0e3cf101d5425f0c9647dcbe3006\n $tcFlip :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 10716913605063753350#Word64\n- 3747298549638892042#Word64\n+ 8828279943065681420#Word64\n+ 2583892798175144461#Word64\n $trModule\n $tcFlip2\n 2#\n $tcFlip1]\n-cf50d45f49552f991f5418c4a2913161\n+192efd8ffc54423720c0497d54773baa\n $tcFlip1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a0027ad4b819c4b525c0601468087a39\n+b431a4538d8f917661866ef3795bd64e\n $tcFlip2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFlip3]\n-4b90f2e2488196625f3a6274664fe9fa\n+314b01110438c95f347043a2dac9e4eb\n $tcFlip3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Flip\"#]\n-a75c93f58dbad70b1630779853204eb2\n+279b5b3cde52445568992a0d33c4330d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-005d8881415f9184e2d60fbbf08101ac\n+98254c7a85bfaa65899f39c7265bd9d8\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-a92a825df14480056990e70cfe363c7e\n+30f4629d8544520c5dfecc2e6abed33a\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Bi\"#]\n-14178d5f4fcba167f915bd305feea89d\n+7612ce56b2a62852d084559b5d16eb70\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fe4e8ed3b6681b2f3b02bb3cab8aa084\n+6c4d741393062b4e1d33cc60e23a37a0\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-6b63aab1543f59bdde5c6a8f48e7282f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+75cac30b08cc6e876896063a5f282afd\n $w$cshowsPrec ::\n forall {k1} {k2} {b :: k2 -> k1 -> *} {l :: k1} {r :: k2}.\n GHC.Show.Show (b r l) =>\n GHC.Prim.Int# -> Flip b l r -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -1245,19 +1245,19 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowFlip2\n (f (GHC.CString.unpackAppendCString#\n $fShowFlip1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-ac4c6c7cc7586535b553de95af5ceac2\n+aa52aebafb1851649448ec7ef0576284\n type role Flip representational nominal nominal\n type Flip :: forall {k} {k1}. (k -> k1 -> *) -> k1 -> k -> *\n newtype Flip b l r = Flip {runFlip :: b r l}\n-b8ad8744ddec8383842944b6229622c9\n+bb528919f6c1be2bbe4dfc1f79b5ae6b\n btfoldMap ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n m (g :: k2 -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monoid m) =>\n (forall (a :: k1). f a -> m)\n -> (forall (a :: k2). g a -> m) -> b f g -> m\n@@ -1311,15 +1311,15 @@\n `cast`\n (Sym (Barbies.Internal.Writer.N:St[0] _R <()>_R)))\n } in\n \\ (x['GHC.Types.Many] :: b f g) ->\n case (g1 x) `cast` (Barbies.Internal.Writer.N:St[0] _R <()>_R)\n lvl4 of wild { (,) ds2 y ->\n y }]\n-7c5f772f891de5c87e7029a8ca6b3b41\n+d2e4c5d492d8a8c8f4974bd6b80741fb\n btmap ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (f' :: k1 -> *) (g :: k2 -> *) (g' :: k2 -> *).\n (Barbies.Internal.FunctorB.FunctorB (b f),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k1). f a -> f' a)\n -> (forall (a :: k2). g a -> g' a) -> b f g -> b f' g'\n@@ -1356,15 +1356,15 @@\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @g\n @g'\n hg\n } in\n \\ (x['GHC.Types.Many] :: b f g) -> f1 (g1 x)]\n-ed47bd6375a298ffd3ab33edd15f4be4\n+f36185157de75d141baed3dca07a2972\n btmap1 ::\n forall {k} (b :: (k -> *) -> (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (Barbies.Internal.FunctorB.FunctorB (b f),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k). f a -> g a) -> b f f -> b g g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1395,15 +1395,15 @@\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n h\n } in\n \\ (x['GHC.Types.Many] :: b f f) -> f1 (g1 x)]\n-5aa88b6958bf3e76f1bd866011ff251f\n+cea835c7b6dad130fda7bcb1b9d89752\n btprod ::\n forall {k} (b :: (* -> *) -> (k -> *) -> *) (f :: * -> *)\n (f' :: * -> *) (g :: k -> *) (g' :: k -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b (Data.Semigroup.Internal.Alt\n (Data.Functor.Product.Product f f'))),\n Barbies.Internal.FunctorT.FunctorT b, GHC.Base.Alternative f,\n@@ -1493,15 +1493,15 @@\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Alt[0]\n <*>_N\n _R) _N)\n r))]\n-e3253a1aeeba2676a8889d482f70cc8f\n+c44814a212b11541288ca506aa44044f\n btpure ::\n forall {k1} {k2} (b :: ((k1 -> *) -> *) -> (k2 -> *) -> *)\n (f :: (k1 -> *) -> *) (g :: k2 -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b Barbies.Internal.Trivial.Unit),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k1 -> *). f a) -> (forall (a :: k2). g a) -> b f g\n@@ -1532,15 +1532,15 @@\n case ds2 of wild { Barbies.Internal.Trivial.Unit -> fa @a })\n (Barbies.Internal.ApplicativeB.bpure\n @k1\n @(b Barbies.Internal.Trivial.Unit)\n $dApplicativeB\n @g\n ga)]\n-06847fa376923aec6d9204778d06623a\n+926205a326df3094372feff801aba305\n btpure1 ::\n forall {k} (b :: ((k -> *) -> *) -> ((k -> *) -> *) -> *)\n (f :: (k -> *) -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b Barbies.Internal.Trivial.Unit),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k -> *). f a) -> b f f\n@@ -1568,15 +1568,15 @@\n case ds2 of wild { Barbies.Internal.Trivial.Unit -> h @a })\n (Barbies.Internal.ApplicativeB.bpure\n @(k -> *)\n @(b Barbies.Internal.Trivial.Unit)\n $dApplicativeB\n @f\n h)]\n-43d234654f9703de062a97a3d6d4e996\n+b9effc0b9f1b64ed45716642950933bb\n bttraverse ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (t :: * -> *) (f' :: k1 -> *) (g :: k2 -> *) (g' :: k2 -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad t) =>\n (forall (a :: k1). f a -> t (f' a))\n -> (forall (a :: k2). g a -> t (g' a)) -> b f g -> t (b f' g')\n@@ -1627,15 +1627,15 @@\n @f'\n @g'\n $dApplicative\n eta\n } in\n \\ (x['GHC.Types.Many] :: b f g) ->\n GHC.Base.>>= @t $dMonad @(b f g') @(b f' g') (f1 x) g1]\n-5b2c77592c3e7b0c5bd715ee01271b28\n+caaef1e2e72dbdf695c68857c7c2010e\n bttraverse1 ::\n forall {k} (b :: (k -> *) -> (k -> *) -> *) (f :: k -> *)\n (t :: * -> *) (g :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad t) =>\n (forall (a :: k). f a -> t (g a)) -> b f f -> t (b g g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1681,15 +1681,15 @@\n @g\n @g\n $dApplicative\n h\n } in\n \\ (x['GHC.Types.Many] :: b f f) ->\n GHC.Base.>>= @t $dMonad @(b f g) @(b g g) (f1 x) g1]\n-5fb51a98bdff243e93b627f6c27ab70c\n+297cfeffe109a98640f34e5e1fc65e2f\n bttraverse_ ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (e :: * -> *) c (g :: k2 -> *) d.\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad e) =>\n (forall (a :: k1). f a -> e c)\n -> (forall (a :: k2). g a -> e d) -> b f g -> e ()\n@@ -1786,21 +1786,21 @@\n (GHC.Base.>>=\n @e\n $dMonad\n @(b f (Data.Functor.Const.Const ()))\n @(b (Data.Functor.Const.Const ()) (Data.Functor.Const.Const ()))\n (f1 x)\n g1)]\n-f9729e767397f4f1ea256eef7f803a75\n+c2423c8c774ae93b3bd362a323b75e21\n bttraverse_1 :: a -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (ds2['GHC.Types.Many] :: a) -> GHC.Tuple.Prim.()]\n-9a142bd1b66599dedab53d1dfec77218\n+5d903c11c1d782f47d5cbbdc8e1ed3c9\n runFlip ::\n forall {k1} {k2} (b :: k1 -> k2 -> *) (l :: k2) (r :: k1).\n Flip b l r -> b r l\n RecSel Left Flip\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Bi 9066\n- interface hash: 18fb10cbe8d3edeb31f0ad40d22e6f12\n- ABI hash: 604a1d41e05e1d123fdb2fac9fd8f040\n- export-list hash: 7b265b9f77349ea169ef59918f8772f0\n+ interface hash: 082c1962ec0142a182a4de7431955ab9\n+ ABI hash: ce67569e93ab0ed6a906de485fde3d62\n+ export-list hash: a9bfde5a4613e09bfb2c8fc0be8120dd\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: d6fce41d5ce6569c6a91341208648a83\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 230f04ad0eff370d4fb01f412f4dab2e\n sig of: Nothing\n@@ -24,18 +24,18 @@\n btprod\n btpure\n btpure1\n bttraverse\n bttraverse1\n bttraverse_\n Flip{Flip runFlip}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.ConstraintsB\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveB\n Barbies.Internal.DistributiveT Barbies.Internal.FunctorB\n@@ -54,52 +54,52 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- ApplicativeT a99ce0340646a38f9575b049182a8def\n- tprod 94d237cedb9b905a9c75a58fc4be2d84\n- tpure 3d2d76935d5f8427ccff8120f17ee9cb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- DistributiveB e01ed0fa1927b910f29b673ced05da93\n- bdistribute 5b40d11ac15b14f1ed4a3c11011331d8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT 2d87ad7b0d939518df31ee312faa9bf2\n- DistributiveT 375f90ea1d05e60dc2c4545948c0f64a\n- tdistribute ac2e5b8fba24fb8dcfa0e8bfe938022d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- TraversableT 5f45683a672c1e8b493f3644d95842b8\n- ttraverse d3238a3d0af65058271e05836e392ec5\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit a4df766290f2aea4bc82298ff16dbd46\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 4b8cfed320a9759153c9f2e1178f5919\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr c0469e5e8a962b81eaa1e5c9b2f08584\n- tell 318bc913c1a4613db9a7000eccfc0ab8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 8580d8e7c5c9c44a5534809ebf1907d2\n- exports: b2c90f3ed7344f6cbd155b29f58a4f5d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer 12cc87af2ef508ba724114c0268390b0\n- exports: 4730a0f9a2e2a68edc332389a361be24\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ ApplicativeT 074070de79264540541cf796d013c0ef\n+ tprod afb228a962be5d495a61627aaf4064db\n+ tpure 45b5a8f3e24017491bb877f3c054cbb9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ DistributiveB b7a598d798980f56a6401cbf7835693e\n+ bdistribute 61b5bf0b84e4754f2266e05a24600562\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT d42051f3b0e0718fa7a27a87fb621d9a\n+ DistributiveT bc1ead53dbcac53eb866a8dcc1c81565\n+ tdistribute b68f74dc7b1ae0f6c5b72deaf1396df6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ TraversableT 85e954d72370c1d24f1ff0e67fec5163\n+ ttraverse 7d33e27d536aa9640cd0d31bd3eaff70\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit ae7009495dd3ca0664463506cc352eb5\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer 1ac8301754bf8fc4ae662af9201e1b17\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 56d7951edbc29f9bb80efe13a3b090ce\n+ tell 44d33a86554f81bd08a29cb9f096fae7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie dad1ef832afa2c721a22049834cc9dd4\n+ exports: b3763818b9e315ec61a28b921995582d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer 14df9c3ebd1edd9c535cf1dfeaaf95c6\n+ exports: 3239be74cd8260541a54d1361d625cef\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Control.Monad a8552ca25f5dcd7ee6fb611cbb0ec055\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Monoid 672247a2f00dd02f4a07408e39ac3b93\n import -/ Data.Semigroup.Internal b9587b96cd753f58ca99258378fd0556\n@@ -107,17 +107,17 @@\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.ParserCombinators.ReadPrec a657147dbd7291808782bfe31b23cd99\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-e7fa8010c22dcdba2911aef100ad808d\n+8d7e8a0ec14d9dcfc79793008156dd09\n $fApplicativeBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n Barbies.Internal.ApplicativeB.ApplicativeB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -147,15 +147,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fApplicativeBkFlip_$cbpure @k @k1 @b @f v)\n ($fApplicativeBkFlip_$cbprod @k @k1 @b @f v)]\n-9df2a9746a00ea25eb2bb80f83662636\n+3c9591d9750f48d2b3a343d176871d4f\n $fApplicativeBkFlip_$cbprod ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *)\n (g :: k1 -> *).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n Flip b f f1\n -> Flip b f g -> Flip b f (Data.Functor.Product.Product f1 g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -192,15 +192,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-d4f5216b124d4f5ce5347802e6cbf484\n+27fb366f515903883331d568492414a9\n $fApplicativeBkFlip_$cbpure ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n (forall (a :: k1). f1 a) -> Flip b f f1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -228,15 +228,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-69bda5ee1cc715da36ccf14dbef2d677\n+69dca1b7a5ff6dae1b8b4317de52e968\n $fApplicativeTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n Barbies.Internal.ApplicativeT.ApplicativeT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -268,15 +268,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTkk'Flip_$ctpure @k' @k @b v)\n ($fApplicativeTkk'Flip_$ctprod @k' @k @b v)]\n-e709edc7ca66e4c40e497983d621a9c5\n+9cee07a549f96143e8347225ca0670ad\n $fApplicativeTkk'Flip_$ctprod ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (x :: k')\n (g :: k -> *).\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n Flip b f x\n -> Flip b g x -> Flip b (Data.Functor.Product.Product f g) x\n@@ -312,15 +312,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-920ad6fe9dd4989432ed2a57626c6a6b\n+d133f4d78c75907cddd6b1dddc7a7e33\n $fApplicativeTkk'Flip_$ctpure ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (x :: k').\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n (forall (a :: k). f a) -> Flip b f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A)>, Inline: (sat-args=1),\n@@ -342,15 +342,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-7d6be3a82974c44df506e2562bf2f470\n+711c4a965ad9ace7635259a400ec216b\n $fDistributiveBTYPEFlip ::\n forall k (b :: (* -> *) -> k -> *) (f :: k).\n Barbies.Internal.DistributiveT.DistributiveT b =>\n Barbies.Internal.DistributiveB.DistributiveB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -378,29 +378,29 @@\n (forall (f1 :: <* -> *>_N) (g :: <* -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n <* -> *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] <*>_N _N))\n ($fDistributiveBTYPEFlip_$cbdistribute @k @b @f v)]\n-1d897a88e8087d2955a41f34a425ae8c\n+655da2dc4800c1f48edd37d4be4e5597\n $fDistributiveBTYPEFlip1 ::\n forall {k1} {k2} {b :: k1 -> k2 -> *} {l :: k2} {r :: k1}.\n Flip b l r -> Flip b l r\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @k1\n @b :: k -> k1 -> *\n @l :: k1\n @r :: k\n (ds2['GHC.Types.Many] :: Flip b l r) ->\n ds2]\n-1f2eaf34db3dc9c3c6d2fc06e58cc8f3\n+1536f58d56f1da2a98e11c25e58f709a\n $fDistributiveBTYPEFlip_$cbdistribute ::\n forall k (b :: (* -> *) -> k -> *) (f :: k) (f1 :: * -> *)\n (g :: * -> *).\n (Barbies.Internal.DistributiveT.DistributiveT b,\n GHC.Base.Functor f1) =>\n f1 (Flip b f g) -> Flip b f (Data.Functor.Compose.Compose f1 g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -443,15 +443,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n <* -> *>_N\n _N\n _R\n _N\n _N))]\n-8d07227dcb51efc4a53a9e4369a7c436\n+761a010e80b1fb53ffa94b2670e940a8\n $fDistributiveTiFlip ::\n forall i (b :: i -> (* -> *) -> *).\n (forall (f :: i).\n Barbies.Internal.DistributiveB.DistributiveB (b f)) =>\n Barbies.Internal.DistributiveT.DistributiveT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -483,15 +483,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N <* -> *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N _N _N))\n ($fDistributiveTiFlip_$ctdistribute @i @b v)]\n-b11a1c33f1744460c4ba63ae7d3f8a54\n+bbc0e0fc22cb9e895dce43c1cac97505\n $fDistributiveTiFlip_$ctdistribute ::\n forall i (b :: i -> (* -> *) -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (forall (f :: i).\n Barbies.Internal.DistributiveB.DistributiveB (b f),\n GHC.Base.Functor f) =>\n f (Flip b g x) -> Flip b (Data.Functor.Compose.Compose f g) x\n@@ -534,15 +534,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n <* -> *>_N\n _R\n _N\n _N))]\n-155659467b621fdf3a4f7a731e41c43b\n+f09b6253722fb8ebfaa91c315e83ab20\n $fEqFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Eq (b r l) =>\n GHC.Classes.Eq (Flip b l r)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -561,15 +561,15 @@\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b r l) v)\n `cast`\n (Sym (N:Flip[0] _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-327810441d72b0d1561e9db6a0114fd6\n+c0587a7379cad21ebcf761fb2d6c2747\n $fFunctorBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.FunctorT.FunctorT b =>\n Barbies.Internal.FunctorB.FunctorB (Flip b f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=0),\n@@ -577,15 +577,15 @@\n $fFunctorBkFlip_$cbmap\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (b :: <(k -> *)\n -> k1 -> *>_N) (f :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))]\n-206a41e5e7ec10a114994fee9e7972fd\n+be5a9871225b3fbe66bd008792138874\n $fFunctorBkFlip_$cbmap ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *)\n (g :: k1 -> *).\n Barbies.Internal.FunctorT.FunctorT b =>\n (forall (a :: k1). f1 a -> g a) -> Flip b f f1 -> Flip b f g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=2),\n@@ -618,30 +618,30 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-c9fa6776e9bf47a4e9ad7d544469f59b\n+a2653dcd4377b8c02cc0fb128640b8e9\n $fFunctorTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k'). Barbies.Internal.FunctorB.FunctorB (b f)) =>\n Barbies.Internal.FunctorT.FunctorT (Flip b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseTrue>\n $fFunctorTkk'Flip_$ctmap\n `cast`\n (forall (k' :: <*>_N) (k :: <*>_N) (b :: (k -> *) -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))]\n-df3d0f9106a92c7f64a1de33bfe9e4ca\n+141672b14b4a65a49aaa631c708bb2b7\n $fFunctorTkk'Flip_$ctmap ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (forall (f :: k'). Barbies.Internal.FunctorB.FunctorB (b f)) =>\n (forall (a :: k). f a -> g a) -> Flip b f x -> Flip b g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=2),\n@@ -672,15 +672,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-55765655192104bdc97a949af9ca4eee\n+f9a7503136e3c91ea14beaf0bedd84f8\n $fOrdFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Ord (b r l) =>\n GHC.Classes.Ord (Flip b l r)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -733,30 +733,30 @@\n (GHC.Classes.min @(b r l) v)\n `cast`\n (Sym (N:Flip[0] _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N))]\n-f40e6fd2fd2c22ed81fb0e0e400eb9ba\n+d886a01b7f0063ba9b5ca0959298e2a4\n $fOrdFlip_$cp1Ord ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Ord (b r l) =>\n GHC.Classes.Eq (Flip b l r)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k\n @k1\n @b :: k1 -> k -> *\n @l :: k\n @r :: k1\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord (b r l)) ->\n $fEqFlip @k @k1 @b @l @r (GHC.Classes.$p1Ord @(b r l) $dOrd)]\n-c3bf1081dcfa93f3ad331bbe72e1e8e9\n+d13c4dc3cb8bcafc09b06b318bc21d13\n $fReadFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n GHC.Read.Read (Flip b l r)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n@@ -773,25 +773,25 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadFlip_$creadListPrec @k @k1 @b @l @r v)]\n-d429ff46ed50c937178e62ce3b912159\n+37f5436801845b133796977ae3693885\n $fReadFlip1 ::\n forall {k1} {k2} {b :: k2 -> k1 -> *} {l :: k1} {r :: k2}.\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (Flip b l r -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-acdeda71cc79652157d32b03fc16d888\n+8ac527d28174224c002ccc84b2a3281b\n $fReadFlip_$creadList ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadP.ReadS [Flip b l r]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -816,15 +816,15 @@\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Flip b l r]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Flip b l r]>_R)\n @[Flip b l r]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[Flip b l r]))]\n-95426c64fdf283fdf8471a232af6eb7f\n+5168a97f687631452d44256ea48f009c\n $fReadFlip_$creadListPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [Flip b l r]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -839,15 +839,15 @@\n ($fReadFlip1 @k @k1 @b @l @r $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-d2182812bafb7ff533c2c0e7666acfe1\n+26225212a060715a939d44406dcffc8c\n $fReadFlip_$creadsPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Flip b l r)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -867,15 +867,15 @@\n @l\n @r\n $dRead\n eta\n @(Flip b l r)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Flip b l r)))]\n-72f4ad9fe18c337bc6353102b9427ff8\n+e2dc0925a72aaefc7aca5fb01b19aba9\n $fShowFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n GHC.Show.Show (Flip b l r)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n@@ -885,32 +885,32 @@\n @l :: k\n @r :: k1\n (v['GHC.Types.Many] :: GHC.Show.Show (b r l)).\n @(Flip b l r)\n ($fShowFlip_$cshowsPrec @k @k1 @b @l @r v)\n ($fShowFlip_$cshow @k @k1 @b @l @r v)\n ($fShowFlip_$cshowList @k @k1 @b @l @r v)]\n-d181d1a610be85ba52e10e617386e3c2\n+aa6732ec5c544da0aabd0de2a3f96f4c\n $fShowFlip1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"}\"#]\n-c4dbb9dbd7e56b3fd0240cccc794202a\n+b301dbf2249114aae578ff5c802d7234\n $fShowFlip2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Flip {runFlip = \"#]\n-7139e4da256a5ee153be66976bbddf0a\n+2e0f2ed4c46bfb4b21e11d02cb6e9fd6\n $fShowFlip3 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-d3a02b0d3fa324f6ae28f467d5f70d58\n+4ade2b920c468740ac8a14d5b3192d40\n $fShowFlip4 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShowFlip1]\n-cfad4b21032776db5b3baf0b7d6bb8fc\n+50706f7591839b4a1c90a6971e7ba0c9\n $fShowFlip_$cshow ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n Flip b l r -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -925,15 +925,15 @@\n $fShowFlip2\n (GHC.Show.showsPrec\n @(b r l)\n $dShow\n $fShowFlip3\n x `cast` (N:Flip[0] _N _N _R _N _N)\n $fShowFlip4)]\n-8517402d9e56ecb2aa8041c9c82ad99e\n+5ee6b2546fd6c03cd14096636d0d1feb\n $fShowFlip_$cshowList ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n [Flip b l r] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -947,15 +947,15 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Flip b l r)\n (\\ (ds2['GHC.Types.Many] :: Flip b l r) ->\n $w$cshowsPrec @k @k1 @b @l @r $dShow 0# ds2)\n ls\n s]\n-17b8f603177bd0dcc399f0596fd54a2b\n+04fdc04bcca96bc71bcf9b081ebf3a41\n $fShowFlip_$cshowsPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n GHC.Types.Int -> Flip b l r -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n@@ -965,15 +965,15 @@\n @l :: k\n @r :: k1\n ($dShow['GHC.Types.Many] :: GHC.Show.Show (b r l))\n (a['GHC.Types.Many] :: GHC.Types.Int)\n (ds2['GHC.Types.Many] :: Flip b l r) ->\n case a of wild { GHC.Types.I# ww ->\n $w$cshowsPrec @k @k1 @b @l @r $dShow ww ds2 }]\n-161366bbb7d35ceb34c788dba68b8e8e\n+57d38a0802897877317ede5ce0516504\n $fTraversableBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.TraversableT.TraversableT b =>\n Barbies.Internal.TraversableB.TraversableB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -1002,15 +1002,15 @@\n (forall (f1 :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkFlip_$cbtraverse @k @k1 @b @f v)]\n-352b761c9912a8d750f8a3aba393a86e\n+b0b73e27be440c946af82fbee6aa7548\n $fTraversableBkFlip_$cbtraverse ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (e :: * -> *)\n (f1 :: k1 -> *) (g :: k1 -> *).\n (Barbies.Internal.TraversableT.TraversableT b,\n GHC.Base.Applicative e) =>\n (forall (a :: k1). f1 a -> e (g a))\n -> Flip b f f1 -> e (Flip b f g)\n@@ -1048,15 +1048,15 @@\n @e\n @f1\n @g\n @f\n $dApplicative\n eta\n eta1 `cast` (N:Flip[0] *>_N _N _R _N _N))]\n-2d62c01d3108a31377b2a673574162ef\n+798d35bf6d2c769faa1cf10c9bdd3d04\n $fTraversableTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k').\n Barbies.Internal.TraversableB.TraversableB (b f)) =>\n Barbies.Internal.TraversableT.TraversableT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -1087,15 +1087,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTkk'Flip_$cttraverse @k' @k @b v)]\n-bf93639222480e4410cb9d6ba5a70c7c\n+f55bcd6da2637ee87a7168c80dba7407\n $fTraversableTkk'Flip_$cttraverse ::\n forall k' k (b :: k' -> (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (forall (f :: k').\n Barbies.Internal.TraversableB.TraversableB (b f),\n GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e (g a)) -> Flip b f x -> e (Flip b g x)\n@@ -1131,89 +1131,89 @@\n (df @x)\n @e\n @f\n @g\n $dApplicative\n eta\n eta1 `cast` (N:Flip[0] _N *>_N _R _N _N))]\n-3a5890873c5b8ec56ba5947e769f5a8e\n+e5ae62cc08285eca3255d96f1b83bdda\n $tc'Flip :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2198245352559246084#Word64\n- 4307912401912817915#Word64\n+ 10936034090562563506#Word64\n+ 3726073953954584908#Word64\n $trModule\n $tc'Flip2\n 5#\n $tc'Flip1]\n-51da3ba6efb25c86fd328e82827f4e87\n+56923ea65452ac1fc94b896643483e92\n $tc'Flip1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-7590ef136c2c6a3dce4b26dfc53fc922\n+d7055a74bc1f5a58c170cb2cd862ebed\n $tc'Flip2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Flip3]\n-64af20d224c1289ac47068e67d863351\n+952c2a29a888b767470bbb0ddcec6366\n $tc'Flip3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Flip\"#]\n-3799348e6fe6ce3f2bc4aed54511f168\n+8ace0e3cf101d5425f0c9647dcbe3006\n $tcFlip :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 10716913605063753350#Word64\n- 3747298549638892042#Word64\n+ 8828279943065681420#Word64\n+ 2583892798175144461#Word64\n $trModule\n $tcFlip2\n 2#\n $tcFlip1]\n-cf50d45f49552f991f5418c4a2913161\n+192efd8ffc54423720c0497d54773baa\n $tcFlip1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a0027ad4b819c4b525c0601468087a39\n+b431a4538d8f917661866ef3795bd64e\n $tcFlip2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFlip3]\n-4b90f2e2488196625f3a6274664fe9fa\n+314b01110438c95f347043a2dac9e4eb\n $tcFlip3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Flip\"#]\n-a75c93f58dbad70b1630779853204eb2\n+279b5b3cde52445568992a0d33c4330d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-005d8881415f9184e2d60fbbf08101ac\n+98254c7a85bfaa65899f39c7265bd9d8\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-a92a825df14480056990e70cfe363c7e\n+30f4629d8544520c5dfecc2e6abed33a\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Bi\"#]\n-14178d5f4fcba167f915bd305feea89d\n+7612ce56b2a62852d084559b5d16eb70\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fe4e8ed3b6681b2f3b02bb3cab8aa084\n+6c4d741393062b4e1d33cc60e23a37a0\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-6b63aab1543f59bdde5c6a8f48e7282f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+75cac30b08cc6e876896063a5f282afd\n $w$cshowsPrec ::\n forall {k1} {k2} {b :: k2 -> k1 -> *} {l :: k1} {r :: k2}.\n GHC.Show.Show (b r l) =>\n GHC.Prim.Int# -> Flip b l r -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -1245,19 +1245,19 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowFlip2\n (f (GHC.CString.unpackAppendCString#\n $fShowFlip1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-ac4c6c7cc7586535b553de95af5ceac2\n+aa52aebafb1851649448ec7ef0576284\n type role Flip representational nominal nominal\n type Flip :: forall {k} {k1}. (k -> k1 -> *) -> k1 -> k -> *\n newtype Flip b l r = Flip {runFlip :: b r l}\n-b8ad8744ddec8383842944b6229622c9\n+bb528919f6c1be2bbe4dfc1f79b5ae6b\n btfoldMap ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n m (g :: k2 -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monoid m) =>\n (forall (a :: k1). f a -> m)\n -> (forall (a :: k2). g a -> m) -> b f g -> m\n@@ -1311,15 +1311,15 @@\n `cast`\n (Sym (Barbies.Internal.Writer.N:St[0] _R <()>_R)))\n } in\n \\ (x['GHC.Types.Many] :: b f g) ->\n case (g1 x) `cast` (Barbies.Internal.Writer.N:St[0] _R <()>_R)\n lvl4 of wild { (,) ds2 y ->\n y }]\n-7c5f772f891de5c87e7029a8ca6b3b41\n+d2e4c5d492d8a8c8f4974bd6b80741fb\n btmap ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (f' :: k1 -> *) (g :: k2 -> *) (g' :: k2 -> *).\n (Barbies.Internal.FunctorB.FunctorB (b f),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k1). f a -> f' a)\n -> (forall (a :: k2). g a -> g' a) -> b f g -> b f' g'\n@@ -1356,15 +1356,15 @@\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @g\n @g'\n hg\n } in\n \\ (x['GHC.Types.Many] :: b f g) -> f1 (g1 x)]\n-ed47bd6375a298ffd3ab33edd15f4be4\n+f36185157de75d141baed3dca07a2972\n btmap1 ::\n forall {k} (b :: (k -> *) -> (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (Barbies.Internal.FunctorB.FunctorB (b f),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k). f a -> g a) -> b f f -> b g g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1395,15 +1395,15 @@\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n h\n } in\n \\ (x['GHC.Types.Many] :: b f f) -> f1 (g1 x)]\n-5aa88b6958bf3e76f1bd866011ff251f\n+cea835c7b6dad130fda7bcb1b9d89752\n btprod ::\n forall {k} (b :: (* -> *) -> (k -> *) -> *) (f :: * -> *)\n (f' :: * -> *) (g :: k -> *) (g' :: k -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b (Data.Semigroup.Internal.Alt\n (Data.Functor.Product.Product f f'))),\n Barbies.Internal.FunctorT.FunctorT b, GHC.Base.Alternative f,\n@@ -1493,15 +1493,15 @@\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Alt[0]\n <*>_N\n _R) _N)\n r))]\n-e3253a1aeeba2676a8889d482f70cc8f\n+c44814a212b11541288ca506aa44044f\n btpure ::\n forall {k1} {k2} (b :: ((k1 -> *) -> *) -> (k2 -> *) -> *)\n (f :: (k1 -> *) -> *) (g :: k2 -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b Barbies.Internal.Trivial.Unit),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k1 -> *). f a) -> (forall (a :: k2). g a) -> b f g\n@@ -1532,15 +1532,15 @@\n case ds2 of wild { Barbies.Internal.Trivial.Unit -> fa @a })\n (Barbies.Internal.ApplicativeB.bpure\n @k1\n @(b Barbies.Internal.Trivial.Unit)\n $dApplicativeB\n @g\n ga)]\n-06847fa376923aec6d9204778d06623a\n+926205a326df3094372feff801aba305\n btpure1 ::\n forall {k} (b :: ((k -> *) -> *) -> ((k -> *) -> *) -> *)\n (f :: (k -> *) -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b Barbies.Internal.Trivial.Unit),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k -> *). f a) -> b f f\n@@ -1568,15 +1568,15 @@\n case ds2 of wild { Barbies.Internal.Trivial.Unit -> h @a })\n (Barbies.Internal.ApplicativeB.bpure\n @(k -> *)\n @(b Barbies.Internal.Trivial.Unit)\n $dApplicativeB\n @f\n h)]\n-43d234654f9703de062a97a3d6d4e996\n+b9effc0b9f1b64ed45716642950933bb\n bttraverse ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (t :: * -> *) (f' :: k1 -> *) (g :: k2 -> *) (g' :: k2 -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad t) =>\n (forall (a :: k1). f a -> t (f' a))\n -> (forall (a :: k2). g a -> t (g' a)) -> b f g -> t (b f' g')\n@@ -1627,15 +1627,15 @@\n @f'\n @g'\n $dApplicative\n eta\n } in\n \\ (x['GHC.Types.Many] :: b f g) ->\n GHC.Base.>>= @t $dMonad @(b f g') @(b f' g') (f1 x) g1]\n-5b2c77592c3e7b0c5bd715ee01271b28\n+caaef1e2e72dbdf695c68857c7c2010e\n bttraverse1 ::\n forall {k} (b :: (k -> *) -> (k -> *) -> *) (f :: k -> *)\n (t :: * -> *) (g :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad t) =>\n (forall (a :: k). f a -> t (g a)) -> b f f -> t (b g g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1681,15 +1681,15 @@\n @g\n @g\n $dApplicative\n h\n } in\n \\ (x['GHC.Types.Many] :: b f f) ->\n GHC.Base.>>= @t $dMonad @(b f g) @(b g g) (f1 x) g1]\n-5fb51a98bdff243e93b627f6c27ab70c\n+297cfeffe109a98640f34e5e1fc65e2f\n bttraverse_ ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (e :: * -> *) c (g :: k2 -> *) d.\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad e) =>\n (forall (a :: k1). f a -> e c)\n -> (forall (a :: k2). g a -> e d) -> b f g -> e ()\n@@ -1786,21 +1786,21 @@\n (GHC.Base.>>=\n @e\n $dMonad\n @(b f (Data.Functor.Const.Const ()))\n @(b (Data.Functor.Const.Const ()) (Data.Functor.Const.Const ()))\n (f1 x)\n g1)]\n-f9729e767397f4f1ea256eef7f803a75\n+c2423c8c774ae93b3bd362a323b75e21\n bttraverse_1 :: a -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (ds2['GHC.Types.Many] :: a) -> GHC.Tuple.Prim.()]\n-9a142bd1b66599dedab53d1dfec77218\n+5d903c11c1d782f47d5cbbdc8e1ed3c9\n runFlip ::\n forall {k1} {k2} (b :: k1 -> k2 -> *) (l :: k2) (r :: k1).\n Flip b l r -> b r l\n RecSel Left Flip\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.hi", "comments": ["Files 82% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,83 +1,83 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Constraints 9066\n- interface hash: 08fed786e727fd8663c694f6c3d1a02a\n- ABI hash: 7d964f84e9fc8c1acc30387c7c73848d\n- export-list hash: be6f5ddcf38e2a3ee09cde2297307304\n+ interface hash: 3d755d73a89c64f64d983d3ba0377c35\n+ ABI hash: 5aab8fa0f43361e569640e6660390024\n+ export-list hash: e5c398c7169ee02e2827d8a404cea910\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n+ flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 64cae00ab386ed23967954c49dbf3451\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Barbies.Internal.Dicts.requiringDict\n Barbies.Internal.ConstraintsB.&\n Barbies.Internal.ConstraintsB.AllBF\n Barbies.Internal.Dicts.ClassF\n Barbies.Internal.Dicts.ClassFG\n Barbies.Internal.Dicts.Dict{Barbies.Internal.Dicts.Dict}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Barbies.Internal.ConstraintsB Data.Generics.GenericN\n Control.Applicative Control.Arrow Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup.Internal Data.Type.Ord\n Data.Version GHC.Generics GHC.IO.Exception GHC.RTS.Flags\n Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- & b4981f1f879e533cf698bb596a0c96e2\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- ClassFG 49f1c53a16ecf58347d2954cac6dea25\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ & 262e3f2037fcd8d28cf63dfb107609ac\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ ClassFG 956656054dd5ddd580072614ba216cb3\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-d5e08f9aa425846984beb0e1df4d9890\n+2b3dd5bb37b38ac231e2bf44a76aa75d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d50ccbd0186b57590c1aa18e8680b704\n+cacdc72938810ca679c001b92b36e407\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4f034483c16c58358071819557a3cc2f\n+deae2605fdc4049dacc70bd47d29c7db\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Constraints\"#]\n-5a41b37fc1195c3153a0d231825f6dab\n+2a3f629c6a21e6b227f56cf02628930f\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-817972c0dabe048c41741d392be9ae10\n+b5f419eb10b28cb640d24524eda67cc5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.dyn_hi", "comments": ["Files 81% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,83 +1,83 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Constraints 9066\n- interface hash: 08fed786e727fd8663c694f6c3d1a02a\n- ABI hash: 7d964f84e9fc8c1acc30387c7c73848d\n- export-list hash: be6f5ddcf38e2a3ee09cde2297307304\n+ interface hash: 3d755d73a89c64f64d983d3ba0377c35\n+ ABI hash: 5aab8fa0f43361e569640e6660390024\n+ export-list hash: e5c398c7169ee02e2827d8a404cea910\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: f3ef90b23a8894f3c8a76d060589be75\n+ flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 64cae00ab386ed23967954c49dbf3451\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Barbies.Internal.Dicts.requiringDict\n Barbies.Internal.ConstraintsB.&\n Barbies.Internal.ConstraintsB.AllBF\n Barbies.Internal.Dicts.ClassF\n Barbies.Internal.Dicts.ClassFG\n Barbies.Internal.Dicts.Dict{Barbies.Internal.Dicts.Dict}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Barbies.Internal.ConstraintsB Data.Generics.GenericN\n Control.Applicative Control.Arrow Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup.Internal Data.Type.Ord\n Data.Version GHC.Generics GHC.IO.Exception GHC.RTS.Flags\n Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- & b4981f1f879e533cf698bb596a0c96e2\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- ClassFG 49f1c53a16ecf58347d2954cac6dea25\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ & 262e3f2037fcd8d28cf63dfb107609ac\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ ClassFG 956656054dd5ddd580072614ba216cb3\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-d5e08f9aa425846984beb0e1df4d9890\n+2b3dd5bb37b38ac231e2bf44a76aa75d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d50ccbd0186b57590c1aa18e8680b704\n+cacdc72938810ca679c001b92b36e407\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4f034483c16c58358071819557a3cc2f\n+deae2605fdc4049dacc70bd47d29c7db\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Constraints\"#]\n-5a41b37fc1195c3153a0d231825f6dab\n+2a3f629c6a21e6b227f56cf02628930f\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-817972c0dabe048c41741d392be9ae10\n+b5f419eb10b28cb640d24524eda67cc5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.dyn_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Generics.Applicative 9066\n- interface hash: 782366472ca7519297966c6b00fcad83\n- ABI hash: cd6b2d8adddf9a2d3767a33a685f152d\n- export-list hash: f40c4fca68d431a2e25a33b0ebf2670a\n+ interface hash: 5ddbb545689de42c1db740596a93742f\n+ ABI hash: c8c35967a74c18c83413193270a3b945\n+ export-list hash: 8877b8886ac9c53ac49919a9e0e9312a\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2826c8fc0b222c614fbc957914286dc4\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GApplicative{gprod gpure}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Monoid Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-26c03417b0357de5bd8956a40c4ff573\n+915f2636451ad206149b1278c1c618f6\n $fGApplicativeNaturalkknfgRecRecRec ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1).\n GHC.Base.Applicative h =>\n GApplicative\n n\n f\n@@ -93,15 +93,15 @@\n @k1\n @h\n @n\n @f\n @g\n @a\n v)]\n-fad8eb75b8c9fc73c12e54a0683f3b58\n+127373478128f8da47783e04f4107751\n $fGApplicativeNaturalkknfgRecRecRec0 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1).\n GApplicative\n n\n f\n g\n@@ -128,15 +128,15 @@\n @(Data.Generics.GenericN.Rec (P n f a) (f a))\n @(Data.Generics.GenericN.Rec (P n g a) (g a))\n @(Data.Generics.GenericN.Rec\n (P n (Data.Functor.Product.Product f g) a)\n (Data.Functor.Product.Product f g a))\n ($fGApplicativeNaturalkknfgRecRecRec0_$cgprod @k @k1 @n @f @g @a)\n ($fGApplicativeNaturalkknfgRecRecRec0_$cgpure @k @k1 @n @f @g @a)]\n-43fc303d4e9149a3595c23ad27c9a2f0\n+cece03a0976fce13ee499afbc37b1a4e\n $fGApplicativeNaturalkknfgRecRecRec0_$cgprod ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1) (x :: k2).\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (P n f a) (f a) x\n@@ -194,15 +194,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N)]\n-53705928647ee2b49b31d45ff206eb48\n+b506c85ba78d6a19177f2f2c9dee86d0\n $fGApplicativeNaturalkknfgRecRecRec0_$cgpure ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1) (x :: k2).\n (f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (P n f a) (f a)\n GHC.Types.~ Data.Generics.GenericN.Rec (P n g a) (g a)) =>\n Data.Proxy.Proxy n\n@@ -255,15 +255,15 @@\n (P n (Data.Functor.Product.Product f g) a)\n (Data.Functor.Product.Product f g a))>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N

_P) _N _N)]\n-cacb0c55e229c825b34a281c165d8c75\n+5ca004e5d73d1cde70232ff3cf8b40a2\n $fGApplicativeNaturalkknfgRecRecRec_$cgprod ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (x :: k2).\n GHC.Base.Applicative h =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -342,15 +342,15 @@\n _P) _N _N)]\n-171cdf604862297b2cd6406c08497336\n+f33016a4431e9bcd17636ceb1ef9e3b2\n $fGApplicativeNaturalkknfgRecRecRec_$cgpure ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (x :: k2).\n (GHC.Base.Applicative h, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (P n f a)) (h (f a))\n GHC.Types.~ Data.Generics.GenericN.Rec (h (P n g a)) (h (g a))) =>\n Data.Proxy.Proxy n\n@@ -424,15 +424,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-27b52d216c30f558cc925826ca01f612\n+b2b9ac217d60eef1b1745479976fccee\n $fGApplicativekkknfg:*::*::*: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg) =>\n GApplicative\n n\n@@ -495,15 +495,15 @@\n @lg\n @lfg\n @rf\n @rg\n @rfg\n v\n v1)]\n-d89273b6e175a949b775d9f70407c650\n+f4f969af2c756a0ca9e71e5596409231\n $fGApplicativekkknfg:*::*::*:_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *) (x :: k3).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg) =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n@@ -573,15 +573,15 @@\n $dGApplicative1\n @x\n pn\n pf\n pg\n l2\n r2) } }]\n-9e57089020ee6f044aa553e0c314add4\n+92bb2dc413959116f29453a98ec357c0\n $fGApplicativekkknfg:*::*::*:_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *) (x :: k3).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg,\n f GHC.Types.~ g,\n (lf GHC.Generics.:*: rf) GHC.Types.~ (lg GHC.Generics.:*: rg)) =>\n@@ -674,15 +674,15 @@\n `cast`\n ((GHC.Types.~) *>_N (SelCo:Tc(2) (Sym co)) _N)_R\n eta\n eta1\n (Data.Proxy.Proxy @(k2 -> *) @rf)\n (Data.Proxy.Proxy @(k2 -> *) @rfg)\n eta4) } }]\n-e07bdab34162fca845a58d3fd946eec2\n+7cc679d60922042a765d63728c875380\n $fGApplicativekkknfgM1M1M1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta).\n GApplicative n f g repf repg repfg =>\n GApplicative\n n\n@@ -739,15 +739,15 @@\n @g\n @repf\n @repg\n @repfg\n @i\n @c\n v)]\n-dfcedcb479ee9aeb7fb1d697b0ea102b\n+652998c119449889d87d384a1b00dafb\n $fGApplicativekkknfgM1M1M1_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta) (x :: k3).\n GApplicative n f g repf repg repfg =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n@@ -812,15 +812,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-c71ec9e9b883d9f69874fc25b1ca3c83\n+9d3267827f0b31fef9030e9c3b197e73\n $fGApplicativekkknfgM1M1M1_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta) (x :: k3).\n (GApplicative n f g repf repg repfg, f GHC.Types.~ g,\n GHC.Generics.M1 i c repf GHC.Types.~ GHC.Generics.M1 i c repg) =>\n Data.Proxy.Proxy n\n@@ -884,15 +884,15 @@\n eta\n eta1\n (Data.Proxy.Proxy @(k2 -> *) @repf)\n (Data.Proxy.Proxy @(k2 -> *) @repfg)\n eta4)\n `cast`\n (Sym (GHC.Generics.N:M1[0] _N _P _P _R) _N) } }]\n-c62325baef125313b791176da10a795e\n+ce2ab603439651e474b570291ff6da40\n $fGApplicativekkknfgRecRecRec ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GHC.Base.Monoid x =>\n GApplicative\n n\n f\n g\n@@ -918,15 +918,15 @@\n @f\n @g\n @(Data.Generics.GenericN.Rec x x)\n @(Data.Generics.GenericN.Rec x x)\n @(Data.Generics.GenericN.Rec x x)\n ($fGApplicativekkknfgRecRecRec_$cgprod @k @k1 @k2 @x @n @f @g v)\n ($fGApplicativekkknfgRecRecRec_$cgpure @k @k1 @k2 @x @n @f @g v)]\n-560fe200ad602e133d55a2f0d0d22a75\n+6b48a320c0669513940cb81ff7a978ca\n $fGApplicativekkknfgRecRecRec_$cgprod ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (x1 :: k3).\n GHC.Base.Monoid x =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -979,15 +979,15 @@\n _N\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-4c6be034d847cfdd55967b332dbbade2\n+21927970176de91f9d78d636b0af9247\n $fGApplicativekkknfgRecRecRec_$cgpure ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (x1 :: k3).\n (GHC.Base.Monoid x, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec x x\n GHC.Types.~ Data.Generics.GenericN.Rec x x) =>\n Data.Proxy.Proxy n\n@@ -1043,15 +1043,15 @@\n _N\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-757459b2567e1fedd8090649a12a6b0c\n+75e9a7bc4f2eca5aa0c6ee12ff6aa73e\n $fGApplicativekkknfgU1U1U1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GApplicative n f g GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:GApplicative], Inline: CONLIKE,\n Unfolding: DFun: @k @k1 @k2 @n :: k @f :: k1 -> * @g :: k1 -> *.\n@@ -1062,15 +1062,15 @@\n @f\n @g\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGApplicativekkknfgU1U1U1_$cgprod @k @k1 @k2 @n @f @g)\n ($fGApplicativekkknfgU1U1U1_$cgpure @k @k1 @k2 @n @f @g)]\n-a6918f5cd402eab5d40c5b3ab27a04e1\n+86fe6d5499d4b492f7180f06a114627d\n $fGApplicativekkknfgU1U1U1_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) (x :: k3).\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -1087,15 +1087,15 @@\n @x :: k2\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy g)\n (ds3['GHC.Types.Many] :: GHC.Generics.U1 x)\n (ds4['GHC.Types.Many] :: GHC.Generics.U1 x) ->\n case ds3 of wild { GHC.Generics.U1 -> ds4 }]\n-0c8b7121385101be742005f836ea6b18\n+4da1196f1ca5a920f72c028eece5daec\n $fGApplicativekkknfgU1U1U1_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) (x :: k3).\n (f GHC.Types.~ g, GHC.Generics.U1 GHC.Types.~ GHC.Generics.U1) =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> Data.Proxy.Proxy GHC.Generics.U1\n@@ -1117,64 +1117,64 @@\n GHC.Types.~ GHC.Generics.U1)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds3['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds4['GHC.Types.Many] :: forall (a :: k1). f a) ->\n GHC.Generics.U1 @k2 @x]\n-3be54707e58679d8ed495918884366c5\n+a29ee8272c78be8331bcc73cf622cd6c\n $tcGApplicative :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3749123269905399159#Word64\n- 13221859667362474613#Word64\n+ 17841484651063409862#Word64\n+ 5493416516266853058#Word64\n $trModule\n $tcGApplicative2\n 3#\n $tcGApplicative1]\n-a5642de0a34721217bf57de1c6fcb837\n+9b8dca4ebeb253853829d321d9a0b8b7\n $tcGApplicative1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c3a8cacc8c4e75bad115625618227917\n+f5ab903d7c2b6f168369794020c1cc95\n $tcGApplicative2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGApplicative3]\n-a8bd85a0350edaddaf229fb28d8046c3\n+fbe73c0375c1d38791c2c23a1994a8af\n $tcGApplicative3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GApplicative\"#]\n-c5b2cd6cc253a5dc474f41a4946c3012\n+cc8b1abcdab78955e30ca934b9c673f6\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-3297d9b4b509dc1cfb187e11f6d69344\n+ff0c1c72c2461b34c36997cf9d024a49\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d35b1ae7475091dfb0c5f17eac484bdd\n+cf36d00bb6e244031e9ae084c1f47073\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Applicative\"#]\n-a25fd8148124e801cef575e3f9a62afd\n+465048a1dbca355fdd89af870af906ea\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9dd7b83a59e4f1eab42d01151538d44e\n+3baa0a1c6d07f88d34ea19f645d1394e\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-3ced52b07609826cc929119e22540509\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+d65021a3af56c65b54997d660d8ab228\n type GApplicative :: forall {k} {k1} k2.\n k\n -> (k2 -> *)\n -> (k2 -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n@@ -1192,15 +1192,15 @@\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy repbf\n -> Data.Proxy.Proxy repbfg\n -> (forall (a :: k2). f a)\n -> repbf x\n {-# MINIMAL gprod, gpure #-}\n-4e48190e47f5ab16fa0b3efb49740e52\n+67719751e01720ae9873dbda6185b49a\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GApplicative [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec,\n Data.Generics.GenericN.Rec]\n = $fGApplicativeNaturalkknfgRecRecRec\n instance GApplicative [GHC.Num.Natural.Natural, ., ., ., ., .,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Generics.Applicative 9066\n- interface hash: 782366472ca7519297966c6b00fcad83\n- ABI hash: cd6b2d8adddf9a2d3767a33a685f152d\n- export-list hash: f40c4fca68d431a2e25a33b0ebf2670a\n+ interface hash: 5ddbb545689de42c1db740596a93742f\n+ ABI hash: c8c35967a74c18c83413193270a3b945\n+ export-list hash: 8877b8886ac9c53ac49919a9e0e9312a\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2826c8fc0b222c614fbc957914286dc4\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GApplicative{gprod gpure}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Monoid Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-26c03417b0357de5bd8956a40c4ff573\n+915f2636451ad206149b1278c1c618f6\n $fGApplicativeNaturalkknfgRecRecRec ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1).\n GHC.Base.Applicative h =>\n GApplicative\n n\n f\n@@ -93,15 +93,15 @@\n @k1\n @h\n @n\n @f\n @g\n @a\n v)]\n-fad8eb75b8c9fc73c12e54a0683f3b58\n+127373478128f8da47783e04f4107751\n $fGApplicativeNaturalkknfgRecRecRec0 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1).\n GApplicative\n n\n f\n g\n@@ -128,15 +128,15 @@\n @(Data.Generics.GenericN.Rec (P n f a) (f a))\n @(Data.Generics.GenericN.Rec (P n g a) (g a))\n @(Data.Generics.GenericN.Rec\n (P n (Data.Functor.Product.Product f g) a)\n (Data.Functor.Product.Product f g a))\n ($fGApplicativeNaturalkknfgRecRecRec0_$cgprod @k @k1 @n @f @g @a)\n ($fGApplicativeNaturalkknfgRecRecRec0_$cgpure @k @k1 @n @f @g @a)]\n-43fc303d4e9149a3595c23ad27c9a2f0\n+cece03a0976fce13ee499afbc37b1a4e\n $fGApplicativeNaturalkknfgRecRecRec0_$cgprod ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1) (x :: k2).\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (P n f a) (f a) x\n@@ -194,15 +194,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N)]\n-53705928647ee2b49b31d45ff206eb48\n+b506c85ba78d6a19177f2f2c9dee86d0\n $fGApplicativeNaturalkknfgRecRecRec0_$cgpure ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1) (x :: k2).\n (f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (P n f a) (f a)\n GHC.Types.~ Data.Generics.GenericN.Rec (P n g a) (g a)) =>\n Data.Proxy.Proxy n\n@@ -255,15 +255,15 @@\n (P n (Data.Functor.Product.Product f g) a)\n (Data.Functor.Product.Product f g a))>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N

_P) _N _N)]\n-cacb0c55e229c825b34a281c165d8c75\n+5ca004e5d73d1cde70232ff3cf8b40a2\n $fGApplicativeNaturalkknfgRecRecRec_$cgprod ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (x :: k2).\n GHC.Base.Applicative h =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -342,15 +342,15 @@\n _P) _N _N)]\n-171cdf604862297b2cd6406c08497336\n+f33016a4431e9bcd17636ceb1ef9e3b2\n $fGApplicativeNaturalkknfgRecRecRec_$cgpure ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (x :: k2).\n (GHC.Base.Applicative h, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (P n f a)) (h (f a))\n GHC.Types.~ Data.Generics.GenericN.Rec (h (P n g a)) (h (g a))) =>\n Data.Proxy.Proxy n\n@@ -424,15 +424,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-27b52d216c30f558cc925826ca01f612\n+b2b9ac217d60eef1b1745479976fccee\n $fGApplicativekkknfg:*::*::*: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg) =>\n GApplicative\n n\n@@ -495,15 +495,15 @@\n @lg\n @lfg\n @rf\n @rg\n @rfg\n v\n v1)]\n-d89273b6e175a949b775d9f70407c650\n+f4f969af2c756a0ca9e71e5596409231\n $fGApplicativekkknfg:*::*::*:_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *) (x :: k3).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg) =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n@@ -573,15 +573,15 @@\n $dGApplicative1\n @x\n pn\n pf\n pg\n l2\n r2) } }]\n-9e57089020ee6f044aa553e0c314add4\n+92bb2dc413959116f29453a98ec357c0\n $fGApplicativekkknfg:*::*::*:_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *) (x :: k3).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg,\n f GHC.Types.~ g,\n (lf GHC.Generics.:*: rf) GHC.Types.~ (lg GHC.Generics.:*: rg)) =>\n@@ -674,15 +674,15 @@\n `cast`\n ((GHC.Types.~) *>_N (SelCo:Tc(2) (Sym co)) _N)_R\n eta\n eta1\n (Data.Proxy.Proxy @(k2 -> *) @rf)\n (Data.Proxy.Proxy @(k2 -> *) @rfg)\n eta4) } }]\n-e07bdab34162fca845a58d3fd946eec2\n+7cc679d60922042a765d63728c875380\n $fGApplicativekkknfgM1M1M1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta).\n GApplicative n f g repf repg repfg =>\n GApplicative\n n\n@@ -739,15 +739,15 @@\n @g\n @repf\n @repg\n @repfg\n @i\n @c\n v)]\n-dfcedcb479ee9aeb7fb1d697b0ea102b\n+652998c119449889d87d384a1b00dafb\n $fGApplicativekkknfgM1M1M1_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta) (x :: k3).\n GApplicative n f g repf repg repfg =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n@@ -812,15 +812,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-c71ec9e9b883d9f69874fc25b1ca3c83\n+9d3267827f0b31fef9030e9c3b197e73\n $fGApplicativekkknfgM1M1M1_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta) (x :: k3).\n (GApplicative n f g repf repg repfg, f GHC.Types.~ g,\n GHC.Generics.M1 i c repf GHC.Types.~ GHC.Generics.M1 i c repg) =>\n Data.Proxy.Proxy n\n@@ -884,15 +884,15 @@\n eta\n eta1\n (Data.Proxy.Proxy @(k2 -> *) @repf)\n (Data.Proxy.Proxy @(k2 -> *) @repfg)\n eta4)\n `cast`\n (Sym (GHC.Generics.N:M1[0] _N _P _P _R) _N) } }]\n-c62325baef125313b791176da10a795e\n+ce2ab603439651e474b570291ff6da40\n $fGApplicativekkknfgRecRecRec ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GHC.Base.Monoid x =>\n GApplicative\n n\n f\n g\n@@ -918,15 +918,15 @@\n @f\n @g\n @(Data.Generics.GenericN.Rec x x)\n @(Data.Generics.GenericN.Rec x x)\n @(Data.Generics.GenericN.Rec x x)\n ($fGApplicativekkknfgRecRecRec_$cgprod @k @k1 @k2 @x @n @f @g v)\n ($fGApplicativekkknfgRecRecRec_$cgpure @k @k1 @k2 @x @n @f @g v)]\n-560fe200ad602e133d55a2f0d0d22a75\n+6b48a320c0669513940cb81ff7a978ca\n $fGApplicativekkknfgRecRecRec_$cgprod ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (x1 :: k3).\n GHC.Base.Monoid x =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -979,15 +979,15 @@\n _N\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-4c6be034d847cfdd55967b332dbbade2\n+21927970176de91f9d78d636b0af9247\n $fGApplicativekkknfgRecRecRec_$cgpure ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (x1 :: k3).\n (GHC.Base.Monoid x, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec x x\n GHC.Types.~ Data.Generics.GenericN.Rec x x) =>\n Data.Proxy.Proxy n\n@@ -1043,15 +1043,15 @@\n _N\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-757459b2567e1fedd8090649a12a6b0c\n+75e9a7bc4f2eca5aa0c6ee12ff6aa73e\n $fGApplicativekkknfgU1U1U1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GApplicative n f g GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:GApplicative], Inline: CONLIKE,\n Unfolding: DFun: @k @k1 @k2 @n :: k @f :: k1 -> * @g :: k1 -> *.\n@@ -1062,15 +1062,15 @@\n @f\n @g\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGApplicativekkknfgU1U1U1_$cgprod @k @k1 @k2 @n @f @g)\n ($fGApplicativekkknfgU1U1U1_$cgpure @k @k1 @k2 @n @f @g)]\n-a6918f5cd402eab5d40c5b3ab27a04e1\n+86fe6d5499d4b492f7180f06a114627d\n $fGApplicativekkknfgU1U1U1_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) (x :: k3).\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -1087,15 +1087,15 @@\n @x :: k2\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy g)\n (ds3['GHC.Types.Many] :: GHC.Generics.U1 x)\n (ds4['GHC.Types.Many] :: GHC.Generics.U1 x) ->\n case ds3 of wild { GHC.Generics.U1 -> ds4 }]\n-0c8b7121385101be742005f836ea6b18\n+4da1196f1ca5a920f72c028eece5daec\n $fGApplicativekkknfgU1U1U1_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) (x :: k3).\n (f GHC.Types.~ g, GHC.Generics.U1 GHC.Types.~ GHC.Generics.U1) =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> Data.Proxy.Proxy GHC.Generics.U1\n@@ -1117,64 +1117,64 @@\n GHC.Types.~ GHC.Generics.U1)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds3['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds4['GHC.Types.Many] :: forall (a :: k1). f a) ->\n GHC.Generics.U1 @k2 @x]\n-3be54707e58679d8ed495918884366c5\n+a29ee8272c78be8331bcc73cf622cd6c\n $tcGApplicative :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3749123269905399159#Word64\n- 13221859667362474613#Word64\n+ 17841484651063409862#Word64\n+ 5493416516266853058#Word64\n $trModule\n $tcGApplicative2\n 3#\n $tcGApplicative1]\n-a5642de0a34721217bf57de1c6fcb837\n+9b8dca4ebeb253853829d321d9a0b8b7\n $tcGApplicative1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c3a8cacc8c4e75bad115625618227917\n+f5ab903d7c2b6f168369794020c1cc95\n $tcGApplicative2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGApplicative3]\n-a8bd85a0350edaddaf229fb28d8046c3\n+fbe73c0375c1d38791c2c23a1994a8af\n $tcGApplicative3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GApplicative\"#]\n-c5b2cd6cc253a5dc474f41a4946c3012\n+cc8b1abcdab78955e30ca934b9c673f6\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-3297d9b4b509dc1cfb187e11f6d69344\n+ff0c1c72c2461b34c36997cf9d024a49\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d35b1ae7475091dfb0c5f17eac484bdd\n+cf36d00bb6e244031e9ae084c1f47073\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Applicative\"#]\n-a25fd8148124e801cef575e3f9a62afd\n+465048a1dbca355fdd89af870af906ea\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9dd7b83a59e4f1eab42d01151538d44e\n+3baa0a1c6d07f88d34ea19f645d1394e\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-3ced52b07609826cc929119e22540509\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+d65021a3af56c65b54997d660d8ab228\n type GApplicative :: forall {k} {k1} k2.\n k\n -> (k2 -> *)\n -> (k2 -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n@@ -1192,15 +1192,15 @@\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy repbf\n -> Data.Proxy.Proxy repbfg\n -> (forall (a :: k2). f a)\n -> repbf x\n {-# MINIMAL gprod, gpure #-}\n-4e48190e47f5ab16fa0b3efb49740e52\n+67719751e01720ae9873dbda6185b49a\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GApplicative [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec,\n Data.Generics.GenericN.Rec]\n = $fGApplicativeNaturalkknfgRecRecRec\n instance GApplicative [GHC.Num.Natural.Natural, ., ., ., ., .,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Generics.Bare 9066\n- interface hash: 261617f79bb5638d131c2f2a23f8bf49\n- ABI hash: eea274642dff5789bea4aa894d8bc07f\n- export-list hash: 5efe914a4cb0ec7fc6958e082b874fad\n+ interface hash: e8c6e059f82fed421202ad318ed61aba\n+ ABI hash: a5b23d7863b024acf164c15bb8693348\n+ export-list hash: f2d1301649e8e0815e7e8a010693dc83\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 085b3a61e9b81acb219ec58be19ba44b\n+ flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 81f51177b7218c3ed83f386b2bb103de\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GBare{gcover gstrip}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d465c8879e90265de2f6f449eae85d8f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec 3b97022e5dc7c591885717d5396519bd\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-767c4698ffb49db88e5661197fdc7e90\n+6a6d6838a5e5bdee7f4966f974490df5\n $fGBarekn:*::*: ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *).\n (GBare n l l', GBare n r r') =>\n GBare n (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -62,15 +62,15 @@\n (v1['GHC.Types.Many] :: GBare n r r').\n @k\n @n\n @(l GHC.Generics.:*: r)\n @(l' GHC.Generics.:*: r')\n ($fGBarekn:*::*:_$cgstrip @k @n @l @l' @r @r' v v1)\n ($fGBarekn:*::*:_$cgcover @k @n @l @l' @r @r' v v1)]\n-9ef51c6b5ae5ac8b6a6919de23dc2973\n+e76eec36c662eeff6867bf3bbfb57112\n $fGBarekn:*::*:_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:*:) l' r' x -> (GHC.Generics.:*:) l r x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -93,15 +93,15 @@\n GHC.Generics.:*:\n @k\n @l\n @r\n @x\n (gcover @k @n @l @l' $dGBare @x pn l1)\n (gcover @k @n @r @r' $dGBare1 @x pn r1) }]\n-56d0b98bab07c9377afce2cb32cde68b\n+3226ebf0e0de5314420cd531c48d686b\n $fGBarekn:*::*:_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:*:) l r x -> (GHC.Generics.:*:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -124,15 +124,15 @@\n GHC.Generics.:*:\n @k\n @l'\n @r'\n @x\n (gstrip @k @n @l @l' $dGBare @x pn l1)\n (gstrip @k @n @r @r' $dGBare1 @x pn r1) }]\n-a9df61d41aa3cf62587363c49334bbd8\n+3d2d7a6de501c9b84d3b2ca391b18835\n $fGBarekn:+::+: ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *).\n (GBare n l l', GBare n r r') =>\n GBare n (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -149,15 +149,15 @@\n (v1['GHC.Types.Many] :: GBare n r r').\n @k\n @n\n @(l GHC.Generics.:+: r)\n @(l' GHC.Generics.:+: r')\n ($fGBarekn:+::+:_$cgstrip @k @n @l @l' @r @r' v v1)\n ($fGBarekn:+::+:_$cgcover @k @n @l @l' @r @r' v v1)]\n-6c720288c16946975ba6729a9b12e0cf\n+36fa28fa802da7d64d4443974ba64d2b\n $fGBarekn:+::+:_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:+:) l' r' x -> (GHC.Generics.:+:) l r x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -187,15 +187,15 @@\n GHC.Generics.R1 r1\n -> GHC.Generics.R1\n @k\n @l\n @r\n @x\n (gcover @k @n @r @r' $dGBare1 @x pn r1) }]\n-7ce9e41dbc85082a8f72eac95d306566\n+8520c448ba72aef86a17db8da6a1c4ff\n $fGBarekn:+::+:_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:+:) l r x -> (GHC.Generics.:+:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -225,15 +225,15 @@\n GHC.Generics.R1 r1\n -> GHC.Generics.R1\n @k\n @l'\n @r'\n @x\n (gstrip @k @n @r @r' $dGBare1 @x pn r1) }]\n-cdd9af79c2fee8298e7f937b1f28eba2\n+5ff7096f7ca2965e2980ec089d8dadfd\n $fGBareknM1M1 ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta).\n GBare n repbi repbb =>\n GBare n (GHC.Generics.M1 i k2 repbi) (GHC.Generics.M1 i k2 repbb)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -248,15 +248,15 @@\n (v['GHC.Types.Many] :: GBare n repbi repbb).\n @k\n @n\n @(GHC.Generics.M1 i k1 repbi)\n @(GHC.Generics.M1 i k1 repbb)\n ($fGBareknM1M1_$cgstrip @k @n @repbi @repbb @i @k1 v)\n ($fGBareknM1M1_$cgcover @k @n @repbi @repbb @i @k1 v)]\n-ca34394bf107175e6e6efd2eeae82995\n+37439014cff5fc8d14ea23c73f69883c\n $fGBareknM1M1_$cgcover ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta) (x :: k1).\n GBare n repbi repbb =>\n Data.Proxy.Proxy n\n -> GHC.Generics.M1 i k2 repbb x -> GHC.Generics.M1 i k2 repbi x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -279,15 +279,15 @@\n f x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-5826bc7d04550f34b020edf7d3d877ab\n+7bbf749e25a027e7d5b59b7876326177\n $fGBareknM1M1_$cgstrip ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta) (x :: k1).\n GBare n repbi repbb =>\n Data.Proxy.Proxy n\n -> GHC.Generics.M1 i k2 repbi x -> GHC.Generics.M1 i k2 repbb x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -310,15 +310,15 @@\n f x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-b5aee001e5ae9729f5e61deedfd3331c\n+53acb7c92f8cce80fac55ec97dc78dd2\n $fGBareknRecRec ::\n (repbi GHC.Types.~ repbb) =>\n GBare\n n\n (Data.Generics.GenericN.Rec repbi repbi)\n (Data.Generics.GenericN.Rec repbb repbb)\n DFunId\n@@ -331,15 +331,15 @@\n (v['GHC.Types.Many] :: repbi GHC.Types.~ repbb).\n @k\n @n\n @(Data.Generics.GenericN.Rec repbi repbi)\n @(Data.Generics.GenericN.Rec repbb repbb)\n ($fGBareknRecRec_$cgstrip @k @repbi @repbb @n v)\n ($fGBareknRecRec_$cgcover @k @repbi @repbb @n v)]\n-75e94187dcdc27202584859e46e971dc\n+e9d9cf8389f7aa0319ed94baae504c92\n $fGBareknRecRec0 ::\n GHC.Types.Coercible a b =>\n GBare\n n\n (Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a))\n@@ -356,15 +356,15 @@\n @n\n @(Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a))\n @(Data.Generics.GenericN.Rec b b)\n ($fGBareknRecRec0_$cgstrip @k @a @b @n v)\n ($fGBareknRecRec0_$cgcover @k @a @b @n v)]\n-8fd11501f6f468959f0bc8b108f6274b\n+430247e6f8f1d1bc5e6cf86e5b1778fd\n $fGBareknRecRec0_$cgcover ::\n forall k a b (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Types.Coercible a b =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec b b x\n -> Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n@@ -398,15 +398,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N) }]\n-0fe47b3ba2a6eeab86787939ef965656\n+1f41c57bcbea4d0d359312879794fb29\n $fGBareknRecRec0_$cgstrip ::\n forall k a b (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Types.Coercible a b =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a)\n@@ -441,15 +441,15 @@\n ; GHC.Generics.N:K1[0]\n _N _P _R _P\n ; Data.Functor.Identity.N:Identity[0]\n (co\n ; Sym (GHC.Generics.N:K1[0] _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N _P) _N _N)) }]\n-1571cfb9ec981e8cfb28a0e42b308811\n+c0a6e7e5c62456ceb43ce173ebeb6d45\n $fGBareknRecRec_$cgcover ::\n forall k repbi repbb (n :: GHC.TypeNats.Nat) (x :: k).\n (repbi GHC.Types.~ repbb) =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec repbb repbb x\n -> Data.Generics.GenericN.Rec repbi repbi x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -468,15 +468,15 @@\n eta1\n `cast`\n (Data.Generics.GenericN.Rec\n _N\n Univ(phantom phantom <*>_N :: repbb, repbi)\n (Sub (Sym co))\n _P)_R }]\n-150cc4f14c4b6ba3b8bcab89c621def9\n+b206aee150854baae5d085723ec5ad15\n $fGBareknRecRec_$cgstrip ::\n forall k repbi repbb (n :: GHC.TypeNats.Nat) (x :: k).\n (repbi GHC.Types.~ repbb) =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec repbi repbi x\n -> Data.Generics.GenericN.Rec repbb repbb x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -495,113 +495,113 @@\n eta1\n `cast`\n (Data.Generics.GenericN.Rec\n _N\n Univ(phantom phantom <*>_N :: repbi, repbb)\n (Sub co)\n _P)_R }]\n-9d30c88845f5fe116b55e1d1b0b48a2d\n+42852eece65cd996c459a27d8bbbd935\n $fGBareknU1U1 :: GBare n GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFCon[C:GBare],\n Inline: CONLIKE,\n Unfolding: DFun: @k @n :: GHC.TypeNats.Nat.\n @k\n @n\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGBareknU1U1_$cgstrip @k @n)\n ($fGBareknU1U1_$cgcover @k @n)]\n-48936db69c456ff30928e3a80efdbcab\n+19b523e164eae7fc531085ea47133b31\n $fGBareknU1U1_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.U1 x -> GHC.Generics.U1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @n :: GHC.TypeNats.Nat\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-0d0a661f78047852e3bcfaf9186d94d8\n+9e253bb31d326c3a2c4d0258b741fe15\n $fGBareknU1U1_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.U1 x -> GHC.Generics.U1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @n :: GHC.TypeNats.Nat\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-e0828779ab77036d34c20c853e007171\n+5688d6c24b352b491b47a3639dce167a\n $fGBareknV1V1 :: GBare n GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:GBare],\n Inline: CONLIKE,\n Unfolding: DFun: @k @n :: GHC.TypeNats.Nat.\n @k\n @n\n @GHC.Generics.V1\n @GHC.Generics.V1\n ($fGBareknV1V1_$cgstrip @k @n)\n ($fGBareknV1V1_$cgcover @k @n)]\n-d73f0d6008feffaf2411bc4eb88ce28e\n+2ce3813243476b16f4be28d983c41441\n $fGBareknV1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Bare\"#]\n-c5f8b49e89765048d7599c34f1dbdbd0\n+85288d70d793dd531760f6ad12c4fe70\n $fGBareknV1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V12]\n-b0f3a861f18edafd4797ce1e5e16c25d\n+03faafca5c8f1d4b6701e93447d62214\n $fGBareknV1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-004bebf75841adb85aa45358f40fc1c6\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+3b539a223f4ae0b9f9ffea4bd4df961a\n $fGBareknV1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V14]\n-3821d0ff9b85b39aee07463b2974c835\n+57973f0e9591213408f82e02c32fb446\n $fGBareknV1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-13708e6f649fad2ffed69b9d9a8ea1cc\n+37a8ff6f46e5d08fafc4f0b5b7320686\n $fGBareknV1V15 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGBareknV1V13\n $fGBareknV1V16\n GHC.Stack.Types.EmptyCallStack]\n-93ad89c5b99971ede7ff838240357fc8\n+818d45cdbe61e27a94734a193349e6a8\n $fGBareknV1V16 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGBareknV1V11\n $fGBareknV1V9\n $fGBareknV1V7\n $fGBareknV1V17\n $fGBareknV1V5\n $fGBareknV1V17\n $fGBareknV1V4]\n-77af63b51c3f88f013e2c49c4f085bd0\n+bea0b89d984158ba5bd5753b9f6dfe28\n $fGBareknV1V17 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 34#]\n-1f0b580a3612792232783d355c78773f\n+d7d0275ae4e3567d5210860fa8706b24\n $fGBareknV1V1_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -612,15 +612,15 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGBareknV1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-02e0ddcc222978bd6355c3db4ffae3a2\n+44d9db0c8649261540da10f2ef246c39\n $fGBareknV1V1_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -631,113 +631,113 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGBareknV1V15\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-c792f79bd3cb5f464216b5b869a6bd48\n+603acab1aa36124cfa521ea79ac8b11d\n $fGBareknV1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGBareknV1V13\n $fGBareknV1V3\n GHC.Stack.Types.EmptyCallStack]\n-193a5ad062dcb3f1bb3fc4954d0c078d\n+801b2140f83dd2096be75d34019bb15a\n $fGBareknV1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGBareknV1V11\n $fGBareknV1V9\n $fGBareknV1V7\n $fGBareknV1V6\n $fGBareknV1V5\n $fGBareknV1V6\n $fGBareknV1V4]\n-f2cdcbc59c3c2a8b69f76fc7d71a96c2\n+4d0602d3294ee212eb07f641cd0e8597\n $fGBareknV1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 25#]\n-61d30a4e5258829985b4d4319196144f\n+be55eb3d78575e50b7bf0e50f6cb06a5\n $fGBareknV1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 16#]\n-d44b6a6227b35fbb2f70b7f23dbb0799\n+7a5832211fc21f3601bd699a14e2fc8f\n $fGBareknV1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 35#]\n-4ef7d8baba01007b7597fccd09cee14b\n+c2ad6a8dc101f4c5ad2ccf3767941af7\n $fGBareknV1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V8]\n-5266bfc3e7d9429748bc9556787efdb0\n+88451be1a9382780279214c064cbe748\n $fGBareknV1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Bare.hs\"#]\n-2c7c83a7bb4eebe5659286873c24d3a7\n+119e90b4421ab7cdd17e4e33f912d633\n $fGBareknV1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V10]\n-0dabd667233d6e9d53cfd571fcd78e34\n+1ddb65a4543a4d0b34e6b34acc6dfb70\n $tcGBare :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 5373179404672895006#Word64\n- 11927831921503033801#Word64\n+ 14720346315237248769#Word64\n+ 6710622583730516072#Word64\n $trModule\n $tcGBare2\n 1#\n $tcGBare1]\n-e124d0efc44f09c8d6666a976420e624\n+7d70da88b92d5247500fe8a1bb7bf80a\n $tcGBare1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c89c0bd942d613b5a4939fd409f44381\n+034836eec54a0bc9d964b1e712d2f56b\n $tcGBare2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGBare3]\n-b0c9b04eda340a2dd3e68e653c1c4bf4\n+0dbbe641e215b3145ce535211f3cebfd\n $tcGBare3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GBare\"#]\n-319848c17b2c9dbdb109914758f6ed03\n+8e766c4c257843c2e017998c0b53adb4\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-9e326d6d27086ec5d0f802496aea90fa\n+91eb4b43b4928dbc300d94123629bab2\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGBareknV1V10]\n-2bbeafa05f52f10322662b6243f72c81\n+506bb521c889e7b2b34fd392f669e80c\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGBareknV1V12]\n-1fa6fd25559727210b03f78d5a832c96\n+f7a5f5d4610bc604f4543e1673e035fc\n type GBare :: forall {k}.\n GHC.TypeNats.Nat -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n class GBare n repbi repbb where\n gstrip :: forall (x :: k). Data.Proxy.Proxy n -> repbi x -> repbb x\n gcover :: forall (x :: k). Data.Proxy.Proxy n -> repbb x -> repbi x\n {-# MINIMAL gstrip, gcover #-}\n-36d3f3a9a7407b8a6ffa19f4cb303529\n+0a07eff0d2b443ef8be7bc56d3b032e7\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GBare [., ., GHC.Generics.:*:, GHC.Generics.:*:]\n = $fGBarekn:*::*:\n instance GBare [., ., GHC.Generics.:+:, GHC.Generics.:+:]\n = $fGBarekn:+::+:\n instance GBare [., ., GHC.Generics.M1, GHC.Generics.M1]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.dyn_hi", "comments": ["Files 97% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Generics.Bare 9066\n- interface hash: 261617f79bb5638d131c2f2a23f8bf49\n- ABI hash: eea274642dff5789bea4aa894d8bc07f\n- export-list hash: 5efe914a4cb0ec7fc6958e082b874fad\n+ interface hash: e8c6e059f82fed421202ad318ed61aba\n+ ABI hash: a5b23d7863b024acf164c15bb8693348\n+ export-list hash: f2d1301649e8e0815e7e8a010693dc83\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n+ flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 81f51177b7218c3ed83f386b2bb103de\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GBare{gcover gstrip}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d465c8879e90265de2f6f449eae85d8f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec 3b97022e5dc7c591885717d5396519bd\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-767c4698ffb49db88e5661197fdc7e90\n+6a6d6838a5e5bdee7f4966f974490df5\n $fGBarekn:*::*: ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *).\n (GBare n l l', GBare n r r') =>\n GBare n (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -62,15 +62,15 @@\n (v1['GHC.Types.Many] :: GBare n r r').\n @k\n @n\n @(l GHC.Generics.:*: r)\n @(l' GHC.Generics.:*: r')\n ($fGBarekn:*::*:_$cgstrip @k @n @l @l' @r @r' v v1)\n ($fGBarekn:*::*:_$cgcover @k @n @l @l' @r @r' v v1)]\n-9ef51c6b5ae5ac8b6a6919de23dc2973\n+e76eec36c662eeff6867bf3bbfb57112\n $fGBarekn:*::*:_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:*:) l' r' x -> (GHC.Generics.:*:) l r x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -93,15 +93,15 @@\n GHC.Generics.:*:\n @k\n @l\n @r\n @x\n (gcover @k @n @l @l' $dGBare @x pn l1)\n (gcover @k @n @r @r' $dGBare1 @x pn r1) }]\n-56d0b98bab07c9377afce2cb32cde68b\n+3226ebf0e0de5314420cd531c48d686b\n $fGBarekn:*::*:_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:*:) l r x -> (GHC.Generics.:*:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -124,15 +124,15 @@\n GHC.Generics.:*:\n @k\n @l'\n @r'\n @x\n (gstrip @k @n @l @l' $dGBare @x pn l1)\n (gstrip @k @n @r @r' $dGBare1 @x pn r1) }]\n-a9df61d41aa3cf62587363c49334bbd8\n+3d2d7a6de501c9b84d3b2ca391b18835\n $fGBarekn:+::+: ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *).\n (GBare n l l', GBare n r r') =>\n GBare n (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -149,15 +149,15 @@\n (v1['GHC.Types.Many] :: GBare n r r').\n @k\n @n\n @(l GHC.Generics.:+: r)\n @(l' GHC.Generics.:+: r')\n ($fGBarekn:+::+:_$cgstrip @k @n @l @l' @r @r' v v1)\n ($fGBarekn:+::+:_$cgcover @k @n @l @l' @r @r' v v1)]\n-6c720288c16946975ba6729a9b12e0cf\n+36fa28fa802da7d64d4443974ba64d2b\n $fGBarekn:+::+:_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:+:) l' r' x -> (GHC.Generics.:+:) l r x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -187,15 +187,15 @@\n GHC.Generics.R1 r1\n -> GHC.Generics.R1\n @k\n @l\n @r\n @x\n (gcover @k @n @r @r' $dGBare1 @x pn r1) }]\n-7ce9e41dbc85082a8f72eac95d306566\n+8520c448ba72aef86a17db8da6a1c4ff\n $fGBarekn:+::+:_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:+:) l r x -> (GHC.Generics.:+:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -225,15 +225,15 @@\n GHC.Generics.R1 r1\n -> GHC.Generics.R1\n @k\n @l'\n @r'\n @x\n (gstrip @k @n @r @r' $dGBare1 @x pn r1) }]\n-cdd9af79c2fee8298e7f937b1f28eba2\n+5ff7096f7ca2965e2980ec089d8dadfd\n $fGBareknM1M1 ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta).\n GBare n repbi repbb =>\n GBare n (GHC.Generics.M1 i k2 repbi) (GHC.Generics.M1 i k2 repbb)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -248,15 +248,15 @@\n (v['GHC.Types.Many] :: GBare n repbi repbb).\n @k\n @n\n @(GHC.Generics.M1 i k1 repbi)\n @(GHC.Generics.M1 i k1 repbb)\n ($fGBareknM1M1_$cgstrip @k @n @repbi @repbb @i @k1 v)\n ($fGBareknM1M1_$cgcover @k @n @repbi @repbb @i @k1 v)]\n-ca34394bf107175e6e6efd2eeae82995\n+37439014cff5fc8d14ea23c73f69883c\n $fGBareknM1M1_$cgcover ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta) (x :: k1).\n GBare n repbi repbb =>\n Data.Proxy.Proxy n\n -> GHC.Generics.M1 i k2 repbb x -> GHC.Generics.M1 i k2 repbi x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -279,15 +279,15 @@\n f x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-5826bc7d04550f34b020edf7d3d877ab\n+7bbf749e25a027e7d5b59b7876326177\n $fGBareknM1M1_$cgstrip ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta) (x :: k1).\n GBare n repbi repbb =>\n Data.Proxy.Proxy n\n -> GHC.Generics.M1 i k2 repbi x -> GHC.Generics.M1 i k2 repbb x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -310,15 +310,15 @@\n f x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-b5aee001e5ae9729f5e61deedfd3331c\n+53acb7c92f8cce80fac55ec97dc78dd2\n $fGBareknRecRec ::\n (repbi GHC.Types.~ repbb) =>\n GBare\n n\n (Data.Generics.GenericN.Rec repbi repbi)\n (Data.Generics.GenericN.Rec repbb repbb)\n DFunId\n@@ -331,15 +331,15 @@\n (v['GHC.Types.Many] :: repbi GHC.Types.~ repbb).\n @k\n @n\n @(Data.Generics.GenericN.Rec repbi repbi)\n @(Data.Generics.GenericN.Rec repbb repbb)\n ($fGBareknRecRec_$cgstrip @k @repbi @repbb @n v)\n ($fGBareknRecRec_$cgcover @k @repbi @repbb @n v)]\n-75e94187dcdc27202584859e46e971dc\n+e9d9cf8389f7aa0319ed94baae504c92\n $fGBareknRecRec0 ::\n GHC.Types.Coercible a b =>\n GBare\n n\n (Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a))\n@@ -356,15 +356,15 @@\n @n\n @(Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a))\n @(Data.Generics.GenericN.Rec b b)\n ($fGBareknRecRec0_$cgstrip @k @a @b @n v)\n ($fGBareknRecRec0_$cgcover @k @a @b @n v)]\n-8fd11501f6f468959f0bc8b108f6274b\n+430247e6f8f1d1bc5e6cf86e5b1778fd\n $fGBareknRecRec0_$cgcover ::\n forall k a b (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Types.Coercible a b =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec b b x\n -> Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n@@ -398,15 +398,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N) }]\n-0fe47b3ba2a6eeab86787939ef965656\n+1f41c57bcbea4d0d359312879794fb29\n $fGBareknRecRec0_$cgstrip ::\n forall k a b (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Types.Coercible a b =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a)\n@@ -441,15 +441,15 @@\n ; GHC.Generics.N:K1[0]\n _N _P _R _P\n ; Data.Functor.Identity.N:Identity[0]\n (co\n ; Sym (GHC.Generics.N:K1[0] _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N _P) _N _N)) }]\n-1571cfb9ec981e8cfb28a0e42b308811\n+c0a6e7e5c62456ceb43ce173ebeb6d45\n $fGBareknRecRec_$cgcover ::\n forall k repbi repbb (n :: GHC.TypeNats.Nat) (x :: k).\n (repbi GHC.Types.~ repbb) =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec repbb repbb x\n -> Data.Generics.GenericN.Rec repbi repbi x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -468,15 +468,15 @@\n eta1\n `cast`\n (Data.Generics.GenericN.Rec\n _N\n Univ(phantom phantom <*>_N :: repbb, repbi)\n (Sub (Sym co))\n _P)_R }]\n-150cc4f14c4b6ba3b8bcab89c621def9\n+b206aee150854baae5d085723ec5ad15\n $fGBareknRecRec_$cgstrip ::\n forall k repbi repbb (n :: GHC.TypeNats.Nat) (x :: k).\n (repbi GHC.Types.~ repbb) =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec repbi repbi x\n -> Data.Generics.GenericN.Rec repbb repbb x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -495,113 +495,113 @@\n eta1\n `cast`\n (Data.Generics.GenericN.Rec\n _N\n Univ(phantom phantom <*>_N :: repbi, repbb)\n (Sub co)\n _P)_R }]\n-9d30c88845f5fe116b55e1d1b0b48a2d\n+42852eece65cd996c459a27d8bbbd935\n $fGBareknU1U1 :: GBare n GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFCon[C:GBare],\n Inline: CONLIKE,\n Unfolding: DFun: @k @n :: GHC.TypeNats.Nat.\n @k\n @n\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGBareknU1U1_$cgstrip @k @n)\n ($fGBareknU1U1_$cgcover @k @n)]\n-48936db69c456ff30928e3a80efdbcab\n+19b523e164eae7fc531085ea47133b31\n $fGBareknU1U1_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.U1 x -> GHC.Generics.U1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @n :: GHC.TypeNats.Nat\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-0d0a661f78047852e3bcfaf9186d94d8\n+9e253bb31d326c3a2c4d0258b741fe15\n $fGBareknU1U1_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.U1 x -> GHC.Generics.U1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @n :: GHC.TypeNats.Nat\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-e0828779ab77036d34c20c853e007171\n+5688d6c24b352b491b47a3639dce167a\n $fGBareknV1V1 :: GBare n GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:GBare],\n Inline: CONLIKE,\n Unfolding: DFun: @k @n :: GHC.TypeNats.Nat.\n @k\n @n\n @GHC.Generics.V1\n @GHC.Generics.V1\n ($fGBareknV1V1_$cgstrip @k @n)\n ($fGBareknV1V1_$cgcover @k @n)]\n-d73f0d6008feffaf2411bc4eb88ce28e\n+2ce3813243476b16f4be28d983c41441\n $fGBareknV1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Bare\"#]\n-c5f8b49e89765048d7599c34f1dbdbd0\n+85288d70d793dd531760f6ad12c4fe70\n $fGBareknV1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V12]\n-b0f3a861f18edafd4797ce1e5e16c25d\n+03faafca5c8f1d4b6701e93447d62214\n $fGBareknV1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-004bebf75841adb85aa45358f40fc1c6\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+3b539a223f4ae0b9f9ffea4bd4df961a\n $fGBareknV1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V14]\n-3821d0ff9b85b39aee07463b2974c835\n+57973f0e9591213408f82e02c32fb446\n $fGBareknV1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-13708e6f649fad2ffed69b9d9a8ea1cc\n+37a8ff6f46e5d08fafc4f0b5b7320686\n $fGBareknV1V15 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGBareknV1V13\n $fGBareknV1V16\n GHC.Stack.Types.EmptyCallStack]\n-93ad89c5b99971ede7ff838240357fc8\n+818d45cdbe61e27a94734a193349e6a8\n $fGBareknV1V16 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGBareknV1V11\n $fGBareknV1V9\n $fGBareknV1V7\n $fGBareknV1V17\n $fGBareknV1V5\n $fGBareknV1V17\n $fGBareknV1V4]\n-77af63b51c3f88f013e2c49c4f085bd0\n+bea0b89d984158ba5bd5753b9f6dfe28\n $fGBareknV1V17 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 34#]\n-1f0b580a3612792232783d355c78773f\n+d7d0275ae4e3567d5210860fa8706b24\n $fGBareknV1V1_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -612,15 +612,15 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGBareknV1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-02e0ddcc222978bd6355c3db4ffae3a2\n+44d9db0c8649261540da10f2ef246c39\n $fGBareknV1V1_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -631,113 +631,113 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGBareknV1V15\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-c792f79bd3cb5f464216b5b869a6bd48\n+603acab1aa36124cfa521ea79ac8b11d\n $fGBareknV1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGBareknV1V13\n $fGBareknV1V3\n GHC.Stack.Types.EmptyCallStack]\n-193a5ad062dcb3f1bb3fc4954d0c078d\n+801b2140f83dd2096be75d34019bb15a\n $fGBareknV1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGBareknV1V11\n $fGBareknV1V9\n $fGBareknV1V7\n $fGBareknV1V6\n $fGBareknV1V5\n $fGBareknV1V6\n $fGBareknV1V4]\n-f2cdcbc59c3c2a8b69f76fc7d71a96c2\n+4d0602d3294ee212eb07f641cd0e8597\n $fGBareknV1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 25#]\n-61d30a4e5258829985b4d4319196144f\n+be55eb3d78575e50b7bf0e50f6cb06a5\n $fGBareknV1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 16#]\n-d44b6a6227b35fbb2f70b7f23dbb0799\n+7a5832211fc21f3601bd699a14e2fc8f\n $fGBareknV1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 35#]\n-4ef7d8baba01007b7597fccd09cee14b\n+c2ad6a8dc101f4c5ad2ccf3767941af7\n $fGBareknV1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V8]\n-5266bfc3e7d9429748bc9556787efdb0\n+88451be1a9382780279214c064cbe748\n $fGBareknV1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Bare.hs\"#]\n-2c7c83a7bb4eebe5659286873c24d3a7\n+119e90b4421ab7cdd17e4e33f912d633\n $fGBareknV1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V10]\n-0dabd667233d6e9d53cfd571fcd78e34\n+1ddb65a4543a4d0b34e6b34acc6dfb70\n $tcGBare :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 5373179404672895006#Word64\n- 11927831921503033801#Word64\n+ 14720346315237248769#Word64\n+ 6710622583730516072#Word64\n $trModule\n $tcGBare2\n 1#\n $tcGBare1]\n-e124d0efc44f09c8d6666a976420e624\n+7d70da88b92d5247500fe8a1bb7bf80a\n $tcGBare1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c89c0bd942d613b5a4939fd409f44381\n+034836eec54a0bc9d964b1e712d2f56b\n $tcGBare2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGBare3]\n-b0c9b04eda340a2dd3e68e653c1c4bf4\n+0dbbe641e215b3145ce535211f3cebfd\n $tcGBare3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GBare\"#]\n-319848c17b2c9dbdb109914758f6ed03\n+8e766c4c257843c2e017998c0b53adb4\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-9e326d6d27086ec5d0f802496aea90fa\n+91eb4b43b4928dbc300d94123629bab2\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGBareknV1V10]\n-2bbeafa05f52f10322662b6243f72c81\n+506bb521c889e7b2b34fd392f669e80c\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGBareknV1V12]\n-1fa6fd25559727210b03f78d5a832c96\n+f7a5f5d4610bc604f4543e1673e035fc\n type GBare :: forall {k}.\n GHC.TypeNats.Nat -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n class GBare n repbi repbb where\n gstrip :: forall (x :: k). Data.Proxy.Proxy n -> repbi x -> repbb x\n gcover :: forall (x :: k). Data.Proxy.Proxy n -> repbb x -> repbi x\n {-# MINIMAL gstrip, gcover #-}\n-36d3f3a9a7407b8a6ffa19f4cb303529\n+0a07eff0d2b443ef8be7bc56d3b032e7\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GBare [., ., GHC.Generics.:*:, GHC.Generics.:*:]\n = $fGBarekn:*::*:\n instance GBare [., ., GHC.Generics.:+:, GHC.Generics.:+:]\n = $fGBarekn:+::+:\n instance GBare [., ., GHC.Generics.M1, GHC.Generics.M1]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.hi", "comments": ["Files 92% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Generics.Constraints [family instance module] 9066\n- interface hash: 77c0f6bedde7374a1fa02f8d62f51e03\n- ABI hash: dbe4a74ad57c80c8783d07b1647baa9b\n- export-list hash: f5759178cdbb617493eee5630131ae28\n+ interface hash: 259a4fad57a929a9aebe97b44af6a872\n+ ABI hash: 0aa87421cc66b72ee5cd089f3a525bd7\n+ export-list hash: cc7aef2f5c488676d297ae83c45ee82c\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: d8099ad38ca87ea2dda40463696d014a\n+ flag hash: 2c4fa156826c15b4cbd15eef0f8f632d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 65f7f84670d16c10ad18f2d54576dbfb\n sig of: Nothing\n used TH splices: False\n where\n@@ -21,44 +21,44 @@\n GAll\n GConstraints{gaddDicts}\n Other\n Self\n SelfOrOther\n X\n Y\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Monoid Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-5001faeed8480a2270d4e0a93669928d\n+814e0ea74b78a21944b84e87818e1ca0\n $fGConstraintskFUNkncfRecRecRec ::\n forall k1 k2 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *) (a' :: k1)\n (a :: k1).\n GConstraints\n n\n c\n@@ -138,15 +138,15 @@\n _N\n _N))]\n-00411074896617543b06368818b91d58\n+2f4f7592af8285ddf886e59d026a7b0e\n $fGConstraintskkkncf:*::*::*: ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf) =>\n GConstraints\n@@ -180,15 +180,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-a8e13bd9bbdbfdfe79fdf793b49b4b56\n+8f9aa7e1f9e5cfe8a18ecbf91350e079\n $fGConstraintskkkncf:*::*::*:_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *) (x :: k3).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf,\n GAll n c (lx GHC.Generics.:*: rx)) =>\n@@ -241,15 +241,15 @@\n (GHC.Classes.$p1(%,%)\n @(GAll n c lx)\n @(GAll n c rx)\n irred\n `cast`\n (Sub (D:R:GAllknc:*:[0] _N _N _N _N _N)))\n r) }]\n-89452a8f4ede00a45a03d66b50e4fa9e\n+a75098ed0e7c88f4bd7bfd34f371c7bc\n $fGConstraintskkkncf:+::+::+: ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf) =>\n GConstraints\n@@ -282,15 +282,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-3b2e3d7bc71cdb5ebdfdc16b31d9e35b\n+1c4955b789f1cbd399f7099ad8f87c43\n $fGConstraintskkkncf:+::+::+:_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *) (x :: k3).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf,\n GAll n c (lx GHC.Generics.:+: rx)) =>\n@@ -349,15 +349,15 @@\n (GHC.Classes.$p1(%,%)\n @(GAll n c lx)\n @(GAll n c rx)\n irred\n `cast`\n (Sub (D:R:GAllknc:+:[0] _N _N _N _N _N)))\n r) }]\n-a5cecbee5527ee9d9fd6f9276d150164\n+57a3dd660bb73ae66d1542a5db285351\n $fGConstraintskkkncfM1M1M1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (repbx :: * -> *)\n (repbf :: k3 -> *) (repbdf :: k3 -> *) i (k4 :: GHC.Generics.Meta).\n GConstraints n c f repbx repbf repbdf =>\n GConstraints\n n\n@@ -384,15 +384,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-376862bc7175d33b522a7ce1cc541623\n+77b66ee240cb94b76af46e28e7c3c65a\n $fGConstraintskkkncfM1M1M1_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (repbx :: * -> *)\n (repbf :: k3 -> *) (repbdf :: k3 -> *) i (k4 :: GHC.Generics.Meta)\n (x :: k3).\n (GConstraints n c f repbx repbf repbdf,\n GAll n c (GHC.Generics.M1 i k4 repbx)) =>\n@@ -440,15 +440,15 @@\n x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-fb2b1a83ff845380e4002132f29acee0\n+82e30a6deec32671cfcf28b6f08a7fc3\n $fGConstraintskkkncfRecRecRec ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) a' a b' b.\n GConstraints\n n\n c\n f\n@@ -482,15 +482,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b9127ffaa866b8e62e6b575ab17ba4f3\n+b81b3aaa15b0223e40a6ce3d46796983\n $fGConstraintskkkncfU1U1U1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2).\n GConstraints n c f GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n@@ -513,15 +513,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-f2d5d9b856185493db02b11fcfe8e927\n+5cee10be88480bb74cdaad1fcd23f2ad\n $fGConstraintskkkncfV1V1V1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2).\n GConstraints n c f GHC.Generics.V1 GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n@@ -536,38 +536,38 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-09dd9269c81003f55b883d62fa866e5b\n+1172d3dc504d585b8405750fce44b361\n $fGConstraintskkkncfV1V1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Constraints\"#]\n-e998b748a8fb7ae0e7c23e493c1d8fda\n+45a42542b2b8dc88b541806dfa3724a8\n $fGConstraintskkkncfV1V1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V12]\n-3319831b86be7c9a219106a345521e34\n+e092abd396938029b4d859229ff85b5f\n $fGConstraintskkkncfV1V1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e9e430476d1f1fc5ed6d9887beda28e0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+bed0b26fae861fbad3940cbebc8d082b\n $fGConstraintskkkncfV1V1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V14]\n-83e68c3e28fa4f1e33f0a2b8d9badf68\n+08aad8ab0fc5c4b70e532d131d74d22c\n $fGConstraintskkkncfV1V1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-1143e0ae83982e2343b80ac08bfccbbb\n+bdfd6b8d6997c0c21fde742b5f76321a\n $fGConstraintskkkncfV1V1V1_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (x :: k3).\n GAll n c GHC.Generics.V1 =>\n GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n@@ -584,296 +584,296 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGConstraintskkkncfV1V1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-eac176706789b19a8c4b13a0e29a866d\n+0e35236949517d75196078f4bf343325\n $fGConstraintskkkncfV1V1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGConstraintskkkncfV1V1V13\n $fGConstraintskkkncfV1V1V3\n GHC.Stack.Types.EmptyCallStack]\n-491b645464d6c1e1af022a9e847c6e9c\n+9fe1adc0bfc35344a3c7abffb9a31426\n $fGConstraintskkkncfV1V1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGConstraintskkkncfV1V1V11\n $fGConstraintskkkncfV1V1V9\n $fGConstraintskkkncfV1V1V7\n $fGConstraintskkkncfV1V1V6\n $fGConstraintskkkncfV1V1V5\n $fGConstraintskkkncfV1V1V6\n $fGConstraintskkkncfV1V1V4]\n-64c2c84675e37cb320bfe3158b1537aa\n+a8515c74a011c1eb06efa000a73034cd\n $fGConstraintskkkncfV1V1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 26#]\n-b3a480212c401edda8d4e4504ab7d2ca\n+014c17fdb381e7da83381b47c582faa9\n $fGConstraintskkkncfV1V1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 17#]\n-92320647fbbded9f0d8e0640bb3f24ab\n+63f009a2f26314fb11db7f2c5db3ae1b\n $fGConstraintskkkncfV1V1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 50#]\n-5f40d1d7f2653d64a9951a384d095361\n+805d7a23894976ce236ee8d0f8d1c423\n $fGConstraintskkkncfV1V1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V8]\n-c68a90067dc8ad1dfe0abcfbef099f0b\n+2be6becadbecb0f2a61b1892fdf629e4\n $fGConstraintskkkncfV1V1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Constraints.hs\"#]\n-c067e7505a7cdb27b1e928fdc7307bb3\n+f3eaed93e9c7bc39341859b18c7c45e3\n $fGConstraintskkkncfV1V1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V10]\n-2a41b6706d9c5841546eae7028423045\n+655574f2700ee59185447eddfcaccf3e\n $tcGConstraints :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6851661124450705764#Word64\n- 14645157912100126483#Word64\n+ 15360508327004011304#Word64\n+ 13365934220198454576#Word64\n $trModule\n $tcGConstraints2\n 3#\n $tcGConstraints1]\n-7284522711e488c2191688c15440762b\n+0a2ac3377f113208f6a477b8f08dc8f1\n $tcGConstraints1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a0b899cb9c52a7603d8ee59fcdfd901d\n+18153f82677e64619f4f9248db2e5c23\n $tcGConstraints2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGConstraints3]\n-f168d2b52c33cb1bdf21b87265728348\n+88bbc48887ca6473a2f8791667003f97\n $tcGConstraints3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GConstraints\"#]\n-9d95c67ab2d8cd01ba9781deebfd112c\n+1e9eb634241ced9e05013fe315b709b9\n $tcOther :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8349147923270837370#Word64\n- 12898881767436466691#Word64\n+ 12498758593334170086#Word64\n+ 10611665333571444453#Word64\n $trModule\n $tcOther2\n 0#\n $tcOther1]\n-fbf6149391bedc0b6da7b000b015eb53\n+09cbc84e35db1602dd69a0d43157a8e8\n $tcOther1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-e9ae7640dc1a0e160e8aa02d5d341bdf\n+3d8a05844054bd7ecbcddbcb312075cd\n $tcOther2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcOther3]\n-1834c41a308c7d796a762eb4c4d6acdd\n+d961ce8527291fb9c823082c678dc8d2\n $tcOther3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Other\"#]\n-5a2523b9af8f2fd234ff1bd5ddd8529c\n+68c8b9f9b8829514ef3ce8e4eb7ba5e7\n $tcSelf :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3882247661755556798#Word64\n- 15914790293505291645#Word64\n+ 8366789200600956343#Word64\n+ 4003837004503057287#Word64\n $trModule\n $tcSelf1\n 0#\n $tcOther1]\n-b671adf40e1368e7d3581270309fc82c\n+2701f811c019203343e9fd50469c7c69\n $tcSelf1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcSelf2]\n-398abe68f6c23a94c56b32dacd196330\n+d6101a88344cbb4a65e1a10de8edc2c3\n $tcSelf2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Self\"#]\n-ca7c4ddc97affc0c1f601771239f0e1c\n+113f0aa342aab23de22045073d9e3fe2\n $tcX :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8089038180435349292#Word64\n- 1459891730328233508#Word64\n+ 8571795711296583517#Word64\n+ 18443914932586086827#Word64\n $trModule\n $tcX2\n 1#\n $tcX1]\n-4cde3fe3946105297047e38367833713\n+903755c4a65e8e118d2835974a4bdce5\n $tcX1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-396b4fd56e0b6a902ad94e4beb77d4a2\n+c5f7a473a5c33f8e2e508aac5d2bef64\n $tcX2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcX3]\n-3c74e3b970ede4ecc44d57343e110f40\n+2caffd952612d01ce26c4d9baf159492\n $tcX3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"X\"#]\n-e3cbdb7534677a5eee435bc6e7b4314d\n+e63b5f464f4e0db2eabb79550ed96208\n $tcY :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 18205050585863117784#Word64\n- 17595235996948877005#Word64\n+ 13364731284302579778#Word64\n+ 8948023015760443949#Word64\n $trModule\n $tcY2\n 1#\n $tcY1]\n-7423c23fbacf4da0558a469880a07bfd\n+ac7ab91638d84d6fbb52be35db5d066d\n $tcY1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepVar], Inline: [~]]\n-e77f2aa4367f691d885d83668fb4bc2b\n+e2e57340ac36ed17647a6222d6ca096c\n $tcY2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcY3]\n-453eff73639999862d0efe377d94f32a\n+6426c433c49b5f15bc9eb0cd385d5ac2\n $tcY3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Y\"#]\n-ab2b108c5248fbda26e14eca105ea733\n+d1c7839d9ff66a0f552f352725cb4d9b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-09801260a0ed73da1cefeefd02df3123\n+8f0fcb9321521d38d394bdc06918818a\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: \n GHC.Types.TrNameS $fGConstraintskkkncfV1V1V10]\n-422d89c651efe9b5ef6079fb62c92413\n+0ce1dd78e41ddbd0e70545bf14ec7940\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: \n GHC.Types.TrNameS $fGConstraintskkkncfV1V1V12]\n-542a8dba38a19ae89db73a9a948e576b\n+985f5a97917857f06462b5bf5d9dbb25\n axiom D:R:GAllRec ::\n forall k1 k2 (_1 :: k2) (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (a :: k1).\n GAllRec n c (P n X _1) (X a) = c a\n forall k (_1 :: GHC.TypeNats.Nat) (_2 :: k -> GHC.Types.Constraint)\n _3 _4.\n GAllRec _1 _2 _3 _4 = () :: Constraint\n-ac77c2387f3661b338b3047855ff85fa\n+690505e359d8f11e97d781a117d6edc1\n axiom D:R:GAllk1ncM1 ::\n forall k1 (n :: GHC.TypeNats.Nat) (c :: k1 -> GHC.Types.Constraint)\n i (k2 :: GHC.Generics.Meta) (repbf :: * -> *).\n GAll n c (GHC.Generics.M1 i k2 repbf) = GAll n c repbf\n-2ca940d8c5e6cd5109a16abca163260c\n+d86f57c0abcbfe84addcde8678dfa7e9\n axiom D:R:GAllknc:*: ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint)\n (l :: * -> *) (r :: * -> *).\n GAll n c (l GHC.Generics.:*: r) = (GAll n c l, GAll n c r)\n-ec5dbf767c7d05180c5f23493b5931ad\n+20711dd69002c217a856bba5a707d273\n axiom D:R:GAllknc:+: ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint)\n (l :: * -> *) (r :: * -> *).\n GAll n c (l GHC.Generics.:+: r) = (GAll n c l, GAll n c r)\n-d4b68ec018ceb471d0abf05491e2a83b\n+16795d8f213df1a2997f2764349a1bce\n axiom D:R:GAllkncRec ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint) l\n r.\n GAll n c (Data.Generics.GenericN.Rec l r) = GAllRec n c l r\n-8e136c276397fb31e668fabd2e9c77c5\n+803dfb0f0e5d9e947f5c516b57f9a73b\n axiom D:R:GAllkncU1 ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint).\n GAll n c GHC.Generics.U1 = () :: Constraint\n-59c1949b5855eaea5e6aac2efc670d5d\n+315ea4bd2a184dd092dcd174ad0431f7\n axiom D:R:GAllkncV1 ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint).\n GAll n c GHC.Generics.V1 = () :: Constraint\n-63748f827ddf0b2d585f6f9f8b70797a\n+17aca5f66eab94507f638f70bab15e8d\n axiom D:R:SelfOrOther ::\n forall k (b :: k). SelfOrOther b b = Self\n forall k (b :: k) (b' :: k). SelfOrOther b b' = Other\n-aa7b4f673c4e9bfa97e7a1c50731e7fd\n+4c84a1c336cdb79298bdd95cd66df075\n type GAll :: forall k.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint) -> (* -> *) -> GHC.Types.Constraint\n type family GAll n c repbf open\n-557a0570a0d96d918cf96f9a4087fca6\n+03526228c3e645da09ec91d1b85e9d59\n type GAllRec :: forall k.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint) -> * -> * -> GHC.Types.Constraint\n type family GAllRec n c l r where\n forall k1 k2 (_1 :: k2) (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (a :: k1).\n GAllRec n c (P n X _1) (X a) = c a\n forall k (_1 :: GHC.TypeNats.Nat) (_2 :: k -> GHC.Types.Constraint)\n _3 _4.\n GAllRec _1 _2 _3 _4 = () :: Constraint\n axiom D:R:GAllRec\n-a7e9e23d9fc65479302c9d3c0ace9820\n+5c512afe7415c41c93750c1e4c738a80\n type GConstraints :: forall {k} {k1} {k2}.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint)\n -> k1\n -> (* -> *)\n -> (k2 -> *)\n -> (k2 -> *)\n -> GHC.Types.Constraint\n class GConstraints n c f repbx repbf repbdf where\n gaddDicts :: forall (x :: k2).\n GAll n c repbx =>\n repbf x -> repbdf x\n {-# MINIMAL gaddDicts #-}\n-37a7ae0c37bbbef9abad416d6d0959ff\n+8bb50890c54679a66314c7386cc22c84\n type role Other phantom phantom phantom\n type Other :: * -> * -> * -> *\n data Other p a x\n-7eb33923cc725a2e1c7609a52d3a1c15\n+359fc6e15013713a9368ad8bfdd5796b\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-2f79d5b19b60d934525cb7f68041b9a3\n+fad44513c200d092a9b1df1339ad21e6\n type role Self phantom phantom phantom\n type Self :: * -> * -> * -> *\n data Self p a x\n-e8303c93bae99168155f7ca174ff8b67\n+34dc852d178b4c8bad9ddef602d60e81\n type SelfOrOther :: forall k. k -> k -> * -> * -> * -> *\n type family SelfOrOther b b' where\n forall k (b :: k). SelfOrOther b b = Self\n forall k (b :: k) (b' :: k). SelfOrOther b b' = Other\n axiom D:R:SelfOrOther\n-171ce71086eece1d472adc01f3a98af1\n+ef8817b68c20d7aa4653a1809b97c873\n type role X phantom\n type X :: forall {k}. k -> *\n data X a\n-ba6a1ba68e95cb981888219d3edc670b\n+d1ab14839ebc0a3f1df64062aa572cc4\n type Y :: forall k. k\n data family Y\n instance GConstraints [., GHC.Prim.FUN, ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec,\n Data.Generics.GenericN.Rec]\n = $fGConstraintskFUNkncfRecRecRec\n instance GConstraints [., ., ., ., ., ., GHC.Generics.:*:,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.dyn_hi", "comments": ["Files 90% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Generics.Constraints [family instance module] 9066\n- interface hash: 77c0f6bedde7374a1fa02f8d62f51e03\n- ABI hash: dbe4a74ad57c80c8783d07b1647baa9b\n- export-list hash: f5759178cdbb617493eee5630131ae28\n+ interface hash: 259a4fad57a929a9aebe97b44af6a872\n+ ABI hash: 0aa87421cc66b72ee5cd089f3a525bd7\n+ export-list hash: cc7aef2f5c488676d297ae83c45ee82c\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 2c4fa156826c15b4cbd15eef0f8f632d\n+ flag hash: d8099ad38ca87ea2dda40463696d014a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 65f7f84670d16c10ad18f2d54576dbfb\n sig of: Nothing\n used TH splices: False\n where\n@@ -21,44 +21,44 @@\n GAll\n GConstraints{gaddDicts}\n Other\n Self\n SelfOrOther\n X\n Y\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Monoid Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-5001faeed8480a2270d4e0a93669928d\n+814e0ea74b78a21944b84e87818e1ca0\n $fGConstraintskFUNkncfRecRecRec ::\n forall k1 k2 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *) (a' :: k1)\n (a :: k1).\n GConstraints\n n\n c\n@@ -138,15 +138,15 @@\n _N\n _N))]\n-00411074896617543b06368818b91d58\n+2f4f7592af8285ddf886e59d026a7b0e\n $fGConstraintskkkncf:*::*::*: ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf) =>\n GConstraints\n@@ -180,15 +180,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-a8e13bd9bbdbfdfe79fdf793b49b4b56\n+8f9aa7e1f9e5cfe8a18ecbf91350e079\n $fGConstraintskkkncf:*::*::*:_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *) (x :: k3).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf,\n GAll n c (lx GHC.Generics.:*: rx)) =>\n@@ -241,15 +241,15 @@\n (GHC.Classes.$p1(%,%)\n @(GAll n c lx)\n @(GAll n c rx)\n irred\n `cast`\n (Sub (D:R:GAllknc:*:[0] _N _N _N _N _N)))\n r) }]\n-89452a8f4ede00a45a03d66b50e4fa9e\n+a75098ed0e7c88f4bd7bfd34f371c7bc\n $fGConstraintskkkncf:+::+::+: ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf) =>\n GConstraints\n@@ -282,15 +282,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-3b2e3d7bc71cdb5ebdfdc16b31d9e35b\n+1c4955b789f1cbd399f7099ad8f87c43\n $fGConstraintskkkncf:+::+::+:_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *) (x :: k3).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf,\n GAll n c (lx GHC.Generics.:+: rx)) =>\n@@ -349,15 +349,15 @@\n (GHC.Classes.$p1(%,%)\n @(GAll n c lx)\n @(GAll n c rx)\n irred\n `cast`\n (Sub (D:R:GAllknc:+:[0] _N _N _N _N _N)))\n r) }]\n-a5cecbee5527ee9d9fd6f9276d150164\n+57a3dd660bb73ae66d1542a5db285351\n $fGConstraintskkkncfM1M1M1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (repbx :: * -> *)\n (repbf :: k3 -> *) (repbdf :: k3 -> *) i (k4 :: GHC.Generics.Meta).\n GConstraints n c f repbx repbf repbdf =>\n GConstraints\n n\n@@ -384,15 +384,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-376862bc7175d33b522a7ce1cc541623\n+77b66ee240cb94b76af46e28e7c3c65a\n $fGConstraintskkkncfM1M1M1_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (repbx :: * -> *)\n (repbf :: k3 -> *) (repbdf :: k3 -> *) i (k4 :: GHC.Generics.Meta)\n (x :: k3).\n (GConstraints n c f repbx repbf repbdf,\n GAll n c (GHC.Generics.M1 i k4 repbx)) =>\n@@ -440,15 +440,15 @@\n x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-fb2b1a83ff845380e4002132f29acee0\n+82e30a6deec32671cfcf28b6f08a7fc3\n $fGConstraintskkkncfRecRecRec ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) a' a b' b.\n GConstraints\n n\n c\n f\n@@ -482,15 +482,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b9127ffaa866b8e62e6b575ab17ba4f3\n+b81b3aaa15b0223e40a6ce3d46796983\n $fGConstraintskkkncfU1U1U1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2).\n GConstraints n c f GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n@@ -513,15 +513,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-f2d5d9b856185493db02b11fcfe8e927\n+5cee10be88480bb74cdaad1fcd23f2ad\n $fGConstraintskkkncfV1V1V1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2).\n GConstraints n c f GHC.Generics.V1 GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n@@ -536,38 +536,38 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-09dd9269c81003f55b883d62fa866e5b\n+1172d3dc504d585b8405750fce44b361\n $fGConstraintskkkncfV1V1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Constraints\"#]\n-e998b748a8fb7ae0e7c23e493c1d8fda\n+45a42542b2b8dc88b541806dfa3724a8\n $fGConstraintskkkncfV1V1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V12]\n-3319831b86be7c9a219106a345521e34\n+e092abd396938029b4d859229ff85b5f\n $fGConstraintskkkncfV1V1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e9e430476d1f1fc5ed6d9887beda28e0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+bed0b26fae861fbad3940cbebc8d082b\n $fGConstraintskkkncfV1V1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V14]\n-83e68c3e28fa4f1e33f0a2b8d9badf68\n+08aad8ab0fc5c4b70e532d131d74d22c\n $fGConstraintskkkncfV1V1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-1143e0ae83982e2343b80ac08bfccbbb\n+bdfd6b8d6997c0c21fde742b5f76321a\n $fGConstraintskkkncfV1V1V1_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (x :: k3).\n GAll n c GHC.Generics.V1 =>\n GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n@@ -584,296 +584,296 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGConstraintskkkncfV1V1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-eac176706789b19a8c4b13a0e29a866d\n+0e35236949517d75196078f4bf343325\n $fGConstraintskkkncfV1V1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGConstraintskkkncfV1V1V13\n $fGConstraintskkkncfV1V1V3\n GHC.Stack.Types.EmptyCallStack]\n-491b645464d6c1e1af022a9e847c6e9c\n+9fe1adc0bfc35344a3c7abffb9a31426\n $fGConstraintskkkncfV1V1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGConstraintskkkncfV1V1V11\n $fGConstraintskkkncfV1V1V9\n $fGConstraintskkkncfV1V1V7\n $fGConstraintskkkncfV1V1V6\n $fGConstraintskkkncfV1V1V5\n $fGConstraintskkkncfV1V1V6\n $fGConstraintskkkncfV1V1V4]\n-64c2c84675e37cb320bfe3158b1537aa\n+a8515c74a011c1eb06efa000a73034cd\n $fGConstraintskkkncfV1V1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 26#]\n-b3a480212c401edda8d4e4504ab7d2ca\n+014c17fdb381e7da83381b47c582faa9\n $fGConstraintskkkncfV1V1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 17#]\n-92320647fbbded9f0d8e0640bb3f24ab\n+63f009a2f26314fb11db7f2c5db3ae1b\n $fGConstraintskkkncfV1V1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 50#]\n-5f40d1d7f2653d64a9951a384d095361\n+805d7a23894976ce236ee8d0f8d1c423\n $fGConstraintskkkncfV1V1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V8]\n-c68a90067dc8ad1dfe0abcfbef099f0b\n+2be6becadbecb0f2a61b1892fdf629e4\n $fGConstraintskkkncfV1V1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Constraints.hs\"#]\n-c067e7505a7cdb27b1e928fdc7307bb3\n+f3eaed93e9c7bc39341859b18c7c45e3\n $fGConstraintskkkncfV1V1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V10]\n-2a41b6706d9c5841546eae7028423045\n+655574f2700ee59185447eddfcaccf3e\n $tcGConstraints :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6851661124450705764#Word64\n- 14645157912100126483#Word64\n+ 15360508327004011304#Word64\n+ 13365934220198454576#Word64\n $trModule\n $tcGConstraints2\n 3#\n $tcGConstraints1]\n-7284522711e488c2191688c15440762b\n+0a2ac3377f113208f6a477b8f08dc8f1\n $tcGConstraints1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a0b899cb9c52a7603d8ee59fcdfd901d\n+18153f82677e64619f4f9248db2e5c23\n $tcGConstraints2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGConstraints3]\n-f168d2b52c33cb1bdf21b87265728348\n+88bbc48887ca6473a2f8791667003f97\n $tcGConstraints3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GConstraints\"#]\n-9d95c67ab2d8cd01ba9781deebfd112c\n+1e9eb634241ced9e05013fe315b709b9\n $tcOther :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8349147923270837370#Word64\n- 12898881767436466691#Word64\n+ 12498758593334170086#Word64\n+ 10611665333571444453#Word64\n $trModule\n $tcOther2\n 0#\n $tcOther1]\n-fbf6149391bedc0b6da7b000b015eb53\n+09cbc84e35db1602dd69a0d43157a8e8\n $tcOther1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-e9ae7640dc1a0e160e8aa02d5d341bdf\n+3d8a05844054bd7ecbcddbcb312075cd\n $tcOther2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcOther3]\n-1834c41a308c7d796a762eb4c4d6acdd\n+d961ce8527291fb9c823082c678dc8d2\n $tcOther3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Other\"#]\n-5a2523b9af8f2fd234ff1bd5ddd8529c\n+68c8b9f9b8829514ef3ce8e4eb7ba5e7\n $tcSelf :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3882247661755556798#Word64\n- 15914790293505291645#Word64\n+ 8366789200600956343#Word64\n+ 4003837004503057287#Word64\n $trModule\n $tcSelf1\n 0#\n $tcOther1]\n-b671adf40e1368e7d3581270309fc82c\n+2701f811c019203343e9fd50469c7c69\n $tcSelf1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcSelf2]\n-398abe68f6c23a94c56b32dacd196330\n+d6101a88344cbb4a65e1a10de8edc2c3\n $tcSelf2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Self\"#]\n-ca7c4ddc97affc0c1f601771239f0e1c\n+113f0aa342aab23de22045073d9e3fe2\n $tcX :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8089038180435349292#Word64\n- 1459891730328233508#Word64\n+ 8571795711296583517#Word64\n+ 18443914932586086827#Word64\n $trModule\n $tcX2\n 1#\n $tcX1]\n-4cde3fe3946105297047e38367833713\n+903755c4a65e8e118d2835974a4bdce5\n $tcX1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-396b4fd56e0b6a902ad94e4beb77d4a2\n+c5f7a473a5c33f8e2e508aac5d2bef64\n $tcX2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcX3]\n-3c74e3b970ede4ecc44d57343e110f40\n+2caffd952612d01ce26c4d9baf159492\n $tcX3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"X\"#]\n-e3cbdb7534677a5eee435bc6e7b4314d\n+e63b5f464f4e0db2eabb79550ed96208\n $tcY :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 18205050585863117784#Word64\n- 17595235996948877005#Word64\n+ 13364731284302579778#Word64\n+ 8948023015760443949#Word64\n $trModule\n $tcY2\n 1#\n $tcY1]\n-7423c23fbacf4da0558a469880a07bfd\n+ac7ab91638d84d6fbb52be35db5d066d\n $tcY1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepVar], Inline: [~]]\n-e77f2aa4367f691d885d83668fb4bc2b\n+e2e57340ac36ed17647a6222d6ca096c\n $tcY2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcY3]\n-453eff73639999862d0efe377d94f32a\n+6426c433c49b5f15bc9eb0cd385d5ac2\n $tcY3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Y\"#]\n-ab2b108c5248fbda26e14eca105ea733\n+d1c7839d9ff66a0f552f352725cb4d9b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-09801260a0ed73da1cefeefd02df3123\n+8f0fcb9321521d38d394bdc06918818a\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: \n GHC.Types.TrNameS $fGConstraintskkkncfV1V1V10]\n-422d89c651efe9b5ef6079fb62c92413\n+0ce1dd78e41ddbd0e70545bf14ec7940\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: \n GHC.Types.TrNameS $fGConstraintskkkncfV1V1V12]\n-542a8dba38a19ae89db73a9a948e576b\n+985f5a97917857f06462b5bf5d9dbb25\n axiom D:R:GAllRec ::\n forall k1 k2 (_1 :: k2) (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (a :: k1).\n GAllRec n c (P n X _1) (X a) = c a\n forall k (_1 :: GHC.TypeNats.Nat) (_2 :: k -> GHC.Types.Constraint)\n _3 _4.\n GAllRec _1 _2 _3 _4 = () :: Constraint\n-ac77c2387f3661b338b3047855ff85fa\n+690505e359d8f11e97d781a117d6edc1\n axiom D:R:GAllk1ncM1 ::\n forall k1 (n :: GHC.TypeNats.Nat) (c :: k1 -> GHC.Types.Constraint)\n i (k2 :: GHC.Generics.Meta) (repbf :: * -> *).\n GAll n c (GHC.Generics.M1 i k2 repbf) = GAll n c repbf\n-2ca940d8c5e6cd5109a16abca163260c\n+d86f57c0abcbfe84addcde8678dfa7e9\n axiom D:R:GAllknc:*: ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint)\n (l :: * -> *) (r :: * -> *).\n GAll n c (l GHC.Generics.:*: r) = (GAll n c l, GAll n c r)\n-ec5dbf767c7d05180c5f23493b5931ad\n+20711dd69002c217a856bba5a707d273\n axiom D:R:GAllknc:+: ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint)\n (l :: * -> *) (r :: * -> *).\n GAll n c (l GHC.Generics.:+: r) = (GAll n c l, GAll n c r)\n-d4b68ec018ceb471d0abf05491e2a83b\n+16795d8f213df1a2997f2764349a1bce\n axiom D:R:GAllkncRec ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint) l\n r.\n GAll n c (Data.Generics.GenericN.Rec l r) = GAllRec n c l r\n-8e136c276397fb31e668fabd2e9c77c5\n+803dfb0f0e5d9e947f5c516b57f9a73b\n axiom D:R:GAllkncU1 ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint).\n GAll n c GHC.Generics.U1 = () :: Constraint\n-59c1949b5855eaea5e6aac2efc670d5d\n+315ea4bd2a184dd092dcd174ad0431f7\n axiom D:R:GAllkncV1 ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint).\n GAll n c GHC.Generics.V1 = () :: Constraint\n-63748f827ddf0b2d585f6f9f8b70797a\n+17aca5f66eab94507f638f70bab15e8d\n axiom D:R:SelfOrOther ::\n forall k (b :: k). SelfOrOther b b = Self\n forall k (b :: k) (b' :: k). SelfOrOther b b' = Other\n-aa7b4f673c4e9bfa97e7a1c50731e7fd\n+4c84a1c336cdb79298bdd95cd66df075\n type GAll :: forall k.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint) -> (* -> *) -> GHC.Types.Constraint\n type family GAll n c repbf open\n-557a0570a0d96d918cf96f9a4087fca6\n+03526228c3e645da09ec91d1b85e9d59\n type GAllRec :: forall k.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint) -> * -> * -> GHC.Types.Constraint\n type family GAllRec n c l r where\n forall k1 k2 (_1 :: k2) (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (a :: k1).\n GAllRec n c (P n X _1) (X a) = c a\n forall k (_1 :: GHC.TypeNats.Nat) (_2 :: k -> GHC.Types.Constraint)\n _3 _4.\n GAllRec _1 _2 _3 _4 = () :: Constraint\n axiom D:R:GAllRec\n-a7e9e23d9fc65479302c9d3c0ace9820\n+5c512afe7415c41c93750c1e4c738a80\n type GConstraints :: forall {k} {k1} {k2}.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint)\n -> k1\n -> (* -> *)\n -> (k2 -> *)\n -> (k2 -> *)\n -> GHC.Types.Constraint\n class GConstraints n c f repbx repbf repbdf where\n gaddDicts :: forall (x :: k2).\n GAll n c repbx =>\n repbf x -> repbdf x\n {-# MINIMAL gaddDicts #-}\n-37a7ae0c37bbbef9abad416d6d0959ff\n+8bb50890c54679a66314c7386cc22c84\n type role Other phantom phantom phantom\n type Other :: * -> * -> * -> *\n data Other p a x\n-7eb33923cc725a2e1c7609a52d3a1c15\n+359fc6e15013713a9368ad8bfdd5796b\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-2f79d5b19b60d934525cb7f68041b9a3\n+fad44513c200d092a9b1df1339ad21e6\n type role Self phantom phantom phantom\n type Self :: * -> * -> * -> *\n data Self p a x\n-e8303c93bae99168155f7ca174ff8b67\n+34dc852d178b4c8bad9ddef602d60e81\n type SelfOrOther :: forall k. k -> k -> * -> * -> * -> *\n type family SelfOrOther b b' where\n forall k (b :: k). SelfOrOther b b = Self\n forall k (b :: k) (b' :: k). SelfOrOther b b' = Other\n axiom D:R:SelfOrOther\n-171ce71086eece1d472adc01f3a98af1\n+ef8817b68c20d7aa4653a1809b97c873\n type role X phantom\n type X :: forall {k}. k -> *\n data X a\n-ba6a1ba68e95cb981888219d3edc670b\n+d1ab14839ebc0a3f1df64062aa572cc4\n type Y :: forall k. k\n data family Y\n instance GConstraints [., GHC.Prim.FUN, ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec,\n Data.Generics.GenericN.Rec]\n = $fGConstraintskFUNkncfRecRecRec\n instance GConstraints [., ., ., ., ., ., GHC.Generics.:*:,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,58 +1,58 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Generics.Distributive 9066\n- interface hash: c4413c85c027ca673dfae523c6c742f7\n- ABI hash: bc4b8750effdecf47b6444706f50b239\n- export-list hash: 01bd0bf3c69d9ed41b89304dabe8f1bc\n+ interface hash: 2aedb59fd33fb3f6fe9581cd95100343\n+ ABI hash: 6ea5c0f8a0da8726f912791430769bee\n+ export-list hash: 041ee6c38192ef6dc7d80eda56c4e985\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: b23610d5288c522f9c6e5e364c1f05b2\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GDistributive{gdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k\n plugin package dependencies:\n orphans: GHC.Base GHC.Float Data.Orphans GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Array.Byte Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception GHC.IsList\n GHC.RTS.Flags GHC.Stats Control.DeepSeq Data.Tagged\n Control.Applicative.Backwards Control.Monad.Trans.Identity\n Control.Monad.Trans.Reader Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Distributive 04fa65c32a90c60ba98393f96353840a\n-9de23352e87f0f3439c6ecced701a3ee\n+7495baeb1eed12cafb62888dc230aff7\n $fGDistributiveknf:*::*: ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (l :: k -> *)\n (l' :: k -> *) (r :: k -> *) (r' :: k -> *).\n (GDistributive n f l l', GDistributive n f r r') =>\n GDistributive n f (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -79,15 +79,15 @@\n @f\n @l\n @l'\n @r\n @r'\n v\n v1)]\n-0c2bd5fe6bc20f063066bff2202c8dfe\n+be74f0bced9417a8755e2bd665966396\n $fGDistributiveknf:*::*:_$cgdistribute ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (l :: k -> *)\n (l' :: k -> *) (r :: k -> *) (r' :: k -> *) (x :: k).\n (GDistributive n f l l', GDistributive n f r r') =>\n Data.Proxy.Proxy n\n -> f ((GHC.Generics.:*:) l r x) -> (GHC.Generics.:*:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -144,15 +144,15 @@\n (GHC.Base.fmap\n @f\n $dFunctor\n @((GHC.Generics.:*:) l r x)\n @(r x)\n (sndF @k @l @r @x)\n eta1))]\n-dbb7a085c3bb37f2f4f90f778518ecbc\n+11212f63e8b0d698a46a9d1b1430c6c8\n $fGDistributiveknfM1M1 ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (bg :: k -> *)\n (bfg :: k -> *) i (c :: GHC.Generics.Meta).\n GDistributive n f bg bfg =>\n GDistributive\n n f (GHC.Generics.M1 i c bg) (GHC.Generics.M1 i c bfg)\n DFunId\n@@ -169,15 +169,15 @@\n @k\n @n\n @f\n @(GHC.Generics.M1 i c bg)\n @(GHC.Generics.M1 i c bfg)\n ($p1GDistributive @k @n @f @bg @bfg v)\n ($fGDistributiveknfM1M1_$cgdistribute @k @n @f @bg @bfg @i @c v)]\n-3cbea6285ca35504ae266e0311248583\n+7a6e3c1326bbb42eaaa04d25c5aa1397\n $fGDistributiveknfM1M1_$cgdistribute ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (bg :: k -> *)\n (bfg :: k -> *) i (c :: GHC.Generics.Meta) (x :: k).\n GDistributive n f bg bfg =>\n Data.Proxy.Proxy n\n -> f (GHC.Generics.M1 i c bg x) -> GHC.Generics.M1 i c bfg x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -213,15 +213,15 @@\n } in\n (\\ (x1['GHC.Types.Many] :: f (GHC.Generics.M1 i c bg x)) ->\n f1 (g x1))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-d4094eae08c958a1f7eb295bfff6816d\n+ff833420ad8c5740f7ecd2daf5e83477\n $fGDistributiveknfRecRec ::\n forall k1 k (f :: * -> *) (h :: * -> *) (n :: GHC.TypeNats.Nat)\n (g :: k1 -> *) (a :: k1).\n (GHC.Base.Functor f, Data.Distributive.Distributive h) =>\n GDistributive\n n\n f\n@@ -257,15 +257,15 @@\n @f\n @h\n @n\n @g\n @a\n v\n v1)]\n-63d0a3caaa450108af9fe2cf04338f47\n+3d916fced2883a3be076600fd5489298\n $fGDistributiveknfRecRec0 ::\n forall k1 k (f :: * -> *) (n :: GHC.TypeNats.Nat) (g :: k1 -> *)\n (a :: k1).\n GHC.Base.Functor f =>\n GDistributive\n n\n f\n@@ -288,15 +288,15 @@\n @f\n @(Data.Generics.GenericN.Rec (P n g a) (g a))\n @(Data.Generics.GenericN.Rec\n (P n (Data.Functor.Compose.Compose f g) a)\n (Data.Functor.Compose.Compose f g a))\n v\n ($fGDistributiveknfRecRec0_$cgdistribute @k1 @k @f @n @g @a v)]\n-6dd78956ade326e8550891976831f774\n+bc51a226e5a146d7ff9eb72859876625\n $fGDistributiveknfRecRec0_$cgdistribute ::\n forall k1 k (f :: * -> *) (n :: GHC.TypeNats.Nat) (g :: k1 -> *)\n (a :: k1) (x :: k).\n GHC.Base.Functor f =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (P n g a) (g a) x)\n -> Data.Generics.GenericN.Rec\n@@ -347,15 +347,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N)]\n-90662594bb3964610d4bed73f0ce17e1\n+7fce78c794f0d01f8deea522613280db\n $fGDistributiveknfRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (h :: * -> *) (n :: GHC.TypeNats.Nat)\n (g :: k1 -> *) (a :: k1) (x :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h) =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (h (P n g a)) (h (g a)) x)\n -> Data.Generics.GenericN.Rec\n@@ -431,15 +431,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-42f5f7ee0a3b3f55cbfb5501d91160ad\n+349bc822eeb9537abc6b96207748311f\n $fGDistributiveknfU1U1 ::\n GHC.Base.Functor f =>\n GDistributive n f GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k\n@@ -449,15 +449,15 @@\n @k\n @n\n @f\n @GHC.Generics.U1\n @GHC.Generics.U1\n v\n ($fGDistributiveknfU1U1_$cgdistribute @k @f @n v)]\n-5fd3f5be9237bca305394c959b51b255\n+9ef43b0335fb7269b5bac768a69c9cc5\n $fGDistributiveknfU1U1_$cgdistribute ::\n forall k (f :: * -> *) (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Base.Functor f =>\n Data.Proxy.Proxy n -> f (GHC.Generics.U1 x) -> GHC.Generics.U1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -465,88 +465,88 @@\n @f :: * -> *\n @n :: GHC.TypeNats.Nat\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: f (GHC.Generics.U1 x)) ->\n GHC.Generics.U1 @k @x]\n-b264138cc40ab4669940cf658f168866\n+95f4eb5d0e06cf2cb2451c799168d013\n $tcGDistributive :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 5090494350507771809#Word64\n- 13791180703735360121#Word64\n+ 10274924133335904162#Word64\n+ 10083981124340008161#Word64\n $trModule\n $tcGDistributive2\n 1#\n $tcGDistributive1]\n-cf922480b3b424ffd0f021a5a22c6840\n+1866409628d7dd45c25386be74b3e66c\n $tcGDistributive1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-41d9a8aeb5c2671adf4099c4df5a438f\n+f00451ba03a25273e118d9c61d92f073\n $tcGDistributive2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGDistributive3]\n-acf8bac60e11a50cdd594a27ff9f95de\n+a6b34c3d63379d4086161ad7e0c69470\n $tcGDistributive3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GDistributive\"#]\n-cd165a524aad7919d5d1dbd2160011bb\n+fc332f194d3902f12ecbce8b4deb0267\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-616b90aafc892e78a8a071fc611db665\n+30ec7047df5f51e3ee67174d20834c8c\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-9f54470c7d774c34786c9d4820c5e50f\n+f3e20d5025fb844dd0a6cd8ed36a2543\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Distributive\"#]\n-90458ec20a619b843c1bb081bd0f1f67\n+1dff1523069baa20fca88eb1ec286e15\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-e9b1ebede838fc1951c1281ec419e331\n+05ca5f5fd762ef22c8f37fe3bc8f3260\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-8920dca54430650db1672b0181edd98f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+99fd67a91a625d0976ec289825432d45\n type GDistributive :: forall {k}.\n GHC.TypeNats.Nat\n -> (* -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n class GHC.Base.Functor f => GDistributive n f repbg repbfg where\n gdistribute :: forall (x :: k).\n Data.Proxy.Proxy n -> f (repbg x) -> repbfg x\n {-# MINIMAL gdistribute #-}\n-2491bd7e90dd94f166bf1f059879eaf3\n+baf79258156c0cb96ca7b1a63727c773\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-fdb57ff2609f4e266e8f6291313bae99\n+4ef877e1d6f6ccf6ba9736828ff13e99\n fstF ::\n forall {k} (l :: k -> *) (r :: k -> *) (a :: k).\n (GHC.Generics.:*:) l r a -> l a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @l :: k -> *\n @r :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: (GHC.Generics.:*:) l r a) ->\n case ds of wild { GHC.Generics.:*: x _y -> x }]\n-39fd2b5f18a0c41e47236761d328df40\n+bc893afba0cca8da2fc2b3b9a7993a4a\n sndF ::\n forall {k} (l :: k -> *) (r :: k -> *) (a :: k).\n (GHC.Generics.:*:) l r a -> r a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,58 +1,58 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Generics.Distributive 9066\n- interface hash: c4413c85c027ca673dfae523c6c742f7\n- ABI hash: bc4b8750effdecf47b6444706f50b239\n- export-list hash: 01bd0bf3c69d9ed41b89304dabe8f1bc\n+ interface hash: 2aedb59fd33fb3f6fe9581cd95100343\n+ ABI hash: 6ea5c0f8a0da8726f912791430769bee\n+ export-list hash: 041ee6c38192ef6dc7d80eda56c4e985\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: b23610d5288c522f9c6e5e364c1f05b2\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GDistributive{gdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k\n plugin package dependencies:\n orphans: GHC.Base GHC.Float Data.Orphans GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Array.Byte Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception GHC.IsList\n GHC.RTS.Flags GHC.Stats Control.DeepSeq Data.Tagged\n Control.Applicative.Backwards Control.Monad.Trans.Identity\n Control.Monad.Trans.Reader Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Distributive 04fa65c32a90c60ba98393f96353840a\n-9de23352e87f0f3439c6ecced701a3ee\n+7495baeb1eed12cafb62888dc230aff7\n $fGDistributiveknf:*::*: ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (l :: k -> *)\n (l' :: k -> *) (r :: k -> *) (r' :: k -> *).\n (GDistributive n f l l', GDistributive n f r r') =>\n GDistributive n f (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -79,15 +79,15 @@\n @f\n @l\n @l'\n @r\n @r'\n v\n v1)]\n-0c2bd5fe6bc20f063066bff2202c8dfe\n+be74f0bced9417a8755e2bd665966396\n $fGDistributiveknf:*::*:_$cgdistribute ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (l :: k -> *)\n (l' :: k -> *) (r :: k -> *) (r' :: k -> *) (x :: k).\n (GDistributive n f l l', GDistributive n f r r') =>\n Data.Proxy.Proxy n\n -> f ((GHC.Generics.:*:) l r x) -> (GHC.Generics.:*:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -144,15 +144,15 @@\n (GHC.Base.fmap\n @f\n $dFunctor\n @((GHC.Generics.:*:) l r x)\n @(r x)\n (sndF @k @l @r @x)\n eta1))]\n-dbb7a085c3bb37f2f4f90f778518ecbc\n+11212f63e8b0d698a46a9d1b1430c6c8\n $fGDistributiveknfM1M1 ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (bg :: k -> *)\n (bfg :: k -> *) i (c :: GHC.Generics.Meta).\n GDistributive n f bg bfg =>\n GDistributive\n n f (GHC.Generics.M1 i c bg) (GHC.Generics.M1 i c bfg)\n DFunId\n@@ -169,15 +169,15 @@\n @k\n @n\n @f\n @(GHC.Generics.M1 i c bg)\n @(GHC.Generics.M1 i c bfg)\n ($p1GDistributive @k @n @f @bg @bfg v)\n ($fGDistributiveknfM1M1_$cgdistribute @k @n @f @bg @bfg @i @c v)]\n-3cbea6285ca35504ae266e0311248583\n+7a6e3c1326bbb42eaaa04d25c5aa1397\n $fGDistributiveknfM1M1_$cgdistribute ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (bg :: k -> *)\n (bfg :: k -> *) i (c :: GHC.Generics.Meta) (x :: k).\n GDistributive n f bg bfg =>\n Data.Proxy.Proxy n\n -> f (GHC.Generics.M1 i c bg x) -> GHC.Generics.M1 i c bfg x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -213,15 +213,15 @@\n } in\n (\\ (x1['GHC.Types.Many] :: f (GHC.Generics.M1 i c bg x)) ->\n f1 (g x1))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-d4094eae08c958a1f7eb295bfff6816d\n+ff833420ad8c5740f7ecd2daf5e83477\n $fGDistributiveknfRecRec ::\n forall k1 k (f :: * -> *) (h :: * -> *) (n :: GHC.TypeNats.Nat)\n (g :: k1 -> *) (a :: k1).\n (GHC.Base.Functor f, Data.Distributive.Distributive h) =>\n GDistributive\n n\n f\n@@ -257,15 +257,15 @@\n @f\n @h\n @n\n @g\n @a\n v\n v1)]\n-63d0a3caaa450108af9fe2cf04338f47\n+3d916fced2883a3be076600fd5489298\n $fGDistributiveknfRecRec0 ::\n forall k1 k (f :: * -> *) (n :: GHC.TypeNats.Nat) (g :: k1 -> *)\n (a :: k1).\n GHC.Base.Functor f =>\n GDistributive\n n\n f\n@@ -288,15 +288,15 @@\n @f\n @(Data.Generics.GenericN.Rec (P n g a) (g a))\n @(Data.Generics.GenericN.Rec\n (P n (Data.Functor.Compose.Compose f g) a)\n (Data.Functor.Compose.Compose f g a))\n v\n ($fGDistributiveknfRecRec0_$cgdistribute @k1 @k @f @n @g @a v)]\n-6dd78956ade326e8550891976831f774\n+bc51a226e5a146d7ff9eb72859876625\n $fGDistributiveknfRecRec0_$cgdistribute ::\n forall k1 k (f :: * -> *) (n :: GHC.TypeNats.Nat) (g :: k1 -> *)\n (a :: k1) (x :: k).\n GHC.Base.Functor f =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (P n g a) (g a) x)\n -> Data.Generics.GenericN.Rec\n@@ -347,15 +347,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N)]\n-90662594bb3964610d4bed73f0ce17e1\n+7fce78c794f0d01f8deea522613280db\n $fGDistributiveknfRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (h :: * -> *) (n :: GHC.TypeNats.Nat)\n (g :: k1 -> *) (a :: k1) (x :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h) =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (h (P n g a)) (h (g a)) x)\n -> Data.Generics.GenericN.Rec\n@@ -431,15 +431,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-42f5f7ee0a3b3f55cbfb5501d91160ad\n+349bc822eeb9537abc6b96207748311f\n $fGDistributiveknfU1U1 ::\n GHC.Base.Functor f =>\n GDistributive n f GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k\n@@ -449,15 +449,15 @@\n @k\n @n\n @f\n @GHC.Generics.U1\n @GHC.Generics.U1\n v\n ($fGDistributiveknfU1U1_$cgdistribute @k @f @n v)]\n-5fd3f5be9237bca305394c959b51b255\n+9ef43b0335fb7269b5bac768a69c9cc5\n $fGDistributiveknfU1U1_$cgdistribute ::\n forall k (f :: * -> *) (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Base.Functor f =>\n Data.Proxy.Proxy n -> f (GHC.Generics.U1 x) -> GHC.Generics.U1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -465,88 +465,88 @@\n @f :: * -> *\n @n :: GHC.TypeNats.Nat\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: f (GHC.Generics.U1 x)) ->\n GHC.Generics.U1 @k @x]\n-b264138cc40ab4669940cf658f168866\n+95f4eb5d0e06cf2cb2451c799168d013\n $tcGDistributive :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 5090494350507771809#Word64\n- 13791180703735360121#Word64\n+ 10274924133335904162#Word64\n+ 10083981124340008161#Word64\n $trModule\n $tcGDistributive2\n 1#\n $tcGDistributive1]\n-cf922480b3b424ffd0f021a5a22c6840\n+1866409628d7dd45c25386be74b3e66c\n $tcGDistributive1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-41d9a8aeb5c2671adf4099c4df5a438f\n+f00451ba03a25273e118d9c61d92f073\n $tcGDistributive2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGDistributive3]\n-acf8bac60e11a50cdd594a27ff9f95de\n+a6b34c3d63379d4086161ad7e0c69470\n $tcGDistributive3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GDistributive\"#]\n-cd165a524aad7919d5d1dbd2160011bb\n+fc332f194d3902f12ecbce8b4deb0267\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-616b90aafc892e78a8a071fc611db665\n+30ec7047df5f51e3ee67174d20834c8c\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-9f54470c7d774c34786c9d4820c5e50f\n+f3e20d5025fb844dd0a6cd8ed36a2543\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Distributive\"#]\n-90458ec20a619b843c1bb081bd0f1f67\n+1dff1523069baa20fca88eb1ec286e15\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-e9b1ebede838fc1951c1281ec419e331\n+05ca5f5fd762ef22c8f37fe3bc8f3260\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-8920dca54430650db1672b0181edd98f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+99fd67a91a625d0976ec289825432d45\n type GDistributive :: forall {k}.\n GHC.TypeNats.Nat\n -> (* -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n class GHC.Base.Functor f => GDistributive n f repbg repbfg where\n gdistribute :: forall (x :: k).\n Data.Proxy.Proxy n -> f (repbg x) -> repbfg x\n {-# MINIMAL gdistribute #-}\n-2491bd7e90dd94f166bf1f059879eaf3\n+baf79258156c0cb96ca7b1a63727c773\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-fdb57ff2609f4e266e8f6291313bae99\n+4ef877e1d6f6ccf6ba9736828ff13e99\n fstF ::\n forall {k} (l :: k -> *) (r :: k -> *) (a :: k).\n (GHC.Generics.:*:) l r a -> l a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @l :: k -> *\n @r :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: (GHC.Generics.:*:) l r a) ->\n case ds of wild { GHC.Generics.:*: x _y -> x }]\n-39fd2b5f18a0c41e47236761d328df40\n+bc893afba0cca8da2fc2b3b9a7993a4a\n sndF ::\n forall {k} (l :: k -> *) (r :: k -> *) (a :: k).\n (GHC.Generics.:*:) l r a -> r a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.dyn_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Generics.Functor 9066\n- interface hash: fdb615802f50067b1181e4bb8c92342b\n- ABI hash: aa0cdfd634e110446d67378e55f3961e\n- export-list hash: 5181bc237f1b5142ba8064be4536aca8\n+ interface hash: 3c5b19503d7e2dde9d21bc98a7f665fc\n+ ABI hash: 99360120e66c20b7262f09cf2228859a\n+ export-list hash: eb91949418fe63f3a6a9b6b4db686fbf\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2f1607cc4dbe0d799266a78b3e363678\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GFunctor{gmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-f4b791bf586c8e644625c191396dbde7\n+2b92bf2751aeffbed9708b7d25d9c1ac\n $fGFunctorkknfg:*::*: ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n GFunctor n f g (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n@@ -68,15 +68,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-2405dfc1fe38adf034ace4cf141ff65a\n+11f8589f2aeec888fb6d011b1f3d1b65\n $fGFunctorkknfg:*::*:_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *)\n (x :: k2).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -118,15 +118,15 @@\n ($dGFunctor1\n `cast`\n (N:GFunctor[0] _N _N _N _N _N _N _N)\n @x\n pn\n h\n r1) }]\n-9d8e7e26a054f815ed8132b9526fb433\n+d517a8aef3a55fdbefe516eb6c7df25f\n $fGFunctorkknfg:+::+: ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n GFunctor n f g (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n@@ -149,15 +149,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-9869b96bbcdc20bd68cc74eb5200e88b\n+f617b957e92c6655dff1299198901e04\n $fGFunctorkknfg:+::+:_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *)\n (x :: k2).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -206,15 +206,15 @@\n ($dGFunctor1\n `cast`\n (N:GFunctor[0] _N _N _N _N _N _N _N)\n @x\n pn\n h\n r1) }]\n-02a4b73eaea9dba378844cdc79cb28af\n+ef0bb3269435f108ca21eb3bae3ff562\n $fGFunctorkknfgM1M1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (bf :: k2 -> *) (bg :: k2 -> *) i (c :: GHC.Generics.Meta).\n GFunctor n f g bf bg =>\n GFunctor n f g (GHC.Generics.M1 i c bf) (GHC.Generics.M1 i c bg)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -232,15 +232,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-e08bd691525b58b2c4069a203eb87d64\n+0d8a092245609f065c60a9899682248c\n $fGFunctorkknfgM1M1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (bf :: k2 -> *) (bg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n GFunctor n f g bf bg =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -274,15 +274,15 @@\n (\\ (x1['GHC.Types.Many] :: GHC.Generics.M1 i c bf x) ->\n f1\n x1 `cast` (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-56bc4ad28171ec052e006e1fe56ea565\n+3e1f17376a76eebfad5402dce55f8d59\n $fGFunctorkknfgRecRec ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n x.\n GFunctor\n n\n f\n g\n@@ -301,15 +301,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-bec53fedd4529550dc1382009c4103f8\n+8f746c6ef8bc472c63226df1ad7a0d66\n $fGFunctorkknfgRecRec0 ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a' :: k1) (a :: k1).\n GHC.Base.Functor h =>\n GFunctor\n n\n f\n@@ -333,15 +333,15 @@\n _N\n _N\n _N\n _N\n _N))]\n-6a012e81a3cd08041e348562648868db\n+ec0fce0aaf02bb3b762ab4bde5de33db\n $fGFunctorkknfgRecRec0_$cgmap ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a' :: k1) (a :: k1) (x :: k2).\n GHC.Base.Functor h =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> g a1)\n -> Data.Generics.GenericN.Rec (h (P n f a')) (h (f a)) x\n@@ -393,15 +393,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-7194bf5789ad73417ba03ce6894e3866\n+d4f1da9d3a69ebe06a23525b09394ea4\n $fGFunctorkknfgRecRec1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1).\n GFunctor\n n\n f\n g\n@@ -420,15 +420,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-4f2459c1161fe082ffe66b8f15d67112\n+7616277620ac98ae6792c33361602f56\n $fGFunctorkknfgRecRec1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1) (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> g a1)\n -> Data.Generics.GenericN.Rec (P n f a') (f a) x\n -> Data.Generics.GenericN.Rec (P n g a') (g a) x\n@@ -460,15 +460,15 @@\n %<'GHC.Types.Many>_N ->_R g a1>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N

_P) _N _N)]\n-788007d8b297a161b6d9301a52e0c099\n+5312ed90486599c27a625b9ba7bf576a\n $fGFunctorkknfgRecRec_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n x1 (x2 :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> Data.Generics.GenericN.Rec x1 x1 x2\n -> Data.Generics.GenericN.Rec x1 x1 x2\n@@ -481,15 +481,15 @@\n @f :: k -> *\n @g :: k -> *\n @x\n @x1 :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n GHC.Base.id @(Data.Generics.GenericN.Rec x x x1)]\n-6652b8f9206a4f44e5e53c57d525982b\n+b2b092be8f3d3361c36a8de2cfa115f3\n $fGFunctorkknfgU1U1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *).\n GFunctor n f g GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -502,15 +502,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b0d904ea69d81d1251d2233ccda8255c\n+7988f93466beeca9145738210017ce68\n $fGFunctorkknfgU1U1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -522,15 +522,15 @@\n @n :: GHC.TypeNats.Nat\n @f :: k -> *\n @g :: k -> *\n @x :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-e660c2fe611f36929e27274f1f762bc1\n+57d0a5cdb2c8474e6472eedcc1316769\n $fGFunctorkknfgV1V1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *).\n GFunctor n f g GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -543,38 +543,38 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-3ea3267f72669efeecaf9b813f49058c\n+2da24c592c8dd5fc076d15548ce244d6\n $fGFunctorkknfgV1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Functor\"#]\n-f3a09acb63e2da5ea5b3a36c34667738\n+b2036495e6b21f65775e7fea70a0023d\n $fGFunctorkknfgV1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V12]\n-c691938a8055a7c77ddb92e9930f405f\n+8c79e366645cbad38b925f9461b8e7db\n $fGFunctorkknfgV1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-c0269456c0138c54168950e0db4f55c5\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+04039e3c507aa984913f73af9e31c8c4\n $fGFunctorkknfgV1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V14]\n-7a14a66923770a97c6222289b6e47716\n+1731bbc8de7d2bd609e01725621092fa\n $fGFunctorkknfgV1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-3134c8a8db3d3c02af1a5fa4d7790c73\n+7ea4b9c5bbec6b4f035a0cb43d9f21b8\n $fGFunctorkknfgV1V1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> GHC.Generics.V1 x\n -> GHC.Generics.V1 x\n@@ -593,119 +593,119 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGFunctorkknfgV1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-b11d76df155d0a92adac7b133d6ce4ad\n+4f879a529214fedefb6886d031b12872\n $fGFunctorkknfgV1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGFunctorkknfgV1V13\n $fGFunctorkknfgV1V3\n GHC.Stack.Types.EmptyCallStack]\n-93f25da723c09e69d5e0ac3af738fadc\n+aeb3bf10d9965e77ff78a9a5ab7e1b91\n $fGFunctorkknfgV1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGFunctorkknfgV1V11\n $fGFunctorkknfgV1V9\n $fGFunctorkknfgV1V7\n $fGFunctorkknfgV1V6\n $fGFunctorkknfgV1V5\n $fGFunctorkknfgV1V6\n $fGFunctorkknfgV1V4]\n-c759ec5e94c9fbf9f4e121065a5c44d3\n+28c952da0ed3be757baa5f4f3a3e73da\n $fGFunctorkknfgV1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 25#]\n-db5c61d357aff99b382675373058eae2\n+e71ff7a36d83254aebc8a398ea988fef\n $fGFunctorkknfgV1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 16#]\n-379e7c78ca579ffc2ca4b8313ba11c98\n+36444c65f26c031682832bf01e08cc50\n $fGFunctorkknfgV1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 30#]\n-09806f352df54e97ee7080128feef411\n+04325195d00488cc45a62f72b534bef1\n $fGFunctorkknfgV1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V8]\n-b4f5d4b9dce0b4632592b713d58b4921\n+dbe90d0b44b336e177422c7d4a2eeaed\n $fGFunctorkknfgV1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Functor.hs\"#]\n-a06d30efa824723d487f2a0547544de6\n+549666392b6b81d69b4bfb31ea8070b6\n $fGFunctorkknfgV1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V10]\n-68074776ffd50298a56f8e7adbbb7f5b\n+7e46a2c5e153f3d09ef61aa93e09f276\n $tcGFunctor :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4697584212482043703#Word64\n- 3866459034889150500#Word64\n+ 17624111935747959270#Word64\n+ 2969230431485300830#Word64\n $trModule\n $tcGFunctor2\n 2#\n $tcGFunctor1]\n-4f1e8754370439832b44f9cbb5e9b6de\n+ca82f099091c9a363aa85ae5b6e3dd56\n $tcGFunctor1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-07fb834a6b86dcafeb3b780aad2b6b28\n+ebc01ec389bc064bb000c1c3d30b0572\n $tcGFunctor2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGFunctor3]\n-027ca2ef85470ee31ed038c8fbf99c12\n+158c9d82d4847133dfb71fffce26fc2f\n $tcGFunctor3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GFunctor\"#]\n-99c5888962137f981ac964ce9ebdd6fa\n+127e9e828c6cd946d3493c5bcd1d4bb3\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-00475e34d0d6cd72beda39cccc23c948\n+56f6114cc57629637d54b8f9e8fefa43\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGFunctorkknfgV1V10]\n-79a4d1d018b257b74987f544575e66e2\n+26c05980f12a4b9446c7f932f8e7fe35\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGFunctorkknfgV1V12]\n-3a671a9ebc54c98292eef95647b8cf3a\n+01d6ca3e5c45094951939d25b948175d\n type GFunctor :: forall {k} {k1}.\n GHC.TypeNats.Nat\n -> (k -> *)\n -> (k -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n -> GHC.Types.Constraint\n class GFunctor n f g repbf repbg where\n gmap :: forall (x :: k1).\n Data.Proxy.Proxy n\n -> (forall (a :: k). f a -> g a) -> repbf x -> repbg x\n {-# MINIMAL gmap #-}\n-f94e93a079a6f9433c24029e5a3aea18\n+3b94c7c508f68bc9304732a15425b760\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GFunctor [., ., ., ., ., GHC.Generics.:*:,\n GHC.Generics.:*:]\n = $fGFunctorkknfg:*::*:\n instance GFunctor [., ., ., ., ., GHC.Generics.:+:,\n GHC.Generics.:+:]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.hi", "comments": ["Files 97% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Generics.Functor 9066\n- interface hash: fdb615802f50067b1181e4bb8c92342b\n- ABI hash: aa0cdfd634e110446d67378e55f3961e\n- export-list hash: 5181bc237f1b5142ba8064be4536aca8\n+ interface hash: 3c5b19503d7e2dde9d21bc98a7f665fc\n+ ABI hash: 99360120e66c20b7262f09cf2228859a\n+ export-list hash: eb91949418fe63f3a6a9b6b4db686fbf\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2f1607cc4dbe0d799266a78b3e363678\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GFunctor{gmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-f4b791bf586c8e644625c191396dbde7\n+2b92bf2751aeffbed9708b7d25d9c1ac\n $fGFunctorkknfg:*::*: ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n GFunctor n f g (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n@@ -68,15 +68,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-2405dfc1fe38adf034ace4cf141ff65a\n+11f8589f2aeec888fb6d011b1f3d1b65\n $fGFunctorkknfg:*::*:_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *)\n (x :: k2).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -118,15 +118,15 @@\n ($dGFunctor1\n `cast`\n (N:GFunctor[0] _N _N _N _N _N _N _N)\n @x\n pn\n h\n r1) }]\n-9d8e7e26a054f815ed8132b9526fb433\n+d517a8aef3a55fdbefe516eb6c7df25f\n $fGFunctorkknfg:+::+: ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n GFunctor n f g (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n@@ -149,15 +149,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-9869b96bbcdc20bd68cc74eb5200e88b\n+f617b957e92c6655dff1299198901e04\n $fGFunctorkknfg:+::+:_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *)\n (x :: k2).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -206,15 +206,15 @@\n ($dGFunctor1\n `cast`\n (N:GFunctor[0] _N _N _N _N _N _N _N)\n @x\n pn\n h\n r1) }]\n-02a4b73eaea9dba378844cdc79cb28af\n+ef0bb3269435f108ca21eb3bae3ff562\n $fGFunctorkknfgM1M1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (bf :: k2 -> *) (bg :: k2 -> *) i (c :: GHC.Generics.Meta).\n GFunctor n f g bf bg =>\n GFunctor n f g (GHC.Generics.M1 i c bf) (GHC.Generics.M1 i c bg)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -232,15 +232,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-e08bd691525b58b2c4069a203eb87d64\n+0d8a092245609f065c60a9899682248c\n $fGFunctorkknfgM1M1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (bf :: k2 -> *) (bg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n GFunctor n f g bf bg =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -274,15 +274,15 @@\n (\\ (x1['GHC.Types.Many] :: GHC.Generics.M1 i c bf x) ->\n f1\n x1 `cast` (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-56bc4ad28171ec052e006e1fe56ea565\n+3e1f17376a76eebfad5402dce55f8d59\n $fGFunctorkknfgRecRec ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n x.\n GFunctor\n n\n f\n g\n@@ -301,15 +301,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-bec53fedd4529550dc1382009c4103f8\n+8f746c6ef8bc472c63226df1ad7a0d66\n $fGFunctorkknfgRecRec0 ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a' :: k1) (a :: k1).\n GHC.Base.Functor h =>\n GFunctor\n n\n f\n@@ -333,15 +333,15 @@\n _N\n _N\n _N\n _N\n _N))]\n-6a012e81a3cd08041e348562648868db\n+ec0fce0aaf02bb3b762ab4bde5de33db\n $fGFunctorkknfgRecRec0_$cgmap ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a' :: k1) (a :: k1) (x :: k2).\n GHC.Base.Functor h =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> g a1)\n -> Data.Generics.GenericN.Rec (h (P n f a')) (h (f a)) x\n@@ -393,15 +393,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-7194bf5789ad73417ba03ce6894e3866\n+d4f1da9d3a69ebe06a23525b09394ea4\n $fGFunctorkknfgRecRec1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1).\n GFunctor\n n\n f\n g\n@@ -420,15 +420,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-4f2459c1161fe082ffe66b8f15d67112\n+7616277620ac98ae6792c33361602f56\n $fGFunctorkknfgRecRec1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1) (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> g a1)\n -> Data.Generics.GenericN.Rec (P n f a') (f a) x\n -> Data.Generics.GenericN.Rec (P n g a') (g a) x\n@@ -460,15 +460,15 @@\n %<'GHC.Types.Many>_N ->_R g a1>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N

_P) _N _N)]\n-788007d8b297a161b6d9301a52e0c099\n+5312ed90486599c27a625b9ba7bf576a\n $fGFunctorkknfgRecRec_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n x1 (x2 :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> Data.Generics.GenericN.Rec x1 x1 x2\n -> Data.Generics.GenericN.Rec x1 x1 x2\n@@ -481,15 +481,15 @@\n @f :: k -> *\n @g :: k -> *\n @x\n @x1 :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n GHC.Base.id @(Data.Generics.GenericN.Rec x x x1)]\n-6652b8f9206a4f44e5e53c57d525982b\n+b2b092be8f3d3361c36a8de2cfa115f3\n $fGFunctorkknfgU1U1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *).\n GFunctor n f g GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -502,15 +502,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b0d904ea69d81d1251d2233ccda8255c\n+7988f93466beeca9145738210017ce68\n $fGFunctorkknfgU1U1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -522,15 +522,15 @@\n @n :: GHC.TypeNats.Nat\n @f :: k -> *\n @g :: k -> *\n @x :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-e660c2fe611f36929e27274f1f762bc1\n+57d0a5cdb2c8474e6472eedcc1316769\n $fGFunctorkknfgV1V1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *).\n GFunctor n f g GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -543,38 +543,38 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-3ea3267f72669efeecaf9b813f49058c\n+2da24c592c8dd5fc076d15548ce244d6\n $fGFunctorkknfgV1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Functor\"#]\n-f3a09acb63e2da5ea5b3a36c34667738\n+b2036495e6b21f65775e7fea70a0023d\n $fGFunctorkknfgV1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V12]\n-c691938a8055a7c77ddb92e9930f405f\n+8c79e366645cbad38b925f9461b8e7db\n $fGFunctorkknfgV1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-c0269456c0138c54168950e0db4f55c5\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+04039e3c507aa984913f73af9e31c8c4\n $fGFunctorkknfgV1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V14]\n-7a14a66923770a97c6222289b6e47716\n+1731bbc8de7d2bd609e01725621092fa\n $fGFunctorkknfgV1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-3134c8a8db3d3c02af1a5fa4d7790c73\n+7ea4b9c5bbec6b4f035a0cb43d9f21b8\n $fGFunctorkknfgV1V1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> GHC.Generics.V1 x\n -> GHC.Generics.V1 x\n@@ -593,119 +593,119 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGFunctorkknfgV1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-b11d76df155d0a92adac7b133d6ce4ad\n+4f879a529214fedefb6886d031b12872\n $fGFunctorkknfgV1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGFunctorkknfgV1V13\n $fGFunctorkknfgV1V3\n GHC.Stack.Types.EmptyCallStack]\n-93f25da723c09e69d5e0ac3af738fadc\n+aeb3bf10d9965e77ff78a9a5ab7e1b91\n $fGFunctorkknfgV1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGFunctorkknfgV1V11\n $fGFunctorkknfgV1V9\n $fGFunctorkknfgV1V7\n $fGFunctorkknfgV1V6\n $fGFunctorkknfgV1V5\n $fGFunctorkknfgV1V6\n $fGFunctorkknfgV1V4]\n-c759ec5e94c9fbf9f4e121065a5c44d3\n+28c952da0ed3be757baa5f4f3a3e73da\n $fGFunctorkknfgV1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 25#]\n-db5c61d357aff99b382675373058eae2\n+e71ff7a36d83254aebc8a398ea988fef\n $fGFunctorkknfgV1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 16#]\n-379e7c78ca579ffc2ca4b8313ba11c98\n+36444c65f26c031682832bf01e08cc50\n $fGFunctorkknfgV1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 30#]\n-09806f352df54e97ee7080128feef411\n+04325195d00488cc45a62f72b534bef1\n $fGFunctorkknfgV1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V8]\n-b4f5d4b9dce0b4632592b713d58b4921\n+dbe90d0b44b336e177422c7d4a2eeaed\n $fGFunctorkknfgV1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Functor.hs\"#]\n-a06d30efa824723d487f2a0547544de6\n+549666392b6b81d69b4bfb31ea8070b6\n $fGFunctorkknfgV1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V10]\n-68074776ffd50298a56f8e7adbbb7f5b\n+7e46a2c5e153f3d09ef61aa93e09f276\n $tcGFunctor :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4697584212482043703#Word64\n- 3866459034889150500#Word64\n+ 17624111935747959270#Word64\n+ 2969230431485300830#Word64\n $trModule\n $tcGFunctor2\n 2#\n $tcGFunctor1]\n-4f1e8754370439832b44f9cbb5e9b6de\n+ca82f099091c9a363aa85ae5b6e3dd56\n $tcGFunctor1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-07fb834a6b86dcafeb3b780aad2b6b28\n+ebc01ec389bc064bb000c1c3d30b0572\n $tcGFunctor2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGFunctor3]\n-027ca2ef85470ee31ed038c8fbf99c12\n+158c9d82d4847133dfb71fffce26fc2f\n $tcGFunctor3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GFunctor\"#]\n-99c5888962137f981ac964ce9ebdd6fa\n+127e9e828c6cd946d3493c5bcd1d4bb3\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-00475e34d0d6cd72beda39cccc23c948\n+56f6114cc57629637d54b8f9e8fefa43\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGFunctorkknfgV1V10]\n-79a4d1d018b257b74987f544575e66e2\n+26c05980f12a4b9446c7f932f8e7fe35\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGFunctorkknfgV1V12]\n-3a671a9ebc54c98292eef95647b8cf3a\n+01d6ca3e5c45094951939d25b948175d\n type GFunctor :: forall {k} {k1}.\n GHC.TypeNats.Nat\n -> (k -> *)\n -> (k -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n -> GHC.Types.Constraint\n class GFunctor n f g repbf repbg where\n gmap :: forall (x :: k1).\n Data.Proxy.Proxy n\n -> (forall (a :: k). f a -> g a) -> repbf x -> repbg x\n {-# MINIMAL gmap #-}\n-f94e93a079a6f9433c24029e5a3aea18\n+3b94c7c508f68bc9304732a15425b760\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GFunctor [., ., ., ., ., GHC.Generics.:*:,\n GHC.Generics.:*:]\n = $fGFunctorkknfg:*::*:\n instance GFunctor [., ., ., ., ., GHC.Generics.:+:,\n GHC.Generics.:+:]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Generics.Traversable 9066\n- interface hash: ce6aa5b7b64298d49982d5590c3380c2\n- ABI hash: fcc5069525cb18eabc5ee2f6d115ed72\n- export-list hash: e191cdaf49853917f8b7debdfa6d86ad\n+ interface hash: 82926fb4fe68ba327c12a36f4351339b\n+ ABI hash: 7ee4a8d101ceda4ac9aab730f3d525a0\n+ export-list hash: 689c061279ca4cd1721cb64d922cf03b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: b24a144faf0a42ecdffc6be1d6318598\n+ flag hash: b8596bdafa116f46285165b129defa59\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 8fe13908cdf66de9b935452c32184ad0\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GTraversable{gtraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-6777ac4a135ba9b89e8a2e1ccf7fc8ac\n+e21475d4f900c3e32547a464395b13a1\n $fGTraversableNaturalkknfgRecRec ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1).\n Data.Traversable.Traversable h =>\n GTraversable\n n\n f\n@@ -71,15 +71,15 @@\n _N\n _N\n _N\n _N\n _N))]\n-ddd66dd411b8df69b2799c5e661bc279\n+30bdf450919817ba1241ad6664b3ffb0\n $fGTraversableNaturalkknfgRecRec0 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1).\n GTraversable\n n\n f\n g\n@@ -100,15 +100,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-0f003c64f920b60defaa97cb5a47956b\n+8c6ea6a47824dc31200f80b2d7c22ea4\n $fGTraversableNaturalkknfgRecRec0_$cgtraverse ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1) (t :: * -> *) (x :: k2).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec (P n f a') (f a) x\n@@ -150,15 +150,15 @@\n f1\n (eta1\n @a\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N

_P _N _N\n ; GHC.Generics.N:K1[0] _N _P _R _P))]\n-87e966b4f9506d30c01cac98a309989e\n+76ebab23430d084cb088ebe209d4bc45\n $fGTraversableNaturalkknfgRecRec_$cgtraverse ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec (h (P n f a)) (h (f a)) x\n@@ -214,15 +214,15 @@\n (f2\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-e1883c68e23a707df140600d0bd2730d\n+95a0c7b00e286fd21fb2ff7e8bdde002\n $fGTraversablekkknfg:*::*: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *).\n (GTraversable n f g l l', GTraversable n f g r r') =>\n GTraversable n f g (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -245,15 +245,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-d5eb1cd54319782e52ece88358d0abc7\n+25501a0b50cd9985af583d905ae74f83\n $fGTraversablekkknfg:*::*:_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g l l', GTraversable n f g r r',\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n@@ -311,15 +311,15 @@\n _N _N _N _N _N _N _N _N)\n @t\n @x\n $dApplicative\n eta\n eta1\n r1) }]\n-d527caac9ef0ec00e817692eb2e67fcc\n+9d8d7c1df80fef4c2ba0fa7abc442739\n $fGTraversablekkknfg:+::+: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *).\n (GTraversable n f g l l', GTraversable n f g r r') =>\n GTraversable n f g (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -342,15 +342,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-f4e6effc53529edce089fb9d7c400b1b\n+8cbe09539f6df18dd005c6dc96710f6d\n $fGTraversablekkknfg:+::+:_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g l l', GTraversable n f g r r',\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n@@ -412,15 +412,15 @@\n _N _N _N _N _N _N _N _N)\n @t\n @x\n $dApplicative\n eta\n eta1\n r1) }]\n-21707f91d6e6e6a82dea7bc48538d9e8\n+64410b2cc54ef24e988a6bc31868c39a\n $fGTraversablekkknfgM1M1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (bf :: k3 -> *) (bg :: k3 -> *) i (c :: GHC.Generics.Meta).\n GTraversable n f g bf bg =>\n GTraversable\n n f g (GHC.Generics.M1 i c bf) (GHC.Generics.M1 i c bg)\n DFunId\n@@ -441,15 +441,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b5658d93d7501f02a4cda448ff52127c\n+a9a764ae510c2088d338f14800d294b8\n $fGTraversablekkknfgM1M1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (bf :: k3 -> *) (bg :: k3 -> *) i (c :: GHC.Generics.Meta)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g bf bg, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n@@ -500,15 +500,15 @@\n eta\n eta1\n } in\n \\ (x1['GHC.Types.Many] :: GHC.Generics.M1 i c bf x) ->\n f1\n (f2\n x1 `cast` (GHC.Generics.N:M1[0] _N _P _P _R _N))]\n-6394da7bc6c3c5dda000ac648d790304\n+1be03e3973e180ac21c95ef2f44bcf0b\n $fGTraversablekkknfgRecRec ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) a.\n GTraversable\n n\n f\n g\n (Data.Generics.GenericN.Rec a a)\n@@ -527,15 +527,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-c622e7ab0aad377b08fa3e464749d9ec\n+50724905b2618369af4832a39b7be2f9\n $fGTraversablekkknfgRecRec_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) a\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k2). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec a a x\n@@ -552,15 +552,15 @@\n @a\n @t :: * -> *\n @x :: k2\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative t)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a1 :: k1). f a1 -> t (g a1)) ->\n GHC.Base.pure @t $dApplicative @(Data.Generics.GenericN.Rec a a x)]\n-a9652e5119a5516923dcc0f8accefac4\n+c82a456562d2dac1a69ddb473a3c31a4\n $fGTraversablekkknfgU1U1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GTraversable n f g GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1L,A,A,A,A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -574,15 +574,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-dc37c8d7ccf2feb9ff878923464a0b83\n+1864b74b840e21d9561263170576b17f\n $fGTraversablekkknfgU1U1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n -> GHC.Generics.U1 x\n@@ -598,15 +598,15 @@\n @g :: k1 -> *\n @t :: * -> *\n @x :: k2\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative t)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k1). f a -> t (g a)) ->\n GHC.Base.pure @t $dApplicative @(GHC.Generics.U1 x)]\n-38f8c09aca457f737ebea55fad67b136\n+1bfc3a8de3b4d7a62884aa813952830a\n $fGTraversablekkknfgV1V1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GTraversable n f g GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -620,15 +620,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-617c7d01c3eb04b0e4a686be7b1039fc\n+f1075d80c1c4af77a14e3d481b431a10\n $fGTraversablekkknfgV1V1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n -> GHC.Generics.V1 x\n@@ -658,15 +658,15 @@\n (\\ @b -> GHC.CString.unpackFoldrCString# @b \"undefined\"#))\n (GHC.Stack.Types.SrcLoc\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString#\n @b\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#))\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#))\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString#\n @b\n \"Barbies.Generics.Traversable\"#))\n (GHC.Base.build\n@@ -679,78 +679,78 @@\n (GHC.Types.I# 21#)\n (GHC.Types.I# 32#)\n (GHC.Types.I# 30#))\n GHC.Stack.Types.EmptyCallStack)\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-2048cfc731cef46a4f97ae83c3e74816\n+489b0617e906d9eed74ea50f1a13b261\n $tcGTraversable :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 16602354247371775265#Word64\n- 3123105163253640060#Word64\n+ 16683089016182270559#Word64\n+ 3559867911118579067#Word64\n $trModule\n $tcGTraversable2\n 3#\n $tcGTraversable1]\n-a021ed4dcc30364f420aa67e15433824\n+c9ac6ca9e7f30eb55d57ef9f6589db2c\n $tcGTraversable1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ffa7acff0a799b58945993d650dc9524\n+62633e81bfaa96a0068535f40a1d1522\n $tcGTraversable2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGTraversable3]\n-f36a0ee9d4bf5365e3172500e75584e8\n+8cefdc200d59f0f837bc81858be44a9c\n $tcGTraversable3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GTraversable\"#]\n-add60015671bb86a7fc5bb871f08fa46\n+31ab1a25810ca41c91ce6d5899bf81eb\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-025920c1c5b59cd9ba57058e7e0b4068\n+87c0a3c4a1af34fd62ab6256825f30a0\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-e666b80a4c0746ce3ce196e95bd89ba5\n+20bbc8306c1e901f7e63c0f474cac6ce\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Traversable\"#]\n-a2961c009d5b554dc8bc6d1fe8ce5b27\n+00b6f3d76db51dc5cc4aa3f124bc4b04\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-34aa6482c16e6d20a36e4cdf8f3ad621\n+0a97cbc0a112ff9a0519a48c02301b02\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-1180a3c086dfc51eda564a1727916603\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+f7816c2f9a39d58706aba55efd6f45bc\n type GTraversable :: forall {k} {k1} {k2}.\n k\n -> (k1 -> *)\n -> (k1 -> *)\n -> (k2 -> *)\n -> (k2 -> *)\n -> GHC.Types.Constraint\n class GTraversable n f g repbf repbg where\n gtraverse :: forall (t :: * -> *) (x :: k2).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> t (g a)) -> repbf x -> t (repbg x)\n {-# MINIMAL gtraverse #-}\n-358232dbea30fa1abde988b559c1e083\n+a60b7c4e68032a07b76370a7ea160370\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GTraversable [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec]\n = $fGTraversableNaturalkknfgRecRec\n instance GTraversable [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.dyn_hi", "comments": ["Files 95% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Generics.Traversable 9066\n- interface hash: ce6aa5b7b64298d49982d5590c3380c2\n- ABI hash: fcc5069525cb18eabc5ee2f6d115ed72\n- export-list hash: e191cdaf49853917f8b7debdfa6d86ad\n+ interface hash: 82926fb4fe68ba327c12a36f4351339b\n+ ABI hash: 7ee4a8d101ceda4ac9aab730f3d525a0\n+ export-list hash: 689c061279ca4cd1721cb64d922cf03b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: b8596bdafa116f46285165b129defa59\n+ flag hash: b24a144faf0a42ecdffc6be1d6318598\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 8fe13908cdf66de9b935452c32184ad0\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GTraversable{gtraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-6777ac4a135ba9b89e8a2e1ccf7fc8ac\n+e21475d4f900c3e32547a464395b13a1\n $fGTraversableNaturalkknfgRecRec ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1).\n Data.Traversable.Traversable h =>\n GTraversable\n n\n f\n@@ -71,15 +71,15 @@\n _N\n _N\n _N\n _N\n _N))]\n-ddd66dd411b8df69b2799c5e661bc279\n+30bdf450919817ba1241ad6664b3ffb0\n $fGTraversableNaturalkknfgRecRec0 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1).\n GTraversable\n n\n f\n g\n@@ -100,15 +100,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-0f003c64f920b60defaa97cb5a47956b\n+8c6ea6a47824dc31200f80b2d7c22ea4\n $fGTraversableNaturalkknfgRecRec0_$cgtraverse ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1) (t :: * -> *) (x :: k2).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec (P n f a') (f a) x\n@@ -150,15 +150,15 @@\n f1\n (eta1\n @a\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N

_P _N _N\n ; GHC.Generics.N:K1[0] _N _P _R _P))]\n-87e966b4f9506d30c01cac98a309989e\n+76ebab23430d084cb088ebe209d4bc45\n $fGTraversableNaturalkknfgRecRec_$cgtraverse ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec (h (P n f a)) (h (f a)) x\n@@ -214,15 +214,15 @@\n (f2\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-e1883c68e23a707df140600d0bd2730d\n+95a0c7b00e286fd21fb2ff7e8bdde002\n $fGTraversablekkknfg:*::*: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *).\n (GTraversable n f g l l', GTraversable n f g r r') =>\n GTraversable n f g (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -245,15 +245,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-d5eb1cd54319782e52ece88358d0abc7\n+25501a0b50cd9985af583d905ae74f83\n $fGTraversablekkknfg:*::*:_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g l l', GTraversable n f g r r',\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n@@ -311,15 +311,15 @@\n _N _N _N _N _N _N _N _N)\n @t\n @x\n $dApplicative\n eta\n eta1\n r1) }]\n-d527caac9ef0ec00e817692eb2e67fcc\n+9d8d7c1df80fef4c2ba0fa7abc442739\n $fGTraversablekkknfg:+::+: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *).\n (GTraversable n f g l l', GTraversable n f g r r') =>\n GTraversable n f g (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -342,15 +342,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-f4e6effc53529edce089fb9d7c400b1b\n+8cbe09539f6df18dd005c6dc96710f6d\n $fGTraversablekkknfg:+::+:_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g l l', GTraversable n f g r r',\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n@@ -412,15 +412,15 @@\n _N _N _N _N _N _N _N _N)\n @t\n @x\n $dApplicative\n eta\n eta1\n r1) }]\n-21707f91d6e6e6a82dea7bc48538d9e8\n+64410b2cc54ef24e988a6bc31868c39a\n $fGTraversablekkknfgM1M1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (bf :: k3 -> *) (bg :: k3 -> *) i (c :: GHC.Generics.Meta).\n GTraversable n f g bf bg =>\n GTraversable\n n f g (GHC.Generics.M1 i c bf) (GHC.Generics.M1 i c bg)\n DFunId\n@@ -441,15 +441,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b5658d93d7501f02a4cda448ff52127c\n+a9a764ae510c2088d338f14800d294b8\n $fGTraversablekkknfgM1M1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (bf :: k3 -> *) (bg :: k3 -> *) i (c :: GHC.Generics.Meta)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g bf bg, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n@@ -500,15 +500,15 @@\n eta\n eta1\n } in\n \\ (x1['GHC.Types.Many] :: GHC.Generics.M1 i c bf x) ->\n f1\n (f2\n x1 `cast` (GHC.Generics.N:M1[0] _N _P _P _R _N))]\n-6394da7bc6c3c5dda000ac648d790304\n+1be03e3973e180ac21c95ef2f44bcf0b\n $fGTraversablekkknfgRecRec ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) a.\n GTraversable\n n\n f\n g\n (Data.Generics.GenericN.Rec a a)\n@@ -527,15 +527,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-c622e7ab0aad377b08fa3e464749d9ec\n+50724905b2618369af4832a39b7be2f9\n $fGTraversablekkknfgRecRec_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) a\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k2). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec a a x\n@@ -552,15 +552,15 @@\n @a\n @t :: * -> *\n @x :: k2\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative t)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a1 :: k1). f a1 -> t (g a1)) ->\n GHC.Base.pure @t $dApplicative @(Data.Generics.GenericN.Rec a a x)]\n-a9652e5119a5516923dcc0f8accefac4\n+c82a456562d2dac1a69ddb473a3c31a4\n $fGTraversablekkknfgU1U1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GTraversable n f g GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1L,A,A,A,A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -574,15 +574,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-dc37c8d7ccf2feb9ff878923464a0b83\n+1864b74b840e21d9561263170576b17f\n $fGTraversablekkknfgU1U1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n -> GHC.Generics.U1 x\n@@ -598,15 +598,15 @@\n @g :: k1 -> *\n @t :: * -> *\n @x :: k2\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative t)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k1). f a -> t (g a)) ->\n GHC.Base.pure @t $dApplicative @(GHC.Generics.U1 x)]\n-38f8c09aca457f737ebea55fad67b136\n+1bfc3a8de3b4d7a62884aa813952830a\n $fGTraversablekkknfgV1V1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GTraversable n f g GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -620,15 +620,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-617c7d01c3eb04b0e4a686be7b1039fc\n+f1075d80c1c4af77a14e3d481b431a10\n $fGTraversablekkknfgV1V1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n -> GHC.Generics.V1 x\n@@ -658,15 +658,15 @@\n (\\ @b -> GHC.CString.unpackFoldrCString# @b \"undefined\"#))\n (GHC.Stack.Types.SrcLoc\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString#\n @b\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#))\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#))\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString#\n @b\n \"Barbies.Generics.Traversable\"#))\n (GHC.Base.build\n@@ -679,78 +679,78 @@\n (GHC.Types.I# 21#)\n (GHC.Types.I# 32#)\n (GHC.Types.I# 30#))\n GHC.Stack.Types.EmptyCallStack)\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-2048cfc731cef46a4f97ae83c3e74816\n+489b0617e906d9eed74ea50f1a13b261\n $tcGTraversable :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 16602354247371775265#Word64\n- 3123105163253640060#Word64\n+ 16683089016182270559#Word64\n+ 3559867911118579067#Word64\n $trModule\n $tcGTraversable2\n 3#\n $tcGTraversable1]\n-a021ed4dcc30364f420aa67e15433824\n+c9ac6ca9e7f30eb55d57ef9f6589db2c\n $tcGTraversable1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ffa7acff0a799b58945993d650dc9524\n+62633e81bfaa96a0068535f40a1d1522\n $tcGTraversable2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGTraversable3]\n-f36a0ee9d4bf5365e3172500e75584e8\n+8cefdc200d59f0f837bc81858be44a9c\n $tcGTraversable3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GTraversable\"#]\n-add60015671bb86a7fc5bb871f08fa46\n+31ab1a25810ca41c91ce6d5899bf81eb\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-025920c1c5b59cd9ba57058e7e0b4068\n+87c0a3c4a1af34fd62ab6256825f30a0\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-e666b80a4c0746ce3ce196e95bd89ba5\n+20bbc8306c1e901f7e63c0f474cac6ce\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Traversable\"#]\n-a2961c009d5b554dc8bc6d1fe8ce5b27\n+00b6f3d76db51dc5cc4aa3f124bc4b04\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-34aa6482c16e6d20a36e4cdf8f3ad621\n+0a97cbc0a112ff9a0519a48c02301b02\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-1180a3c086dfc51eda564a1727916603\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+f7816c2f9a39d58706aba55efd6f45bc\n type GTraversable :: forall {k} {k1} {k2}.\n k\n -> (k1 -> *)\n -> (k1 -> *)\n -> (k2 -> *)\n -> (k2 -> *)\n -> GHC.Types.Constraint\n class GTraversable n f g repbf repbg where\n gtraverse :: forall (t :: * -> *) (x :: k2).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> t (g a)) -> repbf x -> t (repbg x)\n {-# MINIMAL gtraverse #-}\n-358232dbea30fa1abde988b559c1e083\n+a60b7c4e68032a07b76370a7ea160370\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GTraversable [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec]\n = $fGTraversableNaturalkknfgRecRec\n instance GTraversable [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Internal.ApplicativeB [orphan module] 9066\n- interface hash: c9c49ccabbe11f64d40ed189604d541d\n- ABI hash: e5cbf75378603efe606ed1f1840012d6\n- export-list hash: e3a321ef54b6defc2ff4748a1a8a8e79\n- orphan hash: 3fce78e7340652cf0baa33ec783799a9\n- flag hash: 085b3a61e9b81acb219ec58be19ba44b\n+ interface hash: b883bdb22f342229bc0fe5635cc1c53b\n+ ABI hash: 5709ad0696978cf932c7a3d3d373a4b3\n+ export-list hash: 132a656254f5cd59e5dc816b66e09234\n+ orphan hash: 2871b5f4bfa6da85feabcf079c3ea65a\n+ flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: e3ec953c6cc2f924446c95503f2a7a47\n sig of: Nothing\n used TH splices: False\n where\n@@ -23,69 +23,69 @@\n bzipWith\n bzipWith3\n bzipWith4\n gbprodDefault\n gbpureDefault\n ApplicativeB{bprod bpure}\n CanDeriveApplicativeB\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative cd6b2d8adddf9a2d3767a33a685f152d\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 3ced52b07609826cc929119e22540509\n- gprod c71396a7069c38d58d587ea97a10c328\n- gpure 2bc47c1626a359c82f3a6419b23cc52b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative c8c35967a74c18c83413193270a3b945\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative d65021a3af56c65b54997d660d8ab228\n+ gprod ffbaa052989faf6975b219d8a2f318e5\n+ gpure bda06dd713e6eb2b4a59075d90b838b2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-bd342948198775d381943ce7e3978aa8\n+acc19690cc4df68ed3c0fc085142b836\n $dmbprod ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (ApplicativeB b, CanDeriveApplicativeB b f g) =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n \\ @k\n @b :: (k -> *) -> *\n ($dApplicativeB['GHC.Types.Many] :: ApplicativeB b)\n @f :: k -> *\n @g :: k -> *\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveApplicativeB b f g) ->\n gbprodDefault @k @b @f @g $d(%,,,%)]\n-a9bef41da2b92b91db49fc038a223e19\n+fbb27043688771a6062e5f2b2769e9b3\n $dmbpure ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (ApplicativeB b, CanDeriveApplicativeB b f f) =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -314,30 +314,30 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))) _N)]\n-f15dd9b5e99074eed4afa0a8288d1ed0\n+4a724543e2d392c3830f52c107108515\n $fApplicativeBkConst ::\n GHC.Base.Monoid a => ApplicativeB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k @a (v['GHC.Types.Many] :: GHC.Base.Monoid a).\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkConst_$cbpure @k @a v)\n ($fApplicativeBkConst_$cbprod @k @a v)]\n-660869d8fe03ac4c3a5e21330344aae2\n+2669d805c61e95c58bda714c29a4dac3\n $fApplicativeBkConst_$cbprod ::\n forall k a (f :: k -> *) (g :: k -> *).\n GHC.Base.Monoid a =>\n Data.Functor.Const.Const a f\n -> Data.Functor.Const.Const a g\n -> Data.Functor.Const.Const a (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -363,15 +363,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-d159b41983c7b0ed19b2db4991e4f801\n+efac6c5b66a2dd483c2e34bec80df9fa\n $fApplicativeBkConst_$cbpure ::\n forall k a (f :: k -> *).\n GHC.Base.Monoid a =>\n (forall (a1 :: k). f a1) -> Data.Functor.Const.Const a f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1L,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -386,15 +386,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-40a2079964f88dc4cdf49ae1ddbaf417\n+01a8b0df8f873886302b05b6258dd1c5\n $fApplicativeBkConstant ::\n GHC.Base.Monoid a =>\n ApplicativeB (Data.Functor.Constant.Constant a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k @a (v['GHC.Types.Many] :: GHC.Base.Monoid a).\n@@ -402,15 +402,15 @@\n @(Data.Functor.Constant.Constant a)\n (Barbies.Internal.FunctorB.$fFunctorBkConstant_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkConstant_$cbpure @k @a v)\n ($fApplicativeBkConstant_$cbprod @k @a v)]\n-5439fb95b3f4082ff66eb81e8aaf9e46\n+6524e0f276a01b2c0d67f9f814c7fd47\n $fApplicativeBkConstant_$cbprod ::\n forall k a (f :: k -> *) (g :: k -> *).\n GHC.Base.Monoid a =>\n Data.Functor.Constant.Constant a f\n -> Data.Functor.Constant.Constant a g\n -> Data.Functor.Constant.Constant\n a (Data.Functor.Product.Product f g)\n@@ -442,15 +442,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Constant.N:Constant[0]\n *>_N\n _R\n _P))]\n-93f5ff52875376b4ee9e08dd7ed8ded8\n+197cfd2b23516336d69f373481dc2d8d\n $fApplicativeBkConstant_$cbpure ::\n forall k a (f :: k -> *).\n GHC.Base.Monoid a =>\n (forall (a1 :: k). f a1) -> Data.Functor.Constant.Constant a f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1L,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -465,15 +465,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Constant.N:Constant[0]\n *>_N\n _R\n _P))]\n-f6da0faed345778a5227597cd46f18eb\n+464089d3a55e592eeaa03a7985d6e445\n $fApplicativeBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ApplicativeB a, ApplicativeB b) =>\n ApplicativeB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -488,15 +488,15 @@\n @(Data.Functor.Product.Product a b)\n ($fApplicativeBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkProduct_$cbpure @k @a @b v v1)\n ($fApplicativeBkProduct_$cbprod @k @a @b v v1)]\n-dd678495d92b4219e6c63a09564e4d47\n+f47aeb603ca13613ed22ad9fa8e5e19a\n $fApplicativeBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -530,15 +530,15 @@\n (($p1ApplicativeB @k @b $dApplicativeB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-3d660815d1da8d72bb49466d3e8c428e\n+e34f611e792f34e3c517a5a6baeaa8c9\n $fApplicativeBkProduct_$cbprod ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n -> Data.Functor.Product.Product\n@@ -562,15 +562,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @(Data.Functor.Product.Product f g)\n (bprod @k @a $dApplicativeB @f @g ll rl)\n (bprod @k @b $dApplicativeB1 @f @g lr rr) } }]\n-8f080a3243309d4f35f3df5f8d0407d7\n+ffac108bc106d42f78c109bfca218bd1\n $fApplicativeBkProduct_$cbpure ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n (forall (a1 :: k). f a1) -> Data.Functor.Product.Product a b f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=1),\n@@ -585,53 +585,53 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @f\n (bpure @k @a $dApplicativeB @f x)\n (bpure @k @b $dApplicativeB1 @f x)]\n-6eb0bcca2c7afcdef30743c2488d056b\n+5eeef2283a5bf1d508eafaa548d93439\n $fApplicativeBkProxy :: ApplicativeB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ApplicativeB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkProxy_$cbpure @k)\n ($fApplicativeBkProxy_$cbprod @k)]\n-7e7b45a4e0013b9c299b43f52c53bbe1\n+55cbc114f4c42efd8c30c6725970347c\n $fApplicativeBkProxy_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Proxy.Proxy (Data.Functor.Product.Product f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Product.Product f g)]\n-8e5672123880c54764f7dcdad4741eed\n+ac30f093658c169b9b7f964bf875b928\n $fApplicativeBkProxy_$cbpure ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Data.Proxy.Proxy f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Data.Proxy.Proxy @(k -> *) @f]\n-c0edb25d60a66e655517af23b538e3d7\n+748864c1ab60c61381a26ad99dc9c5ea\n $fGApplicativeNaturalk1k0fgRecRecRec ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b) =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n@@ -685,15 +685,15 @@\n @m\n @b\n @f\n @g\n v\n v1\n v2)]\n-d55fa40c27133ecd1a443eecc2a12f34\n+d8b1586349b7a4e79c6c66c4466c9c51\n $fGApplicativeNaturalk1k0fgRecRecRec0 ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (GHC.Base.Applicative h, ApplicativeB b) =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n@@ -741,15 +741,15 @@\n @k1\n @h\n @b\n @f\n @g\n v\n v1)]\n-664ddc8bc3fd361e51b0ae9a838dfad4\n+b430351fc5bca69836994e4d6e1b88e0\n $fGApplicativeNaturalk1k0fgRecRecRec0_$cgprod ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, ApplicativeB b) =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -828,15 +828,15 @@\n _N\n _P) _N _N)]\n-8a089bb2ac9c464324ed33ae7ae0b5ae\n+87ee43778e7f65875112c6e703a03648\n $fGApplicativeNaturalk1k0fgRecRecRec0_$cgpure ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, ApplicativeB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (b (P 0 f))) (h (b f))\n GHC.Types.~ Data.Generics.GenericN.Rec\n (h (b (P 0 g))) (h (b g))) =>\n@@ -916,15 +916,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-b99388d79fe7b692cee1f3fa1dc111f5\n+47c3fe8e1f44e9449a9c1e6f7b75a8f7\n $fGApplicativeNaturalk1k0fgRecRecRec1 ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n@@ -952,15 +952,15 @@\n @(Data.Generics.GenericN.Rec (b (P 0 f)) (b f))\n @(Data.Generics.GenericN.Rec (b (P 0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b (P 0 (Data.Functor.Product.Product f g)))\n (b (Data.Functor.Product.Product f g)))\n ($fGApplicativeNaturalk1k0fgRecRecRec1_$cgprod @k @k1 @b @f @g v)\n ($fGApplicativeNaturalk1k0fgRecRecRec1_$cgpure @k @k1 @b @f @g v)]\n-10e5a21edfddc45aa0f6ccba58f0b7e8\n+ddded303d55691fd839df5853348e7ef\n $fGApplicativeNaturalk1k0fgRecRecRec1_$cgprod ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k1).\n ApplicativeB b =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1025,15 +1025,15 @@\n _N\n _P) _N _N)]\n-056a947ef34e1edd42389d990c0f30bc\n+2fd86ea4b182d043263a324e2d03f57a\n $fGApplicativeNaturalk1k0fgRecRecRec1_$cgpure ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k1).\n (ApplicativeB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (b (P 0 f)) (b f)\n GHC.Types.~ Data.Generics.GenericN.Rec (b (P 0 g)) (b g)) =>\n Data.Proxy.Proxy 0\n@@ -1100,15 +1100,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-8fc0b6ba24377d04a3c5f14c82c5b8b0\n+5bb2035e41a48308fd6c8f15e1502010\n $fGApplicativeNaturalk1k0fgRecRecRec_$cgprod ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b) =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1212,15 +1212,15 @@\n _N\n _P) _N _N)]\n-fa1dc756bc05088d63857da30787db80\n+0e1fa952d3a9ddb0e15f4270ce3894e2\n $fGApplicativeNaturalk1k0fgRecRecRec_$cgpure ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b,\n f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (m (h (b (P 0 f)))) (m (h (b f)))\n GHC.Types.~ Data.Generics.GenericN.Rec\n@@ -1311,77 +1311,77 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-5d46cdd99f680884369663710823eba4\n+2d0d725ae3c73d0e9ce1ab6f42a10ad9\n $tcApplicativeB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12947307924732368312#Word64\n- 18371083973462631636#Word64\n+ 16423447268799648649#Word64\n+ 15497646768975084827#Word64\n $trModule\n $tcApplicativeB2\n 1#\n $tcApplicativeB1]\n-de490ec25de8684f665bca0cb71a2a6d\n+4aac118f1a79edd7b4f26a65a3806e89\n $tcApplicativeB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ad2a793451ba1d2cec69f4ce975f8fc3\n+bb41a43844490fe0300e4f8d05feaa3b\n $tcApplicativeB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcApplicativeB3]\n-b37bbdcab1db0d786b21e5a3cc4ef582\n+d48fffa80e9c28a74d53ce38dc63fb81\n $tcApplicativeB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ApplicativeB\"#]\n-f953dc8d5b36d24c0e2e7ef5c921274a\n+067fde38a85d1a127b2e6c503bdd3e2d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-1b19fe21bc12f523332490b874316c3b\n+e8f65c4291dda5909b4066205b0d3731\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-59448607c9b3d1cd8979e10eab2c2bd2\n+2f81709c770e0386fb81c1fbdb897e65\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ApplicativeB\"#]\n-65af7fb9ef4ff25139adc417b47f7be0\n+e632744fe7645099f1d46d2467fd06e6\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-62fd23dd485c83e5c0d9a89ea3be0a93\n+8a146c282b70b036e99a4f55dd9e3456\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-da36390c3794afb8c2320e10e019f6a0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+085305c56ddc98892210f57460e0a6ea\n type ApplicativeB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => ApplicativeB b where\n bpure :: forall (f :: k -> *). (forall (a :: k). f a) -> b f\n default bpure :: forall (f :: k -> *).\n CanDeriveApplicativeB b f f =>\n (forall (a :: k). f a) -> b f\n bprod :: forall (f :: k -> *) (g :: k -> *).\n b f -> b g -> b (Data.Functor.Product.Product f g)\n default bprod :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveApplicativeB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n-b61bc228653760157a606b23571c88ec\n+8a4842373f69f720223ec1f5884a1cf2\n type CanDeriveApplicativeB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveApplicativeB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Data.Generics.GenericN.GenericP\n 0 (b (Data.Functor.Product.Product f g)),\n@@ -1390,18 +1390,18 @@\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g))\n (Data.Generics.GenericN.RepP\n 0 (b (Data.Functor.Product.Product f g))))\n :: GHC.Types.Constraint\n-311d5995443cedd969c502ffd614f139\n+4060f178106d02a10e919c580f7f0818\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-55485ecb89cfc48f959276abf53138b6\n+08f36433607586faeeb884eb3863272f\n bunzip ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n b (Data.Functor.Product.Product f g) -> (b f, b g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueFalse>\n@@ -1425,55 +1425,55 @@\n $dFunctorB\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @(Data.Functor.Product.Product f g)\n @g\n (bunzip1 @k @f @g)\n eta)]\n-decd43b36f6dfa3355042a3e13a72698\n+c10b19d656fe05eeb19f7a6cb454a9fc\n bunzip1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 b -> b }]\n-71fe1f4deb8b67cc487e3d40eb3ab6d1\n+0d17ffa5995665071db47789b96f5d14\n bunzip2 ::\n forall {k} {g :: k -> *} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @g :: k -> *\n @f :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair a1 ds1 -> a1 }]\n-a2112f05775fc9da652845f2152de290\n+d545e7ab39c9242dfddedef227364f2d\n bzip ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(A,A,1L)>,\n Unfolding: Core: \n \\ @k\n @b :: (k -> *) -> *\n @f :: k -> *\n @g :: k -> *\n ($dApplicativeB['GHC.Types.Many] :: ApplicativeB b) ->\n bprod @k @b $dApplicativeB @f @g]\n-f55c10be3a14621f3eb32055001f484a\n+b39181fa2c8191904967f5c9a9668fe9\n bzipWith ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a) -> b f -> b g -> b h\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1493,15 +1493,15 @@\n @(Data.Functor.Product.Product f g)\n @h\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair fa ga ->\n eta @a fa ga })\n (bprod @k @b $dApplicativeB @f @g eta1 eta2)]\n-ecb23b1e853065db90edbdd50d45dde9\n+c2cd418448529a1101125fdb0fb6eef0\n bzipWith3 ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a -> i a)\n -> b f -> b g -> b h -> b i\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -1534,15 +1534,15 @@\n @k\n @b\n $dApplicativeB\n @(Data.Functor.Product.Product f g)\n @h\n (bprod @k @b $dApplicativeB @f @g eta1 eta2)\n eta3)]\n-f8e9dbf366e83e550bc95b7050373b03\n+33f99fb454403138b2a6640eefc7441c\n bzipWith4 ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (j :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a -> i a -> j a)\n -> b f -> b g -> b h -> b i -> b j\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1591,15 +1591,15 @@\n @b\n $dApplicativeB\n @(Data.Functor.Product.Product f g)\n @h\n (bprod @k @b $dApplicativeB @f @g eta1 eta2)\n eta3)\n eta4)]\n-868da1f2081306871a0916728f560b0d\n+4f529bdce74bb3a6a14ebc180fac25cd\n gbprodDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveApplicativeB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=2),\n@@ -1857,15 +1857,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-e06d1628c7c0519d4217f46e4f3a65e7\n+ec7b477217bbacec9a6c40c4ee547133\n gbpureDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *).\n CanDeriveApplicativeB b f f =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Internal.ApplicativeB [orphan module] 9066\n- interface hash: c9c49ccabbe11f64d40ed189604d541d\n- ABI hash: e5cbf75378603efe606ed1f1840012d6\n- export-list hash: e3a321ef54b6defc2ff4748a1a8a8e79\n- orphan hash: 3fce78e7340652cf0baa33ec783799a9\n- flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n+ interface hash: b883bdb22f342229bc0fe5635cc1c53b\n+ ABI hash: 5709ad0696978cf932c7a3d3d373a4b3\n+ export-list hash: 132a656254f5cd59e5dc816b66e09234\n+ orphan hash: 2871b5f4bfa6da85feabcf079c3ea65a\n+ flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: e3ec953c6cc2f924446c95503f2a7a47\n sig of: Nothing\n used TH splices: False\n where\n@@ -23,69 +23,69 @@\n bzipWith\n bzipWith3\n bzipWith4\n gbprodDefault\n gbpureDefault\n ApplicativeB{bprod bpure}\n CanDeriveApplicativeB\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative cd6b2d8adddf9a2d3767a33a685f152d\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 3ced52b07609826cc929119e22540509\n- gprod c71396a7069c38d58d587ea97a10c328\n- gpure 2bc47c1626a359c82f3a6419b23cc52b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative c8c35967a74c18c83413193270a3b945\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative d65021a3af56c65b54997d660d8ab228\n+ gprod ffbaa052989faf6975b219d8a2f318e5\n+ gpure bda06dd713e6eb2b4a59075d90b838b2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-bd342948198775d381943ce7e3978aa8\n+acc19690cc4df68ed3c0fc085142b836\n $dmbprod ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (ApplicativeB b, CanDeriveApplicativeB b f g) =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n \\ @k\n @b :: (k -> *) -> *\n ($dApplicativeB['GHC.Types.Many] :: ApplicativeB b)\n @f :: k -> *\n @g :: k -> *\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveApplicativeB b f g) ->\n gbprodDefault @k @b @f @g $d(%,,,%)]\n-a9bef41da2b92b91db49fc038a223e19\n+fbb27043688771a6062e5f2b2769e9b3\n $dmbpure ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (ApplicativeB b, CanDeriveApplicativeB b f f) =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -314,30 +314,30 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))) _N)]\n-f15dd9b5e99074eed4afa0a8288d1ed0\n+4a724543e2d392c3830f52c107108515\n $fApplicativeBkConst ::\n GHC.Base.Monoid a => ApplicativeB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k @a (v['GHC.Types.Many] :: GHC.Base.Monoid a).\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkConst_$cbpure @k @a v)\n ($fApplicativeBkConst_$cbprod @k @a v)]\n-660869d8fe03ac4c3a5e21330344aae2\n+2669d805c61e95c58bda714c29a4dac3\n $fApplicativeBkConst_$cbprod ::\n forall k a (f :: k -> *) (g :: k -> *).\n GHC.Base.Monoid a =>\n Data.Functor.Const.Const a f\n -> Data.Functor.Const.Const a g\n -> Data.Functor.Const.Const a (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -363,15 +363,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-d159b41983c7b0ed19b2db4991e4f801\n+efac6c5b66a2dd483c2e34bec80df9fa\n $fApplicativeBkConst_$cbpure ::\n forall k a (f :: k -> *).\n GHC.Base.Monoid a =>\n (forall (a1 :: k). f a1) -> Data.Functor.Const.Const a f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1L,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -386,15 +386,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-40a2079964f88dc4cdf49ae1ddbaf417\n+01a8b0df8f873886302b05b6258dd1c5\n $fApplicativeBkConstant ::\n GHC.Base.Monoid a =>\n ApplicativeB (Data.Functor.Constant.Constant a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k @a (v['GHC.Types.Many] :: GHC.Base.Monoid a).\n@@ -402,15 +402,15 @@\n @(Data.Functor.Constant.Constant a)\n (Barbies.Internal.FunctorB.$fFunctorBkConstant_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkConstant_$cbpure @k @a v)\n ($fApplicativeBkConstant_$cbprod @k @a v)]\n-5439fb95b3f4082ff66eb81e8aaf9e46\n+6524e0f276a01b2c0d67f9f814c7fd47\n $fApplicativeBkConstant_$cbprod ::\n forall k a (f :: k -> *) (g :: k -> *).\n GHC.Base.Monoid a =>\n Data.Functor.Constant.Constant a f\n -> Data.Functor.Constant.Constant a g\n -> Data.Functor.Constant.Constant\n a (Data.Functor.Product.Product f g)\n@@ -442,15 +442,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Constant.N:Constant[0]\n *>_N\n _R\n _P))]\n-93f5ff52875376b4ee9e08dd7ed8ded8\n+197cfd2b23516336d69f373481dc2d8d\n $fApplicativeBkConstant_$cbpure ::\n forall k a (f :: k -> *).\n GHC.Base.Monoid a =>\n (forall (a1 :: k). f a1) -> Data.Functor.Constant.Constant a f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1L,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -465,15 +465,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Constant.N:Constant[0]\n *>_N\n _R\n _P))]\n-f6da0faed345778a5227597cd46f18eb\n+464089d3a55e592eeaa03a7985d6e445\n $fApplicativeBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ApplicativeB a, ApplicativeB b) =>\n ApplicativeB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -488,15 +488,15 @@\n @(Data.Functor.Product.Product a b)\n ($fApplicativeBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkProduct_$cbpure @k @a @b v v1)\n ($fApplicativeBkProduct_$cbprod @k @a @b v v1)]\n-dd678495d92b4219e6c63a09564e4d47\n+f47aeb603ca13613ed22ad9fa8e5e19a\n $fApplicativeBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -530,15 +530,15 @@\n (($p1ApplicativeB @k @b $dApplicativeB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-3d660815d1da8d72bb49466d3e8c428e\n+e34f611e792f34e3c517a5a6baeaa8c9\n $fApplicativeBkProduct_$cbprod ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n -> Data.Functor.Product.Product\n@@ -562,15 +562,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @(Data.Functor.Product.Product f g)\n (bprod @k @a $dApplicativeB @f @g ll rl)\n (bprod @k @b $dApplicativeB1 @f @g lr rr) } }]\n-8f080a3243309d4f35f3df5f8d0407d7\n+ffac108bc106d42f78c109bfca218bd1\n $fApplicativeBkProduct_$cbpure ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n (forall (a1 :: k). f a1) -> Data.Functor.Product.Product a b f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=1),\n@@ -585,53 +585,53 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @f\n (bpure @k @a $dApplicativeB @f x)\n (bpure @k @b $dApplicativeB1 @f x)]\n-6eb0bcca2c7afcdef30743c2488d056b\n+5eeef2283a5bf1d508eafaa548d93439\n $fApplicativeBkProxy :: ApplicativeB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ApplicativeB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkProxy_$cbpure @k)\n ($fApplicativeBkProxy_$cbprod @k)]\n-7e7b45a4e0013b9c299b43f52c53bbe1\n+55cbc114f4c42efd8c30c6725970347c\n $fApplicativeBkProxy_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Proxy.Proxy (Data.Functor.Product.Product f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Product.Product f g)]\n-8e5672123880c54764f7dcdad4741eed\n+ac30f093658c169b9b7f964bf875b928\n $fApplicativeBkProxy_$cbpure ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Data.Proxy.Proxy f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Data.Proxy.Proxy @(k -> *) @f]\n-c0edb25d60a66e655517af23b538e3d7\n+748864c1ab60c61381a26ad99dc9c5ea\n $fGApplicativeNaturalk1k0fgRecRecRec ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b) =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n@@ -685,15 +685,15 @@\n @m\n @b\n @f\n @g\n v\n v1\n v2)]\n-d55fa40c27133ecd1a443eecc2a12f34\n+d8b1586349b7a4e79c6c66c4466c9c51\n $fGApplicativeNaturalk1k0fgRecRecRec0 ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (GHC.Base.Applicative h, ApplicativeB b) =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n@@ -741,15 +741,15 @@\n @k1\n @h\n @b\n @f\n @g\n v\n v1)]\n-664ddc8bc3fd361e51b0ae9a838dfad4\n+b430351fc5bca69836994e4d6e1b88e0\n $fGApplicativeNaturalk1k0fgRecRecRec0_$cgprod ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, ApplicativeB b) =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -828,15 +828,15 @@\n _N\n _P) _N _N)]\n-8a089bb2ac9c464324ed33ae7ae0b5ae\n+87ee43778e7f65875112c6e703a03648\n $fGApplicativeNaturalk1k0fgRecRecRec0_$cgpure ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, ApplicativeB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (b (P 0 f))) (h (b f))\n GHC.Types.~ Data.Generics.GenericN.Rec\n (h (b (P 0 g))) (h (b g))) =>\n@@ -916,15 +916,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-b99388d79fe7b692cee1f3fa1dc111f5\n+47c3fe8e1f44e9449a9c1e6f7b75a8f7\n $fGApplicativeNaturalk1k0fgRecRecRec1 ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n@@ -952,15 +952,15 @@\n @(Data.Generics.GenericN.Rec (b (P 0 f)) (b f))\n @(Data.Generics.GenericN.Rec (b (P 0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b (P 0 (Data.Functor.Product.Product f g)))\n (b (Data.Functor.Product.Product f g)))\n ($fGApplicativeNaturalk1k0fgRecRecRec1_$cgprod @k @k1 @b @f @g v)\n ($fGApplicativeNaturalk1k0fgRecRecRec1_$cgpure @k @k1 @b @f @g v)]\n-10e5a21edfddc45aa0f6ccba58f0b7e8\n+ddded303d55691fd839df5853348e7ef\n $fGApplicativeNaturalk1k0fgRecRecRec1_$cgprod ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k1).\n ApplicativeB b =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1025,15 +1025,15 @@\n _N\n _P) _N _N)]\n-056a947ef34e1edd42389d990c0f30bc\n+2fd86ea4b182d043263a324e2d03f57a\n $fGApplicativeNaturalk1k0fgRecRecRec1_$cgpure ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k1).\n (ApplicativeB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (b (P 0 f)) (b f)\n GHC.Types.~ Data.Generics.GenericN.Rec (b (P 0 g)) (b g)) =>\n Data.Proxy.Proxy 0\n@@ -1100,15 +1100,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-8fc0b6ba24377d04a3c5f14c82c5b8b0\n+5bb2035e41a48308fd6c8f15e1502010\n $fGApplicativeNaturalk1k0fgRecRecRec_$cgprod ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b) =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1212,15 +1212,15 @@\n _N\n _P) _N _N)]\n-fa1dc756bc05088d63857da30787db80\n+0e1fa952d3a9ddb0e15f4270ce3894e2\n $fGApplicativeNaturalk1k0fgRecRecRec_$cgpure ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b,\n f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (m (h (b (P 0 f)))) (m (h (b f)))\n GHC.Types.~ Data.Generics.GenericN.Rec\n@@ -1311,77 +1311,77 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-5d46cdd99f680884369663710823eba4\n+2d0d725ae3c73d0e9ce1ab6f42a10ad9\n $tcApplicativeB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12947307924732368312#Word64\n- 18371083973462631636#Word64\n+ 16423447268799648649#Word64\n+ 15497646768975084827#Word64\n $trModule\n $tcApplicativeB2\n 1#\n $tcApplicativeB1]\n-de490ec25de8684f665bca0cb71a2a6d\n+4aac118f1a79edd7b4f26a65a3806e89\n $tcApplicativeB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ad2a793451ba1d2cec69f4ce975f8fc3\n+bb41a43844490fe0300e4f8d05feaa3b\n $tcApplicativeB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcApplicativeB3]\n-b37bbdcab1db0d786b21e5a3cc4ef582\n+d48fffa80e9c28a74d53ce38dc63fb81\n $tcApplicativeB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ApplicativeB\"#]\n-f953dc8d5b36d24c0e2e7ef5c921274a\n+067fde38a85d1a127b2e6c503bdd3e2d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-1b19fe21bc12f523332490b874316c3b\n+e8f65c4291dda5909b4066205b0d3731\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-59448607c9b3d1cd8979e10eab2c2bd2\n+2f81709c770e0386fb81c1fbdb897e65\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ApplicativeB\"#]\n-65af7fb9ef4ff25139adc417b47f7be0\n+e632744fe7645099f1d46d2467fd06e6\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-62fd23dd485c83e5c0d9a89ea3be0a93\n+8a146c282b70b036e99a4f55dd9e3456\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-da36390c3794afb8c2320e10e019f6a0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+085305c56ddc98892210f57460e0a6ea\n type ApplicativeB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => ApplicativeB b where\n bpure :: forall (f :: k -> *). (forall (a :: k). f a) -> b f\n default bpure :: forall (f :: k -> *).\n CanDeriveApplicativeB b f f =>\n (forall (a :: k). f a) -> b f\n bprod :: forall (f :: k -> *) (g :: k -> *).\n b f -> b g -> b (Data.Functor.Product.Product f g)\n default bprod :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveApplicativeB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n-b61bc228653760157a606b23571c88ec\n+8a4842373f69f720223ec1f5884a1cf2\n type CanDeriveApplicativeB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveApplicativeB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Data.Generics.GenericN.GenericP\n 0 (b (Data.Functor.Product.Product f g)),\n@@ -1390,18 +1390,18 @@\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g))\n (Data.Generics.GenericN.RepP\n 0 (b (Data.Functor.Product.Product f g))))\n :: GHC.Types.Constraint\n-311d5995443cedd969c502ffd614f139\n+4060f178106d02a10e919c580f7f0818\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-55485ecb89cfc48f959276abf53138b6\n+08f36433607586faeeb884eb3863272f\n bunzip ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n b (Data.Functor.Product.Product f g) -> (b f, b g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueFalse>\n@@ -1425,55 +1425,55 @@\n $dFunctorB\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @(Data.Functor.Product.Product f g)\n @g\n (bunzip1 @k @f @g)\n eta)]\n-decd43b36f6dfa3355042a3e13a72698\n+c10b19d656fe05eeb19f7a6cb454a9fc\n bunzip1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 b -> b }]\n-71fe1f4deb8b67cc487e3d40eb3ab6d1\n+0d17ffa5995665071db47789b96f5d14\n bunzip2 ::\n forall {k} {g :: k -> *} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @g :: k -> *\n @f :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair a1 ds1 -> a1 }]\n-a2112f05775fc9da652845f2152de290\n+d545e7ab39c9242dfddedef227364f2d\n bzip ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(A,A,1L)>,\n Unfolding: Core: \n \\ @k\n @b :: (k -> *) -> *\n @f :: k -> *\n @g :: k -> *\n ($dApplicativeB['GHC.Types.Many] :: ApplicativeB b) ->\n bprod @k @b $dApplicativeB @f @g]\n-f55c10be3a14621f3eb32055001f484a\n+b39181fa2c8191904967f5c9a9668fe9\n bzipWith ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a) -> b f -> b g -> b h\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1493,15 +1493,15 @@\n @(Data.Functor.Product.Product f g)\n @h\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair fa ga ->\n eta @a fa ga })\n (bprod @k @b $dApplicativeB @f @g eta1 eta2)]\n-ecb23b1e853065db90edbdd50d45dde9\n+c2cd418448529a1101125fdb0fb6eef0\n bzipWith3 ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a -> i a)\n -> b f -> b g -> b h -> b i\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -1534,15 +1534,15 @@\n @k\n @b\n $dApplicativeB\n @(Data.Functor.Product.Product f g)\n @h\n (bprod @k @b $dApplicativeB @f @g eta1 eta2)\n eta3)]\n-f8e9dbf366e83e550bc95b7050373b03\n+33f99fb454403138b2a6640eefc7441c\n bzipWith4 ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (j :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a -> i a -> j a)\n -> b f -> b g -> b h -> b i -> b j\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1591,15 +1591,15 @@\n @b\n $dApplicativeB\n @(Data.Functor.Product.Product f g)\n @h\n (bprod @k @b $dApplicativeB @f @g eta1 eta2)\n eta3)\n eta4)]\n-868da1f2081306871a0916728f560b0d\n+4f529bdce74bb3a6a14ebc180fac25cd\n gbprodDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveApplicativeB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=2),\n@@ -1857,15 +1857,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-e06d1628c7c0519d4217f46e4f3a65e7\n+ec7b477217bbacec9a6c40c4ee547133\n gbpureDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *).\n CanDeriveApplicativeB b f f =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.ApplicativeT [orphan module] 9066\n- interface hash: d05e989db4f2c4c1183a3dff5681de67\n- ABI hash: f85e5cd2da339db14a0f12808931207a\n- export-list hash: 8f06cd71a7d940a28cb85009a4957b36\n- orphan hash: cf25b435a70bad75cc4224488a4033bb\n+ interface hash: 89bbdcfdbd33f42713c3b686296d8723\n+ ABI hash: f06477dafaca98c451f2b1d6a471ced6\n+ export-list hash: 1b16a7ba7761bb551c6170cbaa7b2e96\n+ orphan hash: 88a84be877888b363b3518e71ecde79c\n flag hash: 7b4d57b642829d65cbecbbb7bf61fecd\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2b9d249dc274efbd43de936dca602351\n sig of: Nothing\n used TH splices: False\n@@ -23,17 +23,17 @@\n tunzip\n tzip\n tzipWith\n tzipWith3\n tzipWith4\n ApplicativeT{tprod tpure}\n CanDeriveApplicativeT\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -43,47 +43,47 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative cd6b2d8adddf9a2d3767a33a685f152d\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 3ced52b07609826cc929119e22540509\n- gprod c71396a7069c38d58d587ea97a10c328\n- gpure 2bc47c1626a359c82f3a6419b23cc52b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative c8c35967a74c18c83413193270a3b945\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative d65021a3af56c65b54997d660d8ab228\n+ gprod ffbaa052989faf6975b219d8a2f318e5\n+ gpure bda06dd713e6eb2b4a59075d90b838b2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-2092922899ac46b3e69751104d27b97c\n+3d4f0c4858ce92a1e1516dee4deaad24\n $dmtprod ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (ApplicativeT t, CanDeriveApplicativeT t f g x) =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -93,15 +93,15 @@\n @t :: (k -> *) -> k' -> *\n ($dApplicativeT['GHC.Types.Many] :: ApplicativeT t)\n @f :: k -> *\n @g :: k -> *\n @x :: k'\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveApplicativeT t f g x) ->\n gtprodDefault @k @k' @t @f @g @x $d(%,,,%)]\n-7a13c02d2f33dd2ca92f7d9864ddd9b6\n+a598ee105ba2c946a3274ec765b5b762\n $dmtpure ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (x :: k').\n (ApplicativeT t, CanDeriveApplicativeT t f f x) =>\n (forall (a :: k). f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -405,15 +405,15 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-3158c5286c4cc7999c6b78279a6f4838\n+2acd164204bff1df6e0d00f5662a6ae4\n $fApplicativeTTYPETYPEProduct ::\n GHC.Base.Alternative f =>\n ApplicativeT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n@@ -423,15 +423,15 @@\n @(Data.Functor.Product.Product f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fApplicativeTTYPETYPEProduct_$ctpure @f v)\n ($fApplicativeTTYPETYPEProduct_$ctprod @f v)]\n-ce563e9b5ab7385c92d59ca024f7d105\n+5944243b01129cf0b6befece0ca2aa2d\n $fApplicativeTTYPETYPEProduct_$ctprod ::\n GHC.Base.Alternative f =>\n Data.Functor.Product.Product f f1 x\n -> Data.Functor.Product.Product f g x\n -> Data.Functor.Product.Product\n f (Data.Functor.Product.Product f1 g) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -451,15 +451,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @(Data.Functor.Product.Product f1 g)\n @x\n (GHC.Base.<|> @f $dAlternative @x fl fr)\n (Data.Functor.Product.Pair @(*) @f1 @g @x gl gr) } }]\n-5fb1e3f3e1a05d572eaecd0e5f38d539\n+064228aa7be911653ec44da1637f216d\n $fApplicativeTTYPETYPEProduct_$ctpure ::\n GHC.Base.Alternative f =>\n (forall a. f1 a) -> Data.Functor.Product.Product f f1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -471,15 +471,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @x\n (GHC.Base.empty @f $dAlternative @x)\n (fa @x)]\n-f5e96e97cf13b1649a1ed3d886de8136\n+8f77eb7bf3491c2c517bcb1d8ed1a389\n $fApplicativeTTYPETYPESum ::\n GHC.Base.Alternative f => ApplicativeT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n (v['GHC.Types.Many] :: GHC.Base.Alternative f).\n@@ -488,15 +488,15 @@\n @(Data.Functor.Sum.Sum f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Sum_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fApplicativeTTYPETYPESum_$ctpure @f v)\n ($fApplicativeTTYPETYPESum_$ctprod @f v)]\n-14a13f3764cf9de4b2c4a89d362dd966\n+dc6b79e333994acdebd0ad6c802157a3\n $fApplicativeTTYPETYPESum_$ctprod ::\n GHC.Base.Alternative f =>\n Data.Functor.Sum.Sum f f1 x\n -> Data.Functor.Sum.Sum f g x\n -> Data.Functor.Sum.Sum f (Data.Functor.Product.Product f1 g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L><1L>,\n@@ -538,28 +538,28 @@\n Data.Functor.Sum.InR gr\n -> Data.Functor.Sum.InR\n @(*)\n @f\n @(Data.Functor.Product.Product f1 g)\n @x\n (Data.Functor.Product.Pair @(*) @f1 @g @x gl gr) } }]\n-9345cf7475c5ae21d7f8cabcfe23b9c3\n+d242ca7e0242a46b1e320ec9a4264dd9\n $fApplicativeTTYPETYPESum_$ctpure ::\n GHC.Base.Alternative f =>\n (forall a. f1 a) -> Data.Functor.Sum.Sum f f1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 2, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @f :: * -> *\n ($dAlternative['GHC.Types.Many] :: GHC.Base.Alternative f)\n @f1 :: * -> *\n @x\n (fa['GHC.Types.Many] :: forall a. f1 a) ->\n Data.Functor.Sum.InR @(*) @f @f1 @x (fa @x)]\n-97d99565980884e3f674bdd977966928\n+47b9a261bfbf91f2ce8cba8562dc3b6b\n $fApplicativeTk'k'Compose ::\n GHC.Base.Applicative f =>\n ApplicativeT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n@@ -577,15 +577,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTk'k'Compose_$ctpure @k' @f v)\n ($fApplicativeTk'k'Compose_$ctprod @k' @f v)]\n-4d54d9f401927d749f55d09ab543e9b9\n+2be7da347efc8d3c12f84d55b4fc1410\n $fApplicativeTk'k'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n GHC.Base.Applicative f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -604,15 +604,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-877754a90d74bbb2a7d0486eedf99905\n+0ad9effbc7dd95c43369cbfec8aae68d\n $fApplicativeTk'k'Compose_$ctprod ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (x :: k') (g :: k' -> *).\n GHC.Base.Applicative f =>\n Data.Functor.Compose.Compose f f1 x\n -> Data.Functor.Compose.Compose f g x\n -> Data.Functor.Compose.Compose\n f (Data.Functor.Product.Product f1 g) x\n@@ -658,15 +658,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-2e27527bd0344fd2e7ef9a2a3e5fef59\n+119a8f9b6e64e60fa8ef2f15c36f4732\n $fApplicativeTk'k'Compose_$ctpure ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (x :: k').\n GHC.Base.Applicative f =>\n (forall (a :: k'). f1 a) -> Data.Functor.Compose.Compose f f1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -684,15 +684,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-7845f8f7dc04b1510ef908c89cb5f2ee\n+9f599c584c770d70f4295a46433e356d\n $fApplicativeTk'k'Reverse ::\n ApplicativeT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ApplicativeT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -700,15 +700,15 @@\n @Data.Functor.Reverse.Reverse\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Reverse_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTk'k'Reverse_$ctpure @k')\n ($fApplicativeTk'k'Reverse_$ctprod @k')]\n-d2884491187db97705f06feadbe1174f\n+284258341a4e2860d3a3f35fc1b08722\n $fApplicativeTk'k'Reverse_$ctprod ::\n forall k' (f :: k' -> *) (x :: k') (g :: k' -> *).\n Data.Functor.Reverse.Reverse f x\n -> Data.Functor.Reverse.Reverse g x\n -> Data.Functor.Reverse.Reverse\n (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -731,15 +731,15 @@\n (forall (k' :: <*>_N) (f :: *>_N) (x :: _N) (g :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N\n _R) _N)]\n-d55a31aa02d1b0631c72fb3ee773f904\n+c97e5e059ec2ef9f6961bc8a47b3138e\n $fApplicativeTk'k'Reverse_$ctpure ::\n forall k' (f :: k' -> *) (x :: k').\n (forall (a :: k'). f a) -> Data.Functor.Reverse.Reverse f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @k'\n@@ -748,15 +748,15 @@\n (fa['GHC.Types.Many] :: forall (a :: k'). f a) ->\n fa @x)\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N) (x :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)]\n-7c00ab8f6960564e42864247c86874ee\n+b25c792e201ebf9a29ed00c87bf44da2\n $fGApplicativeNaturalk1k1fgRecRecRec ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t) =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -816,15 +816,15 @@\n @t\n @f\n @g\n @x\n v\n v1\n v2)]\n-579db040836aca4ad81fe065ef7599f9\n+f1f2dc14f3462b79d2bc1e6822e12edb\n $fGApplicativeNaturalk1k1fgRecRecRec0 ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Applicative h, ApplicativeT t) =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -878,15 +878,15 @@\n @h\n @t\n @f\n @g\n @x\n v\n v1)]\n-2a734ec9846a3ca383f33925eb7bb9af\n+a094a54c4eeabca33d66a391d2f4b831\n $fGApplicativeNaturalk1k1fgRecRecRec0_$cgprod ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Applicative h, ApplicativeT t) =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -974,15 +974,15 @@\n _P) _N _N)]\n-39aed3098ba364189867067675940182\n+8db6acc5788a7f4d59f580a428d5ced6\n $fGApplicativeNaturalk1k1fgRecRecRec0_$cgpure ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Applicative h, ApplicativeT t, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (t (P 1 f) x)) (h (t f x))\n GHC.Types.~ Data.Generics.GenericN.Rec\n (h (t (P 1 g) x)) (h (t g x))) =>\n@@ -1069,15 +1069,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-1d732201d9b23fdb11a980eac2b7e912\n+400ea071ce0edca3836deb2a00e38dd6\n $fGApplicativeNaturalk1k1fgRecRecRec1 ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n ApplicativeT t =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -1124,15 +1124,15 @@\n @k'\n @k1\n @t\n @f\n @g\n @x\n v)]\n-02f8900ebc5b66c4ff1fd3549ad9b56d\n+d041669610c0470a963a95ac206465c4\n $fGApplicativeNaturalk1k1fgRecRecRec1_$cgprod ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n ApplicativeT t =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1205,15 +1205,15 @@\n _N\n _P) _N _N)]\n-7b30f11762650f3352ae5fdee4b6822b\n+f51c03223a2c91c542aa594d918c8433\n $fGApplicativeNaturalk1k1fgRecRecRec1_$cgpure ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n (ApplicativeT t, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x)\n GHC.Types.~ Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x)) =>\n Data.Proxy.Proxy 1\n@@ -1287,15 +1287,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-d93f71192e811a25b18c8f8e5925990c\n+eb7626b53a2d59cfba715e7f3447046d\n $fGApplicativeNaturalk1k1fgRecRecRec_$cgprod ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t) =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n@@ -1409,15 +1409,15 @@\n _P) _N _N)]\n-598ebc9a229ab38e913f03b9f3e4da6a\n+566d88e235593a2a2736f769d70475db\n $fGApplicativeNaturalk1k1fgRecRecRec_$cgpure ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t,\n f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (m (h (t (P 1 f) x))) (m (h (t f x)))\n@@ -1519,78 +1519,78 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-611a4c680642b46e583dd0a3836c3ca2\n+5689b5f24aa2748d958eb5b90051856a\n $tcApplicativeT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2174775567770085663#Word64\n- 7944381188582367962#Word64\n+ 5314690156032248697#Word64\n+ 3808439990830178351#Word64\n $trModule\n $tcApplicativeT2\n 2#\n $tcApplicativeT1]\n-7af8b235ee78bc6f5f264674ab51242b\n+a76a971284118ce1f46aaf1f9e1b08fe\n $tcApplicativeT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-9be4667b966a453a82e91b76d58bcaa4\n+fb6be3b7d52c2f19d27423c8def0ed26\n $tcApplicativeT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcApplicativeT3]\n-5d63451a1120a15267d7588a064c6f8b\n+a5209c0a2cd1b36c07a25e01ecfbc2a2\n $tcApplicativeT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ApplicativeT\"#]\n-b03b7f7ec41d5b4ef60ab00a10d891d9\n+3afba32b96e8348e904173cadc8abce1\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-e6c032436ee9035d9f9d8e4832b288bd\n+a8404d8876efda3f241d3b4076a270c3\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-219e1352f2543a3a3382955c79a050f4\n+811cb46b77c1decc7a101c7bd1de9ff5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ApplicativeT\"#]\n-710d6bcbe0e0380cb7af7b2f4c4362ae\n+73faedb8e11ceba8b2e2bd4760443b0c\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b45da6b034a103a97262446ca0a317ee\n+dd330928c64dcdab7d63b25a3cf59104\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-a99ce0340646a38f9575b049182a8def\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+074070de79264540541cf796d013c0ef\n type ApplicativeT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => ApplicativeT t where\n tpure :: forall (f :: k -> *) (x :: k').\n (forall (a :: k). f a) -> t f x\n default tpure :: forall (f :: k -> *) (x :: k').\n CanDeriveApplicativeT t f f x =>\n (forall (a :: k). f a) -> t f x\n tprod :: forall (f :: k -> *) (x :: k') (g :: k -> *).\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n default tprod :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n CanDeriveApplicativeT t f g x =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n-cbbd0254664fc2922e682c379a992479\n+94d1ae24736395101d409a6bef83c15e\n type CanDeriveApplicativeT :: forall {k} {k1}.\n ((k -> *) -> k1 -> *)\n -> (k -> *) -> (k -> *) -> k1 -> GHC.Types.Constraint\n type CanDeriveApplicativeT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Data.Generics.GenericN.GenericP\n@@ -1600,18 +1600,18 @@\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x))\n (Data.Generics.GenericN.RepP\n 1 (t (Data.Functor.Product.Product f g) x)))\n :: GHC.Types.Constraint\n-2e6bbdc728ef48d64284d8da1a5e8985\n+1248c8467ef46450430b9a8dc170b2f1\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-6ee3df9182f5e7d3f8dd7d265ddb3ffa\n+6912fa13bfa8d0a5d88abeef219abe6a\n gtprodDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (g :: k1 -> *) (x :: k2).\n CanDeriveApplicativeT t f g x =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1974,15 +1974,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-2835ded64dcf6c6ec5057eafb8cd4d43\n+e7ff19e5401399467ae222ca9256a89d\n gtpureDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (x :: k2).\n CanDeriveApplicativeT t f f x =>\n (forall (a :: k1). f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -2287,15 +2287,15 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-4755a536dffa72b34542174dea9563b9\n+c89a7b71ff92b7ceb5cae4db45b4ab65\n tunzip ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n ApplicativeT t =>\n t (Data.Functor.Product.Product f g) x -> (t f x, t g x)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n@@ -2324,41 +2324,41 @@\n `cast`\n (Barbies.Internal.FunctorT.N:FunctorT[0] _N _N _N)\n @(Data.Functor.Product.Product f g)\n @g\n @x\n (tunzip1 @k @f @g)\n eta)]\n-a429b6bc4a903c8e339027c5b24276de\n+1cf91e0d8928661a308a7e5868cdd4b8\n tunzip1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 b -> b }]\n-f06958c3280c22cd4e4dfcf39484bc6f\n+acac6a17eb1b6d63eff80c58f1756ffb\n tunzip2 ::\n forall {k} {g :: k -> *} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @g :: k -> *\n @f :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair a1 ds1 -> a1 }]\n-8be4ece3ae39eae97e8ab2054291029f\n+8673df67a349ae2cf7af109d88da754f\n tzip ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *) (x :: k')\n (g :: k -> *).\n ApplicativeT t =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(A,A,1L)>,\n@@ -2367,15 +2367,15 @@\n @k'\n @t :: (k -> *) -> k' -> *\n @f :: k -> *\n @x :: k'\n @g :: k -> *\n ($dApplicativeT['GHC.Types.Many] :: ApplicativeT t) ->\n tprod @k @k' @t $dApplicativeT @f @x @g]\n-42a8151822e89abb873919356fdc0652\n+d330f2b0b31b44684ce33684d371e964\n tzipWith ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a) -> t f x -> t g x -> t h x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -2398,15 +2398,15 @@\n @h\n @x\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair fa ga ->\n eta @a fa ga })\n (tprod @k @k' @t $dApplicativeT @f @x @g eta1 eta2)]\n-849c75023385973bb50888c87cceec50\n+057da6c305029e0e1fcd16a43064b63b\n tzipWith3 ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (i :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a -> i a)\n -> t f x -> t g x -> t h x -> t i x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -2444,15 +2444,15 @@\n @t\n $dApplicativeT\n @(Data.Functor.Product.Product f g)\n @x\n @h\n (tprod @k @k' @t $dApplicativeT @f @x @g eta1 eta2)\n eta3)]\n-0425deaa0877b3ffee1c1fdf4d05f678\n+487b69261ee783048fa31f8edc0ffed1\n tzipWith4 ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (i :: k -> *) (j :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a -> i a -> j a)\n -> t f x -> t g x -> t h x -> t i x -> t j x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.ApplicativeT [orphan module] 9066\n- interface hash: d05e989db4f2c4c1183a3dff5681de67\n- ABI hash: f85e5cd2da339db14a0f12808931207a\n- export-list hash: 8f06cd71a7d940a28cb85009a4957b36\n- orphan hash: cf25b435a70bad75cc4224488a4033bb\n+ interface hash: 89bbdcfdbd33f42713c3b686296d8723\n+ ABI hash: f06477dafaca98c451f2b1d6a471ced6\n+ export-list hash: 1b16a7ba7761bb551c6170cbaa7b2e96\n+ orphan hash: 88a84be877888b363b3518e71ecde79c\n flag hash: 42d899abafa3d74d732d285c140f9412\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2b9d249dc274efbd43de936dca602351\n sig of: Nothing\n used TH splices: False\n@@ -23,17 +23,17 @@\n tunzip\n tzip\n tzipWith\n tzipWith3\n tzipWith4\n ApplicativeT{tprod tpure}\n CanDeriveApplicativeT\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -43,47 +43,47 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative cd6b2d8adddf9a2d3767a33a685f152d\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 3ced52b07609826cc929119e22540509\n- gprod c71396a7069c38d58d587ea97a10c328\n- gpure 2bc47c1626a359c82f3a6419b23cc52b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative c8c35967a74c18c83413193270a3b945\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative d65021a3af56c65b54997d660d8ab228\n+ gprod ffbaa052989faf6975b219d8a2f318e5\n+ gpure bda06dd713e6eb2b4a59075d90b838b2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-2092922899ac46b3e69751104d27b97c\n+3d4f0c4858ce92a1e1516dee4deaad24\n $dmtprod ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (ApplicativeT t, CanDeriveApplicativeT t f g x) =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -93,15 +93,15 @@\n @t :: (k -> *) -> k' -> *\n ($dApplicativeT['GHC.Types.Many] :: ApplicativeT t)\n @f :: k -> *\n @g :: k -> *\n @x :: k'\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveApplicativeT t f g x) ->\n gtprodDefault @k @k' @t @f @g @x $d(%,,,%)]\n-7a13c02d2f33dd2ca92f7d9864ddd9b6\n+a598ee105ba2c946a3274ec765b5b762\n $dmtpure ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (x :: k').\n (ApplicativeT t, CanDeriveApplicativeT t f f x) =>\n (forall (a :: k). f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -405,15 +405,15 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-3158c5286c4cc7999c6b78279a6f4838\n+2acd164204bff1df6e0d00f5662a6ae4\n $fApplicativeTTYPETYPEProduct ::\n GHC.Base.Alternative f =>\n ApplicativeT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n@@ -423,15 +423,15 @@\n @(Data.Functor.Product.Product f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fApplicativeTTYPETYPEProduct_$ctpure @f v)\n ($fApplicativeTTYPETYPEProduct_$ctprod @f v)]\n-ce563e9b5ab7385c92d59ca024f7d105\n+5944243b01129cf0b6befece0ca2aa2d\n $fApplicativeTTYPETYPEProduct_$ctprod ::\n GHC.Base.Alternative f =>\n Data.Functor.Product.Product f f1 x\n -> Data.Functor.Product.Product f g x\n -> Data.Functor.Product.Product\n f (Data.Functor.Product.Product f1 g) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -451,15 +451,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @(Data.Functor.Product.Product f1 g)\n @x\n (GHC.Base.<|> @f $dAlternative @x fl fr)\n (Data.Functor.Product.Pair @(*) @f1 @g @x gl gr) } }]\n-5fb1e3f3e1a05d572eaecd0e5f38d539\n+064228aa7be911653ec44da1637f216d\n $fApplicativeTTYPETYPEProduct_$ctpure ::\n GHC.Base.Alternative f =>\n (forall a. f1 a) -> Data.Functor.Product.Product f f1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -471,15 +471,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @x\n (GHC.Base.empty @f $dAlternative @x)\n (fa @x)]\n-f5e96e97cf13b1649a1ed3d886de8136\n+8f77eb7bf3491c2c517bcb1d8ed1a389\n $fApplicativeTTYPETYPESum ::\n GHC.Base.Alternative f => ApplicativeT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n (v['GHC.Types.Many] :: GHC.Base.Alternative f).\n@@ -488,15 +488,15 @@\n @(Data.Functor.Sum.Sum f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Sum_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fApplicativeTTYPETYPESum_$ctpure @f v)\n ($fApplicativeTTYPETYPESum_$ctprod @f v)]\n-14a13f3764cf9de4b2c4a89d362dd966\n+dc6b79e333994acdebd0ad6c802157a3\n $fApplicativeTTYPETYPESum_$ctprod ::\n GHC.Base.Alternative f =>\n Data.Functor.Sum.Sum f f1 x\n -> Data.Functor.Sum.Sum f g x\n -> Data.Functor.Sum.Sum f (Data.Functor.Product.Product f1 g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L><1L>,\n@@ -538,28 +538,28 @@\n Data.Functor.Sum.InR gr\n -> Data.Functor.Sum.InR\n @(*)\n @f\n @(Data.Functor.Product.Product f1 g)\n @x\n (Data.Functor.Product.Pair @(*) @f1 @g @x gl gr) } }]\n-9345cf7475c5ae21d7f8cabcfe23b9c3\n+d242ca7e0242a46b1e320ec9a4264dd9\n $fApplicativeTTYPETYPESum_$ctpure ::\n GHC.Base.Alternative f =>\n (forall a. f1 a) -> Data.Functor.Sum.Sum f f1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 2, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @f :: * -> *\n ($dAlternative['GHC.Types.Many] :: GHC.Base.Alternative f)\n @f1 :: * -> *\n @x\n (fa['GHC.Types.Many] :: forall a. f1 a) ->\n Data.Functor.Sum.InR @(*) @f @f1 @x (fa @x)]\n-97d99565980884e3f674bdd977966928\n+47b9a261bfbf91f2ce8cba8562dc3b6b\n $fApplicativeTk'k'Compose ::\n GHC.Base.Applicative f =>\n ApplicativeT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n@@ -577,15 +577,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTk'k'Compose_$ctpure @k' @f v)\n ($fApplicativeTk'k'Compose_$ctprod @k' @f v)]\n-4d54d9f401927d749f55d09ab543e9b9\n+2be7da347efc8d3c12f84d55b4fc1410\n $fApplicativeTk'k'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n GHC.Base.Applicative f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -604,15 +604,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-877754a90d74bbb2a7d0486eedf99905\n+0ad9effbc7dd95c43369cbfec8aae68d\n $fApplicativeTk'k'Compose_$ctprod ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (x :: k') (g :: k' -> *).\n GHC.Base.Applicative f =>\n Data.Functor.Compose.Compose f f1 x\n -> Data.Functor.Compose.Compose f g x\n -> Data.Functor.Compose.Compose\n f (Data.Functor.Product.Product f1 g) x\n@@ -658,15 +658,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-2e27527bd0344fd2e7ef9a2a3e5fef59\n+119a8f9b6e64e60fa8ef2f15c36f4732\n $fApplicativeTk'k'Compose_$ctpure ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (x :: k').\n GHC.Base.Applicative f =>\n (forall (a :: k'). f1 a) -> Data.Functor.Compose.Compose f f1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -684,15 +684,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-7845f8f7dc04b1510ef908c89cb5f2ee\n+9f599c584c770d70f4295a46433e356d\n $fApplicativeTk'k'Reverse ::\n ApplicativeT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ApplicativeT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -700,15 +700,15 @@\n @Data.Functor.Reverse.Reverse\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Reverse_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTk'k'Reverse_$ctpure @k')\n ($fApplicativeTk'k'Reverse_$ctprod @k')]\n-d2884491187db97705f06feadbe1174f\n+284258341a4e2860d3a3f35fc1b08722\n $fApplicativeTk'k'Reverse_$ctprod ::\n forall k' (f :: k' -> *) (x :: k') (g :: k' -> *).\n Data.Functor.Reverse.Reverse f x\n -> Data.Functor.Reverse.Reverse g x\n -> Data.Functor.Reverse.Reverse\n (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -731,15 +731,15 @@\n (forall (k' :: <*>_N) (f :: *>_N) (x :: _N) (g :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N\n _R) _N)]\n-d55a31aa02d1b0631c72fb3ee773f904\n+c97e5e059ec2ef9f6961bc8a47b3138e\n $fApplicativeTk'k'Reverse_$ctpure ::\n forall k' (f :: k' -> *) (x :: k').\n (forall (a :: k'). f a) -> Data.Functor.Reverse.Reverse f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @k'\n@@ -748,15 +748,15 @@\n (fa['GHC.Types.Many] :: forall (a :: k'). f a) ->\n fa @x)\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N) (x :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)]\n-7c00ab8f6960564e42864247c86874ee\n+b25c792e201ebf9a29ed00c87bf44da2\n $fGApplicativeNaturalk1k1fgRecRecRec ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t) =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -816,15 +816,15 @@\n @t\n @f\n @g\n @x\n v\n v1\n v2)]\n-579db040836aca4ad81fe065ef7599f9\n+f1f2dc14f3462b79d2bc1e6822e12edb\n $fGApplicativeNaturalk1k1fgRecRecRec0 ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Applicative h, ApplicativeT t) =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -878,15 +878,15 @@\n @h\n @t\n @f\n @g\n @x\n v\n v1)]\n-2a734ec9846a3ca383f33925eb7bb9af\n+a094a54c4eeabca33d66a391d2f4b831\n $fGApplicativeNaturalk1k1fgRecRecRec0_$cgprod ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Applicative h, ApplicativeT t) =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -974,15 +974,15 @@\n _P) _N _N)]\n-39aed3098ba364189867067675940182\n+8db6acc5788a7f4d59f580a428d5ced6\n $fGApplicativeNaturalk1k1fgRecRecRec0_$cgpure ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Applicative h, ApplicativeT t, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (t (P 1 f) x)) (h (t f x))\n GHC.Types.~ Data.Generics.GenericN.Rec\n (h (t (P 1 g) x)) (h (t g x))) =>\n@@ -1069,15 +1069,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-1d732201d9b23fdb11a980eac2b7e912\n+400ea071ce0edca3836deb2a00e38dd6\n $fGApplicativeNaturalk1k1fgRecRecRec1 ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n ApplicativeT t =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -1124,15 +1124,15 @@\n @k'\n @k1\n @t\n @f\n @g\n @x\n v)]\n-02f8900ebc5b66c4ff1fd3549ad9b56d\n+d041669610c0470a963a95ac206465c4\n $fGApplicativeNaturalk1k1fgRecRecRec1_$cgprod ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n ApplicativeT t =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1205,15 +1205,15 @@\n _N\n _P) _N _N)]\n-7b30f11762650f3352ae5fdee4b6822b\n+f51c03223a2c91c542aa594d918c8433\n $fGApplicativeNaturalk1k1fgRecRecRec1_$cgpure ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n (ApplicativeT t, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x)\n GHC.Types.~ Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x)) =>\n Data.Proxy.Proxy 1\n@@ -1287,15 +1287,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-d93f71192e811a25b18c8f8e5925990c\n+eb7626b53a2d59cfba715e7f3447046d\n $fGApplicativeNaturalk1k1fgRecRecRec_$cgprod ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t) =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n@@ -1409,15 +1409,15 @@\n _P) _N _N)]\n-598ebc9a229ab38e913f03b9f3e4da6a\n+566d88e235593a2a2736f769d70475db\n $fGApplicativeNaturalk1k1fgRecRecRec_$cgpure ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t,\n f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (m (h (t (P 1 f) x))) (m (h (t f x)))\n@@ -1519,78 +1519,78 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-611a4c680642b46e583dd0a3836c3ca2\n+5689b5f24aa2748d958eb5b90051856a\n $tcApplicativeT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2174775567770085663#Word64\n- 7944381188582367962#Word64\n+ 5314690156032248697#Word64\n+ 3808439990830178351#Word64\n $trModule\n $tcApplicativeT2\n 2#\n $tcApplicativeT1]\n-7af8b235ee78bc6f5f264674ab51242b\n+a76a971284118ce1f46aaf1f9e1b08fe\n $tcApplicativeT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-9be4667b966a453a82e91b76d58bcaa4\n+fb6be3b7d52c2f19d27423c8def0ed26\n $tcApplicativeT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcApplicativeT3]\n-5d63451a1120a15267d7588a064c6f8b\n+a5209c0a2cd1b36c07a25e01ecfbc2a2\n $tcApplicativeT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ApplicativeT\"#]\n-b03b7f7ec41d5b4ef60ab00a10d891d9\n+3afba32b96e8348e904173cadc8abce1\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-e6c032436ee9035d9f9d8e4832b288bd\n+a8404d8876efda3f241d3b4076a270c3\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-219e1352f2543a3a3382955c79a050f4\n+811cb46b77c1decc7a101c7bd1de9ff5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ApplicativeT\"#]\n-710d6bcbe0e0380cb7af7b2f4c4362ae\n+73faedb8e11ceba8b2e2bd4760443b0c\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b45da6b034a103a97262446ca0a317ee\n+dd330928c64dcdab7d63b25a3cf59104\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-a99ce0340646a38f9575b049182a8def\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+074070de79264540541cf796d013c0ef\n type ApplicativeT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => ApplicativeT t where\n tpure :: forall (f :: k -> *) (x :: k').\n (forall (a :: k). f a) -> t f x\n default tpure :: forall (f :: k -> *) (x :: k').\n CanDeriveApplicativeT t f f x =>\n (forall (a :: k). f a) -> t f x\n tprod :: forall (f :: k -> *) (x :: k') (g :: k -> *).\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n default tprod :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n CanDeriveApplicativeT t f g x =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n-cbbd0254664fc2922e682c379a992479\n+94d1ae24736395101d409a6bef83c15e\n type CanDeriveApplicativeT :: forall {k} {k1}.\n ((k -> *) -> k1 -> *)\n -> (k -> *) -> (k -> *) -> k1 -> GHC.Types.Constraint\n type CanDeriveApplicativeT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Data.Generics.GenericN.GenericP\n@@ -1600,18 +1600,18 @@\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x))\n (Data.Generics.GenericN.RepP\n 1 (t (Data.Functor.Product.Product f g) x)))\n :: GHC.Types.Constraint\n-2e6bbdc728ef48d64284d8da1a5e8985\n+1248c8467ef46450430b9a8dc170b2f1\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-6ee3df9182f5e7d3f8dd7d265ddb3ffa\n+6912fa13bfa8d0a5d88abeef219abe6a\n gtprodDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (g :: k1 -> *) (x :: k2).\n CanDeriveApplicativeT t f g x =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1974,15 +1974,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-2835ded64dcf6c6ec5057eafb8cd4d43\n+e7ff19e5401399467ae222ca9256a89d\n gtpureDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (x :: k2).\n CanDeriveApplicativeT t f f x =>\n (forall (a :: k1). f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -2287,15 +2287,15 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-4755a536dffa72b34542174dea9563b9\n+c89a7b71ff92b7ceb5cae4db45b4ab65\n tunzip ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n ApplicativeT t =>\n t (Data.Functor.Product.Product f g) x -> (t f x, t g x)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n@@ -2324,41 +2324,41 @@\n `cast`\n (Barbies.Internal.FunctorT.N:FunctorT[0] _N _N _N)\n @(Data.Functor.Product.Product f g)\n @g\n @x\n (tunzip1 @k @f @g)\n eta)]\n-a429b6bc4a903c8e339027c5b24276de\n+1cf91e0d8928661a308a7e5868cdd4b8\n tunzip1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 b -> b }]\n-f06958c3280c22cd4e4dfcf39484bc6f\n+acac6a17eb1b6d63eff80c58f1756ffb\n tunzip2 ::\n forall {k} {g :: k -> *} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @g :: k -> *\n @f :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair a1 ds1 -> a1 }]\n-8be4ece3ae39eae97e8ab2054291029f\n+8673df67a349ae2cf7af109d88da754f\n tzip ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *) (x :: k')\n (g :: k -> *).\n ApplicativeT t =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(A,A,1L)>,\n@@ -2367,15 +2367,15 @@\n @k'\n @t :: (k -> *) -> k' -> *\n @f :: k -> *\n @x :: k'\n @g :: k -> *\n ($dApplicativeT['GHC.Types.Many] :: ApplicativeT t) ->\n tprod @k @k' @t $dApplicativeT @f @x @g]\n-42a8151822e89abb873919356fdc0652\n+d330f2b0b31b44684ce33684d371e964\n tzipWith ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a) -> t f x -> t g x -> t h x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -2398,15 +2398,15 @@\n @h\n @x\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair fa ga ->\n eta @a fa ga })\n (tprod @k @k' @t $dApplicativeT @f @x @g eta1 eta2)]\n-849c75023385973bb50888c87cceec50\n+057da6c305029e0e1fcd16a43064b63b\n tzipWith3 ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (i :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a -> i a)\n -> t f x -> t g x -> t h x -> t i x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -2444,15 +2444,15 @@\n @t\n $dApplicativeT\n @(Data.Functor.Product.Product f g)\n @x\n @h\n (tprod @k @k' @t $dApplicativeT @f @x @g eta1 eta2)\n eta3)]\n-0425deaa0877b3ffee1c1fdf4d05f678\n+487b69261ee783048fa31f8edc0ffed1\n tzipWith4 ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (i :: k -> *) (j :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a -> i a -> j a)\n -> t f x -> t g x -> t h x -> t i x -> t j x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.BareB [orphan module] 9066\n- interface hash: 631db5b751f0a56a87515b3c94a2a8af\n- ABI hash: 38a94147d4ffbde195fb7c8c1cfe9808\n- export-list hash: f8d13d389494b14dd924f2036dae95e2\n- orphan hash: ddc18f835ee4a2c5a0b2b959655ab42e\n+ interface hash: 10d13f23b453d86130dc9df8c107fb30\n+ ABI hash: d3e28c114fb0832862f8cddb8501b23d\n+ export-list hash: a7b9fd0c1d317c912311e4de9dfc94ac\n+ orphan hash: afe535dc7f2bb10566782836c657f9df\n flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 47184b6e10fdf7c871eb89be90529266\n sig of: Nothing\n used TH splices: False\n@@ -24,58 +24,58 @@\n gbstripDefault\n BareB{bcover bstrip}\n CanDeriveBareB\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n Barbies.Internal.Wear.WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare eea274642dff5789bea4aa894d8bc07f\n- exports: 5efe914a4cb0ec7fc6958e082b874fad\n- GBare 1fa6fd25559727210b03f78d5a832c96\n- gcover 798bc1b3653e7aaf5fe2cd589c9308a9\n- gstrip 5a28e1c990a9ea713936b0047d74455a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- exports: 78c8bc7934601c506594bbc6e00d10b4\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n- WearTwo d06bb9da09839e1cb4a0a098d403587b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare a5b23d7863b024acf164c15bb8693348\n+ exports: f2d1301649e8e0815e7e8a010693dc83\n+ GBare f7a5f5d4610bc604f4543e1673e035fc\n+ gcover e06a5bc294e23d292ae60b92cc292599\n+ gstrip bdf2060a01b3aa9c104d7708c47a1ab3\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ exports: 0844baf41368bc42b02e1f4080c4e399\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n+ WearTwo d957b83cc662451223c70d0fed19a0ad\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-26a42dc8d3ec3a74ad19b39c840a0b2d\n+59fc92d9e59de6c903576d030f620078\n $dmbcover ::\n (BareB b, CanDeriveBareB b) =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -409,15 +409,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-4a02c865f2ce61ae1fd0e373ccae1ce8\n+7ae8c66ab70de3cddc8b2b6764032a1f\n $dmbstrip ::\n (BareB b, CanDeriveBareB b) =>\n b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -750,15 +750,15 @@\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-3659b5e51ba1b048cea8bae4a2aaf70f\n+85bfca51159b65e860dd923bd766bb3d\n $fGBarek0RecRec ::\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))))\n@@ -790,15 +790,15 @@\n @(Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity))))\n (m (h (b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity))))\n ($fGBarek0RecRec_$cgstrip @k @h @m @b v v1 v2)\n ($fGBarek0RecRec_$cgcover @k @h @m @b v v1 v2)]\n-15aee4f3ab03532d3d547eff99e541bf\n+1583cad65470feb779ed03615d04d917\n $fGBarek0RecRec0 ::\n (GHC.Base.Functor h, BareB b) =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity)))\n@@ -826,15 +826,15 @@\n Data.Functor.Identity.Identity)))\n @(Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity)))\n (h (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)))\n ($fGBarek0RecRec0_$cgstrip @k @h @b v v1)\n ($fGBarek0RecRec0_$cgcover @k @h @b v v1)]\n-160c6d266b935fc7c3e32c14193ba4f4\n+121f691404f2aa60045874e2ba253b5d\n $fGBarek0RecRec0_$cgcover ::\n forall k (h :: * -> *) (b :: * -> (* -> *) -> *) (x :: k).\n (GHC.Base.Functor h, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity)))\n@@ -903,15 +903,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-cc4411ea43e744291d834f4e0cff524b\n+892d7b8c00b1d73e01f3f315d5886844\n $fGBarek0RecRec0_$cgstrip ::\n forall k (h :: * -> *) (b :: * -> (* -> *) -> *) (x :: k).\n (GHC.Base.Functor h, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity)))\n@@ -981,15 +981,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-ea6d8e74106bca5d0a212434da4cb829\n+d5d0f392ce07b41a8f980dc9c94018a6\n $fGBarek0RecRec1 ::\n BareB b =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))\n@@ -1010,15 +1010,15 @@\n (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity))\n @(Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Bare (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity))\n ($fGBarek0RecRec1_$cgstrip @k @b v)\n ($fGBarek0RecRec1_$cgcover @k @b v)]\n-bbebcbc127670b9b210c97ceaaea0102\n+aed08adf421479fd87ba4c39c3159f28\n $fGBarek0RecRec1_$cgcover ::\n forall k (b :: * -> (* -> *) -> *) (x :: k).\n BareB b =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Bare (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)\n@@ -1078,15 +1078,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-90d455421d727d74b199442353d577a9\n+ebce86cadc0b9520a43c31233a427c83\n $fGBarek0RecRec1_$cgstrip ::\n forall k (b :: * -> (* -> *) -> *) (x :: k).\n BareB b =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))\n@@ -1146,15 +1146,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-b6f88dde1a3934946982fc0d8e36e2e2\n+8e41983c5b2489a6e4aa08703999d0f8\n $fGBarek0RecRec_$cgcover ::\n forall k (h :: * -> *) (m :: * -> *) (b :: * -> (* -> *) -> *)\n (x :: k).\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Bare\n@@ -1235,15 +1235,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-4bf88783ebf70681a0294cef31de33f4\n+d10d59df902107617277dd14b1f1d8eb\n $fGBarek0RecRec_$cgstrip ::\n forall k (h :: * -> *) (m :: * -> *) (b :: * -> (* -> *) -> *)\n (x :: k).\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Covered\n@@ -1324,89 +1324,89 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-cf70bf9827f927f2e6aca957d49bd251\n+5bff3291bd372309402700719db553e3\n $tc'C:BareB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4941010144831907686#Word64\n- 1802117142514650686#Word64\n+ 17369628445867202523#Word64\n+ 15273525099231623016#Word64\n $trModule\n $tc'C:BareB2\n 1#\n $tc'C:BareB1]\n-44724315a557e42ef463968a97d24100\n+664e2cd7386151fc9ed08c57dd950943\n $tc'C:BareB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-caaef38a59ff0fc77b1097deaf4c8250\n+57003f758647f959710522f6fb3a9ba4\n $tc'C:BareB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:BareB3]\n-c1ce8a5620ad4c07b4a63885655493af\n+8dfe1b363a193c7e25a61438aca96c8c\n $tc'C:BareB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:BareB\"#]\n-69ce5ee10111f5f83f3c281e49b9ebca\n+7281865974919b27ba33dd997f67662e\n $tcBareB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12408751399799494786#Word64\n- 17317989649187227099#Word64\n+ 14547949720316224678#Word64\n+ 3984888836056252279#Word64\n $trModule\n $tcBareB2\n 0#\n $tcBareB1]\n-f48b572b90268d4c8289a57be40cd106\n+232fc67e137303c06cec495e59bcd77c\n $tcBareB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-6b64d91fb84f5fcd620bcdb3ce0a4b1f\n+761d03bfeeabfa239fdb17257bd021e9\n $tcBareB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBareB3]\n-6083a67360363a582a5e85f92977a867\n+77c0cbdc7f64d66ce5905af2479d8813\n $tcBareB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"BareB\"#]\n-2a5d51af1eddfb85a2a168c5fa83fe91\n+558a196b4b91a0ff9d3f549314a138d2\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-4a27aa3d06dedb567414ee7fed14439e\n+1fcd04fdf4cd4def939132a4e839afc4\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-6ae4f6ff3c0a3a0de43c21f8e104862e\n+0ee6acbf3acebc0ccd26403f766378b4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.BareB\"#]\n-16c9a05a73cea28394eeb9c3908d9b22\n+d744b2082c413623398bd06c154dac91\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-716b5bae04f7f78cec84259c23abc769\n+8ae83cb6f8f4e4406442d380d3ae6cd5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-bcf15620d7682b808f4118663aa4e5cc\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+58d9792e504da07df01978f0d0a5f22f\n type BareB :: (* -> (* -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB\n (b Barbies.Internal.Wear.Covered) =>\n BareB b where\n bstrip :: b Barbies.Internal.Wear.Covered\n Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n@@ -1415,32 +1415,32 @@\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n bcover :: b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n default bcover :: CanDeriveBareB b =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n-37dd3b0cc0aa8fa0a94782ca7f4983ac\n+fad55d4df895d2b99afb03984f854705\n type CanDeriveBareB :: (* -> (* -> *) -> *) -> GHC.Types.Constraint\n type CanDeriveBareB b =\n (Data.Generics.GenericN.GenericP\n 0 (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity),\n Data.Generics.GenericN.GenericP\n 0 (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity),\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.RepP\n 0 (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity))\n (Data.Generics.GenericN.RepP\n 0 (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)))\n :: GHC.Types.Constraint\n-9368e2556f989b081020a1a0e6fd222a\n+8d663956584db6991c7008e9f47805d2\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-9708da690fb1f9a60bcfc18b74176b54\n+5c6dd91de74c772d93b84a17d8555354\n bcoverWith ::\n BareB b =>\n (forall a. a -> f a)\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -1468,15 +1468,15 @@\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n []\n = bcover @b $dBareB\n } in\n \\ (x['GHC.Types.Many] :: b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity) ->\n f1 (g x)]\n-753b1d3583db6faad7e7a3c7cfc8582a\n+eb6b6f334cf2a31b9d24a4025731c738\n bstripFrom ::\n BareB b =>\n (forall a. f a -> a)\n -> b Barbies.Internal.Wear.Covered f\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -1507,15 +1507,15 @@\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R))\n } in\n \\ (x['GHC.Types.Many] :: b Barbies.Internal.Wear.Covered f) ->\n f1 (g x)]\n-dd0d1b6fd32449e8bbf20699395853f1\n+c4138ef5c4d247dc310f037f26ac1fdb\n gbcoverDefault ::\n CanDeriveBareB b =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1849,15 +1849,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-4c0143e67935f6cf725de148b8cf0a35\n+64f64a91fdeb2cec17f6fec983d6b90a\n gbstripDefault ::\n CanDeriveBareB b =>\n b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Inline: (sat-args=0),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.BareB [orphan module] 9066\n- interface hash: 631db5b751f0a56a87515b3c94a2a8af\n- ABI hash: 38a94147d4ffbde195fb7c8c1cfe9808\n- export-list hash: f8d13d389494b14dd924f2036dae95e2\n- orphan hash: ddc18f835ee4a2c5a0b2b959655ab42e\n+ interface hash: 10d13f23b453d86130dc9df8c107fb30\n+ ABI hash: d3e28c114fb0832862f8cddb8501b23d\n+ export-list hash: a7b9fd0c1d317c912311e4de9dfc94ac\n+ orphan hash: afe535dc7f2bb10566782836c657f9df\n flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 47184b6e10fdf7c871eb89be90529266\n sig of: Nothing\n used TH splices: False\n@@ -24,58 +24,58 @@\n gbstripDefault\n BareB{bcover bstrip}\n CanDeriveBareB\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n Barbies.Internal.Wear.WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare eea274642dff5789bea4aa894d8bc07f\n- exports: 5efe914a4cb0ec7fc6958e082b874fad\n- GBare 1fa6fd25559727210b03f78d5a832c96\n- gcover 798bc1b3653e7aaf5fe2cd589c9308a9\n- gstrip 5a28e1c990a9ea713936b0047d74455a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- exports: 78c8bc7934601c506594bbc6e00d10b4\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n- WearTwo d06bb9da09839e1cb4a0a098d403587b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare a5b23d7863b024acf164c15bb8693348\n+ exports: f2d1301649e8e0815e7e8a010693dc83\n+ GBare f7a5f5d4610bc604f4543e1673e035fc\n+ gcover e06a5bc294e23d292ae60b92cc292599\n+ gstrip bdf2060a01b3aa9c104d7708c47a1ab3\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ exports: 0844baf41368bc42b02e1f4080c4e399\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n+ WearTwo d957b83cc662451223c70d0fed19a0ad\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-26a42dc8d3ec3a74ad19b39c840a0b2d\n+59fc92d9e59de6c903576d030f620078\n $dmbcover ::\n (BareB b, CanDeriveBareB b) =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -409,15 +409,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-4a02c865f2ce61ae1fd0e373ccae1ce8\n+7ae8c66ab70de3cddc8b2b6764032a1f\n $dmbstrip ::\n (BareB b, CanDeriveBareB b) =>\n b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -750,15 +750,15 @@\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-3659b5e51ba1b048cea8bae4a2aaf70f\n+85bfca51159b65e860dd923bd766bb3d\n $fGBarek0RecRec ::\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))))\n@@ -790,15 +790,15 @@\n @(Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity))))\n (m (h (b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity))))\n ($fGBarek0RecRec_$cgstrip @k @h @m @b v v1 v2)\n ($fGBarek0RecRec_$cgcover @k @h @m @b v v1 v2)]\n-15aee4f3ab03532d3d547eff99e541bf\n+1583cad65470feb779ed03615d04d917\n $fGBarek0RecRec0 ::\n (GHC.Base.Functor h, BareB b) =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity)))\n@@ -826,15 +826,15 @@\n Data.Functor.Identity.Identity)))\n @(Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity)))\n (h (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)))\n ($fGBarek0RecRec0_$cgstrip @k @h @b v v1)\n ($fGBarek0RecRec0_$cgcover @k @h @b v v1)]\n-160c6d266b935fc7c3e32c14193ba4f4\n+121f691404f2aa60045874e2ba253b5d\n $fGBarek0RecRec0_$cgcover ::\n forall k (h :: * -> *) (b :: * -> (* -> *) -> *) (x :: k).\n (GHC.Base.Functor h, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity)))\n@@ -903,15 +903,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-cc4411ea43e744291d834f4e0cff524b\n+892d7b8c00b1d73e01f3f315d5886844\n $fGBarek0RecRec0_$cgstrip ::\n forall k (h :: * -> *) (b :: * -> (* -> *) -> *) (x :: k).\n (GHC.Base.Functor h, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity)))\n@@ -981,15 +981,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-ea6d8e74106bca5d0a212434da4cb829\n+d5d0f392ce07b41a8f980dc9c94018a6\n $fGBarek0RecRec1 ::\n BareB b =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))\n@@ -1010,15 +1010,15 @@\n (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity))\n @(Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Bare (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity))\n ($fGBarek0RecRec1_$cgstrip @k @b v)\n ($fGBarek0RecRec1_$cgcover @k @b v)]\n-bbebcbc127670b9b210c97ceaaea0102\n+aed08adf421479fd87ba4c39c3159f28\n $fGBarek0RecRec1_$cgcover ::\n forall k (b :: * -> (* -> *) -> *) (x :: k).\n BareB b =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Bare (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)\n@@ -1078,15 +1078,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-90d455421d727d74b199442353d577a9\n+ebce86cadc0b9520a43c31233a427c83\n $fGBarek0RecRec1_$cgstrip ::\n forall k (b :: * -> (* -> *) -> *) (x :: k).\n BareB b =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))\n@@ -1146,15 +1146,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-b6f88dde1a3934946982fc0d8e36e2e2\n+8e41983c5b2489a6e4aa08703999d0f8\n $fGBarek0RecRec_$cgcover ::\n forall k (h :: * -> *) (m :: * -> *) (b :: * -> (* -> *) -> *)\n (x :: k).\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Bare\n@@ -1235,15 +1235,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-4bf88783ebf70681a0294cef31de33f4\n+d10d59df902107617277dd14b1f1d8eb\n $fGBarek0RecRec_$cgstrip ::\n forall k (h :: * -> *) (m :: * -> *) (b :: * -> (* -> *) -> *)\n (x :: k).\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Covered\n@@ -1324,89 +1324,89 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-cf70bf9827f927f2e6aca957d49bd251\n+5bff3291bd372309402700719db553e3\n $tc'C:BareB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4941010144831907686#Word64\n- 1802117142514650686#Word64\n+ 17369628445867202523#Word64\n+ 15273525099231623016#Word64\n $trModule\n $tc'C:BareB2\n 1#\n $tc'C:BareB1]\n-44724315a557e42ef463968a97d24100\n+664e2cd7386151fc9ed08c57dd950943\n $tc'C:BareB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-caaef38a59ff0fc77b1097deaf4c8250\n+57003f758647f959710522f6fb3a9ba4\n $tc'C:BareB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:BareB3]\n-c1ce8a5620ad4c07b4a63885655493af\n+8dfe1b363a193c7e25a61438aca96c8c\n $tc'C:BareB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:BareB\"#]\n-69ce5ee10111f5f83f3c281e49b9ebca\n+7281865974919b27ba33dd997f67662e\n $tcBareB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12408751399799494786#Word64\n- 17317989649187227099#Word64\n+ 14547949720316224678#Word64\n+ 3984888836056252279#Word64\n $trModule\n $tcBareB2\n 0#\n $tcBareB1]\n-f48b572b90268d4c8289a57be40cd106\n+232fc67e137303c06cec495e59bcd77c\n $tcBareB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-6b64d91fb84f5fcd620bcdb3ce0a4b1f\n+761d03bfeeabfa239fdb17257bd021e9\n $tcBareB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBareB3]\n-6083a67360363a582a5e85f92977a867\n+77c0cbdc7f64d66ce5905af2479d8813\n $tcBareB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"BareB\"#]\n-2a5d51af1eddfb85a2a168c5fa83fe91\n+558a196b4b91a0ff9d3f549314a138d2\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-4a27aa3d06dedb567414ee7fed14439e\n+1fcd04fdf4cd4def939132a4e839afc4\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-6ae4f6ff3c0a3a0de43c21f8e104862e\n+0ee6acbf3acebc0ccd26403f766378b4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.BareB\"#]\n-16c9a05a73cea28394eeb9c3908d9b22\n+d744b2082c413623398bd06c154dac91\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-716b5bae04f7f78cec84259c23abc769\n+8ae83cb6f8f4e4406442d380d3ae6cd5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-bcf15620d7682b808f4118663aa4e5cc\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+58d9792e504da07df01978f0d0a5f22f\n type BareB :: (* -> (* -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB\n (b Barbies.Internal.Wear.Covered) =>\n BareB b where\n bstrip :: b Barbies.Internal.Wear.Covered\n Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n@@ -1415,32 +1415,32 @@\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n bcover :: b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n default bcover :: CanDeriveBareB b =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n-37dd3b0cc0aa8fa0a94782ca7f4983ac\n+fad55d4df895d2b99afb03984f854705\n type CanDeriveBareB :: (* -> (* -> *) -> *) -> GHC.Types.Constraint\n type CanDeriveBareB b =\n (Data.Generics.GenericN.GenericP\n 0 (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity),\n Data.Generics.GenericN.GenericP\n 0 (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity),\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.RepP\n 0 (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity))\n (Data.Generics.GenericN.RepP\n 0 (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)))\n :: GHC.Types.Constraint\n-9368e2556f989b081020a1a0e6fd222a\n+8d663956584db6991c7008e9f47805d2\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-9708da690fb1f9a60bcfc18b74176b54\n+5c6dd91de74c772d93b84a17d8555354\n bcoverWith ::\n BareB b =>\n (forall a. a -> f a)\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -1468,15 +1468,15 @@\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n []\n = bcover @b $dBareB\n } in\n \\ (x['GHC.Types.Many] :: b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity) ->\n f1 (g x)]\n-753b1d3583db6faad7e7a3c7cfc8582a\n+eb6b6f334cf2a31b9d24a4025731c738\n bstripFrom ::\n BareB b =>\n (forall a. f a -> a)\n -> b Barbies.Internal.Wear.Covered f\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -1507,15 +1507,15 @@\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R))\n } in\n \\ (x['GHC.Types.Many] :: b Barbies.Internal.Wear.Covered f) ->\n f1 (g x)]\n-dd0d1b6fd32449e8bbf20699395853f1\n+c4138ef5c4d247dc310f037f26ac1fdb\n gbcoverDefault ::\n CanDeriveBareB b =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1849,15 +1849,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-4c0143e67935f6cf725de148b8cf0a35\n+64f64a91fdeb2cec17f6fec983d6b90a\n gbstripDefault ::\n CanDeriveBareB b =>\n b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Inline: (sat-args=0),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.ConstraintsB [orphan module] [family instance module] 9066\n- interface hash: 5cf08429e83c942ef5d4185ef0d45239\n- ABI hash: d5cf5b2e50a347a0b6a54eab76d6ad99\n- export-list hash: 41dc42c9b5d65e5c886ca7692e13de47\n- orphan hash: 2d17a622c0544deff227a7237a581649\n+ interface hash: ee6a09c55c2852b82fb6390cb78ad8da\n+ ABI hash: 4ae0a3b1bcbf592d64b003f8812da757\n+ export-list hash: caf62448a6f65d00f18d65dc1b92275e\n+ orphan hash: 8e52ba0023cdaee7c677ea386972d7d9\n flag hash: 01096dcc2acfdba6cc4b15f0c3cfe511\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 16c69e23b69cf160ffe86c7b9b352b22\n sig of: Nothing\n used TH splices: False\n@@ -31,81 +31,81 @@\n &\n AllBF\n CanDeriveConstraintsB\n ConstraintsB{AllB baddDicts}\n GAllRepB\n TagSelf0\n TagSelf0'\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Data.Generics.GenericN Control.Applicative Control.Arrow\n Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints dbe4a74ad57c80c8783d07b1647baa9b\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll aa7b4f673c4e9bfa97e7a1c50731e7fd\n- GConstraints a7e9e23d9fc65479302c9d3c0ace9820\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- gaddDicts a8fe95c5e3b8e807206efdc59867b319\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- fromN 1b8038624d1891d55a7bd44a4cadea42\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 0aa87421cc66b72ee5cd089f3a525bd7\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll 4c84a1c336cdb79298bdd95cd66df075\n+ GConstraints 5c512afe7415c41c93750c1e4c738a80\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ gaddDicts 651db21d9dcf3f4c243e7d171c34079a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ fromN cc2678f628cd15ffd0813e57882d7db1\n+ toN 46484572a2091aa1d37095fef03b9792\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-a48dcf7a604d7ba2f7a4f3857a794226\n+6ddf2c48a46d23e126ae92150a233293\n $dmbaddDicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (ConstraintsB b, CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -343,15 +343,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-624346ee2211d05cca5a182f265bc4a2\n+dca31bc9e7b2f2c8ae67d5a7486f3c88\n $f&kcda ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k)\n (d :: k -> GHC.Types.Constraint).\n (c a, d a) =>\n (&) c d a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -359,15 +359,15 @@\n Unfolding: DFun: @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n @d :: k -> GHC.Types.Constraint\n (v['GHC.Types.Many] :: c a)\n (v1['GHC.Types.Many] :: d a).\n @k @c @d @a v v1]\n-1ac6e187376da5ec6bfd16dd3af4fe23\n+6f8d36fdf406aef6e8eaa12eb63cbd56\n $fConstraintsBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (GHC.Base.Functor f, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n@@ -385,15 +385,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkCompose_$cbaddDicts @k @f @b v v1)]\n-00fc7959bb65f3450d41015a3995d08b\n+6971504ab75846d520d4295ec0d6e47c\n $fConstraintsBkCompose1 ::\n forall {k} {f :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (GHC.Base.Functor f, ConstraintsB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1 -> f (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -419,15 +419,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-6672cf7a3cb68820be890aac054e7564\n+0a4d7d92a21a0a513425059cf52dd099\n $fConstraintsBkCompose_$cbaddDicts ::\n forall k (f :: * -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f1 :: k -> *).\n (GHC.Base.Functor f, ConstraintsB b,\n AllB c (Data.Functor.Compose.Compose f b)) =>\n Data.Functor.Compose.Compose f b f1\n -> Data.Functor.Compose.Compose\n@@ -480,28 +480,28 @@\n *>_N\n _R\n _N\n _N))]\n-f4bcca24bb5956261af66bebfbe44960\n+4e5b39868192fbde61aa0c5159787ec9\n $fConstraintsBkConst :: ConstraintsB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ConstraintsB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkConst_$cbaddDicts @k @a)]\n-313e5da84147848325315a26eab692ca\n+4f109cb5de62971c02f23e2e260de836\n $fConstraintsBkConst_$cbaddDicts ::\n forall k a (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n AllB c (Data.Functor.Const.Const a) =>\n Data.Functor.Const.Const a f\n -> Data.Functor.Const.Const\n a (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -523,15 +523,15 @@\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-98f9f330dd5e379a9e7d080925bf6a89\n+266dc58832f676b31c436ca990631c3b\n $fConstraintsBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ConstraintsB a, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -545,15 +545,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fConstraintsBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkProduct_$cbaddDicts @k @a @b v v1)]\n-fa5ca5815ce066eb03e083eb2c788bed\n+6237e1ed78a61f0017fbe8c4f3930f75\n $fConstraintsBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ConstraintsB a, ConstraintsB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -587,15 +587,15 @@\n (($p1ConstraintsB @k @b $dConstraintsB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-6ac8f38d0f84c540733ca4431c7f6f96\n+3564b593c94ce1f1c04444abe42aa428\n $fConstraintsBkProduct_$cbaddDicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n (ConstraintsB a, ConstraintsB b,\n AllB c (Data.Functor.Product.Product a b)) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product\n@@ -641,28 +641,28 @@\n @c\n @f\n (GHC.Classes.$p1(%,%)\n @(AllB c a)\n @(AllB c b)\n irred `cast` (Sub (D:R:AllBkcProduct[0] _N _N _N _N)))\n y) }]\n-18d1b54bab9caf82c56685d768449170\n+6f36114cdfe0f17e5cb5eb8af8747143\n $fConstraintsBkProxy :: ConstraintsB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ConstraintsB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkProxy_$cbaddDicts @k)]\n-fea6998aca9cffdefba83e92c9b436ba\n+c0782563a1576397172df3d0d2517b28\n $fConstraintsBkProxy_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n AllB c Data.Proxy.Proxy =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -672,15 +672,15 @@\n @c :: k -> GHC.Types.Constraint\n @f :: k -> *\n (irred['GHC.Types.Many] :: AllB c Data.Proxy.Proxy)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n Data.Proxy.Proxy\n @(k -> *)\n @(Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)]\n-db9cc93e2e464cb698ff839dd411a867\n+83b8f9877521fc331c8e7eeed0d1cb7e\n $fConstraintsBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ConstraintsB a, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -694,15 +694,15 @@\n @k\n @(Data.Functor.Sum.Sum a b)\n ($fConstraintsBkSum1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkSum_$cbaddDicts @k @a @b v v1)]\n-8903cd8247de4265444a023b10913ef5\n+9e78699170983db1e5e91c59d370a023\n $fConstraintsBkSum1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ConstraintsB a, ConstraintsB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -741,15 +741,15 @@\n (($p1ConstraintsB @k @b $dConstraintsB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n x) }]\n-09fd54a7c257fd1e04b17ed7b0dfece9\n+ceb8059b75ca3e3b0636397c45135e11\n $fConstraintsBkSum_$cbaddDicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n (ConstraintsB a, ConstraintsB b,\n AllB c (Data.Functor.Sum.Sum a b)) =>\n Data.Functor.Sum.Sum a b f\n -> Data.Functor.Sum.Sum\n@@ -801,15 +801,15 @@\n @c\n @f\n (GHC.Classes.$p1(%,%)\n @(AllB c a)\n @(AllB c b)\n irred `cast` (Sub (D:R:AllBkcSum[0] _N _N _N _N)))\n x) }]\n-3de7d1273f56a424ab9a03c430f324d7\n+60449329ab8c7fdda623672126de50ab\n $fGConstraintskFUNk20cfOtherRecRec ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *).\n (ConstraintsB b, AllB c b) =>\n Barbies.Generics.Constraints.GConstraints\n 0\n c\n@@ -852,15 +852,15 @@\n _N))]\n-1360652fab8bcb84fda25bf085447996\n+30d0aca992218ddc340549d47e81935a\n $fGConstraintskFUNk20cfOtherRecRec_$cgaddDicts ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *) (x :: k2).\n (ConstraintsB b, AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -922,15 +922,15 @@\n (P 0\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c)\n f))>_P) _N _N)]\n-c92f51c0c5c913496010b308524ec37e\n+5b54fbef555fcc37e2a4af26414265b4\n $fGConstraintskFUNk20cfSelfRecRec ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *).\n (ConstraintsB b, AllB c b) =>\n Barbies.Generics.Constraints.GConstraints\n 0\n c\n@@ -973,15 +973,15 @@\n _N))]\n-769b9394a7f0cdd1f259748791fafb6e\n+df65d619e64c6f72e548b67be26e141f\n $fGConstraintskFUNk20cfSelfRecRec_$cgaddDicts ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *) (x :: k2).\n (ConstraintsB b, AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -1043,125 +1043,125 @@\n (P 0\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c)\n f))>_P) _N _N)]\n-6ad532b0cdc3e4175729d36d4a038a4a\n+d791e53b546c637b960ef4317094156a\n $tc& :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 9916593666458410452#Word64\n- 6421382771094541799#Word64\n+ 13020177785925179189#Word64\n+ 13045564775080930199#Word64\n $trModule\n $tc&2\n 1#\n $tc&1]\n-664fe3a32555d4ba5e59d5866ac1ea8f\n+0683cdde772e86d7fec7660a89d46792\n $tc&1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-870dfb418baa49f35a25e6fd0c2b791e\n+9c3f28f3c76ac7900b65d4af5f178608\n $tc&2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc&3]\n-ccf50e19a2c406c7c61edf2717476667\n+d7ee572e151fa2081ce8cb0b3e6be61e\n $tc&3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"&\"#]\n-74217d3c45e605cdfd82405f4e52b32b\n+70be536031de29ef62af06c0461269fb\n $tc'C:& :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 474288608462590941#Word64\n- 9955219644725953820#Word64\n+ 13600891077135783734#Word64\n+ 1264298178773356223#Word64\n $trModule\n $tc'C:&2\n 4#\n $tc'C:&1]\n-f86d2f8f289d0adfbad0171291a47937\n+352019ac8b7e9b04b5b2516248940c78\n $tc'C:&1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-72906164755f082c1d25c9f36cfc301e\n+00fc86b3afd83e622a0de74ef76b3862\n $tc'C:&2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:&3]\n-2e1cc2748acde679e3999f4d3ef0fcf8\n+7321bde29f98a1a3a9b8490234e57b5f\n $tc'C:&3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:&\"#]\n-777a7956bdcb8bd05f7f53a72a665edd\n+c68ec15afb5c1db6204b07410cd105ee\n $tcConstraintsB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17562922986110815955#Word64\n- 3041427980261312880#Word64\n+ 10331265717288792012#Word64\n+ 5256121533431306349#Word64\n $trModule\n $tcConstraintsB2\n 1#\n $tcConstraintsB1]\n-9dc7264d6836117c057abd9543313c55\n+de6fa0bfb5a16ab6cd9ca02253e7e04c\n $tcConstraintsB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-dba5d75f96a06700974ed15154137856\n+716e21701fce84b6cfcffd19a567e2e7\n $tcConstraintsB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcConstraintsB3]\n-4866f9d34e93649c69921c3e01a25a74\n+99fee2e27e393d3636e342854147262a\n $tcConstraintsB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ConstraintsB\"#]\n-ba979df07ab192ca0d94fc0553d5a406\n+7bc93d5d8d078050ff07153c920cca55\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-60f8ed0be815a1363491b6e0b44f29f8\n+a01b20b0b1b6abf6eb979966ecd5089e\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-ccf52b1159d8028d0f6d8a77c05012ca\n+ce03d08066a768b265ffa39023a5bf26\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ConstraintsB\"#]\n-f91611ee3094818f510904066ad22ffa\n+293b354515c26af92b28ef00562774d2\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-5481a219b476509eaf34af9d4a7dd7ec\n+2e3299417754caf3098a089832e07228\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-b4981f1f879e533cf698bb596a0c96e2\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+262e3f2037fcd8d28cf63dfb107609ac\n type (&) :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> (k -> GHC.Types.Constraint) -> k -> GHC.Types.Constraint\n class (c a, d a) => (&) c d a\n-2acd8b5cdd2cb99d4266e8a727833036\n+d3a68478c2f8bf7482b8ff9a93156c9c\n type AllBF :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> ((k1 -> *) -> *) -> GHC.Types.Constraint\n type AllBF c f b =\n AllB (Barbies.Internal.Dicts.ClassF c f) b :: GHC.Types.Constraint\n-bcd864131a6ba6fa8f09696b46d36f0c\n+33754fdadbd4a4ef9739bb32b1847391\n type CanDeriveConstraintsB :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveConstraintsB c b f =\n (Data.Generics.GenericN.GenericN (b f),\n Data.Generics.GenericN.GenericN\n (b (Data.Functor.Product.Product\n@@ -1174,15 +1174,15 @@\n f\n (GAllRepB b)\n (Data.Generics.GenericN.RepN (b f))\n (Data.Generics.GenericN.RepN\n (b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))))\n :: GHC.Types.Constraint\n-6740c2f85a112fac7087ebced670b2a1\n+d993e9a93ed2b624d6fc8e9a1a4c46b7\n type ConstraintsB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => ConstraintsB b where\n type AllB :: forall k.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> GHC.Types.Constraint\n type family AllB c b open\n@@ -1194,56 +1194,56 @@\n (Barbies.Internal.Dicts.Dict c) f)\n default baddDicts :: forall (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n-00cc3bfafe9720f6f9cbcb4b382566e5\n+f92e6717310a49cbca06c97d2b2a4082\n axiom D:R:AllBkcCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Compose.Compose f b) = AllB c b\n-800c2131de5cf5699f6b145ccdb34fd0\n+71482b0c0a0d7985d1ea76dc304c25f0\n axiom D:R:AllBkcConst ::\n forall k a (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Const.Const a) = () :: Constraint\n-21bda4ed75f983040ecec59226afcaf2\n+42c842c1f4e70da8221923a9f431005c\n axiom D:R:AllBkcProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Product.Product a b) = (AllB c a, AllB c b)\n-1083bbcc29a2ce6015c27a0262445b27\n+5c141780bae974870e1225e0ec0ac2df\n axiom D:R:AllBkcProxy ::\n forall k (c :: k -> GHC.Types.Constraint).\n AllB c Data.Proxy.Proxy = () :: Constraint\n-58cac0c51e953b86b71ada4db63f53ea\n+f935c0104d46bc9d23268b8c9a7dd19e\n axiom D:R:AllBkcSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Sum.Sum a b) = (AllB c a, AllB c b)\n-ca4590922fa02aa4cee822521d0e83b9\n+276c84d3a38583cfd72d72a6431255d1\n axiom D:R:GAllk10cOther ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint)\n (b' :: (k2 -> *) -> *) (b :: (k1 -> *) -> *).\n Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Generics.Constraints.Other\n (b' (P 0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))\n = AllB c b\n-1dba987522bf49ed2095c8660935a63f\n+bea52ce91f849e20fecc87f1ef102872\n axiom D:R:GAllk10cSelf ::\n forall k1 k2 k3 (c :: k1 -> GHC.Types.Constraint)\n (b' :: (k2 -> *) -> *) (b :: (k3 -> *) -> *).\n Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Generics.Constraints.Self\n (b' (P 0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))\n = () :: Constraint\n-64cb59c37b2de5b5d39c88ffc4b6658d\n+10d13911372461e3e93fafa5ab0c77e7\n axiom D:R:TagSelf0' ::\n forall kf (b :: kf -> *) mt (m :: GHC.Generics.Meta) (s :: * -> *).\n TagSelf0' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf0' b s)\n forall kf (b :: kf -> *) (l :: * -> *) (r :: * -> *).\n TagSelf0' b (l GHC.Generics.:+: r)\n = TagSelf0' b l GHC.Generics.:+: TagSelf0' b r\n@@ -1257,28 +1257,28 @@\n forall kf (b :: kf -> *) x y.\n TagSelf0' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.V1 = GHC.Generics.V1\n-b55e3d91b41ad97ba9417bc021683df5\n+9dc63ee0afcec57e5fc2662b4e967df7\n type GAllRepB :: forall {k}. ((k -> *) -> *) -> * -> *\n type GAllRepB b = TagSelf0 b :: * -> *\n-531e420141742a483ad3f2f9c3b992df\n+352bd6c4a2d8a671e116f35b86938fae\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-a549a87741384e082d41639454945afe\n+33c26af4c4a417ef94ae57db4326b7e5\n type TagSelf0 :: forall {k}. ((k -> *) -> *) -> * -> *\n type TagSelf0 b =\n TagSelf0'\n (Data.Generics.GenericN.Indexed b 1)\n (Data.Generics.GenericN.RepN (b Barbies.Generics.Constraints.X))\n :: * -> *\n-7b11e28adaee2aeb7bc8f0ae7f9e8da4\n+bb4b36d5ac6ed04a6e8a365456d7e936\n type TagSelf0' :: forall kf. (kf -> *) -> (* -> *) -> * -> *\n type family TagSelf0' b repbf where\n forall kf (b :: kf -> *) mt (m :: GHC.Generics.Meta) (s :: * -> *).\n TagSelf0' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf0' b s)\n forall kf (b :: kf -> *) (l :: * -> *) (r :: * -> *).\n TagSelf0' b (l GHC.Generics.:+: r)\n@@ -1294,15 +1294,15 @@\n TagSelf0' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:TagSelf0'\n-910fbbe9a576863e35439a6fbd62de33\n+971aaafe6ea6c47c3cae87482166403e\n bdicts ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *).\n (ConstraintsB b, Barbies.Internal.ApplicativeB.ApplicativeB b,\n AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1330,30 +1330,30 @@\n irred\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy @k)))]\n-df0469502f2cb597afaef1f210e0460d\n+fd9bec55821a7b6fff92e0e47132cbe2\n bdicts1 ::\n forall {k} {c :: k -> GHC.Types.Constraint} {a :: k}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a\n -> Barbies.Internal.Dicts.Dict c a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(L),A)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a) ->\n case ds of wild { Data.Functor.Product.Pair c1 ds1 -> c1 }]\n-8dc0380a9c23f3ae49fefd9813306c8e\n+47cc19f97daa118ea2596279457634d7\n bfoldMapC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *) m\n (f :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB b, ConstraintsB b,\n AllB c b, GHC.Base.Monoid m) =>\n (forall (a :: k). c a => f a -> m) -> b f -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1395,15 +1395,15 @@\n <*>_N _R _P)) } })\n (baddDicts @k @b $dConstraintsB @c @f irred eta))\n `cast`\n ( f a -> m>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n <*>_N _R _P)]\n-db85df6b606901c50eb2cf9fa02fe513\n+2020c065122bd3f1f12315231be4e0c6\n bmapC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (AllB c b, ConstraintsB b) =>\n (forall (a :: k). c a => f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1425,15 +1425,15 @@\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f a) ->\n case ds of wild { Data.Functor.Product.Pair d fa ->\n case d of wild1 { Barbies.Internal.Dicts.Dict irred1 ->\n eta @a irred1 fa } })\n (baddDicts @k @b $dConstraintsB @c @f irred eta1)]\n-53e6f64c7bc28a4b915067c36219b2d0\n+5c59e57da5376bae689346ccc423cf4e\n bmempty ::\n forall {k} (f :: k -> *) (b :: (k -> *) -> *).\n (AllBF GHC.Base.Monoid f b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1471,15 +1471,15 @@\n irred\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy @k))))]\n-95c2490b5ebe9e04cd0f7c86833add41\n+efe44d026f6ed3643acdc20ce90281d8\n bmempty1 ::\n forall {k} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f))\n Data.Proxy.Proxy\n a\n@@ -1493,15 +1493,15 @@\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f))\n Data.Proxy.Proxy\n a) ->\n case ds of wild { Data.Functor.Product.Pair c ds1 -> c }]\n-05a7cae26b9f8b44c1cd350f93ad5fc1\n+1cde1e41a80469c7ba9959722d345402\n bmempty2 ::\n forall {k} {f :: k -> *} {a :: k}.\n Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f) a\n -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(A,1L,A,A))>,\n@@ -1514,15 +1514,15 @@\n case ds of wild { Barbies.Internal.Dicts.Dict irred ->\n GHC.Base.mempty\n @(f a)\n irred\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N _N _N _N _N) }]\n-638f96823a12ae1193029411409e22a6\n+4b660f3c478e3d9f3986c04122be78b2\n bpureC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (b :: (k -> *) -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1562,15 +1562,15 @@\n irred\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy @k))))]\n-80acdd349185613ec3c8567595cc0fd3\n+0b49e1066dbdac58719d2a9c9f587340\n btraverseC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (e :: * -> *).\n (Barbies.Internal.TraversableB.TraversableB b, ConstraintsB b,\n AllB c b, GHC.Base.Applicative e) =>\n (forall (a :: k). c a => f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1600,15 +1600,15 @@\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 x ->\n case ds1 of wild1 { Barbies.Internal.Dicts.Dict irred1 ->\n f1 @a irred1 x } })\n (baddDicts @k @b $dConstraintsB @c @f irred b1)]\n-8e34c659c77d116f60d8722f095357ca\n+029a8b2682192e4edc5954fcfd7902a3\n bzipWith3C ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *) (i :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a)\n -> b f -> b g -> b h -> b i\n@@ -1670,15 +1670,15 @@\n @b\n $dApplicativeB\n @f\n @g\n bf\n bg)\n bh))]\n-bf0725b1a4636d46c52c28c8c5295063\n+652470126b5c74d71cd56b7b8e429e6a\n bzipWith4C ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *) (i :: k -> *)\n (j :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a -> j a)\n@@ -1756,15 +1756,15 @@\n $dApplicativeB\n @f\n @g\n bf\n bg)\n bh)\n bi))]\n-eda12aac3e3389d5a81c7e754849ef8d\n+276eaa225cc56ee73ef03069b7e3d2ce\n bzipWithC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a) -> b f -> b g -> b h\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1809,15 +1809,15 @@\n @k\n @b\n $dApplicativeB\n @f\n @g\n bf\n bg))]\n-0c9773bc7b15401540d7ddae6ab5b120\n+9e3ca882003a49269e0e557bb04bcd83\n gbaddDictsDefault ::\n forall {k} (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.ConstraintsB [orphan module] [family instance module] 9066\n- interface hash: 5cf08429e83c942ef5d4185ef0d45239\n- ABI hash: d5cf5b2e50a347a0b6a54eab76d6ad99\n- export-list hash: 41dc42c9b5d65e5c886ca7692e13de47\n- orphan hash: 2d17a622c0544deff227a7237a581649\n+ interface hash: ee6a09c55c2852b82fb6390cb78ad8da\n+ ABI hash: 4ae0a3b1bcbf592d64b003f8812da757\n+ export-list hash: caf62448a6f65d00f18d65dc1b92275e\n+ orphan hash: 8e52ba0023cdaee7c677ea386972d7d9\n flag hash: 7ad38120aa6d85cdb4cb7f06a230bd63\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 16c69e23b69cf160ffe86c7b9b352b22\n sig of: Nothing\n used TH splices: False\n@@ -31,81 +31,81 @@\n &\n AllBF\n CanDeriveConstraintsB\n ConstraintsB{AllB baddDicts}\n GAllRepB\n TagSelf0\n TagSelf0'\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Data.Generics.GenericN Control.Applicative Control.Arrow\n Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints dbe4a74ad57c80c8783d07b1647baa9b\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll aa7b4f673c4e9bfa97e7a1c50731e7fd\n- GConstraints a7e9e23d9fc65479302c9d3c0ace9820\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- gaddDicts a8fe95c5e3b8e807206efdc59867b319\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- fromN 1b8038624d1891d55a7bd44a4cadea42\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 0aa87421cc66b72ee5cd089f3a525bd7\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll 4c84a1c336cdb79298bdd95cd66df075\n+ GConstraints 5c512afe7415c41c93750c1e4c738a80\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ gaddDicts 651db21d9dcf3f4c243e7d171c34079a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ fromN cc2678f628cd15ffd0813e57882d7db1\n+ toN 46484572a2091aa1d37095fef03b9792\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-a48dcf7a604d7ba2f7a4f3857a794226\n+6ddf2c48a46d23e126ae92150a233293\n $dmbaddDicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (ConstraintsB b, CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -343,15 +343,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-624346ee2211d05cca5a182f265bc4a2\n+dca31bc9e7b2f2c8ae67d5a7486f3c88\n $f&kcda ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k)\n (d :: k -> GHC.Types.Constraint).\n (c a, d a) =>\n (&) c d a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -359,15 +359,15 @@\n Unfolding: DFun: @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n @d :: k -> GHC.Types.Constraint\n (v['GHC.Types.Many] :: c a)\n (v1['GHC.Types.Many] :: d a).\n @k @c @d @a v v1]\n-1ac6e187376da5ec6bfd16dd3af4fe23\n+6f8d36fdf406aef6e8eaa12eb63cbd56\n $fConstraintsBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (GHC.Base.Functor f, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n@@ -385,15 +385,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkCompose_$cbaddDicts @k @f @b v v1)]\n-00fc7959bb65f3450d41015a3995d08b\n+6971504ab75846d520d4295ec0d6e47c\n $fConstraintsBkCompose1 ::\n forall {k} {f :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (GHC.Base.Functor f, ConstraintsB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1 -> f (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -419,15 +419,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-6672cf7a3cb68820be890aac054e7564\n+0a4d7d92a21a0a513425059cf52dd099\n $fConstraintsBkCompose_$cbaddDicts ::\n forall k (f :: * -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f1 :: k -> *).\n (GHC.Base.Functor f, ConstraintsB b,\n AllB c (Data.Functor.Compose.Compose f b)) =>\n Data.Functor.Compose.Compose f b f1\n -> Data.Functor.Compose.Compose\n@@ -480,28 +480,28 @@\n *>_N\n _R\n _N\n _N))]\n-f4bcca24bb5956261af66bebfbe44960\n+4e5b39868192fbde61aa0c5159787ec9\n $fConstraintsBkConst :: ConstraintsB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ConstraintsB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkConst_$cbaddDicts @k @a)]\n-313e5da84147848325315a26eab692ca\n+4f109cb5de62971c02f23e2e260de836\n $fConstraintsBkConst_$cbaddDicts ::\n forall k a (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n AllB c (Data.Functor.Const.Const a) =>\n Data.Functor.Const.Const a f\n -> Data.Functor.Const.Const\n a (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -523,15 +523,15 @@\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-98f9f330dd5e379a9e7d080925bf6a89\n+266dc58832f676b31c436ca990631c3b\n $fConstraintsBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ConstraintsB a, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -545,15 +545,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fConstraintsBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkProduct_$cbaddDicts @k @a @b v v1)]\n-fa5ca5815ce066eb03e083eb2c788bed\n+6237e1ed78a61f0017fbe8c4f3930f75\n $fConstraintsBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ConstraintsB a, ConstraintsB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -587,15 +587,15 @@\n (($p1ConstraintsB @k @b $dConstraintsB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-6ac8f38d0f84c540733ca4431c7f6f96\n+3564b593c94ce1f1c04444abe42aa428\n $fConstraintsBkProduct_$cbaddDicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n (ConstraintsB a, ConstraintsB b,\n AllB c (Data.Functor.Product.Product a b)) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product\n@@ -641,28 +641,28 @@\n @c\n @f\n (GHC.Classes.$p1(%,%)\n @(AllB c a)\n @(AllB c b)\n irred `cast` (Sub (D:R:AllBkcProduct[0] _N _N _N _N)))\n y) }]\n-18d1b54bab9caf82c56685d768449170\n+6f36114cdfe0f17e5cb5eb8af8747143\n $fConstraintsBkProxy :: ConstraintsB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ConstraintsB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkProxy_$cbaddDicts @k)]\n-fea6998aca9cffdefba83e92c9b436ba\n+c0782563a1576397172df3d0d2517b28\n $fConstraintsBkProxy_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n AllB c Data.Proxy.Proxy =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -672,15 +672,15 @@\n @c :: k -> GHC.Types.Constraint\n @f :: k -> *\n (irred['GHC.Types.Many] :: AllB c Data.Proxy.Proxy)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n Data.Proxy.Proxy\n @(k -> *)\n @(Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)]\n-db9cc93e2e464cb698ff839dd411a867\n+83b8f9877521fc331c8e7eeed0d1cb7e\n $fConstraintsBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ConstraintsB a, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -694,15 +694,15 @@\n @k\n @(Data.Functor.Sum.Sum a b)\n ($fConstraintsBkSum1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkSum_$cbaddDicts @k @a @b v v1)]\n-8903cd8247de4265444a023b10913ef5\n+9e78699170983db1e5e91c59d370a023\n $fConstraintsBkSum1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ConstraintsB a, ConstraintsB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -741,15 +741,15 @@\n (($p1ConstraintsB @k @b $dConstraintsB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n x) }]\n-09fd54a7c257fd1e04b17ed7b0dfece9\n+ceb8059b75ca3e3b0636397c45135e11\n $fConstraintsBkSum_$cbaddDicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n (ConstraintsB a, ConstraintsB b,\n AllB c (Data.Functor.Sum.Sum a b)) =>\n Data.Functor.Sum.Sum a b f\n -> Data.Functor.Sum.Sum\n@@ -801,15 +801,15 @@\n @c\n @f\n (GHC.Classes.$p1(%,%)\n @(AllB c a)\n @(AllB c b)\n irred `cast` (Sub (D:R:AllBkcSum[0] _N _N _N _N)))\n x) }]\n-3de7d1273f56a424ab9a03c430f324d7\n+60449329ab8c7fdda623672126de50ab\n $fGConstraintskFUNk20cfOtherRecRec ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *).\n (ConstraintsB b, AllB c b) =>\n Barbies.Generics.Constraints.GConstraints\n 0\n c\n@@ -852,15 +852,15 @@\n _N))]\n-1360652fab8bcb84fda25bf085447996\n+30d0aca992218ddc340549d47e81935a\n $fGConstraintskFUNk20cfOtherRecRec_$cgaddDicts ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *) (x :: k2).\n (ConstraintsB b, AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -922,15 +922,15 @@\n (P 0\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c)\n f))>_P) _N _N)]\n-c92f51c0c5c913496010b308524ec37e\n+5b54fbef555fcc37e2a4af26414265b4\n $fGConstraintskFUNk20cfSelfRecRec ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *).\n (ConstraintsB b, AllB c b) =>\n Barbies.Generics.Constraints.GConstraints\n 0\n c\n@@ -973,15 +973,15 @@\n _N))]\n-769b9394a7f0cdd1f259748791fafb6e\n+df65d619e64c6f72e548b67be26e141f\n $fGConstraintskFUNk20cfSelfRecRec_$cgaddDicts ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *) (x :: k2).\n (ConstraintsB b, AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -1043,125 +1043,125 @@\n (P 0\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c)\n f))>_P) _N _N)]\n-6ad532b0cdc3e4175729d36d4a038a4a\n+d791e53b546c637b960ef4317094156a\n $tc& :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 9916593666458410452#Word64\n- 6421382771094541799#Word64\n+ 13020177785925179189#Word64\n+ 13045564775080930199#Word64\n $trModule\n $tc&2\n 1#\n $tc&1]\n-664fe3a32555d4ba5e59d5866ac1ea8f\n+0683cdde772e86d7fec7660a89d46792\n $tc&1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-870dfb418baa49f35a25e6fd0c2b791e\n+9c3f28f3c76ac7900b65d4af5f178608\n $tc&2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc&3]\n-ccf50e19a2c406c7c61edf2717476667\n+d7ee572e151fa2081ce8cb0b3e6be61e\n $tc&3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"&\"#]\n-74217d3c45e605cdfd82405f4e52b32b\n+70be536031de29ef62af06c0461269fb\n $tc'C:& :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 474288608462590941#Word64\n- 9955219644725953820#Word64\n+ 13600891077135783734#Word64\n+ 1264298178773356223#Word64\n $trModule\n $tc'C:&2\n 4#\n $tc'C:&1]\n-f86d2f8f289d0adfbad0171291a47937\n+352019ac8b7e9b04b5b2516248940c78\n $tc'C:&1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-72906164755f082c1d25c9f36cfc301e\n+00fc86b3afd83e622a0de74ef76b3862\n $tc'C:&2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:&3]\n-2e1cc2748acde679e3999f4d3ef0fcf8\n+7321bde29f98a1a3a9b8490234e57b5f\n $tc'C:&3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:&\"#]\n-777a7956bdcb8bd05f7f53a72a665edd\n+c68ec15afb5c1db6204b07410cd105ee\n $tcConstraintsB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17562922986110815955#Word64\n- 3041427980261312880#Word64\n+ 10331265717288792012#Word64\n+ 5256121533431306349#Word64\n $trModule\n $tcConstraintsB2\n 1#\n $tcConstraintsB1]\n-9dc7264d6836117c057abd9543313c55\n+de6fa0bfb5a16ab6cd9ca02253e7e04c\n $tcConstraintsB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-dba5d75f96a06700974ed15154137856\n+716e21701fce84b6cfcffd19a567e2e7\n $tcConstraintsB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcConstraintsB3]\n-4866f9d34e93649c69921c3e01a25a74\n+99fee2e27e393d3636e342854147262a\n $tcConstraintsB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ConstraintsB\"#]\n-ba979df07ab192ca0d94fc0553d5a406\n+7bc93d5d8d078050ff07153c920cca55\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-60f8ed0be815a1363491b6e0b44f29f8\n+a01b20b0b1b6abf6eb979966ecd5089e\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-ccf52b1159d8028d0f6d8a77c05012ca\n+ce03d08066a768b265ffa39023a5bf26\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ConstraintsB\"#]\n-f91611ee3094818f510904066ad22ffa\n+293b354515c26af92b28ef00562774d2\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-5481a219b476509eaf34af9d4a7dd7ec\n+2e3299417754caf3098a089832e07228\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-b4981f1f879e533cf698bb596a0c96e2\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+262e3f2037fcd8d28cf63dfb107609ac\n type (&) :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> (k -> GHC.Types.Constraint) -> k -> GHC.Types.Constraint\n class (c a, d a) => (&) c d a\n-2acd8b5cdd2cb99d4266e8a727833036\n+d3a68478c2f8bf7482b8ff9a93156c9c\n type AllBF :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> ((k1 -> *) -> *) -> GHC.Types.Constraint\n type AllBF c f b =\n AllB (Barbies.Internal.Dicts.ClassF c f) b :: GHC.Types.Constraint\n-bcd864131a6ba6fa8f09696b46d36f0c\n+33754fdadbd4a4ef9739bb32b1847391\n type CanDeriveConstraintsB :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveConstraintsB c b f =\n (Data.Generics.GenericN.GenericN (b f),\n Data.Generics.GenericN.GenericN\n (b (Data.Functor.Product.Product\n@@ -1174,15 +1174,15 @@\n f\n (GAllRepB b)\n (Data.Generics.GenericN.RepN (b f))\n (Data.Generics.GenericN.RepN\n (b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))))\n :: GHC.Types.Constraint\n-6740c2f85a112fac7087ebced670b2a1\n+d993e9a93ed2b624d6fc8e9a1a4c46b7\n type ConstraintsB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => ConstraintsB b where\n type AllB :: forall k.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> GHC.Types.Constraint\n type family AllB c b open\n@@ -1194,56 +1194,56 @@\n (Barbies.Internal.Dicts.Dict c) f)\n default baddDicts :: forall (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n-00cc3bfafe9720f6f9cbcb4b382566e5\n+f92e6717310a49cbca06c97d2b2a4082\n axiom D:R:AllBkcCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Compose.Compose f b) = AllB c b\n-800c2131de5cf5699f6b145ccdb34fd0\n+71482b0c0a0d7985d1ea76dc304c25f0\n axiom D:R:AllBkcConst ::\n forall k a (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Const.Const a) = () :: Constraint\n-21bda4ed75f983040ecec59226afcaf2\n+42c842c1f4e70da8221923a9f431005c\n axiom D:R:AllBkcProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Product.Product a b) = (AllB c a, AllB c b)\n-1083bbcc29a2ce6015c27a0262445b27\n+5c141780bae974870e1225e0ec0ac2df\n axiom D:R:AllBkcProxy ::\n forall k (c :: k -> GHC.Types.Constraint).\n AllB c Data.Proxy.Proxy = () :: Constraint\n-58cac0c51e953b86b71ada4db63f53ea\n+f935c0104d46bc9d23268b8c9a7dd19e\n axiom D:R:AllBkcSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Sum.Sum a b) = (AllB c a, AllB c b)\n-ca4590922fa02aa4cee822521d0e83b9\n+276c84d3a38583cfd72d72a6431255d1\n axiom D:R:GAllk10cOther ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint)\n (b' :: (k2 -> *) -> *) (b :: (k1 -> *) -> *).\n Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Generics.Constraints.Other\n (b' (P 0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))\n = AllB c b\n-1dba987522bf49ed2095c8660935a63f\n+bea52ce91f849e20fecc87f1ef102872\n axiom D:R:GAllk10cSelf ::\n forall k1 k2 k3 (c :: k1 -> GHC.Types.Constraint)\n (b' :: (k2 -> *) -> *) (b :: (k3 -> *) -> *).\n Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Generics.Constraints.Self\n (b' (P 0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))\n = () :: Constraint\n-64cb59c37b2de5b5d39c88ffc4b6658d\n+10d13911372461e3e93fafa5ab0c77e7\n axiom D:R:TagSelf0' ::\n forall kf (b :: kf -> *) mt (m :: GHC.Generics.Meta) (s :: * -> *).\n TagSelf0' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf0' b s)\n forall kf (b :: kf -> *) (l :: * -> *) (r :: * -> *).\n TagSelf0' b (l GHC.Generics.:+: r)\n = TagSelf0' b l GHC.Generics.:+: TagSelf0' b r\n@@ -1257,28 +1257,28 @@\n forall kf (b :: kf -> *) x y.\n TagSelf0' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.V1 = GHC.Generics.V1\n-b55e3d91b41ad97ba9417bc021683df5\n+9dc63ee0afcec57e5fc2662b4e967df7\n type GAllRepB :: forall {k}. ((k -> *) -> *) -> * -> *\n type GAllRepB b = TagSelf0 b :: * -> *\n-531e420141742a483ad3f2f9c3b992df\n+352bd6c4a2d8a671e116f35b86938fae\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-a549a87741384e082d41639454945afe\n+33c26af4c4a417ef94ae57db4326b7e5\n type TagSelf0 :: forall {k}. ((k -> *) -> *) -> * -> *\n type TagSelf0 b =\n TagSelf0'\n (Data.Generics.GenericN.Indexed b 1)\n (Data.Generics.GenericN.RepN (b Barbies.Generics.Constraints.X))\n :: * -> *\n-7b11e28adaee2aeb7bc8f0ae7f9e8da4\n+bb4b36d5ac6ed04a6e8a365456d7e936\n type TagSelf0' :: forall kf. (kf -> *) -> (* -> *) -> * -> *\n type family TagSelf0' b repbf where\n forall kf (b :: kf -> *) mt (m :: GHC.Generics.Meta) (s :: * -> *).\n TagSelf0' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf0' b s)\n forall kf (b :: kf -> *) (l :: * -> *) (r :: * -> *).\n TagSelf0' b (l GHC.Generics.:+: r)\n@@ -1294,15 +1294,15 @@\n TagSelf0' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:TagSelf0'\n-910fbbe9a576863e35439a6fbd62de33\n+971aaafe6ea6c47c3cae87482166403e\n bdicts ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *).\n (ConstraintsB b, Barbies.Internal.ApplicativeB.ApplicativeB b,\n AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1330,30 +1330,30 @@\n irred\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy @k)))]\n-df0469502f2cb597afaef1f210e0460d\n+fd9bec55821a7b6fff92e0e47132cbe2\n bdicts1 ::\n forall {k} {c :: k -> GHC.Types.Constraint} {a :: k}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a\n -> Barbies.Internal.Dicts.Dict c a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(L),A)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a) ->\n case ds of wild { Data.Functor.Product.Pair c1 ds1 -> c1 }]\n-8dc0380a9c23f3ae49fefd9813306c8e\n+47cc19f97daa118ea2596279457634d7\n bfoldMapC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *) m\n (f :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB b, ConstraintsB b,\n AllB c b, GHC.Base.Monoid m) =>\n (forall (a :: k). c a => f a -> m) -> b f -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1395,15 +1395,15 @@\n <*>_N _R _P)) } })\n (baddDicts @k @b $dConstraintsB @c @f irred eta))\n `cast`\n ( f a -> m>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n <*>_N _R _P)]\n-db85df6b606901c50eb2cf9fa02fe513\n+2020c065122bd3f1f12315231be4e0c6\n bmapC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (AllB c b, ConstraintsB b) =>\n (forall (a :: k). c a => f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1425,15 +1425,15 @@\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f a) ->\n case ds of wild { Data.Functor.Product.Pair d fa ->\n case d of wild1 { Barbies.Internal.Dicts.Dict irred1 ->\n eta @a irred1 fa } })\n (baddDicts @k @b $dConstraintsB @c @f irred eta1)]\n-53e6f64c7bc28a4b915067c36219b2d0\n+5c59e57da5376bae689346ccc423cf4e\n bmempty ::\n forall {k} (f :: k -> *) (b :: (k -> *) -> *).\n (AllBF GHC.Base.Monoid f b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1471,15 +1471,15 @@\n irred\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy @k))))]\n-95c2490b5ebe9e04cd0f7c86833add41\n+efe44d026f6ed3643acdc20ce90281d8\n bmempty1 ::\n forall {k} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f))\n Data.Proxy.Proxy\n a\n@@ -1493,15 +1493,15 @@\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f))\n Data.Proxy.Proxy\n a) ->\n case ds of wild { Data.Functor.Product.Pair c ds1 -> c }]\n-05a7cae26b9f8b44c1cd350f93ad5fc1\n+1cde1e41a80469c7ba9959722d345402\n bmempty2 ::\n forall {k} {f :: k -> *} {a :: k}.\n Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f) a\n -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(A,1L,A,A))>,\n@@ -1514,15 +1514,15 @@\n case ds of wild { Barbies.Internal.Dicts.Dict irred ->\n GHC.Base.mempty\n @(f a)\n irred\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N _N _N _N _N) }]\n-638f96823a12ae1193029411409e22a6\n+4b660f3c478e3d9f3986c04122be78b2\n bpureC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (b :: (k -> *) -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1562,15 +1562,15 @@\n irred\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy @k))))]\n-80acdd349185613ec3c8567595cc0fd3\n+0b49e1066dbdac58719d2a9c9f587340\n btraverseC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (e :: * -> *).\n (Barbies.Internal.TraversableB.TraversableB b, ConstraintsB b,\n AllB c b, GHC.Base.Applicative e) =>\n (forall (a :: k). c a => f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1600,15 +1600,15 @@\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 x ->\n case ds1 of wild1 { Barbies.Internal.Dicts.Dict irred1 ->\n f1 @a irred1 x } })\n (baddDicts @k @b $dConstraintsB @c @f irred b1)]\n-8e34c659c77d116f60d8722f095357ca\n+029a8b2682192e4edc5954fcfd7902a3\n bzipWith3C ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *) (i :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a)\n -> b f -> b g -> b h -> b i\n@@ -1670,15 +1670,15 @@\n @b\n $dApplicativeB\n @f\n @g\n bf\n bg)\n bh))]\n-bf0725b1a4636d46c52c28c8c5295063\n+652470126b5c74d71cd56b7b8e429e6a\n bzipWith4C ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *) (i :: k -> *)\n (j :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a -> j a)\n@@ -1756,15 +1756,15 @@\n $dApplicativeB\n @f\n @g\n bf\n bg)\n bh)\n bi))]\n-eda12aac3e3389d5a81c7e754849ef8d\n+276eaa225cc56ee73ef03069b7e3d2ce\n bzipWithC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a) -> b f -> b g -> b h\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1809,15 +1809,15 @@\n @k\n @b\n $dApplicativeB\n @f\n @g\n bf\n bg))]\n-0c9773bc7b15401540d7ddae6ab5b120\n+9e3ca882003a49269e0e557bb04bcd83\n gbaddDictsDefault ::\n forall {k} (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.ConstraintsT [orphan module] [family instance module] 9066\n- interface hash: 1f35ffa07a32201bbe8e47488576c543\n- ABI hash: b0c8e8cd622378ebd4213ca89b09d70f\n- export-list hash: 278101e56b3eacad637b39b7dc733468\n- orphan hash: a8c76d2ca97dec1106f2f6dff317cec7\n+ interface hash: e46e4c1e8e9490fe16817138f90505c4\n+ ABI hash: 71b29e9d7477d9e65446372adaee6a2c\n+ export-list hash: b9186d4e1071f5bfe56a43df85fcb2fa\n+ orphan hash: bc333f293000bd4c699936dfe403e375\n flag hash: ed708539882f1f5a39d21c9555c09e01\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 111967e97f0a1271387d0135c2956f5a\n sig of: Nothing\n used TH splices: False\n@@ -30,20 +30,20 @@\n tzipWithC\n AllTF\n CanDeriveConstraintsT\n ConstraintsT{AllT taddDicts}\n GAllRepT\n TagSelf1\n TagSelf1'\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeT Barbies.Internal.FunctorT\n Barbies.Internal.TraversableT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Data.Generics.GenericN Control.Applicative Control.Arrow\n@@ -55,63 +55,63 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints dbe4a74ad57c80c8783d07b1647baa9b\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll aa7b4f673c4e9bfa97e7a1c50731e7fd\n- GConstraints a7e9e23d9fc65479302c9d3c0ace9820\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- Y ba6a1ba68e95cb981888219d3edc670b\n- gaddDicts a8fe95c5e3b8e807206efdc59867b319\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- exports: 8f06cd71a7d940a28cb85009a4957b36\n- ApplicativeT a99ce0340646a38f9575b049182a8def\n- tprod 94d237cedb9b905a9c75a58fc4be2d84\n- tpure 3d2d76935d5f8427ccff8120f17ee9cb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- exports: 625e9e43bc9e9ad84f781f9b7f8b2abf\n- TraversableT 5f45683a672c1e8b493f3644d95842b8\n- ttraverse d3238a3d0af65058271e05836e392ec5\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- Zip 083bb61db3e8437841ed53dd9a1e12d6\n- fromN 1b8038624d1891d55a7bd44a4cadea42\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 0aa87421cc66b72ee5cd089f3a525bd7\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll 4c84a1c336cdb79298bdd95cd66df075\n+ GConstraints 5c512afe7415c41c93750c1e4c738a80\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ Y d1ab14839ebc0a3f1df64062aa572cc4\n+ gaddDicts 651db21d9dcf3f4c243e7d171c34079a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ exports: 1b16a7ba7761bb551c6170cbaa7b2e96\n+ ApplicativeT 074070de79264540541cf796d013c0ef\n+ tprod afb228a962be5d495a61627aaf4064db\n+ tpure 45b5a8f3e24017491bb877f3c054cbb9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ exports: 985f3d735f8d8149cf05c5257b3e92df\n+ TraversableT 85e954d72370c1d24f1ff0e67fec5163\n+ ttraverse 7d33e27d536aa9640cd0d31bd3eaff70\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ Zip 05d9accc0b4938dc7787dbe3e50a5c37\n+ fromN cc2678f628cd15ffd0813e57882d7db1\n+ toN 46484572a2091aa1d37095fef03b9792\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-6e463abed1ebd555de5e12dfdf2a35ad\n+a08a4d8a7f243a6a509dd07ca85d4517\n $dmtaddDicts ::\n forall kl kr (t :: (kl -> *) -> kr -> *)\n (c :: kl -> GHC.Types.Constraint) (f :: kl -> *) (x :: kr).\n (ConstraintsT t, CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -389,15 +389,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-1c7536640eb1db0e92c470ab3d4805b3\n+dd91c4eac5acf728d73a1fcc689165bb\n $fGConstraintskFUNk21cfOtherRecRec ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2).\n (ConstraintsT t, AllT c t) =>\n Barbies.Generics.Constraints.GConstraints\n 1\n@@ -451,15 +451,15 @@\n (P 1\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y))\n (t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n y)>_N))]\n-753175035c3ac058a58b5b463e872d7c\n+7024e7360d1a2f8aa566f9fc587e92e6\n $fGConstraintskFUNk21cfOtherRecRec_$cgaddDicts ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2) (x :: k3).\n (ConstraintsT t, AllT c t,\n Barbies.Generics.Constraints.GAll\n 1\n@@ -534,15 +534,15 @@\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y)>_P) _N _N)]\n-5a1d712e818ff5159d81e115e629fe99\n+514545f5f83bc9d6eddd6a84c6a124a5\n $fGConstraintskFUNk21cfSelfRecRec ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2).\n (ConstraintsT t, AllT c t) =>\n Barbies.Generics.Constraints.GConstraints\n 1\n@@ -596,15 +596,15 @@\n (P 1\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y))\n (t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n y)>_N))]\n-24b30bd20d06b14a2f21d9b1860233c3\n+807eada4043a5a4c73de705a65bc29a6\n $fGConstraintskFUNk21cfSelfRecRec_$cgaddDicts ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2) (x :: k3).\n (ConstraintsT t, AllT c t,\n Barbies.Generics.Constraints.GAll\n 1\n@@ -679,70 +679,70 @@\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y)>_P) _N _N)]\n-61c015bbf3be06b6783680111bcd5c82\n+ca6d9ec65b90f7d34a1d20630af5fee4\n $tcConstraintsT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15333559720734858182#Word64\n- 12061792654737755711#Word64\n+ 2767450067758763371#Word64\n+ 17292975853419185995#Word64\n $trModule\n $tcConstraintsT2\n 2#\n $tcConstraintsT1]\n-0a09772adfc916ceae71f7bd9058e196\n+190809f3ed8048fa153489b6fa75fbfd\n $tcConstraintsT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-5ff79e773a396c0a411025cc6390c627\n+41556bb7c44859b01bdd9d29acaa8edd\n $tcConstraintsT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcConstraintsT3]\n-88b5dd52c5a0f741b267fb61a450a4cd\n+ec9927f51a4069f53384d9d0ce4dbbeb\n $tcConstraintsT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ConstraintsT\"#]\n-64d782e080a13bf954a79ff816264599\n+287ca37f539e26ad5636347f6345a58d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f11c65a55e9e5f45212da4a6d87888d5\n+2c4ad8d4716009bf864242f737496946\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-cd560629d054fb8d93359ac9f0f6c6dd\n+ed263a5341283fee6bade90d758175ea\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ConstraintsT\"#]\n-da2ba0b1f84f5753c41a6d8d576e12d2\n+bf8ca1e6f3caab6311f4e119a0a8330b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-93ec030b3540572a19f4fa25862f6483\n+d9edc351a5c28dd0cfc919606145d972\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e0763c123e2b8997bb2edc82b327f155\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+7a7ba72bc88fa2ee4a4b9d2f145c22fc\n type AllTF :: forall {k} {k1} {kl} {kr}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n type AllTF c f t =\n AllT (Barbies.Internal.Dicts.ClassF c f) t :: GHC.Types.Constraint\n-8b43af5386da34277bb41fc6764458cd\n+be31e384e5dcda6bdc3e28e191447b37\n type CanDeriveConstraintsT :: forall {k} {kg}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> kg -> *) -> (k -> *) -> kg -> GHC.Types.Constraint\n type CanDeriveConstraintsT c t f x =\n (Data.Generics.GenericN.GenericN (t f x),\n Data.Generics.GenericN.GenericN\n (t (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n@@ -755,15 +755,15 @@\n f\n (GAllRepT t)\n (Data.Generics.GenericN.RepN (t f x))\n (Data.Generics.GenericN.RepN\n (t (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n x)))\n :: GHC.Types.Constraint\n-87036f6d192a044ba64c57ad3852f00b\n+3824b7d50764f926d1ce8e2afa5d6994\n type ConstraintsT :: forall kl kr.\n ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => ConstraintsT t where\n type AllT :: forall {kl} {kr} k.\n (k -> GHC.Types.Constraint)\n -> ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n type family AllT c t open\n@@ -778,37 +778,37 @@\n default taddDicts :: forall (c :: kl -> GHC.Types.Constraint)\n (f :: kl -> *) (x :: kr).\n (CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n x\n-ad27eb6942c801add642cfacd66f662f\n+ef177fc8be817126770a2781caa7ca2b\n axiom D:R:GAllk11cOther ::\n forall k1 k2 k3 kl kr (c :: k1 -> GHC.Types.Constraint)\n (t' :: (k2 -> *) -> k3 -> *) (t :: (kl -> *) -> kr -> *).\n Barbies.Generics.Constraints.GAll\n 1 c (Barbies.Generics.Constraints.Other\n (t'\n (P 1 Barbies.Generics.Constraints.X)\n Barbies.Generics.Constraints.Y)\n (t Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y))\n = AllT c t\n-32f453fb730d7b43b3f2aa19621b6660\n+88d07b8b84ff97af69fffacf514d26ee\n axiom D:R:GAllk11cSelf ::\n forall k1 k2 k3 k4 k5 (c :: k1 -> GHC.Types.Constraint)\n (t' :: (k2 -> *) -> k3 -> *) (t :: (k4 -> *) -> k5 -> *).\n Barbies.Generics.Constraints.GAll\n 1 c (Barbies.Generics.Constraints.Self\n (t'\n (P 1 Barbies.Generics.Constraints.X)\n Barbies.Generics.Constraints.Y)\n (t Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y))\n = () :: Constraint\n-6c0de183c0084059d4cc77084f5ff74c\n+c134c7d328211bdd7c4c87f93954b149\n axiom D:R:TagSelf1' ::\n forall kf kg (b :: kf -> kg -> *) mt (m :: GHC.Generics.Meta)\n (s :: * -> *).\n TagSelf1' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf1' b s)\n forall kf kg (b :: kf -> kg -> *) (l :: * -> *) (r :: * -> *).\n TagSelf1' b (l GHC.Generics.:+: r)\n@@ -824,35 +824,35 @@\n forall kf kg (b :: kf -> kg -> *) x y.\n TagSelf1' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.V1 = GHC.Generics.V1\n-2fd17a4da800c5787ace0662c4ab16f5\n+1eadb8c0491d4b9fb505a6a4041fe27c\n type GAllRepT :: forall {k} {kg}. ((k -> *) -> kg -> *) -> * -> *\n type GAllRepT t = TagSelf1 t :: * -> *\n-b8dac055b26b88d4f2163bd4827c0db0\n+ed6076309feeacf626d5beed5e038d3e\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-60b6a26daeaa761940977f97dbbe94f6\n+a0008ab8b71b3def4b4cd93bd6cf4ae4\n type TagSelf1 :: forall {k} {kg}. ((k -> *) -> kg -> *) -> * -> *\n type TagSelf1 b =\n TagSelf1'\n (Data.Generics.GenericN.Indexed b 2)\n (Data.Generics.GenericN.Zip\n (GHC.Generics.Rep\n (Data.Generics.GenericN.Indexed\n (b Barbies.Generics.Constraints.X)\n 1\n Barbies.Generics.Constraints.Y))\n (GHC.Generics.Rep\n (b Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y)))\n :: * -> *\n-b23920de0c0254a7356b171d679daf1a\n+2585e2f92391036bf9cdb91e467ac073\n type TagSelf1' :: forall kf kg.\n (kf -> kg -> *) -> (* -> *) -> * -> *\n type family TagSelf1' b repbf where\n forall kf kg (b :: kf -> kg -> *) mt (m :: GHC.Generics.Meta)\n (s :: * -> *).\n TagSelf1' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf1' b s)\n@@ -871,15 +871,15 @@\n TagSelf1' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:TagSelf1'\n-68341ccf3a168e0f6df27d95f5e10b64\n+7bf605a34e44f6830c6fe51ed05303c9\n gtaddDictsDefault ::\n forall {k} {kr} (t :: (k -> *) -> kr -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *) (x :: kr).\n (CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -1136,15 +1136,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) }]\n-cd9bead83115c2ea79383713e9463d08\n+0ef85d42d46bbfea7a1463778b9b5215\n tdicts ::\n forall {kl} {kr} (c :: kl -> GHC.Types.Constraint)\n (t :: (kl -> *) -> kr -> *) (x :: kr).\n (ConstraintsT t, Barbies.Internal.ApplicativeT.ApplicativeT t,\n AllT c t) =>\n t (Barbies.Internal.Dicts.Dict c) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1180,30 +1180,30 @@\n @kl\n @kr\n @t\n $dApplicativeT\n @Data.Proxy.Proxy\n @x\n (Data.Proxy.Proxy @kl)))]\n-cea1e214f4070d66a52c6af84508abdf\n+84732f8399a3267c260d3d4931879a2f\n tdicts1 ::\n forall {kl} {c :: kl -> GHC.Types.Constraint} {a :: kl}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a\n -> Barbies.Internal.Dicts.Dict c a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(L),A)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @kl\n @c :: kl -> GHC.Types.Constraint\n @a :: kl\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a) ->\n case ds of wild { Data.Functor.Product.Pair c1 ds1 -> c1 }]\n-c9553d9670c36ba943df72304faeb7af\n+ab44bc82c04f9c2f17590d359dc5e0b4\n tfoldMapC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) m (f :: k -> *) (x :: kr).\n (Barbies.Internal.TraversableT.TraversableT t, ConstraintsT t,\n AllT c t, GHC.Base.Monoid m) =>\n (forall (a :: k). c a => f a -> m) -> t f x -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1249,15 +1249,15 @@\n <*>_N _R _P)) } })\n (taddDicts @k @kr @t $dConstraintsT @c @f @x irred eta))\n `cast`\n ( f a -> m>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n <*>_N _R _P)]\n-a0f909dabfcacacb160fc8fb2fd88ee7\n+cd42af4933908ccc6702697d0fe2156b\n tmapC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) (f :: k -> *) (g :: k -> *) (x :: kr).\n (AllT c t, ConstraintsT t) =>\n (forall (a :: k). c a => f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1282,15 +1282,15 @@\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f a) ->\n case ds of wild { Data.Functor.Product.Pair d fa ->\n case d of wild1 { Barbies.Internal.Dicts.Dict irred1 ->\n eta @a irred1 fa } })\n (taddDicts @k @kr @t $dConstraintsT @c @f @x irred eta1)]\n-fcda53e4bff44d0c6b12851109190cd6\n+08e374a00b71a52c0ee01c6747155b3f\n tmempty ::\n forall {k} {k'} (f :: k -> *) (t :: (k -> *) -> k' -> *) (x :: k').\n (AllTF GHC.Base.Monoid f t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1336,15 +1336,15 @@\n @k\n @k'\n @t\n $dApplicativeT\n @Data.Proxy.Proxy\n @x\n (Data.Proxy.Proxy @k))))]\n-ce151215b259dbd8c8a8d0c5702aba9e\n+7080212214e1bce7f95a9a2d247ac1cf\n tmempty1 ::\n forall {k} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f))\n Data.Proxy.Proxy\n a\n@@ -1358,15 +1358,15 @@\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f))\n Data.Proxy.Proxy\n a) ->\n case ds of wild { Data.Functor.Product.Pair c ds1 -> c }]\n-d8f18e281ab7eafe3f2e6a3d64e49946\n+0aff19f627fc711ed721a9309906786c\n tmempty2 ::\n forall {k} {f :: k -> *} {a :: k}.\n Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f) a\n -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(A,1L,A,A))>,\n@@ -1379,15 +1379,15 @@\n case ds of wild { Barbies.Internal.Dicts.Dict irred ->\n GHC.Base.mempty\n @(f a)\n irred\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N _N _N _N _N) }]\n-b1646cf90d6f7cbb109b9e09393ebc76\n+9c93ad29e60ad0937613c73dafa7dec3\n tpureC ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (t :: (k -> *) -> k' -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1435,15 +1435,15 @@\n @k\n @k'\n @t\n $dApplicativeT\n @Data.Proxy.Proxy\n @x\n (Data.Proxy.Proxy @k))))]\n-038c8c5c104e8c160fb65247f289334d\n+4583612791ed456316b18d5ff9373604\n ttraverseC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) (f :: k -> *) (g :: k -> *)\n (e :: * -> *) (x :: kr).\n (Barbies.Internal.TraversableT.TraversableT t, ConstraintsT t,\n AllT c t, GHC.Base.Applicative e) =>\n (forall (a :: k). c a => f a -> e (g a)) -> t f x -> e (t g x)\n@@ -1478,15 +1478,15 @@\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 x1 ->\n case ds1 of wild1 { Barbies.Internal.Dicts.Dict irred1 ->\n f1 @a irred1 x1 } })\n (taddDicts @k @kr @t $dConstraintsT @c @f @x irred t1)]\n-cf193c2f7801f88c6a6a618210339ef9\n+3481e0bd4b9f09eab3eb4ab585c2cbaa\n tzipWith3C ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a)\n@@ -1558,15 +1558,15 @@\n $dApplicativeT\n @f\n @x\n @g\n tf\n tg)\n th))]\n-4d2866b0d862b8b17c8299abb54deb08\n+e58fdee3483363a50cb5dea3e7a1a48b\n tzipWith4C ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (j :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a -> j a)\n@@ -1655,15 +1655,15 @@\n @f\n @x\n @g\n tf\n tg)\n th)\n ti))]\n-ffa24966b6937bf5fe2474e7b4e31abf\n+d473ef2ff63f63e8caa1d045e39cf38e\n tzipWithC ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a)\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.ConstraintsT [orphan module] [family instance module] 9066\n- interface hash: 1f35ffa07a32201bbe8e47488576c543\n- ABI hash: b0c8e8cd622378ebd4213ca89b09d70f\n- export-list hash: 278101e56b3eacad637b39b7dc733468\n- orphan hash: a8c76d2ca97dec1106f2f6dff317cec7\n+ interface hash: e46e4c1e8e9490fe16817138f90505c4\n+ ABI hash: 71b29e9d7477d9e65446372adaee6a2c\n+ export-list hash: b9186d4e1071f5bfe56a43df85fcb2fa\n+ orphan hash: bc333f293000bd4c699936dfe403e375\n flag hash: 36efccb710688bf8ac88b078b79027a7\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 111967e97f0a1271387d0135c2956f5a\n sig of: Nothing\n used TH splices: False\n@@ -30,20 +30,20 @@\n tzipWithC\n AllTF\n CanDeriveConstraintsT\n ConstraintsT{AllT taddDicts}\n GAllRepT\n TagSelf1\n TagSelf1'\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeT Barbies.Internal.FunctorT\n Barbies.Internal.TraversableT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Data.Generics.GenericN Control.Applicative Control.Arrow\n@@ -55,63 +55,63 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints dbe4a74ad57c80c8783d07b1647baa9b\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll aa7b4f673c4e9bfa97e7a1c50731e7fd\n- GConstraints a7e9e23d9fc65479302c9d3c0ace9820\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- Y ba6a1ba68e95cb981888219d3edc670b\n- gaddDicts a8fe95c5e3b8e807206efdc59867b319\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- exports: 8f06cd71a7d940a28cb85009a4957b36\n- ApplicativeT a99ce0340646a38f9575b049182a8def\n- tprod 94d237cedb9b905a9c75a58fc4be2d84\n- tpure 3d2d76935d5f8427ccff8120f17ee9cb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- exports: 625e9e43bc9e9ad84f781f9b7f8b2abf\n- TraversableT 5f45683a672c1e8b493f3644d95842b8\n- ttraverse d3238a3d0af65058271e05836e392ec5\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- Zip 083bb61db3e8437841ed53dd9a1e12d6\n- fromN 1b8038624d1891d55a7bd44a4cadea42\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 0aa87421cc66b72ee5cd089f3a525bd7\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll 4c84a1c336cdb79298bdd95cd66df075\n+ GConstraints 5c512afe7415c41c93750c1e4c738a80\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ Y d1ab14839ebc0a3f1df64062aa572cc4\n+ gaddDicts 651db21d9dcf3f4c243e7d171c34079a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ exports: 1b16a7ba7761bb551c6170cbaa7b2e96\n+ ApplicativeT 074070de79264540541cf796d013c0ef\n+ tprod afb228a962be5d495a61627aaf4064db\n+ tpure 45b5a8f3e24017491bb877f3c054cbb9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ exports: 985f3d735f8d8149cf05c5257b3e92df\n+ TraversableT 85e954d72370c1d24f1ff0e67fec5163\n+ ttraverse 7d33e27d536aa9640cd0d31bd3eaff70\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ Zip 05d9accc0b4938dc7787dbe3e50a5c37\n+ fromN cc2678f628cd15ffd0813e57882d7db1\n+ toN 46484572a2091aa1d37095fef03b9792\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-6e463abed1ebd555de5e12dfdf2a35ad\n+a08a4d8a7f243a6a509dd07ca85d4517\n $dmtaddDicts ::\n forall kl kr (t :: (kl -> *) -> kr -> *)\n (c :: kl -> GHC.Types.Constraint) (f :: kl -> *) (x :: kr).\n (ConstraintsT t, CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -389,15 +389,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-1c7536640eb1db0e92c470ab3d4805b3\n+dd91c4eac5acf728d73a1fcc689165bb\n $fGConstraintskFUNk21cfOtherRecRec ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2).\n (ConstraintsT t, AllT c t) =>\n Barbies.Generics.Constraints.GConstraints\n 1\n@@ -451,15 +451,15 @@\n (P 1\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y))\n (t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n y)>_N))]\n-753175035c3ac058a58b5b463e872d7c\n+7024e7360d1a2f8aa566f9fc587e92e6\n $fGConstraintskFUNk21cfOtherRecRec_$cgaddDicts ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2) (x :: k3).\n (ConstraintsT t, AllT c t,\n Barbies.Generics.Constraints.GAll\n 1\n@@ -534,15 +534,15 @@\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y)>_P) _N _N)]\n-5a1d712e818ff5159d81e115e629fe99\n+514545f5f83bc9d6eddd6a84c6a124a5\n $fGConstraintskFUNk21cfSelfRecRec ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2).\n (ConstraintsT t, AllT c t) =>\n Barbies.Generics.Constraints.GConstraints\n 1\n@@ -596,15 +596,15 @@\n (P 1\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y))\n (t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n y)>_N))]\n-24b30bd20d06b14a2f21d9b1860233c3\n+807eada4043a5a4c73de705a65bc29a6\n $fGConstraintskFUNk21cfSelfRecRec_$cgaddDicts ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2) (x :: k3).\n (ConstraintsT t, AllT c t,\n Barbies.Generics.Constraints.GAll\n 1\n@@ -679,70 +679,70 @@\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y)>_P) _N _N)]\n-61c015bbf3be06b6783680111bcd5c82\n+ca6d9ec65b90f7d34a1d20630af5fee4\n $tcConstraintsT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15333559720734858182#Word64\n- 12061792654737755711#Word64\n+ 2767450067758763371#Word64\n+ 17292975853419185995#Word64\n $trModule\n $tcConstraintsT2\n 2#\n $tcConstraintsT1]\n-0a09772adfc916ceae71f7bd9058e196\n+190809f3ed8048fa153489b6fa75fbfd\n $tcConstraintsT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-5ff79e773a396c0a411025cc6390c627\n+41556bb7c44859b01bdd9d29acaa8edd\n $tcConstraintsT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcConstraintsT3]\n-88b5dd52c5a0f741b267fb61a450a4cd\n+ec9927f51a4069f53384d9d0ce4dbbeb\n $tcConstraintsT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ConstraintsT\"#]\n-64d782e080a13bf954a79ff816264599\n+287ca37f539e26ad5636347f6345a58d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f11c65a55e9e5f45212da4a6d87888d5\n+2c4ad8d4716009bf864242f737496946\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-cd560629d054fb8d93359ac9f0f6c6dd\n+ed263a5341283fee6bade90d758175ea\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ConstraintsT\"#]\n-da2ba0b1f84f5753c41a6d8d576e12d2\n+bf8ca1e6f3caab6311f4e119a0a8330b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-93ec030b3540572a19f4fa25862f6483\n+d9edc351a5c28dd0cfc919606145d972\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e0763c123e2b8997bb2edc82b327f155\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+7a7ba72bc88fa2ee4a4b9d2f145c22fc\n type AllTF :: forall {k} {k1} {kl} {kr}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n type AllTF c f t =\n AllT (Barbies.Internal.Dicts.ClassF c f) t :: GHC.Types.Constraint\n-8b43af5386da34277bb41fc6764458cd\n+be31e384e5dcda6bdc3e28e191447b37\n type CanDeriveConstraintsT :: forall {k} {kg}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> kg -> *) -> (k -> *) -> kg -> GHC.Types.Constraint\n type CanDeriveConstraintsT c t f x =\n (Data.Generics.GenericN.GenericN (t f x),\n Data.Generics.GenericN.GenericN\n (t (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n@@ -755,15 +755,15 @@\n f\n (GAllRepT t)\n (Data.Generics.GenericN.RepN (t f x))\n (Data.Generics.GenericN.RepN\n (t (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n x)))\n :: GHC.Types.Constraint\n-87036f6d192a044ba64c57ad3852f00b\n+3824b7d50764f926d1ce8e2afa5d6994\n type ConstraintsT :: forall kl kr.\n ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => ConstraintsT t where\n type AllT :: forall {kl} {kr} k.\n (k -> GHC.Types.Constraint)\n -> ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n type family AllT c t open\n@@ -778,37 +778,37 @@\n default taddDicts :: forall (c :: kl -> GHC.Types.Constraint)\n (f :: kl -> *) (x :: kr).\n (CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n x\n-ad27eb6942c801add642cfacd66f662f\n+ef177fc8be817126770a2781caa7ca2b\n axiom D:R:GAllk11cOther ::\n forall k1 k2 k3 kl kr (c :: k1 -> GHC.Types.Constraint)\n (t' :: (k2 -> *) -> k3 -> *) (t :: (kl -> *) -> kr -> *).\n Barbies.Generics.Constraints.GAll\n 1 c (Barbies.Generics.Constraints.Other\n (t'\n (P 1 Barbies.Generics.Constraints.X)\n Barbies.Generics.Constraints.Y)\n (t Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y))\n = AllT c t\n-32f453fb730d7b43b3f2aa19621b6660\n+88d07b8b84ff97af69fffacf514d26ee\n axiom D:R:GAllk11cSelf ::\n forall k1 k2 k3 k4 k5 (c :: k1 -> GHC.Types.Constraint)\n (t' :: (k2 -> *) -> k3 -> *) (t :: (k4 -> *) -> k5 -> *).\n Barbies.Generics.Constraints.GAll\n 1 c (Barbies.Generics.Constraints.Self\n (t'\n (P 1 Barbies.Generics.Constraints.X)\n Barbies.Generics.Constraints.Y)\n (t Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y))\n = () :: Constraint\n-6c0de183c0084059d4cc77084f5ff74c\n+c134c7d328211bdd7c4c87f93954b149\n axiom D:R:TagSelf1' ::\n forall kf kg (b :: kf -> kg -> *) mt (m :: GHC.Generics.Meta)\n (s :: * -> *).\n TagSelf1' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf1' b s)\n forall kf kg (b :: kf -> kg -> *) (l :: * -> *) (r :: * -> *).\n TagSelf1' b (l GHC.Generics.:+: r)\n@@ -824,35 +824,35 @@\n forall kf kg (b :: kf -> kg -> *) x y.\n TagSelf1' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.V1 = GHC.Generics.V1\n-2fd17a4da800c5787ace0662c4ab16f5\n+1eadb8c0491d4b9fb505a6a4041fe27c\n type GAllRepT :: forall {k} {kg}. ((k -> *) -> kg -> *) -> * -> *\n type GAllRepT t = TagSelf1 t :: * -> *\n-b8dac055b26b88d4f2163bd4827c0db0\n+ed6076309feeacf626d5beed5e038d3e\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-60b6a26daeaa761940977f97dbbe94f6\n+a0008ab8b71b3def4b4cd93bd6cf4ae4\n type TagSelf1 :: forall {k} {kg}. ((k -> *) -> kg -> *) -> * -> *\n type TagSelf1 b =\n TagSelf1'\n (Data.Generics.GenericN.Indexed b 2)\n (Data.Generics.GenericN.Zip\n (GHC.Generics.Rep\n (Data.Generics.GenericN.Indexed\n (b Barbies.Generics.Constraints.X)\n 1\n Barbies.Generics.Constraints.Y))\n (GHC.Generics.Rep\n (b Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y)))\n :: * -> *\n-b23920de0c0254a7356b171d679daf1a\n+2585e2f92391036bf9cdb91e467ac073\n type TagSelf1' :: forall kf kg.\n (kf -> kg -> *) -> (* -> *) -> * -> *\n type family TagSelf1' b repbf where\n forall kf kg (b :: kf -> kg -> *) mt (m :: GHC.Generics.Meta)\n (s :: * -> *).\n TagSelf1' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf1' b s)\n@@ -871,15 +871,15 @@\n TagSelf1' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:TagSelf1'\n-68341ccf3a168e0f6df27d95f5e10b64\n+7bf605a34e44f6830c6fe51ed05303c9\n gtaddDictsDefault ::\n forall {k} {kr} (t :: (k -> *) -> kr -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *) (x :: kr).\n (CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -1136,15 +1136,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) }]\n-cd9bead83115c2ea79383713e9463d08\n+0ef85d42d46bbfea7a1463778b9b5215\n tdicts ::\n forall {kl} {kr} (c :: kl -> GHC.Types.Constraint)\n (t :: (kl -> *) -> kr -> *) (x :: kr).\n (ConstraintsT t, Barbies.Internal.ApplicativeT.ApplicativeT t,\n AllT c t) =>\n t (Barbies.Internal.Dicts.Dict c) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1180,30 +1180,30 @@\n @kl\n @kr\n @t\n $dApplicativeT\n @Data.Proxy.Proxy\n @x\n (Data.Proxy.Proxy @kl)))]\n-cea1e214f4070d66a52c6af84508abdf\n+84732f8399a3267c260d3d4931879a2f\n tdicts1 ::\n forall {kl} {c :: kl -> GHC.Types.Constraint} {a :: kl}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a\n -> Barbies.Internal.Dicts.Dict c a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(L),A)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @kl\n @c :: kl -> GHC.Types.Constraint\n @a :: kl\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a) ->\n case ds of wild { Data.Functor.Product.Pair c1 ds1 -> c1 }]\n-c9553d9670c36ba943df72304faeb7af\n+ab44bc82c04f9c2f17590d359dc5e0b4\n tfoldMapC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) m (f :: k -> *) (x :: kr).\n (Barbies.Internal.TraversableT.TraversableT t, ConstraintsT t,\n AllT c t, GHC.Base.Monoid m) =>\n (forall (a :: k). c a => f a -> m) -> t f x -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1249,15 +1249,15 @@\n <*>_N _R _P)) } })\n (taddDicts @k @kr @t $dConstraintsT @c @f @x irred eta))\n `cast`\n ( f a -> m>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n <*>_N _R _P)]\n-a0f909dabfcacacb160fc8fb2fd88ee7\n+cd42af4933908ccc6702697d0fe2156b\n tmapC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) (f :: k -> *) (g :: k -> *) (x :: kr).\n (AllT c t, ConstraintsT t) =>\n (forall (a :: k). c a => f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1282,15 +1282,15 @@\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f a) ->\n case ds of wild { Data.Functor.Product.Pair d fa ->\n case d of wild1 { Barbies.Internal.Dicts.Dict irred1 ->\n eta @a irred1 fa } })\n (taddDicts @k @kr @t $dConstraintsT @c @f @x irred eta1)]\n-fcda53e4bff44d0c6b12851109190cd6\n+08e374a00b71a52c0ee01c6747155b3f\n tmempty ::\n forall {k} {k'} (f :: k -> *) (t :: (k -> *) -> k' -> *) (x :: k').\n (AllTF GHC.Base.Monoid f t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1336,15 +1336,15 @@\n @k\n @k'\n @t\n $dApplicativeT\n @Data.Proxy.Proxy\n @x\n (Data.Proxy.Proxy @k))))]\n-ce151215b259dbd8c8a8d0c5702aba9e\n+7080212214e1bce7f95a9a2d247ac1cf\n tmempty1 ::\n forall {k} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f))\n Data.Proxy.Proxy\n a\n@@ -1358,15 +1358,15 @@\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f))\n Data.Proxy.Proxy\n a) ->\n case ds of wild { Data.Functor.Product.Pair c ds1 -> c }]\n-d8f18e281ab7eafe3f2e6a3d64e49946\n+0aff19f627fc711ed721a9309906786c\n tmempty2 ::\n forall {k} {f :: k -> *} {a :: k}.\n Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f) a\n -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(A,1L,A,A))>,\n@@ -1379,15 +1379,15 @@\n case ds of wild { Barbies.Internal.Dicts.Dict irred ->\n GHC.Base.mempty\n @(f a)\n irred\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N _N _N _N _N) }]\n-b1646cf90d6f7cbb109b9e09393ebc76\n+9c93ad29e60ad0937613c73dafa7dec3\n tpureC ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (t :: (k -> *) -> k' -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1435,15 +1435,15 @@\n @k\n @k'\n @t\n $dApplicativeT\n @Data.Proxy.Proxy\n @x\n (Data.Proxy.Proxy @k))))]\n-038c8c5c104e8c160fb65247f289334d\n+4583612791ed456316b18d5ff9373604\n ttraverseC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) (f :: k -> *) (g :: k -> *)\n (e :: * -> *) (x :: kr).\n (Barbies.Internal.TraversableT.TraversableT t, ConstraintsT t,\n AllT c t, GHC.Base.Applicative e) =>\n (forall (a :: k). c a => f a -> e (g a)) -> t f x -> e (t g x)\n@@ -1478,15 +1478,15 @@\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 x1 ->\n case ds1 of wild1 { Barbies.Internal.Dicts.Dict irred1 ->\n f1 @a irred1 x1 } })\n (taddDicts @k @kr @t $dConstraintsT @c @f @x irred t1)]\n-cf193c2f7801f88c6a6a618210339ef9\n+3481e0bd4b9f09eab3eb4ab585c2cbaa\n tzipWith3C ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a)\n@@ -1558,15 +1558,15 @@\n $dApplicativeT\n @f\n @x\n @g\n tf\n tg)\n th))]\n-4d2866b0d862b8b17c8299abb54deb08\n+e58fdee3483363a50cb5dea3e7a1a48b\n tzipWith4C ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (j :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a -> j a)\n@@ -1655,15 +1655,15 @@\n @f\n @x\n @g\n tf\n tg)\n th)\n ti))]\n-ffa24966b6937bf5fe2474e7b4e31abf\n+d473ef2ff63f63e8caa1d045e39cf38e\n tzipWithC ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a)\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,30 +1,30 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.Containers [family instance module] 9066\n- interface hash: 2a04ad914f8c894030df9f14263db3e2\n- ABI hash: 89b252e23e35e9000e541280249b249b\n- export-list hash: 4f77bb01354be65f6ea4c93400d3233b\n+ interface hash: 601939ab658605e1ff1ae8509b208e8a\n+ ABI hash: 9280f784d6cac5971bd3049fb4ea3a54\n+ export-list hash: db2250c0d35046314edad47171b0584b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: cdd79a1050217787aa21c49d863a3163\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: e7651a07642b22a2e2105f6c76f4b003\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Container{Container getContainer}\n ErrorContainer{ErrorContainer getErrorContainer}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -34,42 +34,42 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bpure d8883fe8f1378838c6dcb611d4546400\n- bzipWith f55c10be3a14621f3eb32055001f484a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- bfoldMap ba0744e112b486ac5bb067fb062133f4\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 8580d8e7c5c9c44a5534809ebf1907d2\n- exports: b2c90f3ed7344f6cbd155b29f58a4f5d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+ bzipWith b39181fa2c8191904967f5c9a9668fe9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ bfoldMap ba02d28d2b8fc3ffd9509b200aa5e6f6\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie dad1ef832afa2c721a22049834cc9dd4\n+ exports: b3763818b9e315ec61a28b921995582d\n import -/ Data.Bifunctor 1d9d7c21b881329380908e0dfd716fa2\n import -/ Data.Bitraversable b3dde5b92e054012e0f42e345cd39579\n import -/ Data.Either 7c47cd251bd107db492912c22e18f784\n import -/ Data.Foldable 37d8b44e2b26697f0bf316460a82287c\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.ParserCombinators.ReadPrec a657147dbd7291808782bfe31b23cd99\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n-f1521ba707d23c999ae6ef3283ea07b0\n+14b2273bbe440df7be5388c73e211040\n $fApplicativeContainer ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n GHC.Base.Applicative (Container b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -101,15 +101,15 @@\n ($fApplicativeContainer3 @b v)\n `cast`\n (forall (a :: <*>_N) (b1 :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))\n ($fApplicativeContainer_$c<* @b v)]\n-a7c174a68359cb63f978b02978bbdcf6\n+a76f92d368c95a6640103a384e3329a7\n $fApplicativeContainer1 ::\n Data.Functor.Product.Product\n (Data.Functor.Const.Const (a1 -> b))\n (Data.Functor.Const.Const a1)\n a2\n -> Data.Functor.Const.Const b a2\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -123,28 +123,28 @@\n (Data.Functor.Const.Const a)\n a1) ->\n case ds4 of wild { Data.Functor.Product.Pair fa ga ->\n (fa `cast` (Data.Functor.Const.N:Const[0] <*>_N b>_R _P)\n ga `cast` (Data.Functor.Const.N:Const[0] <*>_N _R _P))\n `cast`\n (Sym (Data.Functor.Const.N:Const[0] <*>_N _R _P)) }]\n-387329215245f058139892ecedbc7266\n+e99c10be3fc67815f183934cd230e3b9\n $fApplicativeContainer2 ::\n Data.Functor.Const.Const a1 a2\n -> b -> Data.Functor.Const.Const a1 a2\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b\n @a\n @a1\n (ds4['GHC.Types.Many] :: Data.Functor.Const.Const a a1)\n (ds5['GHC.Types.Many] :: b) ->\n ds4]\n-6fecceae91020ec1d7838d76665822aa\n+d9e75c469cb1c8ee6ed7a7b1555736df\n $fApplicativeContainer3 ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b a -> Container b b1 -> b (Data.Functor.Const.Const b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -183,26 +183,26 @@\n `cast`\n (forall (a1 :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n <*>_N b1>_R _P))\n eta `cast` (N:Container[0] _R _N))\n eta1 `cast` (N:Container[0] _R _N))]\n-cc9d33e6519358099f64e8ab8a75f7c1\n+e4fcbbb1bb32d54452a8d7faa46edee1\n $fApplicativeContainer4 :: Data.Functor.Const.Const a1 a2 -> b -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n @a1\n (ds4['GHC.Types.Many] :: Data.Functor.Const.Const a a1)\n (eta['GHC.Types.Many] :: b) ->\n eta]\n-c17c094d07bb3ac90844984c5b88c30e\n+6844caea325b4ccc08e85cbbe30f17ea\n $fApplicativeContainer5 ::\n Data.Functor.Product.Product\n (Data.Functor.Const.Const (b -> b)) (Data.Functor.Const.Const b) a\n -> Data.Functor.Const.Const b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1C(1,L),L)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n@@ -213,15 +213,15 @@\n (Data.Functor.Const.Const b)\n a) ->\n case ds4 of wild { Data.Functor.Product.Pair fa ga ->\n (fa `cast` (Data.Functor.Const.N:Const[0] <*>_N b>_R _P)\n ga `cast` (Data.Functor.Const.N:Const[0] <*>_N _R _P))\n `cast`\n (Sym (Data.Functor.Const.N:Const[0] <*>_N _R _P)) }]\n-a65de0e1279b293ab2156326ef06d34d\n+14ca10cb44bd00a4b6f96b383b1b55a1\n $fApplicativeContainer6 ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b (a -> b1)\n -> Container b a -> b (Data.Functor.Const.Const b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -246,15 +246,15 @@\n @(*)\n @b\n $dApplicativeB\n @(Data.Functor.Const.Const (a -> b1))\n @(Data.Functor.Const.Const a)\n l `cast` (N:Container[0] _R b1>_N)\n r `cast` (N:Container[0] _R _N))]\n-389e1d5eda3010ae886d765de12fdb91\n+4a3984819deef987b8c5f3fe3e7db420\n $fApplicativeContainer_$c<* ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b a -> Container b b1 -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -302,15 +302,15 @@\n @(Data.Functor.Const.Const (b1 -> a))\n @(Data.Functor.Const.Const b1)\n l\n r `cast` (N:Container[0] _R _N)))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-6be5cba4b80fa62b4ebb3efe056f3530\n+e46fe3a471e3e50d0dce353a33bfba44\n $fApplicativeContainer_$cliftA2 ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n (a -> b1 -> c) -> Container b a -> Container b b1 -> Container b c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -358,15 +358,15 @@\n @(Data.Functor.Const.Const (b1 -> c))\n @(Data.Functor.Const.Const b1)\n l\n r `cast` (N:Container[0] _R _N)))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-124249bcd1341b35361b3898ddd264ff\n+b24638917d3676f8eadf66d82ae763be\n $fApplicativeContainer_$cp1Applicative ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n GHC.Base.Functor (Container b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -374,15 +374,15 @@\n b) ->\n $fFunctorContainer\n @b\n (Barbies.Internal.ApplicativeB.$p1ApplicativeB\n @(*)\n @b\n $dApplicativeB)]\n-face662fbd73f3f5cb45bfb045cb7c14\n+c2f815666f2ac75e178e16a874f60c20\n $fEqContainer ::\n GHC.Classes.Eq (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Eq (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -396,15 +396,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b (Data.Functor.Const.Const a)) v)\n `cast`\n (Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-91a44938a8b9fedf18957a36da41a3dc\n+849c3cfc506d76857ad293a0d4a6b7a9\n $fEqErrorContainer ::\n GHC.Classes.Eq (b (Data.Either.Either e)) =>\n GHC.Classes.Eq (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -417,15 +417,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b (Data.Either.Either e)) v)\n `cast`\n (Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-cd32c03fbf1cbe77cc06aaf617742e1c\n+d04d8e162cb5ff9e4d6d34dbe7f9e776\n $fFoldableContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Foldable.Foldable (Container b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -462,15 +462,15 @@\n ($fFoldableContainer1 @b v)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-14e89c249e14e817a7a9691e9a2938b0\n+290fc00d26828390ed2de9f054bd9739\n $fFoldableContainer1 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n Container b a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline:,\n Unfolding: Core: StableUser\n \\ @b :: (* -> *) -> *\n@@ -485,15 +485,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidProduct @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Product[0]\n _R))]\n-3360fa93a681300e40fa4aa3c1b9a98a\n+64b0cba4e41849c7bcf52f598c5af6d7\n $fFoldableContainer2 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n Container b a -> Data.Semigroup.Internal.Sum a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n Unfolding: Core: StableUser\n@@ -509,15 +509,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidSum @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Sum[0]\n _R))]\n-e6308b792c6ac14fdea65d3502371b73\n+cc7250dde145d5e7f60500dfceb32df2\n $fFoldableContainer3 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Classes.Eq a) =>\n a -> Container b a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -532,20 +532,20 @@\n @Data.Semigroup.Internal.Any\n @a\n Data.Semigroup.Internal.$fMonoidAny\n (GHC.Classes.== @a $dEq eta)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Any[0]))]\n-0dbc6fd43d53661259b8bd723f5444bd\n+14ba80e83c09ab1a7d2343ccd29b6558\n $fFoldableContainer4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-58c680db3ff6ab0e5586aeacf298dcc8\n+fdb14841dafd7c9b44e0d99a229e7fae\n $fFoldableContainer5 ::\n Data.Functor.Const.Const a1 a2\n -> Data.Semigroup.Internal.Endo (GHC.Types.Int -> GHC.Types.Int)\n -> (Data.Functor.Const.Const () a2,\n Data.Semigroup.Internal.Endo (GHC.Types.Int -> GHC.Types.Int))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1(1,),\n@@ -565,15 +565,15 @@\n GHC.Types.Int>_R)\n (\\ (v['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case v of z { GHC.Types.I# ipv ->\n x2 (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)))]\n-b3c1a0e5cb8b9215e0a149fee186c5a8\n+759b93f744ddba1dae3a9f7202182e4e\n $fFoldableContainer6 ::\n Data.Functor.Const.Const a1 a2\n -> Data.Semigroup.Internal.Endo GHC.Types.Bool\n -> (Data.Functor.Const.Const () a2,\n Data.Semigroup.Internal.Endo GHC.Types.Bool)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1(1,),\n@@ -590,23 +590,23 @@\n } in\n (GHC.Tuple.Prim.()\n `cast`\n (Sym (Data.Functor.Const.N:Const[0] <*>_N <()>_R _P)),\n (\\ (x1['GHC.Types.Many] :: GHC.Types.Bool) -> lvl13)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0] _R)))]\n-257044b12ed3ec8fa150a265cb24dfe2\n+7a1c9e2de9a8989016a293ab69a88cd7\n $fFoldableContainer7 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-3c269a53854792486ede28cf3330f357\n+0fa00362f9126b72727b7c0bcbd1b1c3\n $fFoldableContainer8 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-5d528d2886114633f3717b347ee37897\n+b8cfc43b21659762334c8693e2a86d24\n $fFoldableContainer_$cfold ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n Container b m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -619,15 +619,15 @@\n $fFoldableContainer_$cfoldMap\n @b\n $dTraversableB\n @m\n @m\n $dMonoid\n (GHC.Base.id @m)]\n-567337dadb269d0f96bbf5afcb68e5da\n+e185586296f6d9fdcb96f134c4af1aa5\n $fFoldableContainer_$cfoldMap ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> Container b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -670,15 +670,15 @@\n \\ (x['GHC.Types.Many] :: Container b a) ->\n case (g x `cast` (N:Container[0] _R _N))\n `cast`\n (Barbies.Internal.Writer.N:St[0]\n _R _R)\n lvl13 of wild { (,) a1 s' ->\n s' }]\n-3378f4980cea688d396db618335463d6\n+5887d10e0a3d133124ec437301fb5530\n $fFoldableContainer_$cfoldMap' ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> Container b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -735,15 +735,15 @@\n (GHC.Base.id @(m -> m))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n m>_R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m)\n (GHC.Base.mempty @m $dMonoid) }]\n-1821bc30db02c949c8e8a5c784513726\n+ce9223fe776a951da125cc0258ab64d2\n $fFoldableContainer_$cfoldl ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> Container b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -799,15 +799,15 @@\n (Sym (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1 }]\n-b9fddb4b67b3817f050631a243bb642c\n+d729ca7b4d6dd89cb88b9acd48c8e44c\n $fFoldableContainer_$cfoldl' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> Container b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -860,15 +860,15 @@\n (GHC.Base.id @(b1 -> b1))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n b1>_R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] b1>_R)\n (GHC.Base.id @b1)\n eta1 }]\n-47ccbc437dd7a8ae8d1a027f092ded3e\n+c9b3f783635252d592e0ac1f3b2991df\n $fFoldableContainer_$cfoldl1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> Container b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -935,15 +935,15 @@\n case s'\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n (GHC.Maybe.Nothing @a) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableContainer7 @a\n GHC.Maybe.Just v -> v } }]\n-6b396ee00a90bda7fd69f50993d333ff\n+94dd6c47c343c5628ff631c7123f78f5\n $fFoldableContainer_$cfoldr ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> Container b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -990,15 +990,15 @@\n _R\n _R)\n (GHC.Base.id @b1)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n _R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] _R) z }]\n-7587d1352988d239aa80928dbbe85c92\n+540ee454ea7ca76ba12f057173cd1513\n $fFoldableContainer_$cfoldr' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> Container b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1062,15 +1062,15 @@\n b1>_R))) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] b1>_R))\n (GHC.Base.id @b1)\n z0 }]\n-817171165f15c65c278755f097b21407\n+61aede4dd74b85f623da1e7427a034a4\n $fFoldableContainer_$cfoldr1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> Container b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1128,15 +1128,15 @@\n _R)) of wild { (,) a1 s' ->\n case s'\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableContainer8 @a\n GHC.Maybe.Just v -> v } }]\n-b17cc1575472cfb1214bd2409304e6c4\n+b46bbf17d19f228fef33dd6cd2360622\n $fFoldableContainer_$clength ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1173,15 +1173,15 @@\n GHC.Types.Int>_R)) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int)\n $fFoldableContainer4 }]\n-e7cd61559cfe1386a88aa3f01c615ced\n+8f65b5a67074abef1c16d92bf65e1ea2\n $fFoldableContainer_$cmaximum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n Container b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -1220,15 +1220,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Max[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Max[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-aad561785b69e1adf949f2d8e08b6771\n+a14d45ab25ecdac360194aa84370cf4e\n $fFoldableContainer_$cminimum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n Container b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -1267,15 +1267,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Min[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Min[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-24d0888632b1c650506d791f86618c03\n+507d27d27e52a332c9955ebe4ce779f4\n $fFoldableContainer_$cnull ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1308,15 +1308,15 @@\n _R)\n (GHC.Base.id @GHC.Types.Bool)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n _R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True }]\n-9adf15a38fb152bf5f306926339d5c5e\n+98c3cf0b7dccc3d3225fc14e78a32671\n $fFoldableContainer_$ctoList ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @b :: (* -> *) -> *\n@@ -1326,15 +1326,15 @@\n (eta['GHC.Types.Many] :: Container b a) ->\n GHC.Base.build\n @a\n (\\ @b1\n (c['GHC.Types.Many] :: a -> b1 -> b1)[OneShot]\n (n['GHC.Types.Many] :: b1)[OneShot] ->\n $fFoldableContainer_$cfoldr @b $dTraversableB @a @b1 c n eta)]\n-fcfb0f17d73dde305179c66eb8e6ac09\n+f96cd5834669d7e91e813254c05c0d2a\n $fFoldableErrorContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Foldable.Foldable (ErrorContainer b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -1371,15 +1371,15 @@\n ($fFoldableErrorContainer1 @b v)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-8a5f47ad00b9d94770edad9d87e81b37\n+04e736d69d115cafd755727dfcc8f36b\n $fFoldableErrorContainer1 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n ErrorContainer b a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline:,\n Unfolding: Core: StableUser\n \\ @b :: (* -> *) -> *\n@@ -1394,15 +1394,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidProduct @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Product[0]\n _R))]\n-c3ff2e36300e5cfb3d4490957c4db350\n+94bb29b7846361ee26cb69025ee5dfa0\n $fFoldableErrorContainer2 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n ErrorContainer b a -> Data.Semigroup.Internal.Sum a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n Unfolding: Core: StableUser\n@@ -1418,15 +1418,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidSum @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Sum[0]\n _R))]\n-53442540770cd1b113d5581e3a72a9a9\n+b54f73c62e0831f7692cdba0323c477e\n $fFoldableErrorContainer3 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Classes.Eq a) =>\n a -> ErrorContainer b a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1441,15 +1441,15 @@\n @Data.Semigroup.Internal.Any\n @a\n Data.Semigroup.Internal.$fMonoidAny\n (GHC.Classes.== @a $dEq eta)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Any[0]))]\n-a08221cd2e8b4f6e1b2c98575fadf49f\n+a412c0e764397f8fff0275e1bcf6de67\n $fFoldableErrorContainer4 ::\n Data.Either.Either a1 a2\n -> Data.Semigroup.Internal.Endo (GHC.Types.Int -> GHC.Types.Int)\n -> (Data.Functor.Const.Const () a2,\n Data.Semigroup.Internal.Endo (GHC.Types.Int -> GHC.Types.Int))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1(1,),\n@@ -1472,15 +1472,15 @@\n -> \\ (v['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case v of z { GHC.Types.I# ipv ->\n x2 (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }\n Data.Either.Right y -> x2 }))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)))]\n-a31237743468318d9f410524594559b3\n+44927f65d2949dd278aff7f3afa82b00\n $fFoldableErrorContainer5 ::\n Data.Either.Either a1 a2\n -> Data.Semigroup.Internal.Endo GHC.Types.Bool\n -> (Data.Functor.Const.Const () a2,\n Data.Semigroup.Internal.Endo GHC.Types.Bool)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1(1,),\n@@ -1496,15 +1496,15 @@\n (\\ (x1['GHC.Types.Many] :: GHC.Types.Bool) ->\n eta `cast` (Data.Semigroup.Internal.N:Endo[0] _R)\n (case x of wild {\n Data.Either.Left x2 -> GHC.Types.False\n Data.Either.Right y -> x1 }))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0] _R)))]\n-cc22329d022e4bd8bba8fa8fc7043a90\n+7e041dcd924d260c2ac7014b74263773\n $fFoldableErrorContainer_$cfold ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n ErrorContainer b m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1517,15 +1517,15 @@\n $fFoldableErrorContainer_$cfoldMap\n @b\n $dTraversableB\n @m\n @m\n $dMonoid\n (GHC.Base.id @m)]\n-f36eb1e32ba1e0d788abe79eec01d0ff\n+f7c249a2afe8f64ab642db3d7c965484\n $fFoldableErrorContainer_$cfoldMap ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> ErrorContainer b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1572,15 +1572,15 @@\n \\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n case (g x `cast` (N:ErrorContainer[0] _R _N))\n `cast`\n (Barbies.Internal.Writer.N:St[0]\n _R _R)\n lvl13 of wild { (,) a1 s' ->\n s' }]\n-475abe9ff1548da2dcbe797572bb6a85\n+ef0c26ef930027c02ec440af37df92bf\n $fFoldableErrorContainer_$cfoldMap' ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> ErrorContainer b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -1636,15 +1636,15 @@\n (GHC.Base.id @(m -> m))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n m>_R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m)\n (GHC.Base.mempty @m $dMonoid) }]\n-ad99584fef301b9a25611c4c993539bf\n+92cfe5c89a2db74f2704b593e0fca83c\n $fFoldableErrorContainer_$cfoldl ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> ErrorContainer b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1708,15 +1708,15 @@\n (Sym (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1 }]\n-25469f9f8c5f1db463384173cd885864\n+611f427387f37d058d473af691a412ce\n $fFoldableErrorContainer_$cfoldl' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> ErrorContainer b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -1768,15 +1768,15 @@\n (GHC.Base.id @(b1 -> b1))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n b1>_R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] b1>_R)\n (GHC.Base.id @b1)\n eta1 }]\n-1110effe739c295507bb35a164df27da\n+51e8a9c0bcdc42e742bcce21271e038e\n $fFoldableErrorContainer_$cfoldl1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1796,15 +1796,15 @@\n @a\n (case m of wild {\n GHC.Maybe.Nothing -> y GHC.Maybe.Just x -> f x y }))\n (GHC.Maybe.Nothing @a)\n xs of wild {\n GHC.Maybe.Nothing -> $fFoldableContainer7 @a\n GHC.Maybe.Just v -> v }]\n-67a651c4a204001c045801ec06c60cfa\n+100cd5d76d33ee5c759134bca3f1a9f5\n $fFoldableErrorContainer_$cfoldr ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> ErrorContainer b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1857,15 +1857,15 @@\n _R\n _R)\n (GHC.Base.id @b1)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n _R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] _R) z }]\n-6c58945ed348ffd20fcbd4377acc7e96\n+81dc2c773f06c26d10249f6073bae92d\n $fFoldableErrorContainer_$cfoldr' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> ErrorContainer b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1884,15 +1884,15 @@\n (\\ (ds4['GHC.Types.Many] :: b1 -> b1)\n (ds5['GHC.Types.Many] :: a)[OneShot]\n (v['GHC.Types.Many] :: b1)[OneShot] ->\n case v of z { DEFAULT -> ds4 (f ds5 z) })\n (GHC.Base.id @b1)\n xs\n z0]\n-02d0a9f3b218bd1c3d786901c662d9bf\n+f9321abcf9ad9578009c2be81f403c7a\n $fFoldableErrorContainer_$cfoldr1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1949,15 +1949,15 @@\n _R)) of wild { (,) a1 s' ->\n case s'\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableContainer8 @a\n GHC.Maybe.Just v -> v } }]\n-a90a20c85d6623cb9d18818274570906\n+78879c78f14234f1e84f729135034bd6\n $fFoldableErrorContainer_$clength ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1994,15 +1994,15 @@\n GHC.Types.Int>_R)) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int)\n $fFoldableContainer4 }]\n-88a2501a4af497db875b72b72faf218a\n+0fa2a937a146bda236c2145f3d460889\n $fFoldableErrorContainer_$cmaximum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -2041,15 +2041,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Max[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Max[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-6a75c3135d1c4eb4713616c7b418cb4d\n+4f5bd35dc75ac8096e257788016da261\n $fFoldableErrorContainer_$cminimum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -2088,15 +2088,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Min[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Min[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-6a9a1bc6945d23f3ff8c81e182cf43ed\n+4fee7ba8968ba2c6c38305d0abaa54c2\n $fFoldableErrorContainer_$cnull ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2129,15 +2129,15 @@\n _R)\n (GHC.Base.id @GHC.Types.Bool)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n _R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True }]\n-5eea33282ede5893e974ce90e0e7c9ad\n+ad582f8b268075f56ccbb9c9bf61a00a\n $fFoldableErrorContainer_$ctoList ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @b :: (* -> *) -> *\n@@ -2147,27 +2147,27 @@\n (eta['GHC.Types.Many] :: ErrorContainer b a) ->\n GHC.Base.build\n @a\n (\\ @b1\n (c['GHC.Types.Many] :: a -> b1 -> b1)[OneShot]\n (n['GHC.Types.Many] :: b1)[OneShot] ->\n $fFoldableErrorContainer_$cfoldr @b $dTraversableB @a @b1 c n eta)]\n-494ab54fbced0f2b78a250819f348eb5\n+e32dbed27d7e55bc29729d9cb4a5fe0a\n $fFunctorContainer ::\n Barbies.Internal.FunctorB.FunctorB b =>\n GHC.Base.Functor (Container b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n (v['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @(Container b)\n ($fFunctorContainer_$cfmap @b v)\n ($fFunctorContainer_$c<$ @b v)]\n-59c89a2e7c490c173d0d5ac7734c9e31\n+b7fb359de7f77f7f5dfc2d1ddb7a715b\n $fFunctorContainer_$c<$ ::\n Barbies.Internal.FunctorB.FunctorB b =>\n a -> Container b b1 -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2194,15 +2194,15 @@\n <*>_N _R _P))\n } in\n (\\ (x['GHC.Types.Many] :: Container b b1) ->\n f x `cast` (N:Container[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-f9a7143b271f4d0ff61b93ae43166565\n+6a8a5c6fd456871c3127876333d11985\n $fFunctorContainer_$cfmap ::\n Barbies.Internal.FunctorB.FunctorB b =>\n (a -> b1) -> Container b a -> Container b b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2229,27 +2229,27 @@\n <*>_N _R _P))\n } in\n (\\ (x['GHC.Types.Many] :: Container b a) ->\n f1 x `cast` (N:Container[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-873063d8addd502ef5bd84ccd028449a\n+0e6956d8c3a846568dd3da22fd69e36b\n $fFunctorErrorContainer ::\n Barbies.Internal.FunctorB.FunctorB b =>\n GHC.Base.Functor (ErrorContainer b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n (v['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @(ErrorContainer b)\n ($fFunctorErrorContainer_$cfmap @b v)\n ($fFunctorErrorContainer_$c<$ @b v)]\n-bc3dbcfa4a5f66e688d60bea5b5526c0\n+0cad49bee17eb24ed5d301f348ce0e56\n $fFunctorErrorContainer_$c<$ ::\n Barbies.Internal.FunctorB.FunctorB b =>\n a -> ErrorContainer b b1 -> ErrorContainer b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2275,15 +2275,15 @@\n Data.Either.Right b2 -> Data.Either.Right @a @a1 b2 })\n } in\n (\\ (x['GHC.Types.Many] :: ErrorContainer b b1) ->\n f x `cast` (N:ErrorContainer[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-ab63ae5a52a50592dd552773b6dd53cf\n+900a60bfa635e2145f8c65c30c42a714\n $fFunctorErrorContainer_$cfmap ::\n Barbies.Internal.FunctorB.FunctorB b =>\n (a -> b1) -> ErrorContainer b a -> ErrorContainer b b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2302,24 +2302,24 @@\n (\\ @a1 -> Data.Bifunctor.$fBifunctorEither_$cfirst @a @b1 @a1 f)\n } in\n (\\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n f1 x `cast` (N:ErrorContainer[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-ac6b9eade85d1222c468768d4b9e3483\n+457dc692befc34cc9c22a47d316ebd9b\n $fGenericContainer :: GHC.Generics.Generic (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> * @a.\n @(Container b a)\n ($fGenericContainer_$cfrom @b @a)\n ($fGenericContainer_$cto @b @a)]\n-93beb333d7a035421f35d851a5d0c0b5\n+adadc5aa38df00f4ca80412aca1b6d1e\n $fGenericContainer_$cfrom ::\n Container b a -> GHC.Generics.Rep (Container b a) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @a\n@@ -2365,15 +2365,15 @@\n (b (Data.Functor.Const.Const a)))>_R)\n ; Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R)\n ; Sub (Sym (Rep_Container[0] _N _N))) _N)]\n-c1a86174e5938d2fd736a0980067d9c3\n+cc98078819e3af99ecb936d0cad12737\n $fGenericContainer_$cto ::\n GHC.Generics.Rep (Container b a) x -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @a\n@@ -2406,15 +2406,15 @@\n %<'GHC.Types.Many>_N ->_R (Sub (Rep_Container[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R) _N\n ; GHC.Generics.N:K1[0]\n <*>_N\n _P\n _R\n _P\n ; Sym (N:Container[0] _R _N))]\n-69335c5173bf30cd48c624dff0d2d52b\n+d8d7fc8fa52a801bd84ab5eb3489b954\n $fGenericErrorContainer ::\n GHC.Generics.Generic (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> * @e.\n @(ErrorContainer b e)\n ($fGenericErrorContainer_$cfrom @b @e)\n ($fGenericErrorContainer_$cto @b @e)]\n-0d07567e2e9747645e376b3f69ab2e00\n+88a4509095fc56deef9c028ff4c64c4c\n $fGenericErrorContainer_$cfrom ::\n ErrorContainer b e -> GHC.Generics.Rep (ErrorContainer b e) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @e\n@@ -2522,15 +2522,15 @@\n (b (Data.Either.Either e)))>_R)\n ; Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R)\n ; Sub (Sym (Rep_ErrorContainer[0] _N _N))) _N)]\n-2ee1dad584f7843b76fd4d5904ddebaa\n+b465749f80a1d5966b163ca8c553b4c9\n $fGenericErrorContainer_$cto ::\n GHC.Generics.Rep (ErrorContainer b e) x -> ErrorContainer b e\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @e\n@@ -2564,15 +2564,15 @@\n %<'GHC.Types.Many>_N ->_R (Sub (Rep_ErrorContainer[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R) _N\n ; GHC.Generics.N:K1[0]\n <*>_N\n _P\n _R\n _P\n ; Sym (N:ErrorContainer[0] _R _N))]\n-5a2a3e908acbe8a51cff6e4a30744731\n+0e037282bec8d9a418b42932a016f8ed\n $fOrdContainer ::\n GHC.Classes.Ord (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Ord (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -2664,30 +2664,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))\n (GHC.Classes.min @(b (Data.Functor.Const.Const a)) v)\n `cast`\n (Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-00ff98d57dec767c6da6bc8871fc752d\n+b8049c2218a13532180d96a3d0be70f2\n $fOrdContainer_$cp1Ord ::\n GHC.Classes.Ord (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Eq (Container b a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord\n (b (Data.Functor.Const.Const a))) ->\n $fEqContainer\n @b\n @a\n (GHC.Classes.$p1Ord @(b (Data.Functor.Const.Const a)) $dOrd)]\n-49da7a95413161421e34331769d714d3\n+b9ed16714a9ad90ed570d20e808797b5\n $fOrdErrorContainer ::\n GHC.Classes.Ord (b (Data.Either.Either e)) =>\n GHC.Classes.Ord (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -2727,30 +2727,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))\n (GHC.Classes.min @(b (Data.Either.Either e)) v)\n `cast`\n (Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-92a17c3b822834c2ec7e475fe8e7f91b\n+0d9eaedc46182ab4abb636a1577e5eb9\n $fOrdErrorContainer_$cp1Ord ::\n GHC.Classes.Ord (b (Data.Either.Either e)) =>\n GHC.Classes.Eq (ErrorContainer b e)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @e\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord\n (b (Data.Either.Either e))) ->\n $fEqErrorContainer\n @b\n @e\n (GHC.Classes.$p1Ord @(b (Data.Either.Either e)) $dOrd)]\n-db0af78df81976e333d9eaa59c77ffee\n+0068e288fd897465b6b9d5601697127f\n $fReadContainer ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n GHC.Read.Read (Container b a)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -2764,24 +2764,24 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadContainer_$creadListPrec @b @a v)]\n-ef78bd01547cc7b5ee2910a4488384c1\n+4345b2755a339aec68116a8ab2aff364\n $fReadContainer1 ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (Container b a -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-df0218c6e6ad5f276575bedd6160ee39\n+40469492a8f5296858e2a77e40affb5b\n $fReadContainer_$creadList ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadP.ReadS [Container b a]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2803,15 +2803,15 @@\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Container b a]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Container b a]>_R)\n @[Container b a]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[Container b a]))]\n-8643c3bb71515ac7751a9f0f0aa1f177\n+0fb6ac60627730640b6ebe03db83753b\n $fReadContainer_$creadListPrec ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [Container b a]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2823,15 +2823,15 @@\n ($fReadContainer1 @b @a $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-9affd6677bf5df942ca1b8f25421ebb5\n+f0c318725e2dcc64ef23200630bc7b46\n $fReadContainer_$creadsPrec ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Container b a)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2845,15 +2845,15 @@\n @b\n @a\n $dRead\n eta\n @(Container b a)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Container b a)))]\n-3d4fde39924202caf4f0f57a7ee5c462\n+52007fcee6e788c99b8da1a0e1d5030d\n $fReadErrorContainer ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n GHC.Read.Read (ErrorContainer b e)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -2866,24 +2866,24 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadErrorContainer_$creadListPrec @b @e v)]\n-990748b23bb7394c1b65ea2f1bc7adf4\n+fd12aac599758a02c74df94d54b0fcd7\n $fReadErrorContainer1 ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (ErrorContainer b e -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-a8596f7b29f858545cd9460b853d0bbc\n+7988717326fbd29e9e713cf3ba479a11\n $fReadErrorContainer_$creadList ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadP.ReadS [ErrorContainer b e]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2906,15 +2906,15 @@\n <[ErrorContainer b e]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[ErrorContainer b e]>_R)\n @[ErrorContainer b e]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[ErrorContainer b e]))]\n-ab91a02e7b273a2352ea77e7f09e746e\n+eb273780f17f45b829974ef62c1e12fa\n $fReadErrorContainer_$creadListPrec ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [ErrorContainer b e]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2926,15 +2926,15 @@\n ($fReadErrorContainer1 @b @e $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-98ea362a6b273913470e43b2d4d7b861\n+22628b7740c3fc9d6b276dc01d6a7151\n $fReadErrorContainer_$creadsPrec ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n GHC.Types.Int\n -> Text.ParserCombinators.ReadP.ReadS (ErrorContainer b e)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -2949,43 +2949,43 @@\n @b\n @e\n $dRead\n eta\n @(ErrorContainer b e)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(ErrorContainer b e)))]\n-35152f0df2d5d82a57076163c4dd0fe7\n+ade227fc727df690e1538dbe2808c3b5\n $fShowContainer ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Show.Show (Container b a)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n @a\n (v['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Functor.Const.Const a))).\n @(Container b a)\n ($fShowContainer_$cshowsPrec @b @a v)\n ($fShowContainer_$cshow @b @a v)\n ($fShowContainer_$cshowList @b @a v)]\n-2032aae23242b337cc50e1b17b1feacf\n+03befb5b9697a23286491c2a5171cbd9\n $fShowContainer1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"}\"#]\n-a89d6e760355821b353d4df175a57a12\n+c850f02564295824a48796c89dee2ea2\n $fShowContainer2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Container {getContainer = \"#]\n-6ff10b3963dcdb901d12e6b5c9d29aa8\n+e4e44f10c1aaee38bc61867f50694ae8\n $fShowContainer3 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fShowContainer1]\n-a25e8e53a996e513869b910c2ba8734b\n+5dd2fa056bcfaa5b133c1605a5ad2f21\n $fShowContainer_$cshow ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n Container b a -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2997,15 +2997,15 @@\n $fShowContainer2\n (GHC.Show.showsPrec\n @(b (Data.Functor.Const.Const a))\n $dShow\n $fFoldableContainer4\n x `cast` (N:Container[0] _R _N)\n $fShowContainer3)]\n-e75664c12692f4f3f6c99b81a95aa3ee\n+25412af001e2ef2b57ba7e92f557c5f4\n $fShowContainer_$cshowList ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n [Container b a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3016,48 +3016,48 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Container b a)\n (\\ (ds4['GHC.Types.Many] :: Container b a) ->\n $w$cshowsPrec @b @a $dShow 0# ds4)\n ls\n s]\n-6e360dffa68007a714f6a72f51a6bb12\n+560134fc1070e45977c2c264ab4e95fc\n $fShowContainer_$cshowsPrec ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Types.Int -> Container b a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @b :: (* -> *) -> *\n @a\n ($dShow['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Functor.Const.Const a)))\n (a1['GHC.Types.Many] :: GHC.Types.Int)\n (ds4['GHC.Types.Many] :: Container b a) ->\n case a1 of wild { GHC.Types.I# ww ->\n $w$cshowsPrec @b @a $dShow ww ds4 }]\n-08ee8c81177cbe6f345924213ab5a963\n+6d432f9ea95bc97f83c3b2968044262a\n $fShowErrorContainer ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Show.Show (ErrorContainer b e)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n @e\n (v['GHC.Types.Many] :: GHC.Show.Show (b (Data.Either.Either e))).\n @(ErrorContainer b e)\n ($fShowErrorContainer_$cshowsPrec @b @e v)\n ($fShowErrorContainer_$cshow @b @e v)\n ($fShowErrorContainer_$cshowList @b @e v)]\n-16102b630752639031beab1ef48a2707\n+881e4b184d8e375806420561b18935ec\n $fShowErrorContainer1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ErrorContainer {getErrorContainer = \"#]\n-21f77e4928eb73c7c6dd154e17e65fe9\n+d59a52f9de999e06bd0ffa9c08fceff0\n $fShowErrorContainer_$cshow ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n ErrorContainer b e -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3069,15 +3069,15 @@\n $fShowErrorContainer1\n (GHC.Show.showsPrec\n @(b (Data.Either.Either e))\n $dShow\n $fFoldableContainer4\n x `cast` (N:ErrorContainer[0] _R _N)\n $fShowContainer3)]\n-099d5da952e71ba8aeef1eeb7db18c47\n+cd434b301e83af01be2f21304a6f7b5f\n $fShowErrorContainer_$cshowList ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n [ErrorContainer b e] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3088,30 +3088,30 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(ErrorContainer b e)\n (\\ (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n $w$cshowsPrec1 @b @e $dShow 0# ds4)\n ls\n s]\n-1bb4cc25e5dc03820fe1a018b503df9a\n+56b887e594f1b87abbddb510d8a51ee6\n $fShowErrorContainer_$cshowsPrec ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Types.Int -> ErrorContainer b e -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @b :: (* -> *) -> *\n @e\n ($dShow['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Either.Either e)))\n (a['GHC.Types.Many] :: GHC.Types.Int)\n (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n case a of wild { GHC.Types.I# ww ->\n $w$cshowsPrec1 @b @e $dShow ww ds4 }]\n-6bb0f8c1c53c13e274a57f3102dc0ac5\n+73837b84f1fb46f81ba4662368127507\n $fTraversableContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Traversable.Traversable (Container b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -3120,26 +3120,26 @@\n @(Container b)\n ($fTraversableContainer_$cp1Traversable @b v)\n ($fFoldableContainer @b v)\n ($fTraversableContainer_$ctraverse @b v)\n ($fTraversableContainer_$csequenceA @b v)\n ($fTraversableContainer_$cmapM @b v)\n ($fTraversableContainer_$csequence @b v)]\n-717ba1b82fcfe1e0c97a92c767b59de3\n+837ba216895480238e161d3a301e074b\n $fTraversableContainer1 ::\n b2 (Data.Functor.Const.Const b1)\n -> b2 (Data.Functor.Const.Const b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b\n @b1 :: (* -> *) -> *\n (ds4['GHC.Types.Many] :: b1 (Data.Functor.Const.Const b)) ->\n ds4]\n-42abcdddf4825d600e3502a1bed6dd7a\n+f0208649078da9e21cdcf539e9670c4d\n $fTraversableContainer_$cmapM ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n (a -> m b1) -> Container b a -> m (Container b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3155,15 +3155,15 @@\n @b\n $dTraversableB\n @m\n @a\n @b1\n (GHC.Base.$p1Monad @m $dMonad)\n eta]\n-2e5b3bb3e74c68ec66a4420b2cd5c095\n+744759738c119367a6afe88f1c0a8ebb\n $fTraversableContainer_$cp1Traversable ::\n Barbies.Internal.TraversableB.TraversableB b =>\n GHC.Base.Functor (Container b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3171,15 +3171,15 @@\n b) ->\n $fFunctorContainer\n @b\n (Barbies.Internal.TraversableB.$p1TraversableB\n @(*)\n @b\n $dTraversableB)]\n-ec9057d923c08494130ff4d6e1dbdadf\n+2ca64160b41df131786c3e493074e725\n $fTraversableContainer_$csequence ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n Container b (m a) -> m (Container b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3193,15 +3193,15 @@\n @b\n $dTraversableB\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))]\n-2cec6a9c57483ead8b5a2eb700ed84da\n+3df7a50add3e7a772a203c9ded53ae68\n $fTraversableContainer_$csequenceA ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n Container b (f a) -> f (Container b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3215,15 +3215,15 @@\n @b\n $dTraversableB\n @f\n @(f a)\n @a\n $dApplicative\n (GHC.Base.id @(f a))]\n-780953e2e75c78454e9c8f26f2b1f91e\n+730f55ee01b7643a62ef22e57b5ff283\n $fTraversableContainer_$ctraverse ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n (a -> f b1) -> Container b a -> f (Container b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -3275,15 +3275,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n <*>_N _R _P))\n (eta\n eta2 `cast` (Data.Functor.Const.N:Const[0] <*>_N _R _P)))\n } in\n \\ (x['GHC.Types.Many] :: Container b a) ->\n f1 (f2 x `cast` (N:Container[0] _R _N))]\n-bfe6aa97dee723ebd50b2dd8d371690f\n+4e2bcb96049402fe25c32b37260d4713\n $fTraversableErrorContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Traversable.Traversable (ErrorContainer b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -3292,25 +3292,25 @@\n @(ErrorContainer b)\n ($fTraversableErrorContainer_$cp1Traversable @b v)\n ($fFoldableErrorContainer @b v)\n ($fTraversableErrorContainer_$ctraverse @b v)\n ($fTraversableErrorContainer_$csequenceA @b v)\n ($fTraversableErrorContainer_$cmapM @b v)\n ($fTraversableErrorContainer_$csequence @b v)]\n-9dd937c4276fd52efaae83faed4c19d7\n+e0c0c1ffb4dc112e786e53bc01947ff1\n $fTraversableErrorContainer1 ::\n b2 (Data.Either.Either b1) -> b2 (Data.Either.Either b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b\n @b1 :: (* -> *) -> *\n (ds4['GHC.Types.Many] :: b1 (Data.Either.Either b)) ->\n ds4]\n-eea9530d9a3645586f691cfb48a284a5\n+b58c37cd2cc1895def18d4154706641c\n $fTraversableErrorContainer_$cmapM ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n (a -> m b1) -> ErrorContainer b a -> m (ErrorContainer b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3326,15 +3326,15 @@\n @b\n $dTraversableB\n @m\n @a\n @b1\n (GHC.Base.$p1Monad @m $dMonad)\n eta]\n-e9c44e5deb971a28925e3efe3d33f917\n+551db0a2038729ec7a24d447b906afac\n $fTraversableErrorContainer_$cp1Traversable ::\n Barbies.Internal.TraversableB.TraversableB b =>\n GHC.Base.Functor (ErrorContainer b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3342,15 +3342,15 @@\n b) ->\n $fFunctorErrorContainer\n @b\n (Barbies.Internal.TraversableB.$p1TraversableB\n @(*)\n @b\n $dTraversableB)]\n-f6f6f17afb54cb1a03a87ea71b26c540\n+0d4420b06c3567d8815d1007c62a8643\n $fTraversableErrorContainer_$csequence ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n ErrorContainer b (m a) -> m (ErrorContainer b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3364,15 +3364,15 @@\n @b\n $dTraversableB\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))]\n-01270b5a02e8c1da7037148494d4cf3a\n+521530da486f57bf6704a40b99e82159\n $fTraversableErrorContainer_$csequenceA ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n ErrorContainer b (f a) -> f (ErrorContainer b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3386,15 +3386,15 @@\n @b\n $dTraversableB\n @f\n @(f a)\n @a\n $dApplicative\n (GHC.Base.id @(f a))]\n-a96643b33e9f451c9f4174237e94a843\n+1357700a8ff3423d68bc3b8eec7cd97d\n $fTraversableErrorContainer_$ctraverse ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n (a -> f b1) -> ErrorContainer b a -> f (ErrorContainer b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -3437,135 +3437,135 @@\n @a1\n $dApplicative\n eta\n (GHC.Base.pure @f $dApplicative @a1))\n } in\n \\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n f1 (f2 x `cast` (N:ErrorContainer[0] _R _N))]\n-a7d553536c19c8c89437903e6bd41713\n+abec5944924ceeb57d9923f76fd90c13\n $tc'Container :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11674959523014724987#Word64\n- 1860771261668301389#Word64\n+ 16354380718495274812#Word64\n+ 814762301798279210#Word64\n $trModule\n $tc'Container2\n 2#\n $tc'Container1]\n-9ea44b098e6735e5f7def144b34045a9\n+3c6719a3cf1c52d92e087047398e21be\n $tc'Container1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ea9b4253927541a2a95f536bcd12d2b9\n+fc2245575b86aeb3426f9a72dc8c0aff\n $tc'Container2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Container3]\n-94cafa23f2389006462d81d5243e5efa\n+e1c0c7493448cabfc6716ffbda7ce454\n $tc'Container3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Container\"#]\n-554f83925b1f0cdb8ec4d9b74879c5f6\n+01583243b60b3294363d61968d75ad77\n $tc'ErrorContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14855527359701066264#Word64\n- 17109921949346698154#Word64\n+ 707883891224460668#Word64\n+ 7429744106433036516#Word64\n $trModule\n $tc'ErrorContainer2\n 2#\n $tc'ErrorContainer1]\n-1dbfd41f241749be3656423a638557d9\n+b853587716ed860d725b3bc6c39f31e8\n $tc'ErrorContainer1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c1ffa79a9d019db2566092db116fe8cc\n+74bce785af8baf27733fcf4ed4f7bbdc\n $tc'ErrorContainer2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'ErrorContainer3]\n-6095c312432d793e73b37f611b60650e\n+abcd0757ecc44467e35f9d8eaef8eb66\n $tc'ErrorContainer3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'ErrorContainer\"#]\n-94fed29885847ef0e8db48cd49dc25a0\n+e09e42f324addfbda1003c3359d5a2b4\n $tcContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4808676420053827782#Word64\n- 2573184056300013498#Word64\n+ 16357764481247289159#Word64\n+ 11149079116675027957#Word64\n $trModule\n $tcContainer2\n 0#\n $tcContainer1]\n-97a60ed0132472130ac0c191ddfac945\n+6a72172f960f21f1de6a74a4767ccc7a\n $tcContainer1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-652be147eddd34492440c8b9a79bb950\n+034588f16509fb7a7c4f1146ef49eff4\n $tcContainer2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcContainer3]\n-e68bb986b4d2c6850bb15b031a213f04\n+0a6f875d485561491827b0d328a0ca61\n $tcContainer3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Container\"#]\n-e8b95d37184a31288262949263b000ce\n+daec6c3178b5fe2342deb374d72036c8\n $tcErrorContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7004789969558376778#Word64\n- 695522309174708933#Word64\n+ 15701051175288362856#Word64\n+ 16272261420726116207#Word64\n $trModule\n $tcErrorContainer1\n 0#\n $tcContainer1]\n-60311b871bc548b72437eb38fe5aa060\n+afc841f19721252bbfcd0f18d88ec835\n $tcErrorContainer1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcErrorContainer2]\n-44c534df5ccce9c80e19e400dd76466b\n+e387b02bd167a24bab0346af84442d27\n $tcErrorContainer2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ErrorContainer\"#]\n-4e00e18ce73373e0fcc2dc56135038df\n+1182cf7050b799e976f9dcb8fa02b959\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-674ceeaf6454993e22fec7da0006201a\n+b1cf3f1c71f6bbcbed080db8b8d9de1e\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4ff5bda54562710e91dd770a4edc3c83\n+cf034d5cfda3799422a5109b8634ac67\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Containers\"#]\n-f97c70b4c314717c6b1d2536b501d69f\n+a38c26ea0e242de50c46b585f8dad278\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9218a400d5799b5b1f6d3be130b52061\n+c4d162abc812c8123fff7855238d1a44\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-97a0fcabb7b5d020208f22ac4e754961\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+9a9e898656c36aa72ce605eb91d4e73b\n $w$cshowsPrec ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Prim.Int# -> Container b a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3594,15 +3594,15 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowContainer2\n (f (GHC.CString.unpackAppendCString#\n $fShowContainer1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-a6c9bd976b0c27593eb91995111679f1\n+92f47c5037fafa4a91506cb170191f21\n $w$cshowsPrec1 ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Prim.Int# -> ErrorContainer b e -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3631,92 +3631,92 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowErrorContainer1\n (f (GHC.CString.unpackAppendCString#\n $fShowContainer1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-96fdbd34013fa7b5e5f91f10c714c710\n+534844d3507a10fcf955a68452d4b169\n type role Container representational nominal\n type Container :: ((* -> *) -> *) -> * -> *\n newtype Container b a\n = Container {getContainer :: b (Data.Functor.Const.Const a)}\n-457c825d58d97b32f5e406f92b956382\n+a147e86314e63aaf4535eb2ec803ac69\n type role ErrorContainer representational nominal\n type ErrorContainer :: ((* -> *) -> *) -> * -> *\n newtype ErrorContainer b e\n = ErrorContainer {getErrorContainer :: b (Data.Either.Either e)}\n-f2acd0f4d35a03d6b963d1c4a28ee279\n+09edb256861e6234ee2203831a2b6067\n axiom Rep_Container ::\n GHC.Generics.Rep (Container b a)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Container\" 'GHC.Generics.PrefixI 'GHC.Types.True)\n (GHC.Generics.S1\n ('GHC.Generics.MetaSel\n ('GHC.Maybe.Just \"getContainer\")\n 'GHC.Generics.NoSourceUnpackedness\n 'GHC.Generics.NoSourceStrictness\n 'GHC.Generics.DecidedLazy)\n (GHC.Generics.Rec0 (b (Data.Functor.Const.Const a)))))\n-3e9c00d9333dfec2f681ce243dbb6dde\n+f67166a40d66cdeb8d0db99fc2c8fa67\n axiom Rep_ErrorContainer ::\n GHC.Generics.Rep (ErrorContainer b e)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"ErrorContainer\" 'GHC.Generics.PrefixI 'GHC.Types.True)\n (GHC.Generics.S1\n ('GHC.Generics.MetaSel\n ('GHC.Maybe.Just \"getErrorContainer\")\n 'GHC.Generics.NoSourceUnpackedness\n 'GHC.Generics.NoSourceStrictness\n 'GHC.Generics.DecidedLazy)\n (GHC.Generics.Rec0 (b (Data.Either.Either e)))))\n-d51016dd054e02ef6a76637885cbefad\n+5c3675b8b7162dde09bdcb6103fa87f3\n getContainer :: Container b a -> b (Data.Functor.Const.Const a)\n RecSel Left Container\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getContainer1\n `cast`\n (forall (b :: <(* -> *) -> *>_N) (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Container[0] _R _N)]\n-ac0624ab6b015330a18bef5e1e729254\n+04333d16ac31946194f614e80cadbfa6\n getContainer1 :: Container b a -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> * @a (ds4['GHC.Types.Many] :: Container b a) ->\n ds4]\n-7113d28f172cd850dd70c4d1d1a731c7\n+86f3d8aaf316d1331cd669380b9a5a53\n getErrorContainer :: ErrorContainer b e -> b (Data.Either.Either e)\n RecSel Left ErrorContainer\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getErrorContainer1\n `cast`\n (forall (b :: <(* -> *) -> *>_N) (e :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:ErrorContainer[0] _R _N)]\n-f0ae746786e21189b1b93d34b5972f5e\n+557dd485adafb70fefc746edc5632bb2\n getErrorContainer1 :: ErrorContainer b e -> ErrorContainer b e\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @e\n (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,30 +1,30 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.Containers [family instance module] 9066\n- interface hash: 2a04ad914f8c894030df9f14263db3e2\n- ABI hash: 89b252e23e35e9000e541280249b249b\n- export-list hash: 4f77bb01354be65f6ea4c93400d3233b\n+ interface hash: 601939ab658605e1ff1ae8509b208e8a\n+ ABI hash: 9280f784d6cac5971bd3049fb4ea3a54\n+ export-list hash: db2250c0d35046314edad47171b0584b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: d4396b0a631fae3e8c0d33c20ca3c536\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: e7651a07642b22a2e2105f6c76f4b003\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Container{Container getContainer}\n ErrorContainer{ErrorContainer getErrorContainer}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -34,42 +34,42 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bpure d8883fe8f1378838c6dcb611d4546400\n- bzipWith f55c10be3a14621f3eb32055001f484a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- bfoldMap ba0744e112b486ac5bb067fb062133f4\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 8580d8e7c5c9c44a5534809ebf1907d2\n- exports: b2c90f3ed7344f6cbd155b29f58a4f5d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+ bzipWith b39181fa2c8191904967f5c9a9668fe9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ bfoldMap ba02d28d2b8fc3ffd9509b200aa5e6f6\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie dad1ef832afa2c721a22049834cc9dd4\n+ exports: b3763818b9e315ec61a28b921995582d\n import -/ Data.Bifunctor 1d9d7c21b881329380908e0dfd716fa2\n import -/ Data.Bitraversable b3dde5b92e054012e0f42e345cd39579\n import -/ Data.Either 7c47cd251bd107db492912c22e18f784\n import -/ Data.Foldable 37d8b44e2b26697f0bf316460a82287c\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.ParserCombinators.ReadPrec a657147dbd7291808782bfe31b23cd99\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n-f1521ba707d23c999ae6ef3283ea07b0\n+14b2273bbe440df7be5388c73e211040\n $fApplicativeContainer ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n GHC.Base.Applicative (Container b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -101,15 +101,15 @@\n ($fApplicativeContainer3 @b v)\n `cast`\n (forall (a :: <*>_N) (b1 :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))\n ($fApplicativeContainer_$c<* @b v)]\n-a7c174a68359cb63f978b02978bbdcf6\n+a76f92d368c95a6640103a384e3329a7\n $fApplicativeContainer1 ::\n Data.Functor.Product.Product\n (Data.Functor.Const.Const (a1 -> b))\n (Data.Functor.Const.Const a1)\n a2\n -> Data.Functor.Const.Const b a2\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -123,28 +123,28 @@\n (Data.Functor.Const.Const a)\n a1) ->\n case ds4 of wild { Data.Functor.Product.Pair fa ga ->\n (fa `cast` (Data.Functor.Const.N:Const[0] <*>_N b>_R _P)\n ga `cast` (Data.Functor.Const.N:Const[0] <*>_N _R _P))\n `cast`\n (Sym (Data.Functor.Const.N:Const[0] <*>_N _R _P)) }]\n-387329215245f058139892ecedbc7266\n+e99c10be3fc67815f183934cd230e3b9\n $fApplicativeContainer2 ::\n Data.Functor.Const.Const a1 a2\n -> b -> Data.Functor.Const.Const a1 a2\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b\n @a\n @a1\n (ds4['GHC.Types.Many] :: Data.Functor.Const.Const a a1)\n (ds5['GHC.Types.Many] :: b) ->\n ds4]\n-6fecceae91020ec1d7838d76665822aa\n+d9e75c469cb1c8ee6ed7a7b1555736df\n $fApplicativeContainer3 ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b a -> Container b b1 -> b (Data.Functor.Const.Const b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -183,26 +183,26 @@\n `cast`\n (forall (a1 :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n <*>_N b1>_R _P))\n eta `cast` (N:Container[0] _R _N))\n eta1 `cast` (N:Container[0] _R _N))]\n-cc9d33e6519358099f64e8ab8a75f7c1\n+e4fcbbb1bb32d54452a8d7faa46edee1\n $fApplicativeContainer4 :: Data.Functor.Const.Const a1 a2 -> b -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n @a1\n (ds4['GHC.Types.Many] :: Data.Functor.Const.Const a a1)\n (eta['GHC.Types.Many] :: b) ->\n eta]\n-c17c094d07bb3ac90844984c5b88c30e\n+6844caea325b4ccc08e85cbbe30f17ea\n $fApplicativeContainer5 ::\n Data.Functor.Product.Product\n (Data.Functor.Const.Const (b -> b)) (Data.Functor.Const.Const b) a\n -> Data.Functor.Const.Const b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1C(1,L),L)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n@@ -213,15 +213,15 @@\n (Data.Functor.Const.Const b)\n a) ->\n case ds4 of wild { Data.Functor.Product.Pair fa ga ->\n (fa `cast` (Data.Functor.Const.N:Const[0] <*>_N b>_R _P)\n ga `cast` (Data.Functor.Const.N:Const[0] <*>_N _R _P))\n `cast`\n (Sym (Data.Functor.Const.N:Const[0] <*>_N _R _P)) }]\n-a65de0e1279b293ab2156326ef06d34d\n+14ca10cb44bd00a4b6f96b383b1b55a1\n $fApplicativeContainer6 ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b (a -> b1)\n -> Container b a -> b (Data.Functor.Const.Const b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -246,15 +246,15 @@\n @(*)\n @b\n $dApplicativeB\n @(Data.Functor.Const.Const (a -> b1))\n @(Data.Functor.Const.Const a)\n l `cast` (N:Container[0] _R b1>_N)\n r `cast` (N:Container[0] _R _N))]\n-389e1d5eda3010ae886d765de12fdb91\n+4a3984819deef987b8c5f3fe3e7db420\n $fApplicativeContainer_$c<* ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b a -> Container b b1 -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -302,15 +302,15 @@\n @(Data.Functor.Const.Const (b1 -> a))\n @(Data.Functor.Const.Const b1)\n l\n r `cast` (N:Container[0] _R _N)))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-6be5cba4b80fa62b4ebb3efe056f3530\n+e46fe3a471e3e50d0dce353a33bfba44\n $fApplicativeContainer_$cliftA2 ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n (a -> b1 -> c) -> Container b a -> Container b b1 -> Container b c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -358,15 +358,15 @@\n @(Data.Functor.Const.Const (b1 -> c))\n @(Data.Functor.Const.Const b1)\n l\n r `cast` (N:Container[0] _R _N)))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-124249bcd1341b35361b3898ddd264ff\n+b24638917d3676f8eadf66d82ae763be\n $fApplicativeContainer_$cp1Applicative ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n GHC.Base.Functor (Container b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -374,15 +374,15 @@\n b) ->\n $fFunctorContainer\n @b\n (Barbies.Internal.ApplicativeB.$p1ApplicativeB\n @(*)\n @b\n $dApplicativeB)]\n-face662fbd73f3f5cb45bfb045cb7c14\n+c2f815666f2ac75e178e16a874f60c20\n $fEqContainer ::\n GHC.Classes.Eq (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Eq (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -396,15 +396,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b (Data.Functor.Const.Const a)) v)\n `cast`\n (Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-91a44938a8b9fedf18957a36da41a3dc\n+849c3cfc506d76857ad293a0d4a6b7a9\n $fEqErrorContainer ::\n GHC.Classes.Eq (b (Data.Either.Either e)) =>\n GHC.Classes.Eq (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -417,15 +417,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b (Data.Either.Either e)) v)\n `cast`\n (Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-cd32c03fbf1cbe77cc06aaf617742e1c\n+d04d8e162cb5ff9e4d6d34dbe7f9e776\n $fFoldableContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Foldable.Foldable (Container b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -462,15 +462,15 @@\n ($fFoldableContainer1 @b v)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-14e89c249e14e817a7a9691e9a2938b0\n+290fc00d26828390ed2de9f054bd9739\n $fFoldableContainer1 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n Container b a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline:,\n Unfolding: Core: StableUser\n \\ @b :: (* -> *) -> *\n@@ -485,15 +485,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidProduct @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Product[0]\n _R))]\n-3360fa93a681300e40fa4aa3c1b9a98a\n+64b0cba4e41849c7bcf52f598c5af6d7\n $fFoldableContainer2 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n Container b a -> Data.Semigroup.Internal.Sum a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n Unfolding: Core: StableUser\n@@ -509,15 +509,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidSum @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Sum[0]\n _R))]\n-e6308b792c6ac14fdea65d3502371b73\n+cc7250dde145d5e7f60500dfceb32df2\n $fFoldableContainer3 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Classes.Eq a) =>\n a -> Container b a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -532,20 +532,20 @@\n @Data.Semigroup.Internal.Any\n @a\n Data.Semigroup.Internal.$fMonoidAny\n (GHC.Classes.== @a $dEq eta)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Any[0]))]\n-0dbc6fd43d53661259b8bd723f5444bd\n+14ba80e83c09ab1a7d2343ccd29b6558\n $fFoldableContainer4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-58c680db3ff6ab0e5586aeacf298dcc8\n+fdb14841dafd7c9b44e0d99a229e7fae\n $fFoldableContainer5 ::\n Data.Functor.Const.Const a1 a2\n -> Data.Semigroup.Internal.Endo (GHC.Types.Int -> GHC.Types.Int)\n -> (Data.Functor.Const.Const () a2,\n Data.Semigroup.Internal.Endo (GHC.Types.Int -> GHC.Types.Int))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1(1,),\n@@ -565,15 +565,15 @@\n GHC.Types.Int>_R)\n (\\ (v['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case v of z { GHC.Types.I# ipv ->\n x2 (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)))]\n-b3c1a0e5cb8b9215e0a149fee186c5a8\n+759b93f744ddba1dae3a9f7202182e4e\n $fFoldableContainer6 ::\n Data.Functor.Const.Const a1 a2\n -> Data.Semigroup.Internal.Endo GHC.Types.Bool\n -> (Data.Functor.Const.Const () a2,\n Data.Semigroup.Internal.Endo GHC.Types.Bool)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1(1,),\n@@ -590,23 +590,23 @@\n } in\n (GHC.Tuple.Prim.()\n `cast`\n (Sym (Data.Functor.Const.N:Const[0] <*>_N <()>_R _P)),\n (\\ (x1['GHC.Types.Many] :: GHC.Types.Bool) -> lvl13)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0] _R)))]\n-257044b12ed3ec8fa150a265cb24dfe2\n+7a1c9e2de9a8989016a293ab69a88cd7\n $fFoldableContainer7 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-3c269a53854792486ede28cf3330f357\n+0fa00362f9126b72727b7c0bcbd1b1c3\n $fFoldableContainer8 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-5d528d2886114633f3717b347ee37897\n+b8cfc43b21659762334c8693e2a86d24\n $fFoldableContainer_$cfold ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n Container b m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -619,15 +619,15 @@\n $fFoldableContainer_$cfoldMap\n @b\n $dTraversableB\n @m\n @m\n $dMonoid\n (GHC.Base.id @m)]\n-567337dadb269d0f96bbf5afcb68e5da\n+e185586296f6d9fdcb96f134c4af1aa5\n $fFoldableContainer_$cfoldMap ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> Container b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -670,15 +670,15 @@\n \\ (x['GHC.Types.Many] :: Container b a) ->\n case (g x `cast` (N:Container[0] _R _N))\n `cast`\n (Barbies.Internal.Writer.N:St[0]\n _R _R)\n lvl13 of wild { (,) a1 s' ->\n s' }]\n-3378f4980cea688d396db618335463d6\n+5887d10e0a3d133124ec437301fb5530\n $fFoldableContainer_$cfoldMap' ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> Container b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -735,15 +735,15 @@\n (GHC.Base.id @(m -> m))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n m>_R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m)\n (GHC.Base.mempty @m $dMonoid) }]\n-1821bc30db02c949c8e8a5c784513726\n+ce9223fe776a951da125cc0258ab64d2\n $fFoldableContainer_$cfoldl ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> Container b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -799,15 +799,15 @@\n (Sym (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1 }]\n-b9fddb4b67b3817f050631a243bb642c\n+d729ca7b4d6dd89cb88b9acd48c8e44c\n $fFoldableContainer_$cfoldl' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> Container b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -860,15 +860,15 @@\n (GHC.Base.id @(b1 -> b1))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n b1>_R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] b1>_R)\n (GHC.Base.id @b1)\n eta1 }]\n-47ccbc437dd7a8ae8d1a027f092ded3e\n+c9b3f783635252d592e0ac1f3b2991df\n $fFoldableContainer_$cfoldl1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> Container b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -935,15 +935,15 @@\n case s'\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n (GHC.Maybe.Nothing @a) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableContainer7 @a\n GHC.Maybe.Just v -> v } }]\n-6b396ee00a90bda7fd69f50993d333ff\n+94dd6c47c343c5628ff631c7123f78f5\n $fFoldableContainer_$cfoldr ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> Container b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -990,15 +990,15 @@\n _R\n _R)\n (GHC.Base.id @b1)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n _R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] _R) z }]\n-7587d1352988d239aa80928dbbe85c92\n+540ee454ea7ca76ba12f057173cd1513\n $fFoldableContainer_$cfoldr' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> Container b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1062,15 +1062,15 @@\n b1>_R))) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] b1>_R))\n (GHC.Base.id @b1)\n z0 }]\n-817171165f15c65c278755f097b21407\n+61aede4dd74b85f623da1e7427a034a4\n $fFoldableContainer_$cfoldr1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> Container b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1128,15 +1128,15 @@\n _R)) of wild { (,) a1 s' ->\n case s'\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableContainer8 @a\n GHC.Maybe.Just v -> v } }]\n-b17cc1575472cfb1214bd2409304e6c4\n+b46bbf17d19f228fef33dd6cd2360622\n $fFoldableContainer_$clength ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1173,15 +1173,15 @@\n GHC.Types.Int>_R)) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int)\n $fFoldableContainer4 }]\n-e7cd61559cfe1386a88aa3f01c615ced\n+8f65b5a67074abef1c16d92bf65e1ea2\n $fFoldableContainer_$cmaximum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n Container b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -1220,15 +1220,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Max[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Max[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-aad561785b69e1adf949f2d8e08b6771\n+a14d45ab25ecdac360194aa84370cf4e\n $fFoldableContainer_$cminimum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n Container b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -1267,15 +1267,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Min[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Min[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-24d0888632b1c650506d791f86618c03\n+507d27d27e52a332c9955ebe4ce779f4\n $fFoldableContainer_$cnull ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1308,15 +1308,15 @@\n _R)\n (GHC.Base.id @GHC.Types.Bool)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n _R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True }]\n-9adf15a38fb152bf5f306926339d5c5e\n+98c3cf0b7dccc3d3225fc14e78a32671\n $fFoldableContainer_$ctoList ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @b :: (* -> *) -> *\n@@ -1326,15 +1326,15 @@\n (eta['GHC.Types.Many] :: Container b a) ->\n GHC.Base.build\n @a\n (\\ @b1\n (c['GHC.Types.Many] :: a -> b1 -> b1)[OneShot]\n (n['GHC.Types.Many] :: b1)[OneShot] ->\n $fFoldableContainer_$cfoldr @b $dTraversableB @a @b1 c n eta)]\n-fcfb0f17d73dde305179c66eb8e6ac09\n+f96cd5834669d7e91e813254c05c0d2a\n $fFoldableErrorContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Foldable.Foldable (ErrorContainer b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -1371,15 +1371,15 @@\n ($fFoldableErrorContainer1 @b v)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-8a5f47ad00b9d94770edad9d87e81b37\n+04e736d69d115cafd755727dfcc8f36b\n $fFoldableErrorContainer1 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n ErrorContainer b a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline:,\n Unfolding: Core: StableUser\n \\ @b :: (* -> *) -> *\n@@ -1394,15 +1394,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidProduct @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Product[0]\n _R))]\n-c3ff2e36300e5cfb3d4490957c4db350\n+94bb29b7846361ee26cb69025ee5dfa0\n $fFoldableErrorContainer2 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n ErrorContainer b a -> Data.Semigroup.Internal.Sum a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n Unfolding: Core: StableUser\n@@ -1418,15 +1418,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidSum @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Sum[0]\n _R))]\n-53442540770cd1b113d5581e3a72a9a9\n+b54f73c62e0831f7692cdba0323c477e\n $fFoldableErrorContainer3 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Classes.Eq a) =>\n a -> ErrorContainer b a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1441,15 +1441,15 @@\n @Data.Semigroup.Internal.Any\n @a\n Data.Semigroup.Internal.$fMonoidAny\n (GHC.Classes.== @a $dEq eta)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Any[0]))]\n-a08221cd2e8b4f6e1b2c98575fadf49f\n+a412c0e764397f8fff0275e1bcf6de67\n $fFoldableErrorContainer4 ::\n Data.Either.Either a1 a2\n -> Data.Semigroup.Internal.Endo (GHC.Types.Int -> GHC.Types.Int)\n -> (Data.Functor.Const.Const () a2,\n Data.Semigroup.Internal.Endo (GHC.Types.Int -> GHC.Types.Int))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1(1,),\n@@ -1472,15 +1472,15 @@\n -> \\ (v['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case v of z { GHC.Types.I# ipv ->\n x2 (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }\n Data.Either.Right y -> x2 }))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)))]\n-a31237743468318d9f410524594559b3\n+44927f65d2949dd278aff7f3afa82b00\n $fFoldableErrorContainer5 ::\n Data.Either.Either a1 a2\n -> Data.Semigroup.Internal.Endo GHC.Types.Bool\n -> (Data.Functor.Const.Const () a2,\n Data.Semigroup.Internal.Endo GHC.Types.Bool)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1(1,),\n@@ -1496,15 +1496,15 @@\n (\\ (x1['GHC.Types.Many] :: GHC.Types.Bool) ->\n eta `cast` (Data.Semigroup.Internal.N:Endo[0] _R)\n (case x of wild {\n Data.Either.Left x2 -> GHC.Types.False\n Data.Either.Right y -> x1 }))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0] _R)))]\n-cc22329d022e4bd8bba8fa8fc7043a90\n+7e041dcd924d260c2ac7014b74263773\n $fFoldableErrorContainer_$cfold ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n ErrorContainer b m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1517,15 +1517,15 @@\n $fFoldableErrorContainer_$cfoldMap\n @b\n $dTraversableB\n @m\n @m\n $dMonoid\n (GHC.Base.id @m)]\n-f36eb1e32ba1e0d788abe79eec01d0ff\n+f7c249a2afe8f64ab642db3d7c965484\n $fFoldableErrorContainer_$cfoldMap ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> ErrorContainer b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1572,15 +1572,15 @@\n \\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n case (g x `cast` (N:ErrorContainer[0] _R _N))\n `cast`\n (Barbies.Internal.Writer.N:St[0]\n _R _R)\n lvl13 of wild { (,) a1 s' ->\n s' }]\n-475abe9ff1548da2dcbe797572bb6a85\n+ef0c26ef930027c02ec440af37df92bf\n $fFoldableErrorContainer_$cfoldMap' ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> ErrorContainer b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -1636,15 +1636,15 @@\n (GHC.Base.id @(m -> m))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n m>_R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m)\n (GHC.Base.mempty @m $dMonoid) }]\n-ad99584fef301b9a25611c4c993539bf\n+92cfe5c89a2db74f2704b593e0fca83c\n $fFoldableErrorContainer_$cfoldl ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> ErrorContainer b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1708,15 +1708,15 @@\n (Sym (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1 }]\n-25469f9f8c5f1db463384173cd885864\n+611f427387f37d058d473af691a412ce\n $fFoldableErrorContainer_$cfoldl' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> ErrorContainer b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -1768,15 +1768,15 @@\n (GHC.Base.id @(b1 -> b1))\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n b1>_R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] b1>_R)\n (GHC.Base.id @b1)\n eta1 }]\n-1110effe739c295507bb35a164df27da\n+51e8a9c0bcdc42e742bcce21271e038e\n $fFoldableErrorContainer_$cfoldl1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1796,15 +1796,15 @@\n @a\n (case m of wild {\n GHC.Maybe.Nothing -> y GHC.Maybe.Just x -> f x y }))\n (GHC.Maybe.Nothing @a)\n xs of wild {\n GHC.Maybe.Nothing -> $fFoldableContainer7 @a\n GHC.Maybe.Just v -> v }]\n-67a651c4a204001c045801ec06c60cfa\n+100cd5d76d33ee5c759134bca3f1a9f5\n $fFoldableErrorContainer_$cfoldr ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> ErrorContainer b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1857,15 +1857,15 @@\n _R\n _R)\n (GHC.Base.id @b1)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n _R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] _R) z }]\n-6c58945ed348ffd20fcbd4377acc7e96\n+81dc2c773f06c26d10249f6073bae92d\n $fFoldableErrorContainer_$cfoldr' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> ErrorContainer b a -> b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1884,15 +1884,15 @@\n (\\ (ds4['GHC.Types.Many] :: b1 -> b1)\n (ds5['GHC.Types.Many] :: a)[OneShot]\n (v['GHC.Types.Many] :: b1)[OneShot] ->\n case v of z { DEFAULT -> ds4 (f ds5 z) })\n (GHC.Base.id @b1)\n xs\n z0]\n-02d0a9f3b218bd1c3d786901c662d9bf\n+f9321abcf9ad9578009c2be81f403c7a\n $fFoldableErrorContainer_$cfoldr1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1949,15 +1949,15 @@\n _R)) of wild { (,) a1 s' ->\n case s'\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableContainer8 @a\n GHC.Maybe.Just v -> v } }]\n-a90a20c85d6623cb9d18818274570906\n+78879c78f14234f1e84f729135034bd6\n $fFoldableErrorContainer_$clength ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1994,15 +1994,15 @@\n GHC.Types.Int>_R)) of wild { (,) a1 s' ->\n s'\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int)\n $fFoldableContainer4 }]\n-88a2501a4af497db875b72b72faf218a\n+0fa2a937a146bda236c2145f3d460889\n $fFoldableErrorContainer_$cmaximum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -2041,15 +2041,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Max[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Max[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-6a75c3135d1c4eb4713616c7b418cb4d\n+4f5bd35dc75ac8096e257788016da261\n $fFoldableErrorContainer_$cminimum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -2088,15 +2088,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Min[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Min[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-6a9a1bc6945d23f3ff8c81e182cf43ed\n+4fee7ba8968ba2c6c38305d0abaa54c2\n $fFoldableErrorContainer_$cnull ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2129,15 +2129,15 @@\n _R)\n (GHC.Base.id @GHC.Types.Bool)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Endo[0]\n _R)) of wild { (,) a1 s' ->\n s' `cast` (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True }]\n-5eea33282ede5893e974ce90e0e7c9ad\n+ad582f8b268075f56ccbb9c9bf61a00a\n $fFoldableErrorContainer_$ctoList ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @b :: (* -> *) -> *\n@@ -2147,27 +2147,27 @@\n (eta['GHC.Types.Many] :: ErrorContainer b a) ->\n GHC.Base.build\n @a\n (\\ @b1\n (c['GHC.Types.Many] :: a -> b1 -> b1)[OneShot]\n (n['GHC.Types.Many] :: b1)[OneShot] ->\n $fFoldableErrorContainer_$cfoldr @b $dTraversableB @a @b1 c n eta)]\n-494ab54fbced0f2b78a250819f348eb5\n+e32dbed27d7e55bc29729d9cb4a5fe0a\n $fFunctorContainer ::\n Barbies.Internal.FunctorB.FunctorB b =>\n GHC.Base.Functor (Container b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n (v['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @(Container b)\n ($fFunctorContainer_$cfmap @b v)\n ($fFunctorContainer_$c<$ @b v)]\n-59c89a2e7c490c173d0d5ac7734c9e31\n+b7fb359de7f77f7f5dfc2d1ddb7a715b\n $fFunctorContainer_$c<$ ::\n Barbies.Internal.FunctorB.FunctorB b =>\n a -> Container b b1 -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2194,15 +2194,15 @@\n <*>_N _R _P))\n } in\n (\\ (x['GHC.Types.Many] :: Container b b1) ->\n f x `cast` (N:Container[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-f9a7143b271f4d0ff61b93ae43166565\n+6a8a5c6fd456871c3127876333d11985\n $fFunctorContainer_$cfmap ::\n Barbies.Internal.FunctorB.FunctorB b =>\n (a -> b1) -> Container b a -> Container b b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2229,27 +2229,27 @@\n <*>_N _R _P))\n } in\n (\\ (x['GHC.Types.Many] :: Container b a) ->\n f1 x `cast` (N:Container[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-873063d8addd502ef5bd84ccd028449a\n+0e6956d8c3a846568dd3da22fd69e36b\n $fFunctorErrorContainer ::\n Barbies.Internal.FunctorB.FunctorB b =>\n GHC.Base.Functor (ErrorContainer b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n (v['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @(ErrorContainer b)\n ($fFunctorErrorContainer_$cfmap @b v)\n ($fFunctorErrorContainer_$c<$ @b v)]\n-bc3dbcfa4a5f66e688d60bea5b5526c0\n+0cad49bee17eb24ed5d301f348ce0e56\n $fFunctorErrorContainer_$c<$ ::\n Barbies.Internal.FunctorB.FunctorB b =>\n a -> ErrorContainer b b1 -> ErrorContainer b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2275,15 +2275,15 @@\n Data.Either.Right b2 -> Data.Either.Right @a @a1 b2 })\n } in\n (\\ (x['GHC.Types.Many] :: ErrorContainer b b1) ->\n f x `cast` (N:ErrorContainer[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-ab63ae5a52a50592dd552773b6dd53cf\n+900a60bfa635e2145f8c65c30c42a714\n $fFunctorErrorContainer_$cfmap ::\n Barbies.Internal.FunctorB.FunctorB b =>\n (a -> b1) -> ErrorContainer b a -> ErrorContainer b b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2302,24 +2302,24 @@\n (\\ @a1 -> Data.Bifunctor.$fBifunctorEither_$cfirst @a @b1 @a1 f)\n } in\n (\\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n f1 x `cast` (N:ErrorContainer[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-ac6b9eade85d1222c468768d4b9e3483\n+457dc692befc34cc9c22a47d316ebd9b\n $fGenericContainer :: GHC.Generics.Generic (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> * @a.\n @(Container b a)\n ($fGenericContainer_$cfrom @b @a)\n ($fGenericContainer_$cto @b @a)]\n-93beb333d7a035421f35d851a5d0c0b5\n+adadc5aa38df00f4ca80412aca1b6d1e\n $fGenericContainer_$cfrom ::\n Container b a -> GHC.Generics.Rep (Container b a) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @a\n@@ -2365,15 +2365,15 @@\n (b (Data.Functor.Const.Const a)))>_R)\n ; Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R)\n ; Sub (Sym (Rep_Container[0] _N _N))) _N)]\n-c1a86174e5938d2fd736a0980067d9c3\n+cc98078819e3af99ecb936d0cad12737\n $fGenericContainer_$cto ::\n GHC.Generics.Rep (Container b a) x -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @a\n@@ -2406,15 +2406,15 @@\n %<'GHC.Types.Many>_N ->_R (Sub (Rep_Container[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R) _N\n ; GHC.Generics.N:K1[0]\n <*>_N\n _P\n _R\n _P\n ; Sym (N:Container[0] _R _N))]\n-69335c5173bf30cd48c624dff0d2d52b\n+d8d7fc8fa52a801bd84ab5eb3489b954\n $fGenericErrorContainer ::\n GHC.Generics.Generic (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> * @e.\n @(ErrorContainer b e)\n ($fGenericErrorContainer_$cfrom @b @e)\n ($fGenericErrorContainer_$cto @b @e)]\n-0d07567e2e9747645e376b3f69ab2e00\n+88a4509095fc56deef9c028ff4c64c4c\n $fGenericErrorContainer_$cfrom ::\n ErrorContainer b e -> GHC.Generics.Rep (ErrorContainer b e) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @e\n@@ -2522,15 +2522,15 @@\n (b (Data.Either.Either e)))>_R)\n ; Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R)\n ; Sub (Sym (Rep_ErrorContainer[0] _N _N))) _N)]\n-2ee1dad584f7843b76fd4d5904ddebaa\n+b465749f80a1d5966b163ca8c553b4c9\n $fGenericErrorContainer_$cto ::\n GHC.Generics.Rep (ErrorContainer b e) x -> ErrorContainer b e\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @e\n@@ -2564,15 +2564,15 @@\n %<'GHC.Types.Many>_N ->_R (Sub (Rep_ErrorContainer[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R) _N\n ; GHC.Generics.N:K1[0]\n <*>_N\n _P\n _R\n _P\n ; Sym (N:ErrorContainer[0] _R _N))]\n-5a2a3e908acbe8a51cff6e4a30744731\n+0e037282bec8d9a418b42932a016f8ed\n $fOrdContainer ::\n GHC.Classes.Ord (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Ord (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -2664,30 +2664,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))\n (GHC.Classes.min @(b (Data.Functor.Const.Const a)) v)\n `cast`\n (Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-00ff98d57dec767c6da6bc8871fc752d\n+b8049c2218a13532180d96a3d0be70f2\n $fOrdContainer_$cp1Ord ::\n GHC.Classes.Ord (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Eq (Container b a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord\n (b (Data.Functor.Const.Const a))) ->\n $fEqContainer\n @b\n @a\n (GHC.Classes.$p1Ord @(b (Data.Functor.Const.Const a)) $dOrd)]\n-49da7a95413161421e34331769d714d3\n+b9ed16714a9ad90ed570d20e808797b5\n $fOrdErrorContainer ::\n GHC.Classes.Ord (b (Data.Either.Either e)) =>\n GHC.Classes.Ord (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -2727,30 +2727,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))\n (GHC.Classes.min @(b (Data.Either.Either e)) v)\n `cast`\n (Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-92a17c3b822834c2ec7e475fe8e7f91b\n+0d9eaedc46182ab4abb636a1577e5eb9\n $fOrdErrorContainer_$cp1Ord ::\n GHC.Classes.Ord (b (Data.Either.Either e)) =>\n GHC.Classes.Eq (ErrorContainer b e)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @e\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord\n (b (Data.Either.Either e))) ->\n $fEqErrorContainer\n @b\n @e\n (GHC.Classes.$p1Ord @(b (Data.Either.Either e)) $dOrd)]\n-db0af78df81976e333d9eaa59c77ffee\n+0068e288fd897465b6b9d5601697127f\n $fReadContainer ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n GHC.Read.Read (Container b a)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -2764,24 +2764,24 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadContainer_$creadListPrec @b @a v)]\n-ef78bd01547cc7b5ee2910a4488384c1\n+4345b2755a339aec68116a8ab2aff364\n $fReadContainer1 ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (Container b a -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-df0218c6e6ad5f276575bedd6160ee39\n+40469492a8f5296858e2a77e40affb5b\n $fReadContainer_$creadList ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadP.ReadS [Container b a]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2803,15 +2803,15 @@\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Container b a]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Container b a]>_R)\n @[Container b a]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[Container b a]))]\n-8643c3bb71515ac7751a9f0f0aa1f177\n+0fb6ac60627730640b6ebe03db83753b\n $fReadContainer_$creadListPrec ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [Container b a]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2823,15 +2823,15 @@\n ($fReadContainer1 @b @a $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-9affd6677bf5df942ca1b8f25421ebb5\n+f0c318725e2dcc64ef23200630bc7b46\n $fReadContainer_$creadsPrec ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Container b a)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2845,15 +2845,15 @@\n @b\n @a\n $dRead\n eta\n @(Container b a)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Container b a)))]\n-3d4fde39924202caf4f0f57a7ee5c462\n+52007fcee6e788c99b8da1a0e1d5030d\n $fReadErrorContainer ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n GHC.Read.Read (ErrorContainer b e)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -2866,24 +2866,24 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadErrorContainer_$creadListPrec @b @e v)]\n-990748b23bb7394c1b65ea2f1bc7adf4\n+fd12aac599758a02c74df94d54b0fcd7\n $fReadErrorContainer1 ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (ErrorContainer b e -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-a8596f7b29f858545cd9460b853d0bbc\n+7988717326fbd29e9e713cf3ba479a11\n $fReadErrorContainer_$creadList ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadP.ReadS [ErrorContainer b e]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2906,15 +2906,15 @@\n <[ErrorContainer b e]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[ErrorContainer b e]>_R)\n @[ErrorContainer b e]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[ErrorContainer b e]))]\n-ab91a02e7b273a2352ea77e7f09e746e\n+eb273780f17f45b829974ef62c1e12fa\n $fReadErrorContainer_$creadListPrec ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [ErrorContainer b e]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2926,15 +2926,15 @@\n ($fReadErrorContainer1 @b @e $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-98ea362a6b273913470e43b2d4d7b861\n+22628b7740c3fc9d6b276dc01d6a7151\n $fReadErrorContainer_$creadsPrec ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n GHC.Types.Int\n -> Text.ParserCombinators.ReadP.ReadS (ErrorContainer b e)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -2949,43 +2949,43 @@\n @b\n @e\n $dRead\n eta\n @(ErrorContainer b e)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(ErrorContainer b e)))]\n-35152f0df2d5d82a57076163c4dd0fe7\n+ade227fc727df690e1538dbe2808c3b5\n $fShowContainer ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Show.Show (Container b a)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n @a\n (v['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Functor.Const.Const a))).\n @(Container b a)\n ($fShowContainer_$cshowsPrec @b @a v)\n ($fShowContainer_$cshow @b @a v)\n ($fShowContainer_$cshowList @b @a v)]\n-2032aae23242b337cc50e1b17b1feacf\n+03befb5b9697a23286491c2a5171cbd9\n $fShowContainer1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"}\"#]\n-a89d6e760355821b353d4df175a57a12\n+c850f02564295824a48796c89dee2ea2\n $fShowContainer2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Container {getContainer = \"#]\n-6ff10b3963dcdb901d12e6b5c9d29aa8\n+e4e44f10c1aaee38bc61867f50694ae8\n $fShowContainer3 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fShowContainer1]\n-a25e8e53a996e513869b910c2ba8734b\n+5dd2fa056bcfaa5b133c1605a5ad2f21\n $fShowContainer_$cshow ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n Container b a -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2997,15 +2997,15 @@\n $fShowContainer2\n (GHC.Show.showsPrec\n @(b (Data.Functor.Const.Const a))\n $dShow\n $fFoldableContainer4\n x `cast` (N:Container[0] _R _N)\n $fShowContainer3)]\n-e75664c12692f4f3f6c99b81a95aa3ee\n+25412af001e2ef2b57ba7e92f557c5f4\n $fShowContainer_$cshowList ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n [Container b a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3016,48 +3016,48 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Container b a)\n (\\ (ds4['GHC.Types.Many] :: Container b a) ->\n $w$cshowsPrec @b @a $dShow 0# ds4)\n ls\n s]\n-6e360dffa68007a714f6a72f51a6bb12\n+560134fc1070e45977c2c264ab4e95fc\n $fShowContainer_$cshowsPrec ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Types.Int -> Container b a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @b :: (* -> *) -> *\n @a\n ($dShow['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Functor.Const.Const a)))\n (a1['GHC.Types.Many] :: GHC.Types.Int)\n (ds4['GHC.Types.Many] :: Container b a) ->\n case a1 of wild { GHC.Types.I# ww ->\n $w$cshowsPrec @b @a $dShow ww ds4 }]\n-08ee8c81177cbe6f345924213ab5a963\n+6d432f9ea95bc97f83c3b2968044262a\n $fShowErrorContainer ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Show.Show (ErrorContainer b e)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n @e\n (v['GHC.Types.Many] :: GHC.Show.Show (b (Data.Either.Either e))).\n @(ErrorContainer b e)\n ($fShowErrorContainer_$cshowsPrec @b @e v)\n ($fShowErrorContainer_$cshow @b @e v)\n ($fShowErrorContainer_$cshowList @b @e v)]\n-16102b630752639031beab1ef48a2707\n+881e4b184d8e375806420561b18935ec\n $fShowErrorContainer1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ErrorContainer {getErrorContainer = \"#]\n-21f77e4928eb73c7c6dd154e17e65fe9\n+d59a52f9de999e06bd0ffa9c08fceff0\n $fShowErrorContainer_$cshow ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n ErrorContainer b e -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3069,15 +3069,15 @@\n $fShowErrorContainer1\n (GHC.Show.showsPrec\n @(b (Data.Either.Either e))\n $dShow\n $fFoldableContainer4\n x `cast` (N:ErrorContainer[0] _R _N)\n $fShowContainer3)]\n-099d5da952e71ba8aeef1eeb7db18c47\n+cd434b301e83af01be2f21304a6f7b5f\n $fShowErrorContainer_$cshowList ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n [ErrorContainer b e] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3088,30 +3088,30 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(ErrorContainer b e)\n (\\ (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n $w$cshowsPrec1 @b @e $dShow 0# ds4)\n ls\n s]\n-1bb4cc25e5dc03820fe1a018b503df9a\n+56b887e594f1b87abbddb510d8a51ee6\n $fShowErrorContainer_$cshowsPrec ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Types.Int -> ErrorContainer b e -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @b :: (* -> *) -> *\n @e\n ($dShow['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Either.Either e)))\n (a['GHC.Types.Many] :: GHC.Types.Int)\n (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n case a of wild { GHC.Types.I# ww ->\n $w$cshowsPrec1 @b @e $dShow ww ds4 }]\n-6bb0f8c1c53c13e274a57f3102dc0ac5\n+73837b84f1fb46f81ba4662368127507\n $fTraversableContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Traversable.Traversable (Container b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -3120,26 +3120,26 @@\n @(Container b)\n ($fTraversableContainer_$cp1Traversable @b v)\n ($fFoldableContainer @b v)\n ($fTraversableContainer_$ctraverse @b v)\n ($fTraversableContainer_$csequenceA @b v)\n ($fTraversableContainer_$cmapM @b v)\n ($fTraversableContainer_$csequence @b v)]\n-717ba1b82fcfe1e0c97a92c767b59de3\n+837ba216895480238e161d3a301e074b\n $fTraversableContainer1 ::\n b2 (Data.Functor.Const.Const b1)\n -> b2 (Data.Functor.Const.Const b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b\n @b1 :: (* -> *) -> *\n (ds4['GHC.Types.Many] :: b1 (Data.Functor.Const.Const b)) ->\n ds4]\n-42abcdddf4825d600e3502a1bed6dd7a\n+f0208649078da9e21cdcf539e9670c4d\n $fTraversableContainer_$cmapM ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n (a -> m b1) -> Container b a -> m (Container b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3155,15 +3155,15 @@\n @b\n $dTraversableB\n @m\n @a\n @b1\n (GHC.Base.$p1Monad @m $dMonad)\n eta]\n-2e5b3bb3e74c68ec66a4420b2cd5c095\n+744759738c119367a6afe88f1c0a8ebb\n $fTraversableContainer_$cp1Traversable ::\n Barbies.Internal.TraversableB.TraversableB b =>\n GHC.Base.Functor (Container b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3171,15 +3171,15 @@\n b) ->\n $fFunctorContainer\n @b\n (Barbies.Internal.TraversableB.$p1TraversableB\n @(*)\n @b\n $dTraversableB)]\n-ec9057d923c08494130ff4d6e1dbdadf\n+2ca64160b41df131786c3e493074e725\n $fTraversableContainer_$csequence ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n Container b (m a) -> m (Container b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3193,15 +3193,15 @@\n @b\n $dTraversableB\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))]\n-2cec6a9c57483ead8b5a2eb700ed84da\n+3df7a50add3e7a772a203c9ded53ae68\n $fTraversableContainer_$csequenceA ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n Container b (f a) -> f (Container b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3215,15 +3215,15 @@\n @b\n $dTraversableB\n @f\n @(f a)\n @a\n $dApplicative\n (GHC.Base.id @(f a))]\n-780953e2e75c78454e9c8f26f2b1f91e\n+730f55ee01b7643a62ef22e57b5ff283\n $fTraversableContainer_$ctraverse ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n (a -> f b1) -> Container b a -> f (Container b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -3275,15 +3275,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n <*>_N _R _P))\n (eta\n eta2 `cast` (Data.Functor.Const.N:Const[0] <*>_N _R _P)))\n } in\n \\ (x['GHC.Types.Many] :: Container b a) ->\n f1 (f2 x `cast` (N:Container[0] _R _N))]\n-bfe6aa97dee723ebd50b2dd8d371690f\n+4e2bcb96049402fe25c32b37260d4713\n $fTraversableErrorContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Traversable.Traversable (ErrorContainer b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -3292,25 +3292,25 @@\n @(ErrorContainer b)\n ($fTraversableErrorContainer_$cp1Traversable @b v)\n ($fFoldableErrorContainer @b v)\n ($fTraversableErrorContainer_$ctraverse @b v)\n ($fTraversableErrorContainer_$csequenceA @b v)\n ($fTraversableErrorContainer_$cmapM @b v)\n ($fTraversableErrorContainer_$csequence @b v)]\n-9dd937c4276fd52efaae83faed4c19d7\n+e0c0c1ffb4dc112e786e53bc01947ff1\n $fTraversableErrorContainer1 ::\n b2 (Data.Either.Either b1) -> b2 (Data.Either.Either b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b\n @b1 :: (* -> *) -> *\n (ds4['GHC.Types.Many] :: b1 (Data.Either.Either b)) ->\n ds4]\n-eea9530d9a3645586f691cfb48a284a5\n+b58c37cd2cc1895def18d4154706641c\n $fTraversableErrorContainer_$cmapM ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n (a -> m b1) -> ErrorContainer b a -> m (ErrorContainer b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3326,15 +3326,15 @@\n @b\n $dTraversableB\n @m\n @a\n @b1\n (GHC.Base.$p1Monad @m $dMonad)\n eta]\n-e9c44e5deb971a28925e3efe3d33f917\n+551db0a2038729ec7a24d447b906afac\n $fTraversableErrorContainer_$cp1Traversable ::\n Barbies.Internal.TraversableB.TraversableB b =>\n GHC.Base.Functor (ErrorContainer b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3342,15 +3342,15 @@\n b) ->\n $fFunctorErrorContainer\n @b\n (Barbies.Internal.TraversableB.$p1TraversableB\n @(*)\n @b\n $dTraversableB)]\n-f6f6f17afb54cb1a03a87ea71b26c540\n+0d4420b06c3567d8815d1007c62a8643\n $fTraversableErrorContainer_$csequence ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n ErrorContainer b (m a) -> m (ErrorContainer b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3364,15 +3364,15 @@\n @b\n $dTraversableB\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))]\n-01270b5a02e8c1da7037148494d4cf3a\n+521530da486f57bf6704a40b99e82159\n $fTraversableErrorContainer_$csequenceA ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n ErrorContainer b (f a) -> f (ErrorContainer b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3386,15 +3386,15 @@\n @b\n $dTraversableB\n @f\n @(f a)\n @a\n $dApplicative\n (GHC.Base.id @(f a))]\n-a96643b33e9f451c9f4174237e94a843\n+1357700a8ff3423d68bc3b8eec7cd97d\n $fTraversableErrorContainer_$ctraverse ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n (a -> f b1) -> ErrorContainer b a -> f (ErrorContainer b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -3437,135 +3437,135 @@\n @a1\n $dApplicative\n eta\n (GHC.Base.pure @f $dApplicative @a1))\n } in\n \\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n f1 (f2 x `cast` (N:ErrorContainer[0] _R _N))]\n-a7d553536c19c8c89437903e6bd41713\n+abec5944924ceeb57d9923f76fd90c13\n $tc'Container :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11674959523014724987#Word64\n- 1860771261668301389#Word64\n+ 16354380718495274812#Word64\n+ 814762301798279210#Word64\n $trModule\n $tc'Container2\n 2#\n $tc'Container1]\n-9ea44b098e6735e5f7def144b34045a9\n+3c6719a3cf1c52d92e087047398e21be\n $tc'Container1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ea9b4253927541a2a95f536bcd12d2b9\n+fc2245575b86aeb3426f9a72dc8c0aff\n $tc'Container2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Container3]\n-94cafa23f2389006462d81d5243e5efa\n+e1c0c7493448cabfc6716ffbda7ce454\n $tc'Container3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Container\"#]\n-554f83925b1f0cdb8ec4d9b74879c5f6\n+01583243b60b3294363d61968d75ad77\n $tc'ErrorContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14855527359701066264#Word64\n- 17109921949346698154#Word64\n+ 707883891224460668#Word64\n+ 7429744106433036516#Word64\n $trModule\n $tc'ErrorContainer2\n 2#\n $tc'ErrorContainer1]\n-1dbfd41f241749be3656423a638557d9\n+b853587716ed860d725b3bc6c39f31e8\n $tc'ErrorContainer1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c1ffa79a9d019db2566092db116fe8cc\n+74bce785af8baf27733fcf4ed4f7bbdc\n $tc'ErrorContainer2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'ErrorContainer3]\n-6095c312432d793e73b37f611b60650e\n+abcd0757ecc44467e35f9d8eaef8eb66\n $tc'ErrorContainer3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'ErrorContainer\"#]\n-94fed29885847ef0e8db48cd49dc25a0\n+e09e42f324addfbda1003c3359d5a2b4\n $tcContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4808676420053827782#Word64\n- 2573184056300013498#Word64\n+ 16357764481247289159#Word64\n+ 11149079116675027957#Word64\n $trModule\n $tcContainer2\n 0#\n $tcContainer1]\n-97a60ed0132472130ac0c191ddfac945\n+6a72172f960f21f1de6a74a4767ccc7a\n $tcContainer1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-652be147eddd34492440c8b9a79bb950\n+034588f16509fb7a7c4f1146ef49eff4\n $tcContainer2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcContainer3]\n-e68bb986b4d2c6850bb15b031a213f04\n+0a6f875d485561491827b0d328a0ca61\n $tcContainer3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Container\"#]\n-e8b95d37184a31288262949263b000ce\n+daec6c3178b5fe2342deb374d72036c8\n $tcErrorContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7004789969558376778#Word64\n- 695522309174708933#Word64\n+ 15701051175288362856#Word64\n+ 16272261420726116207#Word64\n $trModule\n $tcErrorContainer1\n 0#\n $tcContainer1]\n-60311b871bc548b72437eb38fe5aa060\n+afc841f19721252bbfcd0f18d88ec835\n $tcErrorContainer1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcErrorContainer2]\n-44c534df5ccce9c80e19e400dd76466b\n+e387b02bd167a24bab0346af84442d27\n $tcErrorContainer2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ErrorContainer\"#]\n-4e00e18ce73373e0fcc2dc56135038df\n+1182cf7050b799e976f9dcb8fa02b959\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-674ceeaf6454993e22fec7da0006201a\n+b1cf3f1c71f6bbcbed080db8b8d9de1e\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4ff5bda54562710e91dd770a4edc3c83\n+cf034d5cfda3799422a5109b8634ac67\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Containers\"#]\n-f97c70b4c314717c6b1d2536b501d69f\n+a38c26ea0e242de50c46b585f8dad278\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9218a400d5799b5b1f6d3be130b52061\n+c4d162abc812c8123fff7855238d1a44\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-97a0fcabb7b5d020208f22ac4e754961\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+9a9e898656c36aa72ce605eb91d4e73b\n $w$cshowsPrec ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Prim.Int# -> Container b a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3594,15 +3594,15 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowContainer2\n (f (GHC.CString.unpackAppendCString#\n $fShowContainer1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-a6c9bd976b0c27593eb91995111679f1\n+92f47c5037fafa4a91506cb170191f21\n $w$cshowsPrec1 ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Prim.Int# -> ErrorContainer b e -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3631,92 +3631,92 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowErrorContainer1\n (f (GHC.CString.unpackAppendCString#\n $fShowContainer1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-96fdbd34013fa7b5e5f91f10c714c710\n+534844d3507a10fcf955a68452d4b169\n type role Container representational nominal\n type Container :: ((* -> *) -> *) -> * -> *\n newtype Container b a\n = Container {getContainer :: b (Data.Functor.Const.Const a)}\n-457c825d58d97b32f5e406f92b956382\n+a147e86314e63aaf4535eb2ec803ac69\n type role ErrorContainer representational nominal\n type ErrorContainer :: ((* -> *) -> *) -> * -> *\n newtype ErrorContainer b e\n = ErrorContainer {getErrorContainer :: b (Data.Either.Either e)}\n-f2acd0f4d35a03d6b963d1c4a28ee279\n+09edb256861e6234ee2203831a2b6067\n axiom Rep_Container ::\n GHC.Generics.Rep (Container b a)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Container\" 'GHC.Generics.PrefixI 'GHC.Types.True)\n (GHC.Generics.S1\n ('GHC.Generics.MetaSel\n ('GHC.Maybe.Just \"getContainer\")\n 'GHC.Generics.NoSourceUnpackedness\n 'GHC.Generics.NoSourceStrictness\n 'GHC.Generics.DecidedLazy)\n (GHC.Generics.Rec0 (b (Data.Functor.Const.Const a)))))\n-3e9c00d9333dfec2f681ce243dbb6dde\n+f67166a40d66cdeb8d0db99fc2c8fa67\n axiom Rep_ErrorContainer ::\n GHC.Generics.Rep (ErrorContainer b e)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"ErrorContainer\" 'GHC.Generics.PrefixI 'GHC.Types.True)\n (GHC.Generics.S1\n ('GHC.Generics.MetaSel\n ('GHC.Maybe.Just \"getErrorContainer\")\n 'GHC.Generics.NoSourceUnpackedness\n 'GHC.Generics.NoSourceStrictness\n 'GHC.Generics.DecidedLazy)\n (GHC.Generics.Rec0 (b (Data.Either.Either e)))))\n-d51016dd054e02ef6a76637885cbefad\n+5c3675b8b7162dde09bdcb6103fa87f3\n getContainer :: Container b a -> b (Data.Functor.Const.Const a)\n RecSel Left Container\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getContainer1\n `cast`\n (forall (b :: <(* -> *) -> *>_N) (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Container[0] _R _N)]\n-ac0624ab6b015330a18bef5e1e729254\n+04333d16ac31946194f614e80cadbfa6\n getContainer1 :: Container b a -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> * @a (ds4['GHC.Types.Many] :: Container b a) ->\n ds4]\n-7113d28f172cd850dd70c4d1d1a731c7\n+86f3d8aaf316d1331cd669380b9a5a53\n getErrorContainer :: ErrorContainer b e -> b (Data.Either.Either e)\n RecSel Left ErrorContainer\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getErrorContainer1\n `cast`\n (forall (b :: <(* -> *) -> *>_N) (e :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:ErrorContainer[0] _R _N)]\n-f0ae746786e21189b1b93d34b5972f5e\n+557dd485adafb70fefc746edc5632bb2\n getErrorContainer1 :: ErrorContainer b e -> ErrorContainer b e\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @e\n (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.dyn_hi", "comments": ["Files 96% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.Dicts 9066\n- interface hash: 7c0096d7e7b7dc1de23084183c29f09f\n- ABI hash: adc34e2df477586dd9e7c283171fce38\n- export-list hash: 9f8c69c553b186c41f515294f9b7135a\n+ interface hash: f36f172d4f837c92089a410ba905e3cf\n+ ABI hash: 3d78de6277daf9b83804594f15881e1b\n+ export-list hash: aef70c927dc71262ae11a005378b77ba\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 9824f2d58567a6cc3332fd78de4d3243\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: f66ac557d003e50b346f058447f6bfbf\n sig of: Nothing\n@@ -32,15 +32,15 @@\n Data.Complex Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.RTS.Flags\n import -/ Data.Functor.Classes 49d38fb3e78a1230bce3b4889c8a6dcf\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n-5f2ddf5529996abc63a6946df67ff16f\n+8bcaf9fbf928188149e8f365fdcbacc9\n $fClassFGkkkcfga ::\n forall k1 k2 k3 (c :: k1 -> k2 -> GHC.Types.Constraint)\n (f :: k3 -> k1) (a :: k3) (g :: k3 -> k2).\n c (f a) (g a) =>\n ClassFG c f g a\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -52,15 +52,15 @@\n -> k1\n -> GHC.Types.Constraint>_N) (f :: k>_N) (a :: _N) (g :: k1>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:ClassFG[0]\n _N _N _N _N _N _N _N))]\n-09511cb944abade6cbbacf3b539f0372\n+f3442b0f31c3994bfef524440f75b29c\n $fClassFGkkkcfga_$cp1ClassFG ::\n forall k1 k2 k3 (c :: k1 -> k2 -> GHC.Types.Constraint)\n (f :: k3 -> k1) (a :: k3) (g :: k3 -> k2).\n c (f a) (g a) =>\n c (f a) (g a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n@@ -70,15 +70,15 @@\n @k2\n @c :: k -> k1 -> GHC.Types.Constraint\n @f :: k2 -> k\n @a :: k2\n @g :: k2 -> k1\n (irred['GHC.Types.Many] :: c (f a) (g a)) ->\n irred]\n-6d8249f164eade28dc493615bb3d42ee\n+0c484de3d8ca8666b8844ee2075ddc4e\n $fClassFkkcfa ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (f :: k2 -> k1)\n (a :: k2).\n c (f a) =>\n ClassF c f a\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -88,15 +88,15 @@\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (c :: GHC.Types.Constraint>_N) (f :: k>_N) (a :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:ClassF[0]\n _N _N _N _N _N))]\n-c95ddc765c0bd511c05f7b730dff1d88\n+72974069789500f5e6b681f64631011e\n $fClassFkkcfa_$cp1ClassF ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (f :: k2 -> k1)\n (a :: k2).\n c (f a) =>\n c (f a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n@@ -104,370 +104,370 @@\n \\ @k\n @k1\n @c :: k -> GHC.Types.Constraint\n @f :: k1 -> k\n @a :: k1\n (irred['GHC.Types.Many] :: c (f a)) ->\n irred]\n-1b36a88a7bb2f9c83c96a6b45589002c\n+1b6c217629ce99169b407e9c9235a977\n $fEqDict ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Classes.Eq (Dict c a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @c :: k -> GHC.Types.Constraint @a :: k.\n @(Dict c a) ($fEqDict_$c== @k @c @a) ($fEqDict_$c/= @k @c @a)]\n-4608663d90522fa780b87dc64d52e058\n+69b9e14ccd281d2d1574ef2d8cd8f075\n $fEqDict_$c/= ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> Dict c a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (x['GHC.Types.Many] :: Dict c a)\n (y['GHC.Types.Many] :: Dict c a) ->\n GHC.Types.False]\n-d21d37b8157f192e18efc6022145ea47\n+be0f866d475fc4f9d75aa8d968024a7e\n $fEqDict_$c== ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> Dict c a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: Dict c a)\n (ds1['GHC.Types.Many] :: Dict c a) ->\n GHC.Types.True]\n-184a67e5d828306da58623d209c94ffe\n+c5d20170e97a77543cf200ad19d3498c\n $fShow1Dict :: Data.Functor.Classes.Show1 (Dict c)\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Show1],\n Inline: CONLIKE,\n Unfolding: DFun: @c :: * -> GHC.Types.Constraint.\n @(Dict c)\n ($fShow1Dict_$cp1Show1 @c)\n ($fShow1Dict_$cliftShowsPrec @c)\n ($fShow1Dict_$cliftShowList @c)]\n-fc68bb86df1719b7f33f87d450faa03c\n+1cdd4b4eb5af759aa6d63a63925b1711\n $fShow1Dict1 :: Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @a\n @c :: * -> GHC.Types.Constraint\n (ds['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-93f1f1200b775b6ee7af60330c93b522\n+7b336359f144998b1e0eb19f9dc74a48\n $fShow1Dict2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Dict\"#]\n-81a3d2edea968b35bbad5c0efdd002c3\n+96b6f3199cbbcdd49da5f292c11d1915\n $fShow1Dict_$cliftShowList ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Dict c a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n \\ @c :: * -> GHC.Types.Constraint\n @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (eta['GHC.Types.Many] :: [Dict c a])\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Dict c a) ($fShow1Dict1 @a @c) eta eta1]\n-c79b40bcb3a8bb3b8d5734ef3cfb00e9\n+d7981d6efb1582164d2367caa9a0d592\n $fShow1Dict_$cliftShowsPrec ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Dict c a\n -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1!A>,\n Unfolding: Core: \n \\ @c :: * -> GHC.Types.Constraint\n @a\n (ds['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (ds1['GHC.Types.Many] :: [a] -> GHC.Show.ShowS) ->\n $fShow1Dict_$cshowsPrec @(*) @c @a]\n-28dcefd1f72aae796b77e6f60c753bb0\n+c88b3569d35b8a77d869258105a7f53a\n $fShow1Dict_$cp1Show1 ::\n GHC.Show.Show a => GHC.Show.Show (Dict c a)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c :: * -> GHC.Types.Constraint\n @a\n ($dShow['GHC.Types.Many] :: GHC.Show.Show a) ->\n $fShowDict @(*) @c @a]\n-1bfea3d3fc2cd2e1a139dd099c47fb6e\n+7b627c35a690b118d5c522973fe01cd1\n $fShow1Dict_$cshowsPrec ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Types.Int -> Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (ds1['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds1 of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-23de47ae1960a6bf27692f14303bf5d7\n+a20649268f52f7a90cdda1322c90e431\n $fShowDict ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Show.Show (Dict c a)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Show.C:Show],\n Inline: CONLIKE,\n Unfolding: DFun: @k @c :: k -> GHC.Types.Constraint @a :: k.\n @(Dict c a)\n ($fShow1Dict_$cshowsPrec @k @c @a)\n ($fShowDict_$cshow @k @c @a)\n ($fShowDict_$cshowList @k @c @a)]\n-29de7ea399c427bc38bc5b0748e12392\n+4ce147e837574ee68c9b81e647e7e3f7\n $fShowDict1 ::\n forall {k} {a :: k} {c :: k -> GHC.Types.Constraint}.\n Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @a :: k\n @c :: k -> GHC.Types.Constraint\n (ds['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-f184b26b332b8f78519f016671103d24\n+750ead87a0a50ee8072955343da7840e\n $fShowDict2 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShow1Dict2]\n-223274ca99ff7d0ecab13f12c3e01b88\n+752c971d429b8fa722b862b66153b5b7\n $fShowDict_$cshow ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1!A>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (x['GHC.Types.Many] :: Dict c a) ->\n case x of wild { Dict irred -> $fShowDict2 }]\n-053d26b9dd9b456788d153afbcb830e1\n+81093b8cca9ba8b4cc1b8cf9c0aab3b4\n $fShowDict_$cshowList ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n [Dict c a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ls['GHC.Types.Many] :: [Dict c a])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Dict c a) ($fShowDict1 @k @a @c) ls s]\n-bfd03fb32b454373dff606fe83ac9af0\n+4f5982279307853ee9a05b7e8c8f594c\n $tc'C:ClassF :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 9962091086868300227#Word64\n- 8845953831145920307#Word64\n+ 15823410447598864844#Word64\n+ 15637787440345167551#Word64\n $trModule\n $tc'C:ClassF2\n 5#\n $tc'C:ClassF1]\n-e43bdab2bac9c5b71822f7d9dd2edab2\n+f6f479eb5ec9d84a38a20a63898d9a58\n $tc'C:ClassF1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-2e5f2a83da5bdf7cbdf30a895f02bb15\n+004d9d00aab7f5d36706711680d07d7d\n $tc'C:ClassF2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:ClassF3]\n-00d1b8cb952e7ce23695801a1c13452b\n+1d13b5da603230f20c7a53eab7dd9a52\n $tc'C:ClassF3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:ClassF\"#]\n-492089e2336e712040f690a19eed92c6\n+297f14aa42ddd4d346d400028e2e0046\n $tc'C:ClassFG :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8175737591424614896#Word64\n- 14521411132137238231#Word64\n+ 17538473654808530638#Word64\n+ 66217755439753604#Word64\n $trModule\n $tc'C:ClassFG2\n 7#\n $tc'C:ClassFG1]\n-efbb0abb348eb02d3e3cc597f0f50360\n+c98c204c787fa52c75a72b6503938020\n $tc'C:ClassFG1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-21826db568a9b8f7ff9ccb01ea2b33c7\n+230666d8df509c0448d2c584e18eefa5\n $tc'C:ClassFG2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:ClassFG3]\n-20139cff8481b65ad20a0344fdd4875a\n+08015a7df416a1f51ba3c354b4db5b14\n $tc'C:ClassFG3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:ClassFG\"#]\n-0d034d07486b8810a66da72e92ea6b78\n+d72654b7c01ec5b8cc1a6feffaa341c3\n $tc'Dict :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 10981873746971651832#Word64\n- 8654492964909526752#Word64\n+ 10115453066248321123#Word64\n+ 7909610162688476029#Word64\n $trModule\n $tc'Dict2\n 3#\n $tc'Dict1]\n-b162a31002c1668c5b825ac4889387fe\n+cd9bbc9e913fc3e1c98c567138f6c9c2\n $tc'Dict1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-60e77b8e5fbbcee385a383fb056f1811\n+a7f312ea1fe663c76a7c7fc6e3ad9905\n $tc'Dict2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Dict3]\n-3bcc03e687a530e586c9bcffed5f7645\n+7f8c016705efe1248f8b936b836e01d4\n $tc'Dict3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Dict\"#]\n-1093905e5a8a64632d3ffe0739ce9b4d\n+db7942785a33ed4e76820f00ec74214f\n $tcClassF :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2192194475331318293#Word64\n- 12159286453195903486#Word64\n+ 16573094829897681291#Word64\n+ 7117219717354670587#Word64\n $trModule\n $tcClassF2\n 2#\n $tcClassF1]\n-289bbe12db9d7c78f2d0c1a3558beceb\n+5c8a51eb7425f7d635152bbf099b426f\n $tcClassF1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-0aaf25eda53b76aa92412741018b9f9c\n+24c0f40b6b1879c236262cdab7bd107c\n $tcClassF2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcClassF3]\n-1a47105888c690f77f9abac92863a439\n+4a60a41611705a45eb9e0ed43a4a4e01\n $tcClassF3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ClassF\"#]\n-e41c9715c68d9b1299447e7cbbce44eb\n+2f567234bf118301a108cbf8dc5d198c\n $tcClassFG :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15628299198473036439#Word64\n- 8813852324344749869#Word64\n+ 6905121547713486777#Word64\n+ 2215468622041004873#Word64\n $trModule\n $tcClassFG2\n 3#\n $tcClassFG1]\n-dc7abe7e2eb61f349cf831a1d96fb45b\n+a491e2f396025f1639b7d90fbb802ec8\n $tcClassFG1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-4f4fbd160895fe6afd77831e8db383ad\n+3d42e6c068ee5c87276f3fe12a9a0a5a\n $tcClassFG2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcClassFG3]\n-5e702121cd48060b1d4ef614c05b629a\n+cd55d1af4853ea4ae82df0fbd8a19559\n $tcClassFG3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ClassFG\"#]\n-227d2d8b748335c38ef3b9e73d20b1af\n+34906199a19587b5400af3aee2a86070\n $tcDict :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 13896956498795007266#Word64\n- 1622262699365558675#Word64\n+ 14421220535303563688#Word64\n+ 5859309667596463422#Word64\n $trModule\n $tcDict2\n 1#\n $tcDict1]\n-b5624aa5e1a80ca56e68e43fc863043b\n+21606409c14d10f4c18c076286099713\n $tcDict1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-91a2fd963015fcbf953853468908d277\n+f4dffc8da05cb0b7235f7dfb375a9de2\n $tcDict2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fShow1Dict2]\n-485df9713f0fc2b18091c77227e703fe\n+6a27f0d4c1da52d132e9bb28448188b1\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-40a8d6690c88d3053cae578369e4eeee\n+6ff6da52db330393dddcb8d533a15d79\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-a75f60dba04b683287ca3d2721b6772b\n+ed962f00d50ac18572abc1481cda616f\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Dicts\"#]\n-5c42d8ec8db49122fac8b764e10396e4\n+676fb9d26c88441ce38806d59d76fe0b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-ef2065b9990a1ec95015109c8d679194\n+874dfd6e4c0e2a3f4b04288729e332d1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-b821ba43283d58af1dc72dc522c3f3e0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+cedbbc004e9d832ea18c4ef8ea2a51e5\n type ClassF :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> k1 -> GHC.Types.Constraint\n class c (f a) => ClassF c f a\n-49f1c53a16ecf58347d2954cac6dea25\n+956656054dd5ddd580072614ba216cb3\n type ClassFG :: forall {k} {k1} {k2}.\n (k -> k1 -> GHC.Types.Constraint)\n -> (k2 -> k) -> (k2 -> k1) -> k2 -> GHC.Types.Constraint\n class c (f a) (g a) => ClassFG c f g a\n-ec60591113f8a2b0cd5ff8ded40ccb22\n+dd2349f8d9e28b14c434ca84ff9690b6\n type role Dict representational nominal\n type Dict :: forall {k}. (k -> GHC.Types.Constraint) -> k -> *\n data Dict c a where\n Dict :: forall {k} (c :: k -> GHC.Types.Constraint) (a :: k).\n c a =>\n Dict c a\n-f6333333dc16a8bbdb60d52bf6811ce8\n+2d4b46c54446fba7bdfd2823fc5d2356\n requiringDict ::\n forall {k} (c :: k -> GHC.Types.Constraint) (a :: k) r.\n (c a => r) -> Dict c a -> r\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)><1!P(L)>,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.hi", "comments": ["Files 97% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.Dicts 9066\n- interface hash: 7c0096d7e7b7dc1de23084183c29f09f\n- ABI hash: adc34e2df477586dd9e7c283171fce38\n- export-list hash: 9f8c69c553b186c41f515294f9b7135a\n+ interface hash: f36f172d4f837c92089a410ba905e3cf\n+ ABI hash: 3d78de6277daf9b83804594f15881e1b\n+ export-list hash: aef70c927dc71262ae11a005378b77ba\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 6b06f337fb8586972ac1690e0fca4f25\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: f66ac557d003e50b346f058447f6bfbf\n sig of: Nothing\n@@ -32,15 +32,15 @@\n Data.Complex Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.RTS.Flags\n import -/ Data.Functor.Classes 49d38fb3e78a1230bce3b4889c8a6dcf\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n-5f2ddf5529996abc63a6946df67ff16f\n+8bcaf9fbf928188149e8f365fdcbacc9\n $fClassFGkkkcfga ::\n forall k1 k2 k3 (c :: k1 -> k2 -> GHC.Types.Constraint)\n (f :: k3 -> k1) (a :: k3) (g :: k3 -> k2).\n c (f a) (g a) =>\n ClassFG c f g a\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -52,15 +52,15 @@\n -> k1\n -> GHC.Types.Constraint>_N) (f :: k>_N) (a :: _N) (g :: k1>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:ClassFG[0]\n _N _N _N _N _N _N _N))]\n-09511cb944abade6cbbacf3b539f0372\n+f3442b0f31c3994bfef524440f75b29c\n $fClassFGkkkcfga_$cp1ClassFG ::\n forall k1 k2 k3 (c :: k1 -> k2 -> GHC.Types.Constraint)\n (f :: k3 -> k1) (a :: k3) (g :: k3 -> k2).\n c (f a) (g a) =>\n c (f a) (g a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n@@ -70,15 +70,15 @@\n @k2\n @c :: k -> k1 -> GHC.Types.Constraint\n @f :: k2 -> k\n @a :: k2\n @g :: k2 -> k1\n (irred['GHC.Types.Many] :: c (f a) (g a)) ->\n irred]\n-6d8249f164eade28dc493615bb3d42ee\n+0c484de3d8ca8666b8844ee2075ddc4e\n $fClassFkkcfa ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (f :: k2 -> k1)\n (a :: k2).\n c (f a) =>\n ClassF c f a\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -88,15 +88,15 @@\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (c :: GHC.Types.Constraint>_N) (f :: k>_N) (a :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:ClassF[0]\n _N _N _N _N _N))]\n-c95ddc765c0bd511c05f7b730dff1d88\n+72974069789500f5e6b681f64631011e\n $fClassFkkcfa_$cp1ClassF ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (f :: k2 -> k1)\n (a :: k2).\n c (f a) =>\n c (f a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n@@ -104,370 +104,370 @@\n \\ @k\n @k1\n @c :: k -> GHC.Types.Constraint\n @f :: k1 -> k\n @a :: k1\n (irred['GHC.Types.Many] :: c (f a)) ->\n irred]\n-1b36a88a7bb2f9c83c96a6b45589002c\n+1b6c217629ce99169b407e9c9235a977\n $fEqDict ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Classes.Eq (Dict c a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @c :: k -> GHC.Types.Constraint @a :: k.\n @(Dict c a) ($fEqDict_$c== @k @c @a) ($fEqDict_$c/= @k @c @a)]\n-4608663d90522fa780b87dc64d52e058\n+69b9e14ccd281d2d1574ef2d8cd8f075\n $fEqDict_$c/= ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> Dict c a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (x['GHC.Types.Many] :: Dict c a)\n (y['GHC.Types.Many] :: Dict c a) ->\n GHC.Types.False]\n-d21d37b8157f192e18efc6022145ea47\n+be0f866d475fc4f9d75aa8d968024a7e\n $fEqDict_$c== ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> Dict c a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: Dict c a)\n (ds1['GHC.Types.Many] :: Dict c a) ->\n GHC.Types.True]\n-184a67e5d828306da58623d209c94ffe\n+c5d20170e97a77543cf200ad19d3498c\n $fShow1Dict :: Data.Functor.Classes.Show1 (Dict c)\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Show1],\n Inline: CONLIKE,\n Unfolding: DFun: @c :: * -> GHC.Types.Constraint.\n @(Dict c)\n ($fShow1Dict_$cp1Show1 @c)\n ($fShow1Dict_$cliftShowsPrec @c)\n ($fShow1Dict_$cliftShowList @c)]\n-fc68bb86df1719b7f33f87d450faa03c\n+1cdd4b4eb5af759aa6d63a63925b1711\n $fShow1Dict1 :: Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @a\n @c :: * -> GHC.Types.Constraint\n (ds['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-93f1f1200b775b6ee7af60330c93b522\n+7b336359f144998b1e0eb19f9dc74a48\n $fShow1Dict2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Dict\"#]\n-81a3d2edea968b35bbad5c0efdd002c3\n+96b6f3199cbbcdd49da5f292c11d1915\n $fShow1Dict_$cliftShowList ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Dict c a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n \\ @c :: * -> GHC.Types.Constraint\n @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (eta['GHC.Types.Many] :: [Dict c a])\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Dict c a) ($fShow1Dict1 @a @c) eta eta1]\n-c79b40bcb3a8bb3b8d5734ef3cfb00e9\n+d7981d6efb1582164d2367caa9a0d592\n $fShow1Dict_$cliftShowsPrec ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Dict c a\n -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1!A>,\n Unfolding: Core: \n \\ @c :: * -> GHC.Types.Constraint\n @a\n (ds['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (ds1['GHC.Types.Many] :: [a] -> GHC.Show.ShowS) ->\n $fShow1Dict_$cshowsPrec @(*) @c @a]\n-28dcefd1f72aae796b77e6f60c753bb0\n+c88b3569d35b8a77d869258105a7f53a\n $fShow1Dict_$cp1Show1 ::\n GHC.Show.Show a => GHC.Show.Show (Dict c a)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c :: * -> GHC.Types.Constraint\n @a\n ($dShow['GHC.Types.Many] :: GHC.Show.Show a) ->\n $fShowDict @(*) @c @a]\n-1bfea3d3fc2cd2e1a139dd099c47fb6e\n+7b627c35a690b118d5c522973fe01cd1\n $fShow1Dict_$cshowsPrec ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Types.Int -> Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (ds1['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds1 of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-23de47ae1960a6bf27692f14303bf5d7\n+a20649268f52f7a90cdda1322c90e431\n $fShowDict ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Show.Show (Dict c a)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Show.C:Show],\n Inline: CONLIKE,\n Unfolding: DFun: @k @c :: k -> GHC.Types.Constraint @a :: k.\n @(Dict c a)\n ($fShow1Dict_$cshowsPrec @k @c @a)\n ($fShowDict_$cshow @k @c @a)\n ($fShowDict_$cshowList @k @c @a)]\n-29de7ea399c427bc38bc5b0748e12392\n+4ce147e837574ee68c9b81e647e7e3f7\n $fShowDict1 ::\n forall {k} {a :: k} {c :: k -> GHC.Types.Constraint}.\n Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @a :: k\n @c :: k -> GHC.Types.Constraint\n (ds['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-f184b26b332b8f78519f016671103d24\n+750ead87a0a50ee8072955343da7840e\n $fShowDict2 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShow1Dict2]\n-223274ca99ff7d0ecab13f12c3e01b88\n+752c971d429b8fa722b862b66153b5b7\n $fShowDict_$cshow ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1!A>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (x['GHC.Types.Many] :: Dict c a) ->\n case x of wild { Dict irred -> $fShowDict2 }]\n-053d26b9dd9b456788d153afbcb830e1\n+81093b8cca9ba8b4cc1b8cf9c0aab3b4\n $fShowDict_$cshowList ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n [Dict c a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ls['GHC.Types.Many] :: [Dict c a])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Dict c a) ($fShowDict1 @k @a @c) ls s]\n-bfd03fb32b454373dff606fe83ac9af0\n+4f5982279307853ee9a05b7e8c8f594c\n $tc'C:ClassF :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 9962091086868300227#Word64\n- 8845953831145920307#Word64\n+ 15823410447598864844#Word64\n+ 15637787440345167551#Word64\n $trModule\n $tc'C:ClassF2\n 5#\n $tc'C:ClassF1]\n-e43bdab2bac9c5b71822f7d9dd2edab2\n+f6f479eb5ec9d84a38a20a63898d9a58\n $tc'C:ClassF1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-2e5f2a83da5bdf7cbdf30a895f02bb15\n+004d9d00aab7f5d36706711680d07d7d\n $tc'C:ClassF2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:ClassF3]\n-00d1b8cb952e7ce23695801a1c13452b\n+1d13b5da603230f20c7a53eab7dd9a52\n $tc'C:ClassF3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:ClassF\"#]\n-492089e2336e712040f690a19eed92c6\n+297f14aa42ddd4d346d400028e2e0046\n $tc'C:ClassFG :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8175737591424614896#Word64\n- 14521411132137238231#Word64\n+ 17538473654808530638#Word64\n+ 66217755439753604#Word64\n $trModule\n $tc'C:ClassFG2\n 7#\n $tc'C:ClassFG1]\n-efbb0abb348eb02d3e3cc597f0f50360\n+c98c204c787fa52c75a72b6503938020\n $tc'C:ClassFG1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-21826db568a9b8f7ff9ccb01ea2b33c7\n+230666d8df509c0448d2c584e18eefa5\n $tc'C:ClassFG2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:ClassFG3]\n-20139cff8481b65ad20a0344fdd4875a\n+08015a7df416a1f51ba3c354b4db5b14\n $tc'C:ClassFG3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:ClassFG\"#]\n-0d034d07486b8810a66da72e92ea6b78\n+d72654b7c01ec5b8cc1a6feffaa341c3\n $tc'Dict :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 10981873746971651832#Word64\n- 8654492964909526752#Word64\n+ 10115453066248321123#Word64\n+ 7909610162688476029#Word64\n $trModule\n $tc'Dict2\n 3#\n $tc'Dict1]\n-b162a31002c1668c5b825ac4889387fe\n+cd9bbc9e913fc3e1c98c567138f6c9c2\n $tc'Dict1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-60e77b8e5fbbcee385a383fb056f1811\n+a7f312ea1fe663c76a7c7fc6e3ad9905\n $tc'Dict2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Dict3]\n-3bcc03e687a530e586c9bcffed5f7645\n+7f8c016705efe1248f8b936b836e01d4\n $tc'Dict3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Dict\"#]\n-1093905e5a8a64632d3ffe0739ce9b4d\n+db7942785a33ed4e76820f00ec74214f\n $tcClassF :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2192194475331318293#Word64\n- 12159286453195903486#Word64\n+ 16573094829897681291#Word64\n+ 7117219717354670587#Word64\n $trModule\n $tcClassF2\n 2#\n $tcClassF1]\n-289bbe12db9d7c78f2d0c1a3558beceb\n+5c8a51eb7425f7d635152bbf099b426f\n $tcClassF1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-0aaf25eda53b76aa92412741018b9f9c\n+24c0f40b6b1879c236262cdab7bd107c\n $tcClassF2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcClassF3]\n-1a47105888c690f77f9abac92863a439\n+4a60a41611705a45eb9e0ed43a4a4e01\n $tcClassF3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ClassF\"#]\n-e41c9715c68d9b1299447e7cbbce44eb\n+2f567234bf118301a108cbf8dc5d198c\n $tcClassFG :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15628299198473036439#Word64\n- 8813852324344749869#Word64\n+ 6905121547713486777#Word64\n+ 2215468622041004873#Word64\n $trModule\n $tcClassFG2\n 3#\n $tcClassFG1]\n-dc7abe7e2eb61f349cf831a1d96fb45b\n+a491e2f396025f1639b7d90fbb802ec8\n $tcClassFG1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-4f4fbd160895fe6afd77831e8db383ad\n+3d42e6c068ee5c87276f3fe12a9a0a5a\n $tcClassFG2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcClassFG3]\n-5e702121cd48060b1d4ef614c05b629a\n+cd55d1af4853ea4ae82df0fbd8a19559\n $tcClassFG3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ClassFG\"#]\n-227d2d8b748335c38ef3b9e73d20b1af\n+34906199a19587b5400af3aee2a86070\n $tcDict :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 13896956498795007266#Word64\n- 1622262699365558675#Word64\n+ 14421220535303563688#Word64\n+ 5859309667596463422#Word64\n $trModule\n $tcDict2\n 1#\n $tcDict1]\n-b5624aa5e1a80ca56e68e43fc863043b\n+21606409c14d10f4c18c076286099713\n $tcDict1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-91a2fd963015fcbf953853468908d277\n+f4dffc8da05cb0b7235f7dfb375a9de2\n $tcDict2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fShow1Dict2]\n-485df9713f0fc2b18091c77227e703fe\n+6a27f0d4c1da52d132e9bb28448188b1\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-40a8d6690c88d3053cae578369e4eeee\n+6ff6da52db330393dddcb8d533a15d79\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-a75f60dba04b683287ca3d2721b6772b\n+ed962f00d50ac18572abc1481cda616f\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Dicts\"#]\n-5c42d8ec8db49122fac8b764e10396e4\n+676fb9d26c88441ce38806d59d76fe0b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-ef2065b9990a1ec95015109c8d679194\n+874dfd6e4c0e2a3f4b04288729e332d1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-b821ba43283d58af1dc72dc522c3f3e0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+cedbbc004e9d832ea18c4ef8ea2a51e5\n type ClassF :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> k1 -> GHC.Types.Constraint\n class c (f a) => ClassF c f a\n-49f1c53a16ecf58347d2954cac6dea25\n+956656054dd5ddd580072614ba216cb3\n type ClassFG :: forall {k} {k1} {k2}.\n (k -> k1 -> GHC.Types.Constraint)\n -> (k2 -> k) -> (k2 -> k1) -> k2 -> GHC.Types.Constraint\n class c (f a) (g a) => ClassFG c f g a\n-ec60591113f8a2b0cd5ff8ded40ccb22\n+dd2349f8d9e28b14c434ca84ff9690b6\n type role Dict representational nominal\n type Dict :: forall {k}. (k -> GHC.Types.Constraint) -> k -> *\n data Dict c a where\n Dict :: forall {k} (c :: k -> GHC.Types.Constraint) (a :: k).\n c a =>\n Dict c a\n-f6333333dc16a8bbdb60d52bf6811ce8\n+2d4b46c54446fba7bdfd2823fc5d2356\n requiringDict ::\n forall {k} (c :: k -> GHC.Types.Constraint) (a :: k) r.\n (c a => r) -> Dict c a -> r\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)><1!P(L)>,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Internal.DistributiveB [orphan module] 9066\n- interface hash: fa914345b6915eb49a865daa6879b578\n- ABI hash: 756f71b11ce54e0a43610a99703c6dd7\n- export-list hash: 61e86516bb9242bfd66af8550d57db65\n- orphan hash: 9c848d6360e7976df2b0c1adb123a733\n- flag hash: 085b3a61e9b81acb219ec58be19ba44b\n+ interface hash: f2fa56833f6294819f6e59dfb902defb\n+ ABI hash: 784ec817335692db89a46f566642924c\n+ export-list hash: 1aecfa1521218373d8fc39d7c9313113\n+ orphan hash: ed74f00994c6c0489d6087cb335abd40\n+ flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 09bdb01a99bc2ced42488e207e49fe39\n sig of: Nothing\n used TH splices: False\n where\n@@ -21,17 +21,17 @@\n bcotraverse\n bdecompose\n bdistribute'\n brecompose\n gbdistributeDefault\n CanDeriveDistributiveB\n DistributiveB{bdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float Data.Orphans\n GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n@@ -39,43 +39,43 @@\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception GHC.IsList\n GHC.RTS.Flags GHC.Stats Control.DeepSeq Data.Tagged\n Control.Applicative.Backwards Control.Monad.Trans.Identity\n Control.Monad.Trans.Reader Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive bc4b8750effdecf47b6444706f50b239\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 8920dca54430650db1672b0181edd98f\n- gdistribute 88c43b505c766c52951b46c9a80b6975\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive 6ea5c0f8a0da8726f912791430769bee\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive 99fd67a91a625d0976ec289825432d45\n+ gdistribute c0adfdc0ac5a3513a556e091d34d614a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Distributive 04fa65c32a90c60ba98393f96353840a\n-4815b70d00715124afc473faeb0a32bf\n+8c51c4ab3f926a204b1f58843760d895\n $dmbdistribute ::\n forall k (b :: (k -> *) -> *) (f :: * -> *) (g :: k -> *).\n (DistributiveB b, CanDeriveDistributiveB b f g,\n GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -305,15 +305,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-7c6fe62d8a3636aed33f9acbb5b356a7\n+43ae0e854de69204c12d3047f04a7c9f\n $fDistributiveBkCompose ::\n forall k (h :: * -> *) (b :: (k -> *) -> *).\n (Data.Distributive.Distributive h, DistributiveB b) =>\n DistributiveB (Data.Functor.Compose.Compose h b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -332,15 +332,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkCompose_$cbdistribute @k @h @b v v1)]\n-3c3614320eec6dd94094680642e34aa1\n+4e449ecd9410e65ae792f5705d052d01\n $fDistributiveBkCompose1 ::\n forall {k} {h :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (Data.Distributive.Distributive h, DistributiveB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose h b f1 -> h (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -367,15 +367,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-989a3b45f1fd2a39ce05515cb05ca5dc\n+f08320980e6e8019dd0b4b82b4b809a2\n $fDistributiveBkCompose_$cbdistribute ::\n forall k (h :: * -> *) (b :: (k -> *) -> *) (f :: * -> *)\n (g :: k -> *).\n (Data.Distributive.Distributive h, DistributiveB b,\n GHC.Base.Functor f) =>\n f (Data.Functor.Compose.Compose h b g)\n -> Data.Functor.Compose.Compose\n@@ -426,15 +426,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n *>_N\n _R\n _N\n _N))]\n-79c62627109c71f2e9079edc27df59df\n+e4242e65a01627a5c372bd5da424232f\n $fDistributiveBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (DistributiveB a, DistributiveB b) =>\n DistributiveB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -448,15 +448,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fDistributiveBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkProduct_$cbdistribute @k @a @b v v1)]\n-177c0a290015fdebfe1324e8f02d5f00\n+ff6dffb0ee7986cdd6dd8c9a29b3800c\n $fDistributiveBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (DistributiveB a, DistributiveB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -490,15 +490,15 @@\n (($p1DistributiveB @k @b $dDistributiveB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-172fd7b38ef20500cddd93cefb810f44\n+6a0accfb0915ae65aa3af59ce85e4b9d\n $fDistributiveBkProduct_$cbdistribute ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: * -> *)\n (g :: k -> *).\n (DistributiveB a, DistributiveB b, GHC.Base.Functor f) =>\n f (Data.Functor.Product.Product a b g)\n -> Data.Functor.Product.Product\n a b (Data.Functor.Compose.Compose f g)\n@@ -545,43 +545,43 @@\n (GHC.Base.fmap\n @f\n $dFunctor\n @(Data.Functor.Product.Product a b g)\n @(b g)\n (sndF @(k -> *) @a @b @g)\n xy))]\n-8a3f5b313595c4d61de5fc340a14878e\n+a3adaa62e78e6d8eadd672d61994565b\n $fDistributiveBkProxy :: DistributiveB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkProxy_$cbdistribute @k)]\n-2005f3bf32e3783a22246cf7c468e6b8\n+67030c0d14c8133390ebe1075100fddd\n $fDistributiveBkProxy_$cbdistribute ::\n forall k (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (Data.Proxy.Proxy g)\n -> Data.Proxy.Proxy (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @f :: * -> *\n @g :: k -> *\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n (ds['GHC.Types.Many] :: f (Data.Proxy.Proxy g)) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Compose.Compose f g)]\n-9fa4a78cc22240fd4796f410a9f3713a\n+52b18fd4c7f153a9326e29f401469bb9\n $fGDistributivek0fRecRec ::\n forall k1 k (f :: * -> *) (b :: (k1 -> *) -> *)\n (b' :: (k1 -> *) -> *) (g :: k1 -> *).\n (GHC.Base.Functor f, DistributiveB b) =>\n Barbies.Generics.Distributive.GDistributive\n 0\n f\n@@ -605,15 +605,15 @@\n @f\n @(Data.Generics.GenericN.Rec (b' (P 0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b' (P 0 (Data.Functor.Compose.Compose f g)))\n (b (Data.Functor.Compose.Compose f g)))\n v\n ($fGDistributivek0fRecRec_$cgdistribute @k1 @k @f @b @b' @g v v1)]\n-6445fcdf2d9bce8b2147775be7818307\n+da45175ec0344bee89dd5e650585fc42\n $fGDistributivek0fRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (b :: (k1 -> *) -> *)\n (b' :: (k1 -> *) -> *) (g :: k1 -> *) (x :: k).\n (GHC.Base.Functor f, DistributiveB b) =>\n Data.Proxy.Proxy 0\n -> f (Data.Generics.GenericN.Rec (b' (P 0 g)) (b g) x)\n -> Data.Generics.GenericN.Rec\n@@ -670,15 +670,15 @@\n _N\n _P) _N _N)]\n-77133ce962711c1f2e4decd8715ae211\n+f425c54df211500680f72b6ca739a35a\n $fGDistributiveknfRecRec ::\n forall k1 k (f :: * -> *) (h :: * -> *) (b :: (k1 -> *) -> *)\n (n :: GHC.TypeNats.Nat) (g :: k1 -> *).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveB b) =>\n Barbies.Generics.Distributive.GDistributive\n n\n@@ -717,15 +717,15 @@\n @h\n @b\n @n\n @g\n v\n v1\n v2)]\n-6f2a7aae66b247bb12cb7e29c247d55e\n+5699d22ce900ed8ac56ba5e7e26dc2d3\n $fGDistributiveknfRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (h :: * -> *) (b :: (k1 -> *) -> *)\n (n :: GHC.TypeNats.Nat) (g :: k1 -> *) (x :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveB b) =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (h (b (P n g))) (h (b g)) x)\n@@ -800,91 +800,91 @@\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-8caab2e37b072045ab35c060756f6a68\n+ce8ea6b624f0b9f38efe1e95e9df4adc\n $tcDistributiveB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15471774058183975324#Word64\n- 12963566728231169884#Word64\n+ 3526910175284033893#Word64\n+ 1659290968467588520#Word64\n $trModule\n $tcDistributiveB2\n 1#\n $tcDistributiveB1]\n-05eb46d2a93037b8c6af74baa190754b\n+e052f7eefe330d2a9555fe6eab2834e9\n $tcDistributiveB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-9001dd58568d6cbc8461b8adc882a101\n+6db3f66364ef60dc160570004be8c77c\n $tcDistributiveB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcDistributiveB3]\n-b7f44c7d863d9eeaf0e1c0eb9d6be848\n+3c532791d1f3a5881dd304dcf4c1d5ed\n $tcDistributiveB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"DistributiveB\"#]\n-334c525f32c955f70d83ccc0234c8e48\n+70a08e43f0d344419e11537179072532\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d96f230cac9c4ad4e76c8ddeb5578ffa\n+c55af8a291c93fab19bd0c6c573aca9f\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-0d39d391acce993f4efd9b297573f858\n+37dd3e0cf096fe907c6a2358b601147c\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.DistributiveB\"#]\n-133f381ddb7e88d95a39cd5c5db42945\n+0e75800ba3e2346ec1be8626534c1f28\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-2aa03346a362cb7f8a339251fd74b4b1\n+9fc7f8841aba83a2ec851a5bc589fc86\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-593c2a42749e8b7a16e811c153359693\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+145bf29d1001acc3400ca5acbb5d21c4\n type CanDeriveDistributiveB :: forall {k1}.\n ((k1 -> *) -> *) -> (* -> *) -> (k1 -> *) -> GHC.Types.Constraint\n type CanDeriveDistributiveB b f g =\n (Data.Generics.GenericN.GenericP 0 (b g),\n Data.Generics.GenericN.GenericP\n 0 (b (Data.Functor.Compose.Compose f g)),\n Barbies.Generics.Distributive.GDistributive\n 0\n f\n (Data.Generics.GenericN.RepP 0 (b g))\n (Data.Generics.GenericN.RepP\n 0 (b (Data.Functor.Compose.Compose f g))))\n :: GHC.Types.Constraint\n-e01ed0fa1927b910f29b673ced05da93\n+b7a598d798980f56a6401cbf7835693e\n type DistributiveB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => DistributiveB b where\n bdistribute :: forall (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n default bdistribute :: forall (f :: * -> *) (g :: k -> *).\n (CanDeriveDistributiveB b f g, GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n-a69bf4edf097f85b68c1f6d227fea6a2\n+391e4937f9da7a79437be14e9018a5cb\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-6a6e1ed60e51c8555cf9a3d04180b293\n+9bef958942dc22bc4050762689da3a2f\n bcotraverse ::\n (DistributiveB b, GHC.Base.Functor f) =>\n (forall a. f (g a) -> f a) -> f (b g) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -907,30 +907,30 @@\n (Data.Functor.Compose.N:Compose[0] <*>_N <*>_N _R _N _N))\n } in\n let {\n g1 :: f (b g) -> b (Data.Functor.Compose.Compose f g) []\n = bdistribute @(*) @b $dDistributiveB @f @g $dFunctor\n } in\n \\ (x['GHC.Types.Many] :: f (b g)) -> f1 (g1 x)]\n-4525724422846199c152367c0cfc580e\n+80a6df96155abf2f285527f8f93928ce\n bdecompose ::\n DistributiveB b =>\n (a -> b Data.Functor.Identity.Identity) -> b ((->) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @a\n ($dDistributiveB['GHC.Types.Many] :: DistributiveB b) ->\n bdistribute'\n @b\n @((->) a)\n $dDistributiveB\n (GHC.Base.$fFunctorFUN @a)]\n-acd335bf472873b0ccbb4826f56e568f\n+0f625c23ac3a31c75ea3489b08c4b087\n bdistribute' ::\n (DistributiveB b, GHC.Base.Functor f) =>\n f (b Data.Functor.Identity.Identity) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -979,15 +979,15 @@\n $dDistributiveB\n @f\n @Data.Functor.Identity.Identity\n $dFunctor\n } in\n \\ (x['GHC.Types.Many] :: f (b Data.Functor.Identity.Identity)) ->\n f1 (g x)]\n-a55756af0f4a37162824111628b88eee\n+465ed5a39f84a9aa1b689f8ef17beb6c\n brecompose ::\n Barbies.Internal.FunctorB.FunctorB b =>\n b ((->) a) -> a -> b Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1004,28 +1004,28 @@\n (\\ @a2 (x['GHC.Types.Many] :: a -> a2) -> x a1)\n `cast`\n (forall (a2 :: <*>_N).\n a2>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R))\n bfs]\n-fb1b97c5bd212bae2ac7ae2e0a201ebe\n+69dccefb970d040aadd568bbc2ded2db\n fstF ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair x _y -> x }]\n-746005dc102df7ce2ca7731122b0a5d6\n+32a567d5d021c385e8dc7a7053b49f4b\n gbdistributeDefault ::\n forall {k1} (b :: (k1 -> *) -> *) (f :: * -> *) (g :: k1 -> *).\n (CanDeriveDistributiveB b f g, GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1254,15 +1254,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-03b7a4e328c1bf3a0b7b8084069e2f01\n+5194cbbbb85c54f83450173bf83481b3\n sndF ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.dyn_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Internal.DistributiveB [orphan module] 9066\n- interface hash: fa914345b6915eb49a865daa6879b578\n- ABI hash: 756f71b11ce54e0a43610a99703c6dd7\n- export-list hash: 61e86516bb9242bfd66af8550d57db65\n- orphan hash: 9c848d6360e7976df2b0c1adb123a733\n- flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n+ interface hash: f2fa56833f6294819f6e59dfb902defb\n+ ABI hash: 784ec817335692db89a46f566642924c\n+ export-list hash: 1aecfa1521218373d8fc39d7c9313113\n+ orphan hash: ed74f00994c6c0489d6087cb335abd40\n+ flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 09bdb01a99bc2ced42488e207e49fe39\n sig of: Nothing\n used TH splices: False\n where\n@@ -21,17 +21,17 @@\n bcotraverse\n bdecompose\n bdistribute'\n brecompose\n gbdistributeDefault\n CanDeriveDistributiveB\n DistributiveB{bdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float Data.Orphans\n GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n@@ -39,43 +39,43 @@\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception GHC.IsList\n GHC.RTS.Flags GHC.Stats Control.DeepSeq Data.Tagged\n Control.Applicative.Backwards Control.Monad.Trans.Identity\n Control.Monad.Trans.Reader Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive bc4b8750effdecf47b6444706f50b239\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 8920dca54430650db1672b0181edd98f\n- gdistribute 88c43b505c766c52951b46c9a80b6975\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive 6ea5c0f8a0da8726f912791430769bee\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive 99fd67a91a625d0976ec289825432d45\n+ gdistribute c0adfdc0ac5a3513a556e091d34d614a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Distributive 04fa65c32a90c60ba98393f96353840a\n-4815b70d00715124afc473faeb0a32bf\n+8c51c4ab3f926a204b1f58843760d895\n $dmbdistribute ::\n forall k (b :: (k -> *) -> *) (f :: * -> *) (g :: k -> *).\n (DistributiveB b, CanDeriveDistributiveB b f g,\n GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -305,15 +305,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-7c6fe62d8a3636aed33f9acbb5b356a7\n+43ae0e854de69204c12d3047f04a7c9f\n $fDistributiveBkCompose ::\n forall k (h :: * -> *) (b :: (k -> *) -> *).\n (Data.Distributive.Distributive h, DistributiveB b) =>\n DistributiveB (Data.Functor.Compose.Compose h b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -332,15 +332,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkCompose_$cbdistribute @k @h @b v v1)]\n-3c3614320eec6dd94094680642e34aa1\n+4e449ecd9410e65ae792f5705d052d01\n $fDistributiveBkCompose1 ::\n forall {k} {h :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (Data.Distributive.Distributive h, DistributiveB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose h b f1 -> h (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -367,15 +367,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-989a3b45f1fd2a39ce05515cb05ca5dc\n+f08320980e6e8019dd0b4b82b4b809a2\n $fDistributiveBkCompose_$cbdistribute ::\n forall k (h :: * -> *) (b :: (k -> *) -> *) (f :: * -> *)\n (g :: k -> *).\n (Data.Distributive.Distributive h, DistributiveB b,\n GHC.Base.Functor f) =>\n f (Data.Functor.Compose.Compose h b g)\n -> Data.Functor.Compose.Compose\n@@ -426,15 +426,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n *>_N\n _R\n _N\n _N))]\n-79c62627109c71f2e9079edc27df59df\n+e4242e65a01627a5c372bd5da424232f\n $fDistributiveBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (DistributiveB a, DistributiveB b) =>\n DistributiveB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -448,15 +448,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fDistributiveBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkProduct_$cbdistribute @k @a @b v v1)]\n-177c0a290015fdebfe1324e8f02d5f00\n+ff6dffb0ee7986cdd6dd8c9a29b3800c\n $fDistributiveBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (DistributiveB a, DistributiveB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -490,15 +490,15 @@\n (($p1DistributiveB @k @b $dDistributiveB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-172fd7b38ef20500cddd93cefb810f44\n+6a0accfb0915ae65aa3af59ce85e4b9d\n $fDistributiveBkProduct_$cbdistribute ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: * -> *)\n (g :: k -> *).\n (DistributiveB a, DistributiveB b, GHC.Base.Functor f) =>\n f (Data.Functor.Product.Product a b g)\n -> Data.Functor.Product.Product\n a b (Data.Functor.Compose.Compose f g)\n@@ -545,43 +545,43 @@\n (GHC.Base.fmap\n @f\n $dFunctor\n @(Data.Functor.Product.Product a b g)\n @(b g)\n (sndF @(k -> *) @a @b @g)\n xy))]\n-8a3f5b313595c4d61de5fc340a14878e\n+a3adaa62e78e6d8eadd672d61994565b\n $fDistributiveBkProxy :: DistributiveB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkProxy_$cbdistribute @k)]\n-2005f3bf32e3783a22246cf7c468e6b8\n+67030c0d14c8133390ebe1075100fddd\n $fDistributiveBkProxy_$cbdistribute ::\n forall k (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (Data.Proxy.Proxy g)\n -> Data.Proxy.Proxy (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @f :: * -> *\n @g :: k -> *\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n (ds['GHC.Types.Many] :: f (Data.Proxy.Proxy g)) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Compose.Compose f g)]\n-9fa4a78cc22240fd4796f410a9f3713a\n+52b18fd4c7f153a9326e29f401469bb9\n $fGDistributivek0fRecRec ::\n forall k1 k (f :: * -> *) (b :: (k1 -> *) -> *)\n (b' :: (k1 -> *) -> *) (g :: k1 -> *).\n (GHC.Base.Functor f, DistributiveB b) =>\n Barbies.Generics.Distributive.GDistributive\n 0\n f\n@@ -605,15 +605,15 @@\n @f\n @(Data.Generics.GenericN.Rec (b' (P 0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b' (P 0 (Data.Functor.Compose.Compose f g)))\n (b (Data.Functor.Compose.Compose f g)))\n v\n ($fGDistributivek0fRecRec_$cgdistribute @k1 @k @f @b @b' @g v v1)]\n-6445fcdf2d9bce8b2147775be7818307\n+da45175ec0344bee89dd5e650585fc42\n $fGDistributivek0fRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (b :: (k1 -> *) -> *)\n (b' :: (k1 -> *) -> *) (g :: k1 -> *) (x :: k).\n (GHC.Base.Functor f, DistributiveB b) =>\n Data.Proxy.Proxy 0\n -> f (Data.Generics.GenericN.Rec (b' (P 0 g)) (b g) x)\n -> Data.Generics.GenericN.Rec\n@@ -670,15 +670,15 @@\n _N\n _P) _N _N)]\n-77133ce962711c1f2e4decd8715ae211\n+f425c54df211500680f72b6ca739a35a\n $fGDistributiveknfRecRec ::\n forall k1 k (f :: * -> *) (h :: * -> *) (b :: (k1 -> *) -> *)\n (n :: GHC.TypeNats.Nat) (g :: k1 -> *).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveB b) =>\n Barbies.Generics.Distributive.GDistributive\n n\n@@ -717,15 +717,15 @@\n @h\n @b\n @n\n @g\n v\n v1\n v2)]\n-6f2a7aae66b247bb12cb7e29c247d55e\n+5699d22ce900ed8ac56ba5e7e26dc2d3\n $fGDistributiveknfRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (h :: * -> *) (b :: (k1 -> *) -> *)\n (n :: GHC.TypeNats.Nat) (g :: k1 -> *) (x :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveB b) =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (h (b (P n g))) (h (b g)) x)\n@@ -800,91 +800,91 @@\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-8caab2e37b072045ab35c060756f6a68\n+ce8ea6b624f0b9f38efe1e95e9df4adc\n $tcDistributiveB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15471774058183975324#Word64\n- 12963566728231169884#Word64\n+ 3526910175284033893#Word64\n+ 1659290968467588520#Word64\n $trModule\n $tcDistributiveB2\n 1#\n $tcDistributiveB1]\n-05eb46d2a93037b8c6af74baa190754b\n+e052f7eefe330d2a9555fe6eab2834e9\n $tcDistributiveB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-9001dd58568d6cbc8461b8adc882a101\n+6db3f66364ef60dc160570004be8c77c\n $tcDistributiveB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcDistributiveB3]\n-b7f44c7d863d9eeaf0e1c0eb9d6be848\n+3c532791d1f3a5881dd304dcf4c1d5ed\n $tcDistributiveB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"DistributiveB\"#]\n-334c525f32c955f70d83ccc0234c8e48\n+70a08e43f0d344419e11537179072532\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d96f230cac9c4ad4e76c8ddeb5578ffa\n+c55af8a291c93fab19bd0c6c573aca9f\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-0d39d391acce993f4efd9b297573f858\n+37dd3e0cf096fe907c6a2358b601147c\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.DistributiveB\"#]\n-133f381ddb7e88d95a39cd5c5db42945\n+0e75800ba3e2346ec1be8626534c1f28\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-2aa03346a362cb7f8a339251fd74b4b1\n+9fc7f8841aba83a2ec851a5bc589fc86\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-593c2a42749e8b7a16e811c153359693\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+145bf29d1001acc3400ca5acbb5d21c4\n type CanDeriveDistributiveB :: forall {k1}.\n ((k1 -> *) -> *) -> (* -> *) -> (k1 -> *) -> GHC.Types.Constraint\n type CanDeriveDistributiveB b f g =\n (Data.Generics.GenericN.GenericP 0 (b g),\n Data.Generics.GenericN.GenericP\n 0 (b (Data.Functor.Compose.Compose f g)),\n Barbies.Generics.Distributive.GDistributive\n 0\n f\n (Data.Generics.GenericN.RepP 0 (b g))\n (Data.Generics.GenericN.RepP\n 0 (b (Data.Functor.Compose.Compose f g))))\n :: GHC.Types.Constraint\n-e01ed0fa1927b910f29b673ced05da93\n+b7a598d798980f56a6401cbf7835693e\n type DistributiveB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => DistributiveB b where\n bdistribute :: forall (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n default bdistribute :: forall (f :: * -> *) (g :: k -> *).\n (CanDeriveDistributiveB b f g, GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n-a69bf4edf097f85b68c1f6d227fea6a2\n+391e4937f9da7a79437be14e9018a5cb\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-6a6e1ed60e51c8555cf9a3d04180b293\n+9bef958942dc22bc4050762689da3a2f\n bcotraverse ::\n (DistributiveB b, GHC.Base.Functor f) =>\n (forall a. f (g a) -> f a) -> f (b g) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -907,30 +907,30 @@\n (Data.Functor.Compose.N:Compose[0] <*>_N <*>_N _R _N _N))\n } in\n let {\n g1 :: f (b g) -> b (Data.Functor.Compose.Compose f g) []\n = bdistribute @(*) @b $dDistributiveB @f @g $dFunctor\n } in\n \\ (x['GHC.Types.Many] :: f (b g)) -> f1 (g1 x)]\n-4525724422846199c152367c0cfc580e\n+80a6df96155abf2f285527f8f93928ce\n bdecompose ::\n DistributiveB b =>\n (a -> b Data.Functor.Identity.Identity) -> b ((->) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @a\n ($dDistributiveB['GHC.Types.Many] :: DistributiveB b) ->\n bdistribute'\n @b\n @((->) a)\n $dDistributiveB\n (GHC.Base.$fFunctorFUN @a)]\n-acd335bf472873b0ccbb4826f56e568f\n+0f625c23ac3a31c75ea3489b08c4b087\n bdistribute' ::\n (DistributiveB b, GHC.Base.Functor f) =>\n f (b Data.Functor.Identity.Identity) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -979,15 +979,15 @@\n $dDistributiveB\n @f\n @Data.Functor.Identity.Identity\n $dFunctor\n } in\n \\ (x['GHC.Types.Many] :: f (b Data.Functor.Identity.Identity)) ->\n f1 (g x)]\n-a55756af0f4a37162824111628b88eee\n+465ed5a39f84a9aa1b689f8ef17beb6c\n brecompose ::\n Barbies.Internal.FunctorB.FunctorB b =>\n b ((->) a) -> a -> b Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1004,28 +1004,28 @@\n (\\ @a2 (x['GHC.Types.Many] :: a -> a2) -> x a1)\n `cast`\n (forall (a2 :: <*>_N).\n a2>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R))\n bfs]\n-fb1b97c5bd212bae2ac7ae2e0a201ebe\n+69dccefb970d040aadd568bbc2ded2db\n fstF ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair x _y -> x }]\n-746005dc102df7ce2ca7731122b0a5d6\n+32a567d5d021c385e8dc7a7053b49f4b\n gbdistributeDefault ::\n forall {k1} (b :: (k1 -> *) -> *) (f :: * -> *) (g :: k1 -> *).\n (CanDeriveDistributiveB b f g, GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1254,15 +1254,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-03b7a4e328c1bf3a0b7b8084069e2f01\n+5194cbbbb85c54f83450173bf83481b3\n sndF ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.DistributiveT [orphan module] 9066\n- interface hash: 33a08a50d34e21cb03f501638294a4b4\n- ABI hash: 2d87ad7b0d939518df31ee312faa9bf2\n- export-list hash: 6c54e7bb9d2909cbdea3cafe4057c036\n- orphan hash: 4e93a4f7868d76801ede56e83eab969f\n+ interface hash: 9e5af98240db3d4c40dd150ef0364492\n+ ABI hash: d42051f3b0e0718fa7a27a87fb621d9a\n+ export-list hash: b8594c61579bef94621e4926ef69c181\n+ orphan hash: da79d9d59c647a6ff2c49f90f085994f\n flag hash: ecf82af067339e97e13072093c0463b4\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 0ae3776247dbe274aa58d6e6b79a6ccf\n sig of: Nothing\n used TH splices: False\n@@ -21,17 +21,17 @@\n gtdistributeDefault\n tcotraverse\n tdecompose\n tdistribute'\n trecompose\n CanDeriveDistributiveT\n DistributiveT{tdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float Data.Orphans\n GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n@@ -44,32 +44,32 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive bc4b8750effdecf47b6444706f50b239\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 8920dca54430650db1672b0181edd98f\n- gdistribute 88c43b505c766c52951b46c9a80b6975\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive 6ea5c0f8a0da8726f912791430769bee\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive 99fd67a91a625d0976ec289825432d45\n+ gdistribute c0adfdc0ac5a3513a556e091d34d614a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n@@ -84,17 +84,17 @@\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Control.Monad.Trans.State.Lazy 8427de03afe8955c0c64907138bb8d1e\n import -/ Control.Monad.Trans.State.Strict 29c1fe6de83c54f9690c1f1b22fcbe30\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-875cab97a999c8fe631b0518f507c13e\n+0b70a854699e46acfc890a99df1e43bd\n $dmtdistribute ::\n forall i (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (DistributiveT t, CanDeriveDistributiveT t f g x) =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -426,29 +426,29 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-de1f09f4a6d5bdb8ac7b28fa85b5431f\n+86b399f2f03edb070d3fb95702d316e2\n $fDistributiveTTYPEAccumT ::\n DistributiveT (Control.Monad.Trans.Accum.AccumT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(Control.Monad.Trans.Accum.AccumT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEAccumT_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEAccumT_$ctdistribute @w)]\n-865b8cd908067fa5777d96a0250941fa\n+52de6d4d1f96a0b6ae081d9b89209b48\n $fDistributiveTTYPEAccumT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.Accum.AccumT w g x)\n -> Control.Monad.Trans.Accum.AccumT\n w (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -483,15 +483,15 @@\n _R\n _N\n <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Accum.N:AccumT[0]\n _N\n _R\n _N))]\n-b482ff1bc303b1e44a365fede80a3a5b\n+8cfb1b1fcccceaade229d2dde0a452d7\n $fDistributiveTTYPEBackwards ::\n DistributiveT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -524,15 +524,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Applicative.Backwards.N:Backwards[0]\n <*>_N\n _R) _N))]\n-5db303c317887351417745c9b3b04a52\n+e0be609b31ba1e47c629402db2aaa749\n $fDistributiveTTYPECompose ::\n Data.Distributive.Distributive f =>\n DistributiveT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -546,15 +546,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPECompose_$ctdistribute @f v)]\n-d222acc067a7fb8402be8ab66e93c9d5\n+8bfde3dd0265f40d14089036fb40806e\n $fDistributiveTTYPECompose1 ::\n Data.Distributive.Distributive f =>\n (forall a. f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A)>,\n Unfolding: Core: \n@@ -571,15 +571,15 @@\n (Data.Distributive.$p1Distributive @f $dDistributive)\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0] <*>_N <*>_N _R _N _N)]\n-c7dd2bf35c73e0b52ed530c0fd71e130\n+b0c9260971b95cbcc4b1dabcfa3d1c9b\n $fDistributiveTTYPECompose_$ctdistribute ::\n (Data.Distributive.Distributive f, GHC.Base.Functor f1) =>\n f1 (Data.Functor.Compose.Compose f g x)\n -> Data.Functor.Compose.Compose\n f (Data.Functor.Compose.Compose f1 g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -629,15 +629,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n <*>_N\n _R\n _N\n _N))]\n-90b082ef5223da6887d00b6d4e203ae9\n+980a0a8614fefb0c28fa95ff20278665\n $fDistributiveTTYPEExceptT ::\n DistributiveT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @e.\n @(*)\n@@ -672,15 +672,15 @@\n _R\n _N\n _N)\n ; Sym (Control.Monad.Trans.Except.N:ExceptT[0]\n _N\n _R\n _N)))]\n-3ff53af44baf9910e731cf4b7ec73def\n+7fb85e10941e7a4511b2f11675ea3c9e\n $fDistributiveTTYPEIdentityT ::\n DistributiveT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -713,15 +713,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n <*>_N\n _R) _N))]\n-7fe71d37d186ffd484c686c052129d78\n+0c2a73b88facd5a238fdd5e2cf23d964\n $fDistributiveTTYPEMaybeT ::\n DistributiveT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -755,43 +755,43 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R\n _N)))]\n-6ce0f4d256a144758b4432a0b62e0010\n+4f22b961754f62318e261b07f69c7868\n $fDistributiveTTYPERWST ::\n DistributiveT (Control.Monad.Trans.RWS.Strict.RWST r w s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r @w @s.\n @(*)\n @(Control.Monad.Trans.RWS.Strict.RWST r w s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPERWST_$ctmap @r @w @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPERWST_$ctdistribute @r @w @s)]\n-adda8cac1ff95e1dcfe6fabee7a4577d\n+f4cc429dbd98944a5980079435b7c6c0\n $fDistributiveTTYPERWST0 ::\n DistributiveT (Control.Monad.Trans.RWS.Lazy.RWST r w s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r @w @s.\n @(*)\n @(Control.Monad.Trans.RWS.Lazy.RWST r w s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPERWST0_$ctmap @r @w @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPERWST0_$ctdistribute @r @w @s)]\n-611b224b07ba87e173cf7d60f50d884a\n+a11cc583152b826db4424a42a8004c8f\n $fDistributiveTTYPERWST0_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.RWS.Lazy.RWST r w s g x)\n -> Control.Monad.Trans.RWS.Lazy.RWST\n r w s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -837,15 +837,15 @@\n <(x, s, w)>_N)\n ; Sym (Control.Monad.Trans.RWS.Lazy.N:RWST[0]\n _R\n _N\n _N\n _R\n _N))]\n-d1585e11436db6a32061af1cb9d8d21c\n+35c706e7a867a058131dfd6a34d4caa4\n $fDistributiveTTYPERWST_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.RWS.Strict.RWST r w s g x)\n -> Control.Monad.Trans.RWS.Strict.RWST\n r w s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -891,29 +891,29 @@\n <(x, s, w)>_N)\n ; Sym (Control.Monad.Trans.RWS.Strict.N:RWST[0]\n _R\n _N\n _N\n _R\n _N))]\n-683350ebeff1cafc0eb3cbfecff8be7f\n+5b7eb218a567ad25f40278c17d8d6f38\n $fDistributiveTTYPEReaderT ::\n DistributiveT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r.\n @(*)\n @(Control.Monad.Trans.Reader.ReaderT r)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEReaderT_$ctmap @r)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEReaderT_$ctdistribute @r)]\n-b93f9b4100fd35e378a397132d5011dd\n+a8065815795f7f712965f81248b4d3b3\n $fDistributiveTTYPEReaderT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.Reader.ReaderT r g x)\n -> Control.Monad.Trans.Reader.ReaderT\n r (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -950,15 +950,15 @@\n _R\n _N\n _N)\n ; Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R\n _R\n _N))]\n-a3d3f82c8bb0fde3d7682c662ffae5d1\n+51309266854acadb47bc63ec535d7a1e\n $fDistributiveTTYPEReverse ::\n DistributiveT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -990,43 +990,43 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Data.Functor.Reverse.N:Reverse[0]\n <*>_N\n _R) _N))]\n-624012eade5e64dd6decab9bd85d2a6c\n+a3321c5452f92115db9ca3a36a956fe7\n $fDistributiveTTYPEStateT ::\n DistributiveT (Control.Monad.Trans.State.Strict.StateT s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(*)\n @(Control.Monad.Trans.State.Strict.StateT s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEStateT_$ctmap @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEStateT_$ctdistribute @s)]\n-02d758953b4b5bd530b578540f596964\n+7194a422ea5ceaafcfcf4cf341c100eb\n $fDistributiveTTYPEStateT0 ::\n DistributiveT (Control.Monad.Trans.State.Lazy.StateT s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(*)\n @(Control.Monad.Trans.State.Lazy.StateT s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEStateT0_$ctmap @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEStateT0_$ctdistribute @s)]\n-212ae98398583e3dd07000363f589d0c\n+44602dbbf15ae44898a629f45bf2a334\n $fDistributiveTTYPEStateT0_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.State.Lazy.StateT s g x)\n -> Control.Monad.Trans.State.Lazy.StateT\n s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -1063,15 +1063,15 @@\n _R\n _N\n <(x, s)>_N)\n ; Sym (Control.Monad.Trans.State.Lazy.N:StateT[0]\n _N\n _R\n _N))]\n-3a8b27777f4da31187bf8b2035a3cd64\n+09388c27c99435f7156191a1d3aa8a17\n $fDistributiveTTYPEStateT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.State.Strict.StateT s g x)\n -> Control.Monad.Trans.State.Strict.StateT\n s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -1108,15 +1108,15 @@\n _R\n _N\n <(x, s)>_N)\n ; Sym (Control.Monad.Trans.State.Strict.N:StateT[0]\n _N\n _R\n _N))]\n-b67c1b50139363bcd4e7c91040281329\n+b43761821ae1972bede863290963e086\n $fDistributiveTTYPEWriterT ::\n DistributiveT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n@@ -1151,15 +1151,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Writer.Strict.N:WriterT[0]\n _N\n _R\n _N)))]\n-f61a35ea9b7afc84ce7a6a4aef819244\n+8ea88993951765bc92cce387c381d6bb\n $fDistributiveTTYPEWriterT0 ::\n DistributiveT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n@@ -1194,15 +1194,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Writer.Lazy.N:WriterT[0]\n _N\n _R\n _N)))]\n-d8b67c00cc9a6185655c7ad875fec864\n+b276e5e4fe6c6e705de2c54416530ce4\n $fGDistributivek1fRecRec ::\n forall i k (f :: * -> *) (h :: * -> *) (t :: (* -> *) -> i -> *)\n (g :: * -> *) (x :: i).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveT t) =>\n Barbies.Generics.Distributive.GDistributive\n 1\n@@ -1241,15 +1241,15 @@\n @h\n @t\n @g\n @x\n v\n v1\n v2)]\n-bfda6b7220231fe08b249433690340da\n+83cb6ea2b151420bb47b19025b2a4947\n $fGDistributivek1fRecRec0 ::\n forall i k (f :: * -> *) (t :: (* -> *) -> i -> *) (g :: * -> *)\n (x :: i).\n (GHC.Base.Functor f, DistributiveT t) =>\n Barbies.Generics.Distributive.GDistributive\n 1\n f\n@@ -1273,15 +1273,15 @@\n @f\n @(Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x))\n @(Data.Generics.GenericN.Rec\n (t (P 1 (Data.Functor.Compose.Compose f g)) x)\n (t (Data.Functor.Compose.Compose f g) x))\n v\n ($fGDistributivek1fRecRec0_$cgdistribute @i @k @f @t @g @x v v1)]\n-e2520e95b79756ba6fac115adee792ae\n+b096eb80ae8477f5302bae3d92818225\n $fGDistributivek1fRecRec0_$cgdistribute ::\n forall i k (f :: * -> *) (t :: (* -> *) -> i -> *) (g :: * -> *)\n (x :: i) (x1 :: k).\n (GHC.Base.Functor f, DistributiveT t) =>\n Data.Proxy.Proxy 1\n -> f (Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x) x1)\n -> Data.Generics.GenericN.Rec\n@@ -1335,15 +1335,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-940277874354f5d28b2feb669ced42bf\n+7c01833e764f0800ee5c6816b73255e2\n $fGDistributivek1fRecRec_$cgdistribute ::\n forall i k (f :: * -> *) (h :: * -> *) (t :: (* -> *) -> i -> *)\n (g :: * -> *) (x :: i) (x1 :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveT t) =>\n Data.Proxy.Proxy 1\n -> f (Data.Generics.GenericN.Rec (h (t (P 1 g) x)) (h (t g x)) x1)\n@@ -1420,92 +1420,92 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-7657308133dfe502ccb20ecc24da0d75\n+6c26cdffb0bcd8417468d480f62a66e0\n $tcDistributiveT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11404435686323447200#Word64\n- 7673338768845277249#Word64\n+ 12799498695229957832#Word64\n+ 13843044837134932019#Word64\n $trModule\n $tcDistributiveT2\n 1#\n $tcDistributiveT1]\n-e7645151f743523f14bec9154bcb427a\n+d39d8bf76b6c8d18210975e432577ef7\n $tcDistributiveT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-e017b9f4f9b090c64a525a23431ec48d\n+9411baaaf2d3e2b7f4e861f3bd3ca1ae\n $tcDistributiveT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcDistributiveT3]\n-e2ce07879d8ee8cfa38151e6eb962f4f\n+734138eaca1f0fdea56568b7fcf21349\n $tcDistributiveT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"DistributiveT\"#]\n-68214723152a8160d55b7c260dae2ef7\n+7d2ec9676d5fffe30bcdcd14e6681df7\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d1fd14bd5191b52ebd3f72364e7e9cdb\n+55153a8aeac5e6fde33dc59ed5beaf97\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-7061d5152dd3413c5d2e38864d9e489d\n+4333d7418cc0a8b889052d3e711c82e9\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.DistributiveT\"#]\n-46c946704ce1a66ea430a42e5ca8227e\n+9072a84ab6d2bdc9ba1adedcde474f82\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-5e3ba795c34bf00298e79e16420932d3\n+bd05fd02ec4223a168c89f3c366c8302\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-5c73b075ffb410ca35cd04643f221365\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+1b6ef668f2885d52365d6c6bbfa19391\n type CanDeriveDistributiveT :: forall i.\n ((* -> *) -> i -> *)\n -> (* -> *) -> (* -> *) -> i -> GHC.Types.Constraint\n type CanDeriveDistributiveT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t g x),\n Data.Generics.GenericN.GenericP\n 1 (t (Data.Functor.Compose.Compose f g) x),\n Barbies.Generics.Distributive.GDistributive\n 1\n f\n (Data.Generics.GenericN.RepP 1 (t g x))\n (Data.Generics.GenericN.RepP\n 1 (t (Data.Functor.Compose.Compose f g) x)))\n :: GHC.Types.Constraint\n-375f90ea1d05e60dc2c4545948c0f64a\n+bc1ead53dbcac53eb866a8dcc1c81565\n type DistributiveT :: forall i.\n ((* -> *) -> i -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => DistributiveT t where\n tdistribute :: forall (f :: * -> *) (g :: * -> *) (x :: i).\n GHC.Base.Functor f =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n default tdistribute :: forall (f :: * -> *) (g :: * -> *) (x :: i).\n CanDeriveDistributiveT t f g x =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n-2b60b8a3818a60f04c74b8e1aea7247b\n+4fff01273faff63c5d8891d0b590f334\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-64230bfb2bea2a9ff26593cc987cf9bf\n+35a4770983e02b4310a4542f4d575813\n gtdistributeDefault ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n CanDeriveDistributiveT t f g x =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n@@ -1837,15 +1837,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-73d6c732cec8f656dc5ba8f5d3624a1e\n+f03b4ebaf6b48c851a4327dd347db724\n tcotraverse ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (DistributiveT t, GHC.Base.Functor f) =>\n (forall a. f (g a) -> f a) -> f (t g x) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1875,15 +1875,15 @@\n (Data.Functor.Compose.N:Compose[0] <*>_N <*>_N _R _N _N))\n } in\n let {\n g1 :: f (t g x) -> t (Data.Functor.Compose.Compose f g) x []\n = tdistribute @i @t $dDistributiveT @f @g @x $dFunctor\n } in\n \\ (x1['GHC.Types.Many] :: f (t g x)) -> f1 (g1 x1)]\n-5bac02433dfcce8672b96aacbc7690ac\n+aab4f45b55235de00615e82b86ef7600\n tdecompose ::\n forall {i} (t :: (* -> *) -> i -> *) a (x :: i).\n DistributiveT t =>\n (a -> t Data.Functor.Identity.Identity x) -> t ((->) a) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -1895,15 +1895,15 @@\n tdistribute'\n @i\n @t\n @((->) a)\n @x\n $dDistributiveT\n (GHC.Base.$fFunctorFUN @a)]\n-e714a56db976e405999674ba0f38e4c2\n+3e95649dc738a015868d28ba7461e91c\n tdistribute' ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (x :: i).\n (DistributiveT t, GHC.Base.Functor f) =>\n f (t Data.Functor.Identity.Identity x) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -1961,15 +1961,15 @@\n @Data.Functor.Identity.Identity\n @x\n $dFunctor\n } in\n \\ (x1['GHC.Types.Many] :: f (t Data.Functor.Identity.Identity\n x)) ->\n f1 (g x1)]\n-0c7137381fb9c3602e0f4e823599884a\n+52a99d2a2d30e70f8a8fe8bdf5c43719\n trecompose ::\n forall {k'} (t :: (* -> *) -> k' -> *) a (x :: k').\n Barbies.Internal.FunctorT.FunctorT t =>\n t ((->) a) x -> a -> t Data.Functor.Identity.Identity x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>,\n Unfolding: Core: \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.DistributiveT [orphan module] 9066\n- interface hash: 33a08a50d34e21cb03f501638294a4b4\n- ABI hash: 2d87ad7b0d939518df31ee312faa9bf2\n- export-list hash: 6c54e7bb9d2909cbdea3cafe4057c036\n- orphan hash: 4e93a4f7868d76801ede56e83eab969f\n+ interface hash: 9e5af98240db3d4c40dd150ef0364492\n+ ABI hash: d42051f3b0e0718fa7a27a87fb621d9a\n+ export-list hash: b8594c61579bef94621e4926ef69c181\n+ orphan hash: da79d9d59c647a6ff2c49f90f085994f\n flag hash: 214c3804eede05a71bc2a2499ad79a27\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 0ae3776247dbe274aa58d6e6b79a6ccf\n sig of: Nothing\n used TH splices: False\n@@ -21,17 +21,17 @@\n gtdistributeDefault\n tcotraverse\n tdecompose\n tdistribute'\n trecompose\n CanDeriveDistributiveT\n DistributiveT{tdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float Data.Orphans\n GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n@@ -44,32 +44,32 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive bc4b8750effdecf47b6444706f50b239\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 8920dca54430650db1672b0181edd98f\n- gdistribute 88c43b505c766c52951b46c9a80b6975\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive 6ea5c0f8a0da8726f912791430769bee\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive 99fd67a91a625d0976ec289825432d45\n+ gdistribute c0adfdc0ac5a3513a556e091d34d614a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n@@ -84,17 +84,17 @@\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Control.Monad.Trans.State.Lazy 8427de03afe8955c0c64907138bb8d1e\n import -/ Control.Monad.Trans.State.Strict 29c1fe6de83c54f9690c1f1b22fcbe30\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-875cab97a999c8fe631b0518f507c13e\n+0b70a854699e46acfc890a99df1e43bd\n $dmtdistribute ::\n forall i (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (DistributiveT t, CanDeriveDistributiveT t f g x) =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -426,29 +426,29 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-de1f09f4a6d5bdb8ac7b28fa85b5431f\n+86b399f2f03edb070d3fb95702d316e2\n $fDistributiveTTYPEAccumT ::\n DistributiveT (Control.Monad.Trans.Accum.AccumT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(Control.Monad.Trans.Accum.AccumT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEAccumT_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEAccumT_$ctdistribute @w)]\n-865b8cd908067fa5777d96a0250941fa\n+52de6d4d1f96a0b6ae081d9b89209b48\n $fDistributiveTTYPEAccumT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.Accum.AccumT w g x)\n -> Control.Monad.Trans.Accum.AccumT\n w (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -483,15 +483,15 @@\n _R\n _N\n <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Accum.N:AccumT[0]\n _N\n _R\n _N))]\n-b482ff1bc303b1e44a365fede80a3a5b\n+8cfb1b1fcccceaade229d2dde0a452d7\n $fDistributiveTTYPEBackwards ::\n DistributiveT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -524,15 +524,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Applicative.Backwards.N:Backwards[0]\n <*>_N\n _R) _N))]\n-5db303c317887351417745c9b3b04a52\n+e0be609b31ba1e47c629402db2aaa749\n $fDistributiveTTYPECompose ::\n Data.Distributive.Distributive f =>\n DistributiveT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -546,15 +546,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPECompose_$ctdistribute @f v)]\n-d222acc067a7fb8402be8ab66e93c9d5\n+8bfde3dd0265f40d14089036fb40806e\n $fDistributiveTTYPECompose1 ::\n Data.Distributive.Distributive f =>\n (forall a. f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A)>,\n Unfolding: Core: \n@@ -571,15 +571,15 @@\n (Data.Distributive.$p1Distributive @f $dDistributive)\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0] <*>_N <*>_N _R _N _N)]\n-c7dd2bf35c73e0b52ed530c0fd71e130\n+b0c9260971b95cbcc4b1dabcfa3d1c9b\n $fDistributiveTTYPECompose_$ctdistribute ::\n (Data.Distributive.Distributive f, GHC.Base.Functor f1) =>\n f1 (Data.Functor.Compose.Compose f g x)\n -> Data.Functor.Compose.Compose\n f (Data.Functor.Compose.Compose f1 g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -629,15 +629,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n <*>_N\n _R\n _N\n _N))]\n-90b082ef5223da6887d00b6d4e203ae9\n+980a0a8614fefb0c28fa95ff20278665\n $fDistributiveTTYPEExceptT ::\n DistributiveT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @e.\n @(*)\n@@ -672,15 +672,15 @@\n _R\n _N\n _N)\n ; Sym (Control.Monad.Trans.Except.N:ExceptT[0]\n _N\n _R\n _N)))]\n-3ff53af44baf9910e731cf4b7ec73def\n+7fb85e10941e7a4511b2f11675ea3c9e\n $fDistributiveTTYPEIdentityT ::\n DistributiveT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -713,15 +713,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n <*>_N\n _R) _N))]\n-7fe71d37d186ffd484c686c052129d78\n+0c2a73b88facd5a238fdd5e2cf23d964\n $fDistributiveTTYPEMaybeT ::\n DistributiveT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -755,43 +755,43 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R\n _N)))]\n-6ce0f4d256a144758b4432a0b62e0010\n+4f22b961754f62318e261b07f69c7868\n $fDistributiveTTYPERWST ::\n DistributiveT (Control.Monad.Trans.RWS.Strict.RWST r w s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r @w @s.\n @(*)\n @(Control.Monad.Trans.RWS.Strict.RWST r w s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPERWST_$ctmap @r @w @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPERWST_$ctdistribute @r @w @s)]\n-adda8cac1ff95e1dcfe6fabee7a4577d\n+f4cc429dbd98944a5980079435b7c6c0\n $fDistributiveTTYPERWST0 ::\n DistributiveT (Control.Monad.Trans.RWS.Lazy.RWST r w s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r @w @s.\n @(*)\n @(Control.Monad.Trans.RWS.Lazy.RWST r w s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPERWST0_$ctmap @r @w @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPERWST0_$ctdistribute @r @w @s)]\n-611b224b07ba87e173cf7d60f50d884a\n+a11cc583152b826db4424a42a8004c8f\n $fDistributiveTTYPERWST0_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.RWS.Lazy.RWST r w s g x)\n -> Control.Monad.Trans.RWS.Lazy.RWST\n r w s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -837,15 +837,15 @@\n <(x, s, w)>_N)\n ; Sym (Control.Monad.Trans.RWS.Lazy.N:RWST[0]\n _R\n _N\n _N\n _R\n _N))]\n-d1585e11436db6a32061af1cb9d8d21c\n+35c706e7a867a058131dfd6a34d4caa4\n $fDistributiveTTYPERWST_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.RWS.Strict.RWST r w s g x)\n -> Control.Monad.Trans.RWS.Strict.RWST\n r w s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -891,29 +891,29 @@\n <(x, s, w)>_N)\n ; Sym (Control.Monad.Trans.RWS.Strict.N:RWST[0]\n _R\n _N\n _N\n _R\n _N))]\n-683350ebeff1cafc0eb3cbfecff8be7f\n+5b7eb218a567ad25f40278c17d8d6f38\n $fDistributiveTTYPEReaderT ::\n DistributiveT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r.\n @(*)\n @(Control.Monad.Trans.Reader.ReaderT r)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEReaderT_$ctmap @r)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEReaderT_$ctdistribute @r)]\n-b93f9b4100fd35e378a397132d5011dd\n+a8065815795f7f712965f81248b4d3b3\n $fDistributiveTTYPEReaderT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.Reader.ReaderT r g x)\n -> Control.Monad.Trans.Reader.ReaderT\n r (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -950,15 +950,15 @@\n _R\n _N\n _N)\n ; Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R\n _R\n _N))]\n-a3d3f82c8bb0fde3d7682c662ffae5d1\n+51309266854acadb47bc63ec535d7a1e\n $fDistributiveTTYPEReverse ::\n DistributiveT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -990,43 +990,43 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Data.Functor.Reverse.N:Reverse[0]\n <*>_N\n _R) _N))]\n-624012eade5e64dd6decab9bd85d2a6c\n+a3321c5452f92115db9ca3a36a956fe7\n $fDistributiveTTYPEStateT ::\n DistributiveT (Control.Monad.Trans.State.Strict.StateT s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(*)\n @(Control.Monad.Trans.State.Strict.StateT s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEStateT_$ctmap @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEStateT_$ctdistribute @s)]\n-02d758953b4b5bd530b578540f596964\n+7194a422ea5ceaafcfcf4cf341c100eb\n $fDistributiveTTYPEStateT0 ::\n DistributiveT (Control.Monad.Trans.State.Lazy.StateT s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(*)\n @(Control.Monad.Trans.State.Lazy.StateT s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEStateT0_$ctmap @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEStateT0_$ctdistribute @s)]\n-212ae98398583e3dd07000363f589d0c\n+44602dbbf15ae44898a629f45bf2a334\n $fDistributiveTTYPEStateT0_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.State.Lazy.StateT s g x)\n -> Control.Monad.Trans.State.Lazy.StateT\n s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -1063,15 +1063,15 @@\n _R\n _N\n <(x, s)>_N)\n ; Sym (Control.Monad.Trans.State.Lazy.N:StateT[0]\n _N\n _R\n _N))]\n-3a8b27777f4da31187bf8b2035a3cd64\n+09388c27c99435f7156191a1d3aa8a17\n $fDistributiveTTYPEStateT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.State.Strict.StateT s g x)\n -> Control.Monad.Trans.State.Strict.StateT\n s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -1108,15 +1108,15 @@\n _R\n _N\n <(x, s)>_N)\n ; Sym (Control.Monad.Trans.State.Strict.N:StateT[0]\n _N\n _R\n _N))]\n-b67c1b50139363bcd4e7c91040281329\n+b43761821ae1972bede863290963e086\n $fDistributiveTTYPEWriterT ::\n DistributiveT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n@@ -1151,15 +1151,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Writer.Strict.N:WriterT[0]\n _N\n _R\n _N)))]\n-f61a35ea9b7afc84ce7a6a4aef819244\n+8ea88993951765bc92cce387c381d6bb\n $fDistributiveTTYPEWriterT0 ::\n DistributiveT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n@@ -1194,15 +1194,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Writer.Lazy.N:WriterT[0]\n _N\n _R\n _N)))]\n-d8b67c00cc9a6185655c7ad875fec864\n+b276e5e4fe6c6e705de2c54416530ce4\n $fGDistributivek1fRecRec ::\n forall i k (f :: * -> *) (h :: * -> *) (t :: (* -> *) -> i -> *)\n (g :: * -> *) (x :: i).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveT t) =>\n Barbies.Generics.Distributive.GDistributive\n 1\n@@ -1241,15 +1241,15 @@\n @h\n @t\n @g\n @x\n v\n v1\n v2)]\n-bfda6b7220231fe08b249433690340da\n+83cb6ea2b151420bb47b19025b2a4947\n $fGDistributivek1fRecRec0 ::\n forall i k (f :: * -> *) (t :: (* -> *) -> i -> *) (g :: * -> *)\n (x :: i).\n (GHC.Base.Functor f, DistributiveT t) =>\n Barbies.Generics.Distributive.GDistributive\n 1\n f\n@@ -1273,15 +1273,15 @@\n @f\n @(Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x))\n @(Data.Generics.GenericN.Rec\n (t (P 1 (Data.Functor.Compose.Compose f g)) x)\n (t (Data.Functor.Compose.Compose f g) x))\n v\n ($fGDistributivek1fRecRec0_$cgdistribute @i @k @f @t @g @x v v1)]\n-e2520e95b79756ba6fac115adee792ae\n+b096eb80ae8477f5302bae3d92818225\n $fGDistributivek1fRecRec0_$cgdistribute ::\n forall i k (f :: * -> *) (t :: (* -> *) -> i -> *) (g :: * -> *)\n (x :: i) (x1 :: k).\n (GHC.Base.Functor f, DistributiveT t) =>\n Data.Proxy.Proxy 1\n -> f (Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x) x1)\n -> Data.Generics.GenericN.Rec\n@@ -1335,15 +1335,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-940277874354f5d28b2feb669ced42bf\n+7c01833e764f0800ee5c6816b73255e2\n $fGDistributivek1fRecRec_$cgdistribute ::\n forall i k (f :: * -> *) (h :: * -> *) (t :: (* -> *) -> i -> *)\n (g :: * -> *) (x :: i) (x1 :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveT t) =>\n Data.Proxy.Proxy 1\n -> f (Data.Generics.GenericN.Rec (h (t (P 1 g) x)) (h (t g x)) x1)\n@@ -1420,92 +1420,92 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-7657308133dfe502ccb20ecc24da0d75\n+6c26cdffb0bcd8417468d480f62a66e0\n $tcDistributiveT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11404435686323447200#Word64\n- 7673338768845277249#Word64\n+ 12799498695229957832#Word64\n+ 13843044837134932019#Word64\n $trModule\n $tcDistributiveT2\n 1#\n $tcDistributiveT1]\n-e7645151f743523f14bec9154bcb427a\n+d39d8bf76b6c8d18210975e432577ef7\n $tcDistributiveT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-e017b9f4f9b090c64a525a23431ec48d\n+9411baaaf2d3e2b7f4e861f3bd3ca1ae\n $tcDistributiveT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcDistributiveT3]\n-e2ce07879d8ee8cfa38151e6eb962f4f\n+734138eaca1f0fdea56568b7fcf21349\n $tcDistributiveT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"DistributiveT\"#]\n-68214723152a8160d55b7c260dae2ef7\n+7d2ec9676d5fffe30bcdcd14e6681df7\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d1fd14bd5191b52ebd3f72364e7e9cdb\n+55153a8aeac5e6fde33dc59ed5beaf97\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-7061d5152dd3413c5d2e38864d9e489d\n+4333d7418cc0a8b889052d3e711c82e9\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.DistributiveT\"#]\n-46c946704ce1a66ea430a42e5ca8227e\n+9072a84ab6d2bdc9ba1adedcde474f82\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-5e3ba795c34bf00298e79e16420932d3\n+bd05fd02ec4223a168c89f3c366c8302\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-5c73b075ffb410ca35cd04643f221365\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+1b6ef668f2885d52365d6c6bbfa19391\n type CanDeriveDistributiveT :: forall i.\n ((* -> *) -> i -> *)\n -> (* -> *) -> (* -> *) -> i -> GHC.Types.Constraint\n type CanDeriveDistributiveT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t g x),\n Data.Generics.GenericN.GenericP\n 1 (t (Data.Functor.Compose.Compose f g) x),\n Barbies.Generics.Distributive.GDistributive\n 1\n f\n (Data.Generics.GenericN.RepP 1 (t g x))\n (Data.Generics.GenericN.RepP\n 1 (t (Data.Functor.Compose.Compose f g) x)))\n :: GHC.Types.Constraint\n-375f90ea1d05e60dc2c4545948c0f64a\n+bc1ead53dbcac53eb866a8dcc1c81565\n type DistributiveT :: forall i.\n ((* -> *) -> i -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => DistributiveT t where\n tdistribute :: forall (f :: * -> *) (g :: * -> *) (x :: i).\n GHC.Base.Functor f =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n default tdistribute :: forall (f :: * -> *) (g :: * -> *) (x :: i).\n CanDeriveDistributiveT t f g x =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n-2b60b8a3818a60f04c74b8e1aea7247b\n+4fff01273faff63c5d8891d0b590f334\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-64230bfb2bea2a9ff26593cc987cf9bf\n+35a4770983e02b4310a4542f4d575813\n gtdistributeDefault ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n CanDeriveDistributiveT t f g x =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n@@ -1837,15 +1837,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-73d6c732cec8f656dc5ba8f5d3624a1e\n+f03b4ebaf6b48c851a4327dd347db724\n tcotraverse ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (DistributiveT t, GHC.Base.Functor f) =>\n (forall a. f (g a) -> f a) -> f (t g x) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1875,15 +1875,15 @@\n (Data.Functor.Compose.N:Compose[0] <*>_N <*>_N _R _N _N))\n } in\n let {\n g1 :: f (t g x) -> t (Data.Functor.Compose.Compose f g) x []\n = tdistribute @i @t $dDistributiveT @f @g @x $dFunctor\n } in\n \\ (x1['GHC.Types.Many] :: f (t g x)) -> f1 (g1 x1)]\n-5bac02433dfcce8672b96aacbc7690ac\n+aab4f45b55235de00615e82b86ef7600\n tdecompose ::\n forall {i} (t :: (* -> *) -> i -> *) a (x :: i).\n DistributiveT t =>\n (a -> t Data.Functor.Identity.Identity x) -> t ((->) a) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -1895,15 +1895,15 @@\n tdistribute'\n @i\n @t\n @((->) a)\n @x\n $dDistributiveT\n (GHC.Base.$fFunctorFUN @a)]\n-e714a56db976e405999674ba0f38e4c2\n+3e95649dc738a015868d28ba7461e91c\n tdistribute' ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (x :: i).\n (DistributiveT t, GHC.Base.Functor f) =>\n f (t Data.Functor.Identity.Identity x) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -1961,15 +1961,15 @@\n @Data.Functor.Identity.Identity\n @x\n $dFunctor\n } in\n \\ (x1['GHC.Types.Many] :: f (t Data.Functor.Identity.Identity\n x)) ->\n f1 (g x1)]\n-0c7137381fb9c3602e0f4e823599884a\n+52a99d2a2d30e70f8a8fe8bdf5c43719\n trecompose ::\n forall {k'} (t :: (* -> *) -> k' -> *) a (x :: k').\n Barbies.Internal.FunctorT.FunctorT t =>\n t ((->) a) x -> a -> t Data.Functor.Identity.Identity x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>,\n Unfolding: Core: \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,66 +1,66 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.FunctorB [orphan module] 9066\n- interface hash: 0f79366f0eb97bec5252874da3a1bd44\n- ABI hash: 6f344c88b12400bd2bfea8a8e586426a\n- export-list hash: 545c393a098768048448270f22297261\n- orphan hash: 1ed73c92b5892ffe17aec9f0f9faf357\n+ interface hash: 4332f7d47fcdb3001fdf8443b82106e8\n+ ABI hash: 3b87b985145cf4cf6a3a184955d35915\n+ export-list hash: cfec8517d63c28d5560e18a6cfd1de67\n+ orphan hash: a6da389d78e150e5426ff3eb768bb29b\n flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 346bed84494b1f9e793d2a830c2d5f2f\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gbmapDefault\n CanDeriveFunctorB\n FunctorB{bmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor aa0cdfd634e110446d67378e55f3961e\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor 3a671a9ebc54c98292eef95647b8cf3a\n- gmap 48115c02e66040402cbe3728cb1f0e58\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor 99360120e66c20b7262f09cf2228859a\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor 01d6ca3e5c45094951939d25b948175d\n+ gmap c55bce9a54af1fd1331af0fac529105e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-ad2ad002afa720f7ba68f35258904a89\n+cb231a238a353e1db9a9a2bdc0e6ab7f\n $dmbmap ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (FunctorB b, CanDeriveFunctorB b f g) =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -229,15 +229,15 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))) _N)]\n-8092e4356f913647b026d1d8e61f9b5d\n+c317313e11bf15f7a9e22dc478560965\n $fFunctorBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (GHC.Base.Functor f, FunctorB b) =>\n FunctorB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>,\n@@ -246,15 +246,15 @@\n $fFunctorBkCompose_$cbmap\n `cast`\n (forall (k :: <*>_N) (f :: <* -> *>_N) (b :: <(k -> *) -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-faf6943994589b4d21415868d56880bf\n+62b71d8d9c3dadba8c34590523cdbaab\n $fFunctorBkCompose_$cbmap ::\n forall k (f :: * -> *) (b :: (k -> *) -> *) (f1 :: k -> *)\n (g :: k -> *).\n (GHC.Base.Functor f, FunctorB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1\n -> Data.Functor.Compose.Compose f b g\n@@ -292,25 +292,25 @@\n f b f1>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n *>_N\n _R\n _N\n _N))]\n-b8b6d492972469d1eff36da42bdf7d73\n+e4aa5d549ee3c2e613a33ad36621e1be\n $fFunctorBkConst :: FunctorB (Data.Functor.Const.Const x)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkConst_$cbmap\n `cast`\n (forall (k :: <*>_N) (x :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-e92d2fbdd515974a863bcb32ad12a242\n+b1acbb7bb8e67441bca465909aa8ef6a\n $fFunctorBkConst_$cbmap ::\n forall k x (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Functor.Const.Const x f -> Data.Functor.Const.Const x g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -326,25 +326,25 @@\n -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0]\n *>_N _R _P))]\n-a064f80101cc40fa34a3db6766de9bad\n+5d6d33eb5d694531b17ef6f01ea4ba92\n $fFunctorBkConstant :: FunctorB (Data.Functor.Constant.Constant x)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkConstant_$cbmap\n `cast`\n (forall (k :: <*>_N) (x :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-9d86a7001fc6d8023899d6e6aad889df\n+0eb246c3f132779fc612f03933460a35\n $fFunctorBkConstant_$cbmap ::\n forall k x (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Functor.Constant.Constant x f\n -> Data.Functor.Constant.Constant x g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=2),\n@@ -361,15 +361,15 @@\n -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Constant.N:Constant[0]\n *>_N _R _P\n ; Sym (Data.Functor.Constant.N:Constant[0]\n *>_N _R _P))]\n-8436ec6e1f9d45a5cde513cf5046023e\n+e7e9a08ae0120f16110ab5603f466648\n $fFunctorBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (FunctorB a, FunctorB b) =>\n FunctorB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4, Strictness: <1!P(L,L)>,\n@@ -379,15 +379,15 @@\n `cast`\n (forall (k :: <*>_N) (a :: <(k -> *) -> *>_N) (b :: <(k -> *)\n -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-12fdf70d1fc1a72c51e8bafe91856ae2\n+6b68ae11d7b22fe728ba6bcf7084dc00\n $fFunctorBkProduct_$cbmap ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (FunctorB a, FunctorB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -408,39 +408,39 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @g\n ($dFunctorB `cast` (N:FunctorB[0] _N _N) @f @g f1 x)\n ($dFunctorB1 `cast` (N:FunctorB[0] _N _N) @f @g f1 y) }]\n-11b1ea248cd09db2ca21938e659408f5\n+e2b4cfd076f7a91b1794f174de81d878\n $fFunctorBkProxy :: FunctorB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkProxy_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-06e0e78778369145dbf768756656159e\n+a44954fb381e6e808b3de88a4b65ffe1\n $fFunctorBkProxy_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Proxy.Proxy f -> Data.Proxy.Proxy g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n Data.Proxy.Proxy @(k -> *) @g]\n-c925d3e21149c3fad8bca84340c8cca5\n+fb0a136aad737af5f45e21e2a74f7e61\n $fFunctorBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (FunctorB a, FunctorB b) =>\n FunctorB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4, Strictness: <1L>,\n@@ -450,15 +450,15 @@\n `cast`\n (forall (k :: <*>_N) (a :: <(k -> *) -> *>_N) (b :: <(k -> *)\n -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-85064afef823609cb3563fcda87e6cf7\n+7130edd6d5746f5547e2ff16decd2aac\n $fFunctorBkSum_$cbmap ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (FunctorB a, FunctorB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -485,15 +485,15 @@\n Data.Functor.Sum.InR x\n -> Data.Functor.Sum.InR\n @(k -> *)\n @a\n @b\n @g\n ($dFunctorB1 `cast` (N:FunctorB[0] _N _N) @f @g f1 x) }]\n-1746736df96d5f8957db81619c76f7da\n+2b2f5af1d2cc1935fd7e40ad080266bf\n $fGFunctorkk10fgRecRec ::\n forall k1 k2 k3 k4 (h :: * -> *) (m :: * -> *)\n (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *) (m' :: k2 -> *)\n (h' :: k3 -> k2) (b' :: (k1 -> *) -> k3).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorB b) =>\n Barbies.Generics.Functor.GFunctor\n 0\n@@ -528,15 +528,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-b6ecb6b251d3c7a743ad2575d49738f6\n+ec57d30e388f4fc95746d2a241496e04\n $fGFunctorkk10fgRecRec0 ::\n forall k1 k2 k3 (h :: * -> *) (b :: (k1 -> *) -> *) (f :: k1 -> *)\n (g :: k1 -> *) (h' :: k2 -> *) (b' :: (k1 -> *) -> k2).\n (GHC.Base.Functor h, FunctorB b) =>\n Barbies.Generics.Functor.GFunctor\n 0\n f\n@@ -566,15 +566,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-fe7f3690704b23c9c259a88b1c5698b3\n+263926202d21547c17481e00d331b79a\n $fGFunctorkk10fgRecRec0_$cgmap ::\n forall k1 k2 k3 (h :: * -> *) (b :: (k1 -> *) -> *) (f :: k1 -> *)\n (g :: k1 -> *) (h' :: k2 -> *) (b' :: (k1 -> *) -> k2) (x :: k3).\n (GHC.Base.Functor h, FunctorB b) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k1). f a -> g a)\n -> Data.Generics.GenericN.Rec (h' (b' (P 0 f))) (h (b f)) x\n@@ -636,15 +636,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-24c897f8f970d56811835d1e42c28c89\n+e612cbb0d87acd6cfe77b8336c994767\n $fGFunctorkk10fgRecRec1 ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (b' :: (k -> *) -> *).\n FunctorB b =>\n Barbies.Generics.Functor.GFunctor\n 0\n f\n@@ -668,15 +668,15 @@\n _N\n <0>_N\n _N\n _N\n _N\n _N))]\n-96a87b81c5061563314ef0c954328c42\n+0bd27ff692005c07839eadb9e01359c5\n $fGFunctorkk10fgRecRec1_$cgmap ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (b' :: (k -> *) -> *) (x :: k1).\n FunctorB b =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (b' (P 0 f)) (b f) x\n@@ -723,15 +723,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-6cfda864853142954f904f3e76db1e53\n+84a2de11989f2c11c062e9d24126c392\n $fGFunctorkk10fgRecRec_$cgmap ::\n forall k1 k2 k3 k4 (h :: * -> *) (m :: * -> *)\n (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *) (m' :: k2 -> *)\n (h' :: k3 -> k2) (b' :: (k1 -> *) -> k3) (x :: k4).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorB b) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k1). f a -> g a)\n@@ -810,88 +810,88 @@\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-9e625c3cf9c943282c41a468e7937632\n+29407c9d63122145f8048798eba59c6d\n $tcFunctorB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 18222313625673957513#Word64\n- 2068769498035295293#Word64\n+ 15756948957532678109#Word64\n+ 11929699411533830653#Word64\n $trModule\n $tcFunctorB2\n 1#\n $tcFunctorB1]\n-a5f044033ffffaa263999c98cd20d530\n+1a7dd0a291d01edf08da8e88dd01dd5e\n $tcFunctorB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-f93c47de414170bb2da020d92a0c9c3b\n+1bc67813811badf623ce95ced1679f1e\n $tcFunctorB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFunctorB3]\n-661ee696d1d707c8693270ef3130acd0\n+d40c2913555594e25e20cad5f5b572bf\n $tcFunctorB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"FunctorB\"#]\n-bf4641218ae0edb681d9197b1433eee5\n+251cad0e49dd1e1b5ccf3769259ead6b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-541e27a3f06373ed1585836102f17727\n+2ce86debf573e9f1092dd444b97dc032\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-3f99edf593ecbdb89a4a7059573a0da1\n+7832f19a2fa0f059f55a7071c2fed0d1\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.FunctorB\"#]\n-f07b00f6ef59fd3f7790fba872cfddcd\n+1c44330b7686417547adc3a6bd24c9ad\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-148e7806932ec7bae08a14067dbe8ad2\n+e5a927a83d7b72cede5ce8738dfd1469\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-4798d3e0ba4288a9d833530febb4e730\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+01008d39a0245cc595e67e25b4212ab5\n type CanDeriveFunctorB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveFunctorB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Barbies.Generics.Functor.GFunctor\n 0\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g)))\n :: GHC.Types.Constraint\n-5243ad59efb8b5fc90a7cb1d8dd41ef7\n+e48089ffcc4207ade5600846f9e63036\n type FunctorB :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class FunctorB b where\n bmap :: forall (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> b f -> b g\n default bmap :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveFunctorB b f g =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n-397dba72a5366a7a549980b55c40db11\n+9715695b1f925d242c8bc20488d1623c\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-524f6e8232f0fe0fcf9cae57afae1768\n+b3b583c9b60067b920d36db0ee65239b\n gbmapDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveFunctorB b f g =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,66 +1,66 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.FunctorB [orphan module] 9066\n- interface hash: 0f79366f0eb97bec5252874da3a1bd44\n- ABI hash: 6f344c88b12400bd2bfea8a8e586426a\n- export-list hash: 545c393a098768048448270f22297261\n- orphan hash: 1ed73c92b5892ffe17aec9f0f9faf357\n+ interface hash: 4332f7d47fcdb3001fdf8443b82106e8\n+ ABI hash: 3b87b985145cf4cf6a3a184955d35915\n+ export-list hash: cfec8517d63c28d5560e18a6cfd1de67\n+ orphan hash: a6da389d78e150e5426ff3eb768bb29b\n flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 346bed84494b1f9e793d2a830c2d5f2f\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gbmapDefault\n CanDeriveFunctorB\n FunctorB{bmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor aa0cdfd634e110446d67378e55f3961e\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor 3a671a9ebc54c98292eef95647b8cf3a\n- gmap 48115c02e66040402cbe3728cb1f0e58\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor 99360120e66c20b7262f09cf2228859a\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor 01d6ca3e5c45094951939d25b948175d\n+ gmap c55bce9a54af1fd1331af0fac529105e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-ad2ad002afa720f7ba68f35258904a89\n+cb231a238a353e1db9a9a2bdc0e6ab7f\n $dmbmap ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (FunctorB b, CanDeriveFunctorB b f g) =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -229,15 +229,15 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))) _N)]\n-8092e4356f913647b026d1d8e61f9b5d\n+c317313e11bf15f7a9e22dc478560965\n $fFunctorBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (GHC.Base.Functor f, FunctorB b) =>\n FunctorB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>,\n@@ -246,15 +246,15 @@\n $fFunctorBkCompose_$cbmap\n `cast`\n (forall (k :: <*>_N) (f :: <* -> *>_N) (b :: <(k -> *) -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-faf6943994589b4d21415868d56880bf\n+62b71d8d9c3dadba8c34590523cdbaab\n $fFunctorBkCompose_$cbmap ::\n forall k (f :: * -> *) (b :: (k -> *) -> *) (f1 :: k -> *)\n (g :: k -> *).\n (GHC.Base.Functor f, FunctorB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1\n -> Data.Functor.Compose.Compose f b g\n@@ -292,25 +292,25 @@\n f b f1>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n *>_N\n _R\n _N\n _N))]\n-b8b6d492972469d1eff36da42bdf7d73\n+e4aa5d549ee3c2e613a33ad36621e1be\n $fFunctorBkConst :: FunctorB (Data.Functor.Const.Const x)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkConst_$cbmap\n `cast`\n (forall (k :: <*>_N) (x :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-e92d2fbdd515974a863bcb32ad12a242\n+b1acbb7bb8e67441bca465909aa8ef6a\n $fFunctorBkConst_$cbmap ::\n forall k x (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Functor.Const.Const x f -> Data.Functor.Const.Const x g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -326,25 +326,25 @@\n -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0]\n *>_N _R _P))]\n-a064f80101cc40fa34a3db6766de9bad\n+5d6d33eb5d694531b17ef6f01ea4ba92\n $fFunctorBkConstant :: FunctorB (Data.Functor.Constant.Constant x)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkConstant_$cbmap\n `cast`\n (forall (k :: <*>_N) (x :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-9d86a7001fc6d8023899d6e6aad889df\n+0eb246c3f132779fc612f03933460a35\n $fFunctorBkConstant_$cbmap ::\n forall k x (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Functor.Constant.Constant x f\n -> Data.Functor.Constant.Constant x g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=2),\n@@ -361,15 +361,15 @@\n -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Constant.N:Constant[0]\n *>_N _R _P\n ; Sym (Data.Functor.Constant.N:Constant[0]\n *>_N _R _P))]\n-8436ec6e1f9d45a5cde513cf5046023e\n+e7e9a08ae0120f16110ab5603f466648\n $fFunctorBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (FunctorB a, FunctorB b) =>\n FunctorB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4, Strictness: <1!P(L,L)>,\n@@ -379,15 +379,15 @@\n `cast`\n (forall (k :: <*>_N) (a :: <(k -> *) -> *>_N) (b :: <(k -> *)\n -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-12fdf70d1fc1a72c51e8bafe91856ae2\n+6b68ae11d7b22fe728ba6bcf7084dc00\n $fFunctorBkProduct_$cbmap ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (FunctorB a, FunctorB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -408,39 +408,39 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @g\n ($dFunctorB `cast` (N:FunctorB[0] _N _N) @f @g f1 x)\n ($dFunctorB1 `cast` (N:FunctorB[0] _N _N) @f @g f1 y) }]\n-11b1ea248cd09db2ca21938e659408f5\n+e2b4cfd076f7a91b1794f174de81d878\n $fFunctorBkProxy :: FunctorB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkProxy_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-06e0e78778369145dbf768756656159e\n+a44954fb381e6e808b3de88a4b65ffe1\n $fFunctorBkProxy_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Proxy.Proxy f -> Data.Proxy.Proxy g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n Data.Proxy.Proxy @(k -> *) @g]\n-c925d3e21149c3fad8bca84340c8cca5\n+fb0a136aad737af5f45e21e2a74f7e61\n $fFunctorBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (FunctorB a, FunctorB b) =>\n FunctorB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4, Strictness: <1L>,\n@@ -450,15 +450,15 @@\n `cast`\n (forall (k :: <*>_N) (a :: <(k -> *) -> *>_N) (b :: <(k -> *)\n -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-85064afef823609cb3563fcda87e6cf7\n+7130edd6d5746f5547e2ff16decd2aac\n $fFunctorBkSum_$cbmap ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (FunctorB a, FunctorB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -485,15 +485,15 @@\n Data.Functor.Sum.InR x\n -> Data.Functor.Sum.InR\n @(k -> *)\n @a\n @b\n @g\n ($dFunctorB1 `cast` (N:FunctorB[0] _N _N) @f @g f1 x) }]\n-1746736df96d5f8957db81619c76f7da\n+2b2f5af1d2cc1935fd7e40ad080266bf\n $fGFunctorkk10fgRecRec ::\n forall k1 k2 k3 k4 (h :: * -> *) (m :: * -> *)\n (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *) (m' :: k2 -> *)\n (h' :: k3 -> k2) (b' :: (k1 -> *) -> k3).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorB b) =>\n Barbies.Generics.Functor.GFunctor\n 0\n@@ -528,15 +528,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-b6ecb6b251d3c7a743ad2575d49738f6\n+ec57d30e388f4fc95746d2a241496e04\n $fGFunctorkk10fgRecRec0 ::\n forall k1 k2 k3 (h :: * -> *) (b :: (k1 -> *) -> *) (f :: k1 -> *)\n (g :: k1 -> *) (h' :: k2 -> *) (b' :: (k1 -> *) -> k2).\n (GHC.Base.Functor h, FunctorB b) =>\n Barbies.Generics.Functor.GFunctor\n 0\n f\n@@ -566,15 +566,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-fe7f3690704b23c9c259a88b1c5698b3\n+263926202d21547c17481e00d331b79a\n $fGFunctorkk10fgRecRec0_$cgmap ::\n forall k1 k2 k3 (h :: * -> *) (b :: (k1 -> *) -> *) (f :: k1 -> *)\n (g :: k1 -> *) (h' :: k2 -> *) (b' :: (k1 -> *) -> k2) (x :: k3).\n (GHC.Base.Functor h, FunctorB b) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k1). f a -> g a)\n -> Data.Generics.GenericN.Rec (h' (b' (P 0 f))) (h (b f)) x\n@@ -636,15 +636,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-24c897f8f970d56811835d1e42c28c89\n+e612cbb0d87acd6cfe77b8336c994767\n $fGFunctorkk10fgRecRec1 ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (b' :: (k -> *) -> *).\n FunctorB b =>\n Barbies.Generics.Functor.GFunctor\n 0\n f\n@@ -668,15 +668,15 @@\n _N\n <0>_N\n _N\n _N\n _N\n _N))]\n-96a87b81c5061563314ef0c954328c42\n+0bd27ff692005c07839eadb9e01359c5\n $fGFunctorkk10fgRecRec1_$cgmap ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (b' :: (k -> *) -> *) (x :: k1).\n FunctorB b =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (b' (P 0 f)) (b f) x\n@@ -723,15 +723,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-6cfda864853142954f904f3e76db1e53\n+84a2de11989f2c11c062e9d24126c392\n $fGFunctorkk10fgRecRec_$cgmap ::\n forall k1 k2 k3 k4 (h :: * -> *) (m :: * -> *)\n (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *) (m' :: k2 -> *)\n (h' :: k3 -> k2) (b' :: (k1 -> *) -> k3) (x :: k4).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorB b) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k1). f a -> g a)\n@@ -810,88 +810,88 @@\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-9e625c3cf9c943282c41a468e7937632\n+29407c9d63122145f8048798eba59c6d\n $tcFunctorB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 18222313625673957513#Word64\n- 2068769498035295293#Word64\n+ 15756948957532678109#Word64\n+ 11929699411533830653#Word64\n $trModule\n $tcFunctorB2\n 1#\n $tcFunctorB1]\n-a5f044033ffffaa263999c98cd20d530\n+1a7dd0a291d01edf08da8e88dd01dd5e\n $tcFunctorB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-f93c47de414170bb2da020d92a0c9c3b\n+1bc67813811badf623ce95ced1679f1e\n $tcFunctorB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFunctorB3]\n-661ee696d1d707c8693270ef3130acd0\n+d40c2913555594e25e20cad5f5b572bf\n $tcFunctorB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"FunctorB\"#]\n-bf4641218ae0edb681d9197b1433eee5\n+251cad0e49dd1e1b5ccf3769259ead6b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-541e27a3f06373ed1585836102f17727\n+2ce86debf573e9f1092dd444b97dc032\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-3f99edf593ecbdb89a4a7059573a0da1\n+7832f19a2fa0f059f55a7071c2fed0d1\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.FunctorB\"#]\n-f07b00f6ef59fd3f7790fba872cfddcd\n+1c44330b7686417547adc3a6bd24c9ad\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-148e7806932ec7bae08a14067dbe8ad2\n+e5a927a83d7b72cede5ce8738dfd1469\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-4798d3e0ba4288a9d833530febb4e730\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+01008d39a0245cc595e67e25b4212ab5\n type CanDeriveFunctorB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveFunctorB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Barbies.Generics.Functor.GFunctor\n 0\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g)))\n :: GHC.Types.Constraint\n-5243ad59efb8b5fc90a7cb1d8dd41ef7\n+e48089ffcc4207ade5600846f9e63036\n type FunctorB :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class FunctorB b where\n bmap :: forall (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> b f -> b g\n default bmap :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveFunctorB b f g =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n-397dba72a5366a7a549980b55c40db11\n+9715695b1f925d242c8bc20488d1623c\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-524f6e8232f0fe0fcf9cae57afae1768\n+b3b583c9b60067b920d36db0ee65239b\n gbmapDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveFunctorB b f g =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.dyn_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,32 +1,32 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.FunctorT [orphan module] 9066\n- interface hash: b582098b06f839443f98f796c40d7d14\n- ABI hash: c8310e4a2c22e48313a5914948ddeb76\n- export-list hash: 183054a27084bbc8fe4b79328162608e\n- orphan hash: 332934329e94e6888e35c1b7ba371c6d\n+ interface hash: 860866028c99ed3514333bf864d0e22c\n+ ABI hash: 929bf8d925e252c32908ddf92134540e\n+ export-list hash: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ orphan hash: 6b85ae8a221b78c5294648c3b9a2c454\n flag hash: ecf82af067339e97e13072093c0463b4\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 0d836fb8f1d36d16b99cafee5bf8e57a\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gtmapDefault\n CanDeriveFunctorT\n FunctorT{tmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -36,27 +36,27 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor aa0cdfd634e110446d67378e55f3961e\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor 3a671a9ebc54c98292eef95647b8cf3a\n- gmap 48115c02e66040402cbe3728cb1f0e58\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor 99360120e66c20b7262f09cf2228859a\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor 01d6ca3e5c45094951939d25b948175d\n+ gmap c55bce9a54af1fd1331af0fac529105e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n@@ -72,17 +72,17 @@\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Control.Monad.Trans.State.Lazy 8427de03afe8955c0c64907138bb8d1e\n import -/ Control.Monad.Trans.State.Strict 29c1fe6de83c54f9690c1f1b22fcbe30\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-7a2fd9a457ebef67211c05ac18208e46\n+58694e22a2090540d7805d40e407a5a7\n $dmtmap ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (FunctorT t, CanDeriveFunctorT t f g x) =>\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -327,53 +327,53 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-0337ebaf9c936cb8f5f9b07c0d406d94\n+65702b35e0cda9a4262c5b7446b59ef7\n $fFunctorTTYPETYPEAccumT ::\n FunctorT (Control.Monad.Trans.Accum.AccumT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEAccumT_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-6238e90f4171b32a959728e0ce5506a9\n+da00aed1be2a98ff7ec90c6254b4fdd2\n $fFunctorTTYPETYPEAccumT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Accum.AccumT w f x\n -> Control.Monad.Trans.Accum.AccumT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @w\n @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Monad.Trans.Accum.mapAccumT @f @x @w @g @x (h @(x, w))]\n-bfb415956a71afae5b78fbc55c7b8a92\n+33423d0c5a2a1234a6b38a9884fa4070\n $fFunctorTTYPETYPEExceptT ::\n FunctorT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEExceptT_$ctmap\n `cast`\n (forall (e :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-493a0c259d103a29092a6dd029b8309b\n+7f45cda79f0d98af678a3d1aafa215d3\n $fFunctorTTYPETYPEExceptT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Except.ExceptT e f x\n -> Control.Monad.Trans.Except.ExceptT e g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -386,49 +386,49 @@\n @f\n @e\n @x\n @g\n @e\n @x\n (h @(Data.Either.Either e x))]\n-b369bebfff1b8543a4365adcac5613fd\n+7066b7f54568bbadd6d80288d39df349\n $fFunctorTTYPETYPELift :: FunctorT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPELift_$ctmap\n `cast`\n (Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-d852cc2bb2dad781e33bd8a16f4ffcfb\n+8a607000c22de8de4d5f498bcb3a2a64\n $fFunctorTTYPETYPELift_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Applicative.Lift.Lift f x\n -> Control.Applicative.Lift.Lift g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Applicative.Lift.mapLift @f @x @g (h @x)]\n-247fd029f84fb21291b0c8a0c3010f8d\n+c08f5e09c9546171ea2d5472cfd75665\n $fFunctorTTYPETYPEMaybeT ::\n FunctorT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEMaybeT_$ctmap\n `cast`\n (Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-1844709a72297daecc6e037985e34624\n+8c62b79ea1f9e46a255661e98790bcaf\n $fFunctorTTYPETYPEMaybeT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Maybe.MaybeT f x\n -> Control.Monad.Trans.Maybe.MaybeT g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -441,39 +441,39 @@\n x1 `cast` (Control.Monad.Trans.Maybe.N:MaybeT[0] _R _N))\n `cast`\n (forall (f :: <* -> *>_N) (g :: <* -> *>_N) (x :: <*>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R _N))]\n-ac94f90e743ad3f61034c8f9beeb0cfa\n+96d0a286ccc7ed4e371d24bfd9fc9d22\n $fFunctorTTYPETYPERWST ::\n FunctorT (Control.Monad.Trans.RWS.Strict.RWST r w s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPERWST_$ctmap\n `cast`\n (forall (r :: <*>_N) (w :: <*>_N) (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-89a03c623cdd25cda24a1d186243a733\n+30181ad6a975173f3128d785db8c4f41\n $fFunctorTTYPETYPERWST0 ::\n FunctorT (Control.Monad.Trans.RWS.Lazy.RWST r w s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPERWST0_$ctmap\n `cast`\n (forall (r :: <*>_N) (w :: <*>_N) (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-121d1acfc07a7794f399facc4955a5e0\n+a2ddb5498abb9d650ab5de9920ec7256\n $fFunctorTTYPETYPERWST0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.RWS.Lazy.RWST r w s f x\n -> Control.Monad.Trans.RWS.Lazy.RWST r w s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -490,15 +490,15 @@\n @s\n @w\n @g\n @x\n @w\n @r\n (h @(x, s, w))]\n-abeea962aae4a297783e126be9a6e65c\n+a17221651ae64b5f6ca86347787cdf47\n $fFunctorTTYPETYPERWST_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.RWS.Strict.RWST r w s f x\n -> Control.Monad.Trans.RWS.Strict.RWST r w s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -515,65 +515,65 @@\n @s\n @w\n @g\n @x\n @w\n @r\n (h @(x, s, w))]\n-919d26375b691237fdb2bda501c5cd74\n+e61cc5f6f2a7e7b7972b27a307467d1d\n $fFunctorTTYPETYPEReaderT ::\n FunctorT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEReaderT_$ctmap\n `cast`\n (forall (r :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-6faeda134b8309703b120004e6719357\n+fbf37604498ff9aaa6f369d43d977749\n $fFunctorTTYPETYPEReaderT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Reader.ReaderT r f x\n -> Control.Monad.Trans.Reader.ReaderT r g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @r\n @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Monad.Trans.Reader.mapReaderT @f @x @g @x @r (h @x)]\n-3dbdc754596ceaf5e5939d8fefff138f\n+845ddfe6adf6d196d0da2b0ff55cfb4b\n $fFunctorTTYPETYPEStateT ::\n FunctorT (Control.Monad.Trans.State.Strict.StateT s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEStateT_$ctmap\n `cast`\n (forall (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-b29847382f9d7581b0c80d3a0d28a004\n+5b003b2aa99f478d2dc96110c34ddf1b\n $fFunctorTTYPETYPEStateT0 ::\n FunctorT (Control.Monad.Trans.State.Lazy.StateT s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEStateT0_$ctmap\n `cast`\n (forall (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-7bc200e7e0ae77485ba22e01f2f2cee0\n+9caed73c3f1a202fa7f7bb12d474ee9d\n $fFunctorTTYPETYPEStateT0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.State.Lazy.StateT s f x\n -> Control.Monad.Trans.State.Lazy.StateT s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -585,15 +585,15 @@\n Control.Monad.Trans.State.Lazy.mapStateT\n @f\n @x\n @s\n @g\n @x\n (h @(x, s))]\n-66e1152962a84f93dbbac1c45045d2db\n+de553979aca5143bef7cdb53a42224d7\n $fFunctorTTYPETYPEStateT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.State.Strict.StateT s f x\n -> Control.Monad.Trans.State.Strict.StateT s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -605,39 +605,39 @@\n Control.Monad.Trans.State.Strict.mapStateT\n @f\n @x\n @s\n @g\n @x\n (h @(x, s))]\n-5e6bc7e25303cd947b9dc77c6db687e8\n+c4fb4a0b5490feb56858bc28bfc37d73\n $fFunctorTTYPETYPEWriterT ::\n FunctorT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEWriterT_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-5ad9d1e632acf1842b420a927cd1ae32\n+4aca92109b9ef3456c950c0f33cd1c9c\n $fFunctorTTYPETYPEWriterT0 ::\n FunctorT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEWriterT0_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-173ab081d325545f46a602a169110917\n+57361af68ccc414ad03e6ac06b27f25f\n $fFunctorTTYPETYPEWriterT0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Writer.Lazy.WriterT w f x\n -> Control.Monad.Trans.Writer.Lazy.WriterT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -650,15 +650,15 @@\n @f\n @x\n @w\n @g\n @x\n @w\n (h @(x, w))]\n-042b5e2819a4ea9c37ef8b924eb75c40\n+a1f6e56b19f4a17ce2171f2e97b2325a\n $fFunctorTTYPETYPEWriterT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Writer.Strict.WriterT w f x\n -> Control.Monad.Trans.Writer.Strict.WriterT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -671,27 +671,27 @@\n @f\n @x\n @w\n @g\n @x\n @w\n (h @(x, w))]\n-ec1d6ca38370f16e8fc1367f9141f64a\n+0c6aeb3926dc2cc830fac43ee9f4f2d5\n $fFunctorTk'k'Backwards ::\n FunctorT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Backwards_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-fe0e8f2a2be09e78fb0b16fe2de09980\n+136c4ee020f965ec86a828d71160cc28\n $fFunctorTk'k'Backwards_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Control.Applicative.Backwards.Backwards f x\n -> Control.Applicative.Backwards.Backwards g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n@@ -711,30 +711,30 @@\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R) _N)]\n-7ad8cb484a41dbd6f300d1f8ca254d6e\n+ff5ceee39a287f152f2d17bd6ad9b3dc\n $fFunctorTk'k'Compose ::\n GHC.Base.Functor f => FunctorT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseTrue>\n $fFunctorTk'k'Compose_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: <* -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorT[0]\n _N\n _N\n _N))]\n-fb9c9e79c802674166f113e9ccdca1b2\n+5e2a64be7b195e70dfbea4615d8cc369\n $fFunctorTk'k'Compose_$ctmap ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Functor f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x\n -> Data.Functor.Compose.Compose f g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -768,27 +768,27 @@\n f f1 x>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-33431e4280ebe8c97b2a922121ca39d4\n+f28929514f9296179a086899240a4548\n $fFunctorTk'k'IdentityT ::\n FunctorT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'IdentityT_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-970c6be34d0fd83a5d72b1ff608d0118\n+766906b1dd27dba137f68e89764785e0\n $fFunctorTk'k'IdentityT_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Control.Monad.Trans.Identity.IdentityT f x\n -> Control.Monad.Trans.Identity.IdentityT g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n@@ -808,27 +808,27 @@\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R) _N)]\n-02bc4b9a04bc603350c37d6208a88466\n+1fb667f5856e71a313c7ad7ac2b72268\n $fFunctorTk'k'Product ::\n forall k' (f :: k' -> *). FunctorT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Product_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-2eb80c05beb1f7d007db9eb0c12d4710\n+73dee846534c79f0e7bebcdd29510be6\n $fFunctorTk'k'Product_$ctmap ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f2 a -> g a)\n -> Data.Functor.Product.Product f1 f2 x\n -> Data.Functor.Product.Product f1 g x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,L)>, CPR: 1,\n@@ -839,26 +839,26 @@\n @f1 :: k' -> *\n @g :: k' -> *\n @x :: k'\n (h['GHC.Types.Many] :: forall (a :: k'). f1 a -> g a)\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f f1 x) ->\n case ds of wild { Data.Functor.Product.Pair fa ga ->\n Data.Functor.Product.Pair @k' @f @g @x fa (h @x ga) }]\n-646a1bd62e36added23f6c3777d28083\n+f7e344d5e1c8ed3b9d4486e3120f5c00\n $fFunctorTk'k'Reverse :: FunctorT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Reverse_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-af8441c327cbe4141c30b6fc07af7fc7\n+ad9a3f70784430f065270fbe65f2524c\n $fFunctorTk'k'Reverse_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Data.Functor.Reverse.Reverse f x\n -> Data.Functor.Reverse.Reverse g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n@@ -874,26 +874,26 @@\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)]\n-d5b7f1d8b633420915e3fb510ddf5110\n+a2447f8d3efc4b1eeaa214c7df9811da\n $fFunctorTk'k'Sum ::\n forall k' (f :: k' -> *). FunctorT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Sum_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N).\n Sym (N:FunctorT[0] _N _N _N))]\n-ddf4e547d63168da3d6d942b13340512\n+0f7b8eb6eee60e1825339cd675931284\n $fFunctorTk'k'Sum_$ctmap ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f2 a -> g a)\n -> Data.Functor.Sum.Sum f1 f2 x -> Data.Functor.Sum.Sum f1 g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -904,15 +904,15 @@\n @x :: k'\n (h['GHC.Types.Many] :: forall (a :: k'). f1 a -> g a)\n (ds['GHC.Types.Many] :: Data.Functor.Sum.Sum f f1 x) ->\n case ds of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @g @x fa\n Data.Functor.Sum.InR ga\n -> Data.Functor.Sum.InR @k' @f @g @x (h @x ga) }]\n-321c5d569ba981a11deac24a9712018a\n+51ea0b3d6e3cd2ef2483f8f41d4612e6\n $fGFunctorkk11fgRecRec ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorT t) =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -943,15 +943,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-9b0ef7003749f1013695e0679a699c00\n+a777ecdd7d2d1a2b6df07d6b892197b8\n $fGFunctorkk11fgRecRec0 ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Functor h, FunctorT t) =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -979,15 +979,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-622512669fdafbc6a8e43418aeb2b6c5\n+5873133930721fd8a716fe4698a2b413\n $fGFunctorkk11fgRecRec0_$cgmap ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Functor h, FunctorT t) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (h (t (P 1 f) x)) (h (t f x)) x1\n@@ -1045,15 +1045,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-971c73808f0d53c800ee932121404180\n+d3b04fd425494916bc5c9999d53e00ff\n $fGFunctorkk11fgRecRec1 ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n FunctorT t =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -1077,15 +1077,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-e1d7c17504fa3e078d5efc080da8bd64\n+274bf3b199b318af39316b3670f52340\n $fGFunctorkk11fgRecRec1_$cgmap ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n FunctorT t =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x) x1\n@@ -1132,15 +1132,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-a84a997cd0acab9382b84cdbaa709147\n+5504587bd2bf2471df57b7d5b649b8de\n $fGFunctorkk11fgRecRec_$cgmap ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorT t) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n@@ -1211,90 +1211,90 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-96b8ab5613539eac8ef062e5dc9454ce\n+6885a85777b51428ac22d1b57b63e27e\n $tcFunctorT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6751053597812226781#Word64\n- 8775020075333287872#Word64\n+ 14658597566253021173#Word64\n+ 7903216527128616906#Word64\n $trModule\n $tcFunctorT2\n 2#\n $tcFunctorT1]\n-c6b7d77dcbe23e48f3842ff36b563a09\n+c19ceb8cffdeb002fd07190890b62e14\n $tcFunctorT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-1b119a0f711d9f056ed744e214c80da2\n+1ad19da9ca2dfbc9167cc91c08914778\n $tcFunctorT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFunctorT3]\n-c9cc504dc511bdea8aa2b95dca76c36f\n+1041d5040913618ed5635cc426a66cad\n $tcFunctorT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"FunctorT\"#]\n-995d5aa18cc07d449cd305406cfad6cc\n+f0f513c879a9c35f1bc19205858a1271\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-e9021bde4ee6ca4e6b30a14d276976e7\n+90f96debfe43404598abde3bab41d31f\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4a9e5f1307d0dc14da58a7c5807fe190\n+7defdc4a0081e46639d2628b408b4ac0\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.FunctorT\"#]\n-2410030ef5e3623bd42235a34f2daa83\n+b93436141ffd0f5fe3b3b9e93e4cf463\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fd8d4f8c143806ea4f2a02a454cef830\n+ea099a2e4a80a0ff037ee77a422ee501\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e275e404b4b864adaccda0febb583db6\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+6c54821e942bab4e5445265620155e64\n type CanDeriveFunctorT :: forall {k} {k1}.\n ((k -> *) -> k1 -> *)\n -> (k -> *) -> (k -> *) -> k1 -> GHC.Types.Constraint\n type CanDeriveFunctorT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Barbies.Generics.Functor.GFunctor\n 1\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x)))\n :: GHC.Types.Constraint\n-e3d3793569ff8c641c51801746e07066\n+c4169bad3141c057cd702685c69e0cc5\n type FunctorT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class FunctorT t where\n tmap :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n default tmap :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n CanDeriveFunctorT t f g x =>\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n-9508a024aed85a3d37cff0009fdc4009\n+c8e297581604b9347d5c6e275575738a\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-ac6ad64c7c9d3bb0d77a6444aa18982e\n+b0b9ea25355255512679237c5c946bd9\n gtmapDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (g :: k1 -> *) (x :: k2).\n CanDeriveFunctorT t f g x =>\n (forall (a :: k1). f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,32 +1,32 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.FunctorT [orphan module] 9066\n- interface hash: b582098b06f839443f98f796c40d7d14\n- ABI hash: c8310e4a2c22e48313a5914948ddeb76\n- export-list hash: 183054a27084bbc8fe4b79328162608e\n- orphan hash: 332934329e94e6888e35c1b7ba371c6d\n+ interface hash: 860866028c99ed3514333bf864d0e22c\n+ ABI hash: 929bf8d925e252c32908ddf92134540e\n+ export-list hash: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ orphan hash: 6b85ae8a221b78c5294648c3b9a2c454\n flag hash: 214c3804eede05a71bc2a2499ad79a27\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 0d836fb8f1d36d16b99cafee5bf8e57a\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gtmapDefault\n CanDeriveFunctorT\n FunctorT{tmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -36,27 +36,27 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor aa0cdfd634e110446d67378e55f3961e\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor 3a671a9ebc54c98292eef95647b8cf3a\n- gmap 48115c02e66040402cbe3728cb1f0e58\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor 99360120e66c20b7262f09cf2228859a\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor 01d6ca3e5c45094951939d25b948175d\n+ gmap c55bce9a54af1fd1331af0fac529105e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n@@ -72,17 +72,17 @@\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Control.Monad.Trans.State.Lazy 8427de03afe8955c0c64907138bb8d1e\n import -/ Control.Monad.Trans.State.Strict 29c1fe6de83c54f9690c1f1b22fcbe30\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-7a2fd9a457ebef67211c05ac18208e46\n+58694e22a2090540d7805d40e407a5a7\n $dmtmap ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (FunctorT t, CanDeriveFunctorT t f g x) =>\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -327,53 +327,53 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-0337ebaf9c936cb8f5f9b07c0d406d94\n+65702b35e0cda9a4262c5b7446b59ef7\n $fFunctorTTYPETYPEAccumT ::\n FunctorT (Control.Monad.Trans.Accum.AccumT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEAccumT_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-6238e90f4171b32a959728e0ce5506a9\n+da00aed1be2a98ff7ec90c6254b4fdd2\n $fFunctorTTYPETYPEAccumT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Accum.AccumT w f x\n -> Control.Monad.Trans.Accum.AccumT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @w\n @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Monad.Trans.Accum.mapAccumT @f @x @w @g @x (h @(x, w))]\n-bfb415956a71afae5b78fbc55c7b8a92\n+33423d0c5a2a1234a6b38a9884fa4070\n $fFunctorTTYPETYPEExceptT ::\n FunctorT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEExceptT_$ctmap\n `cast`\n (forall (e :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-493a0c259d103a29092a6dd029b8309b\n+7f45cda79f0d98af678a3d1aafa215d3\n $fFunctorTTYPETYPEExceptT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Except.ExceptT e f x\n -> Control.Monad.Trans.Except.ExceptT e g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -386,49 +386,49 @@\n @f\n @e\n @x\n @g\n @e\n @x\n (h @(Data.Either.Either e x))]\n-b369bebfff1b8543a4365adcac5613fd\n+7066b7f54568bbadd6d80288d39df349\n $fFunctorTTYPETYPELift :: FunctorT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPELift_$ctmap\n `cast`\n (Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-d852cc2bb2dad781e33bd8a16f4ffcfb\n+8a607000c22de8de4d5f498bcb3a2a64\n $fFunctorTTYPETYPELift_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Applicative.Lift.Lift f x\n -> Control.Applicative.Lift.Lift g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Applicative.Lift.mapLift @f @x @g (h @x)]\n-247fd029f84fb21291b0c8a0c3010f8d\n+c08f5e09c9546171ea2d5472cfd75665\n $fFunctorTTYPETYPEMaybeT ::\n FunctorT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEMaybeT_$ctmap\n `cast`\n (Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-1844709a72297daecc6e037985e34624\n+8c62b79ea1f9e46a255661e98790bcaf\n $fFunctorTTYPETYPEMaybeT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Maybe.MaybeT f x\n -> Control.Monad.Trans.Maybe.MaybeT g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -441,39 +441,39 @@\n x1 `cast` (Control.Monad.Trans.Maybe.N:MaybeT[0] _R _N))\n `cast`\n (forall (f :: <* -> *>_N) (g :: <* -> *>_N) (x :: <*>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R _N))]\n-ac94f90e743ad3f61034c8f9beeb0cfa\n+96d0a286ccc7ed4e371d24bfd9fc9d22\n $fFunctorTTYPETYPERWST ::\n FunctorT (Control.Monad.Trans.RWS.Strict.RWST r w s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPERWST_$ctmap\n `cast`\n (forall (r :: <*>_N) (w :: <*>_N) (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-89a03c623cdd25cda24a1d186243a733\n+30181ad6a975173f3128d785db8c4f41\n $fFunctorTTYPETYPERWST0 ::\n FunctorT (Control.Monad.Trans.RWS.Lazy.RWST r w s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPERWST0_$ctmap\n `cast`\n (forall (r :: <*>_N) (w :: <*>_N) (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-121d1acfc07a7794f399facc4955a5e0\n+a2ddb5498abb9d650ab5de9920ec7256\n $fFunctorTTYPETYPERWST0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.RWS.Lazy.RWST r w s f x\n -> Control.Monad.Trans.RWS.Lazy.RWST r w s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -490,15 +490,15 @@\n @s\n @w\n @g\n @x\n @w\n @r\n (h @(x, s, w))]\n-abeea962aae4a297783e126be9a6e65c\n+a17221651ae64b5f6ca86347787cdf47\n $fFunctorTTYPETYPERWST_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.RWS.Strict.RWST r w s f x\n -> Control.Monad.Trans.RWS.Strict.RWST r w s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -515,65 +515,65 @@\n @s\n @w\n @g\n @x\n @w\n @r\n (h @(x, s, w))]\n-919d26375b691237fdb2bda501c5cd74\n+e61cc5f6f2a7e7b7972b27a307467d1d\n $fFunctorTTYPETYPEReaderT ::\n FunctorT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEReaderT_$ctmap\n `cast`\n (forall (r :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-6faeda134b8309703b120004e6719357\n+fbf37604498ff9aaa6f369d43d977749\n $fFunctorTTYPETYPEReaderT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Reader.ReaderT r f x\n -> Control.Monad.Trans.Reader.ReaderT r g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @r\n @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Monad.Trans.Reader.mapReaderT @f @x @g @x @r (h @x)]\n-3dbdc754596ceaf5e5939d8fefff138f\n+845ddfe6adf6d196d0da2b0ff55cfb4b\n $fFunctorTTYPETYPEStateT ::\n FunctorT (Control.Monad.Trans.State.Strict.StateT s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEStateT_$ctmap\n `cast`\n (forall (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-b29847382f9d7581b0c80d3a0d28a004\n+5b003b2aa99f478d2dc96110c34ddf1b\n $fFunctorTTYPETYPEStateT0 ::\n FunctorT (Control.Monad.Trans.State.Lazy.StateT s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEStateT0_$ctmap\n `cast`\n (forall (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-7bc200e7e0ae77485ba22e01f2f2cee0\n+9caed73c3f1a202fa7f7bb12d474ee9d\n $fFunctorTTYPETYPEStateT0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.State.Lazy.StateT s f x\n -> Control.Monad.Trans.State.Lazy.StateT s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -585,15 +585,15 @@\n Control.Monad.Trans.State.Lazy.mapStateT\n @f\n @x\n @s\n @g\n @x\n (h @(x, s))]\n-66e1152962a84f93dbbac1c45045d2db\n+de553979aca5143bef7cdb53a42224d7\n $fFunctorTTYPETYPEStateT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.State.Strict.StateT s f x\n -> Control.Monad.Trans.State.Strict.StateT s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -605,39 +605,39 @@\n Control.Monad.Trans.State.Strict.mapStateT\n @f\n @x\n @s\n @g\n @x\n (h @(x, s))]\n-5e6bc7e25303cd947b9dc77c6db687e8\n+c4fb4a0b5490feb56858bc28bfc37d73\n $fFunctorTTYPETYPEWriterT ::\n FunctorT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEWriterT_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-5ad9d1e632acf1842b420a927cd1ae32\n+4aca92109b9ef3456c950c0f33cd1c9c\n $fFunctorTTYPETYPEWriterT0 ::\n FunctorT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEWriterT0_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-173ab081d325545f46a602a169110917\n+57361af68ccc414ad03e6ac06b27f25f\n $fFunctorTTYPETYPEWriterT0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Writer.Lazy.WriterT w f x\n -> Control.Monad.Trans.Writer.Lazy.WriterT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -650,15 +650,15 @@\n @f\n @x\n @w\n @g\n @x\n @w\n (h @(x, w))]\n-042b5e2819a4ea9c37ef8b924eb75c40\n+a1f6e56b19f4a17ce2171f2e97b2325a\n $fFunctorTTYPETYPEWriterT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Writer.Strict.WriterT w f x\n -> Control.Monad.Trans.Writer.Strict.WriterT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -671,27 +671,27 @@\n @f\n @x\n @w\n @g\n @x\n @w\n (h @(x, w))]\n-ec1d6ca38370f16e8fc1367f9141f64a\n+0c6aeb3926dc2cc830fac43ee9f4f2d5\n $fFunctorTk'k'Backwards ::\n FunctorT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Backwards_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-fe0e8f2a2be09e78fb0b16fe2de09980\n+136c4ee020f965ec86a828d71160cc28\n $fFunctorTk'k'Backwards_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Control.Applicative.Backwards.Backwards f x\n -> Control.Applicative.Backwards.Backwards g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n@@ -711,30 +711,30 @@\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R) _N)]\n-7ad8cb484a41dbd6f300d1f8ca254d6e\n+ff5ceee39a287f152f2d17bd6ad9b3dc\n $fFunctorTk'k'Compose ::\n GHC.Base.Functor f => FunctorT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseTrue>\n $fFunctorTk'k'Compose_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: <* -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorT[0]\n _N\n _N\n _N))]\n-fb9c9e79c802674166f113e9ccdca1b2\n+5e2a64be7b195e70dfbea4615d8cc369\n $fFunctorTk'k'Compose_$ctmap ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Functor f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x\n -> Data.Functor.Compose.Compose f g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -768,27 +768,27 @@\n f f1 x>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-33431e4280ebe8c97b2a922121ca39d4\n+f28929514f9296179a086899240a4548\n $fFunctorTk'k'IdentityT ::\n FunctorT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'IdentityT_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-970c6be34d0fd83a5d72b1ff608d0118\n+766906b1dd27dba137f68e89764785e0\n $fFunctorTk'k'IdentityT_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Control.Monad.Trans.Identity.IdentityT f x\n -> Control.Monad.Trans.Identity.IdentityT g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n@@ -808,27 +808,27 @@\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R) _N)]\n-02bc4b9a04bc603350c37d6208a88466\n+1fb667f5856e71a313c7ad7ac2b72268\n $fFunctorTk'k'Product ::\n forall k' (f :: k' -> *). FunctorT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Product_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-2eb80c05beb1f7d007db9eb0c12d4710\n+73dee846534c79f0e7bebcdd29510be6\n $fFunctorTk'k'Product_$ctmap ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f2 a -> g a)\n -> Data.Functor.Product.Product f1 f2 x\n -> Data.Functor.Product.Product f1 g x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,L)>, CPR: 1,\n@@ -839,26 +839,26 @@\n @f1 :: k' -> *\n @g :: k' -> *\n @x :: k'\n (h['GHC.Types.Many] :: forall (a :: k'). f1 a -> g a)\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f f1 x) ->\n case ds of wild { Data.Functor.Product.Pair fa ga ->\n Data.Functor.Product.Pair @k' @f @g @x fa (h @x ga) }]\n-646a1bd62e36added23f6c3777d28083\n+f7e344d5e1c8ed3b9d4486e3120f5c00\n $fFunctorTk'k'Reverse :: FunctorT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Reverse_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-af8441c327cbe4141c30b6fc07af7fc7\n+ad9a3f70784430f065270fbe65f2524c\n $fFunctorTk'k'Reverse_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Data.Functor.Reverse.Reverse f x\n -> Data.Functor.Reverse.Reverse g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n@@ -874,26 +874,26 @@\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)]\n-d5b7f1d8b633420915e3fb510ddf5110\n+a2447f8d3efc4b1eeaa214c7df9811da\n $fFunctorTk'k'Sum ::\n forall k' (f :: k' -> *). FunctorT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Sum_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N).\n Sym (N:FunctorT[0] _N _N _N))]\n-ddf4e547d63168da3d6d942b13340512\n+0f7b8eb6eee60e1825339cd675931284\n $fFunctorTk'k'Sum_$ctmap ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f2 a -> g a)\n -> Data.Functor.Sum.Sum f1 f2 x -> Data.Functor.Sum.Sum f1 g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -904,15 +904,15 @@\n @x :: k'\n (h['GHC.Types.Many] :: forall (a :: k'). f1 a -> g a)\n (ds['GHC.Types.Many] :: Data.Functor.Sum.Sum f f1 x) ->\n case ds of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @g @x fa\n Data.Functor.Sum.InR ga\n -> Data.Functor.Sum.InR @k' @f @g @x (h @x ga) }]\n-321c5d569ba981a11deac24a9712018a\n+51ea0b3d6e3cd2ef2483f8f41d4612e6\n $fGFunctorkk11fgRecRec ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorT t) =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -943,15 +943,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-9b0ef7003749f1013695e0679a699c00\n+a777ecdd7d2d1a2b6df07d6b892197b8\n $fGFunctorkk11fgRecRec0 ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Functor h, FunctorT t) =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -979,15 +979,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-622512669fdafbc6a8e43418aeb2b6c5\n+5873133930721fd8a716fe4698a2b413\n $fGFunctorkk11fgRecRec0_$cgmap ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Functor h, FunctorT t) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (h (t (P 1 f) x)) (h (t f x)) x1\n@@ -1045,15 +1045,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-971c73808f0d53c800ee932121404180\n+d3b04fd425494916bc5c9999d53e00ff\n $fGFunctorkk11fgRecRec1 ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n FunctorT t =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -1077,15 +1077,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-e1d7c17504fa3e078d5efc080da8bd64\n+274bf3b199b318af39316b3670f52340\n $fGFunctorkk11fgRecRec1_$cgmap ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n FunctorT t =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x) x1\n@@ -1132,15 +1132,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-a84a997cd0acab9382b84cdbaa709147\n+5504587bd2bf2471df57b7d5b649b8de\n $fGFunctorkk11fgRecRec_$cgmap ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorT t) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n@@ -1211,90 +1211,90 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-96b8ab5613539eac8ef062e5dc9454ce\n+6885a85777b51428ac22d1b57b63e27e\n $tcFunctorT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6751053597812226781#Word64\n- 8775020075333287872#Word64\n+ 14658597566253021173#Word64\n+ 7903216527128616906#Word64\n $trModule\n $tcFunctorT2\n 2#\n $tcFunctorT1]\n-c6b7d77dcbe23e48f3842ff36b563a09\n+c19ceb8cffdeb002fd07190890b62e14\n $tcFunctorT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-1b119a0f711d9f056ed744e214c80da2\n+1ad19da9ca2dfbc9167cc91c08914778\n $tcFunctorT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFunctorT3]\n-c9cc504dc511bdea8aa2b95dca76c36f\n+1041d5040913618ed5635cc426a66cad\n $tcFunctorT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"FunctorT\"#]\n-995d5aa18cc07d449cd305406cfad6cc\n+f0f513c879a9c35f1bc19205858a1271\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-e9021bde4ee6ca4e6b30a14d276976e7\n+90f96debfe43404598abde3bab41d31f\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4a9e5f1307d0dc14da58a7c5807fe190\n+7defdc4a0081e46639d2628b408b4ac0\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.FunctorT\"#]\n-2410030ef5e3623bd42235a34f2daa83\n+b93436141ffd0f5fe3b3b9e93e4cf463\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fd8d4f8c143806ea4f2a02a454cef830\n+ea099a2e4a80a0ff037ee77a422ee501\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e275e404b4b864adaccda0febb583db6\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+6c54821e942bab4e5445265620155e64\n type CanDeriveFunctorT :: forall {k} {k1}.\n ((k -> *) -> k1 -> *)\n -> (k -> *) -> (k -> *) -> k1 -> GHC.Types.Constraint\n type CanDeriveFunctorT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Barbies.Generics.Functor.GFunctor\n 1\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x)))\n :: GHC.Types.Constraint\n-e3d3793569ff8c641c51801746e07066\n+c4169bad3141c057cd702685c69e0cc5\n type FunctorT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class FunctorT t where\n tmap :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n default tmap :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n CanDeriveFunctorT t f g x =>\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n-9508a024aed85a3d37cff0009fdc4009\n+c8e297581604b9347d5c6e275575738a\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-ac6ad64c7c9d3bb0d77a6444aa18982e\n+b0b9ea25355255512679237c5c946bd9\n gtmapDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (g :: k1 -> *) (x :: k2).\n CanDeriveFunctorT t f g x =>\n (forall (a :: k1). f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.dyn_hi", "comments": ["Files 93% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,29 +1,29 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.MonadT 9066\n- interface hash: 0a50f10a127b3397b4d19c861f899242\n- ABI hash: 28d0df4fa16d3ae0e9b8f569b12ba9f0\n- export-list hash: 9054f11064e0de5d5aff661c18eca5f0\n+ interface hash: e21626e19dc66c31865687c70016e1c4\n+ ABI hash: d8244999abaa79f27abd2c0dcc73de32\n+ export-list hash: 8552d8625d95205221b624099fdcc01c\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: b24a144faf0a42ecdffc6be1d6318598\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a1c28b3136060853fd5ab89156561301\n sig of: Nothing\n used TH splices: False\n where\n exports:\n MonadT{tembed tjoin tlift}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -33,33 +33,33 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Control.Monad a8552ca25f5dcd7ee6fb611cbb0ec055\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Control.Applicative.Backwards 3fb0e914e7e0118ebd824606855e73c5\n import -/ Control.Applicative.Lift 4c061bd1a73d1b6820b48c8d4eb45f87\n import -/ Control.Monad.Trans.Identity c6d9f8408d560420ccee35cf25d55d29\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n-9bacd2a9178e26acd16cdb08a7b633d7\n+28c60546edafdeb1666f65fa7d1c7763\n $dmtembed ::\n forall {k'} (t :: (k' -> *) -> k' -> *) (f :: k' -> *)\n (g :: k' -> *) (a :: k').\n (MonadT t, MonadT t) =>\n (forall (x :: k'). f x -> t g x) -> t f a -> t g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -82,15 +82,15 @@\n (Barbies.Internal.FunctorT.N:FunctorT[0] _N _N _N)\n @f\n @(t g)\n @a\n eta1\n } in\n \\ (x['GHC.Types.Many] :: t f a) -> f1 (g1 x)]\n-c65acbe78950f50f7d2ec97999ee0220\n+41cbd8e261552eb99aaf6ab4487e11d7\n $dmtjoin ::\n forall {k'} (t :: (k' -> *) -> k' -> *) (f :: k' -> *) (a :: k').\n MonadT t =>\n t (t f) a -> t f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -104,15 +104,15 @@\n @t\n $dMonadT\n @(t f)\n @f\n @a\n $dMonadT\n (\\ @x :: k' -> GHC.Base.id @(t f x))]\n-118b6d5b10e0d1a6d7a47f879807ef82\n+1e8308b97a214a6202198e1b0eff8057\n $fMonadTTYPELift :: MonadT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @Control.Applicative.Lift.Lift\n@@ -127,15 +127,15 @@\n (ds['GHC.Types.Many] :: Control.Applicative.Lift.Lift\n (Control.Applicative.Lift.Lift f) a) ->\n case ds of wild {\n Control.Applicative.Lift.Pure a1\n -> Control.Applicative.Lift.Pure @f @a a1\n Control.Applicative.Lift.Other ds1 -> ds1 })\n $fMonadTTYPELift_$ctembed]\n-25153f64a7906362b3706308af90eb18\n+480afbfeb63e0408ab400cc0e9815e4f\n $fMonadTTYPELift_$ctembed ::\n MonadT Control.Applicative.Lift.Lift =>\n (forall x. f x -> Control.Applicative.Lift.Lift g x)\n -> Control.Applicative.Lift.Lift f a\n -> Control.Applicative.Lift.Lift g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n@@ -147,15 +147,15 @@\n (ds['GHC.Types.Many] :: forall x.\n f x -> Control.Applicative.Lift.Lift g x)\n (x['GHC.Types.Many] :: Control.Applicative.Lift.Lift f a) ->\n case x of wild {\n Control.Applicative.Lift.Pure x1\n -> Control.Applicative.Lift.Pure @g @a x1\n Control.Applicative.Lift.Other e -> ds @a e }]\n-52c2490c3f22473a94bb0359fa25053c\n+0957f20d814c06e6b6441efb1086f0b5\n $fMonadTTYPEProduct ::\n GHC.Base.Alternative f => MonadT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n (v['GHC.Types.Many] :: GHC.Base.Alternative f).\n@@ -164,15 +164,15 @@\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fMonadTTYPEProduct_$ctlift @f v)\n ($fMonadTTYPEProduct_$ctjoin @f v)\n ($fMonadTTYPEProduct_$ctembed @f v)]\n-5882249195c48b1e8bb26a4af03bbb88\n+d74cac095beebc42ca44d41eff109099\n $fMonadTTYPEProduct_$ctembed ::\n (GHC.Base.Alternative f,\n MonadT (Data.Functor.Product.Product f)) =>\n (forall x. f1 x -> Data.Functor.Product.Product f g x)\n -> Data.Functor.Product.Product f f1 a\n -> Data.Functor.Product.Product f g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -206,15 +206,15 @@\n f (Data.Functor.Product.Product f g) a\n -> Data.Functor.Product.Product f g a\n []\n = tjoin @(*) @(Data.Functor.Product.Product f) $dMonadT @g @a\n } in\n \\ (x['GHC.Types.Many] :: Data.Functor.Product.Product f f1 a) ->\n f2 (g1 x)]\n-01f527706546cfd9d8802e3287727c42\n+26e66049a00d6c71d89b41d5977467d8\n $fMonadTTYPEProduct_$ctjoin ::\n GHC.Base.Alternative f =>\n Data.Functor.Product.Product\n f (Data.Functor.Product.Product f f1) a\n -> Data.Functor.Product.Product f f1 a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,1!P(L,L))>,\n@@ -231,15 +231,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @a\n (GHC.Base.<|> @f $dAlternative @a fa fa')\n ga } }]\n-69d8b5fc3fe31c8d9d629ddb3d887990\n+ff4ad9b5aae0f6046be3079bc5999c11\n $fMonadTTYPEProduct_$ctlift ::\n GHC.Base.Alternative f =>\n f1 a -> Data.Functor.Product.Product f f1 a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -251,15 +251,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @a\n (GHC.Base.empty @f $dAlternative @a)\n eta]\n-a7e8c4bb9d6a7a22cba2eee57e2493c5\n+6a7058f5fb0e5c44f2f485d1adc5a639\n $fMonadTTYPEReaderT ::\n MonadT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @r.\n @(*)\n@@ -285,15 +285,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Control.Monad.Trans.Reader.ReaderT r g x>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R _R _N))]\n-a8f7f6b3397efa4badda451827d90bbe\n+b71dacab6625d3bd93f9cfdc565a993c\n $fMonadTTYPEReaderT1 ::\n MonadT (Control.Monad.Trans.Reader.ReaderT r) =>\n (forall x. f x -> Control.Monad.Trans.Reader.ReaderT r g x)\n -> Control.Monad.Trans.Reader.ReaderT r f a -> r -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,C(1,L))>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n@@ -311,15 +311,15 @@\n @a\n (x `cast`\n (Control.Monad.Trans.Reader.N:ReaderT[0] _R _R _N)\n eta))\n `cast`\n (Control.Monad.Trans.Reader.N:ReaderT[0] _R _R _N)\n eta]\n-387cd47022c017fe6c3789fa6e91033a\n+d9f14234c2de4b8e50b291c3102b6d3d\n $fMonadTTYPEReaderT_$ctjoin ::\n Control.Monad.Trans.Reader.ReaderT\n r (Control.Monad.Trans.Reader.ReaderT r f) a\n -> Control.Monad.Trans.Reader.ReaderT r f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -340,15 +340,15 @@\n e)\n `cast`\n (forall (r :: <*>_N) (f :: <* -> *>_N) (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R _R _N))]\n-0e7e3e84970cd45bd3108e257da98ec9\n+0615702270b6e614cc44c52c68ee6666\n $fMonadTk'Backwards ::\n MonadT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -375,15 +375,15 @@\n %<'GHC.Types.Many>_N ->_R Control.Applicative.Backwards.N:Backwards[0]\n _N\n (Control.Applicative.Backwards.N:Backwards[0]\n _N\n (Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R))) _N)\n ($fMonadTk'Backwards_$ctembed @k')]\n-e9377416f122369268d2acef22fd229b\n+1532e8c770aa8cac7429d0870b2b4bdd\n $fMonadTk'Backwards_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Control.Applicative.Backwards.Backwards =>\n (forall (x :: k').\n f x -> Control.Applicative.Backwards.Backwards g x)\n -> Control.Applicative.Backwards.Backwards f a\n -> Control.Applicative.Backwards.Backwards g a\n@@ -400,15 +400,15 @@\n f x -> Control.Applicative.Backwards.Backwards g x)\n (x['GHC.Types.Many] :: Control.Applicative.Backwards.Backwards\n f a) ->\n ds\n @a\n x `cast`\n (Control.Applicative.Backwards.N:Backwards[0] _N _R _N)]\n-45b4f7a3a652d3d9d44dedb0020ecec6\n+0589dbbc67501f09dcd3996f9f880ace\n $fMonadTk'Compose ::\n GHC.Base.Monad f => MonadT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n Inline: CONLIKE,\n@@ -425,15 +425,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fMonadTk'Compose_$ctlift @k' @f v)\n ($fMonadTk'Compose_$ctjoin @k' @f v)\n ($fMonadTk'Compose_$ctembed @k' @f v)]\n-be1ea02099fce61ace3ca46f00ccefa2\n+8c7ed97238dc0315d481395f78cffe9e\n $fMonadTk'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n GHC.Base.Monad f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1P(1C(1,C(1,L)),A),A,A,A,A,A),A,A,A)>,\n@@ -452,15 +452,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-f5dca53ed1114915b0a27ebe9dcbb203\n+618c76c50a42fc820c08c804bee65d33\n $fMonadTk'Compose_$ctembed ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (g :: k' -> *) (a :: k').\n (GHC.Base.Monad f, MonadT (Data.Functor.Compose.Compose f)) =>\n (forall (x :: k'). f1 x -> Data.Functor.Compose.Compose f g x)\n -> Data.Functor.Compose.Compose f f1 a\n -> Data.Functor.Compose.Compose f g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -495,15 +495,15 @@\n f (Data.Functor.Compose.Compose f g) a\n -> Data.Functor.Compose.Compose f g a\n []\n = tjoin @k' @(Data.Functor.Compose.Compose f) $dMonadT @g @a\n } in\n \\ (x['GHC.Types.Many] :: Data.Functor.Compose.Compose f f1 a) ->\n f2 (g1 x)]\n-1f8de7477da37fa98d71ff613e7ba250\n+c5a44f5d23dc69b85331678fe2a6565d\n $fMonadTk'Compose_$ctjoin ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (a :: k').\n GHC.Base.Monad f =>\n Data.Functor.Compose.Compose\n f (Data.Functor.Compose.Compose f f1) a\n -> Data.Functor.Compose.Compose f f1 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -546,15 +546,15 @@\n f (Data.Functor.Compose.Compose f f1) a>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-ec7d2229e94620f590c2dd38779f18b3\n+e1d735864010777818b4d722034d0717\n $fMonadTk'Compose_$ctlift ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (a :: k').\n GHC.Base.Monad f =>\n f1 a -> Data.Functor.Compose.Compose f f1 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(1!P(A,1C(1,L),A,A,A,A),A,A,A)>,\n Inline: (sat-args=0),\n@@ -573,15 +573,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-272828a32c8fb13bd9e03b9c66b58c8a\n+7d151c2981735250f79219e292d9a9b7\n $fMonadTk'IdentityT ::\n MonadT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -608,15 +608,15 @@\n %<'GHC.Types.Many>_N ->_R Control.Monad.Trans.Identity.N:IdentityT[0]\n _N\n (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N\n (Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R))) _N)\n ($fMonadTk'IdentityT_$ctembed @k')]\n-9ab47fe5eb246e4d8a7e4bc55beaa77b\n+346b209b9c8a62eb36a9df2646165cc4\n $fMonadTk'IdentityT_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Control.Monad.Trans.Identity.IdentityT =>\n (forall (x :: k').\n f x -> Control.Monad.Trans.Identity.IdentityT g x)\n -> Control.Monad.Trans.Identity.IdentityT f a\n -> Control.Monad.Trans.Identity.IdentityT g a\n@@ -633,15 +633,15 @@\n f x -> Control.Monad.Trans.Identity.IdentityT g x)\n (x['GHC.Types.Many] :: Control.Monad.Trans.Identity.IdentityT\n f a) ->\n ds\n @a\n x `cast`\n (Control.Monad.Trans.Identity.N:IdentityT[0] _N _R _N)]\n-fca23ac07318365c475d876623910e74\n+d9bdd8638d82453693f11333fc1d955b\n $fMonadTk'Reverse :: MonadT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @Data.Functor.Reverse.Reverse\n@@ -666,15 +666,15 @@\n %<'GHC.Types.Many>_N ->_R Data.Functor.Reverse.N:Reverse[0]\n _N\n (Data.Functor.Reverse.N:Reverse[0]\n _N\n (Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R))) _N)\n ($fMonadTk'Reverse_$ctembed @k')]\n-2ac7928ed4eb7f11db5c89eefc35b656\n+cc22937039ae3dc63db1c3a9583f4a93\n $fMonadTk'Reverse_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Data.Functor.Reverse.Reverse =>\n (forall (x :: k'). f x -> Data.Functor.Reverse.Reverse g x)\n -> Data.Functor.Reverse.Reverse f a\n -> Data.Functor.Reverse.Reverse g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -687,15 +687,15 @@\n ($dMonadT['GHC.Types.Many] :: MonadT Data.Functor.Reverse.Reverse)\n (ds['GHC.Types.Many] :: forall (x :: k').\n f x -> Data.Functor.Reverse.Reverse g x)\n (x['GHC.Types.Many] :: Data.Functor.Reverse.Reverse f a) ->\n ds\n @a\n x `cast` (Data.Functor.Reverse.N:Reverse[0] _N _R _N)]\n-d6894279343bee15c30d2a46c6afe1fc\n+bb118c3edaf2ae484cb7d1e02f143207\n $fMonadTk'Sum ::\n forall k' (f :: k' -> *). MonadT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n @k'\n@@ -704,15 +704,15 @@\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n (\\ @f1 :: k' -> * @a :: k' (ds['GHC.Types.Many] :: f1 a) ->\n Data.Functor.Sum.InR @k' @f @f1 @a ds)\n ($fMonadTk'Sum_$ctjoin @k' @f)\n ($fMonadTk'Sum_$ctembed @k' @f)]\n-1aa3c8888cfbea50b070c8d82a083995\n+f2d98001dff692996c260d63bc2153e3\n $fMonadTk'Sum_$ctembed ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT (Data.Functor.Sum.Sum f1) =>\n (forall (x :: k'). f2 x -> Data.Functor.Sum.Sum f1 g x)\n -> Data.Functor.Sum.Sum f1 f2 a -> Data.Functor.Sum.Sum f1 g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n@@ -725,15 +725,15 @@\n ($dMonadT['GHC.Types.Many] :: MonadT (Data.Functor.Sum.Sum f))\n (ds['GHC.Types.Many] :: forall (x :: k').\n f1 x -> Data.Functor.Sum.Sum f g x)\n (x['GHC.Types.Many] :: Data.Functor.Sum.Sum f f1 a) ->\n case x of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @g @a fa\n Data.Functor.Sum.InR ga -> ds @a ga }]\n-5ab908c707f41b649cff04e6a93ee688\n+8d53e96331aeab48cbfa0556ff5cd684\n $fMonadTk'Sum_$ctjoin ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (a :: k').\n Data.Functor.Sum.Sum f1 (Data.Functor.Sum.Sum f1 f2) a\n -> Data.Functor.Sum.Sum f1 f2 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -742,64 +742,64 @@\n @f1 :: k' -> *\n @a :: k'\n (ds['GHC.Types.Many] :: Data.Functor.Sum.Sum\n f (Data.Functor.Sum.Sum f f1) a) ->\n case ds of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @f1 @a fa\n Data.Functor.Sum.InR ds1 -> ds1 }]\n-7dac82c3185121b0a978cb162c501420\n+a052e400a5d8236c20ecf381cc805a45\n $tcMonadT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3580657594039770991#Word64\n- 15043022534608447110#Word64\n+ 4185748482054427665#Word64\n+ 16106999681576663642#Word64\n $trModule\n $tcMonadT2\n 1#\n $tcMonadT1]\n-38a1054205666877893c9ab559ed3c9d\n+71d9972b35c954a82a2e80c094de1865\n $tcMonadT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a6ab65e404e8c85f74575ccb89e3f711\n+6631c6fbe2af33d23eb6189c19df90b6\n $tcMonadT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcMonadT3]\n-72d5c40ca5adbce17bb492232fe7d45f\n+ff1b9596d9bff0a9973d3640f08a8fde\n $tcMonadT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"MonadT\"#]\n-83763ad1247bc44b5aa5279131a9551b\n+683f50c8eef617167a73dbe7d0da3259\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-06ab1c76e69d2d079c35e048effa5906\n+94050f02e16bc2a429be27402e2ac554\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-be7d31b0b4539d0a0b4c08de4d454fdc\n+8128d766ba0d2133060a8447ef3ee543\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.MonadT\"#]\n-f80382551d6d88f18b6a9c0094d4cdb3\n+cffcac7810ae7c224c1f46b261802f39\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-20a3304453d1588015b5eeb6dd949790\n+0e07036d0d7936af110208dd72d26d55\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e84a8234960c5d20f03388d207c2d8b6\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+d839d0f99cb980a431ecca3b76659b0d\n type MonadT :: forall {k'}.\n ((k' -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => MonadT t where\n tlift :: forall (f :: k' -> *) (a :: k'). f a -> t f a\n tjoin :: forall (f :: k' -> *) (a :: k'). t (t f) a -> t f a\n tembed :: forall (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT t =>\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.hi", "comments": ["Files 92% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,29 +1,29 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.MonadT 9066\n- interface hash: 0a50f10a127b3397b4d19c861f899242\n- ABI hash: 28d0df4fa16d3ae0e9b8f569b12ba9f0\n- export-list hash: 9054f11064e0de5d5aff661c18eca5f0\n+ interface hash: e21626e19dc66c31865687c70016e1c4\n+ ABI hash: d8244999abaa79f27abd2c0dcc73de32\n+ export-list hash: 8552d8625d95205221b624099fdcc01c\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: b8596bdafa116f46285165b129defa59\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a1c28b3136060853fd5ab89156561301\n sig of: Nothing\n used TH splices: False\n where\n exports:\n MonadT{tembed tjoin tlift}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -33,33 +33,33 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Control.Monad a8552ca25f5dcd7ee6fb611cbb0ec055\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Control.Applicative.Backwards 3fb0e914e7e0118ebd824606855e73c5\n import -/ Control.Applicative.Lift 4c061bd1a73d1b6820b48c8d4eb45f87\n import -/ Control.Monad.Trans.Identity c6d9f8408d560420ccee35cf25d55d29\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n-9bacd2a9178e26acd16cdb08a7b633d7\n+28c60546edafdeb1666f65fa7d1c7763\n $dmtembed ::\n forall {k'} (t :: (k' -> *) -> k' -> *) (f :: k' -> *)\n (g :: k' -> *) (a :: k').\n (MonadT t, MonadT t) =>\n (forall (x :: k'). f x -> t g x) -> t f a -> t g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -82,15 +82,15 @@\n (Barbies.Internal.FunctorT.N:FunctorT[0] _N _N _N)\n @f\n @(t g)\n @a\n eta1\n } in\n \\ (x['GHC.Types.Many] :: t f a) -> f1 (g1 x)]\n-c65acbe78950f50f7d2ec97999ee0220\n+41cbd8e261552eb99aaf6ab4487e11d7\n $dmtjoin ::\n forall {k'} (t :: (k' -> *) -> k' -> *) (f :: k' -> *) (a :: k').\n MonadT t =>\n t (t f) a -> t f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -104,15 +104,15 @@\n @t\n $dMonadT\n @(t f)\n @f\n @a\n $dMonadT\n (\\ @x :: k' -> GHC.Base.id @(t f x))]\n-118b6d5b10e0d1a6d7a47f879807ef82\n+1e8308b97a214a6202198e1b0eff8057\n $fMonadTTYPELift :: MonadT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @Control.Applicative.Lift.Lift\n@@ -127,15 +127,15 @@\n (ds['GHC.Types.Many] :: Control.Applicative.Lift.Lift\n (Control.Applicative.Lift.Lift f) a) ->\n case ds of wild {\n Control.Applicative.Lift.Pure a1\n -> Control.Applicative.Lift.Pure @f @a a1\n Control.Applicative.Lift.Other ds1 -> ds1 })\n $fMonadTTYPELift_$ctembed]\n-25153f64a7906362b3706308af90eb18\n+480afbfeb63e0408ab400cc0e9815e4f\n $fMonadTTYPELift_$ctembed ::\n MonadT Control.Applicative.Lift.Lift =>\n (forall x. f x -> Control.Applicative.Lift.Lift g x)\n -> Control.Applicative.Lift.Lift f a\n -> Control.Applicative.Lift.Lift g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n@@ -147,15 +147,15 @@\n (ds['GHC.Types.Many] :: forall x.\n f x -> Control.Applicative.Lift.Lift g x)\n (x['GHC.Types.Many] :: Control.Applicative.Lift.Lift f a) ->\n case x of wild {\n Control.Applicative.Lift.Pure x1\n -> Control.Applicative.Lift.Pure @g @a x1\n Control.Applicative.Lift.Other e -> ds @a e }]\n-52c2490c3f22473a94bb0359fa25053c\n+0957f20d814c06e6b6441efb1086f0b5\n $fMonadTTYPEProduct ::\n GHC.Base.Alternative f => MonadT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n (v['GHC.Types.Many] :: GHC.Base.Alternative f).\n@@ -164,15 +164,15 @@\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fMonadTTYPEProduct_$ctlift @f v)\n ($fMonadTTYPEProduct_$ctjoin @f v)\n ($fMonadTTYPEProduct_$ctembed @f v)]\n-5882249195c48b1e8bb26a4af03bbb88\n+d74cac095beebc42ca44d41eff109099\n $fMonadTTYPEProduct_$ctembed ::\n (GHC.Base.Alternative f,\n MonadT (Data.Functor.Product.Product f)) =>\n (forall x. f1 x -> Data.Functor.Product.Product f g x)\n -> Data.Functor.Product.Product f f1 a\n -> Data.Functor.Product.Product f g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -206,15 +206,15 @@\n f (Data.Functor.Product.Product f g) a\n -> Data.Functor.Product.Product f g a\n []\n = tjoin @(*) @(Data.Functor.Product.Product f) $dMonadT @g @a\n } in\n \\ (x['GHC.Types.Many] :: Data.Functor.Product.Product f f1 a) ->\n f2 (g1 x)]\n-01f527706546cfd9d8802e3287727c42\n+26e66049a00d6c71d89b41d5977467d8\n $fMonadTTYPEProduct_$ctjoin ::\n GHC.Base.Alternative f =>\n Data.Functor.Product.Product\n f (Data.Functor.Product.Product f f1) a\n -> Data.Functor.Product.Product f f1 a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,1!P(L,L))>,\n@@ -231,15 +231,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @a\n (GHC.Base.<|> @f $dAlternative @a fa fa')\n ga } }]\n-69d8b5fc3fe31c8d9d629ddb3d887990\n+ff4ad9b5aae0f6046be3079bc5999c11\n $fMonadTTYPEProduct_$ctlift ::\n GHC.Base.Alternative f =>\n f1 a -> Data.Functor.Product.Product f f1 a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -251,15 +251,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @a\n (GHC.Base.empty @f $dAlternative @a)\n eta]\n-a7e8c4bb9d6a7a22cba2eee57e2493c5\n+6a7058f5fb0e5c44f2f485d1adc5a639\n $fMonadTTYPEReaderT ::\n MonadT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @r.\n @(*)\n@@ -285,15 +285,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Control.Monad.Trans.Reader.ReaderT r g x>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R _R _N))]\n-a8f7f6b3397efa4badda451827d90bbe\n+b71dacab6625d3bd93f9cfdc565a993c\n $fMonadTTYPEReaderT1 ::\n MonadT (Control.Monad.Trans.Reader.ReaderT r) =>\n (forall x. f x -> Control.Monad.Trans.Reader.ReaderT r g x)\n -> Control.Monad.Trans.Reader.ReaderT r f a -> r -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,C(1,L))>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n@@ -311,15 +311,15 @@\n @a\n (x `cast`\n (Control.Monad.Trans.Reader.N:ReaderT[0] _R _R _N)\n eta))\n `cast`\n (Control.Monad.Trans.Reader.N:ReaderT[0] _R _R _N)\n eta]\n-387cd47022c017fe6c3789fa6e91033a\n+d9f14234c2de4b8e50b291c3102b6d3d\n $fMonadTTYPEReaderT_$ctjoin ::\n Control.Monad.Trans.Reader.ReaderT\n r (Control.Monad.Trans.Reader.ReaderT r f) a\n -> Control.Monad.Trans.Reader.ReaderT r f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -340,15 +340,15 @@\n e)\n `cast`\n (forall (r :: <*>_N) (f :: <* -> *>_N) (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R _R _N))]\n-0e7e3e84970cd45bd3108e257da98ec9\n+0615702270b6e614cc44c52c68ee6666\n $fMonadTk'Backwards ::\n MonadT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -375,15 +375,15 @@\n %<'GHC.Types.Many>_N ->_R Control.Applicative.Backwards.N:Backwards[0]\n _N\n (Control.Applicative.Backwards.N:Backwards[0]\n _N\n (Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R))) _N)\n ($fMonadTk'Backwards_$ctembed @k')]\n-e9377416f122369268d2acef22fd229b\n+1532e8c770aa8cac7429d0870b2b4bdd\n $fMonadTk'Backwards_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Control.Applicative.Backwards.Backwards =>\n (forall (x :: k').\n f x -> Control.Applicative.Backwards.Backwards g x)\n -> Control.Applicative.Backwards.Backwards f a\n -> Control.Applicative.Backwards.Backwards g a\n@@ -400,15 +400,15 @@\n f x -> Control.Applicative.Backwards.Backwards g x)\n (x['GHC.Types.Many] :: Control.Applicative.Backwards.Backwards\n f a) ->\n ds\n @a\n x `cast`\n (Control.Applicative.Backwards.N:Backwards[0] _N _R _N)]\n-45b4f7a3a652d3d9d44dedb0020ecec6\n+0589dbbc67501f09dcd3996f9f880ace\n $fMonadTk'Compose ::\n GHC.Base.Monad f => MonadT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n Inline: CONLIKE,\n@@ -425,15 +425,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fMonadTk'Compose_$ctlift @k' @f v)\n ($fMonadTk'Compose_$ctjoin @k' @f v)\n ($fMonadTk'Compose_$ctembed @k' @f v)]\n-be1ea02099fce61ace3ca46f00ccefa2\n+8c7ed97238dc0315d481395f78cffe9e\n $fMonadTk'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n GHC.Base.Monad f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1P(1C(1,C(1,L)),A),A,A,A,A,A),A,A,A)>,\n@@ -452,15 +452,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-f5dca53ed1114915b0a27ebe9dcbb203\n+618c76c50a42fc820c08c804bee65d33\n $fMonadTk'Compose_$ctembed ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (g :: k' -> *) (a :: k').\n (GHC.Base.Monad f, MonadT (Data.Functor.Compose.Compose f)) =>\n (forall (x :: k'). f1 x -> Data.Functor.Compose.Compose f g x)\n -> Data.Functor.Compose.Compose f f1 a\n -> Data.Functor.Compose.Compose f g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -495,15 +495,15 @@\n f (Data.Functor.Compose.Compose f g) a\n -> Data.Functor.Compose.Compose f g a\n []\n = tjoin @k' @(Data.Functor.Compose.Compose f) $dMonadT @g @a\n } in\n \\ (x['GHC.Types.Many] :: Data.Functor.Compose.Compose f f1 a) ->\n f2 (g1 x)]\n-1f8de7477da37fa98d71ff613e7ba250\n+c5a44f5d23dc69b85331678fe2a6565d\n $fMonadTk'Compose_$ctjoin ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (a :: k').\n GHC.Base.Monad f =>\n Data.Functor.Compose.Compose\n f (Data.Functor.Compose.Compose f f1) a\n -> Data.Functor.Compose.Compose f f1 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -546,15 +546,15 @@\n f (Data.Functor.Compose.Compose f f1) a>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-ec7d2229e94620f590c2dd38779f18b3\n+e1d735864010777818b4d722034d0717\n $fMonadTk'Compose_$ctlift ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (a :: k').\n GHC.Base.Monad f =>\n f1 a -> Data.Functor.Compose.Compose f f1 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(1!P(A,1C(1,L),A,A,A,A),A,A,A)>,\n Inline: (sat-args=0),\n@@ -573,15 +573,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-272828a32c8fb13bd9e03b9c66b58c8a\n+7d151c2981735250f79219e292d9a9b7\n $fMonadTk'IdentityT ::\n MonadT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -608,15 +608,15 @@\n %<'GHC.Types.Many>_N ->_R Control.Monad.Trans.Identity.N:IdentityT[0]\n _N\n (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N\n (Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R))) _N)\n ($fMonadTk'IdentityT_$ctembed @k')]\n-9ab47fe5eb246e4d8a7e4bc55beaa77b\n+346b209b9c8a62eb36a9df2646165cc4\n $fMonadTk'IdentityT_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Control.Monad.Trans.Identity.IdentityT =>\n (forall (x :: k').\n f x -> Control.Monad.Trans.Identity.IdentityT g x)\n -> Control.Monad.Trans.Identity.IdentityT f a\n -> Control.Monad.Trans.Identity.IdentityT g a\n@@ -633,15 +633,15 @@\n f x -> Control.Monad.Trans.Identity.IdentityT g x)\n (x['GHC.Types.Many] :: Control.Monad.Trans.Identity.IdentityT\n f a) ->\n ds\n @a\n x `cast`\n (Control.Monad.Trans.Identity.N:IdentityT[0] _N _R _N)]\n-fca23ac07318365c475d876623910e74\n+d9bdd8638d82453693f11333fc1d955b\n $fMonadTk'Reverse :: MonadT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @Data.Functor.Reverse.Reverse\n@@ -666,15 +666,15 @@\n %<'GHC.Types.Many>_N ->_R Data.Functor.Reverse.N:Reverse[0]\n _N\n (Data.Functor.Reverse.N:Reverse[0]\n _N\n (Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R))) _N)\n ($fMonadTk'Reverse_$ctembed @k')]\n-2ac7928ed4eb7f11db5c89eefc35b656\n+cc22937039ae3dc63db1c3a9583f4a93\n $fMonadTk'Reverse_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Data.Functor.Reverse.Reverse =>\n (forall (x :: k'). f x -> Data.Functor.Reverse.Reverse g x)\n -> Data.Functor.Reverse.Reverse f a\n -> Data.Functor.Reverse.Reverse g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -687,15 +687,15 @@\n ($dMonadT['GHC.Types.Many] :: MonadT Data.Functor.Reverse.Reverse)\n (ds['GHC.Types.Many] :: forall (x :: k').\n f x -> Data.Functor.Reverse.Reverse g x)\n (x['GHC.Types.Many] :: Data.Functor.Reverse.Reverse f a) ->\n ds\n @a\n x `cast` (Data.Functor.Reverse.N:Reverse[0] _N _R _N)]\n-d6894279343bee15c30d2a46c6afe1fc\n+bb118c3edaf2ae484cb7d1e02f143207\n $fMonadTk'Sum ::\n forall k' (f :: k' -> *). MonadT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n @k'\n@@ -704,15 +704,15 @@\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n (\\ @f1 :: k' -> * @a :: k' (ds['GHC.Types.Many] :: f1 a) ->\n Data.Functor.Sum.InR @k' @f @f1 @a ds)\n ($fMonadTk'Sum_$ctjoin @k' @f)\n ($fMonadTk'Sum_$ctembed @k' @f)]\n-1aa3c8888cfbea50b070c8d82a083995\n+f2d98001dff692996c260d63bc2153e3\n $fMonadTk'Sum_$ctembed ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT (Data.Functor.Sum.Sum f1) =>\n (forall (x :: k'). f2 x -> Data.Functor.Sum.Sum f1 g x)\n -> Data.Functor.Sum.Sum f1 f2 a -> Data.Functor.Sum.Sum f1 g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n@@ -725,15 +725,15 @@\n ($dMonadT['GHC.Types.Many] :: MonadT (Data.Functor.Sum.Sum f))\n (ds['GHC.Types.Many] :: forall (x :: k').\n f1 x -> Data.Functor.Sum.Sum f g x)\n (x['GHC.Types.Many] :: Data.Functor.Sum.Sum f f1 a) ->\n case x of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @g @a fa\n Data.Functor.Sum.InR ga -> ds @a ga }]\n-5ab908c707f41b649cff04e6a93ee688\n+8d53e96331aeab48cbfa0556ff5cd684\n $fMonadTk'Sum_$ctjoin ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (a :: k').\n Data.Functor.Sum.Sum f1 (Data.Functor.Sum.Sum f1 f2) a\n -> Data.Functor.Sum.Sum f1 f2 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -742,64 +742,64 @@\n @f1 :: k' -> *\n @a :: k'\n (ds['GHC.Types.Many] :: Data.Functor.Sum.Sum\n f (Data.Functor.Sum.Sum f f1) a) ->\n case ds of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @f1 @a fa\n Data.Functor.Sum.InR ds1 -> ds1 }]\n-7dac82c3185121b0a978cb162c501420\n+a052e400a5d8236c20ecf381cc805a45\n $tcMonadT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3580657594039770991#Word64\n- 15043022534608447110#Word64\n+ 4185748482054427665#Word64\n+ 16106999681576663642#Word64\n $trModule\n $tcMonadT2\n 1#\n $tcMonadT1]\n-38a1054205666877893c9ab559ed3c9d\n+71d9972b35c954a82a2e80c094de1865\n $tcMonadT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a6ab65e404e8c85f74575ccb89e3f711\n+6631c6fbe2af33d23eb6189c19df90b6\n $tcMonadT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcMonadT3]\n-72d5c40ca5adbce17bb492232fe7d45f\n+ff1b9596d9bff0a9973d3640f08a8fde\n $tcMonadT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"MonadT\"#]\n-83763ad1247bc44b5aa5279131a9551b\n+683f50c8eef617167a73dbe7d0da3259\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-06ab1c76e69d2d079c35e048effa5906\n+94050f02e16bc2a429be27402e2ac554\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-be7d31b0b4539d0a0b4c08de4d454fdc\n+8128d766ba0d2133060a8447ef3ee543\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.MonadT\"#]\n-f80382551d6d88f18b6a9c0094d4cdb3\n+cffcac7810ae7c224c1f46b261802f39\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-20a3304453d1588015b5eeb6dd949790\n+0e07036d0d7936af110208dd72d26d55\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e84a8234960c5d20f03388d207c2d8b6\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+d839d0f99cb980a431ecca3b76659b0d\n type MonadT :: forall {k'}.\n ((k' -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => MonadT t where\n tlift :: forall (f :: k' -> *) (a :: k'). f a -> t f a\n tjoin :: forall (f :: k' -> *) (a :: k'). t (t f) a -> t f a\n tembed :: forall (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT t =>\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.TraversableB [orphan module] 9066\n- interface hash: b46324d9fb7c2975544fa5fe617afdeb\n- ABI hash: 654d93e0e8e833b65be8b9e4ff4d2091\n- export-list hash: 3805bf6b28252b86b750a944ab2fee9b\n- orphan hash: 0d9ecce93af777ed45f4c55e1b7cd9cc\n+ interface hash: 166e92700c51a166df84f14e68cc3ccb\n+ ABI hash: 368d3e0ab41a9522330792b522601b7c\n+ export-list hash: ef1730ba79a439abadc8ee398aed68a3\n+ orphan hash: 6f07ed49a4cebceebe47d9b3167d2ca6\n flag hash: 085b3a61e9b81acb219ec58be19ba44b\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 954f0b465549c0404fb9a3c25eca6418\n sig of: Nothing\n used TH splices: False\n@@ -21,62 +21,62 @@\n bfoldMap\n bsequence\n bsequence'\n btraverse_\n gbtraverseDefault\n CanDeriveTraversableB\n TraversableB{btraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable fcc5069525cb18eabc5ee2f6d115ed72\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 1180a3c086dfc51eda564a1727916603\n- gtraverse e8c1062ed3782afa31b62442c3d713bd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 4b8cfed320a9759153c9f2e1178f5919\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr c0469e5e8a962b81eaa1e5c9b2f08584\n- tell 318bc913c1a4613db9a7000eccfc0ab8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 7ee4a8d101ceda4ac9aab730f3d525a0\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable f7816c2f9a39d58706aba55efd6f45bc\n+ gtraverse 1f5e285cee2799d79ed8662ff47a29d0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer 1ac8301754bf8fc4ae662af9201e1b17\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 56d7951edbc29f9bb80efe13a3b090ce\n+ tell 44d33a86554f81bd08a29cb9f096fae7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-47283e474f1fe025052b0221c40b9c67\n+00f6e9682dbfac7c71da05ffffd0c9fc\n $dmbtraverse ::\n forall k (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (TraversableB b, GHC.Base.Applicative e,\n CanDeriveTraversableB b f g) =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -273,15 +273,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n <*>_N\n <0>_N\n _N\n _N))_N\n _N)_R) _N))]\n-6d2f6ba3e05b3597325f6dc0e0a1ad65\n+b966ad5a54dff0d9699165a273cd6102\n $fGTraversableNaturalkk20fgRecRec ::\n forall k k2 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableB b) =>\n Barbies.Generics.Traversable.GTraversable\n 0\n@@ -311,15 +311,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-e3e356abce727e4b47a8318702d2e860\n+3c344892c697d6f2580fdd3c79fae49e\n $fGTraversableNaturalkk20fgRecRec0 ::\n forall k k2 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (Data.Traversable.Traversable h, TraversableB b) =>\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n@@ -347,15 +347,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-ee41558b39c2635ab8b9f4e5c7d9fb14\n+3f04431d03a28a24e5259185bf3773d7\n $fGTraversableNaturalkk20fgRecRec0_$cgtraverse ::\n forall k k2 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, TraversableB b,\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n@@ -413,15 +413,15 @@\n (f2\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-0bfb77f75ce7885c8a83ab58c4c0acd1\n+6373180a44b082031b8e87215384a32c\n $fGTraversableNaturalkk20fgRecRec1 ::\n forall k k2 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n TraversableB b =>\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n g\n@@ -444,15 +444,15 @@\n _N\n <0>_N\n _N\n _N\n _N\n _N))]\n-01b00cef25015c1c0470aa59f3166fdc\n+5e306f233e0e77102bbd4d79b2f928c8\n $fGTraversableNaturalkk20fgRecRec1_$cgtraverse ::\n forall k k2 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (t :: * -> *) (x :: k2).\n (TraversableB b, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n -> Data.Generics.GenericN.Rec (b (P 0 f)) (b f) x\n@@ -496,15 +496,15 @@\n (b (P 0 f)) (b f) x) ->\n f1\n (f2\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0] _N _P _R _P))]\n-daddc1fcf4a38a2a68fd11b04a7f0efe\n+fb85512a4471dfc690a6d520fe6abf44\n $fGTraversableNaturalkk20fgRecRec_$cgtraverse ::\n forall k k2 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableB b, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n@@ -577,15 +577,15 @@\n (f2\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-da361365afca84b2e3dd9306805ad1e2\n+73eb13dc1c7caed6a53559e5d08e94ad\n $fTraversableBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (Data.Traversable.Traversable f, TraversableB b) =>\n TraversableB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -604,15 +604,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkCompose_$cbtraverse @k @f @b v v1)]\n-083e340780d4ca657d98e7a0de03568d\n+e3d1d0ea54edeb67e46026ba76bf0051\n $fTraversableBkCompose1 ::\n forall {k} {f :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (Data.Traversable.Traversable f, TraversableB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1 -> f (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -638,15 +638,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-884e1a495e83c1f2514adbd2d040c8b1\n+0c2e3196e5a791b155697f2f6da15852\n $fTraversableBkCompose_$cbtraverse ::\n forall k (f :: * -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f1 :: k -> *) (g :: k -> *).\n (Data.Traversable.Traversable f, TraversableB b,\n GHC.Base.Applicative e) =>\n (forall (a :: k). f1 a -> e (g a))\n -> Data.Functor.Compose.Compose f b f1\n@@ -684,28 +684,28 @@\n @(b g)\n $dApplicative\n (btraverse @k @b $dTraversableB @e @f1 @g $dApplicative eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N))]\n-00893468ed1818851025e3fe7f60632a\n+fd554eea1a7a99b717da97a19a91f66b\n $fTraversableBkConst :: TraversableB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkConst_$cbtraverse @k @a)]\n-e3e1746b41234e5cae95b9609d148d25\n+15ab705b96e0df66afbc3aa6e0e063e6\n $fTraversableBkConst_$cbtraverse ::\n forall k a (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Const.Const a f -> e (Data.Functor.Const.Const a g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=2),\n@@ -722,29 +722,29 @@\n @e\n $dApplicative\n @(Data.Functor.Const.Const a g)\n ds1\n `cast`\n (Data.Functor.Const.N:Const[0] *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0] *>_N _R _P))]\n-01cfb7decd424a9a3d23b0a7dba0622d\n+eef7745de9f38bec340d19dd7c2e56a3\n $fTraversableBkConstant ::\n TraversableB (Data.Functor.Constant.Constant a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Constant.Constant a)\n (Barbies.Internal.FunctorB.$fFunctorBkConstant_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkConstant_$cbtraverse @k @a)]\n-290a5c4b471d5d301f99b332bca74950\n+60a30098017ffac097bf993fed77e66f\n $fTraversableBkConstant_$cbtraverse ::\n forall k a (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Constant.Constant a f\n -> e (Data.Functor.Constant.Constant a g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -763,15 +763,15 @@\n $dApplicative\n @(Data.Functor.Constant.Constant a g)\n ds1\n `cast`\n (Data.Functor.Constant.N:Constant[0] *>_N _R _P\n ; Sym (Data.Functor.Constant.N:Constant[0]\n *>_N _R _P))]\n-6f46774eb9c28eea99a50b9cf0452960\n+db986e1ffe7ed1eeda943da3b30fa02c\n $fTraversableBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (TraversableB a, TraversableB b) =>\n TraversableB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -785,15 +785,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fTraversableBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkProduct_$cbtraverse @k @a @b v v1)]\n-f9948e95e35f2e041decae449d1eebdb\n+1e706e6c4ccec7cfdad8bfae4f987a4d\n $fTraversableBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (TraversableB a, TraversableB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -827,15 +827,15 @@\n (($p1TraversableB @k @b $dTraversableB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-cee7e01ee0eb4f6a8fccb861b59f5afa\n+d0bec73a7ff2f0f1d340eb041a0a395d\n $fTraversableBkProduct_$cbtraverse ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f :: k -> *) (g :: k -> *).\n (TraversableB a, TraversableB b, GHC.Base.Applicative e) =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Product.Product a b f\n -> e (Data.Functor.Product.Product a b g)\n@@ -865,28 +865,28 @@\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(a g)\n @(b g -> Data.Functor.Product.Product a b g)\n (\\ (ds['GHC.Types.Many] :: a g) (ds1['GHC.Types.Many] :: b g) ->\n Data.Functor.Product.Pair @(k -> *) @a @b @g ds ds1)\n (btraverse @k @a $dTraversableB @e @f @g $dApplicative eta x))\n (btraverse @k @b $dTraversableB1 @e @f @g $dApplicative eta y) }]\n-9f6ac90484a87da1b4cb7007e05bb2d2\n+7b50e738fa3aafbc2d9c920efe3c6d82\n $fTraversableBkProxy :: TraversableB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkProxy_$cbtraverse @k)]\n-db98f3c4b674c487e40d02be5dd7603e\n+b0ef824d4d4f8e38985dea340cdb221c\n $fTraversableBkProxy_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a))\n -> Data.Proxy.Proxy f -> e (Data.Proxy.Proxy g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=2),\n@@ -899,15 +899,15 @@\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a))\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n GHC.Base.pure\n @e\n $dApplicative\n @(Data.Proxy.Proxy g)\n (Data.Proxy.Proxy @(k -> *) @g)]\n-fbc0763f427e5adc40998ff4f6632812\n+0cac9552f4607512b24704e275caddf3\n $fTraversableBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (TraversableB a, TraversableB b) =>\n TraversableB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -921,15 +921,15 @@\n @k\n @(Data.Functor.Sum.Sum a b)\n ($fTraversableBkSum1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkSum_$cbtraverse @k @a @b v v1)]\n-b2cadb4a1cd9ca07230929ed78034a6e\n+f394b14f5ead39fc1a93be60fc44463e\n $fTraversableBkSum1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (TraversableB a, TraversableB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -968,15 +968,15 @@\n (($p1TraversableB @k @b $dTraversableB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n x) }]\n-fecf6253af68e4f6242af139ff816e30\n+88e5a77cdecfdd18ccaa645ce09cf068\n $fTraversableBkSum_$cbtraverse ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f :: k -> *) (g :: k -> *).\n (TraversableB a, TraversableB b, GHC.Base.Applicative e) =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Sum.Sum a b f -> e (Data.Functor.Sum.Sum a b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -1009,91 +1009,91 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(b g)\n @(Data.Functor.Sum.Sum a b g)\n (\\ (ds['GHC.Types.Many] :: b g) ->\n Data.Functor.Sum.InR @(k -> *) @a @b @g ds)\n (btraverse @k @b $dTraversableB1 @e @f @g $dApplicative eta x) }]\n-506adcd8de5f96b431e7bd9c1518a1eb\n+944f56733c73f70e67504b03db3e5272\n $tcTraversableB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4017740665315007311#Word64\n- 12641569116592177529#Word64\n+ 18179578676235463987#Word64\n+ 2489881737007706769#Word64\n $trModule\n $tcTraversableB2\n 1#\n $tcTraversableB1]\n-1d5e7391cfce86e64b12ab9e4ad46d77\n+fd0a83cbb12d57da33ddc1ae283cebbe\n $tcTraversableB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-4c3cc0d49f5352ac46e3fe66d4d03f1d\n+9b81753d0bcf08cfa395b5232dca0b53\n $tcTraversableB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcTraversableB3]\n-c4e1a220af90cdcfb049cd30028fd29c\n+03be57e758250e91ddfb0aeec1c7e89a\n $tcTraversableB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"TraversableB\"#]\n-d07aebed8b303ad614b7f0f9fa991f63\n+22102049ffc1f3dafb2a8230d57d0a14\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-04d78d7e00d3e5e60bfdab4df1e9db8a\n+68aa65e57545ce2138358d634ca88ef8\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-b421a7d4fb73a4c2bc8df6e3b5f9a4e1\n+f10fd5008e8694606169b4308f3b103b\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.TraversableB\"#]\n-57152d0194320c271fa4ffdc7205adc7\n+337945a41551c3da1fad4e8768e34141\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-78bea3302496ee24b7a58c26d98be406\n+863dc28117f3116c9114941a36854b54\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-ebf3189a9c5a5b2bc6da9bb97a8300f0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+b333521b1a55b005674166bf2d867816\n type CanDeriveTraversableB :: forall {k1}.\n ((k1 -> *) -> *) -> (k1 -> *) -> (k1 -> *) -> GHC.Types.Constraint\n type CanDeriveTraversableB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g)))\n :: GHC.Types.Constraint\n-6ecb9054dad4354a5b77cf31ccc6cecb\n+3479509828c4a984a91d78f529880382\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-f7c1abeec0b55a1c6a4832b0c59d2a24\n+4b5878e11b020d69d6eb26a6f89795cc\n type TraversableB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => TraversableB b where\n btraverse :: forall (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n default btraverse :: forall (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (GHC.Base.Applicative e, CanDeriveTraversableB b f g) =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n-ba0744e112b486ac5bb067fb062133f4\n+ba02d28d2b8fc3ffd9509b200aa5e6f6\n bfoldMap ::\n forall {k} (b :: (k -> *) -> *) m (f :: k -> *).\n (TraversableB b, GHC.Base.Monoid m) =>\n (forall (a :: k). f a -> m) -> b f -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1135,15 +1135,15 @@\n \\ (x['GHC.Types.Many] :: b f) ->\n case (g x)\n `cast`\n (Barbies.Internal.Writer.N:St[0]\n _R _R)\n lvl6 of wild { (,) a1 s' ->\n s' }]\n-57644dcc9c502afb44d0d9a91a1186c8\n+0be226e18f12ee247518b7894bf538e9\n bsequence ::\n forall {k} (e :: * -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (GHC.Base.Applicative e, TraversableB b) =>\n b (Data.Functor.Compose.Compose e f) -> e (b f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n@@ -1163,15 +1163,15 @@\n $dApplicative\n (Data.Functor.Compose.getCompose1 @(*) @k @e @f)\n `cast`\n (forall (a :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-30b33daa89cf5b65bb7458cf798c9ced\n+fcd7d4640f70ae8c757c15d22c814b1b\n bsequence' ::\n (GHC.Base.Applicative e, TraversableB b) =>\n b e -> e (b Data.Functor.Identity.Identity)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n \\ @e :: * -> *\n@@ -1193,20 +1193,20 @@\n @a\n @(Data.Functor.Identity.Identity a)\n (bsequence'1 @a)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R)))]\n-58ecb3f26f46e178eab0fd2013cb8ef4\n+42cdaad5dbd770c73a20f9a48f9810c8\n bsequence'1 :: a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \\ @a (ds['GHC.Types.Many] :: a) -> ds]\n-e32dfef4d81e493ba2e627342dd5a246\n+d496d9ee3a909d4d1048e12257d6f3b9\n btraverse_ ::\n forall {k} (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *) c.\n (TraversableB b, GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e c) -> b f -> e ()\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1252,21 +1252,21 @@\n GHC.Base.<$\n @e\n $dFunctor\n @()\n @(b (Data.Functor.Const.Const ()))\n GHC.Tuple.Prim.()\n (g x)]\n-a7c090f54d3a6128d8402d77a1af1a38\n+91edaa05c1d130f137897731ac90aeb0\n btraverse_1 :: c -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c (ds['GHC.Types.Many] :: c) -> GHC.Tuple.Prim.()]\n-f9b87fac408b20ec98d8b9e8d74e6a06\n+166d6e71644f9e78dbe2d3fa2ee84fef\n gbtraverseDefault ::\n forall {k1} (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (e :: * -> *).\n (GHC.Base.Applicative e, CanDeriveTraversableB b f g) =>\n (forall (a :: k1). f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.TraversableB [orphan module] 9066\n- interface hash: b46324d9fb7c2975544fa5fe617afdeb\n- ABI hash: 654d93e0e8e833b65be8b9e4ff4d2091\n- export-list hash: 3805bf6b28252b86b750a944ab2fee9b\n- orphan hash: 0d9ecce93af777ed45f4c55e1b7cd9cc\n+ interface hash: 166e92700c51a166df84f14e68cc3ccb\n+ ABI hash: 368d3e0ab41a9522330792b522601b7c\n+ export-list hash: ef1730ba79a439abadc8ee398aed68a3\n+ orphan hash: 6f07ed49a4cebceebe47d9b3167d2ca6\n flag hash: 9b6d31c557e3255fd5cc0273b0aee93d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 954f0b465549c0404fb9a3c25eca6418\n sig of: Nothing\n used TH splices: False\n@@ -21,62 +21,62 @@\n bfoldMap\n bsequence\n bsequence'\n btraverse_\n gbtraverseDefault\n CanDeriveTraversableB\n TraversableB{btraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable fcc5069525cb18eabc5ee2f6d115ed72\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 1180a3c086dfc51eda564a1727916603\n- gtraverse e8c1062ed3782afa31b62442c3d713bd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 4b8cfed320a9759153c9f2e1178f5919\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr c0469e5e8a962b81eaa1e5c9b2f08584\n- tell 318bc913c1a4613db9a7000eccfc0ab8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 7ee4a8d101ceda4ac9aab730f3d525a0\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable f7816c2f9a39d58706aba55efd6f45bc\n+ gtraverse 1f5e285cee2799d79ed8662ff47a29d0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer 1ac8301754bf8fc4ae662af9201e1b17\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 56d7951edbc29f9bb80efe13a3b090ce\n+ tell 44d33a86554f81bd08a29cb9f096fae7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-47283e474f1fe025052b0221c40b9c67\n+00f6e9682dbfac7c71da05ffffd0c9fc\n $dmbtraverse ::\n forall k (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (TraversableB b, GHC.Base.Applicative e,\n CanDeriveTraversableB b f g) =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -273,15 +273,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n <*>_N\n <0>_N\n _N\n _N))_N\n _N)_R) _N))]\n-6d2f6ba3e05b3597325f6dc0e0a1ad65\n+b966ad5a54dff0d9699165a273cd6102\n $fGTraversableNaturalkk20fgRecRec ::\n forall k k2 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableB b) =>\n Barbies.Generics.Traversable.GTraversable\n 0\n@@ -311,15 +311,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-e3e356abce727e4b47a8318702d2e860\n+3c344892c697d6f2580fdd3c79fae49e\n $fGTraversableNaturalkk20fgRecRec0 ::\n forall k k2 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (Data.Traversable.Traversable h, TraversableB b) =>\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n@@ -347,15 +347,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-ee41558b39c2635ab8b9f4e5c7d9fb14\n+3f04431d03a28a24e5259185bf3773d7\n $fGTraversableNaturalkk20fgRecRec0_$cgtraverse ::\n forall k k2 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, TraversableB b,\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n@@ -413,15 +413,15 @@\n (f2\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-0bfb77f75ce7885c8a83ab58c4c0acd1\n+6373180a44b082031b8e87215384a32c\n $fGTraversableNaturalkk20fgRecRec1 ::\n forall k k2 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n TraversableB b =>\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n g\n@@ -444,15 +444,15 @@\n _N\n <0>_N\n _N\n _N\n _N\n _N))]\n-01b00cef25015c1c0470aa59f3166fdc\n+5e306f233e0e77102bbd4d79b2f928c8\n $fGTraversableNaturalkk20fgRecRec1_$cgtraverse ::\n forall k k2 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (t :: * -> *) (x :: k2).\n (TraversableB b, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n -> Data.Generics.GenericN.Rec (b (P 0 f)) (b f) x\n@@ -496,15 +496,15 @@\n (b (P 0 f)) (b f) x) ->\n f1\n (f2\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0] _N _P _R _P))]\n-daddc1fcf4a38a2a68fd11b04a7f0efe\n+fb85512a4471dfc690a6d520fe6abf44\n $fGTraversableNaturalkk20fgRecRec_$cgtraverse ::\n forall k k2 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableB b, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n@@ -577,15 +577,15 @@\n (f2\n x1\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-da361365afca84b2e3dd9306805ad1e2\n+73eb13dc1c7caed6a53559e5d08e94ad\n $fTraversableBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (Data.Traversable.Traversable f, TraversableB b) =>\n TraversableB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -604,15 +604,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkCompose_$cbtraverse @k @f @b v v1)]\n-083e340780d4ca657d98e7a0de03568d\n+e3d1d0ea54edeb67e46026ba76bf0051\n $fTraversableBkCompose1 ::\n forall {k} {f :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (Data.Traversable.Traversable f, TraversableB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1 -> f (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -638,15 +638,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-884e1a495e83c1f2514adbd2d040c8b1\n+0c2e3196e5a791b155697f2f6da15852\n $fTraversableBkCompose_$cbtraverse ::\n forall k (f :: * -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f1 :: k -> *) (g :: k -> *).\n (Data.Traversable.Traversable f, TraversableB b,\n GHC.Base.Applicative e) =>\n (forall (a :: k). f1 a -> e (g a))\n -> Data.Functor.Compose.Compose f b f1\n@@ -684,28 +684,28 @@\n @(b g)\n $dApplicative\n (btraverse @k @b $dTraversableB @e @f1 @g $dApplicative eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N))]\n-00893468ed1818851025e3fe7f60632a\n+fd554eea1a7a99b717da97a19a91f66b\n $fTraversableBkConst :: TraversableB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkConst_$cbtraverse @k @a)]\n-e3e1746b41234e5cae95b9609d148d25\n+15ab705b96e0df66afbc3aa6e0e063e6\n $fTraversableBkConst_$cbtraverse ::\n forall k a (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Const.Const a f -> e (Data.Functor.Const.Const a g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=2),\n@@ -722,29 +722,29 @@\n @e\n $dApplicative\n @(Data.Functor.Const.Const a g)\n ds1\n `cast`\n (Data.Functor.Const.N:Const[0] *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0] *>_N _R _P))]\n-01cfb7decd424a9a3d23b0a7dba0622d\n+eef7745de9f38bec340d19dd7c2e56a3\n $fTraversableBkConstant ::\n TraversableB (Data.Functor.Constant.Constant a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Constant.Constant a)\n (Barbies.Internal.FunctorB.$fFunctorBkConstant_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkConstant_$cbtraverse @k @a)]\n-290a5c4b471d5d301f99b332bca74950\n+60a30098017ffac097bf993fed77e66f\n $fTraversableBkConstant_$cbtraverse ::\n forall k a (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Constant.Constant a f\n -> e (Data.Functor.Constant.Constant a g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -763,15 +763,15 @@\n $dApplicative\n @(Data.Functor.Constant.Constant a g)\n ds1\n `cast`\n (Data.Functor.Constant.N:Constant[0] *>_N _R _P\n ; Sym (Data.Functor.Constant.N:Constant[0]\n *>_N _R _P))]\n-6f46774eb9c28eea99a50b9cf0452960\n+db986e1ffe7ed1eeda943da3b30fa02c\n $fTraversableBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (TraversableB a, TraversableB b) =>\n TraversableB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -785,15 +785,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fTraversableBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkProduct_$cbtraverse @k @a @b v v1)]\n-f9948e95e35f2e041decae449d1eebdb\n+1e706e6c4ccec7cfdad8bfae4f987a4d\n $fTraversableBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (TraversableB a, TraversableB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -827,15 +827,15 @@\n (($p1TraversableB @k @b $dTraversableB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-cee7e01ee0eb4f6a8fccb861b59f5afa\n+d0bec73a7ff2f0f1d340eb041a0a395d\n $fTraversableBkProduct_$cbtraverse ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f :: k -> *) (g :: k -> *).\n (TraversableB a, TraversableB b, GHC.Base.Applicative e) =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Product.Product a b f\n -> e (Data.Functor.Product.Product a b g)\n@@ -865,28 +865,28 @@\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(a g)\n @(b g -> Data.Functor.Product.Product a b g)\n (\\ (ds['GHC.Types.Many] :: a g) (ds1['GHC.Types.Many] :: b g) ->\n Data.Functor.Product.Pair @(k -> *) @a @b @g ds ds1)\n (btraverse @k @a $dTraversableB @e @f @g $dApplicative eta x))\n (btraverse @k @b $dTraversableB1 @e @f @g $dApplicative eta y) }]\n-9f6ac90484a87da1b4cb7007e05bb2d2\n+7b50e738fa3aafbc2d9c920efe3c6d82\n $fTraversableBkProxy :: TraversableB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkProxy_$cbtraverse @k)]\n-db98f3c4b674c487e40d02be5dd7603e\n+b0ef824d4d4f8e38985dea340cdb221c\n $fTraversableBkProxy_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a))\n -> Data.Proxy.Proxy f -> e (Data.Proxy.Proxy g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=2),\n@@ -899,15 +899,15 @@\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a))\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n GHC.Base.pure\n @e\n $dApplicative\n @(Data.Proxy.Proxy g)\n (Data.Proxy.Proxy @(k -> *) @g)]\n-fbc0763f427e5adc40998ff4f6632812\n+0cac9552f4607512b24704e275caddf3\n $fTraversableBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (TraversableB a, TraversableB b) =>\n TraversableB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -921,15 +921,15 @@\n @k\n @(Data.Functor.Sum.Sum a b)\n ($fTraversableBkSum1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkSum_$cbtraverse @k @a @b v v1)]\n-b2cadb4a1cd9ca07230929ed78034a6e\n+f394b14f5ead39fc1a93be60fc44463e\n $fTraversableBkSum1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (TraversableB a, TraversableB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -968,15 +968,15 @@\n (($p1TraversableB @k @b $dTraversableB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n x) }]\n-fecf6253af68e4f6242af139ff816e30\n+88e5a77cdecfdd18ccaa645ce09cf068\n $fTraversableBkSum_$cbtraverse ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f :: k -> *) (g :: k -> *).\n (TraversableB a, TraversableB b, GHC.Base.Applicative e) =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Sum.Sum a b f -> e (Data.Functor.Sum.Sum a b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -1009,91 +1009,91 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(b g)\n @(Data.Functor.Sum.Sum a b g)\n (\\ (ds['GHC.Types.Many] :: b g) ->\n Data.Functor.Sum.InR @(k -> *) @a @b @g ds)\n (btraverse @k @b $dTraversableB1 @e @f @g $dApplicative eta x) }]\n-506adcd8de5f96b431e7bd9c1518a1eb\n+944f56733c73f70e67504b03db3e5272\n $tcTraversableB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4017740665315007311#Word64\n- 12641569116592177529#Word64\n+ 18179578676235463987#Word64\n+ 2489881737007706769#Word64\n $trModule\n $tcTraversableB2\n 1#\n $tcTraversableB1]\n-1d5e7391cfce86e64b12ab9e4ad46d77\n+fd0a83cbb12d57da33ddc1ae283cebbe\n $tcTraversableB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-4c3cc0d49f5352ac46e3fe66d4d03f1d\n+9b81753d0bcf08cfa395b5232dca0b53\n $tcTraversableB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcTraversableB3]\n-c4e1a220af90cdcfb049cd30028fd29c\n+03be57e758250e91ddfb0aeec1c7e89a\n $tcTraversableB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"TraversableB\"#]\n-d07aebed8b303ad614b7f0f9fa991f63\n+22102049ffc1f3dafb2a8230d57d0a14\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-04d78d7e00d3e5e60bfdab4df1e9db8a\n+68aa65e57545ce2138358d634ca88ef8\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-b421a7d4fb73a4c2bc8df6e3b5f9a4e1\n+f10fd5008e8694606169b4308f3b103b\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.TraversableB\"#]\n-57152d0194320c271fa4ffdc7205adc7\n+337945a41551c3da1fad4e8768e34141\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-78bea3302496ee24b7a58c26d98be406\n+863dc28117f3116c9114941a36854b54\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-ebf3189a9c5a5b2bc6da9bb97a8300f0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+b333521b1a55b005674166bf2d867816\n type CanDeriveTraversableB :: forall {k1}.\n ((k1 -> *) -> *) -> (k1 -> *) -> (k1 -> *) -> GHC.Types.Constraint\n type CanDeriveTraversableB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g)))\n :: GHC.Types.Constraint\n-6ecb9054dad4354a5b77cf31ccc6cecb\n+3479509828c4a984a91d78f529880382\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-f7c1abeec0b55a1c6a4832b0c59d2a24\n+4b5878e11b020d69d6eb26a6f89795cc\n type TraversableB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => TraversableB b where\n btraverse :: forall (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n default btraverse :: forall (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (GHC.Base.Applicative e, CanDeriveTraversableB b f g) =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n-ba0744e112b486ac5bb067fb062133f4\n+ba02d28d2b8fc3ffd9509b200aa5e6f6\n bfoldMap ::\n forall {k} (b :: (k -> *) -> *) m (f :: k -> *).\n (TraversableB b, GHC.Base.Monoid m) =>\n (forall (a :: k). f a -> m) -> b f -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1135,15 +1135,15 @@\n \\ (x['GHC.Types.Many] :: b f) ->\n case (g x)\n `cast`\n (Barbies.Internal.Writer.N:St[0]\n _R _R)\n lvl6 of wild { (,) a1 s' ->\n s' }]\n-57644dcc9c502afb44d0d9a91a1186c8\n+0be226e18f12ee247518b7894bf538e9\n bsequence ::\n forall {k} (e :: * -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (GHC.Base.Applicative e, TraversableB b) =>\n b (Data.Functor.Compose.Compose e f) -> e (b f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n@@ -1163,15 +1163,15 @@\n $dApplicative\n (Data.Functor.Compose.getCompose1 @(*) @k @e @f)\n `cast`\n (forall (a :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-30b33daa89cf5b65bb7458cf798c9ced\n+fcd7d4640f70ae8c757c15d22c814b1b\n bsequence' ::\n (GHC.Base.Applicative e, TraversableB b) =>\n b e -> e (b Data.Functor.Identity.Identity)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n \\ @e :: * -> *\n@@ -1193,20 +1193,20 @@\n @a\n @(Data.Functor.Identity.Identity a)\n (bsequence'1 @a)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R)))]\n-58ecb3f26f46e178eab0fd2013cb8ef4\n+42cdaad5dbd770c73a20f9a48f9810c8\n bsequence'1 :: a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \\ @a (ds['GHC.Types.Many] :: a) -> ds]\n-e32dfef4d81e493ba2e627342dd5a246\n+d496d9ee3a909d4d1048e12257d6f3b9\n btraverse_ ::\n forall {k} (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *) c.\n (TraversableB b, GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e c) -> b f -> e ()\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1252,21 +1252,21 @@\n GHC.Base.<$\n @e\n $dFunctor\n @()\n @(b (Data.Functor.Const.Const ()))\n GHC.Tuple.Prim.()\n (g x)]\n-a7c090f54d3a6128d8402d77a1af1a38\n+91edaa05c1d130f137897731ac90aeb0\n btraverse_1 :: c -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c (ds['GHC.Types.Many] :: c) -> GHC.Tuple.Prim.()]\n-f9b87fac408b20ec98d8b9e8d74e6a06\n+166d6e71644f9e78dbe2d3fa2ee84fef\n gbtraverseDefault ::\n forall {k1} (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (e :: * -> *).\n (GHC.Base.Applicative e, CanDeriveTraversableB b f g) =>\n (forall (a :: k1). f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.TraversableT [orphan module] 9066\n- interface hash: e5ddf3e60d2535f12c1df6aa9299c8aa\n- ABI hash: 1dad3f4c90632f51452d54a270e61c5c\n- export-list hash: 625e9e43bc9e9ad84f781f9b7f8b2abf\n- orphan hash: 17ea9bf13579e4bd45f73abf71a338aa\n+ interface hash: 70534723ff415a9bc014345eed40d84d\n+ ABI hash: 918f93b0edfeba7aeefead5d62361a20\n+ export-list hash: 985f3d735f8d8149cf05c5257b3e92df\n+ orphan hash: 911923e5d39c3570a534671287e5d7bc\n flag hash: c8deaaae190dcf5428e680406bf273d8\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a2d68cb522029ad5b03f068295b394ec\n sig of: Nothing\n used TH splices: False\n@@ -21,18 +21,18 @@\n tfoldMap\n tsequence\n tsequence'\n ttraverseDefault\n ttraverse_\n CanDeriveTraversableT\n TraversableT{ttraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -42,35 +42,35 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable fcc5069525cb18eabc5ee2f6d115ed72\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 1180a3c086dfc51eda564a1727916603\n- gtraverse e8c1062ed3782afa31b62442c3d713bd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 4b8cfed320a9759153c9f2e1178f5919\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr c0469e5e8a962b81eaa1e5c9b2f08584\n- tell 318bc913c1a4613db9a7000eccfc0ab8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 7ee4a8d101ceda4ac9aab730f3d525a0\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable f7816c2f9a39d58706aba55efd6f45bc\n+ gtraverse 1f5e285cee2799d79ed8662ff47a29d0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer 1ac8301754bf8fc4ae662af9201e1b17\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 56d7951edbc29f9bb80efe13a3b090ce\n+ tell 44d33a86554f81bd08a29cb9f096fae7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n@@ -83,15 +83,15 @@\n import -/ Control.Applicative.Lift 4c061bd1a73d1b6820b48c8d4eb45f87\n import -/ Control.Monad.Trans.Except 176ed1556759282f04fc46f042d6e45b\n import -/ Control.Monad.Trans.Identity c6d9f8408d560420ccee35cf25d55d29\n import -/ Control.Monad.Trans.Maybe 82f0d330853126ad24cf41b00e8c8903\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n-692a42c3606404137f4daba983fe2b64\n+eb533e9557ca22cd44f4912c2da60118\n $dmttraverse ::\n forall k k' (t :: (k -> *) -> k' -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (TraversableT t, GHC.Base.Applicative e,\n CanDeriveTraversableT t f g x) =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -361,15 +361,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n *>_N\n <1>_N\n _N\n _N _N))_N\n _N)_R) _N))]\n-651a7064aadd04231bf381992f1efeb0\n+c56693754998a925d314ec6895f36d63\n $fGTraversableNaturalkk21fgRecRec ::\n forall k k' k2 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableT t) =>\n Barbies.Generics.Traversable.GTraversable\n 1\n@@ -402,15 +402,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-3c260184501f350c5f04f2aa77dd0ae5\n+bd02e9e40a15c58d2047c5d8a26a60e2\n $fGTraversableNaturalkk21fgRecRec0 ::\n forall k k' k2 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (Data.Traversable.Traversable h, TraversableT t) =>\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n@@ -439,15 +439,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-f8f13b955b98e81d683b973995cc36cd\n+3e2813e40ef46c46f5268ed5c4b432f8\n $fGTraversableNaturalkk21fgRecRec0_$cgtraverse ::\n forall k k' k2 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (t1 :: * -> *) (x1 :: k2).\n (Data.Traversable.Traversable h, TraversableT t,\n GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> t1 (g a))\n@@ -520,15 +520,15 @@\n (f2\n x2\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-12392b83b8a1a61c36bf3ff5d754057f\n+bcb7d490013e0f101f1377db47617c5c\n $fGTraversableNaturalkk21fgRecRec1 ::\n forall k k' k2 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n TraversableT t =>\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n@@ -554,15 +554,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-5e05d36293121d1e60157d7871049ce4\n+1ea284852068b5fa4c47ff843ab23818\n $fGTraversableNaturalkk21fgRecRec1_$cgtraverse ::\n forall k k' k2 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (t1 :: * -> *) (x1 :: k2).\n (TraversableT t, GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> t1 (g a))\n -> Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x) x1\n@@ -621,15 +621,15 @@\n (f2\n x2\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-df0ac72826ce090ffadf75af20a9cedd\n+d1415c151b678aeb15900d93b9ea2544\n $fGTraversableNaturalkk21fgRecRec_$cgtraverse ::\n forall k k' k2 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (t1 :: * -> *) (x1 :: k2).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableT t, GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n@@ -718,30 +718,30 @@\n (f2\n x2\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-fef2ef7502fe3b8410d34bcd892fb953\n+104d66c750f5c5f58c08fcaf469ff568\n $fTraversableTTYPETYPEExceptT ::\n TraversableT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @e.\n @(*)\n @(*)\n @(Control.Monad.Trans.Except.ExceptT e)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEExceptT_$ctmap @e)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEExceptT_$cttraverse @e)]\n-c58a165f2e2d99f31694aaae9fb5a459\n+f260617128c13a5052bf10b1ac6daeab\n $fTraversableTTYPETYPEExceptT_$cttraverse ::\n GHC.Base.Applicative e2 =>\n (forall a. f a -> e2 (g a))\n -> Control.Monad.Trans.Except.ExceptT e1 f x\n -> e2 (Control.Monad.Trans.Except.ExceptT e1 g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -767,30 +767,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Except.N:ExceptT[0]\n _N _R _N))\n (eta\n @(Data.Either.Either e x)\n eta1\n `cast`\n (Control.Monad.Trans.Except.N:ExceptT[0] _N _R _N))]\n-38ad4f04f31bdef51caa0f81cdd911a7\n+4ab22965a38a5123cc814b404157c1ec\n $fTraversableTTYPETYPELift ::\n TraversableT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @(*)\n @Control.Applicative.Lift.Lift\n Barbies.Internal.FunctorT.$fFunctorTTYPETYPELift_$ctmap\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n $fTraversableTTYPETYPELift_$cttraverse]\n-e501ad56e81ddfe5da3b7d4b579e4257\n+b4e7480abb394b7591771e79134e183c\n $fTraversableTTYPETYPELift_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Applicative.Lift.Lift f x\n -> e (Control.Applicative.Lift.Lift g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(MP(1C(1,C(1,L)),A),MC(1,L),A,A,A,A)><1L>,\n@@ -815,30 +815,30 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Control.Applicative.Lift.Lift g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Control.Applicative.Lift.Other @g @x ds)\n (eta @x fa) }]\n-958284d86502e278e6baee5ae089d94d\n+7fc82a18232be238fe4d618470dc8235\n $fTraversableTTYPETYPEMaybeT ::\n TraversableT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @(*)\n @Control.Monad.Trans.Maybe.MaybeT\n Barbies.Internal.FunctorT.$fFunctorTTYPETYPEMaybeT_$ctmap\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n $fTraversableTTYPETYPEMaybeT_$cttraverse]\n-86c8e41e43df19c043aee2ebf0511477\n+af8fe33ddc07cbba4239cfd9ebb5bc79\n $fTraversableTTYPETYPEMaybeT_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Maybe.MaybeT f x\n -> e (Control.Monad.Trans.Maybe.MaybeT g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -860,45 +860,45 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R _N))\n (eta\n @(GHC.Maybe.Maybe x)\n eta1 `cast` (Control.Monad.Trans.Maybe.N:MaybeT[0] _R _N))]\n-9c16112f7cebe78f7fc34c928c33c24b\n+3555f93ac15d0be34cc9ba7d9251e2d5\n $fTraversableTTYPETYPEWriterT ::\n TraversableT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(*)\n @(Control.Monad.Trans.Writer.Strict.WriterT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEWriterT_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEWriterT_$cttraverse @w)]\n-61313fe138fc08575ae6d6b391cd5c77\n+be4782e770181dc87c30c470618634c1\n $fTraversableTTYPETYPEWriterT0 ::\n TraversableT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(*)\n @(Control.Monad.Trans.Writer.Lazy.WriterT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEWriterT0_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEWriterT0_$cttraverse @w)]\n-f0b6df77c7d5d035f980388131b454ce\n+8cb809fd16e917db36303a29c7c63151\n $fTraversableTTYPETYPEWriterT0_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Writer.Lazy.WriterT w f x\n -> e (Control.Monad.Trans.Writer.Lazy.WriterT w g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -924,15 +924,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Writer.Lazy.N:WriterT[0]\n _N _R _N))\n (eta\n @(x, w)\n eta1\n `cast`\n (Control.Monad.Trans.Writer.Lazy.N:WriterT[0] _N _R _N))]\n-84a6d96f2fbb7cca489dd7859acaca3c\n+2b88ffd9f708b40f440b37e6647532ef\n $fTraversableTTYPETYPEWriterT_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Writer.Strict.WriterT w f x\n -> e (Control.Monad.Trans.Writer.Strict.WriterT w g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -959,30 +959,30 @@\n _N _R _N))\n (eta\n @(x, w)\n eta1\n `cast`\n (Control.Monad.Trans.Writer.Strict.N:WriterT[0]\n _N _R _N))]\n-ead1e60d3df6f61faa4c4b89fd5f605c\n+80a50544e140ee00196239962b4b0879\n $fTraversableTk'k'Backwards ::\n TraversableT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Control.Applicative.Backwards.Backwards\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Backwards_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Backwards_$cttraverse @k')]\n-da2105ad30c779f22d49f03e5e7101b0\n+2ed75264508fb96350a7b6544904a416\n $fTraversableTk'k'Backwards_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Control.Applicative.Backwards.Backwards f x\n -> e (Control.Applicative.Backwards.Backwards g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1009,15 +1009,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Control.Applicative.Backwards.N:Backwards[0] _N _R _N))]\n-46b4e2e21c02b03537b971161c5f6e2d\n+fa0660dc209e1e02e88110c1c83b60ce\n $fTraversableTk'k'Compose ::\n Data.Traversable.Traversable f =>\n TraversableT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n@@ -1034,15 +1034,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Compose_$cttraverse @k' @f v)]\n-18c45dc97847fba081cc2cb2b359de5c\n+5296a2022ac1a82432298e110bb7cf88\n $fTraversableTk'k'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n Data.Traversable.Traversable f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -1061,15 +1061,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-8bc0013248c4ab131ec7d3ca69a6e1ac\n+456a0e5bd56fe3de9987360da9565570\n $fTraversableTk'k'Compose_$cttraverse ::\n forall k' (f :: * -> *) (e :: * -> *) (f1 :: k' -> *)\n (g :: k' -> *) (x :: k').\n (Data.Traversable.Traversable f, GHC.Base.Applicative e) =>\n (forall (a :: k'). f1 a -> e (g a))\n -> Data.Functor.Compose.Compose f f1 x\n -> e (Data.Functor.Compose.Compose f g x)\n@@ -1105,30 +1105,30 @@\n @(g x)\n $dApplicative\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N))]\n-4d6300219d1057c822d37fd5f0b8dc0a\n+6f82c85a63eb58bd3088e59a80a8d56a\n $fTraversableTk'k'IdentityT ::\n TraversableT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Control.Monad.Trans.Identity.IdentityT\n (Barbies.Internal.FunctorT.$fFunctorTk'k'IdentityT_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'IdentityT_$cttraverse @k')]\n-87e95847af0b9ad2f42a25bde25e26cf\n+88bb3f1947d902de2b0537828ad54ad2\n $fTraversableTk'k'IdentityT_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Control.Monad.Trans.Identity.IdentityT f x\n -> e (Control.Monad.Trans.Identity.IdentityT g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1155,15 +1155,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Control.Monad.Trans.Identity.N:IdentityT[0] _N _R _N))]\n-6072537fdfe7a7efdaf357842b2b967b\n+cf23ea5880390c0516f1a8b532b2ace2\n $fTraversableTk'k'Product ::\n forall k' (f :: k' -> *).\n TraversableT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n@@ -1171,15 +1171,15 @@\n @k'\n @(Data.Functor.Product.Product f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @k' @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Product_$cttraverse @k' @f)]\n-7dd39b699a4be58873531a9f66013e2c\n+17936fc076c76ecad9dbda09da73a882\n $fTraversableTk'k'Product_$cttraverse ::\n forall k' (f1 :: k' -> *) (e :: * -> *) (f2 :: k' -> *)\n (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f2 a -> e (g a))\n -> Data.Functor.Product.Product f1 f2 x\n -> e (Data.Functor.Product.Product f1 g x)\n@@ -1201,30 +1201,30 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Data.Functor.Product.Product f g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Data.Functor.Product.Pair @k' @f @g @x fa ds)\n (eta @x ga) }]\n-5379c0357690491f165907eb3b4cdfc6\n+60a6e60f9c91ea25281fb9db69481379\n $fTraversableTk'k'Reverse ::\n TraversableT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Data.Functor.Reverse.Reverse\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Reverse_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Reverse_$cttraverse @k')]\n-3a13296464ba0034d5dacac1f642ca8f\n+2485e36df594fef8e608fadfdef0e1d0\n $fTraversableTk'k'Reverse_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Data.Functor.Reverse.Reverse f x\n -> e (Data.Functor.Reverse.Reverse g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1250,30 +1250,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Data.Functor.Reverse.N:Reverse[0] _N _R _N))]\n-6880856a9a4b5f9965fcc8a0cb61bfec\n+b2d5c814fc85900431340f8c77ee3c43\n $fTraversableTk'k'Sum ::\n forall k' (f :: k' -> *). TraversableT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n @k'\n @k'\n @(Data.Functor.Sum.Sum f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Sum_$ctmap @k' @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Sum_$cttraverse @k' @f)]\n-9762fc05e957485c505c5ec5ee227550\n+7e7b22a9a9a2dd27dc560dae8369a9df\n $fTraversableTk'k'Sum_$cttraverse ::\n forall k' (f1 :: k' -> *) (e :: * -> *) (f2 :: k' -> *)\n (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f2 a -> e (g a))\n -> Data.Functor.Sum.Sum f1 f2 x -> e (Data.Functor.Sum.Sum f1 g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1301,93 +1301,93 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Data.Functor.Sum.Sum f g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Data.Functor.Sum.InR @k' @f @g @x ds)\n (eta @x ga) }]\n-15b913e91fe7ffce70317f1c94c35c41\n+d4a435e9d199fa9dcbde962fe95b3f02\n $tcTraversableT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17484927838105860982#Word64\n- 13476100267539065414#Word64\n+ 15964797787614909903#Word64\n+ 371415074421031179#Word64\n $trModule\n $tcTraversableT2\n 2#\n $tcTraversableT1]\n-bdd9dbc2d8d54295f90c37aefa9ab182\n+42ed9c51113e9551c1c6d0cd39929c75\n $tcTraversableT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a7af357a3177dcc719423a7cab610927\n+6c64e879dd4ee197d61e579091aa1753\n $tcTraversableT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcTraversableT3]\n-e561c4f16730ddf1752da4b3f216afea\n+0251ed4fcb57a53972e51730338a9923\n $tcTraversableT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"TraversableT\"#]\n-660e77831fdd2609571eb9695722c127\n+0d94928be9e08027dcebe7ed62d176f5\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f268fa9f7238f3bbb0e914245aaca0ea\n+b1f37fb74771f0ef184393aa7ec14eba\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-7397c64acd96499afdcdf1ce9484c000\n+9d0431d3f58d2d4590858b17033151c5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.TraversableT\"#]\n-6767db4855982bb6011ae32d7d475961\n+a4e6c7eab5b5e274154da1109d4687e1\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-74b454dd80c33f97f4e255b7927bdd22\n+f093f10034f7b2098972aa0ade24b43a\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e0233e0f8ad707ca61794944dd259f3f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+618ece28277f83e20a17e00e3149c6c9\n type CanDeriveTraversableT :: forall {k1} {k}.\n ((k1 -> *) -> k -> *)\n -> (k1 -> *) -> (k1 -> *) -> k -> GHC.Types.Constraint\n type CanDeriveTraversableT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x)))\n :: GHC.Types.Constraint\n-f2f6cc9fbc491070711444fe9808fd9a\n+cde7afd24f19b9145b973d3b2bd3b27d\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-5f45683a672c1e8b493f3644d95842b8\n+85e954d72370c1d24f1ff0e67fec5163\n type TraversableT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => TraversableT t where\n ttraverse :: forall (e :: * -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n default ttraverse :: forall (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (GHC.Base.Applicative e, CanDeriveTraversableT t f g x) =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n-dd03935b128f42360c829fd3e249b034\n+0a332c01a2703820e7a4f3473c24da2e\n tfoldMap ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) m (f :: k -> *)\n (x :: k').\n (TraversableT t, GHC.Base.Monoid m) =>\n (forall (a :: k). f a -> m) -> t f x -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1434,15 +1434,15 @@\n \\ (x1['GHC.Types.Many] :: t f x) ->\n case (g x1)\n `cast`\n (Barbies.Internal.Writer.N:St[0]\n _R _R)\n lvl10 of wild { (,) a1 s' ->\n s' }]\n-699ffc06a9598fe004d904a9ee845bc0\n+94b2a8072a909ac100fc617a0145ec32\n tsequence ::\n forall {k} {k'} (e :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (x :: k').\n (GHC.Base.Applicative e, TraversableT t) =>\n t (Data.Functor.Compose.Compose e f) x -> e (t f x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n@@ -1467,15 +1467,15 @@\n $dApplicative\n (Data.Functor.Compose.getCompose1 @(*) @k @e @f)\n `cast`\n (forall (a :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-65f065cd1161989b56f7e2cd49c0b0fe\n+af70b4282c041fd2ff1e7bcd5772969b\n tsequence' ::\n forall {k'} (e :: * -> *) (t :: (* -> *) -> k' -> *) (x :: k').\n (GHC.Base.Applicative e, TraversableT t) =>\n t e x -> e (t Data.Functor.Identity.Identity x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n@@ -1502,20 +1502,20 @@\n @a\n @(Data.Functor.Identity.Identity a)\n (tsequence'1 @a)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R)))]\n-c6b271dd9dff13e039067d0e04ad3aef\n+2f309dbc964cdfeed18ed10b30fc87fb\n tsequence'1 :: a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \\ @a (ds['GHC.Types.Many] :: a) -> ds]\n-9ae3040e0a380526545c8f0b5c759dda\n+34edcd83874be0bc1201fef2ebdeac99\n ttraverseDefault ::\n forall {k1} {k} (t :: (k1 -> *) -> k -> *) (f :: k1 -> *)\n (g :: k1 -> *) (e :: * -> *) (x :: k).\n (GHC.Base.Applicative e, CanDeriveTraversableT t f g x) =>\n (forall (a :: k1). f a -> e (g a)) -> t f x -> e (t g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1784,15 +1784,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n *>_N\n <1>_N\n _N\n _N _N))_N\n _N)_R) _N))]\n-057185b130c23ac9c0cc56f1337f5eb9\n+ea19842ff99c32a83b73d56b12f9540c\n ttraverse_ ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (e :: * -> *)\n (f :: k -> *) c (x :: k').\n (TraversableT t, GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e c) -> t f x -> e ()\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1843,15 +1843,15 @@\n GHC.Base.<$\n @e\n $dFunctor\n @()\n @(t (Data.Functor.Const.Const ()) x)\n GHC.Tuple.Prim.()\n (g x1)]\n-9c2ab1662e2aa40099e90fb333605dcf\n+9d57e83bef1894dd3432da4395f8ad28\n ttraverse_1 :: c -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c (ds['GHC.Types.Many] :: c) -> GHC.Tuple.Prim.()]\n instance [orphan] Barbies.Generics.Traversable.GTraversable [GHC.Num.Natural.Natural,\n ., ., ., ., .,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.TraversableT [orphan module] 9066\n- interface hash: e5ddf3e60d2535f12c1df6aa9299c8aa\n- ABI hash: 1dad3f4c90632f51452d54a270e61c5c\n- export-list hash: 625e9e43bc9e9ad84f781f9b7f8b2abf\n- orphan hash: 17ea9bf13579e4bd45f73abf71a338aa\n+ interface hash: 70534723ff415a9bc014345eed40d84d\n+ ABI hash: 918f93b0edfeba7aeefead5d62361a20\n+ export-list hash: 985f3d735f8d8149cf05c5257b3e92df\n+ orphan hash: 911923e5d39c3570a534671287e5d7bc\n flag hash: 8d6e79c797196abf33b0d909acbd5bbe\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a2d68cb522029ad5b03f068295b394ec\n sig of: Nothing\n used TH splices: False\n@@ -21,18 +21,18 @@\n tfoldMap\n tsequence\n tsequence'\n ttraverseDefault\n ttraverse_\n CanDeriveTraversableT\n TraversableT{ttraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -42,35 +42,35 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable fcc5069525cb18eabc5ee2f6d115ed72\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 1180a3c086dfc51eda564a1727916603\n- gtraverse e8c1062ed3782afa31b62442c3d713bd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 4b8cfed320a9759153c9f2e1178f5919\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr c0469e5e8a962b81eaa1e5c9b2f08584\n- tell 318bc913c1a4613db9a7000eccfc0ab8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 7ee4a8d101ceda4ac9aab730f3d525a0\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable f7816c2f9a39d58706aba55efd6f45bc\n+ gtraverse 1f5e285cee2799d79ed8662ff47a29d0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer 1ac8301754bf8fc4ae662af9201e1b17\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 56d7951edbc29f9bb80efe13a3b090ce\n+ tell 44d33a86554f81bd08a29cb9f096fae7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepP f3334bccf616b949477368bb89a36f57\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n@@ -83,15 +83,15 @@\n import -/ Control.Applicative.Lift 4c061bd1a73d1b6820b48c8d4eb45f87\n import -/ Control.Monad.Trans.Except 176ed1556759282f04fc46f042d6e45b\n import -/ Control.Monad.Trans.Identity c6d9f8408d560420ccee35cf25d55d29\n import -/ Control.Monad.Trans.Maybe 82f0d330853126ad24cf41b00e8c8903\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n-692a42c3606404137f4daba983fe2b64\n+eb533e9557ca22cd44f4912c2da60118\n $dmttraverse ::\n forall k k' (t :: (k -> *) -> k' -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (TraversableT t, GHC.Base.Applicative e,\n CanDeriveTraversableT t f g x) =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -361,15 +361,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n *>_N\n <1>_N\n _N\n _N _N))_N\n _N)_R) _N))]\n-651a7064aadd04231bf381992f1efeb0\n+c56693754998a925d314ec6895f36d63\n $fGTraversableNaturalkk21fgRecRec ::\n forall k k' k2 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableT t) =>\n Barbies.Generics.Traversable.GTraversable\n 1\n@@ -402,15 +402,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-3c260184501f350c5f04f2aa77dd0ae5\n+bd02e9e40a15c58d2047c5d8a26a60e2\n $fGTraversableNaturalkk21fgRecRec0 ::\n forall k k' k2 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (Data.Traversable.Traversable h, TraversableT t) =>\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n@@ -439,15 +439,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-f8f13b955b98e81d683b973995cc36cd\n+3e2813e40ef46c46f5268ed5c4b432f8\n $fGTraversableNaturalkk21fgRecRec0_$cgtraverse ::\n forall k k' k2 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (t1 :: * -> *) (x1 :: k2).\n (Data.Traversable.Traversable h, TraversableT t,\n GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> t1 (g a))\n@@ -520,15 +520,15 @@\n (f2\n x2\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-12392b83b8a1a61c36bf3ff5d754057f\n+bcb7d490013e0f101f1377db47617c5c\n $fGTraversableNaturalkk21fgRecRec1 ::\n forall k k' k2 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n TraversableT t =>\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n@@ -554,15 +554,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-5e05d36293121d1e60157d7871049ce4\n+1ea284852068b5fa4c47ff843ab23818\n $fGTraversableNaturalkk21fgRecRec1_$cgtraverse ::\n forall k k' k2 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (t1 :: * -> *) (x1 :: k2).\n (TraversableT t, GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> t1 (g a))\n -> Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x) x1\n@@ -621,15 +621,15 @@\n (f2\n x2\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-df0ac72826ce090ffadf75af20a9cedd\n+d1415c151b678aeb15900d93b9ea2544\n $fGTraversableNaturalkk21fgRecRec_$cgtraverse ::\n forall k k' k2 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (t1 :: * -> *) (x1 :: k2).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableT t, GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n@@ -718,30 +718,30 @@\n (f2\n x2\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-fef2ef7502fe3b8410d34bcd892fb953\n+104d66c750f5c5f58c08fcaf469ff568\n $fTraversableTTYPETYPEExceptT ::\n TraversableT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @e.\n @(*)\n @(*)\n @(Control.Monad.Trans.Except.ExceptT e)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEExceptT_$ctmap @e)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEExceptT_$cttraverse @e)]\n-c58a165f2e2d99f31694aaae9fb5a459\n+f260617128c13a5052bf10b1ac6daeab\n $fTraversableTTYPETYPEExceptT_$cttraverse ::\n GHC.Base.Applicative e2 =>\n (forall a. f a -> e2 (g a))\n -> Control.Monad.Trans.Except.ExceptT e1 f x\n -> e2 (Control.Monad.Trans.Except.ExceptT e1 g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -767,30 +767,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Except.N:ExceptT[0]\n _N _R _N))\n (eta\n @(Data.Either.Either e x)\n eta1\n `cast`\n (Control.Monad.Trans.Except.N:ExceptT[0] _N _R _N))]\n-38ad4f04f31bdef51caa0f81cdd911a7\n+4ab22965a38a5123cc814b404157c1ec\n $fTraversableTTYPETYPELift ::\n TraversableT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @(*)\n @Control.Applicative.Lift.Lift\n Barbies.Internal.FunctorT.$fFunctorTTYPETYPELift_$ctmap\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n $fTraversableTTYPETYPELift_$cttraverse]\n-e501ad56e81ddfe5da3b7d4b579e4257\n+b4e7480abb394b7591771e79134e183c\n $fTraversableTTYPETYPELift_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Applicative.Lift.Lift f x\n -> e (Control.Applicative.Lift.Lift g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(MP(1C(1,C(1,L)),A),MC(1,L),A,A,A,A)><1L>,\n@@ -815,30 +815,30 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Control.Applicative.Lift.Lift g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Control.Applicative.Lift.Other @g @x ds)\n (eta @x fa) }]\n-958284d86502e278e6baee5ae089d94d\n+7fc82a18232be238fe4d618470dc8235\n $fTraversableTTYPETYPEMaybeT ::\n TraversableT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @(*)\n @Control.Monad.Trans.Maybe.MaybeT\n Barbies.Internal.FunctorT.$fFunctorTTYPETYPEMaybeT_$ctmap\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n $fTraversableTTYPETYPEMaybeT_$cttraverse]\n-86c8e41e43df19c043aee2ebf0511477\n+af8fe33ddc07cbba4239cfd9ebb5bc79\n $fTraversableTTYPETYPEMaybeT_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Maybe.MaybeT f x\n -> e (Control.Monad.Trans.Maybe.MaybeT g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -860,45 +860,45 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R _N))\n (eta\n @(GHC.Maybe.Maybe x)\n eta1 `cast` (Control.Monad.Trans.Maybe.N:MaybeT[0] _R _N))]\n-9c16112f7cebe78f7fc34c928c33c24b\n+3555f93ac15d0be34cc9ba7d9251e2d5\n $fTraversableTTYPETYPEWriterT ::\n TraversableT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(*)\n @(Control.Monad.Trans.Writer.Strict.WriterT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEWriterT_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEWriterT_$cttraverse @w)]\n-61313fe138fc08575ae6d6b391cd5c77\n+be4782e770181dc87c30c470618634c1\n $fTraversableTTYPETYPEWriterT0 ::\n TraversableT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(*)\n @(Control.Monad.Trans.Writer.Lazy.WriterT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEWriterT0_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEWriterT0_$cttraverse @w)]\n-f0b6df77c7d5d035f980388131b454ce\n+8cb809fd16e917db36303a29c7c63151\n $fTraversableTTYPETYPEWriterT0_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Writer.Lazy.WriterT w f x\n -> e (Control.Monad.Trans.Writer.Lazy.WriterT w g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -924,15 +924,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Writer.Lazy.N:WriterT[0]\n _N _R _N))\n (eta\n @(x, w)\n eta1\n `cast`\n (Control.Monad.Trans.Writer.Lazy.N:WriterT[0] _N _R _N))]\n-84a6d96f2fbb7cca489dd7859acaca3c\n+2b88ffd9f708b40f440b37e6647532ef\n $fTraversableTTYPETYPEWriterT_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Writer.Strict.WriterT w f x\n -> e (Control.Monad.Trans.Writer.Strict.WriterT w g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -959,30 +959,30 @@\n _N _R _N))\n (eta\n @(x, w)\n eta1\n `cast`\n (Control.Monad.Trans.Writer.Strict.N:WriterT[0]\n _N _R _N))]\n-ead1e60d3df6f61faa4c4b89fd5f605c\n+80a50544e140ee00196239962b4b0879\n $fTraversableTk'k'Backwards ::\n TraversableT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Control.Applicative.Backwards.Backwards\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Backwards_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Backwards_$cttraverse @k')]\n-da2105ad30c779f22d49f03e5e7101b0\n+2ed75264508fb96350a7b6544904a416\n $fTraversableTk'k'Backwards_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Control.Applicative.Backwards.Backwards f x\n -> e (Control.Applicative.Backwards.Backwards g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1009,15 +1009,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Control.Applicative.Backwards.N:Backwards[0] _N _R _N))]\n-46b4e2e21c02b03537b971161c5f6e2d\n+fa0660dc209e1e02e88110c1c83b60ce\n $fTraversableTk'k'Compose ::\n Data.Traversable.Traversable f =>\n TraversableT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n@@ -1034,15 +1034,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Compose_$cttraverse @k' @f v)]\n-18c45dc97847fba081cc2cb2b359de5c\n+5296a2022ac1a82432298e110bb7cf88\n $fTraversableTk'k'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n Data.Traversable.Traversable f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -1061,15 +1061,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-8bc0013248c4ab131ec7d3ca69a6e1ac\n+456a0e5bd56fe3de9987360da9565570\n $fTraversableTk'k'Compose_$cttraverse ::\n forall k' (f :: * -> *) (e :: * -> *) (f1 :: k' -> *)\n (g :: k' -> *) (x :: k').\n (Data.Traversable.Traversable f, GHC.Base.Applicative e) =>\n (forall (a :: k'). f1 a -> e (g a))\n -> Data.Functor.Compose.Compose f f1 x\n -> e (Data.Functor.Compose.Compose f g x)\n@@ -1105,30 +1105,30 @@\n @(g x)\n $dApplicative\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N))]\n-4d6300219d1057c822d37fd5f0b8dc0a\n+6f82c85a63eb58bd3088e59a80a8d56a\n $fTraversableTk'k'IdentityT ::\n TraversableT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Control.Monad.Trans.Identity.IdentityT\n (Barbies.Internal.FunctorT.$fFunctorTk'k'IdentityT_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'IdentityT_$cttraverse @k')]\n-87e95847af0b9ad2f42a25bde25e26cf\n+88bb3f1947d902de2b0537828ad54ad2\n $fTraversableTk'k'IdentityT_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Control.Monad.Trans.Identity.IdentityT f x\n -> e (Control.Monad.Trans.Identity.IdentityT g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1155,15 +1155,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Control.Monad.Trans.Identity.N:IdentityT[0] _N _R _N))]\n-6072537fdfe7a7efdaf357842b2b967b\n+cf23ea5880390c0516f1a8b532b2ace2\n $fTraversableTk'k'Product ::\n forall k' (f :: k' -> *).\n TraversableT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n@@ -1171,15 +1171,15 @@\n @k'\n @(Data.Functor.Product.Product f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @k' @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Product_$cttraverse @k' @f)]\n-7dd39b699a4be58873531a9f66013e2c\n+17936fc076c76ecad9dbda09da73a882\n $fTraversableTk'k'Product_$cttraverse ::\n forall k' (f1 :: k' -> *) (e :: * -> *) (f2 :: k' -> *)\n (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f2 a -> e (g a))\n -> Data.Functor.Product.Product f1 f2 x\n -> e (Data.Functor.Product.Product f1 g x)\n@@ -1201,30 +1201,30 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Data.Functor.Product.Product f g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Data.Functor.Product.Pair @k' @f @g @x fa ds)\n (eta @x ga) }]\n-5379c0357690491f165907eb3b4cdfc6\n+60a6e60f9c91ea25281fb9db69481379\n $fTraversableTk'k'Reverse ::\n TraversableT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Data.Functor.Reverse.Reverse\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Reverse_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Reverse_$cttraverse @k')]\n-3a13296464ba0034d5dacac1f642ca8f\n+2485e36df594fef8e608fadfdef0e1d0\n $fTraversableTk'k'Reverse_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Data.Functor.Reverse.Reverse f x\n -> e (Data.Functor.Reverse.Reverse g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1250,30 +1250,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Data.Functor.Reverse.N:Reverse[0] _N _R _N))]\n-6880856a9a4b5f9965fcc8a0cb61bfec\n+b2d5c814fc85900431340f8c77ee3c43\n $fTraversableTk'k'Sum ::\n forall k' (f :: k' -> *). TraversableT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n @k'\n @k'\n @(Data.Functor.Sum.Sum f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Sum_$ctmap @k' @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Sum_$cttraverse @k' @f)]\n-9762fc05e957485c505c5ec5ee227550\n+7e7b22a9a9a2dd27dc560dae8369a9df\n $fTraversableTk'k'Sum_$cttraverse ::\n forall k' (f1 :: k' -> *) (e :: * -> *) (f2 :: k' -> *)\n (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f2 a -> e (g a))\n -> Data.Functor.Sum.Sum f1 f2 x -> e (Data.Functor.Sum.Sum f1 g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1301,93 +1301,93 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Data.Functor.Sum.Sum f g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Data.Functor.Sum.InR @k' @f @g @x ds)\n (eta @x ga) }]\n-15b913e91fe7ffce70317f1c94c35c41\n+d4a435e9d199fa9dcbde962fe95b3f02\n $tcTraversableT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17484927838105860982#Word64\n- 13476100267539065414#Word64\n+ 15964797787614909903#Word64\n+ 371415074421031179#Word64\n $trModule\n $tcTraversableT2\n 2#\n $tcTraversableT1]\n-bdd9dbc2d8d54295f90c37aefa9ab182\n+42ed9c51113e9551c1c6d0cd39929c75\n $tcTraversableT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a7af357a3177dcc719423a7cab610927\n+6c64e879dd4ee197d61e579091aa1753\n $tcTraversableT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcTraversableT3]\n-e561c4f16730ddf1752da4b3f216afea\n+0251ed4fcb57a53972e51730338a9923\n $tcTraversableT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"TraversableT\"#]\n-660e77831fdd2609571eb9695722c127\n+0d94928be9e08027dcebe7ed62d176f5\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f268fa9f7238f3bbb0e914245aaca0ea\n+b1f37fb74771f0ef184393aa7ec14eba\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-7397c64acd96499afdcdf1ce9484c000\n+9d0431d3f58d2d4590858b17033151c5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.TraversableT\"#]\n-6767db4855982bb6011ae32d7d475961\n+a4e6c7eab5b5e274154da1109d4687e1\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-74b454dd80c33f97f4e255b7927bdd22\n+f093f10034f7b2098972aa0ade24b43a\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e0233e0f8ad707ca61794944dd259f3f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+618ece28277f83e20a17e00e3149c6c9\n type CanDeriveTraversableT :: forall {k1} {k}.\n ((k1 -> *) -> k -> *)\n -> (k1 -> *) -> (k1 -> *) -> k -> GHC.Types.Constraint\n type CanDeriveTraversableT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x)))\n :: GHC.Types.Constraint\n-f2f6cc9fbc491070711444fe9808fd9a\n+cde7afd24f19b9145b973d3b2bd3b27d\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-5f45683a672c1e8b493f3644d95842b8\n+85e954d72370c1d24f1ff0e67fec5163\n type TraversableT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => TraversableT t where\n ttraverse :: forall (e :: * -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n default ttraverse :: forall (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (GHC.Base.Applicative e, CanDeriveTraversableT t f g x) =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n-dd03935b128f42360c829fd3e249b034\n+0a332c01a2703820e7a4f3473c24da2e\n tfoldMap ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) m (f :: k -> *)\n (x :: k').\n (TraversableT t, GHC.Base.Monoid m) =>\n (forall (a :: k). f a -> m) -> t f x -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1434,15 +1434,15 @@\n \\ (x1['GHC.Types.Many] :: t f x) ->\n case (g x1)\n `cast`\n (Barbies.Internal.Writer.N:St[0]\n _R _R)\n lvl10 of wild { (,) a1 s' ->\n s' }]\n-699ffc06a9598fe004d904a9ee845bc0\n+94b2a8072a909ac100fc617a0145ec32\n tsequence ::\n forall {k} {k'} (e :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (x :: k').\n (GHC.Base.Applicative e, TraversableT t) =>\n t (Data.Functor.Compose.Compose e f) x -> e (t f x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n@@ -1467,15 +1467,15 @@\n $dApplicative\n (Data.Functor.Compose.getCompose1 @(*) @k @e @f)\n `cast`\n (forall (a :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-65f065cd1161989b56f7e2cd49c0b0fe\n+af70b4282c041fd2ff1e7bcd5772969b\n tsequence' ::\n forall {k'} (e :: * -> *) (t :: (* -> *) -> k' -> *) (x :: k').\n (GHC.Base.Applicative e, TraversableT t) =>\n t e x -> e (t Data.Functor.Identity.Identity x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n@@ -1502,20 +1502,20 @@\n @a\n @(Data.Functor.Identity.Identity a)\n (tsequence'1 @a)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R)))]\n-c6b271dd9dff13e039067d0e04ad3aef\n+2f309dbc964cdfeed18ed10b30fc87fb\n tsequence'1 :: a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \\ @a (ds['GHC.Types.Many] :: a) -> ds]\n-9ae3040e0a380526545c8f0b5c759dda\n+34edcd83874be0bc1201fef2ebdeac99\n ttraverseDefault ::\n forall {k1} {k} (t :: (k1 -> *) -> k -> *) (f :: k1 -> *)\n (g :: k1 -> *) (e :: * -> *) (x :: k).\n (GHC.Base.Applicative e, CanDeriveTraversableT t f g x) =>\n (forall (a :: k1). f a -> e (g a)) -> t f x -> e (t g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1784,15 +1784,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n *>_N\n <1>_N\n _N\n _N _N))_N\n _N)_R) _N))]\n-057185b130c23ac9c0cc56f1337f5eb9\n+ea19842ff99c32a83b73d56b12f9540c\n ttraverse_ ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (e :: * -> *)\n (f :: k -> *) c (x :: k').\n (TraversableT t, GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e c) -> t f x -> e ()\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1843,15 +1843,15 @@\n GHC.Base.<$\n @e\n $dFunctor\n @()\n @(t (Data.Functor.Const.Const ()) x)\n GHC.Tuple.Prim.()\n (g x1)]\n-9c2ab1662e2aa40099e90fb333605dcf\n+9d57e83bef1894dd3432da4395f8ad28\n ttraverse_1 :: c -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c (ds['GHC.Types.Many] :: c) -> GHC.Tuple.Prim.()]\n instance [orphan] Barbies.Generics.Traversable.GTraversable [GHC.Num.Natural.Natural,\n ., ., ., ., .,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,34 +1,34 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.Trivial [family instance module] 9066\n- interface hash: 61df5cfea2aa2e2316399fa93bf88457\n- ABI hash: dd747dcfe7ff87b1d46d8d101191449f\n- export-list hash: baf2c8a919692df873f6c7df3d5cc35e\n+ interface hash: 16e03ee7226ad607a303a6ae63ac2dab\n+ ABI hash: cc604b21900f4c93d6c4235735d8eb0f\n+ export-list hash: f2c7ec5793d0f2bb515387fd2fc2144e\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: b24a144faf0a42ecdffc6be1d6318598\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 8ccd4ad300023cc5720879a647526abe\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Unit{Unit}\n Void\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -38,57 +38,57 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- exports: 61e86516bb9242bfd66af8550d57db65\n- DistributiveB e01ed0fa1927b910f29b673ced05da93\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ exports: 1aecfa1521218373d8fc39d7c9313113\n+ DistributiveB b7a598d798980f56a6401cbf7835693e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n import -/ Data.Data a17655407a6710a2f91ae803ac52155a\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Typeable c952aa0add0f12de59ceef5057861fe9\n import -/ Data.Typeable.Internal 5de750529a681b69049321c2001dc613\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n import -/ GHC.Types 40ada155ed73681c14b0e90149f6df94\n-cdcb1fd82ab60add8eb235e7df64201f\n+57f4fa0a52362f887047652cd8615d23\n $fApplicativeBkUnit ::\n Barbies.Internal.ApplicativeB.ApplicativeB Unit\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ApplicativeB.C:ApplicativeB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fApplicativeBkUnit_$cbpure @k)\n ($fApplicativeBkUnit_$cbprod @k)]\n-af5f8f97a1024a5466830eadf6e61e50\n+9edb151d517faca996c70e82a2e79238\n $fApplicativeBkUnit1 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n (Data.Generics.GenericN.GenericP 0 (Unit f),\n Data.Generics.GenericN.GenericP 0 (Unit g),\n Data.Generics.GenericN.GenericP\n 0 (Unit (Data.Functor.Product.Product f g)),\n Barbies.Generics.Applicative.GApplicative\n@@ -96,87 +96,87 @@\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)))\n [TagSig: , LambdaFormInfo: LFCon[(%,,,%)],\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n ($fApplicativeBkUnit6 @k @f, $fApplicativeBkUnit6 @k @g,\n $fApplicativeBkUnit4 @k @f @g, $fApplicativeBkUnit2 @k @f @g)]\n-2b8e4889bcb4e5be85e73ec23b409196\n+96d7be50ec5b3b50cd60c95b9bda49ca\n $fApplicativeBkUnit2 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n@@ -204,18 +204,18 @@\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n @GHC.Generics.D\n @('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n ($fApplicativeBkUnit3 @k @f @g)]\n-41d5796b22db33fd2cddadfccb3047a4\n+6f47c38c40ab0e6fb509bd41083a89af\n $fApplicativeBkUnit3 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n (GHC.Generics.M1\n@@ -252,15 +252,15 @@\n (Barbies.Generics.Applicative.$fGApplicativekkknfgU1U1U1\n @GHC.Num.Natural.Natural\n @k\n @(*)\n @0\n @f\n @g)]\n-d986a27dde0bd7c26b2cd5f2098a4211\n+d7468b79bb6deb3985e0c5cce5e40436\n $fApplicativeBkUnit4 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Data.Generics.GenericN.GenericP\n 0 (Unit (Data.Functor.Product.Product f g))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n@@ -275,15 +275,15 @@\n _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -294,15 +294,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))))_R\n ($fGenericUnit @k @(Data.Functor.Product.Product f g))]\n-87d5cc7856dae72a1509cec694b60868\n+5d5308cf730332b736d4a24d64388545\n $fApplicativeBkUnit5 ::\n GHC.Types.Coercible\n (GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [HasNoCafRefs, TagSig: ,\n@@ -375,45 +375,45 @@\n Unfolding: Core: \n GHC.Types.MkCoercible\n @(* -> *)\n @(GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @~_R]\n-b856c6a0d2739bd3335a241766ae82b1\n+06c3cf94abb86f8c87f52f03647abba4\n $fApplicativeBkUnit6 ::\n forall {k} {f :: k -> *}.\n Data.Generics.GenericN.GenericP 0 (Unit f)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n Data.Generics.GenericN.$fGenericPna\n@@ -426,15 +426,15 @@\n (Sub (Sym (Rep_Unit[0] _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -445,15 +445,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))))_R\n ($fGenericUnit @k @f)]\n-360f9b707cd5a1714b316b00f0f42583\n+a42a97dd406e889b9dc3808c78a48dce\n $fApplicativeBkUnit_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> Unit f -> Unit g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a)\n (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit -> Unit @k @g }]\n-9e4411e31a2594b885347b59a0aeb7d7\n+a256682f67da9c281a62ee1909cd423e\n $fApplicativeBkUnit_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Unit f -> Unit g -> Unit (Data.Functor.Product.Product f g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n Barbies.Internal.ApplicativeB.gbprodDefault\n@@ -524,15 +524,15 @@\n _N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -543,15 +543,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -600,15 +600,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -657,15 +657,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n _N\n <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_N\n ; Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N)))_N)_R]\n-c2f56c5d90fa4a7c023a5e452a298d7b\n+b306c6547a32f338226c51bc131a301c\n $fApplicativeBkUnit_$cbpure ::\n forall k (f :: k -> *). (forall (a :: k). f a) -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Unit @k @f]\n-6a7a7fad725449d46d002f5d81f51539\n+7fb3ef783c98c416b337b7ddd8924462\n $fConstraintsBkUnit ::\n Barbies.Internal.ConstraintsB.ConstraintsB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ConstraintsB.C:ConstraintsB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkUnit_$cbaddDicts @k)]\n-8bf048fd15e20338058a5fd5fcc60e01\n+cdfb015167139ecd9cf4494d32db8d43\n $fConstraintsBkUnit_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n Barbies.Internal.ConstraintsB.AllB c Unit =>\n Unit f\n -> Unit\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -747,37 +747,37 @@\n c Unit)\n (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit ->\n Unit\n @k\n @(Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f) }]\n-cd213714506ef1bcedaf88ec296eecdb\n+ef59f03fa115a18b718f2820368cdb51\n $fConstraintsBkVoid ::\n Barbies.Internal.ConstraintsB.ConstraintsB Void\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ConstraintsB.C:ConstraintsB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Void\n ($fConstraintsBkVoid_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkVoid_$cbaddDicts @k)]\n-53c4479002535986ba7b7ba4c66dc501\n+7830737359acf29f3f9811a653573259\n $fConstraintsBkVoid1 :: GHC.Generics.V1 GHC.Types.Any\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-f62c1d8b95a5b2c099c1a8d9857951b5\n+279691d5c28f568c4e20b5231863b4c9\n $fConstraintsBkVoid2 :: GHC.Generics.V1 GHC.Types.Any\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-4de7be5c79d0e820443cb11ed6b5b6e1\n+3ea245f9cbcad13a0033eddd6beab2e5\n $fConstraintsBkVoid_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n Barbies.Internal.ConstraintsB.AllB c Void =>\n Void f\n -> Void\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -797,22 +797,22 @@\n `cast`\n ((Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0]\n _N\n _N))) _N)]\n-13e1123d6a19349e4188c03ef655ab3d\n+a342acc6e1e42c6a1b0b2a3d07e19372\n $fConstraintsBkVoid_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> Void f -> Void g\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -828,19 +828,19 @@\n `cast`\n ((Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0] _N _N))) _N)]\n-341dbecb69780b793278ecc9ef4e2e43\n+4cafbecc0678af89d082fc3bb7b2f5ab\n $fConstraintsBkVoid_$cto ::\n forall k (f :: k -> *) x. GHC.Generics.Rep (Void f) x -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @k\n @f :: k -> *\n@@ -851,20 +851,20 @@\n ((Sub (Rep_Void[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R) _N)\n ret_ty (Void f)\n of {}]\n-125f7c75d5568602b5431c12f3e57cdd\n+a1a5a4a4a7eecf1b012f9bc1384d0ff8\n $fDataUnit ::\n forall k (f :: k -> *).\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k) =>\n Data.Data.Data (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -949,52 +949,52 @@\n ($dMonad['GHC.Types.Many] :: GHC.Base.Monad m)\n (ds['GHC.Types.Many] :: forall d. Data.Data.Data d => d -> m d)\n (eta['GHC.Types.Many] :: Unit f) ->\n case eta of wild { Unit ->\n GHC.Base.return @m $dMonad @(Unit f) (Unit @k @f) })\n ($fDataUnit_$cgmapMo @k @f v v1)\n ($fDataUnit_$cgmapMo @k @f v v1)]\n-30b6ab094514ba623b948bfaf818190c\n+4b2538f8f3e65574c9a6d421a24a288f\n $fDataUnit1 :: forall {k} {f :: k -> *}. (Unit f, GHC.Types.Bool)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFCon[(,)],\n Unfolding: Core: \n \\ @k @f :: k -> * -> (Unit @k @f, GHC.Types.False)]\n-aa5d13821d8ba92a57a1ff5b5a4d213b\n+0a01773d43026ae8d561d74d67a22c87\n $fDataUnit2 :: u\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-4697eb201772d2bd1d187b75b1224482\n+a08bd09d1b3504072557b4d88d9deb99\n $fDataUnit3 :: Data.Data.DataType\n [LambdaFormInfo: LFCon[Data.Data.DataType],\n Unfolding: Core: \n Data.Data.DataType $fDataUnit7 $fDataUnit4]\n-96d138ba575ca0721548b85d71b9072f\n+71d27f4818181e63eb6b7580d34ea1b2\n $fDataUnit4 :: Data.Data.DataRep\n [LambdaFormInfo: LFCon[Data.Data.AlgRep],\n Unfolding: Core: Data.Data.AlgRep $fDataUnit5]\n-dd91f8f415a601bed629a3a1b61ac869\n+3824bbe322ab18ffbdf19667bff8f222\n $fDataUnit5 :: [Data.Data.Constr]\n [LambdaFormInfo: LFCon[:],\n Unfolding: Core: \n GHC.Types.:\n @Data.Data.Constr\n $fDataUnit6\n (GHC.Types.[] @Data.Data.Constr)]\n-d95c991b35e281a5c59840b49913aac8\n+e7c1fa0f8e31855f8373d4546eb852d0\n $fDataUnit6 :: Data.Data.Constr\n [LambdaFormInfo: LFCon[Data.Data.Constr]]\n-fe4364bdeba819ca4302551b39b5b738\n+912ca35a62ece4687494645b3a803407\n $fDataUnit7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fDataUnit8]\n-b4984323061c7667887f624eb42f8a5c\n+86fee5a359095f2f51596ea9af4a1312\n $fDataUnit8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Trivial.Unit\"#]\n-b577e51700378957d48bd76ee49e5179\n+73ced229bd7c5308afc55da565b532a0\n $fDataUnit9 ::\n forall {k} {f :: k -> *}.\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k) =>\n Data.Typeable.Internal.TypeRep (Unit f)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n@@ -1020,15 +1020,15 @@\n $dTypeable1\n `cast`\n (Data.Typeable.Internal.N:Typeable[0] <*>_N _N))\n (GHC.Types.[] @Data.Typeable.Internal.SomeTypeRep)))\n $dTypeable\n `cast`\n (Data.Typeable.Internal.N:Typeable[0] *>_N _N)]\n-3d9d24cbdf6bd8af840dcf538e80b664\n+20e30bd19fa1d0a10bb417d5416bf54c\n $fDataUnit_$cgmapMo ::\n forall k (f :: k -> *) (m :: * -> *).\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k, GHC.Base.MonadPlus m) =>\n (forall d. Data.Data.Data d => d -> m d) -> Unit f -> m (Unit f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: ,\n@@ -1039,128 +1039,128 @@\n ($dTypeable['GHC.Types.Many] :: Data.Typeable.Internal.Typeable f)\n ($dTypeable1['GHC.Types.Many] :: Data.Typeable.Internal.Typeable k)\n @m :: * -> *\n ($dMonadPlus['GHC.Types.Many] :: GHC.Base.MonadPlus m)\n (ds['GHC.Types.Many] :: forall d. Data.Data.Data d => d -> m d)\n (eta1['GHC.Types.Many] :: Unit f) ->\n $w$cgmapMo @k @f @m $dMonadPlus eta1]\n-8dfb04e0761c45bfc5e81ada01f7965d\n+8046ebc5edc32c6e00b4636011d8fda5\n $fDistributiveBkUnit ::\n Barbies.Internal.DistributiveB.DistributiveB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.DistributiveB.C:DistributiveB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fDistributiveBkUnit_$cbdistribute @k)]\n-fac7a91d37218fd71b45ba97a9e27e9c\n+e08d8a87dcaf3c36956f9bf851989663\n $fDistributiveBkUnit_$cbdistribute ::\n forall k (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (Unit g) -> Unit (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: * -> *\n @g :: k -> *\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n (x['GHC.Types.Many] :: f (Unit g)) ->\n Unit @k @(Data.Functor.Compose.Compose f g)]\n-cdfc2efbd6aebdbdce7d18c6edd51654\n+f0694ec62f02d9f936181289f41fbded\n $fEqUnit :: forall k (f :: k -> *). GHC.Classes.Eq (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f) ($fEqUnit_$c== @k @f) ($fEqUnit_$c< @k @f)]\n-4bc229443bea70f88f9828164dff103c\n+8f08a00d479633cba92851b68b9e8663\n $fEqUnit_$c< ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case a of wild { Unit ->\n case b of wild1 { Unit -> GHC.Types.False } }]\n-855bbd0368be299bdeb946591c47a70e\n+86363f23a822ba832cef95803a2594c6\n $fEqUnit_$c== ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: Unit f) ->\n case ds of wild { Unit ->\n case ds1 of wild1 { Unit -> GHC.Types.True } }]\n-5ef90ae78d7300a6b106c9fe5de35915\n+914e4e3ffcb8c1a76a796432b433d5bf\n $fEqVoid :: forall k (f :: k -> *). GHC.Classes.Eq (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f) ($fEqVoid_$c== @k @f) ($fEqVoid_$c/= @k @f)]\n-872387f5ef40045dfdc379dd74eabc99\n+2400027528d8052c96119753e7494da3\n $fEqVoid_$c/= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Types.Bool of {}]\n-cf4d35cd356773e6f06b722b570d5dc0\n+fb6bf1540e2f3f668fb8eee0762b0eaf\n $fEqVoid_$c== ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> GHC.Types.Bool) of {}]\n-2b445ae2ad2ed3088b16a77920fadbd7\n+fbd2a1b9a5c64985390ad102e00b3399\n $fFunctorBkUnit :: Barbies.Internal.FunctorB.FunctorB Unit\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fApplicativeBkUnit_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))]\n-852f51c164c02fc874ecd3299e65fb76\n+81637901a7a0970ef3ef28291c225d6c\n $fFunctorBkVoid :: Barbies.Internal.FunctorB.FunctorB Void\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fConstraintsBkVoid_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))]\n-1bac2fd51c43183086da2c7d3d0c60a4\n+61b3f9f87f7a2b5feaeb17ea5760e5fe\n $fGenericUnit ::\n forall k (f :: k -> *). GHC.Generics.Generic (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f) ($fGenericUnit_$cfrom @k @f) ($fGenericUnit_$cto @k @f)]\n-db8b9a1cbe48330fa9f00fbf58fb0679\n+f8d24ea2281c5a25ecb5965e4f9503e4\n $fGenericUnit_$cfrom ::\n forall k (f :: k -> *) x. Unit f -> GHC.Generics.Rep (Unit f) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!A>, CPR: 1, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n (\\ @k @f :: k -> * @x (x1['GHC.Types.Many] :: Unit f) ->\n case x1 of wild { Unit ->\n@@ -1177,25 +1177,25 @@\n _R\n %<'GHC.Types.Many>_N ->_R (Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Unit[0] _N _N))) _N)]\n-5ad35a968b2bd09241b651bd543a928b\n+e1b7d9fff61d94f8de55f77c03ffbc9c\n $fGenericUnit_$cto ::\n forall k (f :: k -> *) x. GHC.Generics.Rep (Unit f) x -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!A>, CPR: 1, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @k\n @f :: k -> *\n@@ -1206,39 +1206,39 @@\n ((Sub (Rep_Unit[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n _R) _N) of wild { GHC.Generics.U1 ->\n Unit @k @f }]\n-18f31c3e288dcc6e7eddf23696ae22e9\n+ca45f3804d475e74f1519d3deae8823b\n $fGenericVoid ::\n forall k (f :: k -> *). GHC.Generics.Generic (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fGenericVoid_$cfrom @k @f)\n ($fConstraintsBkVoid_$cto @k @f)]\n-b7d888541e64a1462f048549f227ef4c\n+a423e55eb1b0d5273ae219b5511607c6\n $fGenericVoid_$cfrom ::\n forall k (f :: k -> *) x. Void f -> GHC.Generics.Rep (Void f) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n (\\ @k @f :: k -> * @x (x1['GHC.Types.Many] :: Void f) ->\n case x1 ret_ty (GHC.Generics.V1 x) of {})\n@@ -1247,19 +1247,19 @@\n _R\n %<'GHC.Types.Many>_N ->_R (Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0] _N _N))) _N)]\n-5ed07b63021d11ee86c16ddfada8e171\n+272bf7e56d5c57277ca490231e2230d8\n $fMonoidUnit :: forall k (f :: k -> *). GHC.Base.Monoid (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Base.C:Monoid],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fSemigroupUnit @k @f)\n@@ -1268,144 +1268,144 @@\n (\\ (eta['GHC.Types.Many] :: [Unit f]) ->\n GHC.Base.foldr\n @(Unit f)\n @(Unit f)\n ($fMonoidUnit_$c<> @k @f)\n (Unit @k @f)\n eta)]\n-4a1a27e19d420f85b64519d1a97db33e\n+e9eb6473fbc83366cac5a2f4f672bb5f\n $fMonoidUnit_$c<> ::\n forall k (f :: k -> *). Unit f -> Unit f -> Unit f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: Unit f) ->\n case ds of wild { Unit -> ds1 }]\n-7e3bfcf2cea1db88b1377421652f82e5\n+92241fa1c7760e587550470bc6e7c347\n $fOrdUnit :: forall k (f :: k -> *). GHC.Classes.Ord (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Ord], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fEqUnit @k @f)\n ($fOrdUnit_$ccompare @k @f)\n ($fEqUnit_$c< @k @f)\n ($fOrdUnit_$c<= @k @f)\n ($fOrdUnit_$c> @k @f)\n ($fEqUnit_$c== @k @f)\n ($fOrdUnit_$cmax @k @f)\n ($fOrdUnit_$cmax @k @f)]\n-04518fe3c35860ae4f303231324fcff0\n+13976f590301910741cc6419cb3e5477\n $fOrdUnit_$c<= ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case b of wild { Unit ->\n case a of wild1 { Unit -> GHC.Types.True } }]\n-edcf3c82ebd330183deab3ae9a224a24\n+1f83cc22ce465613ede312c72f27d8f8\n $fOrdUnit_$c> ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case b of wild { Unit ->\n case a of wild1 { Unit -> GHC.Types.False } }]\n-85e324bfe55efaf27836c9398497ca13\n+a39d9740a3fca4855d09f79392dd3575\n $fOrdUnit_$ccompare ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case a of wild { Unit ->\n case b of wild1 { Unit -> GHC.Types.EQ } }]\n-96633ff035acfa87e092a6a9121361e5\n+96084145599f1ec3ef5fbdc14323aac8\n $fOrdUnit_$cmax ::\n forall k (f :: k -> *). Unit f -> Unit f -> Unit f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Unit f)\n (y['GHC.Types.Many] :: Unit f) ->\n case y of wild { Unit -> x }]\n-4fe2cb03cb0fcca89a6fc10c20b4cb87\n+a0372c975699809cbcfe33f561251c9b\n $fOrdVoid :: forall k (f :: k -> *). GHC.Classes.Ord (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Ord], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fEqVoid @k @f)\n ($fOrdVoid_$ccompare @k @f)\n ($fOrdVoid_$c>= @k @f)\n ($fOrdVoid_$c<= @k @f)\n ($fOrdVoid_$c<= @k @f)\n ($fOrdVoid_$c>= @k @f)\n ($fOrdVoid_$cmax @k @f)\n ($fOrdVoid_$cmax @k @f)]\n-a899a84071dfe62890469237dcc0a7ac\n+55b867ee2a03a9eb9725e9c9692e1383\n $fOrdVoid_$c<= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Types.Bool of {}]\n-df38bca683cdd02e8aee16f50f66fc89\n+709454ea8f800149a3f44a421b5ee53d\n $fOrdVoid_$c>= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case y ret_ty GHC.Types.Bool of {}]\n-a3f7f69361e593125ee5f0b3ed9397aa\n+ac5b35ee724acd22a5d3055a18a7af6a\n $fOrdVoid_$ccompare ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> GHC.Types.Ordering) of {}]\n-dd76dd1736a506d59a04f027d9c95f17\n+ad0729a676e7e91f480d64d248eb3e2e\n $fOrdVoid_$cmax ::\n forall k (f :: k -> *). Void f -> Void f -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty (Void f) of {}]\n-aa10bb1bf75387d04751186352d563fa\n+784078c39c349c0f9aa76de738ac30e5\n $fReadUnit :: forall k (f :: k -> *). GHC.Read.Read (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Read.C:Read],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fReadUnit_$creadsPrec @k @f)\n@@ -1413,15 +1413,15 @@\n ($fReadUnit1 @k @f)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n ($fReadUnit_$creadListPrec @k @f)]\n-67117ba5e75cf874a2e2142ada4dbec1\n+1c818c6f5e935c504035b6007eb23c41\n $fReadUnit1 ::\n forall {k} {f :: k -> *}.\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> Text.ParserCombinators.ReadP.P b\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -1441,15 +1441,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n eta\n @b\n eta1 of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @b ww }]\n-98569f0ac2e41c2c1ad153ceb1dce5d4\n+624035976708dc0fe7a1228a3608b6a2\n $fReadUnit2 ::\n forall {k} {f :: k -> *}.\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> Text.ParserCombinators.ReadP.P b\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -1459,55 +1459,55 @@\n @f :: k -> *\n (n['GHC.Types.Many] :: Text.ParserCombinators.ReadPrec.Prec)\n @b\n (eta['GHC.Types.Many] :: Unit f\n -> Text.ParserCombinators.ReadP.P b) ->\n case $w$creadPrec @k @f @b eta of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @b ww }]\n-2c2688a27ddc1af5d4e1402a75c6b226\n+caaacb3dbc5b64c2b215017976936780\n $fReadUnit3 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $tcUnit3]\n-0b69928e2bc644d4e046c14aba10ec4b\n+f9d0ef2e6c49d36dfd901a09f3686e25\n $fReadUnit4 ::\n forall {k} {f :: k -> *}. Text.ParserCombinators.ReadP.P [Unit f]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n (($fReadUnit_$creadListPrec @k @f)\n `cast`\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Unit f]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Unit f]>_R)\n @[Unit f]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure @[Unit f])]\n-fe664078033d477851e646440a661fe2\n+7b80e64bb19b27b879b1f730937572be\n $fReadUnit_$creadList ::\n forall k (f :: k -> *). Text.ParserCombinators.ReadP.ReadS [Unit f]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n Text.ParserCombinators.ReadP.run @[Unit f] ($fReadUnit4 @k @f)]\n-fd3854c5c098d4c5e29c9a61feef9f23\n+19dddbd606d2039f7e0ab5e2dbd956f3\n $fReadUnit_$creadListPrec ::\n forall k (f :: k -> *).\n Text.ParserCombinators.ReadPrec.ReadPrec [Unit f]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n GHC.Read.list\n @(Unit f)\n ($fReadUnit1 @k @f)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))]\n-51c6616920f37167a3ba0eee373b89d9\n+27e039605c4958a8c75962fa9105077c\n $fReadUnit_$creadsPrec ::\n forall k (f :: k -> *).\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Unit f)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * (eta['GHC.Types.Many] :: GHC.Types.Int) ->\n Text.ParserCombinators.ReadP.run\n@@ -1521,216 +1521,216 @@\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n eta\n @(Unit f)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Unit f)) of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @(Unit f) ww })]\n-3fc8d31621f7052633eb0319573a725a\n+764b02bc804a7b80fbc26933ce18dba5\n $fReadUnit_lexeme18 :: Text.Read.Lex.Lexeme\n [TagSig: , LambdaFormInfo: LFCon[Text.Read.Lex.Ident],\n Unfolding: Core: Text.Read.Lex.Ident $fReadUnit3]\n-0976aa22cae9f88b1d0186ba76e899ca\n+038ad944dc49b708931cbec7e332947b\n $fSemigroupUnit ::\n forall k (f :: k -> *). GHC.Base.Semigroup (Unit f)\n DFunId\n [LambdaFormInfo: LFCon[GHC.Base.C:Semigroup], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fMonoidUnit_$c<> @k @f)\n ($fSemigroupUnit_$csconcat @k @f)\n ($fSemigroupUnit_$cstimes @k @f)]\n-a13f05e62545c166d88364a288014a31\n+61d79f7e5eb8e6613dbdea1e3ad42e89\n $fSemigroupUnit1 ::\n forall {k} {f :: k -> *}. Unit f -> [Unit f] -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1L>, CPR: 1, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @f :: k -> *\n (b['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: [Unit f]) ->\n case b of wild { Unit ->\n case $wpoly_go1 @k @f ds1 of wild1 { (##) -> Unit @k @f } }]\n-7b52b7509cd98b1996298a776770e48d\n+cf004bcbde1ace8b54412219df95187d\n $fSemigroupUnit_$csconcat ::\n forall k (f :: k -> *). GHC.Base.NonEmpty (Unit f) -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(1!A,1L)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Unit f)) ->\n case ds of wild { GHC.Base.:| a1 as ->\n $fSemigroupUnit1 @k @f a1 as }]\n-3f3d928337ee11b235a6fcc171397b31\n+1ec76e0b2674629000479e4914ad74b7\n $fSemigroupUnit_$cstimes ::\n forall k (f :: k -> *) b.\n GHC.Real.Integral b =>\n b -> Unit f -> Unit f\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-fcf55461b410f7be0f5e5f9f01cc1439\n+cf1afece3f7a5b05f9c09717c98a0c3c\n $fSemigroupVoid ::\n forall k (f :: k -> *). GHC.Base.Semigroup (Void f)\n DFunId\n [LambdaFormInfo: LFCon[GHC.Base.C:Semigroup], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fSemigroupVoid_$c<> @k @f)\n ($fSemigroupVoid_$csconcat @k @f)\n ($fSemigroupVoid_$cstimes @k @f)]\n-dea2dcbb8a1298f42216e941d139e75d\n+e0fbd5d92a7506fc69d6d9f8774e13aa\n $fSemigroupVoid_$c<> ::\n forall k (f :: k -> *). Void f -> Void f -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> Void f) of {}]\n-17885224ee346008112612c40fac74f1\n+af0bd0cf277c369ed7cff4358d21ca8c\n $fSemigroupVoid_$csconcat ::\n forall k (f :: k -> *). GHC.Base.NonEmpty (Void f) -> Void f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(1L,1L)>, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Void f)) ->\n case ds of wild { GHC.Base.:| ww ww1 ->\n case ww1 of wild1 {\n [] -> ww : c cs -> case ww ret_ty (Void f) of {} } }]\n-ad600929dba3d7a3d0b5d980c13cc94b\n+d3c8e482db83ad93ed3534e5b798c492\n $fSemigroupVoid_$cstimes ::\n forall k (f :: k -> *) b.\n GHC.Real.Integral b =>\n b -> Void f -> Void f\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-cff67e162fb70fd07a4485e34266ea5c\n+967a7b3d5674289350578b29887534e3\n $fShowUnit :: forall k (f :: k -> *). GHC.Show.Show (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Show.C:Show],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fShowUnit_$cshowsPrec @k @f)\n ($fShowUnit_$cshow @k @f)\n ($fShowUnit_$cshowList @k @f)]\n-66b6a2fac41b912b8e109750d00cd80e\n+469c95b915497d9c6e98dab4e6b4c333\n $fShowUnit1 :: forall {k} {f :: k -> *}. Unit f -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Unit ->\n GHC.CString.unpackAppendCString# $tcUnit3 eta }]\n-7615d4af19cf50d68f48f878b8ebe908\n+f95f539f1e3deacd130e69fb7827ada9\n $fShowUnit_$cshow ::\n forall k (f :: k -> *). Unit f -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1!A>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit -> $fReadUnit3 }]\n-401752c02cdca1f19eb1525d964ab58f\n+84bee04dc164b6fd81df3deafd4a02df\n $fShowUnit_$cshowList ::\n forall k (f :: k -> *). [Unit f] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @f :: k -> *\n (ls['GHC.Types.Many] :: [Unit f])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Unit f) ($fShowUnit1 @k @f) ls s]\n-f791fa2b69bd9f1e55b978f314b68884\n+560d9ccdb71dd0ec70fff20d5f67f155\n $fShowUnit_$cshowsPrec ::\n forall k (f :: k -> *). GHC.Types.Int -> Unit f -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (ds1['GHC.Types.Many] :: Unit f)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds1 of wild { Unit ->\n GHC.CString.unpackAppendCString# $tcUnit3 eta }]\n-2f8c52be161717f07fe51bfeb24a9de5\n+76389038dabff11cad6d2d678257b9e5\n $fShowVoid :: forall k (f :: k -> *). GHC.Show.Show (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Show.C:Show], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fShowVoid_$cshowsPrec @k @f)\n ($fShowVoid_$cshow @k @f)\n ($fShowVoid_$cshowList @k @f)]\n-26707e5e06b65d06115fcafd264acd34\n+7dd4848c5c3df72b9b5ba379b0ab8ca7\n $fShowVoid1 :: forall {k} {f :: k -> *}. Void f -> GHC.Show.ShowS\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty GHC.Show.ShowS of {}]\n-13c2e089827ad50373d0b0d0a80aaa52\n+300de0ffa10f395caef3d7d6ecbdb7d8\n $fShowVoid_$cshow ::\n forall k (f :: k -> *). Void f -> GHC.Base.String\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (x['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Base.String of {}]\n-601d31194a04f5f4e74fbc16bd436a92\n+6eb93b77c7f541a5ddb1550f9c05f917\n $fShowVoid_$cshowList ::\n forall k (f :: k -> *). [Void f] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @f :: k -> *\n (ls['GHC.Types.Many] :: [Void f])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Void f) ($fShowVoid1 @k @f) ls s]\n-9d24591faead7ff4741c813518990bdc\n+8051085e02b0864e88b435d6de4c36ed\n $fShowVoid_$cshowsPrec ::\n forall k (f :: k -> *). GHC.Types.Int -> Void f -> GHC.Show.ShowS\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty GHC.Show.ShowS of {}]\n-518b7780fe9b20723b08ee5e7bd09f59\n+890df8aaae42427f01a927b6f73233c2\n $fTraversableBkUnit ::\n Barbies.Internal.TraversableB.TraversableB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.TraversableB.C:TraversableB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkUnit_$cbtraverse @k)]\n-bf9f476a5ab643dca138380558a5b926\n+a25518b4dafea274604ea71ec89b31a4\n $fTraversableBkUnit1 ::\n GHC.Generics.U1 GHC.Types.Any -> GHC.Generics.U1 GHC.Types.Any\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!A>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ (ds['GHC.Types.Many] :: GHC.Generics.U1 GHC.Types.Any) -> ds]\n-e2093140333b8caa5526fa7a8b07dbed\n+e4ac526cf73f8ba187a1f69f0991d7b9\n $fTraversableBkUnit2 ::\n GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1\n GHC.Types.Any\n@@ -1746,15 +1746,15 @@\n \\ (ds['GHC.Types.Many] :: GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1\n GHC.Types.Any) ->\n ds]\n-a44d7148a177a0b4e2a5bc613ad31f81\n+b6554409cb3a757d166c3b0aab742ae3\n $fTraversableBkUnit_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> Unit f -> e (Unit g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: [2],\n@@ -1762,150 +1762,150 @@\n \\ @k\n @e :: * -> *\n @f :: k -> *\n @g :: k -> *\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative e)\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a)) ->\n $w$cbtraverse @k @e @f @g $dApplicative]\n-f9f6cd8aaac6d8771b22cf8f6a8c3149\n+9f1321883b85dedc2e290657e87ba09d\n $fTraversableBkVoid ::\n Barbies.Internal.TraversableB.TraversableB Void\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.TraversableB.C:TraversableB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Void\n ($fConstraintsBkVoid_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkVoid_$cbtraverse @k)]\n-f5453925a21f745a6e45297a61fc97dc\n+c5379ecc50562fe81c14e74961298db0\n $fTraversableBkVoid1 :: e (GHC.Generics.V1 GHC.Types.Any)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-1ac952f93965abe7753d5403f6c8021c\n+2ac0263de78f09012ae14d679c503db3\n $fTraversableBkVoid2 ::\n GHC.Generics.V1 GHC.Types.Any -> GHC.Generics.V1 GHC.Types.Any\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, CPR: b,\n Unfolding: Core: \n \\ (ds['GHC.Types.Many] :: GHC.Generics.V1 GHC.Types.Any) -> ds]\n-a452309a549123a78f5ca04e2285f2f6\n+f23f3d1ad0dfb182e6a5d7656a528290\n $fTraversableBkVoid_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> Void f -> e (Void g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @e :: * -> *\n @f :: k -> *\n @g :: k -> *\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative e)\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a)) ->\n $w$cbtraverse1 @k @e @f @g $dApplicative]\n-7d87e1e6de936ad4f2b660002a5bb4a2\n+5a7b2997c5aeffc2a7db991a19eefc4d\n $tc'Unit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2037945628109684343#Word64\n- 3105404948668750788#Word64\n+ 11182171310931468719#Word64\n+ 15130054231645004319#Word64\n $trModule\n $tc'Unit2\n 2#\n $tc'Unit1]\n-6d9d58d423e3c8433afc20c36ca55660\n+ba7283be9cde66c007985346f61c5adc\n $tc'Unit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepTyConApp], Inline: [~]]\n-197954868841bb9a2a7e5ad4e2eb1690\n+37cb0a3e1453daa5245195e9fd914145\n $tc'Unit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Unit3]\n-e38c9b5774ffaddd577a9da1243b9c01\n+df550ca6607aacf3ced74baabd787150\n $tc'Unit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Unit\"#]\n-76d7bd2419a8b1ccd453a2c37d3afc1f\n+60667ee87fd6c04f0f4b6c638a1819ca\n $tcUnit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 376088529795041861#Word64\n- 17036368632291288187#Word64\n+ 4400758968235990726#Word64\n+ 10609866802840247821#Word64\n $trModule\n $tcUnit2\n 1#\n $tcUnit1]\n-ac7826a56b85bfa91610ca5c044cf7fd\n+b4e5599a2e0a6fc106f274eacea97db4\n $tcUnit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-6f6ab7b32c6f8df93c076e4f29b4d0d3\n+eadacb3e0f8420eae859a40757928bf5\n $tcUnit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcUnit3]\n-c4b818509730ae1df37cd1431bfac0d0\n+48213a220ddbce89449619d55bfc6f29\n $tcUnit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Unit\"#]\n-59b8bdbb38b837efb9b92da37ec57cfa\n+3fa553ec849965a49744bd53545ed41e\n $tcVoid :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11724475054022156485#Word64\n- 16512914446536540340#Word64\n+ 15534941731016754011#Word64\n+ 14556625491385436117#Word64\n $trModule\n $tcVoid1\n 1#\n $tcUnit1]\n-989bc38fe9b68b062cad2bc8ed2f7ff0\n+0f3e1656da072f781514b688f628382c\n $tcVoid1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcVoid2]\n-9ec764fb4bef8c2995c4cfb105a7b2d5\n+a127e11570f7fc56b7eb6d5a9df0081b\n $tcVoid2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Void\"#]\n-37fabeae6e71866f018d3ecf19babc99\n+8d2fc5374840026ed70dd271fdfe15ff\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-7f27288f386466f8030e41df04171ef4\n+15f6c340cb21b7720537e862b23b1654\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-343d429f740b11d7056fb2985f05f9f1\n+99ef5acab82fa44157a5c9867c67a2b4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Trivial\"#]\n-6b6b7c194bd03929444667004c2e6f1c\n+81c3d87de01b16e1922d6e7f880a1be9\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b5f045fe37aad4d42ddc0e88f3f20b3f\n+c3c9295c398cba836967ee71be3e8068\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-aaaf291a31a4c43cd484735f57856d5d\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+ff209b83bc05974c3653f16c5433a728\n $w$cbtraverse ::\n forall {k} {e :: * -> *} {f :: k -> *} {g :: k -> *}.\n GHC.Base.Applicative e =>\n Unit f -> e (Unit g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -1942,15 +1942,15 @@\n ((Sub (Rep_Unit[0] _N _N)\n ; (GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1961,15 +1961,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n e (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n GHC.Types.Any)\n@@ -2024,15 +2024,15 @@\n GHC.Generics.U1\n GHC.Types.Any)\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n GHC.Types.Any)\n@@ -2046,15 +2046,15 @@\n GHC.Types.Any>_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R\n ; GHC.Generics.N:M1[0]\n@@ -2127,15 +2127,15 @@\n `cast`\n (_R (((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -2146,15 +2146,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n (Sym (Data.Generics.GenericN.D:R:Indexed[1]\n <(k -> *) -> *>_N\n (Sym (Add0L (<1>_N)))\n _N)))_N) _N))_N)\n (Sym (Rep_Unit[0] _N _N)))_N) _N))]\n-594a34b6ea7684c5547203d4de59bd2b\n+39e9193816cd50f6eb1170c682e5a965\n $w$cbtraverse1 ::\n forall {k} {e :: * -> *} {f :: k -> *} {g :: k -> *}.\n GHC.Base.Applicative e =>\n Void f -> e (Void g)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -2208,23 +2208,23 @@\n ((Sub (Rep_Void[0] _N _N)\n ; (GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[5]))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ; (Data.Generics.GenericN.Zip\n (Sym (Rep_Void[0] _N _N)\n ; (GHC.Generics.Rep\n ((Sym (Data.Generics.GenericN.D:R:FilterIndex[2]\n@@ -2244,47 +2244,47 @@\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(GHC.Generics.V1 GHC.Types.Any)\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n GHC.Generics.V1\n GHC.Types.Any)\n $fTraversableBkVoid2\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R) _N)\n ($fTraversableBkVoid1 @e))\n `cast`\n (_R (((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[5])))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N)\n ; (Data.Generics.GenericN.Zip\n (Sym (Rep_Void[0] _N _N)\n ; (GHC.Generics.Rep\n ((Sym (Data.Generics.GenericN.D:R:FilterIndex[2]\n@@ -2296,15 +2296,15 @@\n <(k -> *) -> *>_N\n (Sym (Add0L (<1>_N)))\n _N)))_N) _N))_N)\n (Sym (Rep_Void[0] _N _N)))_N) _N))\n } in\n \\ (x['GHC.Types.Many] :: Void f) -> lvl38]\n-4397906b99a0d81b672d44a6ac00dfba\n+4a72a26330918095fe37bbb73b598d6c\n $w$cgmapMo ::\n forall {k} {f :: k -> *} {m :: * -> *}.\n GHC.Base.MonadPlus m =>\n Unit f -> m (Unit f)\n StrWork([!])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: [2],\n@@ -2325,15 +2325,15 @@\n @(Unit f)\n (case eta1 of wild1 { Unit ->\n ww3 @(Unit f, GHC.Types.Bool) ($fDataUnit1 @k @f) })\n (\\ (ds['GHC.Types.Many] :: (Unit f, GHC.Types.Bool)) ->\n case ds of wild1 { (,) x' b ->\n case b of wild2 {\n GHC.Types.False -> lvl38 GHC.Types.True -> ww3 @(Unit f) x' } }) }]\n-4f702ff3f5feb78077ab6f3cc05493b1\n+9bd002bd5f9fcd044a017127776ab108\n $w$creadPrec ::\n forall {k} {f :: k -> *} {b}.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> (# GHC.Base.String -> Text.ParserCombinators.ReadP.P b #)\n [TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -2359,61 +2359,61 @@\n [Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ (a1['GHC.Types.Many] :: ()) -> lvl126]\n = \\ (a1['GHC.Types.Many] :: ()) -> lvl126\n } in\n (# \\ (a['GHC.Types.Many] :: GHC.Base.String) ->\n Text.ParserCombinators.ReadP.skipSpaces2 a @b k1 #)]\n-341c8140df88263deb6fe462480d1fe5\n+55dda9b0db33a37b1c966d634a7b97fe\n $wpoly_go1 :: forall {k} {f :: k -> *}. [Unit f] -> (# #)\n StrWork([!])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [2]]\n-04cb6aeef862fc60b50ab22a047e79cd\n+cf2cde244d6fb68087d0702743b39d0a\n axiom R:AllBkcUnit ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c Unit\n = Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB Unit)\n-40557eaec235effdd4cdafeecd48d521\n+92e00d8bc9896d358e26b53a30d154b2\n axiom R:AllBkcVoid ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c Void\n = Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB Void)\n-75a080b3521fb6971602b562a49378f8\n+7788cf58864a164f991e62d338005b6a\n axiom Rep_Unit ::\n forall k (f :: k -> *).\n GHC.Generics.Rep (Unit f)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n-8dc333bb5f86f47c7a60275a47ea385f\n+25dae5a5a20ed34a86fce6f00a09ddba\n axiom Rep_Void ::\n forall k (f :: k -> *).\n GHC.Generics.Rep (Void f)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n GHC.Generics.V1\n-c80693ce02b344afc7a6b8ed5ccdb0fa\n+d4f1cf012aa14062f0601f6413e55372\n type role Unit phantom\n type Unit :: forall k. (k -> *) -> *\n data Unit f = Unit\n-93784768def362ba0bea698b816d92eb\n+e576c7f3bd180bf081dbb2756313ea69\n type role Void phantom\n type Void :: forall k. (k -> *) -> *\n data Void f\n instance Barbies.Internal.ApplicativeB.ApplicativeB [., Unit]\n = $fApplicativeBkUnit\n instance Barbies.Internal.ConstraintsB.ConstraintsB [., Unit]\n = $fConstraintsBkUnit\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,34 +1,34 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.Trivial [family instance module] 9066\n- interface hash: 61df5cfea2aa2e2316399fa93bf88457\n- ABI hash: dd747dcfe7ff87b1d46d8d101191449f\n- export-list hash: baf2c8a919692df873f6c7df3d5cc35e\n+ interface hash: 16e03ee7226ad607a303a6ae63ac2dab\n+ ABI hash: cc604b21900f4c93d6c4235735d8eb0f\n+ export-list hash: f2c7ec5793d0f2bb515387fd2fc2144e\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: b8596bdafa116f46285165b129defa59\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 8ccd4ad300023cc5720879a647526abe\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Unit{Unit}\n Void\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -38,57 +38,57 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- exports: 61e86516bb9242bfd66af8550d57db65\n- DistributiveB e01ed0fa1927b910f29b673ced05da93\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ exports: 1aecfa1521218373d8fc39d7c9313113\n+ DistributiveB b7a598d798980f56a6401cbf7835693e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n import -/ Data.Data a17655407a6710a2f91ae803ac52155a\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Typeable c952aa0add0f12de59ceef5057861fe9\n import -/ Data.Typeable.Internal 5de750529a681b69049321c2001dc613\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n import -/ GHC.Types 40ada155ed73681c14b0e90149f6df94\n-cdcb1fd82ab60add8eb235e7df64201f\n+57f4fa0a52362f887047652cd8615d23\n $fApplicativeBkUnit ::\n Barbies.Internal.ApplicativeB.ApplicativeB Unit\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ApplicativeB.C:ApplicativeB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fApplicativeBkUnit_$cbpure @k)\n ($fApplicativeBkUnit_$cbprod @k)]\n-af5f8f97a1024a5466830eadf6e61e50\n+9edb151d517faca996c70e82a2e79238\n $fApplicativeBkUnit1 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n (Data.Generics.GenericN.GenericP 0 (Unit f),\n Data.Generics.GenericN.GenericP 0 (Unit g),\n Data.Generics.GenericN.GenericP\n 0 (Unit (Data.Functor.Product.Product f g)),\n Barbies.Generics.Applicative.GApplicative\n@@ -96,87 +96,87 @@\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)))\n [TagSig: , LambdaFormInfo: LFCon[(%,,,%)],\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n ($fApplicativeBkUnit6 @k @f, $fApplicativeBkUnit6 @k @g,\n $fApplicativeBkUnit4 @k @f @g, $fApplicativeBkUnit2 @k @f @g)]\n-2b8e4889bcb4e5be85e73ec23b409196\n+96d7be50ec5b3b50cd60c95b9bda49ca\n $fApplicativeBkUnit2 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n@@ -204,18 +204,18 @@\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n @GHC.Generics.D\n @('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n ($fApplicativeBkUnit3 @k @f @g)]\n-41d5796b22db33fd2cddadfccb3047a4\n+6f47c38c40ab0e6fb509bd41083a89af\n $fApplicativeBkUnit3 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n (GHC.Generics.M1\n@@ -252,15 +252,15 @@\n (Barbies.Generics.Applicative.$fGApplicativekkknfgU1U1U1\n @GHC.Num.Natural.Natural\n @k\n @(*)\n @0\n @f\n @g)]\n-d986a27dde0bd7c26b2cd5f2098a4211\n+d7468b79bb6deb3985e0c5cce5e40436\n $fApplicativeBkUnit4 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Data.Generics.GenericN.GenericP\n 0 (Unit (Data.Functor.Product.Product f g))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n@@ -275,15 +275,15 @@\n _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -294,15 +294,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))))_R\n ($fGenericUnit @k @(Data.Functor.Product.Product f g))]\n-87d5cc7856dae72a1509cec694b60868\n+5d5308cf730332b736d4a24d64388545\n $fApplicativeBkUnit5 ::\n GHC.Types.Coercible\n (GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [HasNoCafRefs, TagSig: ,\n@@ -375,45 +375,45 @@\n Unfolding: Core: \n GHC.Types.MkCoercible\n @(* -> *)\n @(GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @~_R]\n-b856c6a0d2739bd3335a241766ae82b1\n+06c3cf94abb86f8c87f52f03647abba4\n $fApplicativeBkUnit6 ::\n forall {k} {f :: k -> *}.\n Data.Generics.GenericN.GenericP 0 (Unit f)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n Data.Generics.GenericN.$fGenericPna\n@@ -426,15 +426,15 @@\n (Sub (Sym (Rep_Unit[0] _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -445,15 +445,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))))_R\n ($fGenericUnit @k @f)]\n-360f9b707cd5a1714b316b00f0f42583\n+a42a97dd406e889b9dc3808c78a48dce\n $fApplicativeBkUnit_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> Unit f -> Unit g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a)\n (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit -> Unit @k @g }]\n-9e4411e31a2594b885347b59a0aeb7d7\n+a256682f67da9c281a62ee1909cd423e\n $fApplicativeBkUnit_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Unit f -> Unit g -> Unit (Data.Functor.Product.Product f g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n Barbies.Internal.ApplicativeB.gbprodDefault\n@@ -524,15 +524,15 @@\n _N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -543,15 +543,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -600,15 +600,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -657,15 +657,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n _N\n <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_N\n ; Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N)))_N)_R]\n-c2f56c5d90fa4a7c023a5e452a298d7b\n+b306c6547a32f338226c51bc131a301c\n $fApplicativeBkUnit_$cbpure ::\n forall k (f :: k -> *). (forall (a :: k). f a) -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Unit @k @f]\n-6a7a7fad725449d46d002f5d81f51539\n+7fb3ef783c98c416b337b7ddd8924462\n $fConstraintsBkUnit ::\n Barbies.Internal.ConstraintsB.ConstraintsB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ConstraintsB.C:ConstraintsB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkUnit_$cbaddDicts @k)]\n-8bf048fd15e20338058a5fd5fcc60e01\n+cdfb015167139ecd9cf4494d32db8d43\n $fConstraintsBkUnit_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n Barbies.Internal.ConstraintsB.AllB c Unit =>\n Unit f\n -> Unit\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -747,37 +747,37 @@\n c Unit)\n (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit ->\n Unit\n @k\n @(Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f) }]\n-cd213714506ef1bcedaf88ec296eecdb\n+ef59f03fa115a18b718f2820368cdb51\n $fConstraintsBkVoid ::\n Barbies.Internal.ConstraintsB.ConstraintsB Void\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ConstraintsB.C:ConstraintsB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Void\n ($fConstraintsBkVoid_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkVoid_$cbaddDicts @k)]\n-53c4479002535986ba7b7ba4c66dc501\n+7830737359acf29f3f9811a653573259\n $fConstraintsBkVoid1 :: GHC.Generics.V1 GHC.Types.Any\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-f62c1d8b95a5b2c099c1a8d9857951b5\n+279691d5c28f568c4e20b5231863b4c9\n $fConstraintsBkVoid2 :: GHC.Generics.V1 GHC.Types.Any\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-4de7be5c79d0e820443cb11ed6b5b6e1\n+3ea245f9cbcad13a0033eddd6beab2e5\n $fConstraintsBkVoid_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n Barbies.Internal.ConstraintsB.AllB c Void =>\n Void f\n -> Void\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -797,22 +797,22 @@\n `cast`\n ((Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0]\n _N\n _N))) _N)]\n-13e1123d6a19349e4188c03ef655ab3d\n+a342acc6e1e42c6a1b0b2a3d07e19372\n $fConstraintsBkVoid_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> Void f -> Void g\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -828,19 +828,19 @@\n `cast`\n ((Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0] _N _N))) _N)]\n-341dbecb69780b793278ecc9ef4e2e43\n+4cafbecc0678af89d082fc3bb7b2f5ab\n $fConstraintsBkVoid_$cto ::\n forall k (f :: k -> *) x. GHC.Generics.Rep (Void f) x -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @k\n @f :: k -> *\n@@ -851,20 +851,20 @@\n ((Sub (Rep_Void[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R) _N)\n ret_ty (Void f)\n of {}]\n-125f7c75d5568602b5431c12f3e57cdd\n+a1a5a4a4a7eecf1b012f9bc1384d0ff8\n $fDataUnit ::\n forall k (f :: k -> *).\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k) =>\n Data.Data.Data (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -949,52 +949,52 @@\n ($dMonad['GHC.Types.Many] :: GHC.Base.Monad m)\n (ds['GHC.Types.Many] :: forall d. Data.Data.Data d => d -> m d)\n (eta['GHC.Types.Many] :: Unit f) ->\n case eta of wild { Unit ->\n GHC.Base.return @m $dMonad @(Unit f) (Unit @k @f) })\n ($fDataUnit_$cgmapMo @k @f v v1)\n ($fDataUnit_$cgmapMo @k @f v v1)]\n-30b6ab094514ba623b948bfaf818190c\n+4b2538f8f3e65574c9a6d421a24a288f\n $fDataUnit1 :: forall {k} {f :: k -> *}. (Unit f, GHC.Types.Bool)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFCon[(,)],\n Unfolding: Core: \n \\ @k @f :: k -> * -> (Unit @k @f, GHC.Types.False)]\n-aa5d13821d8ba92a57a1ff5b5a4d213b\n+0a01773d43026ae8d561d74d67a22c87\n $fDataUnit2 :: u\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-4697eb201772d2bd1d187b75b1224482\n+a08bd09d1b3504072557b4d88d9deb99\n $fDataUnit3 :: Data.Data.DataType\n [LambdaFormInfo: LFCon[Data.Data.DataType],\n Unfolding: Core: \n Data.Data.DataType $fDataUnit7 $fDataUnit4]\n-96d138ba575ca0721548b85d71b9072f\n+71d27f4818181e63eb6b7580d34ea1b2\n $fDataUnit4 :: Data.Data.DataRep\n [LambdaFormInfo: LFCon[Data.Data.AlgRep],\n Unfolding: Core: Data.Data.AlgRep $fDataUnit5]\n-dd91f8f415a601bed629a3a1b61ac869\n+3824bbe322ab18ffbdf19667bff8f222\n $fDataUnit5 :: [Data.Data.Constr]\n [LambdaFormInfo: LFCon[:],\n Unfolding: Core: \n GHC.Types.:\n @Data.Data.Constr\n $fDataUnit6\n (GHC.Types.[] @Data.Data.Constr)]\n-d95c991b35e281a5c59840b49913aac8\n+e7c1fa0f8e31855f8373d4546eb852d0\n $fDataUnit6 :: Data.Data.Constr\n [LambdaFormInfo: LFCon[Data.Data.Constr]]\n-fe4364bdeba819ca4302551b39b5b738\n+912ca35a62ece4687494645b3a803407\n $fDataUnit7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fDataUnit8]\n-b4984323061c7667887f624eb42f8a5c\n+86fee5a359095f2f51596ea9af4a1312\n $fDataUnit8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Trivial.Unit\"#]\n-b577e51700378957d48bd76ee49e5179\n+73ced229bd7c5308afc55da565b532a0\n $fDataUnit9 ::\n forall {k} {f :: k -> *}.\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k) =>\n Data.Typeable.Internal.TypeRep (Unit f)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n@@ -1020,15 +1020,15 @@\n $dTypeable1\n `cast`\n (Data.Typeable.Internal.N:Typeable[0] <*>_N _N))\n (GHC.Types.[] @Data.Typeable.Internal.SomeTypeRep)))\n $dTypeable\n `cast`\n (Data.Typeable.Internal.N:Typeable[0] *>_N _N)]\n-3d9d24cbdf6bd8af840dcf538e80b664\n+20e30bd19fa1d0a10bb417d5416bf54c\n $fDataUnit_$cgmapMo ::\n forall k (f :: k -> *) (m :: * -> *).\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k, GHC.Base.MonadPlus m) =>\n (forall d. Data.Data.Data d => d -> m d) -> Unit f -> m (Unit f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: ,\n@@ -1039,128 +1039,128 @@\n ($dTypeable['GHC.Types.Many] :: Data.Typeable.Internal.Typeable f)\n ($dTypeable1['GHC.Types.Many] :: Data.Typeable.Internal.Typeable k)\n @m :: * -> *\n ($dMonadPlus['GHC.Types.Many] :: GHC.Base.MonadPlus m)\n (ds['GHC.Types.Many] :: forall d. Data.Data.Data d => d -> m d)\n (eta1['GHC.Types.Many] :: Unit f) ->\n $w$cgmapMo @k @f @m $dMonadPlus eta1]\n-8dfb04e0761c45bfc5e81ada01f7965d\n+8046ebc5edc32c6e00b4636011d8fda5\n $fDistributiveBkUnit ::\n Barbies.Internal.DistributiveB.DistributiveB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.DistributiveB.C:DistributiveB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fDistributiveBkUnit_$cbdistribute @k)]\n-fac7a91d37218fd71b45ba97a9e27e9c\n+e08d8a87dcaf3c36956f9bf851989663\n $fDistributiveBkUnit_$cbdistribute ::\n forall k (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (Unit g) -> Unit (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: * -> *\n @g :: k -> *\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n (x['GHC.Types.Many] :: f (Unit g)) ->\n Unit @k @(Data.Functor.Compose.Compose f g)]\n-cdfc2efbd6aebdbdce7d18c6edd51654\n+f0694ec62f02d9f936181289f41fbded\n $fEqUnit :: forall k (f :: k -> *). GHC.Classes.Eq (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f) ($fEqUnit_$c== @k @f) ($fEqUnit_$c< @k @f)]\n-4bc229443bea70f88f9828164dff103c\n+8f08a00d479633cba92851b68b9e8663\n $fEqUnit_$c< ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case a of wild { Unit ->\n case b of wild1 { Unit -> GHC.Types.False } }]\n-855bbd0368be299bdeb946591c47a70e\n+86363f23a822ba832cef95803a2594c6\n $fEqUnit_$c== ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: Unit f) ->\n case ds of wild { Unit ->\n case ds1 of wild1 { Unit -> GHC.Types.True } }]\n-5ef90ae78d7300a6b106c9fe5de35915\n+914e4e3ffcb8c1a76a796432b433d5bf\n $fEqVoid :: forall k (f :: k -> *). GHC.Classes.Eq (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f) ($fEqVoid_$c== @k @f) ($fEqVoid_$c/= @k @f)]\n-872387f5ef40045dfdc379dd74eabc99\n+2400027528d8052c96119753e7494da3\n $fEqVoid_$c/= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Types.Bool of {}]\n-cf4d35cd356773e6f06b722b570d5dc0\n+fb6bf1540e2f3f668fb8eee0762b0eaf\n $fEqVoid_$c== ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> GHC.Types.Bool) of {}]\n-2b445ae2ad2ed3088b16a77920fadbd7\n+fbd2a1b9a5c64985390ad102e00b3399\n $fFunctorBkUnit :: Barbies.Internal.FunctorB.FunctorB Unit\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fApplicativeBkUnit_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))]\n-852f51c164c02fc874ecd3299e65fb76\n+81637901a7a0970ef3ef28291c225d6c\n $fFunctorBkVoid :: Barbies.Internal.FunctorB.FunctorB Void\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fConstraintsBkVoid_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))]\n-1bac2fd51c43183086da2c7d3d0c60a4\n+61b3f9f87f7a2b5feaeb17ea5760e5fe\n $fGenericUnit ::\n forall k (f :: k -> *). GHC.Generics.Generic (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f) ($fGenericUnit_$cfrom @k @f) ($fGenericUnit_$cto @k @f)]\n-db8b9a1cbe48330fa9f00fbf58fb0679\n+f8d24ea2281c5a25ecb5965e4f9503e4\n $fGenericUnit_$cfrom ::\n forall k (f :: k -> *) x. Unit f -> GHC.Generics.Rep (Unit f) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!A>, CPR: 1, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n (\\ @k @f :: k -> * @x (x1['GHC.Types.Many] :: Unit f) ->\n case x1 of wild { Unit ->\n@@ -1177,25 +1177,25 @@\n _R\n %<'GHC.Types.Many>_N ->_R (Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Unit[0] _N _N))) _N)]\n-5ad35a968b2bd09241b651bd543a928b\n+e1b7d9fff61d94f8de55f77c03ffbc9c\n $fGenericUnit_$cto ::\n forall k (f :: k -> *) x. GHC.Generics.Rep (Unit f) x -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!A>, CPR: 1, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @k\n @f :: k -> *\n@@ -1206,39 +1206,39 @@\n ((Sub (Rep_Unit[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n _R) _N) of wild { GHC.Generics.U1 ->\n Unit @k @f }]\n-18f31c3e288dcc6e7eddf23696ae22e9\n+ca45f3804d475e74f1519d3deae8823b\n $fGenericVoid ::\n forall k (f :: k -> *). GHC.Generics.Generic (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fGenericVoid_$cfrom @k @f)\n ($fConstraintsBkVoid_$cto @k @f)]\n-b7d888541e64a1462f048549f227ef4c\n+a423e55eb1b0d5273ae219b5511607c6\n $fGenericVoid_$cfrom ::\n forall k (f :: k -> *) x. Void f -> GHC.Generics.Rep (Void f) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n (\\ @k @f :: k -> * @x (x1['GHC.Types.Many] :: Void f) ->\n case x1 ret_ty (GHC.Generics.V1 x) of {})\n@@ -1247,19 +1247,19 @@\n _R\n %<'GHC.Types.Many>_N ->_R (Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0] _N _N))) _N)]\n-5ed07b63021d11ee86c16ddfada8e171\n+272bf7e56d5c57277ca490231e2230d8\n $fMonoidUnit :: forall k (f :: k -> *). GHC.Base.Monoid (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Base.C:Monoid],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fSemigroupUnit @k @f)\n@@ -1268,144 +1268,144 @@\n (\\ (eta['GHC.Types.Many] :: [Unit f]) ->\n GHC.Base.foldr\n @(Unit f)\n @(Unit f)\n ($fMonoidUnit_$c<> @k @f)\n (Unit @k @f)\n eta)]\n-4a1a27e19d420f85b64519d1a97db33e\n+e9eb6473fbc83366cac5a2f4f672bb5f\n $fMonoidUnit_$c<> ::\n forall k (f :: k -> *). Unit f -> Unit f -> Unit f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: Unit f) ->\n case ds of wild { Unit -> ds1 }]\n-7e3bfcf2cea1db88b1377421652f82e5\n+92241fa1c7760e587550470bc6e7c347\n $fOrdUnit :: forall k (f :: k -> *). GHC.Classes.Ord (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Ord], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fEqUnit @k @f)\n ($fOrdUnit_$ccompare @k @f)\n ($fEqUnit_$c< @k @f)\n ($fOrdUnit_$c<= @k @f)\n ($fOrdUnit_$c> @k @f)\n ($fEqUnit_$c== @k @f)\n ($fOrdUnit_$cmax @k @f)\n ($fOrdUnit_$cmax @k @f)]\n-04518fe3c35860ae4f303231324fcff0\n+13976f590301910741cc6419cb3e5477\n $fOrdUnit_$c<= ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case b of wild { Unit ->\n case a of wild1 { Unit -> GHC.Types.True } }]\n-edcf3c82ebd330183deab3ae9a224a24\n+1f83cc22ce465613ede312c72f27d8f8\n $fOrdUnit_$c> ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case b of wild { Unit ->\n case a of wild1 { Unit -> GHC.Types.False } }]\n-85e324bfe55efaf27836c9398497ca13\n+a39d9740a3fca4855d09f79392dd3575\n $fOrdUnit_$ccompare ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case a of wild { Unit ->\n case b of wild1 { Unit -> GHC.Types.EQ } }]\n-96633ff035acfa87e092a6a9121361e5\n+96084145599f1ec3ef5fbdc14323aac8\n $fOrdUnit_$cmax ::\n forall k (f :: k -> *). Unit f -> Unit f -> Unit f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Unit f)\n (y['GHC.Types.Many] :: Unit f) ->\n case y of wild { Unit -> x }]\n-4fe2cb03cb0fcca89a6fc10c20b4cb87\n+a0372c975699809cbcfe33f561251c9b\n $fOrdVoid :: forall k (f :: k -> *). GHC.Classes.Ord (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Ord], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fEqVoid @k @f)\n ($fOrdVoid_$ccompare @k @f)\n ($fOrdVoid_$c>= @k @f)\n ($fOrdVoid_$c<= @k @f)\n ($fOrdVoid_$c<= @k @f)\n ($fOrdVoid_$c>= @k @f)\n ($fOrdVoid_$cmax @k @f)\n ($fOrdVoid_$cmax @k @f)]\n-a899a84071dfe62890469237dcc0a7ac\n+55b867ee2a03a9eb9725e9c9692e1383\n $fOrdVoid_$c<= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Types.Bool of {}]\n-df38bca683cdd02e8aee16f50f66fc89\n+709454ea8f800149a3f44a421b5ee53d\n $fOrdVoid_$c>= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case y ret_ty GHC.Types.Bool of {}]\n-a3f7f69361e593125ee5f0b3ed9397aa\n+ac5b35ee724acd22a5d3055a18a7af6a\n $fOrdVoid_$ccompare ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> GHC.Types.Ordering) of {}]\n-dd76dd1736a506d59a04f027d9c95f17\n+ad0729a676e7e91f480d64d248eb3e2e\n $fOrdVoid_$cmax ::\n forall k (f :: k -> *). Void f -> Void f -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty (Void f) of {}]\n-aa10bb1bf75387d04751186352d563fa\n+784078c39c349c0f9aa76de738ac30e5\n $fReadUnit :: forall k (f :: k -> *). GHC.Read.Read (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Read.C:Read],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fReadUnit_$creadsPrec @k @f)\n@@ -1413,15 +1413,15 @@\n ($fReadUnit1 @k @f)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n ($fReadUnit_$creadListPrec @k @f)]\n-67117ba5e75cf874a2e2142ada4dbec1\n+1c818c6f5e935c504035b6007eb23c41\n $fReadUnit1 ::\n forall {k} {f :: k -> *}.\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> Text.ParserCombinators.ReadP.P b\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -1441,15 +1441,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n eta\n @b\n eta1 of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @b ww }]\n-98569f0ac2e41c2c1ad153ceb1dce5d4\n+624035976708dc0fe7a1228a3608b6a2\n $fReadUnit2 ::\n forall {k} {f :: k -> *}.\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> Text.ParserCombinators.ReadP.P b\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -1459,55 +1459,55 @@\n @f :: k -> *\n (n['GHC.Types.Many] :: Text.ParserCombinators.ReadPrec.Prec)\n @b\n (eta['GHC.Types.Many] :: Unit f\n -> Text.ParserCombinators.ReadP.P b) ->\n case $w$creadPrec @k @f @b eta of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @b ww }]\n-2c2688a27ddc1af5d4e1402a75c6b226\n+caaacb3dbc5b64c2b215017976936780\n $fReadUnit3 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $tcUnit3]\n-0b69928e2bc644d4e046c14aba10ec4b\n+f9d0ef2e6c49d36dfd901a09f3686e25\n $fReadUnit4 ::\n forall {k} {f :: k -> *}. Text.ParserCombinators.ReadP.P [Unit f]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n (($fReadUnit_$creadListPrec @k @f)\n `cast`\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Unit f]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Unit f]>_R)\n @[Unit f]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure @[Unit f])]\n-fe664078033d477851e646440a661fe2\n+7b80e64bb19b27b879b1f730937572be\n $fReadUnit_$creadList ::\n forall k (f :: k -> *). Text.ParserCombinators.ReadP.ReadS [Unit f]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n Text.ParserCombinators.ReadP.run @[Unit f] ($fReadUnit4 @k @f)]\n-fd3854c5c098d4c5e29c9a61feef9f23\n+19dddbd606d2039f7e0ab5e2dbd956f3\n $fReadUnit_$creadListPrec ::\n forall k (f :: k -> *).\n Text.ParserCombinators.ReadPrec.ReadPrec [Unit f]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n GHC.Read.list\n @(Unit f)\n ($fReadUnit1 @k @f)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))]\n-51c6616920f37167a3ba0eee373b89d9\n+27e039605c4958a8c75962fa9105077c\n $fReadUnit_$creadsPrec ::\n forall k (f :: k -> *).\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Unit f)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * (eta['GHC.Types.Many] :: GHC.Types.Int) ->\n Text.ParserCombinators.ReadP.run\n@@ -1521,216 +1521,216 @@\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n eta\n @(Unit f)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Unit f)) of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @(Unit f) ww })]\n-3fc8d31621f7052633eb0319573a725a\n+764b02bc804a7b80fbc26933ce18dba5\n $fReadUnit_lexeme18 :: Text.Read.Lex.Lexeme\n [TagSig: , LambdaFormInfo: LFCon[Text.Read.Lex.Ident],\n Unfolding: Core: Text.Read.Lex.Ident $fReadUnit3]\n-0976aa22cae9f88b1d0186ba76e899ca\n+038ad944dc49b708931cbec7e332947b\n $fSemigroupUnit ::\n forall k (f :: k -> *). GHC.Base.Semigroup (Unit f)\n DFunId\n [LambdaFormInfo: LFCon[GHC.Base.C:Semigroup], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fMonoidUnit_$c<> @k @f)\n ($fSemigroupUnit_$csconcat @k @f)\n ($fSemigroupUnit_$cstimes @k @f)]\n-a13f05e62545c166d88364a288014a31\n+61d79f7e5eb8e6613dbdea1e3ad42e89\n $fSemigroupUnit1 ::\n forall {k} {f :: k -> *}. Unit f -> [Unit f] -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1L>, CPR: 1, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @f :: k -> *\n (b['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: [Unit f]) ->\n case b of wild { Unit ->\n case $wpoly_go1 @k @f ds1 of wild1 { (##) -> Unit @k @f } }]\n-7b52b7509cd98b1996298a776770e48d\n+cf004bcbde1ace8b54412219df95187d\n $fSemigroupUnit_$csconcat ::\n forall k (f :: k -> *). GHC.Base.NonEmpty (Unit f) -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(1!A,1L)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Unit f)) ->\n case ds of wild { GHC.Base.:| a1 as ->\n $fSemigroupUnit1 @k @f a1 as }]\n-3f3d928337ee11b235a6fcc171397b31\n+1ec76e0b2674629000479e4914ad74b7\n $fSemigroupUnit_$cstimes ::\n forall k (f :: k -> *) b.\n GHC.Real.Integral b =>\n b -> Unit f -> Unit f\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-fcf55461b410f7be0f5e5f9f01cc1439\n+cf1afece3f7a5b05f9c09717c98a0c3c\n $fSemigroupVoid ::\n forall k (f :: k -> *). GHC.Base.Semigroup (Void f)\n DFunId\n [LambdaFormInfo: LFCon[GHC.Base.C:Semigroup], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fSemigroupVoid_$c<> @k @f)\n ($fSemigroupVoid_$csconcat @k @f)\n ($fSemigroupVoid_$cstimes @k @f)]\n-dea2dcbb8a1298f42216e941d139e75d\n+e0fbd5d92a7506fc69d6d9f8774e13aa\n $fSemigroupVoid_$c<> ::\n forall k (f :: k -> *). Void f -> Void f -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> Void f) of {}]\n-17885224ee346008112612c40fac74f1\n+af0bd0cf277c369ed7cff4358d21ca8c\n $fSemigroupVoid_$csconcat ::\n forall k (f :: k -> *). GHC.Base.NonEmpty (Void f) -> Void f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(1L,1L)>, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Void f)) ->\n case ds of wild { GHC.Base.:| ww ww1 ->\n case ww1 of wild1 {\n [] -> ww : c cs -> case ww ret_ty (Void f) of {} } }]\n-ad600929dba3d7a3d0b5d980c13cc94b\n+d3c8e482db83ad93ed3534e5b798c492\n $fSemigroupVoid_$cstimes ::\n forall k (f :: k -> *) b.\n GHC.Real.Integral b =>\n b -> Void f -> Void f\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-cff67e162fb70fd07a4485e34266ea5c\n+967a7b3d5674289350578b29887534e3\n $fShowUnit :: forall k (f :: k -> *). GHC.Show.Show (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Show.C:Show],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fShowUnit_$cshowsPrec @k @f)\n ($fShowUnit_$cshow @k @f)\n ($fShowUnit_$cshowList @k @f)]\n-66b6a2fac41b912b8e109750d00cd80e\n+469c95b915497d9c6e98dab4e6b4c333\n $fShowUnit1 :: forall {k} {f :: k -> *}. Unit f -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Unit ->\n GHC.CString.unpackAppendCString# $tcUnit3 eta }]\n-7615d4af19cf50d68f48f878b8ebe908\n+f95f539f1e3deacd130e69fb7827ada9\n $fShowUnit_$cshow ::\n forall k (f :: k -> *). Unit f -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1!A>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit -> $fReadUnit3 }]\n-401752c02cdca1f19eb1525d964ab58f\n+84bee04dc164b6fd81df3deafd4a02df\n $fShowUnit_$cshowList ::\n forall k (f :: k -> *). [Unit f] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @f :: k -> *\n (ls['GHC.Types.Many] :: [Unit f])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Unit f) ($fShowUnit1 @k @f) ls s]\n-f791fa2b69bd9f1e55b978f314b68884\n+560d9ccdb71dd0ec70fff20d5f67f155\n $fShowUnit_$cshowsPrec ::\n forall k (f :: k -> *). GHC.Types.Int -> Unit f -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (ds1['GHC.Types.Many] :: Unit f)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds1 of wild { Unit ->\n GHC.CString.unpackAppendCString# $tcUnit3 eta }]\n-2f8c52be161717f07fe51bfeb24a9de5\n+76389038dabff11cad6d2d678257b9e5\n $fShowVoid :: forall k (f :: k -> *). GHC.Show.Show (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Show.C:Show], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fShowVoid_$cshowsPrec @k @f)\n ($fShowVoid_$cshow @k @f)\n ($fShowVoid_$cshowList @k @f)]\n-26707e5e06b65d06115fcafd264acd34\n+7dd4848c5c3df72b9b5ba379b0ab8ca7\n $fShowVoid1 :: forall {k} {f :: k -> *}. Void f -> GHC.Show.ShowS\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty GHC.Show.ShowS of {}]\n-13c2e089827ad50373d0b0d0a80aaa52\n+300de0ffa10f395caef3d7d6ecbdb7d8\n $fShowVoid_$cshow ::\n forall k (f :: k -> *). Void f -> GHC.Base.String\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (x['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Base.String of {}]\n-601d31194a04f5f4e74fbc16bd436a92\n+6eb93b77c7f541a5ddb1550f9c05f917\n $fShowVoid_$cshowList ::\n forall k (f :: k -> *). [Void f] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @f :: k -> *\n (ls['GHC.Types.Many] :: [Void f])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Void f) ($fShowVoid1 @k @f) ls s]\n-9d24591faead7ff4741c813518990bdc\n+8051085e02b0864e88b435d6de4c36ed\n $fShowVoid_$cshowsPrec ::\n forall k (f :: k -> *). GHC.Types.Int -> Void f -> GHC.Show.ShowS\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty GHC.Show.ShowS of {}]\n-518b7780fe9b20723b08ee5e7bd09f59\n+890df8aaae42427f01a927b6f73233c2\n $fTraversableBkUnit ::\n Barbies.Internal.TraversableB.TraversableB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.TraversableB.C:TraversableB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkUnit_$cbtraverse @k)]\n-bf9f476a5ab643dca138380558a5b926\n+a25518b4dafea274604ea71ec89b31a4\n $fTraversableBkUnit1 ::\n GHC.Generics.U1 GHC.Types.Any -> GHC.Generics.U1 GHC.Types.Any\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!A>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ (ds['GHC.Types.Many] :: GHC.Generics.U1 GHC.Types.Any) -> ds]\n-e2093140333b8caa5526fa7a8b07dbed\n+e4ac526cf73f8ba187a1f69f0991d7b9\n $fTraversableBkUnit2 ::\n GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1\n GHC.Types.Any\n@@ -1746,15 +1746,15 @@\n \\ (ds['GHC.Types.Many] :: GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1\n GHC.Types.Any) ->\n ds]\n-a44d7148a177a0b4e2a5bc613ad31f81\n+b6554409cb3a757d166c3b0aab742ae3\n $fTraversableBkUnit_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> Unit f -> e (Unit g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: [2],\n@@ -1762,150 +1762,150 @@\n \\ @k\n @e :: * -> *\n @f :: k -> *\n @g :: k -> *\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative e)\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a)) ->\n $w$cbtraverse @k @e @f @g $dApplicative]\n-f9f6cd8aaac6d8771b22cf8f6a8c3149\n+9f1321883b85dedc2e290657e87ba09d\n $fTraversableBkVoid ::\n Barbies.Internal.TraversableB.TraversableB Void\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.TraversableB.C:TraversableB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Void\n ($fConstraintsBkVoid_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkVoid_$cbtraverse @k)]\n-f5453925a21f745a6e45297a61fc97dc\n+c5379ecc50562fe81c14e74961298db0\n $fTraversableBkVoid1 :: e (GHC.Generics.V1 GHC.Types.Any)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-1ac952f93965abe7753d5403f6c8021c\n+2ac0263de78f09012ae14d679c503db3\n $fTraversableBkVoid2 ::\n GHC.Generics.V1 GHC.Types.Any -> GHC.Generics.V1 GHC.Types.Any\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, CPR: b,\n Unfolding: Core: \n \\ (ds['GHC.Types.Many] :: GHC.Generics.V1 GHC.Types.Any) -> ds]\n-a452309a549123a78f5ca04e2285f2f6\n+f23f3d1ad0dfb182e6a5d7656a528290\n $fTraversableBkVoid_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> Void f -> e (Void g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @e :: * -> *\n @f :: k -> *\n @g :: k -> *\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative e)\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a)) ->\n $w$cbtraverse1 @k @e @f @g $dApplicative]\n-7d87e1e6de936ad4f2b660002a5bb4a2\n+5a7b2997c5aeffc2a7db991a19eefc4d\n $tc'Unit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2037945628109684343#Word64\n- 3105404948668750788#Word64\n+ 11182171310931468719#Word64\n+ 15130054231645004319#Word64\n $trModule\n $tc'Unit2\n 2#\n $tc'Unit1]\n-6d9d58d423e3c8433afc20c36ca55660\n+ba7283be9cde66c007985346f61c5adc\n $tc'Unit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepTyConApp], Inline: [~]]\n-197954868841bb9a2a7e5ad4e2eb1690\n+37cb0a3e1453daa5245195e9fd914145\n $tc'Unit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Unit3]\n-e38c9b5774ffaddd577a9da1243b9c01\n+df550ca6607aacf3ced74baabd787150\n $tc'Unit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Unit\"#]\n-76d7bd2419a8b1ccd453a2c37d3afc1f\n+60667ee87fd6c04f0f4b6c638a1819ca\n $tcUnit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 376088529795041861#Word64\n- 17036368632291288187#Word64\n+ 4400758968235990726#Word64\n+ 10609866802840247821#Word64\n $trModule\n $tcUnit2\n 1#\n $tcUnit1]\n-ac7826a56b85bfa91610ca5c044cf7fd\n+b4e5599a2e0a6fc106f274eacea97db4\n $tcUnit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-6f6ab7b32c6f8df93c076e4f29b4d0d3\n+eadacb3e0f8420eae859a40757928bf5\n $tcUnit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcUnit3]\n-c4b818509730ae1df37cd1431bfac0d0\n+48213a220ddbce89449619d55bfc6f29\n $tcUnit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Unit\"#]\n-59b8bdbb38b837efb9b92da37ec57cfa\n+3fa553ec849965a49744bd53545ed41e\n $tcVoid :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11724475054022156485#Word64\n- 16512914446536540340#Word64\n+ 15534941731016754011#Word64\n+ 14556625491385436117#Word64\n $trModule\n $tcVoid1\n 1#\n $tcUnit1]\n-989bc38fe9b68b062cad2bc8ed2f7ff0\n+0f3e1656da072f781514b688f628382c\n $tcVoid1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcVoid2]\n-9ec764fb4bef8c2995c4cfb105a7b2d5\n+a127e11570f7fc56b7eb6d5a9df0081b\n $tcVoid2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Void\"#]\n-37fabeae6e71866f018d3ecf19babc99\n+8d2fc5374840026ed70dd271fdfe15ff\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-7f27288f386466f8030e41df04171ef4\n+15f6c340cb21b7720537e862b23b1654\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-343d429f740b11d7056fb2985f05f9f1\n+99ef5acab82fa44157a5c9867c67a2b4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Trivial\"#]\n-6b6b7c194bd03929444667004c2e6f1c\n+81c3d87de01b16e1922d6e7f880a1be9\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b5f045fe37aad4d42ddc0e88f3f20b3f\n+c3c9295c398cba836967ee71be3e8068\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-aaaf291a31a4c43cd484735f57856d5d\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+ff209b83bc05974c3653f16c5433a728\n $w$cbtraverse ::\n forall {k} {e :: * -> *} {f :: k -> *} {g :: k -> *}.\n GHC.Base.Applicative e =>\n Unit f -> e (Unit g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -1942,15 +1942,15 @@\n ((Sub (Rep_Unit[0] _N _N)\n ; (GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1961,15 +1961,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n e (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n GHC.Types.Any)\n@@ -2024,15 +2024,15 @@\n GHC.Generics.U1\n GHC.Types.Any)\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n GHC.Types.Any)\n@@ -2046,15 +2046,15 @@\n GHC.Types.Any>_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R\n ; GHC.Generics.N:M1[0]\n@@ -2127,15 +2127,15 @@\n `cast`\n (_R (((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -2146,15 +2146,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n (Sym (Data.Generics.GenericN.D:R:Indexed[1]\n <(k -> *) -> *>_N\n (Sym (Add0L (<1>_N)))\n _N)))_N) _N))_N)\n (Sym (Rep_Unit[0] _N _N)))_N) _N))]\n-594a34b6ea7684c5547203d4de59bd2b\n+39e9193816cd50f6eb1170c682e5a965\n $w$cbtraverse1 ::\n forall {k} {e :: * -> *} {f :: k -> *} {g :: k -> *}.\n GHC.Base.Applicative e =>\n Void f -> e (Void g)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -2208,23 +2208,23 @@\n ((Sub (Rep_Void[0] _N _N)\n ; (GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[5]))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ; (Data.Generics.GenericN.Zip\n (Sym (Rep_Void[0] _N _N)\n ; (GHC.Generics.Rep\n ((Sym (Data.Generics.GenericN.D:R:FilterIndex[2]\n@@ -2244,47 +2244,47 @@\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(GHC.Generics.V1 GHC.Types.Any)\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n GHC.Generics.V1\n GHC.Types.Any)\n $fTraversableBkVoid2\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R) _N)\n ($fTraversableBkVoid1 @e))\n `cast`\n (_R (((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[5])))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N)\n ; (Data.Generics.GenericN.Zip\n (Sym (Rep_Void[0] _N _N)\n ; (GHC.Generics.Rep\n ((Sym (Data.Generics.GenericN.D:R:FilterIndex[2]\n@@ -2296,15 +2296,15 @@\n <(k -> *) -> *>_N\n (Sym (Add0L (<1>_N)))\n _N)))_N) _N))_N)\n (Sym (Rep_Void[0] _N _N)))_N) _N))\n } in\n \\ (x['GHC.Types.Many] :: Void f) -> lvl38]\n-4397906b99a0d81b672d44a6ac00dfba\n+4a72a26330918095fe37bbb73b598d6c\n $w$cgmapMo ::\n forall {k} {f :: k -> *} {m :: * -> *}.\n GHC.Base.MonadPlus m =>\n Unit f -> m (Unit f)\n StrWork([!])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: [2],\n@@ -2325,15 +2325,15 @@\n @(Unit f)\n (case eta1 of wild1 { Unit ->\n ww3 @(Unit f, GHC.Types.Bool) ($fDataUnit1 @k @f) })\n (\\ (ds['GHC.Types.Many] :: (Unit f, GHC.Types.Bool)) ->\n case ds of wild1 { (,) x' b ->\n case b of wild2 {\n GHC.Types.False -> lvl38 GHC.Types.True -> ww3 @(Unit f) x' } }) }]\n-4f702ff3f5feb78077ab6f3cc05493b1\n+9bd002bd5f9fcd044a017127776ab108\n $w$creadPrec ::\n forall {k} {f :: k -> *} {b}.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> (# GHC.Base.String -> Text.ParserCombinators.ReadP.P b #)\n [TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -2359,61 +2359,61 @@\n [Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ (a1['GHC.Types.Many] :: ()) -> lvl126]\n = \\ (a1['GHC.Types.Many] :: ()) -> lvl126\n } in\n (# \\ (a['GHC.Types.Many] :: GHC.Base.String) ->\n Text.ParserCombinators.ReadP.skipSpaces2 a @b k1 #)]\n-341c8140df88263deb6fe462480d1fe5\n+55dda9b0db33a37b1c966d634a7b97fe\n $wpoly_go1 :: forall {k} {f :: k -> *}. [Unit f] -> (# #)\n StrWork([!])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [2]]\n-04cb6aeef862fc60b50ab22a047e79cd\n+cf2cde244d6fb68087d0702743b39d0a\n axiom R:AllBkcUnit ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c Unit\n = Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB Unit)\n-40557eaec235effdd4cdafeecd48d521\n+92e00d8bc9896d358e26b53a30d154b2\n axiom R:AllBkcVoid ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c Void\n = Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB Void)\n-75a080b3521fb6971602b562a49378f8\n+7788cf58864a164f991e62d338005b6a\n axiom Rep_Unit ::\n forall k (f :: k -> *).\n GHC.Generics.Rep (Unit f)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n-8dc333bb5f86f47c7a60275a47ea385f\n+25dae5a5a20ed34a86fce6f00a09ddba\n axiom Rep_Void ::\n forall k (f :: k -> *).\n GHC.Generics.Rep (Void f)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n GHC.Generics.V1\n-c80693ce02b344afc7a6b8ed5ccdb0fa\n+d4f1cf012aa14062f0601f6413e55372\n type role Unit phantom\n type Unit :: forall k. (k -> *) -> *\n data Unit f = Unit\n-93784768def362ba0bea698b816d92eb\n+e576c7f3bd180bf081dbb2756313ea69\n type role Void phantom\n type Void :: forall k. (k -> *) -> *\n data Void f\n instance Barbies.Internal.ApplicativeB.ApplicativeB [., Unit]\n = $fApplicativeBkUnit\n instance Barbies.Internal.ConstraintsB.ConstraintsB [., Unit]\n = $fConstraintsBkUnit\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.hi", "comments": ["Files 84% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,139 +1,139 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Internal.Wear 9066\n- interface hash: f260dccca1296e8864b47a8046879595\n- ABI hash: e7f22eb15cb784a998456b5140cf200d\n- export-list hash: 78c8bc7934601c506594bbc6e00d10b4\n+ interface hash: 57df868f18bc89365bb0cb39821ec54d\n+ ABI hash: 14f242eb3d2574da8af91a6231554daf\n+ export-list hash: 0844baf41368bc42b02e1f4080c4e399\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: fe5a696d57adc7936c3a70d12dfdb6f8\n+ flag hash: 7176c62bb7bec31fbc07b2bafcf5d73f\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 3d14163eb7acfe46c239d55131a80be5\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Bare\n Covered\n Wear\n WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n import -/ GHC.TypeError 79dfedc7ca947db73137bb493c3e707f\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-67f3d54b29a2687310c64890ce5b10d4\n+3b855753268c3a8306cc413dfc51a551\n $tcBare :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12345073740570411872#Word64\n- 741779550252200127#Word64\n+ 405425250779376933#Word64\n+ 4956015487972208583#Word64\n $trModule\n $tcBare1\n 0#\n GHC.Types.krep$*]\n-e04de1dc3a2b7ad84d362bc4b719faa6\n+22f0ee970b086bd5c65d6bacfa157919\n $tcBare1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBare2]\n-cf8195b3e9411b2c8346ad18ec151001\n+9edaa9d688671a970b3e5c85bb60182e\n $tcBare2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Bare\"#]\n-dabf56891c8664871dafbb6917c271aa\n+bca89cebac9322e398f97247f97de8f3\n $tcCovered :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3022141369616637646#Word64\n- 10375174585551583116#Word64\n+ 5468045204005402524#Word64\n+ 7421514990380126091#Word64\n $trModule\n $tcCovered1\n 0#\n GHC.Types.krep$*]\n-9e7a2dca47d7084438895c0e2c866770\n+f644d22f82609c671b31b2cab6c3a1a5\n $tcCovered1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcCovered2]\n-73dc93a647e3e6936664a3b99825c48b\n+9c5b14f20b0be5048cb7ac4c48380a15\n $tcCovered2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Covered\"#]\n-4322ce4b8568f4253e4a158c0ae990f6\n+bfdb3f569dee5beacd07f13442757fcf\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2a10c039b5e50588dd5e0278919ffa17\n+bf3f5f104f04987105afa4873ac21da1\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d4a09d97dea71c44da93a669ab133ef4\n+753355dd71efb780d0d06fef7dedf4a4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Wear\"#]\n-38708f0d06e475235c364c95c9c76dcf\n+d36c1e1f32d600cc37ec6222b01c8c24\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-d868079f0217d5dd1d25ca6afb7f825b\n+6fe7e741ec62bb5572f4ba8b0174c91d\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-2c0b113e3f5ede6fc221c55203ab8fd8\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+fa36594200f27a69b52f2f7a64b80fab\n type Bare :: *\n data Bare\n-80eea34d14e8600810c9ab377badacc1\n+eeaf328cbe4a57c6e3233af96bb554e7\n type Covered :: *\n data Covered\n-1a1a4a4c87e02f1ea861ad1e9b416487\n+7a692a95a35079399d24fd04e6ff0213\n axiom D:R:Wear ::\n Wear Bare f a = a\n Wear Covered f a = f a\n Wear (Data.Generics.GenericN.Param _1 t) f a = Wear t f a\n Wear t _1 _2 = (TypeError ...)\n-236ea46a0f2decdd8d0aeb99eb30ae38\n+6faabd0f19dcb6b56f70a3d39f1054a8\n axiom D:R:WearTwo ::\n WearTwo Bare f g a = a\n WearTwo Covered f g a = f (g a)\n WearTwo (Data.Generics.GenericN.Param _1 t) f g a = WearTwo t f g a\n WearTwo t _1 _2 _3 = (TypeError ...)\n-bc12aa8c9f74907821f2b32c6dbbc3ed\n+1612dc273c345679bd612935358ae645\n type Wear :: * -> (* -> *) -> * -> *\n type family Wear t f a where\n Wear Bare f a = a\n Wear Covered f a = f a\n Wear (Data.Generics.GenericN.Param _1 t) f a = Wear t f a\n Wear t _1 _2 = (TypeError ...)\n axiom D:R:Wear\n-d06bb9da09839e1cb4a0a098d403587b\n+d957b83cc662451223c70d0fed19a0ad\n type WearTwo :: * -> (* -> *) -> (* -> *) -> * -> *\n type family WearTwo t f g a where\n WearTwo Bare f g a = a\n WearTwo Covered f g a = f (g a)\n WearTwo (Data.Generics.GenericN.Param _1 t) f g a = WearTwo t f g a\n WearTwo t _1 _2 _3 = (TypeError ...)\n axiom D:R:WearTwo\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.dyn_hi", "comments": ["Files 81% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,139 +1,139 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Internal.Wear 9066\n- interface hash: f260dccca1296e8864b47a8046879595\n- ABI hash: e7f22eb15cb784a998456b5140cf200d\n- export-list hash: 78c8bc7934601c506594bbc6e00d10b4\n+ interface hash: 57df868f18bc89365bb0cb39821ec54d\n+ ABI hash: 14f242eb3d2574da8af91a6231554daf\n+ export-list hash: 0844baf41368bc42b02e1f4080c4e399\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 7176c62bb7bec31fbc07b2bafcf5d73f\n+ flag hash: fe5a696d57adc7936c3a70d12dfdb6f8\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 3d14163eb7acfe46c239d55131a80be5\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Bare\n Covered\n Wear\n WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n import -/ GHC.TypeError 79dfedc7ca947db73137bb493c3e707f\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-67f3d54b29a2687310c64890ce5b10d4\n+3b855753268c3a8306cc413dfc51a551\n $tcBare :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12345073740570411872#Word64\n- 741779550252200127#Word64\n+ 405425250779376933#Word64\n+ 4956015487972208583#Word64\n $trModule\n $tcBare1\n 0#\n GHC.Types.krep$*]\n-e04de1dc3a2b7ad84d362bc4b719faa6\n+22f0ee970b086bd5c65d6bacfa157919\n $tcBare1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBare2]\n-cf8195b3e9411b2c8346ad18ec151001\n+9edaa9d688671a970b3e5c85bb60182e\n $tcBare2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Bare\"#]\n-dabf56891c8664871dafbb6917c271aa\n+bca89cebac9322e398f97247f97de8f3\n $tcCovered :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3022141369616637646#Word64\n- 10375174585551583116#Word64\n+ 5468045204005402524#Word64\n+ 7421514990380126091#Word64\n $trModule\n $tcCovered1\n 0#\n GHC.Types.krep$*]\n-9e7a2dca47d7084438895c0e2c866770\n+f644d22f82609c671b31b2cab6c3a1a5\n $tcCovered1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcCovered2]\n-73dc93a647e3e6936664a3b99825c48b\n+9c5b14f20b0be5048cb7ac4c48380a15\n $tcCovered2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Covered\"#]\n-4322ce4b8568f4253e4a158c0ae990f6\n+bfdb3f569dee5beacd07f13442757fcf\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2a10c039b5e50588dd5e0278919ffa17\n+bf3f5f104f04987105afa4873ac21da1\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d4a09d97dea71c44da93a669ab133ef4\n+753355dd71efb780d0d06fef7dedf4a4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Wear\"#]\n-38708f0d06e475235c364c95c9c76dcf\n+d36c1e1f32d600cc37ec6222b01c8c24\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-d868079f0217d5dd1d25ca6afb7f825b\n+6fe7e741ec62bb5572f4ba8b0174c91d\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-2c0b113e3f5ede6fc221c55203ab8fd8\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+fa36594200f27a69b52f2f7a64b80fab\n type Bare :: *\n data Bare\n-80eea34d14e8600810c9ab377badacc1\n+eeaf328cbe4a57c6e3233af96bb554e7\n type Covered :: *\n data Covered\n-1a1a4a4c87e02f1ea861ad1e9b416487\n+7a692a95a35079399d24fd04e6ff0213\n axiom D:R:Wear ::\n Wear Bare f a = a\n Wear Covered f a = f a\n Wear (Data.Generics.GenericN.Param _1 t) f a = Wear t f a\n Wear t _1 _2 = (TypeError ...)\n-236ea46a0f2decdd8d0aeb99eb30ae38\n+6faabd0f19dcb6b56f70a3d39f1054a8\n axiom D:R:WearTwo ::\n WearTwo Bare f g a = a\n WearTwo Covered f g a = f (g a)\n WearTwo (Data.Generics.GenericN.Param _1 t) f g a = WearTwo t f g a\n WearTwo t _1 _2 _3 = (TypeError ...)\n-bc12aa8c9f74907821f2b32c6dbbc3ed\n+1612dc273c345679bd612935358ae645\n type Wear :: * -> (* -> *) -> * -> *\n type family Wear t f a where\n Wear Bare f a = a\n Wear Covered f a = f a\n Wear (Data.Generics.GenericN.Param _1 t) f a = Wear t f a\n Wear t _1 _2 = (TypeError ...)\n axiom D:R:Wear\n-d06bb9da09839e1cb4a0a098d403587b\n+d957b83cc662451223c70d0fed19a0ad\n type WearTwo :: * -> (* -> *) -> (* -> *) -> * -> *\n type family WearTwo t f g a where\n WearTwo Bare f g a = a\n WearTwo Covered f g a = f (g a)\n WearTwo (Data.Generics.GenericN.Param _1 t) f g a = WearTwo t f g a\n WearTwo t _1 _2 _3 = (TypeError ...)\n axiom D:R:WearTwo\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.dyn_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,77 +1,77 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies.Internal.Wrappers [family instance module] 9066\n- interface hash: e4be304bc6b3cc62dcc71119cf61f2db\n- ABI hash: 52d12130ceef8cc06259aaff6bffc97c\n- export-list hash: e9f95692d631be9bde87f12f2b5daec4\n+ interface hash: cb1b2d1933bc80c5ec0aa1cf1f13dc78\n+ ABI hash: 129f75c5c4289ab45c84ba1048dff5f0\n+ export-list hash: 7bbe89242a5db7bf6a1a319c99ea3bdc\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f14df32c6fa371fed5c3f32f772ba6fc\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: ca1c0caae6aafa314e50ef3ded92a5a5\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Barbie{Barbie getBarbie}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Barbies.Internal.ConstraintsB Data.Generics.GenericN\n Control.Applicative Control.Arrow Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup.Internal Data.Type.Ord\n Data.Version GHC.Generics GHC.IO.Exception GHC.RTS.Flags\n Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n- bzipWith3 ecb23b1e853065db90edbdd50d45dde9\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bdicts 910fbbe9a576863e35439a6fbd62de33\n- bmempty 53e6f64c7bc28a4b915067c36219b2d0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+ bzipWith3 c2cd418448529a1101125fdb0fb6eef0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bdicts 971aaafe6ea6c47c3cae87482166403e\n+ bmempty 5c59e57da5376bae689346ccc423cf4e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-204ac2098cb792c8b41351c142327a20\n+f62ea7950d7946c762201d93e6308a9e\n $fApplicativeBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Barbies.Internal.ApplicativeB.ApplicativeB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -106,15 +106,15 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N)]\n-6f940cd80804eb2c666df7482cc81664\n+f3399a7e3a4bb03d5a8c676a6a75e068\n $fConstraintsBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.ConstraintsB.ConstraintsB b =>\n Barbies.Internal.ConstraintsB.ConstraintsB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -136,15 +136,15 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkBarbie_$cbaddDicts @k @b v)]\n-d333f3303507c9236dd64deb7efac763\n+7dfc9ba585976dc71c3ae7761633b1cf\n $fConstraintsBkBarbie_$cbaddDicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ConstraintsB.AllB c (Barbie b)) =>\n Barbie b f\n -> Barbie\n@@ -177,15 +177,15 @@\n f1 x `cast` (N:Barbie[0] _N _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N)]\n-3c7c7a193ca7ee7267b9b27453ee23dd\n+baf3d38f5e980d72ac78ecd0a48005ab\n $fFunctorBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.FunctorB.FunctorB b =>\n Barbies.Internal.FunctorB.FunctorB (Barbie b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n@@ -199,15 +199,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))]\n-cc7ef12552fc29523be39734b2177432\n+4c74683a35143896d4caca5bdd71deac\n $fFunctorBkBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *} {g :: k -> *}.\n Barbies.Internal.FunctorB.FunctorB b =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>,\n Unfolding: Core: \n@@ -220,15 +220,15 @@\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n $dFunctorB\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n ds]\n-077c99447836e540aaac7d93ce6006e9\n+f9c70e8a85d608079857a395e043e3d0\n $fMonoidBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n GHC.Base.Monoid (Barbie b f)\n@@ -250,15 +250,15 @@\n @(Barbie b f)\n ($fSemigroupBarbie @k @b @f v v1 v2)\n ($fMonoidBarbie1 @k @b @f v v1 v2 v3)\n `cast`\n (Sym (N:Barbie[0] _N _R) _N)\n ($fMonoidBarbie_$c<> @k @b @f v v1 v2)\n ($fMonoidBarbie_$cmconcat @k @b @f v v1 v2 v3)]\n-a80b6aab9a56878c35530169c29bf400\n+29fbe427af2ed41dab0346cca3c931ee\n $fMonoidBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n b f\n@@ -274,15 +274,15 @@\n ($dApplicativeB['GHC.Types.Many] :: Barbies.Internal.ApplicativeB.ApplicativeB\n b)\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b)\n (irred1['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Monoid f b) ->\n $w$cmempty @k @b @f $dConstraintsB $dApplicativeB irred1]\n-4320beb86e7b31024a8f075f8e18e411\n+8abbea1cfc10faced95b9f429dfadc77\n $fMonoidBarbie2 ::\n forall {k} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Semigroup f))\n f)\n@@ -310,15 +310,15 @@\n @(f a)\n irred\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N _N _N _N _N)\n ga\n ha } } }]\n-59ba7427452f5be9a4bb97abb50b722e\n+ca4d46a0ceee1e2dde34541f48b2dc5e\n $fMonoidBarbie_$c<> ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n Barbie b f -> Barbie b f -> Barbie b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -401,15 +401,15 @@\n eta1\n eta2 `cast` (N:Barbie[0] _N _R _N))\n eta3 `cast` (N:Barbie[0] _N _R _N)))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N)]\n-10765746949f7aceec59643e81a45ca1\n+78f38bab2de2e32dd73668b7add8b805\n $fMonoidBarbie_$cmconcat ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n [Barbie b f] -> Barbie b f\n@@ -440,15 +440,15 @@\n $dConstraintsB\n $dApplicativeB\n irred\n irred1)\n `cast`\n (Sym (N:Barbie[0] _N _R) _N)\n eta]\n-21433b97c2f87dc9b06894f84a7750dd\n+0b19e945a0a65f87b9abfdbd6dab038a\n $fSemigroupBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n GHC.Base.Semigroup (Barbie b f)\n DFunId\n@@ -464,15 +464,15 @@\n b)\n (v2['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b).\n @(Barbie b f)\n ($fMonoidBarbie_$c<> @k @b @f v v1 v2)\n ($fSemigroupBarbie_$csconcat @k @b @f v v1 v2)\n ($fSemigroupBarbie_$cstimes @k @b @f v v1 v2)]\n-ca242d16c6138ad37ebd85d58e69dcfe\n+9ab68a1317f340daebc4d36d6fc1a5ac\n $fSemigroupBarbie_$csconcat ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n GHC.Base.NonEmpty (Barbie b f) -> Barbie b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -487,25 +487,25 @@\n ($dApplicativeB['GHC.Types.Many] :: Barbies.Internal.ApplicativeB.ApplicativeB\n b)\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b)\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Barbie b f)) ->\n case ds of wild { GHC.Base.:| ww ww1 ->\n $w$csconcat @k @b @f $dConstraintsB $dApplicativeB irred ww ww1 }]\n-840ed4739b6ed7befa6b647bd95810b4\n+e1d4584970838a6290690406c0d6fdcf\n $fSemigroupBarbie_$cstimes ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) b1.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n GHC.Real.Integral b1) =>\n b1 -> Barbie b f -> Barbie b f\n [TagSig: , LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ]\n-d0a4cd0f18fc42b310fff1c8434c2068\n+b5f955205f86496b0047c933a36a2bf1\n $fTraversableBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.TraversableB.TraversableB b =>\n Barbies.Internal.TraversableB.TraversableB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -528,26 +528,26 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkBarbie_$cbtraverse @k @b v)]\n-82108aa41bbdfc586f9cfb3d67854be0\n+deea81d66ad4de434250926965ec78d1\n $fTraversableBkBarbie1 ::\n forall {k} {g :: k -> *} {b :: (k -> *) -> *}. b g -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @g :: k -> *\n @b :: (k -> *) -> *\n (ds['GHC.Types.Many] :: b g) ->\n ds]\n-d69c678e3276e8548ff3a6a0255d575d\n+01c1aee413411340cf102cf8c340e3e7\n $fTraversableBkBarbie_$cbtraverse ::\n forall k (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e (g a)) -> Barbie b f -> e (Barbie b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -584,89 +584,89 @@\n @f\n @g\n $dApplicative\n eta\n } in\n \\ (x['GHC.Types.Many] :: Barbie b f) ->\n f1 (f2 x `cast` (N:Barbie[0] _N _R _N))]\n-76525e76f13a161d68ca3fd2f348df33\n+ca8bb4b28b8a31e522ec2308d476b507\n $tc'Barbie :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15615530109360289637#Word64\n- 15990056711384804469#Word64\n+ 13918703368884499321#Word64\n+ 8936931840849295103#Word64\n $trModule\n $tc'Barbie2\n 3#\n $tc'Barbie1]\n-40a7ada842c41ca6af65caa3f4f2b705\n+2f858be8e6da41cc4432b060dea106fe\n $tc'Barbie1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-40e551c5e0deb8418f20680a64b0877b\n+652ba274d0a16a89792543a9036ba401\n $tc'Barbie2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Barbie3]\n-0f94161774fd55d18630549bec85c297\n+171037b2c3ce7999c22eac8ad28f353a\n $tc'Barbie3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Barbie\"#]\n-fe446ca092fa482cc453eb015dfaa3ee\n+5b6e7f610e7cf5ef0a18138c0bc0b9eb\n $tcBarbie :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12284314168126100922#Word64\n- 11257103210016545368#Word64\n+ 3192024412159074143#Word64\n+ 1664728315722168277#Word64\n $trModule\n $tcBarbie2\n 1#\n $tcBarbie1]\n-40acd3263912b8eeb3a4c719906ac4c4\n+bd52e9839a488bd3574db5c44ef7acce\n $tcBarbie1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8d148eef945ecf2b631bb0efdc2ff852\n+df2152e2c1ef0914198e9e4b1cda0b19\n $tcBarbie2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBarbie3]\n-b552c8172474f0cc35eb4b7c025b45bc\n+88a8c74aa5e8aca8fb99b881c797601b\n $tcBarbie3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbie\"#]\n-167e06f36ec10fc1655a5b425b6bb193\n+d8dfcc456b14062acabb14720fae5deb\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-03e6abee023a50f09c5516ad05c83883\n+2850c919a9d24a35f022cf256e62812a\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-b41c24bf25211565bcb506c9d737073e\n+e7d45b3661c4d9a96db4044801c49d4b\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Wrappers\"#]\n-20d05693f624b96bbc9391ab9f941442\n+1bd9450106ebea90a9235433bbba71b1\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-f253185464294a90d185b954bf372084\n+6234285fb6be85a5fdc609a38328aba1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-5f74d08e234300d8c8898540159d33b3\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+e428a140fd68d39f65308135432ce538\n $w$cmempty ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n b f\n StrWork([!])\n@@ -715,15 +715,15 @@\n irred\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy @k))))]\n-73cf4dacb4c04e6fee8e05c2bc01c009\n+ef5babda816101764103bb9b3af81c43\n $w$csconcat ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n Barbie b f -> [Barbie b f] -> Barbie b f\n StrWork([~, ~, ~, ~, !])\n@@ -750,36 +750,36 @@\n go1 :: Barbie b f -> [Barbie b f] -> Barbie b f\n [Arity: 2, Strictness: <1L>]\n = \\ (b1['GHC.Types.Many] :: Barbie b f)\n (ds1['GHC.Types.Many] :: [Barbie b f]) ->\n case ds1 of wild1 { [] -> b1 : c cs -> lvl b1 (go1 c cs) }\n } in\n go1 ww ww1]\n-3a10e5ace6e79cdc719621acf28187af\n+01d0899d14173451a813c232a74e39b9\n type role Barbie representational nominal\n type Barbie :: forall k. ((k -> *) -> *) -> (k -> *) -> *\n newtype Barbie b f = Barbie {getBarbie :: b f}\n-2db15c99b0421e1551009484e1dbec12\n+06f865a84631ece84212848524773b40\n axiom D:R:AllBkcBarbie ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c (Barbie b)\n = Barbies.Internal.ConstraintsB.AllB c b\n-9f0dbf2ac67c199c8ea1fa4011a70f53\n+f4344a48cfdb2980e9b32c87ad521a99\n getBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *). Barbie b f -> b f\n RecSel Left Barbie\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getBarbie1\n `cast`\n (forall (k :: <*>_N) (b :: <(k -> *) -> *>_N) (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Barbie[0] _N _R _N)]\n-72ba47ecca026284280e31635e2af1f8\n+a55ad648b9b02edf4ac24b7534d8703c\n getBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n Barbie b f -> Barbie b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.hi", "comments": ["Files 95% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,77 +1,77 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies.Internal.Wrappers [family instance module] 9066\n- interface hash: e4be304bc6b3cc62dcc71119cf61f2db\n- ABI hash: 52d12130ceef8cc06259aaff6bffc97c\n- export-list hash: e9f95692d631be9bde87f12f2b5daec4\n+ interface hash: cb1b2d1933bc80c5ec0aa1cf1f13dc78\n+ ABI hash: 129f75c5c4289ab45c84ba1048dff5f0\n+ export-list hash: 7bbe89242a5db7bf6a1a319c99ea3bdc\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 5dedc605c735e5e9acdf5429c3f19d41\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: ca1c0caae6aafa314e50ef3ded92a5a5\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Barbie{Barbie getBarbie}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Barbies.Internal.ConstraintsB Data.Generics.GenericN\n Control.Applicative Control.Arrow Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup.Internal Data.Type.Ord\n Data.Version GHC.Generics GHC.IO.Exception GHC.RTS.Flags\n Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n- bzipWith3 ecb23b1e853065db90edbdd50d45dde9\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bdicts 910fbbe9a576863e35439a6fbd62de33\n- bmempty 53e6f64c7bc28a4b915067c36219b2d0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+ bzipWith3 c2cd418448529a1101125fdb0fb6eef0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bdicts 971aaafe6ea6c47c3cae87482166403e\n+ bmempty 5c59e57da5376bae689346ccc423cf4e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-204ac2098cb792c8b41351c142327a20\n+f62ea7950d7946c762201d93e6308a9e\n $fApplicativeBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Barbies.Internal.ApplicativeB.ApplicativeB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -106,15 +106,15 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N)]\n-6f940cd80804eb2c666df7482cc81664\n+f3399a7e3a4bb03d5a8c676a6a75e068\n $fConstraintsBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.ConstraintsB.ConstraintsB b =>\n Barbies.Internal.ConstraintsB.ConstraintsB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -136,15 +136,15 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkBarbie_$cbaddDicts @k @b v)]\n-d333f3303507c9236dd64deb7efac763\n+7dfc9ba585976dc71c3ae7761633b1cf\n $fConstraintsBkBarbie_$cbaddDicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ConstraintsB.AllB c (Barbie b)) =>\n Barbie b f\n -> Barbie\n@@ -177,15 +177,15 @@\n f1 x `cast` (N:Barbie[0] _N _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N)]\n-3c7c7a193ca7ee7267b9b27453ee23dd\n+baf3d38f5e980d72ac78ecd0a48005ab\n $fFunctorBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.FunctorB.FunctorB b =>\n Barbies.Internal.FunctorB.FunctorB (Barbie b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n@@ -199,15 +199,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))]\n-cc7ef12552fc29523be39734b2177432\n+4c74683a35143896d4caca5bdd71deac\n $fFunctorBkBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *} {g :: k -> *}.\n Barbies.Internal.FunctorB.FunctorB b =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>,\n Unfolding: Core: \n@@ -220,15 +220,15 @@\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n $dFunctorB\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n ds]\n-077c99447836e540aaac7d93ce6006e9\n+f9c70e8a85d608079857a395e043e3d0\n $fMonoidBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n GHC.Base.Monoid (Barbie b f)\n@@ -250,15 +250,15 @@\n @(Barbie b f)\n ($fSemigroupBarbie @k @b @f v v1 v2)\n ($fMonoidBarbie1 @k @b @f v v1 v2 v3)\n `cast`\n (Sym (N:Barbie[0] _N _R) _N)\n ($fMonoidBarbie_$c<> @k @b @f v v1 v2)\n ($fMonoidBarbie_$cmconcat @k @b @f v v1 v2 v3)]\n-a80b6aab9a56878c35530169c29bf400\n+29fbe427af2ed41dab0346cca3c931ee\n $fMonoidBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n b f\n@@ -274,15 +274,15 @@\n ($dApplicativeB['GHC.Types.Many] :: Barbies.Internal.ApplicativeB.ApplicativeB\n b)\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b)\n (irred1['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Monoid f b) ->\n $w$cmempty @k @b @f $dConstraintsB $dApplicativeB irred1]\n-4320beb86e7b31024a8f075f8e18e411\n+8abbea1cfc10faced95b9f429dfadc77\n $fMonoidBarbie2 ::\n forall {k} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Semigroup f))\n f)\n@@ -310,15 +310,15 @@\n @(f a)\n irred\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N _N _N _N _N)\n ga\n ha } } }]\n-59ba7427452f5be9a4bb97abb50b722e\n+ca4d46a0ceee1e2dde34541f48b2dc5e\n $fMonoidBarbie_$c<> ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n Barbie b f -> Barbie b f -> Barbie b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -401,15 +401,15 @@\n eta1\n eta2 `cast` (N:Barbie[0] _N _R _N))\n eta3 `cast` (N:Barbie[0] _N _R _N)))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N)]\n-10765746949f7aceec59643e81a45ca1\n+78f38bab2de2e32dd73668b7add8b805\n $fMonoidBarbie_$cmconcat ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n [Barbie b f] -> Barbie b f\n@@ -440,15 +440,15 @@\n $dConstraintsB\n $dApplicativeB\n irred\n irred1)\n `cast`\n (Sym (N:Barbie[0] _N _R) _N)\n eta]\n-21433b97c2f87dc9b06894f84a7750dd\n+0b19e945a0a65f87b9abfdbd6dab038a\n $fSemigroupBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n GHC.Base.Semigroup (Barbie b f)\n DFunId\n@@ -464,15 +464,15 @@\n b)\n (v2['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b).\n @(Barbie b f)\n ($fMonoidBarbie_$c<> @k @b @f v v1 v2)\n ($fSemigroupBarbie_$csconcat @k @b @f v v1 v2)\n ($fSemigroupBarbie_$cstimes @k @b @f v v1 v2)]\n-ca242d16c6138ad37ebd85d58e69dcfe\n+9ab68a1317f340daebc4d36d6fc1a5ac\n $fSemigroupBarbie_$csconcat ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n GHC.Base.NonEmpty (Barbie b f) -> Barbie b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -487,25 +487,25 @@\n ($dApplicativeB['GHC.Types.Many] :: Barbies.Internal.ApplicativeB.ApplicativeB\n b)\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b)\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Barbie b f)) ->\n case ds of wild { GHC.Base.:| ww ww1 ->\n $w$csconcat @k @b @f $dConstraintsB $dApplicativeB irred ww ww1 }]\n-840ed4739b6ed7befa6b647bd95810b4\n+e1d4584970838a6290690406c0d6fdcf\n $fSemigroupBarbie_$cstimes ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) b1.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n GHC.Real.Integral b1) =>\n b1 -> Barbie b f -> Barbie b f\n [TagSig: , LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ]\n-d0a4cd0f18fc42b310fff1c8434c2068\n+b5f955205f86496b0047c933a36a2bf1\n $fTraversableBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.TraversableB.TraversableB b =>\n Barbies.Internal.TraversableB.TraversableB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -528,26 +528,26 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkBarbie_$cbtraverse @k @b v)]\n-82108aa41bbdfc586f9cfb3d67854be0\n+deea81d66ad4de434250926965ec78d1\n $fTraversableBkBarbie1 ::\n forall {k} {g :: k -> *} {b :: (k -> *) -> *}. b g -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @g :: k -> *\n @b :: (k -> *) -> *\n (ds['GHC.Types.Many] :: b g) ->\n ds]\n-d69c678e3276e8548ff3a6a0255d575d\n+01c1aee413411340cf102cf8c340e3e7\n $fTraversableBkBarbie_$cbtraverse ::\n forall k (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e (g a)) -> Barbie b f -> e (Barbie b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -584,89 +584,89 @@\n @f\n @g\n $dApplicative\n eta\n } in\n \\ (x['GHC.Types.Many] :: Barbie b f) ->\n f1 (f2 x `cast` (N:Barbie[0] _N _R _N))]\n-76525e76f13a161d68ca3fd2f348df33\n+ca8bb4b28b8a31e522ec2308d476b507\n $tc'Barbie :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15615530109360289637#Word64\n- 15990056711384804469#Word64\n+ 13918703368884499321#Word64\n+ 8936931840849295103#Word64\n $trModule\n $tc'Barbie2\n 3#\n $tc'Barbie1]\n-40a7ada842c41ca6af65caa3f4f2b705\n+2f858be8e6da41cc4432b060dea106fe\n $tc'Barbie1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-40e551c5e0deb8418f20680a64b0877b\n+652ba274d0a16a89792543a9036ba401\n $tc'Barbie2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Barbie3]\n-0f94161774fd55d18630549bec85c297\n+171037b2c3ce7999c22eac8ad28f353a\n $tc'Barbie3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Barbie\"#]\n-fe446ca092fa482cc453eb015dfaa3ee\n+5b6e7f610e7cf5ef0a18138c0bc0b9eb\n $tcBarbie :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12284314168126100922#Word64\n- 11257103210016545368#Word64\n+ 3192024412159074143#Word64\n+ 1664728315722168277#Word64\n $trModule\n $tcBarbie2\n 1#\n $tcBarbie1]\n-40acd3263912b8eeb3a4c719906ac4c4\n+bd52e9839a488bd3574db5c44ef7acce\n $tcBarbie1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8d148eef945ecf2b631bb0efdc2ff852\n+df2152e2c1ef0914198e9e4b1cda0b19\n $tcBarbie2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBarbie3]\n-b552c8172474f0cc35eb4b7c025b45bc\n+88a8c74aa5e8aca8fb99b881c797601b\n $tcBarbie3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbie\"#]\n-167e06f36ec10fc1655a5b425b6bb193\n+d8dfcc456b14062acabb14720fae5deb\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-03e6abee023a50f09c5516ad05c83883\n+2850c919a9d24a35f022cf256e62812a\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-b41c24bf25211565bcb506c9d737073e\n+e7d45b3661c4d9a96db4044801c49d4b\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Wrappers\"#]\n-20d05693f624b96bbc9391ab9f941442\n+1bd9450106ebea90a9235433bbba71b1\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-f253185464294a90d185b954bf372084\n+6234285fb6be85a5fdc609a38328aba1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-5f74d08e234300d8c8898540159d33b3\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+e428a140fd68d39f65308135432ce538\n $w$cmempty ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n b f\n StrWork([!])\n@@ -715,15 +715,15 @@\n irred\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy @k))))]\n-73cf4dacb4c04e6fee8e05c2bc01c009\n+ef5babda816101764103bb9b3af81c43\n $w$csconcat ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n Barbie b f -> [Barbie b f] -> Barbie b f\n StrWork([~, ~, ~, ~, !])\n@@ -750,36 +750,36 @@\n go1 :: Barbie b f -> [Barbie b f] -> Barbie b f\n [Arity: 2, Strictness: <1L>]\n = \\ (b1['GHC.Types.Many] :: Barbie b f)\n (ds1['GHC.Types.Many] :: [Barbie b f]) ->\n case ds1 of wild1 { [] -> b1 : c cs -> lvl b1 (go1 c cs) }\n } in\n go1 ww ww1]\n-3a10e5ace6e79cdc719621acf28187af\n+01d0899d14173451a813c232a74e39b9\n type role Barbie representational nominal\n type Barbie :: forall k. ((k -> *) -> *) -> (k -> *) -> *\n newtype Barbie b f = Barbie {getBarbie :: b f}\n-2db15c99b0421e1551009484e1dbec12\n+06f865a84631ece84212848524773b40\n axiom D:R:AllBkcBarbie ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c (Barbie b)\n = Barbies.Internal.ConstraintsB.AllB c b\n-9f0dbf2ac67c199c8ea1fa4011a70f53\n+f4344a48cfdb2980e9b32c87ad521a99\n getBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *). Barbie b f -> b f\n RecSel Left Barbie\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getBarbie1\n `cast`\n (forall (k :: <*>_N) (b :: <(k -> *) -> *>_N) (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Barbie[0] _N _R _N)]\n-72ba47ecca026284280e31635e2af1f8\n+a55ad648b9b02edf4ac24b7534d8703c\n getBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n Barbie b f -> Barbie b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.hi", "comments": ["Files 96% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Internal.Writer 9066\n- interface hash: d0c7f9c3ff46f918ed5b1fa07ac860c2\n- ABI hash: 4b8cfed320a9759153c9f2e1178f5919\n- export-list hash: 59ffb401d09093d618de38060033b75c\n+ interface hash: 47ab53acb7a25dbd8cb780505351a69d\n+ ABI hash: 1ac8301754bf8fc4ae662af9201e1b17\n+ export-list hash: ce690a8d0554a90ffe27eb89b53500c9\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n+ flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 6f96bd3a8d68a76f1e5b1283015f6218\n sig of: Nothing\n used TH splices: False\n where\n@@ -30,15 +30,15 @@\n family instance modules: Control.Applicative Control.Arrow\n Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n import -/ Data.Tuple d9beb5d70c09aac855be2a098f256b86\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-bfc198c5b3351f241a79282502ecfe1e\n+96e27e80aaf6baa58bcbab94de43d4ca\n $fApplicativeSt :: GHC.Base.Applicative (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Applicative], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fFunctorSt @s)\n@@ -63,29 +63,29 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))\n ($fApplicativeSt1 @s)\n `cast`\n (forall (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-43263678de430610e66ed3ccd7f2e471\n+9ee5e5ee71910b18877c39402c8059f8\n $fApplicativeSt1 :: St s a -> St s b -> s -> (a, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @s\n @a\n @b\n (eta1['GHC.Types.Many] :: St s a)\n (eta['GHC.Types.Many] :: St s b)\n (eta2['GHC.Types.Many] :: s) ->\n case $w$c<* @s @a @b eta1 eta eta2 of wild { (#,#) ww ww1 ->\n (ww, ww1) }]\n-94a21167fdbdd5d3ff3ceb224255ddf2\n+d719881837d6a61b410e8e233b57f9cf\n $fApplicativeSt2 :: St s a -> St s b -> s -> (b, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @s\n @a\n@@ -102,15 +102,15 @@\n ds1 :: (b, s) []\n = eta1 `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' })]\n-cfd5b465e5c2f6cbf02705d486e468fd\n+ce4f5eba92af60c56cfd481e66494dbb\n $fApplicativeSt3 ::\n (a -> b -> c) -> St s a -> St s b -> s -> (c, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: ,\n CPR: 1, Inline: [2],\n Unfolding: Core: StableSystem <4,TrueFalse>\n@@ -128,15 +128,15 @@\n @b\n @c\n eta\n eta1\n eta2\n eta3 of wild { (#,#) ww ww1 ->\n (ww, ww1) }]\n-364010e0a3987dbfed7d8e9dc6f02fe1\n+68418144ef3f4076981f96d9c7bf046f\n $fApplicativeSt_$c<*> :: St s (a -> b) -> St s a -> St s b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -156,42 +156,42 @@\n f (case ds3 of wild1 { (,) x s'' -> x }) },\n case ds3 of wild { (,) x s'' -> s'' }))\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n b)>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-f865f441f5ee5f4ea5d5afb923a05306\n+bf3ebcd6e774da93bba501328dfbf836\n $fFunctorSt :: GHC.Base.Functor (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Functor], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fFunctorSt_$cfmap @s)\n ($fFunctorSt1 @s)\n `cast`\n (forall (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-a9d0645a17c3ea1db4c707cbd50dfdf8\n+957c090af0b458e36aa271f35bb88d63\n $fFunctorSt1 :: a -> St s b -> s -> (a, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1C(1,P(A,L))>, CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @s\n @a\n @b\n (eta['GHC.Types.Many] :: a)\n (eta1['GHC.Types.Many] :: St s b)\n (eta2['GHC.Types.Many] :: s) ->\n case eta1 `cast` (N:St[0] _R _R) eta2 of wild { (,) a1 s' ->\n (eta, s') }]\n-4e35ccb8d0ac90bcac8f8e2b12bff9ab\n+cf6f2fb69a064db263a5c79853dd9154\n $fFunctorSt_$cfmap :: (a -> b) -> St s a -> St s b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1C(1,L)>, CPR: 1,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -202,15 +202,15 @@\n case ds `cast` (N:St[0] _R _R) x of wild { (,) a1 s' ->\n (f a1, s') })\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n b>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-3fb3d6f56e0a8dc6ac56fb6ba34017b5\n+fffd591b31a760d65e852b82d79f1c29\n $fMonadSt :: GHC.Base.Monad (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Monad], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fApplicativeSt @s)\n@@ -222,29 +222,29 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))\n (\\ @a (x['GHC.Types.Many] :: a) (ds['GHC.Types.Many] :: s) ->\n (x, ds))\n `cast`\n (forall (a :: <*>_N).\n _R %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-295b8a7a75ac8cf6987bb83fc9207c0e\n+3fb18c521bb864e9aec645d2d996bf5c\n $fMonadSt1 :: St s a -> St s b -> s -> (b, s)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @s\n @a\n @b\n (m1['GHC.Types.Many] :: St s a)\n (k['GHC.Types.Many] :: St s b)\n (s1['GHC.Types.Many] :: s) ->\n k `cast` (N:St[0] _R _R)\n (case m1 `cast` (N:St[0] _R _R) s1 of wild { (,) a1 s' ->\n s' })]\n-0a02d2aa2f9436e33d665421fb42b7a9\n+d9f4200717edbb65ca2061fca6b1ed84\n $fMonadSt_$c>>= :: St s a -> (a -> St s b) -> St s b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -260,85 +260,85 @@\n (N:St[0] _R _R)\n (case ds1 of wild { (,) a1 s' -> s' }))\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R St s b>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-7c9fadbdcbdfdce883da7941de0dd0f6\n+ece98797e6555a3d21951562f7536afd\n $tc'St :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17137296724483593234#Word64\n- 15342594746634876286#Word64\n+ 14575921077927140588#Word64\n+ 17744582276066025322#Word64\n $trModule\n $tc'St2\n 2#\n $tc'St1]\n-e207f0ef5c97c21e5e4606f187334e61\n+047c4be4c28361b88550cfc79996ec6c\n $tc'St1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8fc97bf1148fb5c9039ce7f52743590b\n+35729dfd9f91fba46b1aeed047b8e188\n $tc'St2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'St3]\n-5ea88f191f90e222f4042b9317fff4d0\n+7ed9d3203af5c3c2b9fc67c9920d8b13\n $tc'St3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'St\"#]\n-3b50cba44370641f59ceb827d609c2e5\n+f0525f91074a0fe14cdba17cd16563a0\n $tcSt :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14342996833280856989#Word64\n- 6134876221187232#Word64\n+ 9351261565769487758#Word64\n+ 16041359534195592504#Word64\n $trModule\n $tcSt1\n 0#\n GHC.Types.krep$*->*->*]\n-f29d049536aae447075e4e194e62513e\n+638b12e6d7a0872f7821247499e91fa6\n $tcSt1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcSt2]\n-9dc4c0e1628bc5a6524e525c9cca0635\n+7cc60b56f12ddc00454a5ff2a4eaff2d\n $tcSt2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"St\"#]\n-364e12407a24cb3822d0365c5e66c561\n+4b78f74479c3070ba675e5b1c583b85d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-16949b3683859db03612f07f0cd1064b\n+8e98aa8ef87ec6ddb2f7001dacbb6449\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-1fc69734d4a27743af6b920b1eb8aa43\n+6755958bcfa15994f265e26c4227279c\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Writer\"#]\n-282cca0f8160a283577521b316004afc\n+cacd33dd13865c32917c3c665a68002b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-2257a0ee22e8f2855e1db854c20a2d78\n+e1d865b941eeefaba826eece520949f5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e37b1fdaea29c5da9cf0aadde4b6e94e\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+c948ae21f12abe9e8451aacde7ed4582\n $w$c<* :: St s a -> St s b -> s -> (# a, s #)\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @s\n @a\n@@ -356,15 +356,15 @@\n ds1 :: (b, s) []\n = eta `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (# case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' } #)]\n-794be2d89c233e9bdb149949477408ea\n+c75169780b583ab208b2333d97792e16\n $w$cliftA2 :: (a -> b -> c) -> St s a -> St s b -> s -> (# c, s #)\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Inline: [2],\n Unfolding: Core: \n \\ @s\n@@ -385,44 +385,44 @@\n ds1 :: (b, s) []\n = eta2 `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (# case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' } #)]\n-41d548db61998d7bb4ee6512e448f2a6\n+4ebc86834f72ff9851d68bf2c4e0c1f2\n type St :: * -> * -> *\n newtype St s a = St (s -> (a, s))\n-fd10f143ecbe29fac6799b659e0f09ed\n+65d6942013126dcf2189a9928657758a\n type Wr :: * -> * -> *\n type Wr = St :: * -> * -> *\n-c0469e5e8a962b81eaa1e5c9b2f08584\n+56d7951edbc29f9bb80efe13a3b090ce\n execWr :: GHC.Base.Monoid w => Wr w a -> w\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,P(A,1L))>,\n Unfolding: Core: \n \\ @w\n @a\n ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid w)\n (eta['GHC.Types.Many] :: Wr w a) ->\n case eta `cast` (N:St[0] _R _R)\n (GHC.Base.mempty @w $dMonoid) of wild { (,) ds1 y ->\n y }]\n-318bc913c1a4613db9a7000eccfc0ab8\n+44d33a86554f81bd08a29cb9f096fae7\n tell :: GHC.Base.Monoid w => w -> Wr w ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1(1,),\n Unfolding: Core: \n tell1\n `cast`\n (forall (w :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R <()>_R))]\n-8a5a13d3c137ab49c329558773bcfde3\n+f52b5e6ba5f84179bf6c1b1ee4543ad0\n tell1 :: GHC.Base.Monoid w => w -> w -> ((), w)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1(1,),\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @w\n ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid w)\n (w1['GHC.Types.Many] :: w)\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.dyn_hi", "comments": ["Files 94% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Internal.Writer 9066\n- interface hash: d0c7f9c3ff46f918ed5b1fa07ac860c2\n- ABI hash: 4b8cfed320a9759153c9f2e1178f5919\n- export-list hash: 59ffb401d09093d618de38060033b75c\n+ interface hash: 47ab53acb7a25dbd8cb780505351a69d\n+ ABI hash: 1ac8301754bf8fc4ae662af9201e1b17\n+ export-list hash: ce690a8d0554a90ffe27eb89b53500c9\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: f3ef90b23a8894f3c8a76d060589be75\n+ flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 6f96bd3a8d68a76f1e5b1283015f6218\n sig of: Nothing\n used TH splices: False\n where\n@@ -30,15 +30,15 @@\n family instance modules: Control.Applicative Control.Arrow\n Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n import -/ Data.Tuple d9beb5d70c09aac855be2a098f256b86\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-bfc198c5b3351f241a79282502ecfe1e\n+96e27e80aaf6baa58bcbab94de43d4ca\n $fApplicativeSt :: GHC.Base.Applicative (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Applicative], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fFunctorSt @s)\n@@ -63,29 +63,29 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))\n ($fApplicativeSt1 @s)\n `cast`\n (forall (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-43263678de430610e66ed3ccd7f2e471\n+9ee5e5ee71910b18877c39402c8059f8\n $fApplicativeSt1 :: St s a -> St s b -> s -> (a, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @s\n @a\n @b\n (eta1['GHC.Types.Many] :: St s a)\n (eta['GHC.Types.Many] :: St s b)\n (eta2['GHC.Types.Many] :: s) ->\n case $w$c<* @s @a @b eta1 eta eta2 of wild { (#,#) ww ww1 ->\n (ww, ww1) }]\n-94a21167fdbdd5d3ff3ceb224255ddf2\n+d719881837d6a61b410e8e233b57f9cf\n $fApplicativeSt2 :: St s a -> St s b -> s -> (b, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @s\n @a\n@@ -102,15 +102,15 @@\n ds1 :: (b, s) []\n = eta1 `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' })]\n-cfd5b465e5c2f6cbf02705d486e468fd\n+ce4f5eba92af60c56cfd481e66494dbb\n $fApplicativeSt3 ::\n (a -> b -> c) -> St s a -> St s b -> s -> (c, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: ,\n CPR: 1, Inline: [2],\n Unfolding: Core: StableSystem <4,TrueFalse>\n@@ -128,15 +128,15 @@\n @b\n @c\n eta\n eta1\n eta2\n eta3 of wild { (#,#) ww ww1 ->\n (ww, ww1) }]\n-364010e0a3987dbfed7d8e9dc6f02fe1\n+68418144ef3f4076981f96d9c7bf046f\n $fApplicativeSt_$c<*> :: St s (a -> b) -> St s a -> St s b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -156,42 +156,42 @@\n f (case ds3 of wild1 { (,) x s'' -> x }) },\n case ds3 of wild { (,) x s'' -> s'' }))\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n b)>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-f865f441f5ee5f4ea5d5afb923a05306\n+bf3ebcd6e774da93bba501328dfbf836\n $fFunctorSt :: GHC.Base.Functor (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Functor], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fFunctorSt_$cfmap @s)\n ($fFunctorSt1 @s)\n `cast`\n (forall (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-a9d0645a17c3ea1db4c707cbd50dfdf8\n+957c090af0b458e36aa271f35bb88d63\n $fFunctorSt1 :: a -> St s b -> s -> (a, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1C(1,P(A,L))>, CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @s\n @a\n @b\n (eta['GHC.Types.Many] :: a)\n (eta1['GHC.Types.Many] :: St s b)\n (eta2['GHC.Types.Many] :: s) ->\n case eta1 `cast` (N:St[0] _R _R) eta2 of wild { (,) a1 s' ->\n (eta, s') }]\n-4e35ccb8d0ac90bcac8f8e2b12bff9ab\n+cf6f2fb69a064db263a5c79853dd9154\n $fFunctorSt_$cfmap :: (a -> b) -> St s a -> St s b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1C(1,L)>, CPR: 1,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -202,15 +202,15 @@\n case ds `cast` (N:St[0] _R _R) x of wild { (,) a1 s' ->\n (f a1, s') })\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n b>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-3fb3d6f56e0a8dc6ac56fb6ba34017b5\n+fffd591b31a760d65e852b82d79f1c29\n $fMonadSt :: GHC.Base.Monad (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Monad], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fApplicativeSt @s)\n@@ -222,29 +222,29 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))\n (\\ @a (x['GHC.Types.Many] :: a) (ds['GHC.Types.Many] :: s) ->\n (x, ds))\n `cast`\n (forall (a :: <*>_N).\n _R %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-295b8a7a75ac8cf6987bb83fc9207c0e\n+3fb18c521bb864e9aec645d2d996bf5c\n $fMonadSt1 :: St s a -> St s b -> s -> (b, s)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @s\n @a\n @b\n (m1['GHC.Types.Many] :: St s a)\n (k['GHC.Types.Many] :: St s b)\n (s1['GHC.Types.Many] :: s) ->\n k `cast` (N:St[0] _R _R)\n (case m1 `cast` (N:St[0] _R _R) s1 of wild { (,) a1 s' ->\n s' })]\n-0a02d2aa2f9436e33d665421fb42b7a9\n+d9f4200717edbb65ca2061fca6b1ed84\n $fMonadSt_$c>>= :: St s a -> (a -> St s b) -> St s b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -260,85 +260,85 @@\n (N:St[0] _R _R)\n (case ds1 of wild { (,) a1 s' -> s' }))\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R St s b>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-7c9fadbdcbdfdce883da7941de0dd0f6\n+ece98797e6555a3d21951562f7536afd\n $tc'St :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17137296724483593234#Word64\n- 15342594746634876286#Word64\n+ 14575921077927140588#Word64\n+ 17744582276066025322#Word64\n $trModule\n $tc'St2\n 2#\n $tc'St1]\n-e207f0ef5c97c21e5e4606f187334e61\n+047c4be4c28361b88550cfc79996ec6c\n $tc'St1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8fc97bf1148fb5c9039ce7f52743590b\n+35729dfd9f91fba46b1aeed047b8e188\n $tc'St2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'St3]\n-5ea88f191f90e222f4042b9317fff4d0\n+7ed9d3203af5c3c2b9fc67c9920d8b13\n $tc'St3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'St\"#]\n-3b50cba44370641f59ceb827d609c2e5\n+f0525f91074a0fe14cdba17cd16563a0\n $tcSt :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14342996833280856989#Word64\n- 6134876221187232#Word64\n+ 9351261565769487758#Word64\n+ 16041359534195592504#Word64\n $trModule\n $tcSt1\n 0#\n GHC.Types.krep$*->*->*]\n-f29d049536aae447075e4e194e62513e\n+638b12e6d7a0872f7821247499e91fa6\n $tcSt1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcSt2]\n-9dc4c0e1628bc5a6524e525c9cca0635\n+7cc60b56f12ddc00454a5ff2a4eaff2d\n $tcSt2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"St\"#]\n-364e12407a24cb3822d0365c5e66c561\n+4b78f74479c3070ba675e5b1c583b85d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-16949b3683859db03612f07f0cd1064b\n+8e98aa8ef87ec6ddb2f7001dacbb6449\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-1fc69734d4a27743af6b920b1eb8aa43\n+6755958bcfa15994f265e26c4227279c\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Writer\"#]\n-282cca0f8160a283577521b316004afc\n+cacd33dd13865c32917c3c665a68002b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-2257a0ee22e8f2855e1db854c20a2d78\n+e1d865b941eeefaba826eece520949f5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e37b1fdaea29c5da9cf0aadde4b6e94e\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+c948ae21f12abe9e8451aacde7ed4582\n $w$c<* :: St s a -> St s b -> s -> (# a, s #)\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @s\n @a\n@@ -356,15 +356,15 @@\n ds1 :: (b, s) []\n = eta `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (# case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' } #)]\n-794be2d89c233e9bdb149949477408ea\n+c75169780b583ab208b2333d97792e16\n $w$cliftA2 :: (a -> b -> c) -> St s a -> St s b -> s -> (# c, s #)\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Inline: [2],\n Unfolding: Core: \n \\ @s\n@@ -385,44 +385,44 @@\n ds1 :: (b, s) []\n = eta2 `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (# case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' } #)]\n-41d548db61998d7bb4ee6512e448f2a6\n+4ebc86834f72ff9851d68bf2c4e0c1f2\n type St :: * -> * -> *\n newtype St s a = St (s -> (a, s))\n-fd10f143ecbe29fac6799b659e0f09ed\n+65d6942013126dcf2189a9928657758a\n type Wr :: * -> * -> *\n type Wr = St :: * -> * -> *\n-c0469e5e8a962b81eaa1e5c9b2f08584\n+56d7951edbc29f9bb80efe13a3b090ce\n execWr :: GHC.Base.Monoid w => Wr w a -> w\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,P(A,1L))>,\n Unfolding: Core: \n \\ @w\n @a\n ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid w)\n (eta['GHC.Types.Many] :: Wr w a) ->\n case eta `cast` (N:St[0] _R _R)\n (GHC.Base.mempty @w $dMonoid) of wild { (,) ds1 y ->\n y }]\n-318bc913c1a4613db9a7000eccfc0ab8\n+44d33a86554f81bd08a29cb9f096fae7\n tell :: GHC.Base.Monoid w => w -> Wr w ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1(1,),\n Unfolding: Core: \n tell1\n `cast`\n (forall (w :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R <()>_R))]\n-8a5a13d3c137ab49c329558773bcfde3\n+f52b5e6ba5f84179bf6c1b1ee4543ad0\n tell1 :: GHC.Base.Monoid w => w -> w -> ((), w)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1(1,),\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @w\n ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid w)\n (w1['GHC.Types.Many] :: w)\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.hi", "comments": ["Files 89% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Barbies.Internal 9066\n- interface hash: 703c799e2d670c753da038309f531fcb\n- ABI hash: 5751d2ed4bb12afcbaccdb7523b79aff\n- export-list hash: 9e47f454d226ca2cb299f7cc70e258d8\n+ interface hash: 2b0af4acccfb48d13cbf959111db457e\n+ ABI hash: 4b362224788ac66610a244af0b99d885\n+ export-list hash: a277e37d43ab62b788de06e35563d550\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n+ flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 36f2984720aa96d19b1a2558624fef80\n sig of: Nothing\n used TH splices: False\n where\n@@ -101,32 +101,32 @@\n GHC.Generics.UChar\n GHC.Generics.UDouble\n GHC.Generics.UFloat\n GHC.Generics.UInt\n GHC.Generics.URec{GHC.Generics.UAddr GHC.Generics.UChar GHC.Generics.UDouble GHC.Generics.UFloat GHC.Generics.UInt GHC.Generics.UWord uAddr# uChar# uDouble# uFloat# uInt# uWord#}\n GHC.Generics.UWord\n GHC.Generics.V1\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.BareB\n Barbies.Internal.ConstraintsB Barbies.Internal.ConstraintsT\n Barbies.Internal.DistributiveB Barbies.Internal.DistributiveT\n@@ -145,135 +145,135 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative cd6b2d8adddf9a2d3767a33a685f152d\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 3ced52b07609826cc929119e22540509\n- gprod c71396a7069c38d58d587ea97a10c328\n- gpure 2bc47c1626a359c82f3a6419b23cc52b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare eea274642dff5789bea4aa894d8bc07f\n- exports: 5efe914a4cb0ec7fc6958e082b874fad\n- GBare 1fa6fd25559727210b03f78d5a832c96\n- gcover 798bc1b3653e7aaf5fe2cd589c9308a9\n- gstrip 5a28e1c990a9ea713936b0047d74455a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints dbe4a74ad57c80c8783d07b1647baa9b\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll aa7b4f673c4e9bfa97e7a1c50731e7fd\n- GConstraints a7e9e23d9fc65479302c9d3c0ace9820\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- Y ba6a1ba68e95cb981888219d3edc670b\n- gaddDicts a8fe95c5e3b8e807206efdc59867b319\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive bc4b8750effdecf47b6444706f50b239\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 8920dca54430650db1672b0181edd98f\n- gdistribute 88c43b505c766c52951b46c9a80b6975\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor aa0cdfd634e110446d67378e55f3961e\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor 3a671a9ebc54c98292eef95647b8cf3a\n- gmap 48115c02e66040402cbe3728cb1f0e58\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable fcc5069525cb18eabc5ee2f6d115ed72\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 1180a3c086dfc51eda564a1727916603\n- gtraverse e8c1062ed3782afa31b62442c3d713bd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- CanDeriveApplicativeB b61bc228653760157a606b23571c88ec\n- gbprodDefault 868da1f2081306871a0916728f560b0d\n- gbpureDefault e06d1628c7c0519d4217f46e4f3a65e7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- exports: 8f06cd71a7d940a28cb85009a4957b36\n- CanDeriveApplicativeT cbbd0254664fc2922e682c379a992479\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 38a94147d4ffbde195fb7c8c1cfe9808\n- exports: f8d13d389494b14dd924f2036dae95e2\n- CanDeriveBareB 37dd3b0cc0aa8fa0a94782ca7f4983ac\n- gbcoverDefault dd0d1b6fd32449e8bbf20699395853f1\n- gbstripDefault 4c0143e67935f6cf725de148b8cf0a35\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- CanDeriveConstraintsB bcd864131a6ba6fa8f09696b46d36f0c\n- GAllRepB b55e3d91b41ad97ba9417bc021683df5\n- TagSelf0 a549a87741384e082d41639454945afe\n- TagSelf0' 7b11e28adaee2aeb7bc8f0ae7f9e8da4\n- gbaddDictsDefault 0c9773bc7b15401540d7ddae6ab5b120\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b0c8e8cd622378ebd4213ca89b09d70f\n- exports: 278101e56b3eacad637b39b7dc733468\n- CanDeriveConstraintsT 8b43af5386da34277bb41fc6764458cd\n- GAllRepT 2fd17a4da800c5787ace0662c4ab16f5\n- TagSelf1 60b6a26daeaa761940977f97dbbe94f6\n- TagSelf1' b23920de0c0254a7356b171d679daf1a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- exports: 61e86516bb9242bfd66af8550d57db65\n- CanDeriveDistributiveB 593c2a42749e8b7a16e811c153359693\n- gbdistributeDefault 746005dc102df7ce2ca7731122b0a5d6\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT 2d87ad7b0d939518df31ee312faa9bf2\n- exports: 6c54e7bb9d2909cbdea3cafe4057c036\n- CanDeriveDistributiveT 5c73b075ffb410ca35cd04643f221365\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- CanDeriveFunctorB 4798d3e0ba4288a9d833530febb4e730\n- gbmapDefault 524f6e8232f0fe0fcf9cae57afae1768\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- CanDeriveFunctorT e275e404b4b864adaccda0febb583db6\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- CanDeriveTraversableB ebf3189a9c5a5b2bc6da9bb97a8300f0\n- gbtraverseDefault f9b87fac408b20ec98d8b9e8d74e6a06\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- exports: 625e9e43bc9e9ad84f781f9b7f8b2abf\n- CanDeriveTraversableT e0233e0f8ad707ca61794944dd259f3f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- FilterIndex 28629d2d100254e316c2e2006644bb35\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- Zip 083bb61db3e8437841ed53dd9a1e12d6\n- fromN 1b8038624d1891d55a7bd44a4cadea42\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative c8c35967a74c18c83413193270a3b945\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative d65021a3af56c65b54997d660d8ab228\n+ gprod ffbaa052989faf6975b219d8a2f318e5\n+ gpure bda06dd713e6eb2b4a59075d90b838b2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare a5b23d7863b024acf164c15bb8693348\n+ exports: f2d1301649e8e0815e7e8a010693dc83\n+ GBare f7a5f5d4610bc604f4543e1673e035fc\n+ gcover e06a5bc294e23d292ae60b92cc292599\n+ gstrip bdf2060a01b3aa9c104d7708c47a1ab3\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 0aa87421cc66b72ee5cd089f3a525bd7\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll 4c84a1c336cdb79298bdd95cd66df075\n+ GConstraints 5c512afe7415c41c93750c1e4c738a80\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ Y d1ab14839ebc0a3f1df64062aa572cc4\n+ gaddDicts 651db21d9dcf3f4c243e7d171c34079a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive 6ea5c0f8a0da8726f912791430769bee\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive 99fd67a91a625d0976ec289825432d45\n+ gdistribute c0adfdc0ac5a3513a556e091d34d614a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor 99360120e66c20b7262f09cf2228859a\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor 01d6ca3e5c45094951939d25b948175d\n+ gmap c55bce9a54af1fd1331af0fac529105e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 7ee4a8d101ceda4ac9aab730f3d525a0\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable f7816c2f9a39d58706aba55efd6f45bc\n+ gtraverse 1f5e285cee2799d79ed8662ff47a29d0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ CanDeriveApplicativeB 8a4842373f69f720223ec1f5884a1cf2\n+ gbprodDefault 4f529bdce74bb3a6a14ebc180fac25cd\n+ gbpureDefault ec7b477217bbacec9a6c40c4ee547133\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ exports: 1b16a7ba7761bb551c6170cbaa7b2e96\n+ CanDeriveApplicativeT 94d1ae24736395101d409a6bef83c15e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB d3e28c114fb0832862f8cddb8501b23d\n+ exports: a7b9fd0c1d317c912311e4de9dfc94ac\n+ CanDeriveBareB fad55d4df895d2b99afb03984f854705\n+ gbcoverDefault c4138ef5c4d247dc310f037f26ac1fdb\n+ gbstripDefault 64f64a91fdeb2cec17f6fec983d6b90a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ CanDeriveConstraintsB 33754fdadbd4a4ef9739bb32b1847391\n+ GAllRepB 9dc63ee0afcec57e5fc2662b4e967df7\n+ TagSelf0 33c26af4c4a417ef94ae57db4326b7e5\n+ TagSelf0' bb4b36d5ac6ed04a6e8a365456d7e936\n+ gbaddDictsDefault 9e3ca882003a49269e0e557bb04bcd83\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT 71b29e9d7477d9e65446372adaee6a2c\n+ exports: b9186d4e1071f5bfe56a43df85fcb2fa\n+ CanDeriveConstraintsT be31e384e5dcda6bdc3e28e191447b37\n+ GAllRepT 1eadb8c0491d4b9fb505a6a4041fe27c\n+ TagSelf1 a0008ab8b71b3def4b4cd93bd6cf4ae4\n+ TagSelf1' 2585e2f92391036bf9cdb91e467ac073\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ exports: 1aecfa1521218373d8fc39d7c9313113\n+ CanDeriveDistributiveB 145bf29d1001acc3400ca5acbb5d21c4\n+ gbdistributeDefault 32a567d5d021c385e8dc7a7053b49f4b\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT d42051f3b0e0718fa7a27a87fb621d9a\n+ exports: b8594c61579bef94621e4926ef69c181\n+ CanDeriveDistributiveT 1b6ef668f2885d52365d6c6bbfa19391\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ CanDeriveFunctorB 01008d39a0245cc595e67e25b4212ab5\n+ gbmapDefault b3b583c9b60067b920d36db0ee65239b\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ CanDeriveFunctorT 6c54821e942bab4e5445265620155e64\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ CanDeriveTraversableB b333521b1a55b005674166bf2d867816\n+ gbtraverseDefault 166d6e71644f9e78dbe2d3fa2ee84fef\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ exports: 985f3d735f8d8149cf05c5257b3e92df\n+ CanDeriveTraversableT 618ece28277f83e20a17e00e3149c6c9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ FilterIndex d25400e43e9b658f703ceff2ac3de284\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ RepP f3334bccf616b949477368bb89a36f57\n+ Zip 05d9accc0b4938dc7787dbe3e50a5c37\n+ fromN cc2678f628cd15ffd0813e57882d7db1\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toN 46484572a2091aa1d37095fef03b9792\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-5ae6f8a567c62cbb0d22bf30c09f9e0e\n+162d076582e0af914e4898e12f44ce4f\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-c51048a59c72a955707293f7a6e779d9\n+328fb7d799a45f4fba6e37a0d7cba862\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-1ab51a97421b3ac646295f28364ab5d7\n+9f283c64f5170967c774a0a8a688aab8\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal\"#]\n-8e2bf4842895f315d89fe663ddc39d95\n+994e8ea07633d81e5b6a29cef4484047\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-a0a1ec936ae66f2ab7c65bd5f3ce7bb1\n+f4d2e70321a756617e576e2981c542d1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.dyn_hi", "comments": ["Files 89% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Barbies.Internal 9066\n- interface hash: 703c799e2d670c753da038309f531fcb\n- ABI hash: 5751d2ed4bb12afcbaccdb7523b79aff\n- export-list hash: 9e47f454d226ca2cb299f7cc70e258d8\n+ interface hash: 2b0af4acccfb48d13cbf959111db457e\n+ ABI hash: 4b362224788ac66610a244af0b99d885\n+ export-list hash: a277e37d43ab62b788de06e35563d550\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: f3ef90b23a8894f3c8a76d060589be75\n+ flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 36f2984720aa96d19b1a2558624fef80\n sig of: Nothing\n used TH splices: False\n where\n@@ -101,32 +101,32 @@\n GHC.Generics.UChar\n GHC.Generics.UDouble\n GHC.Generics.UFloat\n GHC.Generics.UInt\n GHC.Generics.URec{GHC.Generics.UAddr GHC.Generics.UChar GHC.Generics.UDouble GHC.Generics.UFloat GHC.Generics.UInt GHC.Generics.UWord uAddr# uChar# uDouble# uFloat# uInt# uWord#}\n GHC.Generics.UWord\n GHC.Generics.V1\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.BareB\n Barbies.Internal.ConstraintsB Barbies.Internal.ConstraintsT\n Barbies.Internal.DistributiveB Barbies.Internal.DistributiveT\n@@ -145,135 +145,135 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative cd6b2d8adddf9a2d3767a33a685f152d\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 3ced52b07609826cc929119e22540509\n- gprod c71396a7069c38d58d587ea97a10c328\n- gpure 2bc47c1626a359c82f3a6419b23cc52b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare eea274642dff5789bea4aa894d8bc07f\n- exports: 5efe914a4cb0ec7fc6958e082b874fad\n- GBare 1fa6fd25559727210b03f78d5a832c96\n- gcover 798bc1b3653e7aaf5fe2cd589c9308a9\n- gstrip 5a28e1c990a9ea713936b0047d74455a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints dbe4a74ad57c80c8783d07b1647baa9b\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll aa7b4f673c4e9bfa97e7a1c50731e7fd\n- GConstraints a7e9e23d9fc65479302c9d3c0ace9820\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- Y ba6a1ba68e95cb981888219d3edc670b\n- gaddDicts a8fe95c5e3b8e807206efdc59867b319\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive bc4b8750effdecf47b6444706f50b239\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 8920dca54430650db1672b0181edd98f\n- gdistribute 88c43b505c766c52951b46c9a80b6975\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor aa0cdfd634e110446d67378e55f3961e\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor 3a671a9ebc54c98292eef95647b8cf3a\n- gmap 48115c02e66040402cbe3728cb1f0e58\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable fcc5069525cb18eabc5ee2f6d115ed72\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 1180a3c086dfc51eda564a1727916603\n- gtraverse e8c1062ed3782afa31b62442c3d713bd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- CanDeriveApplicativeB b61bc228653760157a606b23571c88ec\n- gbprodDefault 868da1f2081306871a0916728f560b0d\n- gbpureDefault e06d1628c7c0519d4217f46e4f3a65e7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- exports: 8f06cd71a7d940a28cb85009a4957b36\n- CanDeriveApplicativeT cbbd0254664fc2922e682c379a992479\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 38a94147d4ffbde195fb7c8c1cfe9808\n- exports: f8d13d389494b14dd924f2036dae95e2\n- CanDeriveBareB 37dd3b0cc0aa8fa0a94782ca7f4983ac\n- gbcoverDefault dd0d1b6fd32449e8bbf20699395853f1\n- gbstripDefault 4c0143e67935f6cf725de148b8cf0a35\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- CanDeriveConstraintsB bcd864131a6ba6fa8f09696b46d36f0c\n- GAllRepB b55e3d91b41ad97ba9417bc021683df5\n- TagSelf0 a549a87741384e082d41639454945afe\n- TagSelf0' 7b11e28adaee2aeb7bc8f0ae7f9e8da4\n- gbaddDictsDefault 0c9773bc7b15401540d7ddae6ab5b120\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b0c8e8cd622378ebd4213ca89b09d70f\n- exports: 278101e56b3eacad637b39b7dc733468\n- CanDeriveConstraintsT 8b43af5386da34277bb41fc6764458cd\n- GAllRepT 2fd17a4da800c5787ace0662c4ab16f5\n- TagSelf1 60b6a26daeaa761940977f97dbbe94f6\n- TagSelf1' b23920de0c0254a7356b171d679daf1a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- exports: 61e86516bb9242bfd66af8550d57db65\n- CanDeriveDistributiveB 593c2a42749e8b7a16e811c153359693\n- gbdistributeDefault 746005dc102df7ce2ca7731122b0a5d6\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT 2d87ad7b0d939518df31ee312faa9bf2\n- exports: 6c54e7bb9d2909cbdea3cafe4057c036\n- CanDeriveDistributiveT 5c73b075ffb410ca35cd04643f221365\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- CanDeriveFunctorB 4798d3e0ba4288a9d833530febb4e730\n- gbmapDefault 524f6e8232f0fe0fcf9cae57afae1768\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- CanDeriveFunctorT e275e404b4b864adaccda0febb583db6\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- CanDeriveTraversableB ebf3189a9c5a5b2bc6da9bb97a8300f0\n- gbtraverseDefault f9b87fac408b20ec98d8b9e8d74e6a06\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- exports: 625e9e43bc9e9ad84f781f9b7f8b2abf\n- CanDeriveTraversableT e0233e0f8ad707ca61794944dd259f3f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- FilterIndex 28629d2d100254e316c2e2006644bb35\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- GenericP f4ef512392aa93755b39a60a61fcb61d\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- RepP 26ef9897c8286396527a83e34bbd6c4f\n- Zip 083bb61db3e8437841ed53dd9a1e12d6\n- fromN 1b8038624d1891d55a7bd44a4cadea42\n- fromP 2d52d4a5cb6ca06e9534901f4b66f989\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n- toP 9a4d40bd5ef0be396000c59d3d5d82d1\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative c8c35967a74c18c83413193270a3b945\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative d65021a3af56c65b54997d660d8ab228\n+ gprod ffbaa052989faf6975b219d8a2f318e5\n+ gpure bda06dd713e6eb2b4a59075d90b838b2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare a5b23d7863b024acf164c15bb8693348\n+ exports: f2d1301649e8e0815e7e8a010693dc83\n+ GBare f7a5f5d4610bc604f4543e1673e035fc\n+ gcover e06a5bc294e23d292ae60b92cc292599\n+ gstrip bdf2060a01b3aa9c104d7708c47a1ab3\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 0aa87421cc66b72ee5cd089f3a525bd7\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll 4c84a1c336cdb79298bdd95cd66df075\n+ GConstraints 5c512afe7415c41c93750c1e4c738a80\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ Y d1ab14839ebc0a3f1df64062aa572cc4\n+ gaddDicts 651db21d9dcf3f4c243e7d171c34079a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive 6ea5c0f8a0da8726f912791430769bee\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive 99fd67a91a625d0976ec289825432d45\n+ gdistribute c0adfdc0ac5a3513a556e091d34d614a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor 99360120e66c20b7262f09cf2228859a\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor 01d6ca3e5c45094951939d25b948175d\n+ gmap c55bce9a54af1fd1331af0fac529105e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 7ee4a8d101ceda4ac9aab730f3d525a0\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable f7816c2f9a39d58706aba55efd6f45bc\n+ gtraverse 1f5e285cee2799d79ed8662ff47a29d0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ CanDeriveApplicativeB 8a4842373f69f720223ec1f5884a1cf2\n+ gbprodDefault 4f529bdce74bb3a6a14ebc180fac25cd\n+ gbpureDefault ec7b477217bbacec9a6c40c4ee547133\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ exports: 1b16a7ba7761bb551c6170cbaa7b2e96\n+ CanDeriveApplicativeT 94d1ae24736395101d409a6bef83c15e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB d3e28c114fb0832862f8cddb8501b23d\n+ exports: a7b9fd0c1d317c912311e4de9dfc94ac\n+ CanDeriveBareB fad55d4df895d2b99afb03984f854705\n+ gbcoverDefault c4138ef5c4d247dc310f037f26ac1fdb\n+ gbstripDefault 64f64a91fdeb2cec17f6fec983d6b90a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ CanDeriveConstraintsB 33754fdadbd4a4ef9739bb32b1847391\n+ GAllRepB 9dc63ee0afcec57e5fc2662b4e967df7\n+ TagSelf0 33c26af4c4a417ef94ae57db4326b7e5\n+ TagSelf0' bb4b36d5ac6ed04a6e8a365456d7e936\n+ gbaddDictsDefault 9e3ca882003a49269e0e557bb04bcd83\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT 71b29e9d7477d9e65446372adaee6a2c\n+ exports: b9186d4e1071f5bfe56a43df85fcb2fa\n+ CanDeriveConstraintsT be31e384e5dcda6bdc3e28e191447b37\n+ GAllRepT 1eadb8c0491d4b9fb505a6a4041fe27c\n+ TagSelf1 a0008ab8b71b3def4b4cd93bd6cf4ae4\n+ TagSelf1' 2585e2f92391036bf9cdb91e467ac073\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ exports: 1aecfa1521218373d8fc39d7c9313113\n+ CanDeriveDistributiveB 145bf29d1001acc3400ca5acbb5d21c4\n+ gbdistributeDefault 32a567d5d021c385e8dc7a7053b49f4b\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT d42051f3b0e0718fa7a27a87fb621d9a\n+ exports: b8594c61579bef94621e4926ef69c181\n+ CanDeriveDistributiveT 1b6ef668f2885d52365d6c6bbfa19391\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ CanDeriveFunctorB 01008d39a0245cc595e67e25b4212ab5\n+ gbmapDefault b3b583c9b60067b920d36db0ee65239b\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ CanDeriveFunctorT 6c54821e942bab4e5445265620155e64\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ CanDeriveTraversableB b333521b1a55b005674166bf2d867816\n+ gbtraverseDefault 166d6e71644f9e78dbe2d3fa2ee84fef\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ exports: 985f3d735f8d8149cf05c5257b3e92df\n+ CanDeriveTraversableT 618ece28277f83e20a17e00e3149c6c9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ FilterIndex d25400e43e9b658f703ceff2ac3de284\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ GenericP 6d4114b38c04aef15401b9759854eb7a\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ RepP f3334bccf616b949477368bb89a36f57\n+ Zip 05d9accc0b4938dc7787dbe3e50a5c37\n+ fromN cc2678f628cd15ffd0813e57882d7db1\n+ fromP 8c9bd7f00b9ca12efbe4d0345a45d3bc\n+ toN 46484572a2091aa1d37095fef03b9792\n+ toP c0bbe1f28fe8924c1c2a37fb88c704a2\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-5ae6f8a567c62cbb0d22bf30c09f9e0e\n+162d076582e0af914e4898e12f44ce4f\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-c51048a59c72a955707293f7a6e779d9\n+328fb7d799a45f4fba6e37a0d7cba862\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-1ab51a97421b3ac646295f28364ab5d7\n+9f283c64f5170967c774a0a8a688aab8\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal\"#]\n-8e2bf4842895f315d89fe663ddc39d95\n+994e8ea07633d81e5b6a29cef4484047\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-a0a1ec936ae66f2ab7c65bd5f3ce7bb1\n+f4d2e70321a756617e576e2981c542d1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.dyn_hi", "comments": ["Files 84% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Barbies 9066\n- interface hash: e64d0638b9d07ba93b57a942a6e8b8bb\n- ABI hash: 1b943b9ef1a2929f6c12dd614ea65fb8\n- export-list hash: 4879b1a2cb4dd5023302ac5d5f5a2b80\n+ interface hash: e8f07f8608783e0a3e018a2acb7beb9d\n+ ABI hash: 22a19fc42eaf32265ca81dbc91609454\n+ export-list hash: 4d57dbc6f22051bb93aaba0e17211e96\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: b7958cd53bafcaeea8a242dfdd7454f1\n sig of: Nothing\n@@ -82,20 +82,20 @@\n Barbies.Internal.MonadT.MonadT{Barbies.Internal.MonadT.tembed Barbies.Internal.MonadT.tjoin Barbies.Internal.MonadT.tlift}\n Barbies.Internal.TraversableB.TraversableB{Barbies.Internal.TraversableB.btraverse}\n Barbies.Internal.TraversableT.TraversableT{Barbies.Internal.TraversableT.ttraverse}\n Barbies.Internal.Trivial.Unit{Barbies.Internal.Trivial.Unit}\n Barbies.Internal.Trivial.Void\n Barbies.Internal.Wrappers.Barbie{Barbies.Internal.Wrappers.Barbie getBarbie}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bi\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Containers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bi\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Containers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.ConstraintsB\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveB\n Barbies.Internal.DistributiveT Barbies.Internal.FunctorB\n@@ -115,156 +115,156 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bi 604a1d41e05e1d123fdb2fac9fd8f040\n- exports: 7b265b9f77349ea169ef59918f8772f0\n- Flip 1661b62dfb74633a5d54f8a373ae2e1c\n- Flip ac4c6c7cc7586535b553de95af5ceac2\n- btfoldMap b8ad8744ddec8383842944b6229622c9\n- btmap 7c5f772f891de5c87e7029a8ca6b3b41\n- btmap1 ed47bd6375a298ffd3ab33edd15f4be4\n- btprod 5aa88b6958bf3e76f1bd866011ff251f\n- btpure e3253a1aeeba2676a8889d482f70cc8f\n- btpure1 06847fa376923aec6d9204778d06623a\n- bttraverse 43d234654f9703de062a97a3d6d4e996\n- bttraverse1 5b2c77592c3e7b0c5bd715ee01271b28\n- bttraverse_ 5fb51a98bdff243e93b627f6c27ab70c\n- runFlip 9a142bd1b66599dedab53d1dfec77218\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n- bunzip 55485ecb89cfc48f959276abf53138b6\n- bzip a2112f05775fc9da652845f2152de290\n- bzipWith f55c10be3a14621f3eb32055001f484a\n- bzipWith3 ecb23b1e853065db90edbdd50d45dde9\n- bzipWith4 f8e9dbf366e83e550bc95b7050373b03\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- ApplicativeT a99ce0340646a38f9575b049182a8def\n- tprod 94d237cedb9b905a9c75a58fc4be2d84\n- tpure 3d2d76935d5f8427ccff8120f17ee9cb\n- tunzip 4755a536dffa72b34542174dea9563b9\n- tzip 8be4ece3ae39eae97e8ab2054291029f\n- tzipWith 42a8151822e89abb873919356fdc0652\n- tzipWith3 849c75023385973bb50888c87cceec50\n- tzipWith4 0425deaa0877b3ffee1c1fdf4d05f678\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bdicts 910fbbe9a576863e35439a6fbd62de33\n- bfoldMapC 8dc0380a9c23f3ae49fefd9813306c8e\n- bmapC db85df6b606901c50eb2cf9fa02fe513\n- bmempty 53e6f64c7bc28a4b915067c36219b2d0\n- bpureC 638f96823a12ae1193029411409e22a6\n- btraverseC 80acdd349185613ec3c8567595cc0fd3\n- bzipWith3C 8e34c659c77d116f60d8722f095357ca\n- bzipWith4C bf0725b1a4636d46c52c28c8c5295063\n- bzipWithC eda12aac3e3389d5a81c7e754849ef8d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b0c8e8cd622378ebd4213ca89b09d70f\n- AllT 92843017dacf42daf57c39082de48fa0\n- AllTF e0763c123e2b8997bb2edc82b327f155\n- ConstraintsT 87036f6d192a044ba64c57ad3852f00b\n- taddDicts ced41e140057be31cb58fcc38e1696fa\n- tmapC a0f909dabfcacacb160fc8fb2fd88ee7\n- ttraverseC 038c8c5c104e8c160fb65247f289334d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Containers 89b252e23e35e9000e541280249b249b\n- exports: 4f77bb01354be65f6ea4c93400d3233b\n- Container b62ef1a89f544c86fda37f9955aad56f\n- Container 96fdbd34013fa7b5e5f91f10c714c710\n- ErrorContainer b160c4e217512ebeb5f6beed79171e60\n- ErrorContainer 457c825d58d97b32f5e406f92b956382\n- getContainer d51016dd054e02ef6a76637885cbefad\n- getErrorContainer 7113d28f172cd850dd70c4d1d1a731c7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- DistributiveB e01ed0fa1927b910f29b673ced05da93\n- bcotraverse 6a6e1ed60e51c8555cf9a3d04180b293\n- bdecompose 4525724422846199c152367c0cfc580e\n- bdistribute 5b40d11ac15b14f1ed4a3c11011331d8\n- bdistribute' acd335bf472873b0ccbb4826f56e568f\n- brecompose a55756af0f4a37162824111628b88eee\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT 2d87ad7b0d939518df31ee312faa9bf2\n- DistributiveT 375f90ea1d05e60dc2c4545948c0f64a\n- tcotraverse 73d6c732cec8f656dc5ba8f5d3624a1e\n- tdecompose 5bac02433dfcce8672b96aacbc7690ac\n- tdistribute ac2e5b8fba24fb8dcfa0e8bfe938022d\n- tdistribute' e714a56db976e405999674ba0f38e4c2\n- trecompose 0c7137381fb9c3602e0f4e823599884a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT 28d0df4fa16d3ae0e9b8f569b12ba9f0\n- MonadT e84a8234960c5d20f03388d207c2d8b6\n- tembed dab8ffac3246d71d11a66a5b96bbc66e\n- tjoin feede2c197e26ea157fb57fcac6b3945\n- tlift e8eb157137ff53ba4e0d0ed6033eabbb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- bfoldMap ba0744e112b486ac5bb067fb062133f4\n- bsequence 57644dcc9c502afb44d0d9a91a1186c8\n- bsequence' 30b33daa89cf5b65bb7458cf798c9ced\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n- btraverse_ e32dfef4d81e493ba2e627342dd5a246\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- TraversableT 5f45683a672c1e8b493f3644d95842b8\n- tfoldMap dd03935b128f42360c829fd3e249b034\n- tsequence 699ffc06a9598fe004d904a9ee845bc0\n- tsequence' 65f065cd1161989b56f7e2cd49c0b0fe\n- ttraverse d3238a3d0af65058271e05836e392ec5\n- ttraverse_ 057185b130c23ac9c0cc56f1337f5eb9\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit a4df766290f2aea4bc82298ff16dbd46\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n- Void 93784768def362ba0bea698b816d92eb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 52d12130ceef8cc06259aaff6bffc97c\n- exports: e9f95692d631be9bde87f12f2b5daec4\n- Barbie ad846fa82a9ea3484523abb45135d49c\n- Barbie 3a10e5ace6e79cdc719621acf28187af\n- getBarbie 9f0dbf2ac67c199c8ea1fa4011a70f53\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 8580d8e7c5c9c44a5534809ebf1907d2\n- exports: b2c90f3ed7344f6cbd155b29f58a4f5d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer 12cc87af2ef508ba724114c0268390b0\n- exports: 4730a0f9a2e2a68edc332389a361be24\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bi ce67569e93ab0ed6a906de485fde3d62\n+ exports: a9bfde5a4613e09bfb2c8fc0be8120dd\n+ Flip 7d3a2cc6de618919a1f564c6ff421d21\n+ Flip aa52aebafb1851649448ec7ef0576284\n+ btfoldMap bb528919f6c1be2bbe4dfc1f79b5ae6b\n+ btmap d2e4c5d492d8a8c8f4974bd6b80741fb\n+ btmap1 f36185157de75d141baed3dca07a2972\n+ btprod cea835c7b6dad130fda7bcb1b9d89752\n+ btpure c44814a212b11541288ca506aa44044f\n+ btpure1 926205a326df3094372feff801aba305\n+ bttraverse b9effc0b9f1b64ed45716642950933bb\n+ bttraverse1 caaef1e2e72dbdf695c68857c7c2010e\n+ bttraverse_ 297cfeffe109a98640f34e5e1fc65e2f\n+ runFlip 5d903c11c1d782f47d5cbbdc8e1ed3c9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+ bunzip 08f36433607586faeeb884eb3863272f\n+ bzip d545e7ab39c9242dfddedef227364f2d\n+ bzipWith b39181fa2c8191904967f5c9a9668fe9\n+ bzipWith3 c2cd418448529a1101125fdb0fb6eef0\n+ bzipWith4 33f99fb454403138b2a6640eefc7441c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ ApplicativeT 074070de79264540541cf796d013c0ef\n+ tprod afb228a962be5d495a61627aaf4064db\n+ tpure 45b5a8f3e24017491bb877f3c054cbb9\n+ tunzip c89a7b71ff92b7ceb5cae4db45b4ab65\n+ tzip 8673df67a349ae2cf7af109d88da754f\n+ tzipWith d330f2b0b31b44684ce33684d371e964\n+ tzipWith3 057da6c305029e0e1fcd16a43064b63b\n+ tzipWith4 487b69261ee783048fa31f8edc0ffed1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bdicts 971aaafe6ea6c47c3cae87482166403e\n+ bfoldMapC 47cc19f97daa118ea2596279457634d7\n+ bmapC 2020c065122bd3f1f12315231be4e0c6\n+ bmempty 5c59e57da5376bae689346ccc423cf4e\n+ bpureC 4b660f3c478e3d9f3986c04122be78b2\n+ btraverseC 0b49e1066dbdac58719d2a9c9f587340\n+ bzipWith3C 029a8b2682192e4edc5954fcfd7902a3\n+ bzipWith4C 652470126b5c74d71cd56b7b8e429e6a\n+ bzipWithC 276eaa225cc56ee73ef03069b7e3d2ce\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT 71b29e9d7477d9e65446372adaee6a2c\n+ AllT 68f051666a31ae642df5d8c761d221de\n+ AllTF 7a7ba72bc88fa2ee4a4b9d2f145c22fc\n+ ConstraintsT 3824b7d50764f926d1ce8e2afa5d6994\n+ taddDicts 0364aca59a49ab9532dd24597d08d3aa\n+ tmapC cd42af4933908ccc6702697d0fe2156b\n+ ttraverseC 4583612791ed456316b18d5ff9373604\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Containers 9280f784d6cac5971bd3049fb4ea3a54\n+ exports: db2250c0d35046314edad47171b0584b\n+ Container edc01a0e4e72853a1cb4fd9502114916\n+ Container 534844d3507a10fcf955a68452d4b169\n+ ErrorContainer 1fb3b514b98801e1a269a51dfcb4a4b8\n+ ErrorContainer a147e86314e63aaf4535eb2ec803ac69\n+ getContainer 5c3675b8b7162dde09bdcb6103fa87f3\n+ getErrorContainer 86f3d8aaf316d1331cd669380b9a5a53\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ DistributiveB b7a598d798980f56a6401cbf7835693e\n+ bcotraverse 9bef958942dc22bc4050762689da3a2f\n+ bdecompose 80a6df96155abf2f285527f8f93928ce\n+ bdistribute 61b5bf0b84e4754f2266e05a24600562\n+ bdistribute' 0f625c23ac3a31c75ea3489b08c4b087\n+ brecompose 465ed5a39f84a9aa1b689f8ef17beb6c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT d42051f3b0e0718fa7a27a87fb621d9a\n+ DistributiveT bc1ead53dbcac53eb866a8dcc1c81565\n+ tcotraverse f03b4ebaf6b48c851a4327dd347db724\n+ tdecompose aab4f45b55235de00615e82b86ef7600\n+ tdistribute b68f74dc7b1ae0f6c5b72deaf1396df6\n+ tdistribute' 3e95649dc738a015868d28ba7461e91c\n+ trecompose 52a99d2a2d30e70f8a8fe8bdf5c43719\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT d8244999abaa79f27abd2c0dcc73de32\n+ MonadT d839d0f99cb980a431ecca3b76659b0d\n+ tembed 8a1dd26046a84bb4062d6eb3ddcc11fc\n+ tjoin fba3cd9f527829b5f0f245764a9381f3\n+ tlift 9ec6faf921b4017b48a7f51e08577ec5\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ bfoldMap ba02d28d2b8fc3ffd9509b200aa5e6f6\n+ bsequence 0be226e18f12ee247518b7894bf538e9\n+ bsequence' fcd7d4640f70ae8c757c15d22c814b1b\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+ btraverse_ d496d9ee3a909d4d1048e12257d6f3b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ TraversableT 85e954d72370c1d24f1ff0e67fec5163\n+ tfoldMap 0a332c01a2703820e7a4f3473c24da2e\n+ tsequence 94b2a8072a909ac100fc617a0145ec32\n+ tsequence' af70b4282c041fd2ff1e7bcd5772969b\n+ ttraverse 7d33e27d536aa9640cd0d31bd3eaff70\n+ ttraverse_ ea19842ff99c32a83b73d56b12f9540c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit ae7009495dd3ca0664463506cc352eb5\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+ Void e576c7f3bd180bf081dbb2756313ea69\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 129f75c5c4289ab45c84ba1048dff5f0\n+ exports: 7bbe89242a5db7bf6a1a319c99ea3bdc\n+ Barbie 4b28340ceb30302559d6087444c7ed2d\n+ Barbie 01d0899d14173451a813c232a74e39b9\n+ getBarbie f4344a48cfdb2980e9b32c87ad521a99\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie dad1ef832afa2c721a22049834cc9dd4\n+ exports: b3763818b9e315ec61a28b921995582d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer 14df9c3ebd1edd9c535cf1dfeaaf95c6\n+ exports: 3239be74cd8260541a54d1361d625cef\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-9ad0107e1b398d2784f83bac29f7a05f\n+e88d4e39ad3cf74b6f3bb7af38d0499b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-87a037a3e7924b83b358b5ee3789d134\n+54f0550ff7308a6f93b18155b7e6b828\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-e9a160ac159d00902bf3e13801a95d17\n+322af340a03fcca97265743d23ab8ac8\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies\"#]\n-889ea1e017fbe8bbcbf63c60c7b912f3\n+6c1da2fb9e21587294d213a64d2a5940\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9bcf48fc436bd76af855a7e690836a40\n+2dfe7f8ea716d1c1cea912322cd688a1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.hi", "comments": ["Files 83% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Barbies 9066\n- interface hash: e64d0638b9d07ba93b57a942a6e8b8bb\n- ABI hash: 1b943b9ef1a2929f6c12dd614ea65fb8\n- export-list hash: 4879b1a2cb4dd5023302ac5d5f5a2b80\n+ interface hash: e8f07f8608783e0a3e018a2acb7beb9d\n+ ABI hash: 22a19fc42eaf32265ca81dbc91609454\n+ export-list hash: 4d57dbc6f22051bb93aaba0e17211e96\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: b7958cd53bafcaeea8a242dfdd7454f1\n sig of: Nothing\n@@ -82,20 +82,20 @@\n Barbies.Internal.MonadT.MonadT{Barbies.Internal.MonadT.tembed Barbies.Internal.MonadT.tjoin Barbies.Internal.MonadT.tlift}\n Barbies.Internal.TraversableB.TraversableB{Barbies.Internal.TraversableB.btraverse}\n Barbies.Internal.TraversableT.TraversableT{Barbies.Internal.TraversableT.ttraverse}\n Barbies.Internal.Trivial.Unit{Barbies.Internal.Trivial.Unit}\n Barbies.Internal.Trivial.Void\n Barbies.Internal.Wrappers.Barbie{Barbies.Internal.Wrappers.Barbie getBarbie}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bi\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Containers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bi\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Containers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.ConstraintsB\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveB\n Barbies.Internal.DistributiveT Barbies.Internal.FunctorB\n@@ -115,156 +115,156 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bi 604a1d41e05e1d123fdb2fac9fd8f040\n- exports: 7b265b9f77349ea169ef59918f8772f0\n- Flip 1661b62dfb74633a5d54f8a373ae2e1c\n- Flip ac4c6c7cc7586535b553de95af5ceac2\n- btfoldMap b8ad8744ddec8383842944b6229622c9\n- btmap 7c5f772f891de5c87e7029a8ca6b3b41\n- btmap1 ed47bd6375a298ffd3ab33edd15f4be4\n- btprod 5aa88b6958bf3e76f1bd866011ff251f\n- btpure e3253a1aeeba2676a8889d482f70cc8f\n- btpure1 06847fa376923aec6d9204778d06623a\n- bttraverse 43d234654f9703de062a97a3d6d4e996\n- bttraverse1 5b2c77592c3e7b0c5bd715ee01271b28\n- bttraverse_ 5fb51a98bdff243e93b627f6c27ab70c\n- runFlip 9a142bd1b66599dedab53d1dfec77218\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n- bunzip 55485ecb89cfc48f959276abf53138b6\n- bzip a2112f05775fc9da652845f2152de290\n- bzipWith f55c10be3a14621f3eb32055001f484a\n- bzipWith3 ecb23b1e853065db90edbdd50d45dde9\n- bzipWith4 f8e9dbf366e83e550bc95b7050373b03\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- ApplicativeT a99ce0340646a38f9575b049182a8def\n- tprod 94d237cedb9b905a9c75a58fc4be2d84\n- tpure 3d2d76935d5f8427ccff8120f17ee9cb\n- tunzip 4755a536dffa72b34542174dea9563b9\n- tzip 8be4ece3ae39eae97e8ab2054291029f\n- tzipWith 42a8151822e89abb873919356fdc0652\n- tzipWith3 849c75023385973bb50888c87cceec50\n- tzipWith4 0425deaa0877b3ffee1c1fdf4d05f678\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bdicts 910fbbe9a576863e35439a6fbd62de33\n- bfoldMapC 8dc0380a9c23f3ae49fefd9813306c8e\n- bmapC db85df6b606901c50eb2cf9fa02fe513\n- bmempty 53e6f64c7bc28a4b915067c36219b2d0\n- bpureC 638f96823a12ae1193029411409e22a6\n- btraverseC 80acdd349185613ec3c8567595cc0fd3\n- bzipWith3C 8e34c659c77d116f60d8722f095357ca\n- bzipWith4C bf0725b1a4636d46c52c28c8c5295063\n- bzipWithC eda12aac3e3389d5a81c7e754849ef8d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b0c8e8cd622378ebd4213ca89b09d70f\n- AllT 92843017dacf42daf57c39082de48fa0\n- AllTF e0763c123e2b8997bb2edc82b327f155\n- ConstraintsT 87036f6d192a044ba64c57ad3852f00b\n- taddDicts ced41e140057be31cb58fcc38e1696fa\n- tmapC a0f909dabfcacacb160fc8fb2fd88ee7\n- ttraverseC 038c8c5c104e8c160fb65247f289334d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Containers 89b252e23e35e9000e541280249b249b\n- exports: 4f77bb01354be65f6ea4c93400d3233b\n- Container b62ef1a89f544c86fda37f9955aad56f\n- Container 96fdbd34013fa7b5e5f91f10c714c710\n- ErrorContainer b160c4e217512ebeb5f6beed79171e60\n- ErrorContainer 457c825d58d97b32f5e406f92b956382\n- getContainer d51016dd054e02ef6a76637885cbefad\n- getErrorContainer 7113d28f172cd850dd70c4d1d1a731c7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- DistributiveB e01ed0fa1927b910f29b673ced05da93\n- bcotraverse 6a6e1ed60e51c8555cf9a3d04180b293\n- bdecompose 4525724422846199c152367c0cfc580e\n- bdistribute 5b40d11ac15b14f1ed4a3c11011331d8\n- bdistribute' acd335bf472873b0ccbb4826f56e568f\n- brecompose a55756af0f4a37162824111628b88eee\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT 2d87ad7b0d939518df31ee312faa9bf2\n- DistributiveT 375f90ea1d05e60dc2c4545948c0f64a\n- tcotraverse 73d6c732cec8f656dc5ba8f5d3624a1e\n- tdecompose 5bac02433dfcce8672b96aacbc7690ac\n- tdistribute ac2e5b8fba24fb8dcfa0e8bfe938022d\n- tdistribute' e714a56db976e405999674ba0f38e4c2\n- trecompose 0c7137381fb9c3602e0f4e823599884a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT 28d0df4fa16d3ae0e9b8f569b12ba9f0\n- MonadT e84a8234960c5d20f03388d207c2d8b6\n- tembed dab8ffac3246d71d11a66a5b96bbc66e\n- tjoin feede2c197e26ea157fb57fcac6b3945\n- tlift e8eb157137ff53ba4e0d0ed6033eabbb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- bfoldMap ba0744e112b486ac5bb067fb062133f4\n- bsequence 57644dcc9c502afb44d0d9a91a1186c8\n- bsequence' 30b33daa89cf5b65bb7458cf798c9ced\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n- btraverse_ e32dfef4d81e493ba2e627342dd5a246\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- TraversableT 5f45683a672c1e8b493f3644d95842b8\n- tfoldMap dd03935b128f42360c829fd3e249b034\n- tsequence 699ffc06a9598fe004d904a9ee845bc0\n- tsequence' 65f065cd1161989b56f7e2cd49c0b0fe\n- ttraverse d3238a3d0af65058271e05836e392ec5\n- ttraverse_ 057185b130c23ac9c0cc56f1337f5eb9\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit a4df766290f2aea4bc82298ff16dbd46\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n- Void 93784768def362ba0bea698b816d92eb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 52d12130ceef8cc06259aaff6bffc97c\n- exports: e9f95692d631be9bde87f12f2b5daec4\n- Barbie ad846fa82a9ea3484523abb45135d49c\n- Barbie 3a10e5ace6e79cdc719621acf28187af\n- getBarbie 9f0dbf2ac67c199c8ea1fa4011a70f53\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 8580d8e7c5c9c44a5534809ebf1907d2\n- exports: b2c90f3ed7344f6cbd155b29f58a4f5d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer 12cc87af2ef508ba724114c0268390b0\n- exports: 4730a0f9a2e2a68edc332389a361be24\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bi ce67569e93ab0ed6a906de485fde3d62\n+ exports: a9bfde5a4613e09bfb2c8fc0be8120dd\n+ Flip 7d3a2cc6de618919a1f564c6ff421d21\n+ Flip aa52aebafb1851649448ec7ef0576284\n+ btfoldMap bb528919f6c1be2bbe4dfc1f79b5ae6b\n+ btmap d2e4c5d492d8a8c8f4974bd6b80741fb\n+ btmap1 f36185157de75d141baed3dca07a2972\n+ btprod cea835c7b6dad130fda7bcb1b9d89752\n+ btpure c44814a212b11541288ca506aa44044f\n+ btpure1 926205a326df3094372feff801aba305\n+ bttraverse b9effc0b9f1b64ed45716642950933bb\n+ bttraverse1 caaef1e2e72dbdf695c68857c7c2010e\n+ bttraverse_ 297cfeffe109a98640f34e5e1fc65e2f\n+ runFlip 5d903c11c1d782f47d5cbbdc8e1ed3c9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+ bunzip 08f36433607586faeeb884eb3863272f\n+ bzip d545e7ab39c9242dfddedef227364f2d\n+ bzipWith b39181fa2c8191904967f5c9a9668fe9\n+ bzipWith3 c2cd418448529a1101125fdb0fb6eef0\n+ bzipWith4 33f99fb454403138b2a6640eefc7441c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ ApplicativeT 074070de79264540541cf796d013c0ef\n+ tprod afb228a962be5d495a61627aaf4064db\n+ tpure 45b5a8f3e24017491bb877f3c054cbb9\n+ tunzip c89a7b71ff92b7ceb5cae4db45b4ab65\n+ tzip 8673df67a349ae2cf7af109d88da754f\n+ tzipWith d330f2b0b31b44684ce33684d371e964\n+ tzipWith3 057da6c305029e0e1fcd16a43064b63b\n+ tzipWith4 487b69261ee783048fa31f8edc0ffed1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bdicts 971aaafe6ea6c47c3cae87482166403e\n+ bfoldMapC 47cc19f97daa118ea2596279457634d7\n+ bmapC 2020c065122bd3f1f12315231be4e0c6\n+ bmempty 5c59e57da5376bae689346ccc423cf4e\n+ bpureC 4b660f3c478e3d9f3986c04122be78b2\n+ btraverseC 0b49e1066dbdac58719d2a9c9f587340\n+ bzipWith3C 029a8b2682192e4edc5954fcfd7902a3\n+ bzipWith4C 652470126b5c74d71cd56b7b8e429e6a\n+ bzipWithC 276eaa225cc56ee73ef03069b7e3d2ce\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT 71b29e9d7477d9e65446372adaee6a2c\n+ AllT 68f051666a31ae642df5d8c761d221de\n+ AllTF 7a7ba72bc88fa2ee4a4b9d2f145c22fc\n+ ConstraintsT 3824b7d50764f926d1ce8e2afa5d6994\n+ taddDicts 0364aca59a49ab9532dd24597d08d3aa\n+ tmapC cd42af4933908ccc6702697d0fe2156b\n+ ttraverseC 4583612791ed456316b18d5ff9373604\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Containers 9280f784d6cac5971bd3049fb4ea3a54\n+ exports: db2250c0d35046314edad47171b0584b\n+ Container edc01a0e4e72853a1cb4fd9502114916\n+ Container 534844d3507a10fcf955a68452d4b169\n+ ErrorContainer 1fb3b514b98801e1a269a51dfcb4a4b8\n+ ErrorContainer a147e86314e63aaf4535eb2ec803ac69\n+ getContainer 5c3675b8b7162dde09bdcb6103fa87f3\n+ getErrorContainer 86f3d8aaf316d1331cd669380b9a5a53\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ DistributiveB b7a598d798980f56a6401cbf7835693e\n+ bcotraverse 9bef958942dc22bc4050762689da3a2f\n+ bdecompose 80a6df96155abf2f285527f8f93928ce\n+ bdistribute 61b5bf0b84e4754f2266e05a24600562\n+ bdistribute' 0f625c23ac3a31c75ea3489b08c4b087\n+ brecompose 465ed5a39f84a9aa1b689f8ef17beb6c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT d42051f3b0e0718fa7a27a87fb621d9a\n+ DistributiveT bc1ead53dbcac53eb866a8dcc1c81565\n+ tcotraverse f03b4ebaf6b48c851a4327dd347db724\n+ tdecompose aab4f45b55235de00615e82b86ef7600\n+ tdistribute b68f74dc7b1ae0f6c5b72deaf1396df6\n+ tdistribute' 3e95649dc738a015868d28ba7461e91c\n+ trecompose 52a99d2a2d30e70f8a8fe8bdf5c43719\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT d8244999abaa79f27abd2c0dcc73de32\n+ MonadT d839d0f99cb980a431ecca3b76659b0d\n+ tembed 8a1dd26046a84bb4062d6eb3ddcc11fc\n+ tjoin fba3cd9f527829b5f0f245764a9381f3\n+ tlift 9ec6faf921b4017b48a7f51e08577ec5\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ bfoldMap ba02d28d2b8fc3ffd9509b200aa5e6f6\n+ bsequence 0be226e18f12ee247518b7894bf538e9\n+ bsequence' fcd7d4640f70ae8c757c15d22c814b1b\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+ btraverse_ d496d9ee3a909d4d1048e12257d6f3b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ TraversableT 85e954d72370c1d24f1ff0e67fec5163\n+ tfoldMap 0a332c01a2703820e7a4f3473c24da2e\n+ tsequence 94b2a8072a909ac100fc617a0145ec32\n+ tsequence' af70b4282c041fd2ff1e7bcd5772969b\n+ ttraverse 7d33e27d536aa9640cd0d31bd3eaff70\n+ ttraverse_ ea19842ff99c32a83b73d56b12f9540c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit ae7009495dd3ca0664463506cc352eb5\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+ Void e576c7f3bd180bf081dbb2756313ea69\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 129f75c5c4289ab45c84ba1048dff5f0\n+ exports: 7bbe89242a5db7bf6a1a319c99ea3bdc\n+ Barbie 4b28340ceb30302559d6087444c7ed2d\n+ Barbie 01d0899d14173451a813c232a74e39b9\n+ getBarbie f4344a48cfdb2980e9b32c87ad521a99\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie dad1ef832afa2c721a22049834cc9dd4\n+ exports: b3763818b9e315ec61a28b921995582d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer 14df9c3ebd1edd9c535cf1dfeaaf95c6\n+ exports: 3239be74cd8260541a54d1361d625cef\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-9ad0107e1b398d2784f83bac29f7a05f\n+e88d4e39ad3cf74b6f3bb7af38d0499b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-87a037a3e7924b83b358b5ee3789d134\n+54f0550ff7308a6f93b18155b7e6b828\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-e9a160ac159d00902bf3e13801a95d17\n+322af340a03fcca97265743d23ab8ac8\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies\"#]\n-889ea1e017fbe8bbcbf63c60c7b912f3\n+6c1da2fb9e21587294d213a64d2a5940\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9bcf48fc436bd76af855a7e690836a40\n+2dfe7f8ea716d1c1cea912322cd688a1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.hi", "comments": ["Files 76% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,81 +1,81 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Data.Barbie.Bare 9066\n- interface hash: 5be70a519e3280809564d2b6d3bcc63c\n- ABI hash: 1e56aaadc33bc65180ef41e712fc49db\n- export-list hash: 9eb0157daa661485533fb92236eee4d6\n+ interface hash: a901ff32ff029a21086bfb116d8fa7f6\n+ ABI hash: 81ec5d0e25070d167b41d85b64193520\n+ export-list hash: 29e4d4372e25b4d5a332deb3c897d6f6\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n+ flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: c19c41c22601f1058e68a60efe5ae63d\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Barbies.Internal.BareB.bcoverWith\n Barbies.Internal.BareB.bstripFrom\n Barbies.Internal.BareB.BareB{Barbies.Internal.BareB.bcover Barbies.Internal.BareB.bstrip}\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bare\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bare\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.BareB Barbies.Internal.FunctorB GHC.Base\n GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bare b1553b4d0f6339dbe5a558e849477bcd\n- exports: 3317a58afd59c101e4cfa353df6e1b14\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 38a94147d4ffbde195fb7c8c1cfe9808\n- BareB bcf15620d7682b808f4118663aa4e5cc\n- bcover 198ecd8709fc5a3bf8de7330e38a5522\n- bcoverWith 9708da690fb1f9a60bcfc18b74176b54\n- bstrip a458980907496fffc06b45bda97b3249\n- bstripFrom 753b1d3583db6faad7e7a3c7cfc8582a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bare 8cfda8bf9b04003a9068b08aeef806d0\n+ exports: 6cfb974e26ac71a46e68af091722ea15\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB d3e28c114fb0832862f8cddb8501b23d\n+ BareB 58d9792e504da07df01978f0d0a5f22f\n+ bcover 993c344d1317b0735c2d10c73f2e02a1\n+ bcoverWith 5c6dd91de74c772d93b84a17d8555354\n+ bstrip 1f66cbff218c6a12bd58100fc40354d3\n+ bstripFrom eb6b6f334cf2a31b9d24a4025731c738\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-c29af2e32593c60dcc85664c79cbd97c\n+4b75ec5d1322d0fa68009e1dda5411cc\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-fcc64bfbe03c64ebc1db89ac1b56982f\n+c04b07156a2f4fbc8c4ed26ac09ab7e7\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-5db6c92df0449d4ace59c0b4eb407c2e\n+f8af26d0a33467998da2e63afd7f3015\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Bare\"#]\n-1fca237f2e1901c5368dacd35972a6f7\n+ffb9eb81bbfda329e8d65ed140f893b0\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fccc36d8797d831941dd8b85108e7058\n+7b9584cb5099f0f9f3607d2e761a16ad\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n Warn all {-# DEPRECATED \"Use Barbies.Bare\" #-}\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.dyn_hi", "comments": ["Files 84% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,81 +1,81 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Data.Barbie.Bare 9066\n- interface hash: 5be70a519e3280809564d2b6d3bcc63c\n- ABI hash: 1e56aaadc33bc65180ef41e712fc49db\n- export-list hash: 9eb0157daa661485533fb92236eee4d6\n+ interface hash: a901ff32ff029a21086bfb116d8fa7f6\n+ ABI hash: 81ec5d0e25070d167b41d85b64193520\n+ export-list hash: 29e4d4372e25b4d5a332deb3c897d6f6\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: f3ef90b23a8894f3c8a76d060589be75\n+ flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: c19c41c22601f1058e68a60efe5ae63d\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Barbies.Internal.BareB.bcoverWith\n Barbies.Internal.BareB.bstripFrom\n Barbies.Internal.BareB.BareB{Barbies.Internal.BareB.bcover Barbies.Internal.BareB.bstrip}\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bare\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bare\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.BareB Barbies.Internal.FunctorB GHC.Base\n GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bare b1553b4d0f6339dbe5a558e849477bcd\n- exports: 3317a58afd59c101e4cfa353df6e1b14\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 38a94147d4ffbde195fb7c8c1cfe9808\n- BareB bcf15620d7682b808f4118663aa4e5cc\n- bcover 198ecd8709fc5a3bf8de7330e38a5522\n- bcoverWith 9708da690fb1f9a60bcfc18b74176b54\n- bstrip a458980907496fffc06b45bda97b3249\n- bstripFrom 753b1d3583db6faad7e7a3c7cfc8582a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bare 8cfda8bf9b04003a9068b08aeef806d0\n+ exports: 6cfb974e26ac71a46e68af091722ea15\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB d3e28c114fb0832862f8cddb8501b23d\n+ BareB 58d9792e504da07df01978f0d0a5f22f\n+ bcover 993c344d1317b0735c2d10c73f2e02a1\n+ bcoverWith 5c6dd91de74c772d93b84a17d8555354\n+ bstrip 1f66cbff218c6a12bd58100fc40354d3\n+ bstripFrom eb6b6f334cf2a31b9d24a4025731c738\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-c29af2e32593c60dcc85664c79cbd97c\n+4b75ec5d1322d0fa68009e1dda5411cc\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-fcc64bfbe03c64ebc1db89ac1b56982f\n+c04b07156a2f4fbc8c4ed26ac09ab7e7\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-5db6c92df0449d4ace59c0b4eb407c2e\n+f8af26d0a33467998da2e63afd7f3015\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Bare\"#]\n-1fca237f2e1901c5368dacd35972a6f7\n+ffb9eb81bbfda329e8d65ed140f893b0\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fccc36d8797d831941dd8b85108e7058\n+7b9584cb5099f0f9f3607d2e761a16ad\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n Warn all {-# DEPRECATED \"Use Barbies.Bare\" #-}\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Constraints.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Constraints.dyn_hi", "comments": ["Files 83% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Data.Barbie.Constraints 9066\n- interface hash: 37936002a6acc9ba240562da9f362d2a\n- ABI hash: b18f82d687f12bf361c8208342403668\n- export-list hash: e2c6472c74d4531fcb1aada2e7e41e61\n+ interface hash: 2a5202e0efce270db065bbd840912db9\n+ ABI hash: 40c1183b3a48a43101450755f0312a49\n+ export-list hash: d2ad0a0ed0d902311cd08db6881316f3\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: df7938ad8d7236368944d4b5ab61c9f5\n sig of: Nothing\n@@ -23,17 +23,17 @@\n Barbies.Internal.Dicts.requiringDict\n Barbies.Internal.ConstraintsB.AllBF\n Barbies.Internal.ConstraintsB.ConstraintsB{Barbies.Internal.ConstraintsB.AllB Barbies.Internal.ConstraintsB.baddDicts}\n Barbies.Internal.Dicts.ClassF\n Barbies.Internal.Dicts.ClassFG\n Barbies.Internal.Dicts.Dict{Barbies.Internal.Dicts.Dict}\n Data.Barbie.Internal.ProductC.ProductBC{Data.Barbie.Internal.ProductC.bdicts}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB\n Data.Barbie.Internal.Product GHC.Base GHC.Float Data.Orphans\n@@ -45,58 +45,58 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bmapC db85df6b606901c50eb2cf9fa02fe513\n- btraverseC 80acdd349185613ec3c8567595cc0fd3\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- ClassFG 49f1c53a16ecf58347d2954cac6dea25\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC a2b23089e22e79ae157fbefcef015b03\n- exports: 9a4775015330edff9bebe0b60887a8d6\n- ProductBC c58b99c699e1fa541f90705ce32c39b3\n- bdicts c7e7b39dedaca247a7b57b59da0e57c9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bmapC 2020c065122bd3f1f12315231be4e0c6\n+ btraverseC 0b49e1066dbdac58719d2a9c9f587340\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ ClassFG 956656054dd5ddd580072614ba216cb3\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC cf9d556ca8964b51c64bc4f30f34ff8c\n+ exports: c3f7320ee00fe37bf94725f93d942daa\n+ ProductBC f8e8eaeb84489eeb220b2cccc62df66f\n+ bdicts 8765110d2eecbc1589b400e4f4167ec2\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-d3acd1847db8923b2003eede70fd5241\n+06cfa4f84be27f28250f36b649ee6d80\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-18766170caba5309db4afa6c56945e56\n+aed6b0a99ac4ae95e4b77aa87501d2f3\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-786b2d950832b11f51f1b42eb64cd958\n+d0311da05fb56ad927328787aee818d1\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Constraints\"#]\n-3671b17e7983db6765a32a752a33e83a\n+88985979ce86f9b422f39db17691da62\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-822cfc45a501ea71e2429791e14196a5\n+228456d5d71c9e7d9785b4b9cca27ebb\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n Warn all {-# DEPRECATED \"Use Data.Functor.Barbie or Barbie.Constraints\" #-}\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Constraints.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Constraints.hi", "comments": ["Files 80% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Data.Barbie.Constraints 9066\n- interface hash: 37936002a6acc9ba240562da9f362d2a\n- ABI hash: b18f82d687f12bf361c8208342403668\n- export-list hash: e2c6472c74d4531fcb1aada2e7e41e61\n+ interface hash: 2a5202e0efce270db065bbd840912db9\n+ ABI hash: 40c1183b3a48a43101450755f0312a49\n+ export-list hash: d2ad0a0ed0d902311cd08db6881316f3\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: df7938ad8d7236368944d4b5ab61c9f5\n sig of: Nothing\n@@ -23,17 +23,17 @@\n Barbies.Internal.Dicts.requiringDict\n Barbies.Internal.ConstraintsB.AllBF\n Barbies.Internal.ConstraintsB.ConstraintsB{Barbies.Internal.ConstraintsB.AllB Barbies.Internal.ConstraintsB.baddDicts}\n Barbies.Internal.Dicts.ClassF\n Barbies.Internal.Dicts.ClassFG\n Barbies.Internal.Dicts.Dict{Barbies.Internal.Dicts.Dict}\n Data.Barbie.Internal.ProductC.ProductBC{Data.Barbie.Internal.ProductC.bdicts}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB\n Data.Barbie.Internal.Product GHC.Base GHC.Float Data.Orphans\n@@ -45,58 +45,58 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bmapC db85df6b606901c50eb2cf9fa02fe513\n- btraverseC 80acdd349185613ec3c8567595cc0fd3\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- ClassFG 49f1c53a16ecf58347d2954cac6dea25\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC a2b23089e22e79ae157fbefcef015b03\n- exports: 9a4775015330edff9bebe0b60887a8d6\n- ProductBC c58b99c699e1fa541f90705ce32c39b3\n- bdicts c7e7b39dedaca247a7b57b59da0e57c9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bmapC 2020c065122bd3f1f12315231be4e0c6\n+ btraverseC 0b49e1066dbdac58719d2a9c9f587340\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ ClassFG 956656054dd5ddd580072614ba216cb3\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC cf9d556ca8964b51c64bc4f30f34ff8c\n+ exports: c3f7320ee00fe37bf94725f93d942daa\n+ ProductBC f8e8eaeb84489eeb220b2cccc62df66f\n+ bdicts 8765110d2eecbc1589b400e4f4167ec2\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-d3acd1847db8923b2003eede70fd5241\n+06cfa4f84be27f28250f36b649ee6d80\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-18766170caba5309db4afa6c56945e56\n+aed6b0a99ac4ae95e4b77aa87501d2f3\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-786b2d950832b11f51f1b42eb64cd958\n+d0311da05fb56ad927328787aee818d1\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Constraints\"#]\n-3671b17e7983db6765a32a752a33e83a\n+88985979ce86f9b422f39db17691da62\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-822cfc45a501ea71e2429791e14196a5\n+228456d5d71c9e7d9785b4b9cca27ebb\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n Warn all {-# DEPRECATED \"Use Data.Functor.Barbie or Barbie.Constraints\" #-}\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,37 +1,37 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Data.Barbie.Internal.Product [orphan module] 9066\n- interface hash: 059f56e333fba4590d69f7b2111afcb7\n- ABI hash: ea5df7eb3236564b9b2df74ac1890984\n- export-list hash: d02fbc0d5447bb390c9724a84345915e\n- orphan hash: 3ede67c0957e06dcb1452446efdc669d\n+ interface hash: bb2dc3dfe6c3335390f1619fb3f7ea9c\n+ ABI hash: c93ae87029f9fac303e0a83c615266bf\n+ export-list hash: 21a109e654e4e470b1fcc905ea27f050\n+ orphan hash: 6c65f40fae477e59d207332d92ca6bb4\n flag hash: ed708539882f1f5a39d21c9555c09e01\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 25d3c0149114a684ec83fbdc768fa22c\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gbprodDefault\n gbuniqDefault\n CanDeriveProductB\n GProductB{gbprod gbuniq}\n ProductB{bprod buniq}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -42,58 +42,58 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 52d12130ceef8cc06259aaff6bffc97c\n- exports: e9f95692d631be9bde87f12f2b5daec4\n- Barbie ad846fa82a9ea3484523abb45135d49c\n- Barbie 3a10e5ace6e79cdc719621acf28187af\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- fromN 1b8038624d1891d55a7bd44a4cadea42\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 129f75c5c4289ab45c84ba1048dff5f0\n+ exports: 7bbe89242a5db7bf6a1a319c99ea3bdc\n+ Barbie 4b28340ceb30302559d6087444c7ed2d\n+ Barbie 01d0899d14173451a813c232a74e39b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ fromN cc2678f628cd15ffd0813e57882d7db1\n+ toN 46484572a2091aa1d37095fef03b9792\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-d810e5c5f56c60345ba099425320b6f1\n+dc832686db50ce8b37b6a015c38fe0ff\n $dmbprod ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (ProductB b, CanDeriveProductB b f g) =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n \\ @k\n @b :: (k -> *) -> *\n ($dProductB['GHC.Types.Many] :: ProductB b)\n @f :: k -> *\n @g :: k -> *\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveProductB b f g) ->\n gbprodDefault @k @b @f @g $d(%,,,%)]\n-8e174ec8de08f105e5bedc98cb0e7bf0\n+4aa43a5a03cc6e34124a02b6eb36f137\n $dmbuniq ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (ProductB b, CanDeriveProductB b f f) =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -264,15 +264,15 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N)]\n-299efbf9cc6660adaca9685012289a19\n+ea3f0ad805d4c33461e7cf7d3e23283c\n $fApplicativeBkb ::\n forall k (b :: (k -> *) -> *).\n (ProductB b, Barbies.Internal.FunctorB.FunctorB b) =>\n Barbies.Internal.ApplicativeB.ApplicativeB b\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n@@ -282,15 +282,15 @@\n (v1['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @k\n @b\n v1\n (\\ @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n buniq @k @b v @f ds)\n (\\ @f :: k -> * @g :: k -> * -> bprod @k @b v @f @g)]\n-983b0a33a6c07d13a14c9c63671ec0e7\n+b7611bdd4e9ba0be6abc730f6fc40448\n $fGProductBkkfg:*::*::*: ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg) =>\n GProductB\n f\n@@ -344,15 +344,15 @@\n @lg\n @lfg\n @rf\n @rg\n @rfg\n v\n v1)]\n-9f95eb70f3484cf2da5d8a47eff03bb4\n+be587f5ebabd70366f8a7fe73674df79\n $fGProductBkkfg:*::*::*:_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *) (x :: k2).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -386,15 +386,15 @@\n GHC.Generics.:*:\n @k1\n @lfg\n @rfg\n @x\n (gbprod @k1 @k @f @g @lf @lg @lfg $dGProductB @x pf pg l1 r1)\n (gbprod @k1 @k @f @g @rf @rg @rfg $dGProductB1 @x pf pg l2 r2) } }]\n-7a23b3aec1940c654f27ce7fbe3854ea\n+914f54b0d6e2a89a93dd455e372e6256\n $fGProductBkkfg:*::*::*:_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *) (x :: k2).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg, f GHC.Types.~ g,\n (lf GHC.Generics.:*: rf) GHC.Types.~ (lg GHC.Generics.:*: rg)) =>\n Data.Proxy.Proxy f\n@@ -476,15 +476,15 @@\n (GHC.Types.Eq# @(k1 -> *) @rg @rg @~_N)\n `cast`\n ((GHC.Types.~) *>_N (SelCo:Tc(2) (Sym co)) _N)_R\n eta\n (Data.Proxy.Proxy @(k1 -> *) @rf)\n (Data.Proxy.Proxy @(k1 -> *) @rfg)\n eta3) } }]\n-81455317ca9dc8208f67dba70e9d6206\n+fc2d61b7ea4679aea9b3ac6e72f02658\n $fGProductBkkfgM1M1M1 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta).\n GProductB f g repf repg repfg =>\n GProductB\n f\n g\n@@ -531,15 +531,15 @@\n @g\n @repf\n @repg\n @repfg\n @i\n @c\n v)]\n-3b32dafe22deb2a2fa16ce69b9df06b5\n+878c2ace05d8e6f559a99e0ea9a97f1f\n $fGProductBkkfgM1M1M1_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n GProductB f g repf repg repfg =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -594,15 +594,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-8e15c2296c39635be9c749113820207b\n+edfead41cc50dc8cbadb566897290476\n $fGProductBkkfgM1M1M1_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n (GProductB f g repf repg repfg, f GHC.Types.~ g,\n GHC.Generics.M1 i c repf GHC.Types.~ GHC.Generics.M1 i c repg) =>\n Data.Proxy.Proxy f\n@@ -658,15 +658,15 @@\n ((GHC.Types.~) *>_N (SelCo:Tc(3) (Sym co)) _N)_R\n eta\n (Data.Proxy.Proxy @(k1 -> *) @repf)\n (Data.Proxy.Proxy @(k1 -> *) @repfg)\n eta3)\n `cast`\n (Sym (GHC.Generics.N:M1[0] _N _P _P _R) _N) } }]\n-357cc0bbb62d24fa2431d50abcbf85a0\n+1d5197dc9ff3fddafc2d4c9bc1ca1304\n $fGProductBkkfgRecRecRec ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *).\n ProductB b =>\n GProductB\n f\n g\n@@ -693,15 +693,15 @@\n @(Data.Generics.GenericN.Rec (b' (P0 f)) (b f))\n @(Data.Generics.GenericN.Rec (b' (P0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b' (P0 (Data.Functor.Product.Product f g)))\n (b (Data.Functor.Product.Product f g)))\n ($fGProductBkkfgRecRecRec_$cgbprod @k @k1 @b @f @g @b' v)\n ($fGProductBkkfgRecRecRec_$cgbuniq @k @k1 @b @f @g @b' v)]\n-42ee8839d4874a8a8a96e16659057e31\n+9a48c0f962d84841fb24f923e5c37022\n $fGProductBkkfgRecRecRec0 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1).\n GProductB\n f\n g\n (Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a))\n@@ -725,15 +725,15 @@\n @(Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a))\n @(Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a))\n @(Data.Generics.GenericN.Rec\n (P0 (Data.Functor.Product.Product f g) a_or_pma)\n (Data.Functor.Product.Product f g a))\n ($fGProductBkkfgRecRecRec0_$cgbprod @k @k1 @f @g @a_or_pma @a)\n ($fGProductBkkfgRecRecRec0_$cgbuniq @k @k1 @f @g @a_or_pma @a)]\n-c8b0cdd9235938526f0f32cefa3db4b8\n+78f92d92c7dd340fe3a19263a735c66f\n $fGProductBkkfgRecRecRec0_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1) (x :: k2).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a) x\n -> Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a) x\n@@ -788,15 +788,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-d7565cb64c388d8dd15b63bf59389689\n+35cb566ee36ae8b1de290d2cf331c184\n $fGProductBkkfgRecRecRec0_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1) (x :: k2).\n (f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a)\n GHC.Types.~ Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a)) =>\n Data.Proxy.Proxy f\n@@ -848,15 +848,15 @@\n (P0 (Data.Functor.Product.Product f g) a_or_pma)\n (Data.Functor.Product.Product f g a))>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N _P) _N _N)]\n-12d37b493e4bd0d20abf420a2dcee542\n+d76973d19bef026f9382e152e2411cda\n $fGProductBkkfgRecRecRec_$cgbprod ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *) (x :: k2).\n ProductB b =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (b' (P0 f)) (b f) x\n@@ -922,15 +922,15 @@\n _P) _N _N)]\n-ab45555f1dc066eb0559aa18e3645386\n+89b2eed59ff35f5237c466e0a9341cdb\n $fGProductBkkfgRecRecRec_$cgbuniq ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *) (x :: k2).\n (ProductB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (b' (P0 f)) (b f)\n GHC.Types.~ Data.Generics.GenericN.Rec (b' (P0 g)) (b g)) =>\n Data.Proxy.Proxy f\n@@ -999,15 +999,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-bbee4f367f0416aa5ccba017be7446ae\n+b49f76ed3ddb3eef78261dc90d31e08a\n $fGProductBkkfgU1U1U1 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *).\n GProductB f g GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:GProductB], Inline: CONLIKE,\n Unfolding: DFun: @k @k1 @f :: k -> * @g :: k -> *.\n@@ -1016,15 +1016,15 @@\n @f\n @g\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGProductBkkfgU1U1U1_$cgbprod @k @k1 @f @g)\n ($fGProductBkkfgU1U1U1_$cgbuniq @k @k1 @f @g)]\n-246dcf1bb3a6b29ba82fb1fd915dc320\n+65c28f3166e2408a4639223dfbe84f24\n $fGProductBkkfgU1U1U1_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (x :: k2).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -1037,15 +1037,15 @@\n @g :: k -> *\n @x :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g)\n (ds2['GHC.Types.Many] :: GHC.Generics.U1 x)\n (ds3['GHC.Types.Many] :: GHC.Generics.U1 x) ->\n case ds2 of wild { GHC.Generics.U1 -> ds3 }]\n-f7f68d4da77412ad34b1de4f7f7977ec\n+c7e98a66349e7e97c704f596fe42074f\n $fGProductBkkfgU1U1U1_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (x :: k2).\n (f GHC.Types.~ g, GHC.Generics.U1 GHC.Types.~ GHC.Generics.U1) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> (forall (a :: k1). f a)\n@@ -1063,15 +1063,15 @@\n ($d~1['GHC.Types.Many] :: GHC.Generics.U1\n GHC.Types.~ GHC.Generics.U1)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds3['GHC.Types.Many] :: forall (a :: k). f a) ->\n GHC.Generics.U1 @k1 @x]\n-de661695661a4d6c113050d151723153\n+5e4929d90c30b88bc3096ce6b412fcca\n $fProductBkBarbie ::\n forall k (b :: (k -> *) -> *).\n ProductB b =>\n ProductB (Barbies.Internal.Wrappers.Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -1107,15 +1107,15 @@\n (\\ @f :: k -> * (x['GHC.Types.Many] :: forall (a :: k). f a) ->\n buniq @k @b v @f x)\n `cast`\n (forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.Wrappers.N:Barbie[0]\n _N _R) _N)]\n-2118213c0425c9b312dc0626b3139824\n+407d4b083bfb1c2946d3227a143b7901\n $fProductBkBarbie_$cp1ProductB ::\n forall k (b :: (k -> *) -> *).\n ProductB b =>\n Barbies.Internal.ApplicativeB.ApplicativeB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -1123,15 +1123,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductB['GHC.Types.Many] :: ProductB b) ->\n Barbies.Internal.Wrappers.$fApplicativeBkBarbie\n @k\n @b\n ($p1ProductB @k @b $dProductB)]\n-66e37f8c7f31fb04d44ad97ff8f24f3f\n+3f036bf7e94f4bdbdc19e449aeda81eb\n $fProductBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductB a, ProductB b) =>\n ProductB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -1143,15 +1143,15 @@\n (v['GHC.Types.Many] :: ProductB a)\n (v1['GHC.Types.Many] :: ProductB b).\n @k\n @(Data.Functor.Product.Product a b)\n ($fProductBkProduct_$cp1ProductB @k @a @b v v1)\n ($fProductBkProduct_$cbprod @k @a @b v v1)\n ($fProductBkProduct_$cbuniq @k @a @b v v1)]\n-30f3bd7a479e2b3420aafdf1eaec0379\n+78c95bbd13f6a1eaca8820e4784155d8\n $fProductBkProduct_$cbprod ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (ProductB a, ProductB b) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n -> Data.Functor.Product.Product\n@@ -1175,15 +1175,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @(Data.Functor.Product.Product f g)\n (bprod @k @a $dProductB @f @g ll rl)\n (bprod @k @b $dProductB1 @f @g lr rr) } }]\n-6a3d09c0ce37feef4e137bdd64075192\n+ef4456797cfc0e4bcad5b211a74b3667\n $fProductBkProduct_$cbuniq ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (ProductB a, ProductB b) =>\n (forall (a1 :: k). f a1) -> Data.Functor.Product.Product a b f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=1),\n@@ -1198,15 +1198,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @f\n (buniq @k @a $dProductB @f x)\n (buniq @k @b $dProductB1 @f x)]\n-46b4f0226d1ca3e9a90e4a3d71c82adc\n+06d5c65778de151933d1b562971444a8\n $fProductBkProduct_$cp1ProductB ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductB a, ProductB b) =>\n Barbies.Internal.ApplicativeB.ApplicativeB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -1219,147 +1219,147 @@\n ($dProductB1['GHC.Types.Many] :: ProductB b) ->\n Barbies.Internal.ApplicativeB.$fApplicativeBkProduct\n @k\n @a\n @b\n ($p1ProductB @k @a $dProductB)\n ($p1ProductB @k @b $dProductB1)]\n-fad284f7175ad96fbb2153306632d780\n+02290d82ebc2da3a92cd698bdfc33696\n $fProductBkProxy :: ProductB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ProductB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.ApplicativeB.$fApplicativeBkProxy @k)\n ($fProductBkProxy_$cbprod @k)\n ($fProductBkProxy_$cbuniq @k)]\n-a245fe3ab8d21f96cbc55e963c218ec6\n+3bd653cb8ce551ce83b69db72dd71a65\n $fProductBkProxy_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Proxy.Proxy (Data.Functor.Product.Product f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Product.Product f g)]\n-1a67ca7656f15cf1cfaf86356c525d55\n+238ffc82d894183f1d4dcbe1832506bb\n $fProductBkProxy_$cbuniq ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Data.Proxy.Proxy f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Data.Proxy.Proxy @(k -> *) @f]\n-7117c0cf0e9c790f33f737fa56798133\n+8bbf3e61a418a28aaa55151bf7a4122e\n $fProductBkUnit :: ProductB Barbies.Internal.Trivial.Unit\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:ProductB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Barbies.Internal.Trivial.Unit\n (Barbies.Internal.Trivial.$fApplicativeBkUnit @k)\n ($fProductBkUnit_$cbprod @k)\n ($fProductBkUnit_$cbuniq @k)]\n-f36d836930f54efbbe97f1393f668ad9\n+7f5497fed4fa8582074899d091ace3c5\n $fProductBkUnit1 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n (Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit f),\n Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit g),\n Data.Generics.GenericN.GenericN\n (Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g)),\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)))\n [TagSig: , LambdaFormInfo: LFCon[(%,,,%)],\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n ($fProductBkUnit6 @k @f, $fProductBkUnit6 @k @g,\n $fProductBkUnit4 @k @f @g, $fProductBkUnit2 @k @f @g)]\n-6a37d41b67fd984379530fb7dd65f40b\n+d487a2498d04d7a76f0fbf28119cf26d\n $fProductBkUnit2 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n@@ -1385,18 +1385,18 @@\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n @GHC.Generics.D\n @('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n ($fProductBkUnit3 @k @f @g)]\n-3b8f5e6b53493f14059c2dbb4f2644ae\n+86ae5c9d75a84de4f5ad97b29dfee4c9\n $fProductBkUnit3 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.C\n@@ -1424,15 +1424,15 @@\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.C\n @('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n ($fGProductBkkfgU1U1U1 @k @(*) @f @g)]\n-bc7255e2db808db406e2b4f268ad12fe\n+302dad90794df15409ec8633da9e6988\n $fProductBkUnit4 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Data.Generics.GenericN.GenericN\n (Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n@@ -1446,15 +1446,15 @@\n _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1465,15 +1465,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))))_R\n (Barbies.Internal.Trivial.$fGenericUnit\n @k\n @(Data.Functor.Product.Product f g))]\n-69c96d14c027c9119099d80713f08c05\n+3e5b33ee9793201a8e7c72c923ae9ded\n $fProductBkUnit5 ::\n GHC.Types.Coercible\n (GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [HasNoCafRefs, TagSig: ,\n@@ -1538,45 +1538,45 @@\n Unfolding: Core: \n GHC.Types.MkCoercible\n @(* -> *)\n @(GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @~_R]\n-19b4fa66927a8b011466a36ea0d3cd89\n+3677915cb3a3982c9ef2b45dbc8341de\n $fProductBkUnit6 ::\n forall {k} {g :: k -> *}.\n Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit g)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @g :: k -> * ->\n Data.Generics.GenericN.$fGenericNa\n@@ -1588,15 +1588,15 @@\n (Sub (Sym (Barbies.Internal.Trivial.Rep_Unit[0] _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1607,15 +1607,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n <0>_N)))_N)\n (Sym (Barbies.Internal.Trivial.Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))))_R\n (Barbies.Internal.Trivial.$fGenericUnit @k @g)]\n-74027eb919a122dc45c7d8d553b3e969\n+f868d5262a5c24e7fe277b7bf6263f0e\n $fProductBkUnit_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Barbies.Internal.Trivial.Unit f\n -> Barbies.Internal.Trivial.Unit g\n -> Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n@@ -1673,15 +1673,15 @@\n _N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1692,15 +1692,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1747,15 +1747,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1802,15 +1802,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n <0>_N)))_N)\n (Sym (Barbies.Internal.Trivial.Rep_Unit[0]\n _N _N)))_N\n ; Sym (Data.Generics.GenericN.R:RepNa[0]\n _N)))_N)_R]\n-a82eaa4a2560af30b96aefd62282fe46\n+572b21488c90aa01d754c470bb0fac10\n $fProductBkUnit_$cbuniq ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Barbies.Internal.Trivial.Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Barbies.Internal.Trivial.Unit @k @f]\n-8d239728a4ba7985b57a6f5819f971c8\n+684a93ad077194cc10d2d0846b2970be\n $tcGProductB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 1667332789958806794#Word64\n- 4613459615711773077#Word64\n+ 6419954504256367931#Word64\n+ 8483069447274487861#Word64\n $trModule\n $tcGProductB2\n 2#\n $tcGProductB1]\n-fb4bf787b355a7395c5b85475f7a38b1\n+c4f0d2130cb7dc2c84f925d592c5a9b4\n $tcGProductB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-12fee82fe89bf1faac0bace6407358fd\n+30ade253f285773b8adb960aa2bc0509\n $tcGProductB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGProductB3]\n-00437b06e8a8fa24142fa30cfcd443ed\n+b5835aa294e6b16743d6c9ae237d8d78\n $tcGProductB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GProductB\"#]\n-2be7b2b353c6a95811c789193e6d9c4b\n+fc36176be099b7a5d7dca050f1346285\n $tcProductB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8362087174471471218#Word64\n- 5543274390772100721#Word64\n+ 10066923484651618271#Word64\n+ 6842141617440004383#Word64\n $trModule\n $tcProductB2\n 1#\n $tcProductB1]\n-b40124850e7254ec98d25730e8676207\n+751be54dc200afac3e6b7d9d627a51e2\n $tcProductB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-86723feb3422e173beb56299ecacd1fa\n+763e0a6c967cae0dbbb45e461574701c\n $tcProductB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProductB3]\n-6c6e3eeef9775bfa0da27c9d1a13f378\n+2653ce19c872dfac29f7f83842ea70e0\n $tcProductB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ProductB\"#]\n-7cad2cdbcd26ce2a4a0ab74e5cc2c6ec\n+1d5a663f62e3fa7b71f568f42046e940\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-b49434b17c408269428704647975258a\n+d3dcc5ae679a995bcbbe5ad7f62d67aa\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-fbbcd5bdc83f5a422664ca006e53b53f\n+88920a03577622e718905f489d07baa5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Internal.Product\"#]\n-e386a12b5327aef49ab790158bad1d39\n+fb2fdedbc4df7bba95e7164b854c26bb\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-e5c73cb20e22e2339d90951f21136782\n+e332ebcf6da874ae3d53980adb2c2f46\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-bc675e0bbae190e7f654d33450857fb5\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+4926d6901d7dc38a47d54fcfd916a154\n type CanDeriveProductB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveProductB b f g =\n (Data.Generics.GenericN.GenericN (b f),\n Data.Generics.GenericN.GenericN (b g),\n Data.Generics.GenericN.GenericN\n (b (Data.Functor.Product.Product f g)),\n@@ -1937,15 +1937,15 @@\n f\n g\n (Data.Generics.GenericN.RepN (b f))\n (Data.Generics.GenericN.RepN (b g))\n (Data.Generics.GenericN.RepN\n (b (Data.Functor.Product.Product f g))))\n :: GHC.Types.Constraint\n-8f1af920d3af97901ec1ac098f74daba\n+b60d7e8eb96dbb0278977b59f36bc27b\n type GProductB :: forall {k} k1.\n (k1 -> *)\n -> (k1 -> *)\n -> (k -> *)\n -> (k -> *)\n -> (k -> *)\n -> GHC.Types.Constraint\n@@ -1957,31 +1957,31 @@\n (f GHC.Types.~ g, repbf GHC.Types.~ repbg) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy repbf\n -> Data.Proxy.Proxy repbfg\n -> (forall (a :: k1). f a)\n -> repbf x\n {-# MINIMAL gbprod, gbuniq #-}\n-9a3d7e6e47a131526f197419b882faf8\n+c30efe7349e0a1b84ed738fc8e2a7b75\n type P0 :: forall {k}. k -> k\n type P0 = Data.Generics.GenericN.Param 0 :: k -> k\n-8c9d66253b43e8aba355b8274960ba2f\n+9ff7e490b88f3a8ab0f4040387f79ce5\n type ProductB :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.ApplicativeB.ApplicativeB b =>\n ProductB b where\n bprod :: forall (f :: k -> *) (g :: k -> *).\n b f -> b g -> b (Data.Functor.Product.Product f g)\n default bprod :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveProductB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n buniq :: forall (f :: k -> *). (forall (a :: k). f a) -> b f\n default buniq :: forall (f :: k -> *).\n CanDeriveProductB b f f =>\n (forall (a :: k). f a) -> b f\n-f4b6a07d7393cbd5378a6fbe86392990\n+44302777520f410b57729f067e86f913\n gbprodDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveProductB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=2),\n@@ -2165,15 +2165,15 @@\n <*>_N\n _N\n _N\n <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N)]\n-a46ecb7ae30532bd29841267366928f9\n+4de9835a74415fb8063ba2fdb01fa3dc\n gbuniqDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *).\n CanDeriveProductB b f f =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,37 +1,37 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Data.Barbie.Internal.Product [orphan module] 9066\n- interface hash: 059f56e333fba4590d69f7b2111afcb7\n- ABI hash: ea5df7eb3236564b9b2df74ac1890984\n- export-list hash: d02fbc0d5447bb390c9724a84345915e\n- orphan hash: 3ede67c0957e06dcb1452446efdc669d\n+ interface hash: bb2dc3dfe6c3335390f1619fb3f7ea9c\n+ ABI hash: c93ae87029f9fac303e0a83c615266bf\n+ export-list hash: 21a109e654e4e470b1fcc905ea27f050\n+ orphan hash: 6c65f40fae477e59d207332d92ca6bb4\n flag hash: 36efccb710688bf8ac88b078b79027a7\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 25d3c0149114a684ec83fbdc768fa22c\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gbprodDefault\n gbuniqDefault\n CanDeriveProductB\n GProductB{gbprod gbuniq}\n ProductB{bprod buniq}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -42,58 +42,58 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 52d12130ceef8cc06259aaff6bffc97c\n- exports: e9f95692d631be9bde87f12f2b5daec4\n- Barbie ad846fa82a9ea3484523abb45135d49c\n- Barbie 3a10e5ace6e79cdc719621acf28187af\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- fromN 1b8038624d1891d55a7bd44a4cadea42\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 129f75c5c4289ab45c84ba1048dff5f0\n+ exports: 7bbe89242a5db7bf6a1a319c99ea3bdc\n+ Barbie 4b28340ceb30302559d6087444c7ed2d\n+ Barbie 01d0899d14173451a813c232a74e39b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ fromN cc2678f628cd15ffd0813e57882d7db1\n+ toN 46484572a2091aa1d37095fef03b9792\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-d810e5c5f56c60345ba099425320b6f1\n+dc832686db50ce8b37b6a015c38fe0ff\n $dmbprod ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (ProductB b, CanDeriveProductB b f g) =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n \\ @k\n @b :: (k -> *) -> *\n ($dProductB['GHC.Types.Many] :: ProductB b)\n @f :: k -> *\n @g :: k -> *\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveProductB b f g) ->\n gbprodDefault @k @b @f @g $d(%,,,%)]\n-8e174ec8de08f105e5bedc98cb0e7bf0\n+4aa43a5a03cc6e34124a02b6eb36f137\n $dmbuniq ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (ProductB b, CanDeriveProductB b f f) =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -264,15 +264,15 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N)]\n-299efbf9cc6660adaca9685012289a19\n+ea3f0ad805d4c33461e7cf7d3e23283c\n $fApplicativeBkb ::\n forall k (b :: (k -> *) -> *).\n (ProductB b, Barbies.Internal.FunctorB.FunctorB b) =>\n Barbies.Internal.ApplicativeB.ApplicativeB b\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n@@ -282,15 +282,15 @@\n (v1['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @k\n @b\n v1\n (\\ @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n buniq @k @b v @f ds)\n (\\ @f :: k -> * @g :: k -> * -> bprod @k @b v @f @g)]\n-983b0a33a6c07d13a14c9c63671ec0e7\n+b7611bdd4e9ba0be6abc730f6fc40448\n $fGProductBkkfg:*::*::*: ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg) =>\n GProductB\n f\n@@ -344,15 +344,15 @@\n @lg\n @lfg\n @rf\n @rg\n @rfg\n v\n v1)]\n-9f95eb70f3484cf2da5d8a47eff03bb4\n+be587f5ebabd70366f8a7fe73674df79\n $fGProductBkkfg:*::*::*:_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *) (x :: k2).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -386,15 +386,15 @@\n GHC.Generics.:*:\n @k1\n @lfg\n @rfg\n @x\n (gbprod @k1 @k @f @g @lf @lg @lfg $dGProductB @x pf pg l1 r1)\n (gbprod @k1 @k @f @g @rf @rg @rfg $dGProductB1 @x pf pg l2 r2) } }]\n-7a23b3aec1940c654f27ce7fbe3854ea\n+914f54b0d6e2a89a93dd455e372e6256\n $fGProductBkkfg:*::*::*:_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *) (x :: k2).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg, f GHC.Types.~ g,\n (lf GHC.Generics.:*: rf) GHC.Types.~ (lg GHC.Generics.:*: rg)) =>\n Data.Proxy.Proxy f\n@@ -476,15 +476,15 @@\n (GHC.Types.Eq# @(k1 -> *) @rg @rg @~_N)\n `cast`\n ((GHC.Types.~) *>_N (SelCo:Tc(2) (Sym co)) _N)_R\n eta\n (Data.Proxy.Proxy @(k1 -> *) @rf)\n (Data.Proxy.Proxy @(k1 -> *) @rfg)\n eta3) } }]\n-81455317ca9dc8208f67dba70e9d6206\n+fc2d61b7ea4679aea9b3ac6e72f02658\n $fGProductBkkfgM1M1M1 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta).\n GProductB f g repf repg repfg =>\n GProductB\n f\n g\n@@ -531,15 +531,15 @@\n @g\n @repf\n @repg\n @repfg\n @i\n @c\n v)]\n-3b32dafe22deb2a2fa16ce69b9df06b5\n+878c2ace05d8e6f559a99e0ea9a97f1f\n $fGProductBkkfgM1M1M1_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n GProductB f g repf repg repfg =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -594,15 +594,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-8e15c2296c39635be9c749113820207b\n+edfead41cc50dc8cbadb566897290476\n $fGProductBkkfgM1M1M1_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n (GProductB f g repf repg repfg, f GHC.Types.~ g,\n GHC.Generics.M1 i c repf GHC.Types.~ GHC.Generics.M1 i c repg) =>\n Data.Proxy.Proxy f\n@@ -658,15 +658,15 @@\n ((GHC.Types.~) *>_N (SelCo:Tc(3) (Sym co)) _N)_R\n eta\n (Data.Proxy.Proxy @(k1 -> *) @repf)\n (Data.Proxy.Proxy @(k1 -> *) @repfg)\n eta3)\n `cast`\n (Sym (GHC.Generics.N:M1[0] _N _P _P _R) _N) } }]\n-357cc0bbb62d24fa2431d50abcbf85a0\n+1d5197dc9ff3fddafc2d4c9bc1ca1304\n $fGProductBkkfgRecRecRec ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *).\n ProductB b =>\n GProductB\n f\n g\n@@ -693,15 +693,15 @@\n @(Data.Generics.GenericN.Rec (b' (P0 f)) (b f))\n @(Data.Generics.GenericN.Rec (b' (P0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b' (P0 (Data.Functor.Product.Product f g)))\n (b (Data.Functor.Product.Product f g)))\n ($fGProductBkkfgRecRecRec_$cgbprod @k @k1 @b @f @g @b' v)\n ($fGProductBkkfgRecRecRec_$cgbuniq @k @k1 @b @f @g @b' v)]\n-42ee8839d4874a8a8a96e16659057e31\n+9a48c0f962d84841fb24f923e5c37022\n $fGProductBkkfgRecRecRec0 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1).\n GProductB\n f\n g\n (Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a))\n@@ -725,15 +725,15 @@\n @(Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a))\n @(Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a))\n @(Data.Generics.GenericN.Rec\n (P0 (Data.Functor.Product.Product f g) a_or_pma)\n (Data.Functor.Product.Product f g a))\n ($fGProductBkkfgRecRecRec0_$cgbprod @k @k1 @f @g @a_or_pma @a)\n ($fGProductBkkfgRecRecRec0_$cgbuniq @k @k1 @f @g @a_or_pma @a)]\n-c8b0cdd9235938526f0f32cefa3db4b8\n+78f92d92c7dd340fe3a19263a735c66f\n $fGProductBkkfgRecRecRec0_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1) (x :: k2).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a) x\n -> Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a) x\n@@ -788,15 +788,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-d7565cb64c388d8dd15b63bf59389689\n+35cb566ee36ae8b1de290d2cf331c184\n $fGProductBkkfgRecRecRec0_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1) (x :: k2).\n (f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a)\n GHC.Types.~ Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a)) =>\n Data.Proxy.Proxy f\n@@ -848,15 +848,15 @@\n (P0 (Data.Functor.Product.Product f g) a_or_pma)\n (Data.Functor.Product.Product f g a))>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N _P) _N _N)]\n-12d37b493e4bd0d20abf420a2dcee542\n+d76973d19bef026f9382e152e2411cda\n $fGProductBkkfgRecRecRec_$cgbprod ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *) (x :: k2).\n ProductB b =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (b' (P0 f)) (b f) x\n@@ -922,15 +922,15 @@\n _P) _N _N)]\n-ab45555f1dc066eb0559aa18e3645386\n+89b2eed59ff35f5237c466e0a9341cdb\n $fGProductBkkfgRecRecRec_$cgbuniq ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *) (x :: k2).\n (ProductB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (b' (P0 f)) (b f)\n GHC.Types.~ Data.Generics.GenericN.Rec (b' (P0 g)) (b g)) =>\n Data.Proxy.Proxy f\n@@ -999,15 +999,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-bbee4f367f0416aa5ccba017be7446ae\n+b49f76ed3ddb3eef78261dc90d31e08a\n $fGProductBkkfgU1U1U1 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *).\n GProductB f g GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:GProductB], Inline: CONLIKE,\n Unfolding: DFun: @k @k1 @f :: k -> * @g :: k -> *.\n@@ -1016,15 +1016,15 @@\n @f\n @g\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGProductBkkfgU1U1U1_$cgbprod @k @k1 @f @g)\n ($fGProductBkkfgU1U1U1_$cgbuniq @k @k1 @f @g)]\n-246dcf1bb3a6b29ba82fb1fd915dc320\n+65c28f3166e2408a4639223dfbe84f24\n $fGProductBkkfgU1U1U1_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (x :: k2).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -1037,15 +1037,15 @@\n @g :: k -> *\n @x :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g)\n (ds2['GHC.Types.Many] :: GHC.Generics.U1 x)\n (ds3['GHC.Types.Many] :: GHC.Generics.U1 x) ->\n case ds2 of wild { GHC.Generics.U1 -> ds3 }]\n-f7f68d4da77412ad34b1de4f7f7977ec\n+c7e98a66349e7e97c704f596fe42074f\n $fGProductBkkfgU1U1U1_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (x :: k2).\n (f GHC.Types.~ g, GHC.Generics.U1 GHC.Types.~ GHC.Generics.U1) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> (forall (a :: k1). f a)\n@@ -1063,15 +1063,15 @@\n ($d~1['GHC.Types.Many] :: GHC.Generics.U1\n GHC.Types.~ GHC.Generics.U1)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds3['GHC.Types.Many] :: forall (a :: k). f a) ->\n GHC.Generics.U1 @k1 @x]\n-de661695661a4d6c113050d151723153\n+5e4929d90c30b88bc3096ce6b412fcca\n $fProductBkBarbie ::\n forall k (b :: (k -> *) -> *).\n ProductB b =>\n ProductB (Barbies.Internal.Wrappers.Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -1107,15 +1107,15 @@\n (\\ @f :: k -> * (x['GHC.Types.Many] :: forall (a :: k). f a) ->\n buniq @k @b v @f x)\n `cast`\n (forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.Wrappers.N:Barbie[0]\n _N _R) _N)]\n-2118213c0425c9b312dc0626b3139824\n+407d4b083bfb1c2946d3227a143b7901\n $fProductBkBarbie_$cp1ProductB ::\n forall k (b :: (k -> *) -> *).\n ProductB b =>\n Barbies.Internal.ApplicativeB.ApplicativeB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -1123,15 +1123,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductB['GHC.Types.Many] :: ProductB b) ->\n Barbies.Internal.Wrappers.$fApplicativeBkBarbie\n @k\n @b\n ($p1ProductB @k @b $dProductB)]\n-66e37f8c7f31fb04d44ad97ff8f24f3f\n+3f036bf7e94f4bdbdc19e449aeda81eb\n $fProductBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductB a, ProductB b) =>\n ProductB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -1143,15 +1143,15 @@\n (v['GHC.Types.Many] :: ProductB a)\n (v1['GHC.Types.Many] :: ProductB b).\n @k\n @(Data.Functor.Product.Product a b)\n ($fProductBkProduct_$cp1ProductB @k @a @b v v1)\n ($fProductBkProduct_$cbprod @k @a @b v v1)\n ($fProductBkProduct_$cbuniq @k @a @b v v1)]\n-30f3bd7a479e2b3420aafdf1eaec0379\n+78c95bbd13f6a1eaca8820e4784155d8\n $fProductBkProduct_$cbprod ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (ProductB a, ProductB b) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n -> Data.Functor.Product.Product\n@@ -1175,15 +1175,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @(Data.Functor.Product.Product f g)\n (bprod @k @a $dProductB @f @g ll rl)\n (bprod @k @b $dProductB1 @f @g lr rr) } }]\n-6a3d09c0ce37feef4e137bdd64075192\n+ef4456797cfc0e4bcad5b211a74b3667\n $fProductBkProduct_$cbuniq ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (ProductB a, ProductB b) =>\n (forall (a1 :: k). f a1) -> Data.Functor.Product.Product a b f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=1),\n@@ -1198,15 +1198,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @f\n (buniq @k @a $dProductB @f x)\n (buniq @k @b $dProductB1 @f x)]\n-46b4f0226d1ca3e9a90e4a3d71c82adc\n+06d5c65778de151933d1b562971444a8\n $fProductBkProduct_$cp1ProductB ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductB a, ProductB b) =>\n Barbies.Internal.ApplicativeB.ApplicativeB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -1219,147 +1219,147 @@\n ($dProductB1['GHC.Types.Many] :: ProductB b) ->\n Barbies.Internal.ApplicativeB.$fApplicativeBkProduct\n @k\n @a\n @b\n ($p1ProductB @k @a $dProductB)\n ($p1ProductB @k @b $dProductB1)]\n-fad284f7175ad96fbb2153306632d780\n+02290d82ebc2da3a92cd698bdfc33696\n $fProductBkProxy :: ProductB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ProductB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.ApplicativeB.$fApplicativeBkProxy @k)\n ($fProductBkProxy_$cbprod @k)\n ($fProductBkProxy_$cbuniq @k)]\n-a245fe3ab8d21f96cbc55e963c218ec6\n+3bd653cb8ce551ce83b69db72dd71a65\n $fProductBkProxy_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Proxy.Proxy (Data.Functor.Product.Product f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Product.Product f g)]\n-1a67ca7656f15cf1cfaf86356c525d55\n+238ffc82d894183f1d4dcbe1832506bb\n $fProductBkProxy_$cbuniq ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Data.Proxy.Proxy f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Data.Proxy.Proxy @(k -> *) @f]\n-7117c0cf0e9c790f33f737fa56798133\n+8bbf3e61a418a28aaa55151bf7a4122e\n $fProductBkUnit :: ProductB Barbies.Internal.Trivial.Unit\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:ProductB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Barbies.Internal.Trivial.Unit\n (Barbies.Internal.Trivial.$fApplicativeBkUnit @k)\n ($fProductBkUnit_$cbprod @k)\n ($fProductBkUnit_$cbuniq @k)]\n-f36d836930f54efbbe97f1393f668ad9\n+7f5497fed4fa8582074899d091ace3c5\n $fProductBkUnit1 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n (Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit f),\n Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit g),\n Data.Generics.GenericN.GenericN\n (Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g)),\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)))\n [TagSig: , LambdaFormInfo: LFCon[(%,,,%)],\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n ($fProductBkUnit6 @k @f, $fProductBkUnit6 @k @g,\n $fProductBkUnit4 @k @f @g, $fProductBkUnit2 @k @f @g)]\n-6a37d41b67fd984379530fb7dd65f40b\n+d487a2498d04d7a76f0fbf28119cf26d\n $fProductBkUnit2 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n@@ -1385,18 +1385,18 @@\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n @GHC.Generics.D\n @('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n ($fProductBkUnit3 @k @f @g)]\n-3b8f5e6b53493f14059c2dbb4f2644ae\n+86ae5c9d75a84de4f5ad97b29dfee4c9\n $fProductBkUnit3 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.C\n@@ -1424,15 +1424,15 @@\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.C\n @('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n ($fGProductBkkfgU1U1U1 @k @(*) @f @g)]\n-bc7255e2db808db406e2b4f268ad12fe\n+302dad90794df15409ec8633da9e6988\n $fProductBkUnit4 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Data.Generics.GenericN.GenericN\n (Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n@@ -1446,15 +1446,15 @@\n _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1465,15 +1465,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))))_R\n (Barbies.Internal.Trivial.$fGenericUnit\n @k\n @(Data.Functor.Product.Product f g))]\n-69c96d14c027c9119099d80713f08c05\n+3e5b33ee9793201a8e7c72c923ae9ded\n $fProductBkUnit5 ::\n GHC.Types.Coercible\n (GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [HasNoCafRefs, TagSig: ,\n@@ -1538,45 +1538,45 @@\n Unfolding: Core: \n GHC.Types.MkCoercible\n @(* -> *)\n @(GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @~_R]\n-19b4fa66927a8b011466a36ea0d3cd89\n+3677915cb3a3982c9ef2b45dbc8341de\n $fProductBkUnit6 ::\n forall {k} {g :: k -> *}.\n Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit g)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @g :: k -> * ->\n Data.Generics.GenericN.$fGenericNa\n@@ -1588,15 +1588,15 @@\n (Sub (Sym (Barbies.Internal.Trivial.Rep_Unit[0] _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1607,15 +1607,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n <0>_N)))_N)\n (Sym (Barbies.Internal.Trivial.Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))))_R\n (Barbies.Internal.Trivial.$fGenericUnit @k @g)]\n-74027eb919a122dc45c7d8d553b3e969\n+f868d5262a5c24e7fe277b7bf6263f0e\n $fProductBkUnit_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Barbies.Internal.Trivial.Unit f\n -> Barbies.Internal.Trivial.Unit g\n -> Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n@@ -1673,15 +1673,15 @@\n _N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1692,15 +1692,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1747,15 +1747,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1802,15 +1802,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n <0>_N)))_N)\n (Sym (Barbies.Internal.Trivial.Rep_Unit[0]\n _N _N)))_N\n ; Sym (Data.Generics.GenericN.R:RepNa[0]\n _N)))_N)_R]\n-a82eaa4a2560af30b96aefd62282fe46\n+572b21488c90aa01d754c470bb0fac10\n $fProductBkUnit_$cbuniq ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Barbies.Internal.Trivial.Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Barbies.Internal.Trivial.Unit @k @f]\n-8d239728a4ba7985b57a6f5819f971c8\n+684a93ad077194cc10d2d0846b2970be\n $tcGProductB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 1667332789958806794#Word64\n- 4613459615711773077#Word64\n+ 6419954504256367931#Word64\n+ 8483069447274487861#Word64\n $trModule\n $tcGProductB2\n 2#\n $tcGProductB1]\n-fb4bf787b355a7395c5b85475f7a38b1\n+c4f0d2130cb7dc2c84f925d592c5a9b4\n $tcGProductB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-12fee82fe89bf1faac0bace6407358fd\n+30ade253f285773b8adb960aa2bc0509\n $tcGProductB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGProductB3]\n-00437b06e8a8fa24142fa30cfcd443ed\n+b5835aa294e6b16743d6c9ae237d8d78\n $tcGProductB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GProductB\"#]\n-2be7b2b353c6a95811c789193e6d9c4b\n+fc36176be099b7a5d7dca050f1346285\n $tcProductB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8362087174471471218#Word64\n- 5543274390772100721#Word64\n+ 10066923484651618271#Word64\n+ 6842141617440004383#Word64\n $trModule\n $tcProductB2\n 1#\n $tcProductB1]\n-b40124850e7254ec98d25730e8676207\n+751be54dc200afac3e6b7d9d627a51e2\n $tcProductB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-86723feb3422e173beb56299ecacd1fa\n+763e0a6c967cae0dbbb45e461574701c\n $tcProductB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProductB3]\n-6c6e3eeef9775bfa0da27c9d1a13f378\n+2653ce19c872dfac29f7f83842ea70e0\n $tcProductB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ProductB\"#]\n-7cad2cdbcd26ce2a4a0ab74e5cc2c6ec\n+1d5a663f62e3fa7b71f568f42046e940\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-b49434b17c408269428704647975258a\n+d3dcc5ae679a995bcbbe5ad7f62d67aa\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-fbbcd5bdc83f5a422664ca006e53b53f\n+88920a03577622e718905f489d07baa5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Internal.Product\"#]\n-e386a12b5327aef49ab790158bad1d39\n+fb2fdedbc4df7bba95e7164b854c26bb\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-e5c73cb20e22e2339d90951f21136782\n+e332ebcf6da874ae3d53980adb2c2f46\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-bc675e0bbae190e7f654d33450857fb5\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+4926d6901d7dc38a47d54fcfd916a154\n type CanDeriveProductB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveProductB b f g =\n (Data.Generics.GenericN.GenericN (b f),\n Data.Generics.GenericN.GenericN (b g),\n Data.Generics.GenericN.GenericN\n (b (Data.Functor.Product.Product f g)),\n@@ -1937,15 +1937,15 @@\n f\n g\n (Data.Generics.GenericN.RepN (b f))\n (Data.Generics.GenericN.RepN (b g))\n (Data.Generics.GenericN.RepN\n (b (Data.Functor.Product.Product f g))))\n :: GHC.Types.Constraint\n-8f1af920d3af97901ec1ac098f74daba\n+b60d7e8eb96dbb0278977b59f36bc27b\n type GProductB :: forall {k} k1.\n (k1 -> *)\n -> (k1 -> *)\n -> (k -> *)\n -> (k -> *)\n -> (k -> *)\n -> GHC.Types.Constraint\n@@ -1957,31 +1957,31 @@\n (f GHC.Types.~ g, repbf GHC.Types.~ repbg) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy repbf\n -> Data.Proxy.Proxy repbfg\n -> (forall (a :: k1). f a)\n -> repbf x\n {-# MINIMAL gbprod, gbuniq #-}\n-9a3d7e6e47a131526f197419b882faf8\n+c30efe7349e0a1b84ed738fc8e2a7b75\n type P0 :: forall {k}. k -> k\n type P0 = Data.Generics.GenericN.Param 0 :: k -> k\n-8c9d66253b43e8aba355b8274960ba2f\n+9ff7e490b88f3a8ab0f4040387f79ce5\n type ProductB :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.ApplicativeB.ApplicativeB b =>\n ProductB b where\n bprod :: forall (f :: k -> *) (g :: k -> *).\n b f -> b g -> b (Data.Functor.Product.Product f g)\n default bprod :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveProductB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n buniq :: forall (f :: k -> *). (forall (a :: k). f a) -> b f\n default buniq :: forall (f :: k -> *).\n CanDeriveProductB b f f =>\n (forall (a :: k). f a) -> b f\n-f4b6a07d7393cbd5378a6fbe86392990\n+44302777520f410b57729f067e86f913\n gbprodDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveProductB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=2),\n@@ -2165,15 +2165,15 @@\n <*>_N\n _N\n _N\n <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N)]\n-a46ecb7ae30532bd29841267366928f9\n+4de9835a74415fb8063ba2fdb01fa3dc\n gbuniqDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *).\n CanDeriveProductB b f f =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Data.Barbie.Internal.ProductC 9066\n- interface hash: 44da3df06575c887323112ebf8b75e45\n- ABI hash: a2b23089e22e79ae157fbefcef015b03\n- export-list hash: 9a4775015330edff9bebe0b60887a8d6\n+ interface hash: a19e61718236560ead4ed47f9f28218b\n+ ABI hash: cf9d556ca8964b51c64bc4f30f34ff8c\n+ export-list hash: c3f7320ee00fe37bf94725f93d942daa\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: ed708539882f1f5a39d21c9555c09e01\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 272c6cfcf77d2a8065ca7a71d5c1e893\n sig of: Nothing\n@@ -20,22 +20,22 @@\n exports:\n buniqC\n gbdictsDefault\n Barbies.Generics.Constraints.GAll\n CanDeriveProductBC\n GProductBC{gbdicts}\n ProductBC{bdicts}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB\n Data.Barbie.Internal.Product GHC.Base GHC.Float Data.Orphans\n@@ -47,59 +47,59 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints dbe4a74ad57c80c8783d07b1647baa9b\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll aa7b4f673c4e9bfa97e7a1c50731e7fd\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- X 171ce71086eece1d472adc01f3a98af1\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- GAllRepB b55e3d91b41ad97ba9417bc021683df5\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit a4df766290f2aea4bc82298ff16dbd46\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 52d12130ceef8cc06259aaff6bffc97c\n- exports: e9f95692d631be9bde87f12f2b5daec4\n- Barbie ad846fa82a9ea3484523abb45135d49c\n- Barbie 3a10e5ace6e79cdc719621acf28187af\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product ea5df7eb3236564b9b2df74ac1890984\n- exports: d02fbc0d5447bb390c9724a84345915e\n- ProductB 8c9d66253b43e8aba355b8274960ba2f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 0aa87421cc66b72ee5cd089f3a525bd7\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll 4c84a1c336cdb79298bdd95cd66df075\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ X ef8817b68c20d7aa4653a1809b97c873\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ GAllRepB 9dc63ee0afcec57e5fc2662b4e967df7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit ae7009495dd3ca0664463506cc352eb5\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 129f75c5c4289ab45c84ba1048dff5f0\n+ exports: 7bbe89242a5db7bf6a1a319c99ea3bdc\n+ Barbie 4b28340ceb30302559d6087444c7ed2d\n+ Barbie 01d0899d14173451a813c232a74e39b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product c93ae87029f9fac303e0a83c615266bf\n+ exports: 21a109e654e4e470b1fcc905ea27f050\n+ ProductB 9ff7e490b88f3a8ab0f4040387f79ce5\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ toN 46484572a2091aa1d37095fef03b9792\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-63649c6dcb629dcb44b5b853f2dd6060\n+f8f98bd37593f14eccb0046a300a392b\n $dmbdicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n (ProductBC b, CanDeriveProductBC c b,\n Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -203,15 +203,15 @@\n <*>_N\n _N\n _N\n <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-0c28eb8b111f9de4f202517897201c96\n+152f848037c6dff62f9c95f574bc1863\n $fGProductBCkkc:*::*: ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (lx :: * -> *)\n (ld :: k2 -> *) (rx :: * -> *) (rd :: k2 -> *).\n (GProductBC c lx ld, GProductBC c rx rd) =>\n GProductBC c (lx GHC.Generics.:*: rx) (ld GHC.Generics.:*: rd)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -230,15 +230,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:GProductBC[0]\n _N\n _N\n _N\n _N\n _N))]\n-28e5d193c74473e2be00cfd6260f1389\n+35c5497988b8b6c2a609a7a2657a6b7e\n $fGProductBCkkc:*::*:_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (lx :: * -> *)\n (ld :: k2 -> *) (rx :: * -> *) (rd :: k2 -> *) (x :: k2).\n (GProductBC c lx ld, GProductBC c rx rd,\n Barbies.Generics.Constraints.GAll 0 c (lx GHC.Generics.:*: rx)) =>\n (GHC.Generics.:*:) ld rd x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -280,15 +280,15 @@\n (GHC.Classes.$p1(%,%)\n @(Barbies.Generics.Constraints.GAll 0 c lx)\n @(Barbies.Generics.Constraints.GAll 0 c rx)\n irred\n `cast`\n (Sub (Barbies.Generics.Constraints.D:R:GAllknc:*:[0]\n _N <0>_N _N _N _N))))]\n-206cf9fed92c5f2e58a86d24e980048d\n+18ec68691504e3f17fa266e94fb69cf5\n $fGProductBCkkcM1M1 ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (repbx :: * -> *)\n (repbd :: k2 -> *) i (k3 :: GHC.Generics.Meta).\n GProductBC c repbx repbd =>\n GProductBC\n c (GHC.Generics.M1 i k3 repbx) (GHC.Generics.M1 i k3 repbd)\n DFunId\n@@ -304,15 +304,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:GProductBC[0]\n _N\n _N\n _N\n _N\n _N))]\n-381f6589bdd75fb0f6d5156af5450ad3\n+2590c2421b9d963554874d6e99bb81bb\n $fGProductBCkkcM1M1_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (repbx :: * -> *)\n (repbd :: k2 -> *) i (k3 :: GHC.Generics.Meta) (x :: k2).\n (GProductBC c repbx repbd,\n Barbies.Generics.Constraints.GAll\n 0 c (GHC.Generics.M1 i k3 repbx)) =>\n GHC.Generics.M1 i k3 repbd x\n@@ -337,15 +337,15 @@\n Sub (Sym (Barbies.Generics.Constraints.D:R:GAllk1ncM1[0]\n _N <0>_N _N _N _N _N))\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-9101166e4f91ae39faa31c39f54786b0\n+ecb6e4d4b50cec14e32b8a122a0206df\n $fGProductBCkkcOtherRec ::\n forall k1 k2 (b :: (k1 -> *) -> *)\n (c :: k1 -> GHC.Types.Constraint) (b' :: (k1 -> *) -> *).\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b) =>\n GProductBC\n c\n (Barbies.Generics.Constraints.Other\n@@ -394,15 +394,15 @@\n _N\n _N\n _N))]\n-498c08f4b991fcb01ed4954c178c66f4\n+7696c4e30b83a20ddc4372b74b1a7815\n $fGProductBCkkcOtherRec1 ::\n forall {k1} {k2} {b :: (k1 -> *) -> *}\n {c :: k1 -> GHC.Types.Constraint} {b' :: (k1 -> *) -> *} {x :: k2}.\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -424,15 +424,15 @@\n (irred1['GHC.Types.Many] :: Barbies.Generics.Constraints.GAll\n 0\n c\n (Barbies.Generics.Constraints.Other\n (b' (P0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))) ->\n bdicts @k @b $dProductBC @c irred]\n-cc21bf387088a02919d247df422ec88b\n+5549f67e4c5b39b493439316c2c698cf\n $fGProductBCkkcRecRec ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (a :: k1)\n (a_or_pma :: k1).\n c a =>\n GProductBC\n c\n (Data.Generics.GenericN.Rec\n@@ -456,15 +456,15 @@\n _N\n _N\n _N))]\n-e3378b56e7958227c3df57e59a764af1\n+82fd2d6f3cf46f4ec35df188d5fe4b5c\n $fGProductBCkkcRecRec_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (a :: k1)\n (a_or_pma :: k1) (x :: k2).\n (c a,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -513,15 +513,15 @@\n _N\n _P) _N _N)]\n-ea631d36459bb073ab3a6ea07e9ae6a9\n+797384cbc2ea08611e74d5ff6c9a47c7\n $fGProductBCkkcSelfRec ::\n forall k1 k2 (b :: (k1 -> *) -> *)\n (c :: k1 -> GHC.Types.Constraint) (b' :: (k1 -> *) -> *).\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b) =>\n GProductBC\n c\n (Barbies.Generics.Constraints.Self\n@@ -570,15 +570,15 @@\n _N\n _N\n _N))]\n-e50c108433c6b4c5e3684a175b9d7451\n+c774a5cdefc9b770670260d79d065636\n $fGProductBCkkcSelfRec1 ::\n forall {k1} {k2} {b :: (k1 -> *) -> *}\n {c :: k1 -> GHC.Types.Constraint} {b' :: (k1 -> *) -> *} {x :: k2}.\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -600,15 +600,15 @@\n (irred1['GHC.Types.Many] :: Barbies.Generics.Constraints.GAll\n 0\n c\n (Barbies.Generics.Constraints.Self\n (b' (P0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))) ->\n bdicts @k @b $dProductBC @c irred]\n-fcae8586c7d2270cef39bff39d082664\n+9077337bd9793d1681b4cdd24c5ac7d3\n $fGProductBCkkcU1U1 ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint).\n GProductBC c GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -620,15 +620,15 @@\n 0 c GHC.Generics.U1) ->\n GHC.Generics.U1 @k1 @x)\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (c :: GHC.Types.Constraint>_N).\n Sym (N:GProductBC[0]\n _N _N _N _N _N))]\n-352148e5e8bcb813d46180d432805566\n+204dea07316ae9c9eee455a5f310a801\n $fProductBCkBarbie ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n ProductBC (Barbies.Internal.Wrappers.Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -644,15 +644,15 @@\n (bdicts @k @b v)\n `cast`\n (forall (c :: GHC.Types.Constraint>_N).\n Sub (Sym (Barbies.Internal.Wrappers.D:R:AllBkcBarbie[0]\n _N _N _N))\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.Wrappers.N:Barbie[0]\n _N _R) _N)]\n-1e3d79339830a2a250792d3ab938e40e\n+c3d4d8ba4e40204a9451e6822bf4f13c\n $fProductBCkBarbie_$cp1ProductBC ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n Barbies.Internal.ConstraintsB.ConstraintsB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -660,15 +660,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductBC['GHC.Types.Many] :: ProductBC b) ->\n Barbies.Internal.Wrappers.$fConstraintsBkBarbie\n @k\n @b\n ($p1ProductBC @k @b $dProductBC)]\n-12f8257fc555099310e3d43cd49f6539\n+2c30eb0473e68fbc08584499d65a19be\n $fProductBCkBarbie_$cp2ProductBC ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n Data.Barbie.Internal.Product.ProductB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -677,15 +677,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductBC['GHC.Types.Many] :: ProductBC b) ->\n Data.Barbie.Internal.Product.$fProductBkBarbie\n @k\n @b\n ($p2ProductBC @k @b $dProductBC)]\n-7d8bd29c25f9faf548c433e2481b9e11\n+1519fdd9456adf4b946f1928327c2d6c\n $fProductBCkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n ProductBC (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -697,15 +697,15 @@\n (v['GHC.Types.Many] :: ProductBC a)\n (v1['GHC.Types.Many] :: ProductBC b).\n @k\n @(Data.Functor.Product.Product a b)\n ($fProductBCkProduct_$cp1ProductBC @k @a @b v v1)\n ($fProductBCkProduct_$cp2ProductBC @k @a @b v v1)\n ($fProductBCkProduct_$cbdicts @k @a @b v v1)]\n-890c7e07e05853d89be766334b239fb4\n+01f2286581ec1ae6d3a0898164ab7d10\n $fProductBCkProduct_$cbdicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n (ProductBC a, ProductBC b,\n Barbies.Internal.ConstraintsB.AllB\n c (Data.Functor.Product.Product a b)) =>\n Data.Functor.Product.Product a b (Barbies.Internal.Dicts.Dict c)\n@@ -747,15 +747,15 @@\n (GHC.Classes.$p1(%,%)\n @(Barbies.Internal.ConstraintsB.AllB c a)\n @(Barbies.Internal.ConstraintsB.AllB c b)\n irred\n `cast`\n (Sub (Barbies.Internal.ConstraintsB.D:R:AllBkcProduct[0]\n _N _N _N _N))))]\n-ab7ab5fecc8a6d28d1239336760d6b51\n+9da85927c864fb071d72787f1c5d03d3\n $fProductBCkProduct_$cp1ProductBC ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n Barbies.Internal.ConstraintsB.ConstraintsB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -768,15 +768,15 @@\n ($dProductBC1['GHC.Types.Many] :: ProductBC b) ->\n Barbies.Internal.ConstraintsB.$fConstraintsBkProduct\n @k\n @a\n @b\n ($p1ProductBC @k @a $dProductBC)\n ($p1ProductBC @k @b $dProductBC1)]\n-f9f7d03d678921dc7946abac9cfe1dcf\n+babffa1aae5afdc3915098fa7d43ec0d\n $fProductBCkProduct_$cp2ProductBC ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n Data.Barbie.Internal.Product.ProductB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -789,166 +789,166 @@\n ($dProductBC1['GHC.Types.Many] :: ProductBC b) ->\n Data.Barbie.Internal.Product.$fProductBkProduct\n @k\n @a\n @b\n ($p2ProductBC @k @a $dProductBC)\n ($p2ProductBC @k @b $dProductBC1)]\n-da62da61432d23fef535d35f22eb8512\n+defba0d8e606dee3be80edbdfa4b8ec8\n $fProductBCkProxy :: ProductBC Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ProductBC], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.ConstraintsB.$fConstraintsBkProxy @k)\n (Data.Barbie.Internal.Product.$fProductBkProxy @k)\n (\\ @c :: k -> GHC.Types.Constraint\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllB\n c Data.Proxy.Proxy) ->\n Data.Proxy.Proxy @(k -> *) @(Barbies.Internal.Dicts.Dict c))]\n-bb541b81a2b50c897d0bf6fb8751e29c\n+acfe0897420ee0fc28648a802c339218\n $fProductBCkUnit :: ProductBC Barbies.Internal.Trivial.Unit\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:ProductBC],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Barbies.Internal.Trivial.Unit\n (Barbies.Internal.Trivial.$fConstraintsBkUnit @k)\n (Data.Barbie.Internal.Product.$fProductBkUnit @k)\n ($fProductBCkUnit_$cbdicts @k)]\n-ff64100c7a8c2288e399e84ffe51b0be\n+2b2a36076553b6241796dd86bae8cdab\n $fProductBCkUnit_$cbdicts ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB\n c Barbies.Internal.Trivial.Unit =>\n Barbies.Internal.Trivial.Unit (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllB\n c Barbies.Internal.Trivial.Unit) ->\n Barbies.Internal.Trivial.Unit @k @(Barbies.Internal.Dicts.Dict c)]\n-36fc3b6695f882e8d9ebecf09c028c3f\n+61aad8b07bfa6dffea61eb062c32d2df\n $tcGProductBC :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 358719258876205018#Word64\n- 14902744305322923390#Word64\n+ 17749737320706283794#Word64\n+ 7125474000560163475#Word64\n $trModule\n $tcGProductBC2\n 2#\n $tcGProductBC1]\n-c9095807c7408c5ee332b34f7b51ae26\n+30b224621b0f29bc972930e11a20da07\n $tcGProductBC1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8e2356d9832e8729b05a39101b0a79f5\n+b7138183d4ee25f6e8b30653134ea371\n $tcGProductBC2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGProductBC3]\n-a492b7431c7a8b81610001ad39df6b74\n+b63da4fd910950b2281484a490de23ef\n $tcGProductBC3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GProductBC\"#]\n-13df3db9baa995660116ed3a0c3f6f20\n+cb27c6b824e6ae4cfc4d2333003baae7\n $tcProductBC :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6190022483737620753#Word64\n- 13634340348264869686#Word64\n+ 14678023398112272288#Word64\n+ 14107705968917854123#Word64\n $trModule\n $tcProductBC2\n 1#\n $tcProductBC1]\n-f4e94c88f892e9932c29db3c4c7d608d\n+4ba1c18db373ace3e3be6ccbb5b5d595\n $tcProductBC1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-63e9f4d0237085b113c9f7af7c919607\n+52bc87c217e8f20de031932d70313c65\n $tcProductBC2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProductBC3]\n-8f566d8c4ec3619ee212d5e8d291f79a\n+db7d638d4f06af6c8c0c64db99bb0c94\n $tcProductBC3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ProductBC\"#]\n-693cf10882f166bd8b557f266353bbe3\n+ff41f475e2184bbee24f272162fb0540\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f81924760c1760816c71c5ff2c74656c\n+b1d808cd52a98118ca99d2ba06258af5\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-41bd1a9ab7ebb6bf12f3ee9da30a63b4\n+9e87af948156be29ca1fe3778c7c477d\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Internal.ProductC\"#]\n-56a4ef516dab9161a1d5134223518c24\n+f994d5062abea8be7f13de103b38cc76\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b093a32f2917829b1265662b845c4741\n+32e66ec646b3976a234fce1abead6841\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-19d2cdda68da209ec7e197796c16c4e2\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+c477b1822e3baec8c8ddb2af23a559db\n type CanDeriveProductBC :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> GHC.Types.Constraint\n type CanDeriveProductBC c b =\n (Data.Generics.GenericN.GenericN\n (b (Barbies.Internal.Dicts.Dict c)),\n Barbies.Internal.ConstraintsB.AllB c b\n GHC.Types.~ Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB b),\n GProductBC\n c\n (Barbies.Internal.ConstraintsB.GAllRepB b)\n (Data.Generics.GenericN.RepN (b (Barbies.Internal.Dicts.Dict c))))\n :: GHC.Types.Constraint\n-b1cf9f673b45f4f6ec99762cbd7e0986\n+cb7643e6ef8a89a2d9d32673511c0e82\n type GProductBC :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (* -> *) -> (k1 -> *) -> GHC.Types.Constraint\n class GProductBC c repbx repbd where\n gbdicts :: forall (x :: k1).\n Barbies.Generics.Constraints.GAll 0 c repbx =>\n repbd x\n {-# MINIMAL gbdicts #-}\n-ca8ea277d7c65c36558c64a3b5a35880\n+1bfcacd35f8e9409bb195eea36b3889d\n type P0 :: forall {k}. k -> k\n type P0 = Data.Generics.GenericN.Param 0 :: k -> k\n-c58b99c699e1fa541f90705ce32c39b3\n+f8e8eaeb84489eeb220b2cccc62df66f\n type ProductBC :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Data.Barbie.Internal.Product.ProductB b) =>\n ProductBC b where\n bdicts :: forall (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c b =>\n b (Barbies.Internal.Dicts.Dict c)\n default bdicts :: forall (c :: k -> GHC.Types.Constraint).\n (CanDeriveProductBC c b, Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n-8d32580765bacf1ff7dc4b6c05bb20a7\n+22feb6db698ef52ede0e06f7561f9c95\n buniqC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (b :: (k -> *) -> *).\n (Barbies.Internal.ConstraintsB.AllB c b, ProductBC b) =>\n (forall (a :: k). c a => f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -969,15 +969,15 @@\n @(Barbies.Internal.Dicts.Dict c)\n @f\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Barbies.Internal.Dicts.Dict c a) ->\n case ds of wild { Barbies.Internal.Dicts.Dict irred1 ->\n eta @a irred1 })\n (bdicts @k @b $dProductBC @c irred)]\n-03abca08a89537c3b3793c142a00ee68\n+cb07a6a90b1fb43743cc3e9354a83f87\n gbdictsDefault ::\n forall {k} (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n (CanDeriveProductBC c b, Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Data.Barbie.Internal.ProductC 9066\n- interface hash: 44da3df06575c887323112ebf8b75e45\n- ABI hash: a2b23089e22e79ae157fbefcef015b03\n- export-list hash: 9a4775015330edff9bebe0b60887a8d6\n+ interface hash: a19e61718236560ead4ed47f9f28218b\n+ ABI hash: cf9d556ca8964b51c64bc4f30f34ff8c\n+ export-list hash: c3f7320ee00fe37bf94725f93d942daa\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 36efccb710688bf8ac88b078b79027a7\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 272c6cfcf77d2a8065ca7a71d5c1e893\n sig of: Nothing\n@@ -20,22 +20,22 @@\n exports:\n buniqC\n gbdictsDefault\n Barbies.Generics.Constraints.GAll\n CanDeriveProductBC\n GProductBC{gbdicts}\n ProductBC{bdicts}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB\n Data.Barbie.Internal.Product GHC.Base GHC.Float Data.Orphans\n@@ -47,59 +47,59 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints dbe4a74ad57c80c8783d07b1647baa9b\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll aa7b4f673c4e9bfa97e7a1c50731e7fd\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- X 171ce71086eece1d472adc01f3a98af1\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- GAllRepB b55e3d91b41ad97ba9417bc021683df5\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts adc34e2df477586dd9e7c283171fce38\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict f6333333dc16a8bbdb60d52bf6811ce8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit a4df766290f2aea4bc82298ff16dbd46\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 52d12130ceef8cc06259aaff6bffc97c\n- exports: e9f95692d631be9bde87f12f2b5daec4\n- Barbie ad846fa82a9ea3484523abb45135d49c\n- Barbie 3a10e5ace6e79cdc719621acf28187af\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product ea5df7eb3236564b9b2df74ac1890984\n- exports: d02fbc0d5447bb390c9724a84345915e\n- ProductB 8c9d66253b43e8aba355b8274960ba2f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN dd9794ad08262cbac6264fbf714e582f\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- RepN 79432fe3f44356fd6ce61f174ca881b8\n- toN 8ce21d1707476a7e74b8595cb0973a3d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 0aa87421cc66b72ee5cd089f3a525bd7\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll 4c84a1c336cdb79298bdd95cd66df075\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ X ef8817b68c20d7aa4653a1809b97c873\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ GAllRepB 9dc63ee0afcec57e5fc2662b4e967df7\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 3d78de6277daf9b83804594f15881e1b\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 2d4b46c54446fba7bdfd2823fc5d2356\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit ae7009495dd3ca0664463506cc352eb5\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 129f75c5c4289ab45c84ba1048dff5f0\n+ exports: 7bbe89242a5db7bf6a1a319c99ea3bdc\n+ Barbie 4b28340ceb30302559d6087444c7ed2d\n+ Barbie 01d0899d14173451a813c232a74e39b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product c93ae87029f9fac303e0a83c615266bf\n+ exports: 21a109e654e4e470b1fcc905ea27f050\n+ ProductB 9ff7e490b88f3a8ab0f4040387f79ce5\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3c1929812fe1d66fe2228d4ff0e540ce\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ RepN 8d5e0c979f6a4fa85c9086cd1d4e7220\n+ toN 46484572a2091aa1d37095fef03b9792\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-63649c6dcb629dcb44b5b853f2dd6060\n+f8f98bd37593f14eccb0046a300a392b\n $dmbdicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n (ProductBC b, CanDeriveProductBC c b,\n Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -203,15 +203,15 @@\n <*>_N\n _N\n _N\n <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-0c28eb8b111f9de4f202517897201c96\n+152f848037c6dff62f9c95f574bc1863\n $fGProductBCkkc:*::*: ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (lx :: * -> *)\n (ld :: k2 -> *) (rx :: * -> *) (rd :: k2 -> *).\n (GProductBC c lx ld, GProductBC c rx rd) =>\n GProductBC c (lx GHC.Generics.:*: rx) (ld GHC.Generics.:*: rd)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -230,15 +230,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:GProductBC[0]\n _N\n _N\n _N\n _N\n _N))]\n-28e5d193c74473e2be00cfd6260f1389\n+35c5497988b8b6c2a609a7a2657a6b7e\n $fGProductBCkkc:*::*:_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (lx :: * -> *)\n (ld :: k2 -> *) (rx :: * -> *) (rd :: k2 -> *) (x :: k2).\n (GProductBC c lx ld, GProductBC c rx rd,\n Barbies.Generics.Constraints.GAll 0 c (lx GHC.Generics.:*: rx)) =>\n (GHC.Generics.:*:) ld rd x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -280,15 +280,15 @@\n (GHC.Classes.$p1(%,%)\n @(Barbies.Generics.Constraints.GAll 0 c lx)\n @(Barbies.Generics.Constraints.GAll 0 c rx)\n irred\n `cast`\n (Sub (Barbies.Generics.Constraints.D:R:GAllknc:*:[0]\n _N <0>_N _N _N _N))))]\n-206cf9fed92c5f2e58a86d24e980048d\n+18ec68691504e3f17fa266e94fb69cf5\n $fGProductBCkkcM1M1 ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (repbx :: * -> *)\n (repbd :: k2 -> *) i (k3 :: GHC.Generics.Meta).\n GProductBC c repbx repbd =>\n GProductBC\n c (GHC.Generics.M1 i k3 repbx) (GHC.Generics.M1 i k3 repbd)\n DFunId\n@@ -304,15 +304,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:GProductBC[0]\n _N\n _N\n _N\n _N\n _N))]\n-381f6589bdd75fb0f6d5156af5450ad3\n+2590c2421b9d963554874d6e99bb81bb\n $fGProductBCkkcM1M1_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (repbx :: * -> *)\n (repbd :: k2 -> *) i (k3 :: GHC.Generics.Meta) (x :: k2).\n (GProductBC c repbx repbd,\n Barbies.Generics.Constraints.GAll\n 0 c (GHC.Generics.M1 i k3 repbx)) =>\n GHC.Generics.M1 i k3 repbd x\n@@ -337,15 +337,15 @@\n Sub (Sym (Barbies.Generics.Constraints.D:R:GAllk1ncM1[0]\n _N <0>_N _N _N _N _N))\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-9101166e4f91ae39faa31c39f54786b0\n+ecb6e4d4b50cec14e32b8a122a0206df\n $fGProductBCkkcOtherRec ::\n forall k1 k2 (b :: (k1 -> *) -> *)\n (c :: k1 -> GHC.Types.Constraint) (b' :: (k1 -> *) -> *).\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b) =>\n GProductBC\n c\n (Barbies.Generics.Constraints.Other\n@@ -394,15 +394,15 @@\n _N\n _N\n _N))]\n-498c08f4b991fcb01ed4954c178c66f4\n+7696c4e30b83a20ddc4372b74b1a7815\n $fGProductBCkkcOtherRec1 ::\n forall {k1} {k2} {b :: (k1 -> *) -> *}\n {c :: k1 -> GHC.Types.Constraint} {b' :: (k1 -> *) -> *} {x :: k2}.\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -424,15 +424,15 @@\n (irred1['GHC.Types.Many] :: Barbies.Generics.Constraints.GAll\n 0\n c\n (Barbies.Generics.Constraints.Other\n (b' (P0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))) ->\n bdicts @k @b $dProductBC @c irred]\n-cc21bf387088a02919d247df422ec88b\n+5549f67e4c5b39b493439316c2c698cf\n $fGProductBCkkcRecRec ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (a :: k1)\n (a_or_pma :: k1).\n c a =>\n GProductBC\n c\n (Data.Generics.GenericN.Rec\n@@ -456,15 +456,15 @@\n _N\n _N\n _N))]\n-e3378b56e7958227c3df57e59a764af1\n+82fd2d6f3cf46f4ec35df188d5fe4b5c\n $fGProductBCkkcRecRec_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (a :: k1)\n (a_or_pma :: k1) (x :: k2).\n (c a,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -513,15 +513,15 @@\n _N\n _P) _N _N)]\n-ea631d36459bb073ab3a6ea07e9ae6a9\n+797384cbc2ea08611e74d5ff6c9a47c7\n $fGProductBCkkcSelfRec ::\n forall k1 k2 (b :: (k1 -> *) -> *)\n (c :: k1 -> GHC.Types.Constraint) (b' :: (k1 -> *) -> *).\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b) =>\n GProductBC\n c\n (Barbies.Generics.Constraints.Self\n@@ -570,15 +570,15 @@\n _N\n _N\n _N))]\n-e50c108433c6b4c5e3684a175b9d7451\n+c774a5cdefc9b770670260d79d065636\n $fGProductBCkkcSelfRec1 ::\n forall {k1} {k2} {b :: (k1 -> *) -> *}\n {c :: k1 -> GHC.Types.Constraint} {b' :: (k1 -> *) -> *} {x :: k2}.\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -600,15 +600,15 @@\n (irred1['GHC.Types.Many] :: Barbies.Generics.Constraints.GAll\n 0\n c\n (Barbies.Generics.Constraints.Self\n (b' (P0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))) ->\n bdicts @k @b $dProductBC @c irred]\n-fcae8586c7d2270cef39bff39d082664\n+9077337bd9793d1681b4cdd24c5ac7d3\n $fGProductBCkkcU1U1 ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint).\n GProductBC c GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -620,15 +620,15 @@\n 0 c GHC.Generics.U1) ->\n GHC.Generics.U1 @k1 @x)\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (c :: GHC.Types.Constraint>_N).\n Sym (N:GProductBC[0]\n _N _N _N _N _N))]\n-352148e5e8bcb813d46180d432805566\n+204dea07316ae9c9eee455a5f310a801\n $fProductBCkBarbie ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n ProductBC (Barbies.Internal.Wrappers.Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -644,15 +644,15 @@\n (bdicts @k @b v)\n `cast`\n (forall (c :: GHC.Types.Constraint>_N).\n Sub (Sym (Barbies.Internal.Wrappers.D:R:AllBkcBarbie[0]\n _N _N _N))\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.Wrappers.N:Barbie[0]\n _N _R) _N)]\n-1e3d79339830a2a250792d3ab938e40e\n+c3d4d8ba4e40204a9451e6822bf4f13c\n $fProductBCkBarbie_$cp1ProductBC ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n Barbies.Internal.ConstraintsB.ConstraintsB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -660,15 +660,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductBC['GHC.Types.Many] :: ProductBC b) ->\n Barbies.Internal.Wrappers.$fConstraintsBkBarbie\n @k\n @b\n ($p1ProductBC @k @b $dProductBC)]\n-12f8257fc555099310e3d43cd49f6539\n+2c30eb0473e68fbc08584499d65a19be\n $fProductBCkBarbie_$cp2ProductBC ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n Data.Barbie.Internal.Product.ProductB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -677,15 +677,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductBC['GHC.Types.Many] :: ProductBC b) ->\n Data.Barbie.Internal.Product.$fProductBkBarbie\n @k\n @b\n ($p2ProductBC @k @b $dProductBC)]\n-7d8bd29c25f9faf548c433e2481b9e11\n+1519fdd9456adf4b946f1928327c2d6c\n $fProductBCkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n ProductBC (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -697,15 +697,15 @@\n (v['GHC.Types.Many] :: ProductBC a)\n (v1['GHC.Types.Many] :: ProductBC b).\n @k\n @(Data.Functor.Product.Product a b)\n ($fProductBCkProduct_$cp1ProductBC @k @a @b v v1)\n ($fProductBCkProduct_$cp2ProductBC @k @a @b v v1)\n ($fProductBCkProduct_$cbdicts @k @a @b v v1)]\n-890c7e07e05853d89be766334b239fb4\n+01f2286581ec1ae6d3a0898164ab7d10\n $fProductBCkProduct_$cbdicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n (ProductBC a, ProductBC b,\n Barbies.Internal.ConstraintsB.AllB\n c (Data.Functor.Product.Product a b)) =>\n Data.Functor.Product.Product a b (Barbies.Internal.Dicts.Dict c)\n@@ -747,15 +747,15 @@\n (GHC.Classes.$p1(%,%)\n @(Barbies.Internal.ConstraintsB.AllB c a)\n @(Barbies.Internal.ConstraintsB.AllB c b)\n irred\n `cast`\n (Sub (Barbies.Internal.ConstraintsB.D:R:AllBkcProduct[0]\n _N _N _N _N))))]\n-ab7ab5fecc8a6d28d1239336760d6b51\n+9da85927c864fb071d72787f1c5d03d3\n $fProductBCkProduct_$cp1ProductBC ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n Barbies.Internal.ConstraintsB.ConstraintsB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -768,15 +768,15 @@\n ($dProductBC1['GHC.Types.Many] :: ProductBC b) ->\n Barbies.Internal.ConstraintsB.$fConstraintsBkProduct\n @k\n @a\n @b\n ($p1ProductBC @k @a $dProductBC)\n ($p1ProductBC @k @b $dProductBC1)]\n-f9f7d03d678921dc7946abac9cfe1dcf\n+babffa1aae5afdc3915098fa7d43ec0d\n $fProductBCkProduct_$cp2ProductBC ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n Data.Barbie.Internal.Product.ProductB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -789,166 +789,166 @@\n ($dProductBC1['GHC.Types.Many] :: ProductBC b) ->\n Data.Barbie.Internal.Product.$fProductBkProduct\n @k\n @a\n @b\n ($p2ProductBC @k @a $dProductBC)\n ($p2ProductBC @k @b $dProductBC1)]\n-da62da61432d23fef535d35f22eb8512\n+defba0d8e606dee3be80edbdfa4b8ec8\n $fProductBCkProxy :: ProductBC Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ProductBC], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.ConstraintsB.$fConstraintsBkProxy @k)\n (Data.Barbie.Internal.Product.$fProductBkProxy @k)\n (\\ @c :: k -> GHC.Types.Constraint\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllB\n c Data.Proxy.Proxy) ->\n Data.Proxy.Proxy @(k -> *) @(Barbies.Internal.Dicts.Dict c))]\n-bb541b81a2b50c897d0bf6fb8751e29c\n+acfe0897420ee0fc28648a802c339218\n $fProductBCkUnit :: ProductBC Barbies.Internal.Trivial.Unit\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:ProductBC],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Barbies.Internal.Trivial.Unit\n (Barbies.Internal.Trivial.$fConstraintsBkUnit @k)\n (Data.Barbie.Internal.Product.$fProductBkUnit @k)\n ($fProductBCkUnit_$cbdicts @k)]\n-ff64100c7a8c2288e399e84ffe51b0be\n+2b2a36076553b6241796dd86bae8cdab\n $fProductBCkUnit_$cbdicts ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB\n c Barbies.Internal.Trivial.Unit =>\n Barbies.Internal.Trivial.Unit (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllB\n c Barbies.Internal.Trivial.Unit) ->\n Barbies.Internal.Trivial.Unit @k @(Barbies.Internal.Dicts.Dict c)]\n-36fc3b6695f882e8d9ebecf09c028c3f\n+61aad8b07bfa6dffea61eb062c32d2df\n $tcGProductBC :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 358719258876205018#Word64\n- 14902744305322923390#Word64\n+ 17749737320706283794#Word64\n+ 7125474000560163475#Word64\n $trModule\n $tcGProductBC2\n 2#\n $tcGProductBC1]\n-c9095807c7408c5ee332b34f7b51ae26\n+30b224621b0f29bc972930e11a20da07\n $tcGProductBC1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8e2356d9832e8729b05a39101b0a79f5\n+b7138183d4ee25f6e8b30653134ea371\n $tcGProductBC2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGProductBC3]\n-a492b7431c7a8b81610001ad39df6b74\n+b63da4fd910950b2281484a490de23ef\n $tcGProductBC3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GProductBC\"#]\n-13df3db9baa995660116ed3a0c3f6f20\n+cb27c6b824e6ae4cfc4d2333003baae7\n $tcProductBC :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6190022483737620753#Word64\n- 13634340348264869686#Word64\n+ 14678023398112272288#Word64\n+ 14107705968917854123#Word64\n $trModule\n $tcProductBC2\n 1#\n $tcProductBC1]\n-f4e94c88f892e9932c29db3c4c7d608d\n+4ba1c18db373ace3e3be6ccbb5b5d595\n $tcProductBC1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-63e9f4d0237085b113c9f7af7c919607\n+52bc87c217e8f20de031932d70313c65\n $tcProductBC2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProductBC3]\n-8f566d8c4ec3619ee212d5e8d291f79a\n+db7d638d4f06af6c8c0c64db99bb0c94\n $tcProductBC3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ProductBC\"#]\n-693cf10882f166bd8b557f266353bbe3\n+ff41f475e2184bbee24f272162fb0540\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f81924760c1760816c71c5ff2c74656c\n+b1d808cd52a98118ca99d2ba06258af5\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-41bd1a9ab7ebb6bf12f3ee9da30a63b4\n+9e87af948156be29ca1fe3778c7c477d\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Internal.ProductC\"#]\n-56a4ef516dab9161a1d5134223518c24\n+f994d5062abea8be7f13de103b38cc76\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b093a32f2917829b1265662b845c4741\n+32e66ec646b3976a234fce1abead6841\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-19d2cdda68da209ec7e197796c16c4e2\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+c477b1822e3baec8c8ddb2af23a559db\n type CanDeriveProductBC :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> GHC.Types.Constraint\n type CanDeriveProductBC c b =\n (Data.Generics.GenericN.GenericN\n (b (Barbies.Internal.Dicts.Dict c)),\n Barbies.Internal.ConstraintsB.AllB c b\n GHC.Types.~ Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB b),\n GProductBC\n c\n (Barbies.Internal.ConstraintsB.GAllRepB b)\n (Data.Generics.GenericN.RepN (b (Barbies.Internal.Dicts.Dict c))))\n :: GHC.Types.Constraint\n-b1cf9f673b45f4f6ec99762cbd7e0986\n+cb7643e6ef8a89a2d9d32673511c0e82\n type GProductBC :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (* -> *) -> (k1 -> *) -> GHC.Types.Constraint\n class GProductBC c repbx repbd where\n gbdicts :: forall (x :: k1).\n Barbies.Generics.Constraints.GAll 0 c repbx =>\n repbd x\n {-# MINIMAL gbdicts #-}\n-ca8ea277d7c65c36558c64a3b5a35880\n+1bfcacd35f8e9409bb195eea36b3889d\n type P0 :: forall {k}. k -> k\n type P0 = Data.Generics.GenericN.Param 0 :: k -> k\n-c58b99c699e1fa541f90705ce32c39b3\n+f8e8eaeb84489eeb220b2cccc62df66f\n type ProductBC :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Data.Barbie.Internal.Product.ProductB b) =>\n ProductBC b where\n bdicts :: forall (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c b =>\n b (Barbies.Internal.Dicts.Dict c)\n default bdicts :: forall (c :: k -> GHC.Types.Constraint).\n (CanDeriveProductBC c b, Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n-8d32580765bacf1ff7dc4b6c05bb20a7\n+22feb6db698ef52ede0e06f7561f9c95\n buniqC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (b :: (k -> *) -> *).\n (Barbies.Internal.ConstraintsB.AllB c b, ProductBC b) =>\n (forall (a :: k). c a => f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -969,15 +969,15 @@\n @(Barbies.Internal.Dicts.Dict c)\n @f\n (\\ @a :: k\n (ds['GHC.Types.Many] :: Barbies.Internal.Dicts.Dict c a) ->\n case ds of wild { Barbies.Internal.Dicts.Dict irred1 ->\n eta @a irred1 })\n (bdicts @k @b $dProductBC @c irred)]\n-03abca08a89537c3b3793c142a00ee68\n+cb07a6a90b1fb43743cc3e9354a83f87\n gbdictsDefault ::\n forall {k} (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n (CanDeriveProductBC c b, Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.dyn_hi", "comments": ["Files 96% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Data.Barbie 9066\n- interface hash: 06fa9479813e44463e216a7c65fff1ab\n- ABI hash: 16dd81da61244be2a335326e76afb8a7\n- export-list hash: d148d8dcb7254ae5b5434f58255a1a32\n+ interface hash: 4eedd8f378401987876f396af9630b16\n+ ABI hash: a7054f5d024e4379c096f9a3cf44e039\n+ export-list hash: b2d737df6b9677fb4c19a61c946e4a9a\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: be5b1789a06c57e83254dd212f889ed3\n sig of: Nothing\n@@ -43,24 +43,24 @@\n Data.Barbie.Internal.Product.CanDeriveProductB\n Data.Barbie.Internal.Product.GProductB{Data.Barbie.Internal.Product.gbprod Data.Barbie.Internal.Product.gbuniq}\n Data.Barbie.Internal.Product.ProductB{Data.Barbie.Internal.Product.bprod Data.Barbie.Internal.Product.buniq}\n Data.Barbie.Internal.ProductC.CanDeriveProductBC\n Data.Barbie.Internal.ProductC.GProductBC{Data.Barbie.Internal.ProductC.gbdicts}\n Data.Barbie.Internal.ProductC.ProductBC{Data.Barbie.Internal.ProductC.bdicts}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Prod\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Prod\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB\n Data.Barbie.Internal.Product GHC.Base GHC.Float Data.Orphans\n@@ -72,109 +72,109 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- bunzip 55485ecb89cfc48f959276abf53138b6\n- bzip a2112f05775fc9da652845f2152de290\n- bzipWith f55c10be3a14621f3eb32055001f484a\n- bzipWith3 ecb23b1e853065db90edbdd50d45dde9\n- bzipWith4 f8e9dbf366e83e550bc95b7050373b03\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bmapC db85df6b606901c50eb2cf9fa02fe513\n- bmempty 53e6f64c7bc28a4b915067c36219b2d0\n- btraverseC 80acdd349185613ec3c8567595cc0fd3\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- bfoldMap ba0744e112b486ac5bb067fb062133f4\n- bsequence 57644dcc9c502afb44d0d9a91a1186c8\n- bsequence' 30b33daa89cf5b65bb7458cf798c9ced\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n- btraverse_ e32dfef4d81e493ba2e627342dd5a246\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit a4df766290f2aea4bc82298ff16dbd46\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n- Void 93784768def362ba0bea698b816d92eb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 52d12130ceef8cc06259aaff6bffc97c\n- exports: e9f95692d631be9bde87f12f2b5daec4\n- Barbie ad846fa82a9ea3484523abb45135d49c\n- Barbie 3a10e5ace6e79cdc719621acf28187af\n- getBarbie 9f0dbf2ac67c199c8ea1fa4011a70f53\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product ea5df7eb3236564b9b2df74ac1890984\n- exports: d02fbc0d5447bb390c9724a84345915e\n- CanDeriveProductB bc675e0bbae190e7f654d33450857fb5\n- GProductB 8f1af920d3af97901ec1ac098f74daba\n- ProductB 8c9d66253b43e8aba355b8274960ba2f\n- bprod 8c566c1887d4b84a6ec435f5b8430970\n- buniq ddbc49de58725fb17e13468ef6262c1e\n- gbprod 7460b6beee76faf82a1e561be1d94688\n- gbuniq d0b0bee6df1768d7cf85d723e34c7009\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC a2b23089e22e79ae157fbefcef015b03\n- exports: 9a4775015330edff9bebe0b60887a8d6\n- CanDeriveProductBC 19d2cdda68da209ec7e197796c16c4e2\n- GProductBC b1cf9f673b45f4f6ec99762cbd7e0986\n- ProductBC c58b99c699e1fa541f90705ce32c39b3\n- bdicts c7e7b39dedaca247a7b57b59da0e57c9\n- buniqC 8d32580765bacf1ff7dc4b6c05bb20a7\n- gbdicts 8175cf75118e6f2da63e8df2c4b5a31f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Prod 8d47f16d8893d87069072e388a9ef386\n- exports: 44e655eaed14db1b6bce59ab0030a93c\n- Cons 5fa8aa12acf8c50978bcedc1def15f38\n- Prod 46923a6801bbd445e7f64b45bc2641db\n- Unit 954870f5e4fb7b14f642adc0d8fed081\n- oneTuple 3db31f80980168074f72230541dcdcbf\n- prod ce6744d0fed199a0f3297258e8b39d71\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ bunzip 08f36433607586faeeb884eb3863272f\n+ bzip d545e7ab39c9242dfddedef227364f2d\n+ bzipWith b39181fa2c8191904967f5c9a9668fe9\n+ bzipWith3 c2cd418448529a1101125fdb0fb6eef0\n+ bzipWith4 33f99fb454403138b2a6640eefc7441c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bmapC 2020c065122bd3f1f12315231be4e0c6\n+ bmempty 5c59e57da5376bae689346ccc423cf4e\n+ btraverseC 0b49e1066dbdac58719d2a9c9f587340\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ bfoldMap ba02d28d2b8fc3ffd9509b200aa5e6f6\n+ bsequence 0be226e18f12ee247518b7894bf538e9\n+ bsequence' fcd7d4640f70ae8c757c15d22c814b1b\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+ btraverse_ d496d9ee3a909d4d1048e12257d6f3b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit ae7009495dd3ca0664463506cc352eb5\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+ Void e576c7f3bd180bf081dbb2756313ea69\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 129f75c5c4289ab45c84ba1048dff5f0\n+ exports: 7bbe89242a5db7bf6a1a319c99ea3bdc\n+ Barbie 4b28340ceb30302559d6087444c7ed2d\n+ Barbie 01d0899d14173451a813c232a74e39b9\n+ getBarbie f4344a48cfdb2980e9b32c87ad521a99\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product c93ae87029f9fac303e0a83c615266bf\n+ exports: 21a109e654e4e470b1fcc905ea27f050\n+ CanDeriveProductB 4926d6901d7dc38a47d54fcfd916a154\n+ GProductB b60d7e8eb96dbb0278977b59f36bc27b\n+ ProductB 9ff7e490b88f3a8ab0f4040387f79ce5\n+ bprod b6afa2675aceed377b326b2ef3f9e9b6\n+ buniq 062c23cd39edb438ab08d1fcc14544b5\n+ gbprod 5efb34b7a1f0074cafd4bc722ebbd608\n+ gbuniq d8cc128e7ae01c2b2d180be76666863a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC cf9d556ca8964b51c64bc4f30f34ff8c\n+ exports: c3f7320ee00fe37bf94725f93d942daa\n+ CanDeriveProductBC c477b1822e3baec8c8ddb2af23a559db\n+ GProductBC cb7643e6ef8a89a2d9d32673511c0e82\n+ ProductBC f8e8eaeb84489eeb220b2cccc62df66f\n+ bdicts 8765110d2eecbc1589b400e4f4167ec2\n+ buniqC 22feb6db698ef52ede0e06f7561f9c95\n+ gbdicts 4c007bfc46619d041e292f44f8e4ce8e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Prod edb93e6f86ca660eabf4105b6e8cd5cd\n+ exports: d97a11b09cefc2c69fafc6efc9af992b\n+ Cons 32ea6779cc7bdf3089a5d8e8eddb9abd\n+ Prod 72871df9eab61fc1dcceb25a27d59350\n+ Unit f8f34641358cb09bf8b4c2ba0ef3bf82\n+ oneTuple dccad5e79060be1077ae216131d87662\n+ prod 783ee96f7bfd3c24f11aaa471e0ddbde\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n fixities infixr 4 /*, infixr 4 /*/\n-4ad1bb931e91833247afe8e888b033d3\n+5989f7e354528710027ec00cb4b696b6\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-bdb90fe3370f0468e5621d78db6cbd15\n+70b3e593a736396988ffc106521e8006\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4f6bfec93a652fafb0dd7b79df035554\n+08200cfb6b7a457241ce714bf1b85b79\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie\"#]\n-f7efbc111f784ec50ac2e7cc3d3a3a5a\n+a953f70c9264224b6bbdc3a58d6e0a08\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-aa9e5b0633fa1c6845a922aaa675a36b\n+5b6bc81ea0f8ca992ee5817ae2f84533\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-dcc23a6a8d230bba6b6f611ba3b88565\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+dd234606797a2e1e8aa3f64825cdfb64\n (/*) ::\n Data.Barbie.Internal.Product.ProductB b =>\n b f\n -> b (Data.Functor.Prod.Prod fs)\n -> b (Data.Functor.Prod.Prod (f : fs))\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -199,15 +199,15 @@\n @(*)\n @b\n $dProductB\n @f\n @(Data.Functor.Prod.Prod fs)\n eta\n eta1)]\n-68f58417e9849c567dd15e9e08c9f394\n+31683ad89f03062934f6a9c83b1ec92b\n (/*/) ::\n Data.Barbie.Internal.Product.ProductB b =>\n b f -> b g -> b (Data.Functor.Prod.Prod '[f, g])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -230,15 +230,15 @@\n @(*)\n @b\n $dProductB\n @f\n @g\n eta\n eta1)]\n-3e9a45ed4f97a9cedc72ad8770033644\n+61c0bbec30da61595990fb59a5265cd0\n /*/1 ::\n Data.Functor.Product.Product f g a\n -> Data.Functor.Prod.Prod '[f, g] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(L,L)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @f :: * -> *\n@@ -259,15 +259,15 @@\n @'[g]\n @a\n @g\n @'[]\n @~<'[g]>_N\n g1\n (Data.Functor.Prod.$WUnit @(*) @a)) }]\n-81e8fbc4e84d7abc832c234e2d05c098\n+a3bdc3575c00e66b1da0e04f748ac87b\n /*1 ::\n Data.Functor.Product.Product f (Data.Functor.Prod.Prod fs) a\n -> Data.Functor.Prod.Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(L,ML)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @fs :: [* -> *]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.hi", "comments": ["Files 93% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Data.Barbie 9066\n- interface hash: 06fa9479813e44463e216a7c65fff1ab\n- ABI hash: 16dd81da61244be2a335326e76afb8a7\n- export-list hash: d148d8dcb7254ae5b5434f58255a1a32\n+ interface hash: 4eedd8f378401987876f396af9630b16\n+ ABI hash: a7054f5d024e4379c096f9a3cf44e039\n+ export-list hash: b2d737df6b9677fb4c19a61c946e4a9a\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: be5b1789a06c57e83254dd212f889ed3\n sig of: Nothing\n@@ -43,24 +43,24 @@\n Data.Barbie.Internal.Product.CanDeriveProductB\n Data.Barbie.Internal.Product.GProductB{Data.Barbie.Internal.Product.gbprod Data.Barbie.Internal.Product.gbuniq}\n Data.Barbie.Internal.Product.ProductB{Data.Barbie.Internal.Product.bprod Data.Barbie.Internal.Product.buniq}\n Data.Barbie.Internal.ProductC.CanDeriveProductBC\n Data.Barbie.Internal.ProductC.GProductBC{Data.Barbie.Internal.ProductC.gbdicts}\n Data.Barbie.Internal.ProductC.ProductBC{Data.Barbie.Internal.ProductC.bdicts}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Prod\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Prod\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB\n Data.Barbie.Internal.Product GHC.Base GHC.Float Data.Orphans\n@@ -72,109 +72,109 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- bunzip 55485ecb89cfc48f959276abf53138b6\n- bzip a2112f05775fc9da652845f2152de290\n- bzipWith f55c10be3a14621f3eb32055001f484a\n- bzipWith3 ecb23b1e853065db90edbdd50d45dde9\n- bzipWith4 f8e9dbf366e83e550bc95b7050373b03\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bmapC db85df6b606901c50eb2cf9fa02fe513\n- bmempty 53e6f64c7bc28a4b915067c36219b2d0\n- btraverseC 80acdd349185613ec3c8567595cc0fd3\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- bfoldMap ba0744e112b486ac5bb067fb062133f4\n- bsequence 57644dcc9c502afb44d0d9a91a1186c8\n- bsequence' 30b33daa89cf5b65bb7458cf798c9ced\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n- btraverse_ e32dfef4d81e493ba2e627342dd5a246\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial dd747dcfe7ff87b1d46d8d101191449f\n- exports: baf2c8a919692df873f6c7df3d5cc35e\n- Unit a4df766290f2aea4bc82298ff16dbd46\n- Unit c80693ce02b344afc7a6b8ed5ccdb0fa\n- Void 93784768def362ba0bea698b816d92eb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 52d12130ceef8cc06259aaff6bffc97c\n- exports: e9f95692d631be9bde87f12f2b5daec4\n- Barbie ad846fa82a9ea3484523abb45135d49c\n- Barbie 3a10e5ace6e79cdc719621acf28187af\n- getBarbie 9f0dbf2ac67c199c8ea1fa4011a70f53\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product ea5df7eb3236564b9b2df74ac1890984\n- exports: d02fbc0d5447bb390c9724a84345915e\n- CanDeriveProductB bc675e0bbae190e7f654d33450857fb5\n- GProductB 8f1af920d3af97901ec1ac098f74daba\n- ProductB 8c9d66253b43e8aba355b8274960ba2f\n- bprod 8c566c1887d4b84a6ec435f5b8430970\n- buniq ddbc49de58725fb17e13468ef6262c1e\n- gbprod 7460b6beee76faf82a1e561be1d94688\n- gbuniq d0b0bee6df1768d7cf85d723e34c7009\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC a2b23089e22e79ae157fbefcef015b03\n- exports: 9a4775015330edff9bebe0b60887a8d6\n- CanDeriveProductBC 19d2cdda68da209ec7e197796c16c4e2\n- GProductBC b1cf9f673b45f4f6ec99762cbd7e0986\n- ProductBC c58b99c699e1fa541f90705ce32c39b3\n- bdicts c7e7b39dedaca247a7b57b59da0e57c9\n- buniqC 8d32580765bacf1ff7dc4b6c05bb20a7\n- gbdicts 8175cf75118e6f2da63e8df2c4b5a31f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Prod 8d47f16d8893d87069072e388a9ef386\n- exports: 44e655eaed14db1b6bce59ab0030a93c\n- Cons 5fa8aa12acf8c50978bcedc1def15f38\n- Prod 46923a6801bbd445e7f64b45bc2641db\n- Unit 954870f5e4fb7b14f642adc0d8fed081\n- oneTuple 3db31f80980168074f72230541dcdcbf\n- prod ce6744d0fed199a0f3297258e8b39d71\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ bunzip 08f36433607586faeeb884eb3863272f\n+ bzip d545e7ab39c9242dfddedef227364f2d\n+ bzipWith b39181fa2c8191904967f5c9a9668fe9\n+ bzipWith3 c2cd418448529a1101125fdb0fb6eef0\n+ bzipWith4 33f99fb454403138b2a6640eefc7441c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bmapC 2020c065122bd3f1f12315231be4e0c6\n+ bmempty 5c59e57da5376bae689346ccc423cf4e\n+ btraverseC 0b49e1066dbdac58719d2a9c9f587340\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ bfoldMap ba02d28d2b8fc3ffd9509b200aa5e6f6\n+ bsequence 0be226e18f12ee247518b7894bf538e9\n+ bsequence' fcd7d4640f70ae8c757c15d22c814b1b\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+ btraverse_ d496d9ee3a909d4d1048e12257d6f3b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial cc604b21900f4c93d6c4235735d8eb0f\n+ exports: f2c7ec5793d0f2bb515387fd2fc2144e\n+ Unit ae7009495dd3ca0664463506cc352eb5\n+ Unit d4f1cf012aa14062f0601f6413e55372\n+ Void e576c7f3bd180bf081dbb2756313ea69\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 129f75c5c4289ab45c84ba1048dff5f0\n+ exports: 7bbe89242a5db7bf6a1a319c99ea3bdc\n+ Barbie 4b28340ceb30302559d6087444c7ed2d\n+ Barbie 01d0899d14173451a813c232a74e39b9\n+ getBarbie f4344a48cfdb2980e9b32c87ad521a99\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product c93ae87029f9fac303e0a83c615266bf\n+ exports: 21a109e654e4e470b1fcc905ea27f050\n+ CanDeriveProductB 4926d6901d7dc38a47d54fcfd916a154\n+ GProductB b60d7e8eb96dbb0278977b59f36bc27b\n+ ProductB 9ff7e490b88f3a8ab0f4040387f79ce5\n+ bprod b6afa2675aceed377b326b2ef3f9e9b6\n+ buniq 062c23cd39edb438ab08d1fcc14544b5\n+ gbprod 5efb34b7a1f0074cafd4bc722ebbd608\n+ gbuniq d8cc128e7ae01c2b2d180be76666863a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC cf9d556ca8964b51c64bc4f30f34ff8c\n+ exports: c3f7320ee00fe37bf94725f93d942daa\n+ CanDeriveProductBC c477b1822e3baec8c8ddb2af23a559db\n+ GProductBC cb7643e6ef8a89a2d9d32673511c0e82\n+ ProductBC f8e8eaeb84489eeb220b2cccc62df66f\n+ bdicts 8765110d2eecbc1589b400e4f4167ec2\n+ buniqC 22feb6db698ef52ede0e06f7561f9c95\n+ gbdicts 4c007bfc46619d041e292f44f8e4ce8e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Prod edb93e6f86ca660eabf4105b6e8cd5cd\n+ exports: d97a11b09cefc2c69fafc6efc9af992b\n+ Cons 32ea6779cc7bdf3089a5d8e8eddb9abd\n+ Prod 72871df9eab61fc1dcceb25a27d59350\n+ Unit f8f34641358cb09bf8b4c2ba0ef3bf82\n+ oneTuple dccad5e79060be1077ae216131d87662\n+ prod 783ee96f7bfd3c24f11aaa471e0ddbde\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n fixities infixr 4 /*, infixr 4 /*/\n-4ad1bb931e91833247afe8e888b033d3\n+5989f7e354528710027ec00cb4b696b6\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-bdb90fe3370f0468e5621d78db6cbd15\n+70b3e593a736396988ffc106521e8006\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4f6bfec93a652fafb0dd7b79df035554\n+08200cfb6b7a457241ce714bf1b85b79\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie\"#]\n-f7efbc111f784ec50ac2e7cc3d3a3a5a\n+a953f70c9264224b6bbdc3a58d6e0a08\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-aa9e5b0633fa1c6845a922aaa675a36b\n+5b6bc81ea0f8ca992ee5817ae2f84533\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-dcc23a6a8d230bba6b6f611ba3b88565\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+dd234606797a2e1e8aa3f64825cdfb64\n (/*) ::\n Data.Barbie.Internal.Product.ProductB b =>\n b f\n -> b (Data.Functor.Prod.Prod fs)\n -> b (Data.Functor.Prod.Prod (f : fs))\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -199,15 +199,15 @@\n @(*)\n @b\n $dProductB\n @f\n @(Data.Functor.Prod.Prod fs)\n eta\n eta1)]\n-68f58417e9849c567dd15e9e08c9f394\n+31683ad89f03062934f6a9c83b1ec92b\n (/*/) ::\n Data.Barbie.Internal.Product.ProductB b =>\n b f -> b g -> b (Data.Functor.Prod.Prod '[f, g])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -230,15 +230,15 @@\n @(*)\n @b\n $dProductB\n @f\n @g\n eta\n eta1)]\n-3e9a45ed4f97a9cedc72ad8770033644\n+61c0bbec30da61595990fb59a5265cd0\n /*/1 ::\n Data.Functor.Product.Product f g a\n -> Data.Functor.Prod.Prod '[f, g] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(L,L)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @f :: * -> *\n@@ -259,15 +259,15 @@\n @'[g]\n @a\n @g\n @'[]\n @~<'[g]>_N\n g1\n (Data.Functor.Prod.$WUnit @(*) @a)) }]\n-81e8fbc4e84d7abc832c234e2d05c098\n+a3bdc3575c00e66b1da0e04f748ac87b\n /*1 ::\n Data.Functor.Product.Product f (Data.Functor.Prod.Prod fs) a\n -> Data.Functor.Prod.Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(L,ML)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @fs :: [* -> *]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.hi", "comments": ["Files 80% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got dyn\n+ got \n interface Data.Functor.Barbie 9066\n- interface hash: fafdd5ccc7e3df720bc5d246e35a6943\n- ABI hash: 8580d8e7c5c9c44a5534809ebf1907d2\n- export-list hash: b2c90f3ed7344f6cbd155b29f58a4f5d\n+ interface hash: f043039d4bde03acaaa30c27b6837ea4\n+ ABI hash: dad1ef832afa2c721a22049834cc9dd4\n+ export-list hash: b3763818b9e315ec61a28b921995582d\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n+ flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a7aa8c351bd48d6391be317daa6f74bf\n sig of: Nothing\n used TH splices: False\n where\n@@ -43,20 +43,20 @@\n Barbies.Internal.ApplicativeB.ApplicativeB{Barbies.Internal.ApplicativeB.bprod Barbies.Internal.ApplicativeB.bpure}\n Barbies.Internal.ConstraintsB.AllBF\n Barbies.Internal.ConstraintsB.ConstraintsB{Barbies.Internal.ConstraintsB.AllB Barbies.Internal.ConstraintsB.baddDicts}\n Barbies.Internal.DistributiveB.DistributiveB{Barbies.Internal.DistributiveB.bdistribute}\n Barbies.Internal.FunctorB.FunctorB{Barbies.Internal.FunctorB.bmap}\n Barbies.Internal.TraversableB.TraversableB{Barbies.Internal.TraversableB.btraverse}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -66,88 +66,88 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n- bunzip 55485ecb89cfc48f959276abf53138b6\n- bzip a2112f05775fc9da652845f2152de290\n- bzipWith f55c10be3a14621f3eb32055001f484a\n- bzipWith3 ecb23b1e853065db90edbdd50d45dde9\n- bzipWith4 f8e9dbf366e83e550bc95b7050373b03\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bdicts 910fbbe9a576863e35439a6fbd62de33\n- bfoldMapC 8dc0380a9c23f3ae49fefd9813306c8e\n- bmapC db85df6b606901c50eb2cf9fa02fe513\n- bmempty 53e6f64c7bc28a4b915067c36219b2d0\n- bpureC 638f96823a12ae1193029411409e22a6\n- btraverseC 80acdd349185613ec3c8567595cc0fd3\n- bzipWith3C 8e34c659c77d116f60d8722f095357ca\n- bzipWith4C bf0725b1a4636d46c52c28c8c5295063\n- bzipWithC eda12aac3e3389d5a81c7e754849ef8d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- exports: 61e86516bb9242bfd66af8550d57db65\n- DistributiveB e01ed0fa1927b910f29b673ced05da93\n- bcotraverse 6a6e1ed60e51c8555cf9a3d04180b293\n- bdecompose 4525724422846199c152367c0cfc580e\n- bdistribute 5b40d11ac15b14f1ed4a3c11011331d8\n- bdistribute' acd335bf472873b0ccbb4826f56e568f\n- brecompose a55756af0f4a37162824111628b88eee\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- bfoldMap ba0744e112b486ac5bb067fb062133f4\n- bsequence 57644dcc9c502afb44d0d9a91a1186c8\n- bsequence' 30b33daa89cf5b65bb7458cf798c9ced\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n- btraverse_ e32dfef4d81e493ba2e627342dd5a246\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+ bunzip 08f36433607586faeeb884eb3863272f\n+ bzip d545e7ab39c9242dfddedef227364f2d\n+ bzipWith b39181fa2c8191904967f5c9a9668fe9\n+ bzipWith3 c2cd418448529a1101125fdb0fb6eef0\n+ bzipWith4 33f99fb454403138b2a6640eefc7441c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bdicts 971aaafe6ea6c47c3cae87482166403e\n+ bfoldMapC 47cc19f97daa118ea2596279457634d7\n+ bmapC 2020c065122bd3f1f12315231be4e0c6\n+ bmempty 5c59e57da5376bae689346ccc423cf4e\n+ bpureC 4b660f3c478e3d9f3986c04122be78b2\n+ btraverseC 0b49e1066dbdac58719d2a9c9f587340\n+ bzipWith3C 029a8b2682192e4edc5954fcfd7902a3\n+ bzipWith4C 652470126b5c74d71cd56b7b8e429e6a\n+ bzipWithC 276eaa225cc56ee73ef03069b7e3d2ce\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ exports: 1aecfa1521218373d8fc39d7c9313113\n+ DistributiveB b7a598d798980f56a6401cbf7835693e\n+ bcotraverse 9bef958942dc22bc4050762689da3a2f\n+ bdecompose 80a6df96155abf2f285527f8f93928ce\n+ bdistribute 61b5bf0b84e4754f2266e05a24600562\n+ bdistribute' 0f625c23ac3a31c75ea3489b08c4b087\n+ brecompose 465ed5a39f84a9aa1b689f8ef17beb6c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ bfoldMap ba02d28d2b8fc3ffd9509b200aa5e6f6\n+ bsequence 0be226e18f12ee247518b7894bf538e9\n+ bsequence' fcd7d4640f70ae8c757c15d22c814b1b\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+ btraverse_ d496d9ee3a909d4d1048e12257d6f3b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-65873122537c2ba57cc2b8d4dae76dfb\n+681805e536789381d8151f57ce937fd4\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2776e7abe605101a7a149d35badd9ed3\n+14e5ab0977132b50cbb52e9ab3df1bb7\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-6400a01644fdbf90a755c4458560116f\n+bf0ae37cb18471a8d83e7df10195f534\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Barbie\"#]\n-3aa1711702c227bb02b0e0e7cd543db4\n+14eff0f6b0b48853f03f3f252ab0e410\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-76734505e2524cdf94c4645cb12993f8\n+31bf146df172e8cf03988dcc816f6320\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.dyn_hi", "comments": ["Files 78% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,19 +1,19 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n- got \n+ got dyn\n interface Data.Functor.Barbie 9066\n- interface hash: fafdd5ccc7e3df720bc5d246e35a6943\n- ABI hash: 8580d8e7c5c9c44a5534809ebf1907d2\n- export-list hash: b2c90f3ed7344f6cbd155b29f58a4f5d\n+ interface hash: f043039d4bde03acaaa30c27b6837ea4\n+ ABI hash: dad1ef832afa2c721a22049834cc9dd4\n+ export-list hash: b3763818b9e315ec61a28b921995582d\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n- flag hash: f3ef90b23a8894f3c8a76d060589be75\n+ flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a7aa8c351bd48d6391be317daa6f74bf\n sig of: Nothing\n used TH splices: False\n where\n@@ -43,20 +43,20 @@\n Barbies.Internal.ApplicativeB.ApplicativeB{Barbies.Internal.ApplicativeB.bprod Barbies.Internal.ApplicativeB.bpure}\n Barbies.Internal.ConstraintsB.AllBF\n Barbies.Internal.ConstraintsB.ConstraintsB{Barbies.Internal.ConstraintsB.AllB Barbies.Internal.ConstraintsB.baddDicts}\n Barbies.Internal.DistributiveB.DistributiveB{Barbies.Internal.DistributiveB.bdistribute}\n Barbies.Internal.FunctorB.FunctorB{Barbies.Internal.FunctorB.bmap}\n Barbies.Internal.TraversableB.TraversableB{Barbies.Internal.TraversableB.btraverse}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -66,88 +66,88 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB e5cbf75378603efe606ed1f1840012d6\n- exports: e3a321ef54b6defc2ff4748a1a8a8e79\n- ApplicativeB da36390c3794afb8c2320e10e019f6a0\n- bprod c1806fc0849e6e48c2879e762e4fd5fb\n- bpure d8883fe8f1378838c6dcb611d4546400\n- bunzip 55485ecb89cfc48f959276abf53138b6\n- bzip a2112f05775fc9da652845f2152de290\n- bzipWith f55c10be3a14621f3eb32055001f484a\n- bzipWith3 ecb23b1e853065db90edbdd50d45dde9\n- bzipWith4 f8e9dbf366e83e550bc95b7050373b03\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB d5cf5b2e50a347a0b6a54eab76d6ad99\n- exports: 41dc42c9b5d65e5c886ca7692e13de47\n- AllB dc539ef76136c8d575dea50e31e90059\n- AllBF 2acd8b5cdd2cb99d4266e8a727833036\n- ConstraintsB 6740c2f85a112fac7087ebced670b2a1\n- baddDicts a5e9e30ddf0e3608c2ef615041d4fbc0\n- bdicts 910fbbe9a576863e35439a6fbd62de33\n- bfoldMapC 8dc0380a9c23f3ae49fefd9813306c8e\n- bmapC db85df6b606901c50eb2cf9fa02fe513\n- bmempty 53e6f64c7bc28a4b915067c36219b2d0\n- bpureC 638f96823a12ae1193029411409e22a6\n- btraverseC 80acdd349185613ec3c8567595cc0fd3\n- bzipWith3C 8e34c659c77d116f60d8722f095357ca\n- bzipWith4C bf0725b1a4636d46c52c28c8c5295063\n- bzipWithC eda12aac3e3389d5a81c7e754849ef8d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 756f71b11ce54e0a43610a99703c6dd7\n- exports: 61e86516bb9242bfd66af8550d57db65\n- DistributiveB e01ed0fa1927b910f29b673ced05da93\n- bcotraverse 6a6e1ed60e51c8555cf9a3d04180b293\n- bdecompose 4525724422846199c152367c0cfc580e\n- bdistribute 5b40d11ac15b14f1ed4a3c11011331d8\n- bdistribute' acd335bf472873b0ccbb4826f56e568f\n- brecompose a55756af0f4a37162824111628b88eee\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 6f344c88b12400bd2bfea8a8e586426a\n- exports: 545c393a098768048448270f22297261\n- FunctorB 5243ad59efb8b5fc90a7cb1d8dd41ef7\n- bmap 92b522c39c659763a8fde03d2a9eabe0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB 654d93e0e8e833b65be8b9e4ff4d2091\n- exports: 3805bf6b28252b86b750a944ab2fee9b\n- TraversableB f7c1abeec0b55a1c6a4832b0c59d2a24\n- bfoldMap ba0744e112b486ac5bb067fb062133f4\n- bsequence 57644dcc9c502afb44d0d9a91a1186c8\n- bsequence' 30b33daa89cf5b65bb7458cf798c9ced\n- btraverse 3914346e69deef9226dfee41d67f7ec8\n- btraverse_ e32dfef4d81e493ba2e627342dd5a246\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 5709ad0696978cf932c7a3d3d373a4b3\n+ exports: 132a656254f5cd59e5dc816b66e09234\n+ ApplicativeB 085305c56ddc98892210f57460e0a6ea\n+ bprod 0e50ad4be9813df5fea3549c1c680c9d\n+ bpure e2f42c0a4d7aec54d2930fc61360a117\n+ bunzip 08f36433607586faeeb884eb3863272f\n+ bzip d545e7ab39c9242dfddedef227364f2d\n+ bzipWith b39181fa2c8191904967f5c9a9668fe9\n+ bzipWith3 c2cd418448529a1101125fdb0fb6eef0\n+ bzipWith4 33f99fb454403138b2a6640eefc7441c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB 4ae0a3b1bcbf592d64b003f8812da757\n+ exports: caf62448a6f65d00f18d65dc1b92275e\n+ AllB 5fbaedee941804a360e7151df96bf499\n+ AllBF d3a68478c2f8bf7482b8ff9a93156c9c\n+ ConstraintsB d993e9a93ed2b624d6fc8e9a1a4c46b7\n+ baddDicts 91d7cac823cc11da66f573c51bc6f6ef\n+ bdicts 971aaafe6ea6c47c3cae87482166403e\n+ bfoldMapC 47cc19f97daa118ea2596279457634d7\n+ bmapC 2020c065122bd3f1f12315231be4e0c6\n+ bmempty 5c59e57da5376bae689346ccc423cf4e\n+ bpureC 4b660f3c478e3d9f3986c04122be78b2\n+ btraverseC 0b49e1066dbdac58719d2a9c9f587340\n+ bzipWith3C 029a8b2682192e4edc5954fcfd7902a3\n+ bzipWith4C 652470126b5c74d71cd56b7b8e429e6a\n+ bzipWithC 276eaa225cc56ee73ef03069b7e3d2ce\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 784ec817335692db89a46f566642924c\n+ exports: 1aecfa1521218373d8fc39d7c9313113\n+ DistributiveB b7a598d798980f56a6401cbf7835693e\n+ bcotraverse 9bef958942dc22bc4050762689da3a2f\n+ bdecompose 80a6df96155abf2f285527f8f93928ce\n+ bdistribute 61b5bf0b84e4754f2266e05a24600562\n+ bdistribute' 0f625c23ac3a31c75ea3489b08c4b087\n+ brecompose 465ed5a39f84a9aa1b689f8ef17beb6c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 3b87b985145cf4cf6a3a184955d35915\n+ exports: cfec8517d63c28d5560e18a6cfd1de67\n+ FunctorB e48089ffcc4207ade5600846f9e63036\n+ bmap a0f850aa9d28fc07873bdaacf3d0341e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB 368d3e0ab41a9522330792b522601b7c\n+ exports: ef1730ba79a439abadc8ee398aed68a3\n+ TraversableB 4b5878e11b020d69d6eb26a6f89795cc\n+ bfoldMap ba02d28d2b8fc3ffd9509b200aa5e6f6\n+ bsequence 0be226e18f12ee247518b7894bf538e9\n+ bsequence' fcd7d4640f70ae8c757c15d22c814b1b\n+ btraverse 58e9a3a707292ee59fd2c2438f0a127a\n+ btraverse_ d496d9ee3a909d4d1048e12257d6f3b9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-65873122537c2ba57cc2b8d4dae76dfb\n+681805e536789381d8151f57ce937fd4\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2776e7abe605101a7a149d35badd9ed3\n+14e5ab0977132b50cbb52e9ab3df1bb7\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-6400a01644fdbf90a755c4458560116f\n+bf0ae37cb18471a8d83e7df10195f534\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Barbie\"#]\n-3aa1711702c227bb02b0e0e7cd543db4\n+14eff0f6b0b48853f03f3f252ab0e410\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-76734505e2524cdf94c4645cb12993f8\n+31bf146df172e8cf03988dcc816f6320\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.dyn_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Data.Functor.Prod 9066\n- interface hash: 46f8a0d5c6c5d78b7bb57a6c058956f6\n- ABI hash: 8d47f16d8893d87069072e388a9ef386\n- export-list hash: 44e655eaed14db1b6bce59ab0030a93c\n+ interface hash: 9e8474f0b6f4c654f9a9999b58f256e2\n+ ABI hash: edb93e6f86ca660eabf4105b6e8cd5cd\n+ export-list hash: d97a11b09cefc2c69fafc6efc9af992b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 7d211b318ed65ce8f44bc08af94c1098\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 610d6ae8793d64642444a356c490f3f6\n sig of: Nothing\n@@ -46,15 +46,15 @@\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n import -/ GHC.Types 40ada155ed73681c14b0e90149f6df94\n-d2fd1c9756964a29b2ee94b3b2d3a8d1\n+9e5b604faf999f984c0010faa01877fa\n $fAlternativeProd ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n GHC.Base.Alternative (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -65,55 +65,55 @@\n (v1['GHC.Types.Many] :: GHC.Base.Alternative (Prod fs)).\n @(Prod (f : fs))\n ($fAlternativeProd_$cp1Alternative @f @fs v v1)\n ($fAlternativeProd_$cempty @f @fs v v1)\n ($fAlternativeProd_$c<|> @f @fs v v1)\n ($fAlternativeProd_$csome @f @fs v v1)\n ($fAlternativeProd_$cmany @f @fs v v1)]\n-d02581099c849866f55aa480524e8a96\n+fa429d594544ef712e8e060fd6a80cf7\n $fAlternativeProd0 :: GHC.Base.Alternative (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Alternative], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fApplicativeProd0\n ($WUnit @(*))\n $fAlternativeProd0_$c<|>\n $fAlternativeProd0_$csome\n $fAlternativeProd0_$csome]\n-13f5908478052ee580fec37db6f59384\n+df7680338eb427a0b502569ba37456d4\n $fAlternativeProd0_$c<|> :: Prod '[] a -> Prod '[] a -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n (ds['GHC.Types.Many] :: Prod '[] a)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds of wild { Unit co ->\n case ds1 of wild1 { Unit co1 -> $WUnit @(*) @a } }]\n-ff0e65bc81800fc3326131c448bf596b\n+dce3f3e15890b9f9fee5d62734f89d87\n $fAlternativeProd0_$csome :: Prod '[] a -> Prod '[] [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: b, CPR: b,\n Unfolding: Core: \n \\ @a (eta['GHC.Types.Many] :: Prod '[] a) ->\n letrec {\n some_v :: Prod '[] [a] [Strictness: b]\n = case eta of wild { Unit co -> some_v }\n } in\n some_v]\n-6329adb01fd614abfd3ace22bbfc44cd\n+25f9f30acf295953126da599d4028013\n $fAlternativeProd1 :: a -> [a] -> [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @a (ds['GHC.Types.Many] :: a) (ds1['GHC.Types.Many] :: [a]) ->\n GHC.Types.: @a ds ds1]\n-41f3c22637694426d2cc91dead1fc938\n+057c3a8dab52f1bdd80aeadf61f226ec\n $fAlternativeProd_$c<|> ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -141,15 +141,15 @@\n g `cast` (Sub (SelCo:Tc(1) (Sym co1)) _N))\n (GHC.Base.<|>\n @(Prod fs)\n $dAlternative1\n @a\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R\n gs `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-6471fe23deedd8d1b22e4f00f7813e72\n+fa90253c3ed2200f0af3a2ff8f29cb40\n $fAlternativeProd_$cempty ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -162,15 +162,15 @@\n @(f : fs)\n @a\n @f\n @fs\n @~_N\n (GHC.Base.empty @f $dAlternative @a)\n (GHC.Base.empty @(Prod fs) $dAlternative1 @a)]\n-cacde4105edec44237bc9dd83c22665a\n+8fbefc93d518e57219dc4ccbbecace18\n $fAlternativeProd_$cliftA2 ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n (a -> b -> c)\n -> Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n@@ -228,15 +228,15 @@\n (GHC.Base.<*>\n @(Prod fs)\n $dApplicative1\n @b\n @c\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) c>_N)_R\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-ea5cc9cccb5debbc5c10e89931d88159\n+c76c11cd66018a4318aea9108ddd9ad1\n $fAlternativeProd_$cmany ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -283,15 +283,15 @@\n @(Prod fs)\n $dAlternative1\n @[a]\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) <[a]>_N)_R\n (GHC.Base.pure @(Prod fs) $dApplicative @[a] (GHC.Types.[] @a))) }\n } in\n many_v]\n-6492e8474ca8ddbc4745194a2e5af1f4\n+22b7644fcc820ec3a80ce8657829f865\n $fAlternativeProd_$cp1Alternative ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n GHC.Base.Applicative (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -301,15 +301,15 @@\n ($dAlternative1['GHC.Types.Many] :: GHC.Base.Alternative\n (Prod fs)) ->\n $fApplicativeProd\n @f\n @fs\n (GHC.Base.$p1Alternative @f $dAlternative)\n (GHC.Base.$p1Alternative @(Prod fs) $dAlternative1)]\n-3baacf93c1323f6a2c9eff2e23203638\n+747352584abb6207422d7a2c399f09aa\n $fAlternativeProd_$csome ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -356,15 +356,15 @@\n @(Prod fs)\n $dAlternative1\n @[a]\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) <[a]>_N)_R\n (GHC.Base.pure @(Prod fs) $dApplicative @[a] (GHC.Types.[] @a))) })\n } in\n some_v]\n-b997f4e382374bd39c075e108939782e\n+314d4404ca633c8ec99a53b4e8b36164\n $fApplicativeProd ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n GHC.Base.Applicative (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -376,88 +376,88 @@\n @(Prod (f : fs))\n ($fApplicativeProd_$cp1Applicative @f @fs v v1)\n ($fApplicativeProd_$cpure @f @fs v v1)\n ($fApplicativeProd_$c<*> @f @fs v v1)\n ($fAlternativeProd_$cliftA2 @f @fs v v1)\n ($fApplicativeProd_$c*> @f @fs v v1)\n ($fApplicativeProd_$c<* @f @fs v v1)]\n-f69d0eaef85d2bd573083a5ccbcbf39e\n+d11faec4ca4e067a66222af646040f2a\n $fApplicativeProd0 :: GHC.Base.Applicative (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Applicative], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fFunctorProd0\n $fApplicativeProd0_$cpure\n $fApplicativeProd0_$c<*>\n $fApplicativeProd0_$cliftA2\n $fApplicativeProd0_$c*>\n $fApplicativeProd0_$c<*]\n-33f5901fec4a528e1eb494ddf21b0788\n+9cc97fda22e013683967150d38775350\n $fApplicativeProd0_$c*> :: Prod '[] a -> Prod '[] b -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] b) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> $WUnit @(*) @b } }]\n-4a2e24b42db02957c1d40c78d3c67fbc\n+44a251d9a818bf6433ac3a8d914e97e0\n $fApplicativeProd0_$c<* :: Prod '[] a -> Prod '[] b -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (eta1['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: Prod '[] b) ->\n case eta1 of wild { Unit co ->\n case eta of wild1 { Unit co1 -> $WUnit @(*) @a } }]\n-7f9d8b436c1275a9df6e8948dd40ca7b\n+216119fcf2d25984791bffeef7393760\n $fApplicativeProd0_$c<*> ::\n Prod '[] (a -> b) -> Prod '[] a -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (ds['GHC.Types.Many] :: Prod '[] (a -> b))\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds of wild { Unit co ->\n case ds1 of wild1 { Unit co1 -> $WUnit @(*) @b } }]\n-55f199bcf83653f621c3318b0674474f\n+4be90ac3927f3977af4c21cf7c84116d\n $fApplicativeProd0_$cliftA2 ::\n (a -> b -> c) -> Prod '[] a -> Prod '[] b -> Prod '[] c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n @c\n (eta['GHC.Types.Many] :: a -> b -> c)\n (eta1['GHC.Types.Many] :: Prod '[] a)\n (eta2['GHC.Types.Many] :: Prod '[] b) ->\n case eta1 of wild { Unit co ->\n case eta2 of wild1 { Unit co1 -> $WUnit @(*) @c } }]\n-f2d03e93c518ae12d9655d152b906d1e\n+adfafd399935fc76bf42eeccba70dae3\n $fApplicativeProd0_$cpure :: a -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (ds['GHC.Types.Many] :: a) -> $WUnit @(*) @a]\n-14852efd869d910610875b74edaede4c\n+8964c0af7ce9a43f005e692ebc663333\n $fApplicativeProd1 :: a -> b -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b @a (ds['GHC.Types.Many] :: a) -> GHC.Base.id @b]\n-3d4e348ea5b1d5aa90f23572adee0f73\n+9c844ab571f9df1093e4074f81d0950b\n $fApplicativeProd_$c*> ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -500,15 +500,15 @@\n @(Prod fs)\n (GHC.Base.$p1Applicative @(Prod fs) $dApplicative1)\n @a\n @(b -> b)\n ($fApplicativeProd1 @b @a)\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R)\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-9c6b8f987c83e71a3fc8f8558a73261c\n+af4b35e446ae837f0fc01dfcf15688de\n $fApplicativeProd_$c<* ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -522,15 +522,15 @@\n @fs\n $dApplicative\n $dApplicative1\n @a\n @b\n @a\n (GHC.Base.const @a @b)]\n-7fc39635cb6fc0e80a45f5a43afa2d15\n+2e153d96e8e3990ca8bae318c372ccd2\n $fApplicativeProd_$c<*> ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) (a -> b) -> Prod (f : fs) a -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -561,15 +561,15 @@\n (GHC.Base.<*>\n @(Prod fs)\n $dApplicative1\n @a\n @b\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) b>_N)_R\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-dd73fc4a106bfd43337f6b09ce313e89\n+cb047149d84b05af2ae0e4ffa3806f0e\n $fApplicativeProd_$cp1Applicative ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -579,15 +579,15 @@\n ($dApplicative1['GHC.Types.Many] :: GHC.Base.Applicative\n (Prod fs)) ->\n $fFunctorProd\n @f\n @fs\n (GHC.Base.$p1Applicative @f $dApplicative)\n (GHC.Base.$p1Applicative @(Prod fs) $dApplicative1)]\n-ba0d9a29dffdfa9980d4612bb430edf8\n+bb68754d97d8827522d362b222fb2675\n $fApplicativeProd_$cpure ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n a -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -602,15 +602,15 @@\n @(f : fs)\n @a\n @f\n @fs\n @~_N\n (GHC.Base.pure @f $dApplicative @a a1)\n (GHC.Base.pure @(Prod fs) $dApplicative1 @a a1)]\n-6dd69adcce3c61218ec7aa1af0711c65\n+a1dd5987beccf763a1af208d06cdb17c\n $fEq1Prod ::\n (Data.Functor.Classes.Eq1 f, Data.Functor.Classes.Eq1 (Prod fs)) =>\n Data.Functor.Classes.Eq1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -619,35 +619,35 @@\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: Data.Functor.Classes.Eq1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs)).\n @(Prod (f : fs))\n (\\ @a ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a) ->\n $fEqProd @f @a @fs v $dEq v1)\n ($fEq1Prod_$cliftEq @f @fs v v1)]\n-9370d8c58c16f2958fba21167c797359\n+4d2c63d7dab9a32e0e4699934e186152\n $fEq1Prod0 :: Data.Functor.Classes.Eq1 (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Eq1], Inline: CONLIKE,\n Unfolding: DFun:. @(Prod '[]) $fEqProd0 $fEq1Prod0_$cliftEq]\n-438ec1b6f47422dd779cce9d2575830b\n+23fda07af6dc5ed8bed088d43eb9f066\n $fEq1Prod0_$cliftEq ::\n (a -> b -> GHC.Types.Bool)\n -> Prod '[] a -> Prod '[] b -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 2,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b -> GHC.Types.Bool)\n (ds1['GHC.Types.Many] :: Prod '[] a)\n (ds2['GHC.Types.Many] :: Prod '[] b) ->\n case ds1 of wild { Unit co ->\n case ds2 of wild1 { Unit co1 -> GHC.Types.True } }]\n-6e10b4c6db834ec39995ee3ffae32009\n+3f660676da91732acf4ea101ad173244\n $fEq1Prod_$cliftEq ::\n (Data.Functor.Classes.Eq1 f, Data.Functor.Classes.Eq1 (Prod fs)) =>\n (a -> b -> GHC.Types.Bool)\n -> Prod (f : fs) a -> Prod (f : fs) b -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -687,15 +687,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-43ff39f0993415f8a586f2fc954ee895\n+6cf535b83250a530f96262560462b970\n $fEqProd ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n GHC.Classes.Eq (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -706,39 +706,39 @@\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: Data.Functor.Classes.Eq1 f)\n (v1['GHC.Types.Many] :: GHC.Classes.Eq a)\n (v2['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs)).\n @(Prod (f : fs) a)\n ($fEqProd_$c== @f @a @fs v v1 v2)\n ($fEqProd_$c/= @f @a @fs v v1 v2)]\n-c266d889a997fb68e60f0ed941b6ab54\n+9d907fd95f97d766fdc07255e10c6979\n $fEqProd0 :: GHC.Classes.Eq a => GHC.Classes.Eq (Prod '[] a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Classes.Eq a).\n @(Prod '[] a)\n (\\ (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> GHC.Types.True } })\n ($fEqProd0_$c/= @a v)]\n-86d3d480d2c796247409b334ff27a87c\n+7978c22d50c26e7867cf690528f5b0fd\n $fEqProd0_$c/= ::\n GHC.Classes.Eq a => Prod '[] a -> Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n \\ @a\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> GHC.Types.False } }]\n-aad81c946173d0e01751b5098db884d2\n+27fd6f940559c088c0c3ea20d6b19c8a\n $fEqProd_$c/= ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -751,15 +751,15 @@\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n ($dEq2['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs))\n (eta['GHC.Types.Many] :: Prod (f : fs) a)\n (eta1['GHC.Types.Many] :: Prod (f : fs) a) ->\n case $fEqProd_$c== @f @a @fs $dEq1 $dEq $dEq2 eta eta1 of wild {\n GHC.Types.False -> GHC.Types.True\n GHC.Types.True -> GHC.Types.False }]\n-8ec3a91b57e879a609b808fe8e9b496e\n+70c4b9ecaa95a9d1da9dab20d81807a1\n $fEqProd_$c== ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -801,15 +801,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-bfcb7958d9a8a9e77d014080c0649dd3\n+85575f0393e3257d05b2e23b457eeb64\n $fFoldableProd ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Data.Foldable.Foldable (Prod (f : fs))\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: CONLIKE,\n@@ -848,15 +848,15 @@\n ($fFoldableProd1 @f @fs v v1)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-5393a153cd897d447754507c4a0f4270\n+867d462d11a900de8c45de298120b4b5\n $fFoldableProd0 :: Data.Foldable.Foldable (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Foldable.C:Foldable], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n (\\ @m\n@@ -875,126 +875,126 @@\n $fFoldableProd0_$cnull\n $fFoldableProd0_$clength\n $fFoldableProd13\n $fFoldableProd0_$cmaximum\n $fFoldableProd0_$cminimum\n $fFoldableProd12\n $fFoldableProd11]\n-355aaececf7508647d44df73b85a14ac\n+f207818c3c93de324b34b97402b2ce9c\n $fFoldableProd0_$cfoldMap' ::\n GHC.Base.Monoid m => (a -> m) -> Prod '[] a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1L,A,A)>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @m\n @a\n ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid m)\n (eta['GHC.Types.Many] :: a -> m)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Base.mempty @m $dMonoid]\n-2715300049605b01223e1780ed749e9e\n+2929aefd9752ff8217b56ffc04be00ea\n $fFoldableProd0_$cfoldl :: (b -> a -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @b\n @a\n (eta['GHC.Types.Many] :: b -> a -> b)\n (eta1['GHC.Types.Many] :: b)\n (eta2['GHC.Types.Many] :: Prod '[] a) ->\n eta1]\n-bf33179345a11366fd8ef96705dff558\n+4a86f3e2d463a377064e43a54ce93285\n $fFoldableProd0_$cfoldl' :: (b -> a -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @b\n @a\n (f['GHC.Types.Many] :: b -> a -> b)\n (z0['GHC.Types.Many] :: b)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n z0]\n-2d614392730a859cceb436ca373f488d\n+c445b2092fe1d483c43b7cc522582a76\n $fFoldableProd0_$cfoldl1 :: (a -> a -> a) -> Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (f['GHC.Types.Many] :: a -> a -> a)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n $fFoldableProd14]\n-0a6c7d3fff9ba675e6afd0807a3d4864\n+719f5909da9f60f9702b17879fec5ee0\n $fFoldableProd0_$cfoldr :: (a -> b -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (f['GHC.Types.Many] :: a -> b -> b)\n (z['GHC.Types.Many] :: b)\n (t1['GHC.Types.Many] :: Prod '[] a) ->\n z]\n-2acc293bf731da6b9d899cccb9739b2c\n+e4a6425a70493d398490af226d0914bd\n $fFoldableProd0_$cfoldr1 :: (a -> a -> a) -> Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (f['GHC.Types.Many] :: a -> a -> a)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n $fFoldableProd16]\n-1591727ab229b813a359974a7183da34\n+1aa741a05c694b1959ba7ac9ca06e641\n $fFoldableProd0_$clength :: Prod '[] a -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (xs['GHC.Types.Many] :: Prod '[] a) -> $fFoldableProd4]\n-10fc8dfa3773d3c6d061e1100f258c90\n+9c74c99068f20a79943e2ca9f2eb9b5e\n $fFoldableProd0_$cmaximum :: GHC.Classes.Ord a => Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a)\n (eta['GHC.Types.Many] :: Prod '[] a)[OneShot] ->\n $w$cmaximum @a GHC.Prim.(##)]\n-85cf510a5bd7eb3f1336b2b9b818f9d1\n+e4c276c4a6a621dc76427c5f52cb46fa\n $fFoldableProd0_$cminimum :: GHC.Classes.Ord a => Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a)\n (eta['GHC.Types.Many] :: Prod '[] a)[OneShot] ->\n $w$cminimum @a GHC.Prim.(##)]\n-29c59c3873629bc4bdfc7d535b880248\n+96fafd1ad9f8976556c8c02c751fc29a\n $fFoldableProd0_$cnull :: Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 2,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (t1['GHC.Types.Many] :: Prod '[] a) -> GHC.Types.True]\n-769affa520f9e6770a820fb318aeb5b5\n+5e1feb3afa748286912f7071327ea099\n $fFoldableProd0_$ctoList :: Prod '[] a -> [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @a (t1['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Base.build\n @a\n (\\ @b\n (c['GHC.Types.Many] :: a -> b -> b)[OneShot]\n (n['GHC.Types.Many] :: b)[OneShot] ->\n n)]\n-69b29e34cf709f795dbc2e597f7a462f\n+765fe706e04a4fb01ae513edcbdcf033\n $fFoldableProd1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Num.Num a) =>\n Prod (f : fs) a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1014,73 +1014,73 @@\n @a\n (Data.Semigroup.Internal.$fMonoidProduct @a $dNum)\n (\\ (ds['GHC.Types.Many] :: a) -> ds)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Product[0]\n _R))]\n-ad24b9d4ac30d2c50640b17fbb8d4d75\n+7a6372e0a9d6e03916dba89989f787aa\n $fFoldableProd10 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual\n (Data.Semigroup.Internal.Endo (b -> b)))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @b ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo (b -> b))\n (Data.Semigroup.Internal.$fMonoidEndo @(b -> b))]\n-89d36385e10d4f5d924b90e4bd1640b3\n+cedd79bc640d88db2ceba030d761105a\n $fFoldableProd11 :: GHC.Num.Num a => Prod '[] a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,A,A,A,A,A,1C(1,L))>, Inline:,\n Unfolding: Core: StableUser <2,TrueTrue>\n \\ @a\n ($dNum['GHC.Types.Many] :: GHC.Num.Num a)\n (eta['GHC.Types.Many] :: Prod '[] a) ->\n Data.Semigroup.Internal.$fMonoidProduct1 @a $dNum]\n-42c00bfbbaf64624f904614eb84b6820\n+6db7715f3267c45d0926239d6abe2140\n $fFoldableProd12 :: GHC.Num.Num a => Prod '[] a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,A,A,A,A,A,1C(1,L))>, Inline:,\n Unfolding: Core: StableUser <2,TrueTrue>\n \\ @a\n ($dNum['GHC.Types.Many] :: GHC.Num.Num a)\n (eta['GHC.Types.Many] :: Prod '[] a) ->\n Data.Semigroup.Internal.$fMonoidSum1 @a $dNum]\n-f9d87cf560ac5b8530148e5f8bc9158b\n+3decceff816a13d9e7dc8c34201b29c5\n $fFoldableProd13 ::\n GHC.Classes.Eq a => a -> Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n (eta['GHC.Types.Many] :: a)\n (ds['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Types.False]\n-9f00bdabdfd557a90df2bad65da614fc\n+51ec32caffcafe7597f19776378746d8\n $fFoldableProd14 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fFoldableProd15]\n-4ab699c5ac50fe447440a7987f00ac88\n+59b361a663e88805ba2ef85570091c8a\n $fFoldableProd15 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"foldl1: empty structure\"#]\n-410adac3e3d87107a8f8d4979a3f6cda\n+e32b6e6033da1df547da2a1e120ce447\n $fFoldableProd16 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fFoldableProd17]\n-07818e51b50aed348fd6087f05dda326\n+5739d43836f5ced5902da684dc0ef4a1\n $fFoldableProd17 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"foldr1: empty structure\"#]\n-8a8b693e17b0290381c048d2bc343487\n+44cb7b7201b1b3c108c903f02ea08d0e\n $fFoldableProd2 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Num.Num a) =>\n Prod (f : fs) a -> Data.Semigroup.Internal.Sum a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1100,15 +1100,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidSum @a $dNum)\n (\\ (ds['GHC.Types.Many] :: a) -> ds)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Sum[0]\n _R))]\n-7c438b1e20419f602e10d632ca4b7e52\n+95f99c2213bedeaf7d797b23ffd89bc6\n $fFoldableProd3 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Eq a) =>\n a -> Prod (f : fs) a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n@@ -1151,62 +1151,62 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Any[0]))\n fas\n GHC.Types.True\n -> GHC.Types.True\n `cast`\n (Sym (Data.Semigroup.Internal.N:Any[0])) } }]\n-37e9309f30cb45328d558446a6daf322\n+a549b2161882e426e07e659a56e5c344\n $fFoldableProd4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-bfae15141012ec47c4a1e3edd96c59c9\n+e1f7d6a6051795d2b104411a70a4c58d\n $fFoldableProd5 ::\n a\n -> (GHC.Types.Int -> GHC.Types.Int)\n -> GHC.Types.Int\n -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)><1!P(L)>,\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @a\n (ds['GHC.Types.Many] :: a)\n (ds1['GHC.Types.Many] :: GHC.Types.Int -> GHC.Types.Int)\n (v['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case v of z { GHC.Types.I# ipv ->\n ds1 (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }]\n-14b3a2210c21d1e47b3e4e64162fdced\n+399f423a741887f8be30fd1fd27ca6bd\n $fFoldableProd6 :: a -> GHC.Types.Bool -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (ds['GHC.Types.Many] :: a)\n (ds1['GHC.Types.Many] :: GHC.Types.Bool) ->\n GHC.Types.False]\n-9495725131453ae9e7c4b89050543ce8\n+ac813c197874437c1bd8357625ba630a\n $fFoldableProd7 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-523abbb1357c93d65129c97baf25a784\n+92d0da61c41b14a6cdb188bd2a5ac594\n $fFoldableProd8 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual (Data.Semigroup.Internal.Endo b))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @b ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo b)\n (Data.Semigroup.Internal.$fMonoidEndo @b)]\n-b10ad345472c2f7de668d5abf15a2014\n+2f7220d401861305a7345264266bb6e6\n $fFoldableProd9 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-7a2daa71eb24c3fa6f403d580074d49f\n+52400307f6657f0905b41c5f0e1950d0\n $fFoldableProd_$cfold ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n Prod (f : fs) m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Inline: (sat-args=0),\n@@ -1222,15 +1222,15 @@\n @fs\n $dFoldable\n $dFoldable1\n @m\n @m\n $dMonoid\n (GHC.Base.id @m)]\n-9c7a6c18410b8b69f59de3e8d5b21445\n+1bad42d1c01dc31b88fef922777cc24f\n $fFoldableProd_$cfoldMap ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n (a -> m) -> Prod (f : fs) a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -1261,15 +1261,15 @@\n `cast`\n (Data.Foldable.Foldable (Prod <*>_N (SelCo:Tc(2) co))_N)_R\n @m\n @a\n $dMonoid\n f1\n fas) }]\n-e6f0e846083131ce27f102ba9d664984\n+9897affe8611cfc875edd507c7c0d4a3\n $fFoldableProd_$cfoldMap' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n (a -> m) -> Prod (f : fs) a -> m\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n@@ -1324,15 +1324,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n m>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m))\n (GHC.Base.mempty @m $dMonoid) }]\n-c81fead342660d96465ad3c1d8c7ec85\n+f8f387fc03fcea2da63b220a9a631ab0\n $fFoldableProd_$cfoldl ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (b -> a -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1378,15 +1378,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1) }]\n-e67c040fe7ae4af11fbe19a665b6352d\n+86afe4723a0280d0bc3fbfa44d5e24c3\n $fFoldableProd_$cfoldl' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (b -> a -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <4,FalseFalse>\n@@ -1435,15 +1435,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n b>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] b>_R)\n (GHC.Base.id @b))\n eta1 }]\n-41b9f905adcf3b7feb642ab8048848a1\n+33056f671e30dbc17c4bbb9e076ba24d\n $fFoldableProd_$cfoldl1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> a -> a) -> Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1505,15 +1505,15 @@\n _R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n (GHC.Maybe.Nothing @a)) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableProd7 @a GHC.Maybe.Just v -> v } }]\n-bed74a1e6b0ec6649d3c06f58913643a\n+866060a25988499dd9950a4c055cb694\n $fFoldableProd_$cfoldr ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> b -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1553,15 +1553,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n z) }]\n-966bc21e360f05be6894a34302550d54\n+a7174f510cee4f89446fb2d47f09b211\n $fFoldableProd_$cfoldr' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> b -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1616,15 +1616,15 @@\n b>_R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] b>_R))\n (GHC.Base.id @b))\n z0 }]\n-c9e7752608f923dcf22c91b580eea6ca\n+91a24477778e5bcd291cc5286c04c46d\n $fFoldableProd_$cfoldr1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> a -> a) -> Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1680,15 +1680,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a)) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableProd9 @a GHC.Maybe.Just v -> v } }]\n-0c69fe78bad62d3a571fc4737f5fdb9a\n+9c8b168dbf86d2a74e86dc1bdc408b0f\n $fFoldableProd_$clength ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> GHC.Types.Int\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1730,15 +1730,15 @@\n GHC.Types.Int>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int))\n $fFoldableProd4 }]\n-4abbbbc447849cf2869b793fb89ef1c1\n+094ae9182e95e0d6c7af50658dabc920\n $fFoldableProd_$cmaximum ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Ord a) =>\n Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1780,15 +1780,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Max[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Max[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-7af86c89dcdadae12687fd02ebd24462\n+86e2a903127a1ebaf8e6fe2a2e126249\n $fFoldableProd_$cminimum ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Ord a) =>\n Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1830,15 +1830,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Min[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Min[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-0ef7d28a63bdb1be5d07be845a2d4b58\n+1f96dee9c1b6b81212fa314a261dc1a7\n $fFoldableProd_$cnull ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> GHC.Types.Bool\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1875,15 +1875,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True) }]\n-185aac1c6c98e1e378803c57c75f2332\n+af8de4008f99eb32566d678c4db224c0\n $fFoldableProd_$ctoList ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> [a]\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -1904,57 +1904,57 @@\n $dFoldable\n $dFoldable1\n @a\n @b\n c\n n\n eta)]\n-5d2e63ce77f9188ebdf94a3bd8f35300\n+18f198a37ab610a3f8d0dde3bf7834a9\n $fFunctorProd ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: GHC.Base.Functor f)\n (v1['GHC.Types.Many] :: GHC.Base.Functor (Prod fs)).\n @(Prod (f : fs))\n ($fFunctorProd_$cfmap @f @fs v v1)\n ($fFunctorProd_$c<$ @f @fs v v1)]\n-e1fe0c10ead2c678d0f3f43dc96350fc\n+1c3b7dbd069b5284f1b8ff32f800351d\n $fFunctorProd0 :: GHC.Base.Functor (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Functor], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[]) $fFunctorProd0_$cfmap $fFunctorProd0_$c<$]\n-35b5ef16cbe85df775d864190017609a\n+9a9ede9301c0a4b28161fdf6e442967f\n $fFunctorProd0_$c<$ :: a -> Prod '[] b -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n (eta['GHC.Types.Many] :: a)\n (ds['GHC.Types.Many] :: Prod '[] b) ->\n case ds of wild { Unit co -> $WUnit @(*) @a }]\n-b20b2a557c3cd33480f5669b22e9b8be\n+155874005133452af3c6215c6b590a5a\n $fFunctorProd0_$cfmap :: (a -> b) -> Prod '[] a -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds1 of wild { Unit co -> $WUnit @(*) @b }]\n-1d7785d49c8dff8e008999971775e57e\n+014b20d58cf574724f554e6b632fe03b\n $fFunctorProd_$c<$ ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n a -> Prod (f : fs) b -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -1991,15 +1991,15 @@\n (GHC.Base.fmap\n @(Prod fs)\n $dFunctor1\n @b\n @a\n f2\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-3d9f0a6a736618a6f46129420b75208d\n+271bf5e9bb09d8ffdbe5238f7f99c683\n $fFunctorProd_$cfmap ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n (a -> b) -> Prod (f : fs) a -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2029,15 +2029,15 @@\n (GHC.Base.fmap\n @(Prod fs)\n $dFunctor1\n @a\n @b\n f1\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-1d91a558e7f9aedecd7e1a8c8fc4e726\n+7d9c2a120967dea7271a883bcc6ecbba\n $fOrd1Prod ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Data.Functor.Classes.Ord1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -2048,37 +2048,37 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Ord1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Ord1 (Prod fs)).\n @(Prod (f : fs))\n ($fOrd1Prod_$cp1Ord1 @f @fs v v1)\n (\\ @a ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a) ->\n $fOrdProd @f @a @fs v $dOrd v1)\n ($fOrd1Prod_$cliftCompare @f @fs v v1)]\n-37747232bce33190765d838c1402dbf3\n+35593db33cd3272ad62b0f0947b26a8f\n $fOrd1Prod0 :: Data.Functor.Classes.Ord1 (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Ord1],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[]) $fEq1Prod0 $fOrdProd0 $fOrd1Prod0_$cliftCompare]\n-6db24e3fb0c1c5bbe44532cc91141661\n+69c4c43d0f231d705977313e1b5948cc\n $fOrd1Prod0_$cliftCompare ::\n (a -> b -> GHC.Types.Ordering)\n -> Prod '[] a -> Prod '[] b -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 2,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b -> GHC.Types.Ordering)\n (ds1['GHC.Types.Many] :: Prod '[] a)\n (ds2['GHC.Types.Many] :: Prod '[] b) ->\n case ds1 of wild { Unit co ->\n case ds2 of wild1 { Unit co1 -> GHC.Types.EQ } }]\n-c3534ae34b59171382b1f6a68c48f2ab\n+85696df2593a70554e26f85b80ac754e\n $fOrd1Prod_$cliftCompare ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n (a -> b -> GHC.Types.Ordering)\n -> Prod (f : fs) a -> Prod (f : fs) b -> GHC.Types.Ordering\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2119,15 +2119,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-94d0c4a86a3a12f76fb902dbe33047eb\n+3d538142cfcf7f7b549bac1972aaa8d5\n $fOrd1Prod_$cp1Ord1 ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Data.Functor.Classes.Eq1 (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -2137,15 +2137,15 @@\n ($dOrd1['GHC.Types.Many] :: Data.Functor.Classes.Ord1 f)\n ($dOrd2['GHC.Types.Many] :: Data.Functor.Classes.Ord1 (Prod fs)) ->\n $fEq1Prod\n @f\n @fs\n (Data.Functor.Classes.$p1Ord1 @f $dOrd1)\n (Data.Functor.Classes.$p1Ord1 @(Prod fs) $dOrd2)]\n-ad8a0e96f0f266b21f585654b2ed1c31\n+c185a99c98584402b5f9e95300f61f3d\n $fOrdProd ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n GHC.Classes.Ord (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -2164,15 +2164,15 @@\n ($fOrdProd_$c<= @f @a @fs v v1 v2)\n ($fOrdProd_$c> @f @a @fs v v1 v2)\n (\\ (x['GHC.Types.Many] :: Prod (f : fs) a)\n (y['GHC.Types.Many] :: Prod (f : fs) a) ->\n $fOrdProd_$c<= @f @a @fs v v1 v2 y x)\n ($fOrdProd_$cmax @f @a @fs v v1 v2)\n ($fOrdProd_$cmin @f @a @fs v v1 v2)]\n-212a0c7b281a9d2f24dc9f9630309a38\n+376bab956c471d789ca3b3881dbed599\n $fOrdProd0 :: GHC.Classes.Ord a => GHC.Classes.Ord (Prod '[] a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Classes.Ord a).\n @(Prod '[] a)\n ($fOrdProd0_$cp1Ord @a v)\n@@ -2199,23 +2199,23 @@\n (\\ (x['GHC.Types.Many] :: Prod '[] a)\n (y['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co -> y })\n (\\ (x['GHC.Types.Many] :: Prod '[] a)\n (y['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co ->\n case y of wild1 { Unit co1 -> wild } })]\n-f03453389d0fd75c712fb52f361bdbb0\n+c01cfa0552fc0c9670078ca323bc14d8\n $fOrdProd0_$cp1Ord ::\n GHC.Classes.Ord a => GHC.Classes.Eq (Prod '[] a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @a ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a) ->\n $fEqProd0 @a (GHC.Classes.$p1Ord @a $dOrd)]\n-657138cfe492ce1444bcf8290136cd5d\n+202e5fa07c7ebcd92d7f465a7f7b4ce3\n $fOrdProd_$c< ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2234,15 +2234,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n y\n x of wild {\n DEFAULT -> GHC.Types.False GHC.Types.GT -> GHC.Types.True }]\n-5c8a507e84a41cced986357db14b8631\n+70e91e87fcdea1710bc7b36ff3301f64\n $fOrdProd_$c<= ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2261,15 +2261,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> GHC.Types.True GHC.Types.GT -> GHC.Types.False }]\n-d70f34cff32f5e3756c5de0cc60bf7b5\n+1109e667665fb308c19da61929f84b9a\n $fOrdProd_$c> ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2288,15 +2288,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> GHC.Types.False GHC.Types.GT -> GHC.Types.True }]\n-869dd2c75cbd28c3b9b2f3114a8faa3d\n+ebe33d07ec27c49b8d0151f4112f4e41\n $fOrdProd_$ccompare ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Ordering\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -2339,15 +2339,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-664e3fec4d78c7e237e9cb3b498b865e\n+745990ba2877b119ee4369d82e2fbb05\n $fOrdProd_$cmax ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -2365,15 +2365,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> y GHC.Types.GT -> x }]\n-a24e3d36ec26b1a8d0a90fdcad9d42f1\n+2a1f6d36ab3e9ca40b3f7ee02e9eb44d\n $fOrdProd_$cmin ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -2391,15 +2391,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> x GHC.Types.GT -> y }]\n-07f196658fec8f28504840008a125d4b\n+dd2b034c8b83f190dd81d5949cf2cd14\n $fOrdProd_$cp1Ord ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n GHC.Classes.Eq (Prod (f : fs) a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n Strictness: ,\n@@ -2413,15 +2413,15 @@\n $fEqProd\n @f\n @a\n @fs\n (Data.Functor.Classes.$p1Ord1 @f $dOrd1)\n (GHC.Classes.$p1Ord @a $dOrd)\n (Data.Functor.Classes.$p1Ord1 @(Prod fs) $dOrd2)]\n-855c50fbfe417001be74014a7c530ffd\n+f72a05ac87f7d4b0db3e99f2ee86c395\n $fShow1Prod ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n Data.Functor.Classes.Show1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -2432,39 +2432,39 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Show1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Show1 (Prod fs)).\n @(Prod (f : fs))\n (\\ @a ($dShow['GHC.Types.Many] :: GHC.Show.Show a) ->\n $fShowProd @f @a @fs v $dShow v1)\n ($fShow1Prod_$cliftShowsPrec @f @fs v v1)\n ($fShow1Prod_$cliftShowList @f @fs v v1)]\n-8f5cc8b096172543b66beca898319072\n+121fa5b2932af052532e2e0fb362af80\n $fShow1Prod0 :: Data.Functor.Classes.Show1 (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Show1],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fShowProd0\n $fShow1Prod0_$cliftShowsPrec\n $fShow1Prod0_$cliftShowList]\n-c9ebf33bdc7a7e5cd781bb4c1ef11a55\n+1325d4d4099c4571fd1d73d670e65a7e\n $fShow1Prod0_$cliftShowList ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Prod '[] a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n \\ @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (eta['GHC.Types.Many] :: [Prod '[] a])\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Prod '[] a) ($fShow1Prod4 @a) eta eta1]\n-23bfdbd365bb687d11bca0d85ce97dfe\n+f713e90558045931c878017715a6cd65\n $fShow1Prod0_$cliftShowsPrec ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Prod '[] a\n -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -2474,42 +2474,42 @@\n (ds['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (ds1['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (ds2['GHC.Types.Many] :: GHC.Types.Int)\n (ds3['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds3 of wild { Unit co ->\n GHC.CString.unpackAppendCString# $fShow1Prod5 eta }]\n-6040d85b280aabe26013b2318d960dd0\n+45bb9021211fd05db5f3037acd00857f\n $fShow1Prod1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \" `prod` \"#]\n-a70703d856884be94901f961f53d37e6\n+f4fd576d1c98509a1f9deca9794d9594\n $fShow1Prod2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"oneTuple \"#]\n-05737f14b94806046c763016b9a844c4\n+c17f436ecd12c6353c34d5ed596ef09f\n $fShow1Prod3 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 11#]\n-86560ed452101d6d6bbe9ba21459b910\n+c6dcd855108e1f62f9dd244112d61e46\n $fShow1Prod4 :: Prod '[] a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @a\n (ds['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Unit co ->\n GHC.CString.unpackAppendCString# $fShow1Prod5 eta }]\n-02ed72b02291748ad4f9755ad1e4b0ab\n+a78cfa2e8dd0e61bcdb32448e2956256\n $fShow1Prod5 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"zeroTuple\"#]\n-8fbbd769fb63ad94ff7e2158a9169335\n+a59e0576e735270e51b50ed7a9fe3dbb\n $fShow1Prod_$cliftShowList ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Prod (f : fs) a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n Strictness: <1L>,\n@@ -2525,15 +2525,15 @@\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Prod (f : fs) a)\n (\\ (ds['GHC.Types.Many] :: Prod (f : fs) a) ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a sp sl 0# ds)\n eta\n eta1]\n-df35a415834cbb48a2d441ed1ff9cd85\n+a24aae26efd62d5f14dea9eb23e7a6d4\n $fShow1Prod_$cliftShowsPrec ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Prod (f : fs) a\n@@ -2549,15 +2549,15 @@\n @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (d['GHC.Types.Many] :: GHC.Types.Int)\n (ds['GHC.Types.Many] :: Prod (f : fs) a) ->\n case d of wild { GHC.Types.I# ww ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a sp sl ww ds }]\n-6b704d95bf5d0c4eb0754dc654620af0\n+25fefadfe8f55d5fe94229734a3f80da\n $fShowProd ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n GHC.Show.Show (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -2569,15 +2569,15 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Show1 f)\n (v1['GHC.Types.Many] :: GHC.Show.Show a)\n (v2['GHC.Types.Many] :: Data.Functor.Classes.Show1 (Prod fs)).\n @(Prod (f : fs) a)\n ($fShowProd_$cshowsPrec @f @a @fs v v1 v2)\n ($fShowProd_$cshow @f @a @fs v v1 v2)\n ($fShowProd_$cshowList @f @a @fs v v1 v2)]\n-36bd69d638d84b0c9011e25b94927f37\n+d892891347dd580c41fdb87d355863c1\n $fShowProd0 :: GHC.Show.Show a => GHC.Show.Show (Prod '[] a)\n DFunId\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Show.Show a).\n @(Prod '[] a)\n (\\ (ds['GHC.Types.Many] :: GHC.Types.Int)\n@@ -2592,19 +2592,19 @@\n GHC.Base.foldr @GHC.Types.Char @b c n $fShowProd1)\n eta })\n (\\ (x['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co -> $fShowProd1 })\n (\\ (ls['GHC.Types.Many] :: [Prod '[] a])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Prod '[] a) ($fShow1Prod4 @a) ls s)]\n-9eb66a1c818504181fb9f574e7cd1720\n+8be78c6edde4fb30d49351c8a3284352\n $fShowProd1 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShow1Prod5]\n-a053013a0790033e466a5c562de2b535\n+f7839d77d2b79b4dcfb4fdb8437bf1fc\n $fShowProd_$cshow ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n Prod (f : fs) a -> GHC.Base.String\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2622,15 +2622,15 @@\n $dShow2\n @a\n (GHC.Show.showsPrec @a $dShow)\n (GHC.Show.showList @a $dShow)\n 0#\n x\n (GHC.Types.[] @GHC.Types.Char)]\n-76d3ff93dc37bbf06c2927969ecf3e30\n+ea5904abaa531119e6ded79598aaaf4a\n $fShowProd_$cshowList ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n [Prod (f : fs) a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2651,15 +2651,15 @@\n } in\n GHC.Show.showList__\n @(Prod (f : fs) a)\n (\\ (eta['GHC.Types.Many] :: Prod (f : fs) a) ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a lvl17 lvl18 0# eta)\n ls\n s]\n-1cd08022144c792cd4843c9be57b0294\n+6d3b3f1144defe2af062303cf273429e\n $fShowProd_$cshowsPrec ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n GHC.Types.Int -> Prod (f : fs) a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1!P(L)><1L>,\n Unfolding: Core: StableSystem <5,TrueFalse>\n@@ -2677,15 +2677,15 @@\n $dShow1\n $dShow2\n @a\n (GHC.Show.showsPrec @a $dShow)\n (GHC.Show.showList @a $dShow)\n eta\n eta1]\n-5d01825ab33355d311525636fee8f738\n+d5bd819362f59b1688758c98ac50ea3b\n $fTraversableProd ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n Data.Traversable.Traversable (Prod (f : fs))\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -2697,15 +2697,15 @@\n @(Prod (f : fs))\n ($fTraversableProd_$cp1Traversable @f @fs v v1)\n ($fTraversableProd_$cp2Traversable @f @fs v v1)\n ($fTraversableProd_$ctraverse @f @fs v v1)\n ($fTraversableProd_$csequenceA @f @fs v v1)\n ($fTraversableProd_$cmapM @f @fs v v1)\n ($fTraversableProd_$csequence @f @fs v v1)]\n-3b2a3b73f7dd70b63122c555207ed317\n+7a6baf078396f6ad5b96ceb718b1172d\n $fTraversableProd0 :: Data.Traversable.Traversable (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Traversable.C:Traversable],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n@@ -2736,41 +2736,41 @@\n (eta['GHC.Types.Many] :: Prod '[] (m a)) ->\n case eta of wild { Unit co ->\n GHC.Base.pure\n @m\n (GHC.Base.$p1Monad @m $dMonad)\n @(Prod '[] a)\n ($WUnit @(*) @a) })]\n-c3867ecf5efe7ba588428ce298e53978\n+d2d78e1dc58e2b3245c590ce6a0cb850\n $fTraversableProd0_$ctraverse ::\n GHC.Base.Applicative f =>\n (a -> f b) -> Prod '[] a -> f (Prod '[] b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)><1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @f :: * -> *\n @a\n @b\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative f)\n (ds['GHC.Types.Many] :: a -> f b)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds1 of wild { Unit co ->\n GHC.Base.pure @f $dApplicative @(Prod '[] b) ($WUnit @(*) @b) }]\n-994d310e65b43d87d3863ae3a69c83c3\n+6fb1faa8a386a2f758a3d9fabb3e0958\n $fTraversableProd1 :: f b -> Prod fs b -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @fs :: [* -> *]\n @b\n @f :: * -> *\n (ds['GHC.Types.Many] :: f b)\n (ds1['GHC.Types.Many] :: Prod fs b) ->\n $WCons @(*) @f @b @fs ds ds1]\n-6a78ef91de97b175be1f2b03b10facfe\n+e3b6b0917be90d9232a0a43cf86155c8\n $fTraversableProd_$cmapM ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Monad m) =>\n (a -> m b) -> Prod (f : fs) a -> m (Prod (f : fs) b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(1P(L,L,SC(S,L),L,L,L),A,A,A)><1L>,\n Inline: (sat-args=0),\n@@ -2793,15 +2793,15 @@\n $dTraversable1\n @m\n @a\n @b\n (GHC.Base.$p1Monad @m $dMonad)\n eta\n eta1]\n-0a0327f95920457020c038ffe7dd5aab\n+781f34f21daaaeb91fc4ce3c170eabbd\n $fTraversableProd_$cp1Traversable ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -2812,15 +2812,15 @@\n ($dTraversable1['GHC.Types.Many] :: Data.Traversable.Traversable\n (Prod fs)) ->\n $fFunctorProd\n @f\n @fs\n (Data.Traversable.$p1Traversable @f $dTraversable)\n (Data.Traversable.$p1Traversable @(Prod fs) $dTraversable1)]\n-1f8f48676092672bd6a4378512a1d413\n+4894af1253c0757e5ab63b02b975e612\n $fTraversableProd_$cp2Traversable ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n Data.Foldable.Foldable (Prod (f : fs))\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -2830,15 +2830,15 @@\n ($dTraversable1['GHC.Types.Many] :: Data.Traversable.Traversable\n (Prod fs)) ->\n $fFoldableProd\n @f\n @fs\n (Data.Traversable.$p2Traversable @f $dTraversable)\n (Data.Traversable.$p2Traversable @(Prod fs) $dTraversable1)]\n-a5b4473cc8d08cef8c0902d6550b09f8\n+339ce2a42d32bf48ab37c0bc3c672971\n $fTraversableProd_$csequence ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Monad m) =>\n Prod (f : fs) (m a) -> m (Prod (f : fs) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(1P(L,L,SC(S,L),L,L,L),A,A,A)><1L>,\n Inline: (sat-args=0),\n@@ -2859,15 +2859,15 @@\n $dTraversable1\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))\n eta]\n-9548a0e69b208274d90a8c7dc15518c7\n+df050f680bf221b38bcf0f8dbf7dbcca\n $fTraversableProd_$csequenceA ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Applicative f1) =>\n Prod (f : fs) (f1 a) -> f1 (Prod (f : fs) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Inline: (sat-args=0),\n@@ -2886,15 +2886,15 @@\n $dTraversable\n $dTraversable1\n @f1\n @(f1 a)\n @a\n $dApplicative\n (GHC.Base.id @(f1 a))]\n-0343881b4a56387c10c2a90640c35e57\n+a5a048310f0dae1c8a44b9b9675c0016\n $fTraversableProd_$ctraverse ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Applicative f1) =>\n (a -> f1 b) -> Prod (f : fs) a -> f1 (Prod (f : fs) b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2935,114 +2935,114 @@\n $dTraversable1\n @f1\n @a\n @b\n $dApplicative\n eta\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-3a7e9dbd4e89ac8fd507b72fa2111de7\n+4782daeefb209cc6e70ef18754396e57\n $tc'Cons :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11681214518383820212#Word64\n- 2262654514700322604#Word64\n+ 18095855829200529283#Word64\n+ 9349079441430715829#Word64\n $trModule\n $tc'Cons2\n 4#\n $tc'Cons1]\n-2d30aab6bb6c9f3ccc2dd62a32a8a4e7\n+f490e18cf82ec30f624196fb2d39a6f8\n $tc'Cons1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-08b2ad063a71ee45a7a8536f65c5f05e\n+ac2fac9d90fc111a15d4c4e1f0373958\n $tc'Cons2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Cons3]\n-e3a9582364945a3fdad675ea10bdcc1f\n+673b81b4c9c40dc2d20878f9ec48ef25\n $tc'Cons3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Cons\"#]\n-23c432102357c63bee6ce1d940488243\n+8789339d671dda0e1838d22e1becb0b9\n $tc'Unit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2737625517741220644#Word64\n- 14927981062871196765#Word64\n+ 15781974758605816177#Word64\n+ 16358358308405845360#Word64\n $trModule\n $tc'Unit2\n 2#\n $tc'Unit1]\n-2429097e1acb268ce9793d5db542e0a0\n+418bfb310cc853e69fb766e32e83d141\n $tc'Unit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepTyConApp], Inline: [~]]\n-ef7f66f0388ec3705825a2b11d93dfc1\n+04f400db1544e18727e6796980fb30bf\n $tc'Unit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Unit3]\n-ddaeada3f0566f7815c9e05b7300032e\n+2c734cda52aa5fe049c2bfcf7cfc3840\n $tc'Unit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Unit\"#]\n-0e492da99a3933300f7b3e0d015148c0\n+2ed43a4576836a463acca268b71b8a3d\n $tcProd :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14117411816903489973#Word64\n- 14719450260367156357#Word64\n+ 3702848797303664329#Word64\n+ 10218302260542951913#Word64\n $trModule\n $tcProd2\n 1#\n $tcProd1]\n-2de61373d3d737f58856631f27dceee2\n+f54ab60f1ab8f6a112c7fbfe92586cc8\n $tcProd1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a97e04b764d396aa8167339adaadef46\n+e3e0086e5a1912106894ddb48ff470c0\n $tcProd2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProd3]\n-00e226dbe680d3c6ac85038ff4d4c99a\n+9923d18a971c1c15108c89fd1447c454\n $tcProd3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Prod\"#]\n-96413630781f30772b6c77bfceb7b732\n+906c64d92ef88a476b272f9edc5a91ea\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-73cc961c32c4a687204c0957a65feeb0\n+17f845fc0196fa3ce77813ba405a6638\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-87213e996837faaa8a48f4019e90aa67\n+c20d6e6345b74f747bf755752914420e\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Prod\"#]\n-9d88598cebc62d018fc3a21bcf4fc75a\n+5bfdf37dfd9aa57f39882f24a094c609\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-3dd39a97079e5daf4ad26745a000cb24\n+b28fc42724998d51c11e83bd2397d601\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e7c758d61272018c6faaf4f73d3ffe58\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+5b7d769a077d6ef1675a22ac50823268\n $w$cliftShowsPrec ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Prim.Int#\n -> Prod (f : fs) a\n@@ -3125,76 +3125,76 @@\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShow1Prod2\n (f2\n (GHC.CString.unpackAppendCString#\n $fShow1Prod1\n (g (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x))))) } } }]\n-0b067dc8d1998b2bb8488e3bb8a8fcc6\n+7ed7e132d60bf3187c2f5785260bf37d\n $w$cmaximum :: (# #) -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableUser\n \\ @a (void['GHC.Types.Many] :: (# #)) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString# @b \"maximum: empty structure\"#))]\n-4629527230dd254a906d75e3508133d9\n+47e711ca318660bfa85409cb439f1aa5\n $w$cminimum :: (# #) -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableUser\n \\ @a (void['GHC.Types.Many] :: (# #)) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString# @b \"minimum: empty structure\"#))]\n-8fdd6a3df6caa085c48f6e4cd62d707f\n+9e1a347b81f82e99eae15e6701e5fdc9\n type (++) :: forall k. [k] -> [k] -> [k]\n type family (++) l r where\n forall k (ys :: [k]). (++) '[] ys = ys\n forall k (x :: k) (xs :: [k]) (ys :: [k]).\n (++) (x : xs) ys = x : (xs ++ ys)\n axiom D:R:++\n-81aef0e416fe3eced281ba9e3418f8e5\n+b9e832e839646ad593d0f98d996de215\n type Curried :: * -> *\n type family Curried t where\n forall k (a :: k) (r :: k -> *). Curried (Prod '[] a -> r a) = r a\n forall k (t :: GHC.Types.RuntimeRep) (f :: k -> *) (fs :: [k -> *])\n (a :: k) (r :: k -> GHC.Prim.TYPE t).\n Curried (Prod (f : fs) a -> r a)\n = f a -> Curried (Prod fs a -> r a)\n axiom D:R:Curried\n-c942a9be1f9dd46c9c4c3c3efa39164b\n+2eb68f31ecc22041f9172906f1ef8c19\n axiom D:R:++ ::\n forall k (ys :: [k]). ++ '[] ys = ys\n forall k (x :: k) (xs :: [k]) (ys :: [k]).\n ++ (x : xs) ys = x : (xs ++ ys)\n-215dbd0d8d46680c2d0c3eab2a27a8df\n+48d63156e2c4beaa2ae9d29c8f291fd6\n axiom D:R:Curried ::\n forall k (a :: k) (r :: k -> *). Curried (Prod '[] a -> r a) = r a\n forall k (t :: GHC.Types.RuntimeRep) (f :: k -> *) (fs :: [k -> *])\n (a :: k) (r :: k -> GHC.Prim.TYPE t).\n Curried (Prod (f : fs) a -> r a)\n = f a -> Curried (Prod fs a -> r a)\n-46923a6801bbd445e7f64b45bc2641db\n+72871df9eab61fc1dcceb25a27d59350\n type role Prod nominal nominal\n type Prod :: forall k. [k -> *] -> k -> *\n data Prod a b where\n Unit :: forall {k} (b :: k). Prod '[] b\n Cons :: forall {k} (f :: k -> *) (b :: k) (fs :: [k -> *]).\n f b -> Prod fs b -> Prod (f : fs) b\n-4815e6e8318430a80a5e3a006555c5de\n+6ed6946a398f24c48583bf39fdbda7c5\n fromProduct ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> Prod '[f, g] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(L,L)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n@@ -3208,28 +3208,28 @@\n @'[f, g]\n @a\n @f\n @'[g]\n @~<'[f, g]>_N\n fa\n (Cons @k @'[g] @a @g @'[] @~<'[g]>_N ga ($WUnit @k @a)) }]\n-3db31f80980168074f72230541dcdcbf\n+dccad5e79060be1077ae216131d87662\n oneTuple :: forall {k} (f :: k -> *) (a :: k). f a -> Prod '[f] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * @a :: k (fa['GHC.Types.Many] :: f a) ->\n Cons @k @'[f] @a @f @'[] @~<'[f]>_N fa ($WUnit @k @a)]\n-ce6744d0fed199a0f3297258e8b39d71\n+783ee96f7bfd3c24f11aaa471e0ddbde\n prod ::\n forall {k} (ls :: [k -> *]) (a :: k) (rs :: [k -> *]).\n Prod ls a -> Prod rs a -> Prod (ls ++ rs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1L>]\n-a205c7411346ec6b39452528f4a2813c\n+7f5fa7242adb897c121c28dc2a3de0af\n toProduct ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Prod '[f, g] a -> Data.Functor.Product.Product f g a\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n@@ -3250,27 +3250,27 @@\n fa `cast` (Sub (SelCo:Tc(1) (Sym co)) _N)\n ga\n `cast`\n (Sub (SelCo:Tc(1)\n (Sym co1\n ; SelCo:Tc(2) (Sym co))) _N)\n Cons ipv ipv1 ipv2 ipv3 ipv4 -> toProduct1 @k @f @g @a } } }]\n-d3aadb0a37bb59155db55af33446469a\n+5d07bd02252cbe2363bc3e6bad5ff146\n toProduct1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-ec8e0ae39097ee1266cb70c637d66936\n+f744ba307263901c0d9b705fe9ea6ef8\n uncurryn ::\n forall {k} (fs :: [k -> *]) (a :: k) (r :: k -> *).\n Curried (Prod fs a -> r a) -> Prod fs a -> r a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1L><1L>]\n-7b131559cb13793752218f307d823264\n+26df9dab53a2787881b48ac09e4bb9b7\n zeroTuple :: forall {k} (a :: k). Prod '[] a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: $WUnit]\n instance [safe] GHC.Base.Alternative [Prod] = $fAlternativeProd\n instance [safe] GHC.Base.Alternative [Prod] = $fAlternativeProd0\n instance [safe] GHC.Base.Applicative [Prod] = $fApplicativeProd\n instance [safe] GHC.Base.Applicative [Prod] = $fApplicativeProd0\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Data.Functor.Prod 9066\n- interface hash: 46f8a0d5c6c5d78b7bb57a6c058956f6\n- ABI hash: 8d47f16d8893d87069072e388a9ef386\n- export-list hash: 44e655eaed14db1b6bce59ab0030a93c\n+ interface hash: 9e8474f0b6f4c654f9a9999b58f256e2\n+ ABI hash: edb93e6f86ca660eabf4105b6e8cd5cd\n+ export-list hash: d97a11b09cefc2c69fafc6efc9af992b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 4ae0de3cb73d886d2696e810afbf046e\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 610d6ae8793d64642444a356c490f3f6\n sig of: Nothing\n@@ -46,15 +46,15 @@\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n import -/ GHC.Types 40ada155ed73681c14b0e90149f6df94\n-d2fd1c9756964a29b2ee94b3b2d3a8d1\n+9e5b604faf999f984c0010faa01877fa\n $fAlternativeProd ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n GHC.Base.Alternative (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -65,55 +65,55 @@\n (v1['GHC.Types.Many] :: GHC.Base.Alternative (Prod fs)).\n @(Prod (f : fs))\n ($fAlternativeProd_$cp1Alternative @f @fs v v1)\n ($fAlternativeProd_$cempty @f @fs v v1)\n ($fAlternativeProd_$c<|> @f @fs v v1)\n ($fAlternativeProd_$csome @f @fs v v1)\n ($fAlternativeProd_$cmany @f @fs v v1)]\n-d02581099c849866f55aa480524e8a96\n+fa429d594544ef712e8e060fd6a80cf7\n $fAlternativeProd0 :: GHC.Base.Alternative (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Alternative], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fApplicativeProd0\n ($WUnit @(*))\n $fAlternativeProd0_$c<|>\n $fAlternativeProd0_$csome\n $fAlternativeProd0_$csome]\n-13f5908478052ee580fec37db6f59384\n+df7680338eb427a0b502569ba37456d4\n $fAlternativeProd0_$c<|> :: Prod '[] a -> Prod '[] a -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n (ds['GHC.Types.Many] :: Prod '[] a)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds of wild { Unit co ->\n case ds1 of wild1 { Unit co1 -> $WUnit @(*) @a } }]\n-ff0e65bc81800fc3326131c448bf596b\n+dce3f3e15890b9f9fee5d62734f89d87\n $fAlternativeProd0_$csome :: Prod '[] a -> Prod '[] [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: b, CPR: b,\n Unfolding: Core: \n \\ @a (eta['GHC.Types.Many] :: Prod '[] a) ->\n letrec {\n some_v :: Prod '[] [a] [Strictness: b]\n = case eta of wild { Unit co -> some_v }\n } in\n some_v]\n-6329adb01fd614abfd3ace22bbfc44cd\n+25f9f30acf295953126da599d4028013\n $fAlternativeProd1 :: a -> [a] -> [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @a (ds['GHC.Types.Many] :: a) (ds1['GHC.Types.Many] :: [a]) ->\n GHC.Types.: @a ds ds1]\n-41f3c22637694426d2cc91dead1fc938\n+057c3a8dab52f1bdd80aeadf61f226ec\n $fAlternativeProd_$c<|> ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -141,15 +141,15 @@\n g `cast` (Sub (SelCo:Tc(1) (Sym co1)) _N))\n (GHC.Base.<|>\n @(Prod fs)\n $dAlternative1\n @a\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R\n gs `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-6471fe23deedd8d1b22e4f00f7813e72\n+fa90253c3ed2200f0af3a2ff8f29cb40\n $fAlternativeProd_$cempty ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -162,15 +162,15 @@\n @(f : fs)\n @a\n @f\n @fs\n @~_N\n (GHC.Base.empty @f $dAlternative @a)\n (GHC.Base.empty @(Prod fs) $dAlternative1 @a)]\n-cacde4105edec44237bc9dd83c22665a\n+8fbefc93d518e57219dc4ccbbecace18\n $fAlternativeProd_$cliftA2 ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n (a -> b -> c)\n -> Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n@@ -228,15 +228,15 @@\n (GHC.Base.<*>\n @(Prod fs)\n $dApplicative1\n @b\n @c\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) c>_N)_R\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-ea5cc9cccb5debbc5c10e89931d88159\n+c76c11cd66018a4318aea9108ddd9ad1\n $fAlternativeProd_$cmany ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -283,15 +283,15 @@\n @(Prod fs)\n $dAlternative1\n @[a]\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) <[a]>_N)_R\n (GHC.Base.pure @(Prod fs) $dApplicative @[a] (GHC.Types.[] @a))) }\n } in\n many_v]\n-6492e8474ca8ddbc4745194a2e5af1f4\n+22b7644fcc820ec3a80ce8657829f865\n $fAlternativeProd_$cp1Alternative ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n GHC.Base.Applicative (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -301,15 +301,15 @@\n ($dAlternative1['GHC.Types.Many] :: GHC.Base.Alternative\n (Prod fs)) ->\n $fApplicativeProd\n @f\n @fs\n (GHC.Base.$p1Alternative @f $dAlternative)\n (GHC.Base.$p1Alternative @(Prod fs) $dAlternative1)]\n-3baacf93c1323f6a2c9eff2e23203638\n+747352584abb6207422d7a2c399f09aa\n $fAlternativeProd_$csome ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -356,15 +356,15 @@\n @(Prod fs)\n $dAlternative1\n @[a]\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) <[a]>_N)_R\n (GHC.Base.pure @(Prod fs) $dApplicative @[a] (GHC.Types.[] @a))) })\n } in\n some_v]\n-b997f4e382374bd39c075e108939782e\n+314d4404ca633c8ec99a53b4e8b36164\n $fApplicativeProd ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n GHC.Base.Applicative (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -376,88 +376,88 @@\n @(Prod (f : fs))\n ($fApplicativeProd_$cp1Applicative @f @fs v v1)\n ($fApplicativeProd_$cpure @f @fs v v1)\n ($fApplicativeProd_$c<*> @f @fs v v1)\n ($fAlternativeProd_$cliftA2 @f @fs v v1)\n ($fApplicativeProd_$c*> @f @fs v v1)\n ($fApplicativeProd_$c<* @f @fs v v1)]\n-f69d0eaef85d2bd573083a5ccbcbf39e\n+d11faec4ca4e067a66222af646040f2a\n $fApplicativeProd0 :: GHC.Base.Applicative (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Applicative], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fFunctorProd0\n $fApplicativeProd0_$cpure\n $fApplicativeProd0_$c<*>\n $fApplicativeProd0_$cliftA2\n $fApplicativeProd0_$c*>\n $fApplicativeProd0_$c<*]\n-33f5901fec4a528e1eb494ddf21b0788\n+9cc97fda22e013683967150d38775350\n $fApplicativeProd0_$c*> :: Prod '[] a -> Prod '[] b -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] b) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> $WUnit @(*) @b } }]\n-4a2e24b42db02957c1d40c78d3c67fbc\n+44a251d9a818bf6433ac3a8d914e97e0\n $fApplicativeProd0_$c<* :: Prod '[] a -> Prod '[] b -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (eta1['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: Prod '[] b) ->\n case eta1 of wild { Unit co ->\n case eta of wild1 { Unit co1 -> $WUnit @(*) @a } }]\n-7f9d8b436c1275a9df6e8948dd40ca7b\n+216119fcf2d25984791bffeef7393760\n $fApplicativeProd0_$c<*> ::\n Prod '[] (a -> b) -> Prod '[] a -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (ds['GHC.Types.Many] :: Prod '[] (a -> b))\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds of wild { Unit co ->\n case ds1 of wild1 { Unit co1 -> $WUnit @(*) @b } }]\n-55f199bcf83653f621c3318b0674474f\n+4be90ac3927f3977af4c21cf7c84116d\n $fApplicativeProd0_$cliftA2 ::\n (a -> b -> c) -> Prod '[] a -> Prod '[] b -> Prod '[] c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n @c\n (eta['GHC.Types.Many] :: a -> b -> c)\n (eta1['GHC.Types.Many] :: Prod '[] a)\n (eta2['GHC.Types.Many] :: Prod '[] b) ->\n case eta1 of wild { Unit co ->\n case eta2 of wild1 { Unit co1 -> $WUnit @(*) @c } }]\n-f2d03e93c518ae12d9655d152b906d1e\n+adfafd399935fc76bf42eeccba70dae3\n $fApplicativeProd0_$cpure :: a -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (ds['GHC.Types.Many] :: a) -> $WUnit @(*) @a]\n-14852efd869d910610875b74edaede4c\n+8964c0af7ce9a43f005e692ebc663333\n $fApplicativeProd1 :: a -> b -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b @a (ds['GHC.Types.Many] :: a) -> GHC.Base.id @b]\n-3d4e348ea5b1d5aa90f23572adee0f73\n+9c844ab571f9df1093e4074f81d0950b\n $fApplicativeProd_$c*> ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -500,15 +500,15 @@\n @(Prod fs)\n (GHC.Base.$p1Applicative @(Prod fs) $dApplicative1)\n @a\n @(b -> b)\n ($fApplicativeProd1 @b @a)\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R)\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-9c6b8f987c83e71a3fc8f8558a73261c\n+af4b35e446ae837f0fc01dfcf15688de\n $fApplicativeProd_$c<* ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -522,15 +522,15 @@\n @fs\n $dApplicative\n $dApplicative1\n @a\n @b\n @a\n (GHC.Base.const @a @b)]\n-7fc39635cb6fc0e80a45f5a43afa2d15\n+2e153d96e8e3990ca8bae318c372ccd2\n $fApplicativeProd_$c<*> ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) (a -> b) -> Prod (f : fs) a -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -561,15 +561,15 @@\n (GHC.Base.<*>\n @(Prod fs)\n $dApplicative1\n @a\n @b\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) b>_N)_R\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-dd73fc4a106bfd43337f6b09ce313e89\n+cb047149d84b05af2ae0e4ffa3806f0e\n $fApplicativeProd_$cp1Applicative ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -579,15 +579,15 @@\n ($dApplicative1['GHC.Types.Many] :: GHC.Base.Applicative\n (Prod fs)) ->\n $fFunctorProd\n @f\n @fs\n (GHC.Base.$p1Applicative @f $dApplicative)\n (GHC.Base.$p1Applicative @(Prod fs) $dApplicative1)]\n-ba0d9a29dffdfa9980d4612bb430edf8\n+bb68754d97d8827522d362b222fb2675\n $fApplicativeProd_$cpure ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n a -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -602,15 +602,15 @@\n @(f : fs)\n @a\n @f\n @fs\n @~_N\n (GHC.Base.pure @f $dApplicative @a a1)\n (GHC.Base.pure @(Prod fs) $dApplicative1 @a a1)]\n-6dd69adcce3c61218ec7aa1af0711c65\n+a1dd5987beccf763a1af208d06cdb17c\n $fEq1Prod ::\n (Data.Functor.Classes.Eq1 f, Data.Functor.Classes.Eq1 (Prod fs)) =>\n Data.Functor.Classes.Eq1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -619,35 +619,35 @@\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: Data.Functor.Classes.Eq1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs)).\n @(Prod (f : fs))\n (\\ @a ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a) ->\n $fEqProd @f @a @fs v $dEq v1)\n ($fEq1Prod_$cliftEq @f @fs v v1)]\n-9370d8c58c16f2958fba21167c797359\n+4d2c63d7dab9a32e0e4699934e186152\n $fEq1Prod0 :: Data.Functor.Classes.Eq1 (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Eq1], Inline: CONLIKE,\n Unfolding: DFun:. @(Prod '[]) $fEqProd0 $fEq1Prod0_$cliftEq]\n-438ec1b6f47422dd779cce9d2575830b\n+23fda07af6dc5ed8bed088d43eb9f066\n $fEq1Prod0_$cliftEq ::\n (a -> b -> GHC.Types.Bool)\n -> Prod '[] a -> Prod '[] b -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 2,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b -> GHC.Types.Bool)\n (ds1['GHC.Types.Many] :: Prod '[] a)\n (ds2['GHC.Types.Many] :: Prod '[] b) ->\n case ds1 of wild { Unit co ->\n case ds2 of wild1 { Unit co1 -> GHC.Types.True } }]\n-6e10b4c6db834ec39995ee3ffae32009\n+3f660676da91732acf4ea101ad173244\n $fEq1Prod_$cliftEq ::\n (Data.Functor.Classes.Eq1 f, Data.Functor.Classes.Eq1 (Prod fs)) =>\n (a -> b -> GHC.Types.Bool)\n -> Prod (f : fs) a -> Prod (f : fs) b -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -687,15 +687,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-43ff39f0993415f8a586f2fc954ee895\n+6cf535b83250a530f96262560462b970\n $fEqProd ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n GHC.Classes.Eq (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -706,39 +706,39 @@\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: Data.Functor.Classes.Eq1 f)\n (v1['GHC.Types.Many] :: GHC.Classes.Eq a)\n (v2['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs)).\n @(Prod (f : fs) a)\n ($fEqProd_$c== @f @a @fs v v1 v2)\n ($fEqProd_$c/= @f @a @fs v v1 v2)]\n-c266d889a997fb68e60f0ed941b6ab54\n+9d907fd95f97d766fdc07255e10c6979\n $fEqProd0 :: GHC.Classes.Eq a => GHC.Classes.Eq (Prod '[] a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Classes.Eq a).\n @(Prod '[] a)\n (\\ (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> GHC.Types.True } })\n ($fEqProd0_$c/= @a v)]\n-86d3d480d2c796247409b334ff27a87c\n+7978c22d50c26e7867cf690528f5b0fd\n $fEqProd0_$c/= ::\n GHC.Classes.Eq a => Prod '[] a -> Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n \\ @a\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> GHC.Types.False } }]\n-aad81c946173d0e01751b5098db884d2\n+27fd6f940559c088c0c3ea20d6b19c8a\n $fEqProd_$c/= ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -751,15 +751,15 @@\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n ($dEq2['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs))\n (eta['GHC.Types.Many] :: Prod (f : fs) a)\n (eta1['GHC.Types.Many] :: Prod (f : fs) a) ->\n case $fEqProd_$c== @f @a @fs $dEq1 $dEq $dEq2 eta eta1 of wild {\n GHC.Types.False -> GHC.Types.True\n GHC.Types.True -> GHC.Types.False }]\n-8ec3a91b57e879a609b808fe8e9b496e\n+70c4b9ecaa95a9d1da9dab20d81807a1\n $fEqProd_$c== ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -801,15 +801,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-bfcb7958d9a8a9e77d014080c0649dd3\n+85575f0393e3257d05b2e23b457eeb64\n $fFoldableProd ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Data.Foldable.Foldable (Prod (f : fs))\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: CONLIKE,\n@@ -848,15 +848,15 @@\n ($fFoldableProd1 @f @fs v v1)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-5393a153cd897d447754507c4a0f4270\n+867d462d11a900de8c45de298120b4b5\n $fFoldableProd0 :: Data.Foldable.Foldable (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Foldable.C:Foldable], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n (\\ @m\n@@ -875,126 +875,126 @@\n $fFoldableProd0_$cnull\n $fFoldableProd0_$clength\n $fFoldableProd13\n $fFoldableProd0_$cmaximum\n $fFoldableProd0_$cminimum\n $fFoldableProd12\n $fFoldableProd11]\n-355aaececf7508647d44df73b85a14ac\n+f207818c3c93de324b34b97402b2ce9c\n $fFoldableProd0_$cfoldMap' ::\n GHC.Base.Monoid m => (a -> m) -> Prod '[] a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1L,A,A)>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @m\n @a\n ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid m)\n (eta['GHC.Types.Many] :: a -> m)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Base.mempty @m $dMonoid]\n-2715300049605b01223e1780ed749e9e\n+2929aefd9752ff8217b56ffc04be00ea\n $fFoldableProd0_$cfoldl :: (b -> a -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @b\n @a\n (eta['GHC.Types.Many] :: b -> a -> b)\n (eta1['GHC.Types.Many] :: b)\n (eta2['GHC.Types.Many] :: Prod '[] a) ->\n eta1]\n-bf33179345a11366fd8ef96705dff558\n+4a86f3e2d463a377064e43a54ce93285\n $fFoldableProd0_$cfoldl' :: (b -> a -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @b\n @a\n (f['GHC.Types.Many] :: b -> a -> b)\n (z0['GHC.Types.Many] :: b)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n z0]\n-2d614392730a859cceb436ca373f488d\n+c445b2092fe1d483c43b7cc522582a76\n $fFoldableProd0_$cfoldl1 :: (a -> a -> a) -> Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (f['GHC.Types.Many] :: a -> a -> a)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n $fFoldableProd14]\n-0a6c7d3fff9ba675e6afd0807a3d4864\n+719f5909da9f60f9702b17879fec5ee0\n $fFoldableProd0_$cfoldr :: (a -> b -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (f['GHC.Types.Many] :: a -> b -> b)\n (z['GHC.Types.Many] :: b)\n (t1['GHC.Types.Many] :: Prod '[] a) ->\n z]\n-2acc293bf731da6b9d899cccb9739b2c\n+e4a6425a70493d398490af226d0914bd\n $fFoldableProd0_$cfoldr1 :: (a -> a -> a) -> Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (f['GHC.Types.Many] :: a -> a -> a)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n $fFoldableProd16]\n-1591727ab229b813a359974a7183da34\n+1aa741a05c694b1959ba7ac9ca06e641\n $fFoldableProd0_$clength :: Prod '[] a -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (xs['GHC.Types.Many] :: Prod '[] a) -> $fFoldableProd4]\n-10fc8dfa3773d3c6d061e1100f258c90\n+9c74c99068f20a79943e2ca9f2eb9b5e\n $fFoldableProd0_$cmaximum :: GHC.Classes.Ord a => Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a)\n (eta['GHC.Types.Many] :: Prod '[] a)[OneShot] ->\n $w$cmaximum @a GHC.Prim.(##)]\n-85cf510a5bd7eb3f1336b2b9b818f9d1\n+e4c276c4a6a621dc76427c5f52cb46fa\n $fFoldableProd0_$cminimum :: GHC.Classes.Ord a => Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a)\n (eta['GHC.Types.Many] :: Prod '[] a)[OneShot] ->\n $w$cminimum @a GHC.Prim.(##)]\n-29c59c3873629bc4bdfc7d535b880248\n+96fafd1ad9f8976556c8c02c751fc29a\n $fFoldableProd0_$cnull :: Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 2,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (t1['GHC.Types.Many] :: Prod '[] a) -> GHC.Types.True]\n-769affa520f9e6770a820fb318aeb5b5\n+5e1feb3afa748286912f7071327ea099\n $fFoldableProd0_$ctoList :: Prod '[] a -> [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @a (t1['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Base.build\n @a\n (\\ @b\n (c['GHC.Types.Many] :: a -> b -> b)[OneShot]\n (n['GHC.Types.Many] :: b)[OneShot] ->\n n)]\n-69b29e34cf709f795dbc2e597f7a462f\n+765fe706e04a4fb01ae513edcbdcf033\n $fFoldableProd1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Num.Num a) =>\n Prod (f : fs) a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1014,73 +1014,73 @@\n @a\n (Data.Semigroup.Internal.$fMonoidProduct @a $dNum)\n (\\ (ds['GHC.Types.Many] :: a) -> ds)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Product[0]\n _R))]\n-ad24b9d4ac30d2c50640b17fbb8d4d75\n+7a6372e0a9d6e03916dba89989f787aa\n $fFoldableProd10 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual\n (Data.Semigroup.Internal.Endo (b -> b)))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @b ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo (b -> b))\n (Data.Semigroup.Internal.$fMonoidEndo @(b -> b))]\n-89d36385e10d4f5d924b90e4bd1640b3\n+cedd79bc640d88db2ceba030d761105a\n $fFoldableProd11 :: GHC.Num.Num a => Prod '[] a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,A,A,A,A,A,1C(1,L))>, Inline:,\n Unfolding: Core: StableUser <2,TrueTrue>\n \\ @a\n ($dNum['GHC.Types.Many] :: GHC.Num.Num a)\n (eta['GHC.Types.Many] :: Prod '[] a) ->\n Data.Semigroup.Internal.$fMonoidProduct1 @a $dNum]\n-42c00bfbbaf64624f904614eb84b6820\n+6db7715f3267c45d0926239d6abe2140\n $fFoldableProd12 :: GHC.Num.Num a => Prod '[] a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,A,A,A,A,A,1C(1,L))>, Inline:,\n Unfolding: Core: StableUser <2,TrueTrue>\n \\ @a\n ($dNum['GHC.Types.Many] :: GHC.Num.Num a)\n (eta['GHC.Types.Many] :: Prod '[] a) ->\n Data.Semigroup.Internal.$fMonoidSum1 @a $dNum]\n-f9d87cf560ac5b8530148e5f8bc9158b\n+3decceff816a13d9e7dc8c34201b29c5\n $fFoldableProd13 ::\n GHC.Classes.Eq a => a -> Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n (eta['GHC.Types.Many] :: a)\n (ds['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Types.False]\n-9f00bdabdfd557a90df2bad65da614fc\n+51ec32caffcafe7597f19776378746d8\n $fFoldableProd14 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fFoldableProd15]\n-4ab699c5ac50fe447440a7987f00ac88\n+59b361a663e88805ba2ef85570091c8a\n $fFoldableProd15 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"foldl1: empty structure\"#]\n-410adac3e3d87107a8f8d4979a3f6cda\n+e32b6e6033da1df547da2a1e120ce447\n $fFoldableProd16 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fFoldableProd17]\n-07818e51b50aed348fd6087f05dda326\n+5739d43836f5ced5902da684dc0ef4a1\n $fFoldableProd17 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"foldr1: empty structure\"#]\n-8a8b693e17b0290381c048d2bc343487\n+44cb7b7201b1b3c108c903f02ea08d0e\n $fFoldableProd2 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Num.Num a) =>\n Prod (f : fs) a -> Data.Semigroup.Internal.Sum a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1100,15 +1100,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidSum @a $dNum)\n (\\ (ds['GHC.Types.Many] :: a) -> ds)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Sum[0]\n _R))]\n-7c438b1e20419f602e10d632ca4b7e52\n+95f99c2213bedeaf7d797b23ffd89bc6\n $fFoldableProd3 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Eq a) =>\n a -> Prod (f : fs) a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n@@ -1151,62 +1151,62 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Any[0]))\n fas\n GHC.Types.True\n -> GHC.Types.True\n `cast`\n (Sym (Data.Semigroup.Internal.N:Any[0])) } }]\n-37e9309f30cb45328d558446a6daf322\n+a549b2161882e426e07e659a56e5c344\n $fFoldableProd4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-bfae15141012ec47c4a1e3edd96c59c9\n+e1f7d6a6051795d2b104411a70a4c58d\n $fFoldableProd5 ::\n a\n -> (GHC.Types.Int -> GHC.Types.Int)\n -> GHC.Types.Int\n -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)><1!P(L)>,\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @a\n (ds['GHC.Types.Many] :: a)\n (ds1['GHC.Types.Many] :: GHC.Types.Int -> GHC.Types.Int)\n (v['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case v of z { GHC.Types.I# ipv ->\n ds1 (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }]\n-14b3a2210c21d1e47b3e4e64162fdced\n+399f423a741887f8be30fd1fd27ca6bd\n $fFoldableProd6 :: a -> GHC.Types.Bool -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (ds['GHC.Types.Many] :: a)\n (ds1['GHC.Types.Many] :: GHC.Types.Bool) ->\n GHC.Types.False]\n-9495725131453ae9e7c4b89050543ce8\n+ac813c197874437c1bd8357625ba630a\n $fFoldableProd7 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-523abbb1357c93d65129c97baf25a784\n+92d0da61c41b14a6cdb188bd2a5ac594\n $fFoldableProd8 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual (Data.Semigroup.Internal.Endo b))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @b ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo b)\n (Data.Semigroup.Internal.$fMonoidEndo @b)]\n-b10ad345472c2f7de668d5abf15a2014\n+2f7220d401861305a7345264266bb6e6\n $fFoldableProd9 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-7a2daa71eb24c3fa6f403d580074d49f\n+52400307f6657f0905b41c5f0e1950d0\n $fFoldableProd_$cfold ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n Prod (f : fs) m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Inline: (sat-args=0),\n@@ -1222,15 +1222,15 @@\n @fs\n $dFoldable\n $dFoldable1\n @m\n @m\n $dMonoid\n (GHC.Base.id @m)]\n-9c7a6c18410b8b69f59de3e8d5b21445\n+1bad42d1c01dc31b88fef922777cc24f\n $fFoldableProd_$cfoldMap ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n (a -> m) -> Prod (f : fs) a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -1261,15 +1261,15 @@\n `cast`\n (Data.Foldable.Foldable (Prod <*>_N (SelCo:Tc(2) co))_N)_R\n @m\n @a\n $dMonoid\n f1\n fas) }]\n-e6f0e846083131ce27f102ba9d664984\n+9897affe8611cfc875edd507c7c0d4a3\n $fFoldableProd_$cfoldMap' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n (a -> m) -> Prod (f : fs) a -> m\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n@@ -1324,15 +1324,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n m>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m))\n (GHC.Base.mempty @m $dMonoid) }]\n-c81fead342660d96465ad3c1d8c7ec85\n+f8f387fc03fcea2da63b220a9a631ab0\n $fFoldableProd_$cfoldl ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (b -> a -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1378,15 +1378,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1) }]\n-e67c040fe7ae4af11fbe19a665b6352d\n+86afe4723a0280d0bc3fbfa44d5e24c3\n $fFoldableProd_$cfoldl' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (b -> a -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <4,FalseFalse>\n@@ -1435,15 +1435,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n b>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] b>_R)\n (GHC.Base.id @b))\n eta1 }]\n-41b9f905adcf3b7feb642ab8048848a1\n+33056f671e30dbc17c4bbb9e076ba24d\n $fFoldableProd_$cfoldl1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> a -> a) -> Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1505,15 +1505,15 @@\n _R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n (GHC.Maybe.Nothing @a)) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableProd7 @a GHC.Maybe.Just v -> v } }]\n-bed74a1e6b0ec6649d3c06f58913643a\n+866060a25988499dd9950a4c055cb694\n $fFoldableProd_$cfoldr ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> b -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1553,15 +1553,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n z) }]\n-966bc21e360f05be6894a34302550d54\n+a7174f510cee4f89446fb2d47f09b211\n $fFoldableProd_$cfoldr' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> b -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1616,15 +1616,15 @@\n b>_R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] b>_R))\n (GHC.Base.id @b))\n z0 }]\n-c9e7752608f923dcf22c91b580eea6ca\n+91a24477778e5bcd291cc5286c04c46d\n $fFoldableProd_$cfoldr1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> a -> a) -> Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1680,15 +1680,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a)) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableProd9 @a GHC.Maybe.Just v -> v } }]\n-0c69fe78bad62d3a571fc4737f5fdb9a\n+9c8b168dbf86d2a74e86dc1bdc408b0f\n $fFoldableProd_$clength ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> GHC.Types.Int\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1730,15 +1730,15 @@\n GHC.Types.Int>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int))\n $fFoldableProd4 }]\n-4abbbbc447849cf2869b793fb89ef1c1\n+094ae9182e95e0d6c7af50658dabc920\n $fFoldableProd_$cmaximum ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Ord a) =>\n Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1780,15 +1780,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Max[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Max[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-7af86c89dcdadae12687fd02ebd24462\n+86e2a903127a1ebaf8e6fe2a2e126249\n $fFoldableProd_$cminimum ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Ord a) =>\n Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1830,15 +1830,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Min[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Min[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-0ef7d28a63bdb1be5d07be845a2d4b58\n+1f96dee9c1b6b81212fa314a261dc1a7\n $fFoldableProd_$cnull ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> GHC.Types.Bool\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1875,15 +1875,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True) }]\n-185aac1c6c98e1e378803c57c75f2332\n+af8de4008f99eb32566d678c4db224c0\n $fFoldableProd_$ctoList ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> [a]\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -1904,57 +1904,57 @@\n $dFoldable\n $dFoldable1\n @a\n @b\n c\n n\n eta)]\n-5d2e63ce77f9188ebdf94a3bd8f35300\n+18f198a37ab610a3f8d0dde3bf7834a9\n $fFunctorProd ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: GHC.Base.Functor f)\n (v1['GHC.Types.Many] :: GHC.Base.Functor (Prod fs)).\n @(Prod (f : fs))\n ($fFunctorProd_$cfmap @f @fs v v1)\n ($fFunctorProd_$c<$ @f @fs v v1)]\n-e1fe0c10ead2c678d0f3f43dc96350fc\n+1c3b7dbd069b5284f1b8ff32f800351d\n $fFunctorProd0 :: GHC.Base.Functor (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Functor], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[]) $fFunctorProd0_$cfmap $fFunctorProd0_$c<$]\n-35b5ef16cbe85df775d864190017609a\n+9a9ede9301c0a4b28161fdf6e442967f\n $fFunctorProd0_$c<$ :: a -> Prod '[] b -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n (eta['GHC.Types.Many] :: a)\n (ds['GHC.Types.Many] :: Prod '[] b) ->\n case ds of wild { Unit co -> $WUnit @(*) @a }]\n-b20b2a557c3cd33480f5669b22e9b8be\n+155874005133452af3c6215c6b590a5a\n $fFunctorProd0_$cfmap :: (a -> b) -> Prod '[] a -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds1 of wild { Unit co -> $WUnit @(*) @b }]\n-1d7785d49c8dff8e008999971775e57e\n+014b20d58cf574724f554e6b632fe03b\n $fFunctorProd_$c<$ ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n a -> Prod (f : fs) b -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -1991,15 +1991,15 @@\n (GHC.Base.fmap\n @(Prod fs)\n $dFunctor1\n @b\n @a\n f2\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-3d9f0a6a736618a6f46129420b75208d\n+271bf5e9bb09d8ffdbe5238f7f99c683\n $fFunctorProd_$cfmap ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n (a -> b) -> Prod (f : fs) a -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2029,15 +2029,15 @@\n (GHC.Base.fmap\n @(Prod fs)\n $dFunctor1\n @a\n @b\n f1\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-1d91a558e7f9aedecd7e1a8c8fc4e726\n+7d9c2a120967dea7271a883bcc6ecbba\n $fOrd1Prod ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Data.Functor.Classes.Ord1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -2048,37 +2048,37 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Ord1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Ord1 (Prod fs)).\n @(Prod (f : fs))\n ($fOrd1Prod_$cp1Ord1 @f @fs v v1)\n (\\ @a ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a) ->\n $fOrdProd @f @a @fs v $dOrd v1)\n ($fOrd1Prod_$cliftCompare @f @fs v v1)]\n-37747232bce33190765d838c1402dbf3\n+35593db33cd3272ad62b0f0947b26a8f\n $fOrd1Prod0 :: Data.Functor.Classes.Ord1 (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Ord1],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[]) $fEq1Prod0 $fOrdProd0 $fOrd1Prod0_$cliftCompare]\n-6db24e3fb0c1c5bbe44532cc91141661\n+69c4c43d0f231d705977313e1b5948cc\n $fOrd1Prod0_$cliftCompare ::\n (a -> b -> GHC.Types.Ordering)\n -> Prod '[] a -> Prod '[] b -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 2,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b -> GHC.Types.Ordering)\n (ds1['GHC.Types.Many] :: Prod '[] a)\n (ds2['GHC.Types.Many] :: Prod '[] b) ->\n case ds1 of wild { Unit co ->\n case ds2 of wild1 { Unit co1 -> GHC.Types.EQ } }]\n-c3534ae34b59171382b1f6a68c48f2ab\n+85696df2593a70554e26f85b80ac754e\n $fOrd1Prod_$cliftCompare ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n (a -> b -> GHC.Types.Ordering)\n -> Prod (f : fs) a -> Prod (f : fs) b -> GHC.Types.Ordering\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2119,15 +2119,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-94d0c4a86a3a12f76fb902dbe33047eb\n+3d538142cfcf7f7b549bac1972aaa8d5\n $fOrd1Prod_$cp1Ord1 ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Data.Functor.Classes.Eq1 (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -2137,15 +2137,15 @@\n ($dOrd1['GHC.Types.Many] :: Data.Functor.Classes.Ord1 f)\n ($dOrd2['GHC.Types.Many] :: Data.Functor.Classes.Ord1 (Prod fs)) ->\n $fEq1Prod\n @f\n @fs\n (Data.Functor.Classes.$p1Ord1 @f $dOrd1)\n (Data.Functor.Classes.$p1Ord1 @(Prod fs) $dOrd2)]\n-ad8a0e96f0f266b21f585654b2ed1c31\n+c185a99c98584402b5f9e95300f61f3d\n $fOrdProd ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n GHC.Classes.Ord (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -2164,15 +2164,15 @@\n ($fOrdProd_$c<= @f @a @fs v v1 v2)\n ($fOrdProd_$c> @f @a @fs v v1 v2)\n (\\ (x['GHC.Types.Many] :: Prod (f : fs) a)\n (y['GHC.Types.Many] :: Prod (f : fs) a) ->\n $fOrdProd_$c<= @f @a @fs v v1 v2 y x)\n ($fOrdProd_$cmax @f @a @fs v v1 v2)\n ($fOrdProd_$cmin @f @a @fs v v1 v2)]\n-212a0c7b281a9d2f24dc9f9630309a38\n+376bab956c471d789ca3b3881dbed599\n $fOrdProd0 :: GHC.Classes.Ord a => GHC.Classes.Ord (Prod '[] a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Classes.Ord a).\n @(Prod '[] a)\n ($fOrdProd0_$cp1Ord @a v)\n@@ -2199,23 +2199,23 @@\n (\\ (x['GHC.Types.Many] :: Prod '[] a)\n (y['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co -> y })\n (\\ (x['GHC.Types.Many] :: Prod '[] a)\n (y['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co ->\n case y of wild1 { Unit co1 -> wild } })]\n-f03453389d0fd75c712fb52f361bdbb0\n+c01cfa0552fc0c9670078ca323bc14d8\n $fOrdProd0_$cp1Ord ::\n GHC.Classes.Ord a => GHC.Classes.Eq (Prod '[] a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @a ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a) ->\n $fEqProd0 @a (GHC.Classes.$p1Ord @a $dOrd)]\n-657138cfe492ce1444bcf8290136cd5d\n+202e5fa07c7ebcd92d7f465a7f7b4ce3\n $fOrdProd_$c< ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2234,15 +2234,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n y\n x of wild {\n DEFAULT -> GHC.Types.False GHC.Types.GT -> GHC.Types.True }]\n-5c8a507e84a41cced986357db14b8631\n+70e91e87fcdea1710bc7b36ff3301f64\n $fOrdProd_$c<= ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2261,15 +2261,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> GHC.Types.True GHC.Types.GT -> GHC.Types.False }]\n-d70f34cff32f5e3756c5de0cc60bf7b5\n+1109e667665fb308c19da61929f84b9a\n $fOrdProd_$c> ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2288,15 +2288,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> GHC.Types.False GHC.Types.GT -> GHC.Types.True }]\n-869dd2c75cbd28c3b9b2f3114a8faa3d\n+ebe33d07ec27c49b8d0151f4112f4e41\n $fOrdProd_$ccompare ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Ordering\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -2339,15 +2339,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-664e3fec4d78c7e237e9cb3b498b865e\n+745990ba2877b119ee4369d82e2fbb05\n $fOrdProd_$cmax ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -2365,15 +2365,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> y GHC.Types.GT -> x }]\n-a24e3d36ec26b1a8d0a90fdcad9d42f1\n+2a1f6d36ab3e9ca40b3f7ee02e9eb44d\n $fOrdProd_$cmin ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -2391,15 +2391,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> x GHC.Types.GT -> y }]\n-07f196658fec8f28504840008a125d4b\n+dd2b034c8b83f190dd81d5949cf2cd14\n $fOrdProd_$cp1Ord ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n GHC.Classes.Eq (Prod (f : fs) a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n Strictness: ,\n@@ -2413,15 +2413,15 @@\n $fEqProd\n @f\n @a\n @fs\n (Data.Functor.Classes.$p1Ord1 @f $dOrd1)\n (GHC.Classes.$p1Ord @a $dOrd)\n (Data.Functor.Classes.$p1Ord1 @(Prod fs) $dOrd2)]\n-855c50fbfe417001be74014a7c530ffd\n+f72a05ac87f7d4b0db3e99f2ee86c395\n $fShow1Prod ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n Data.Functor.Classes.Show1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -2432,39 +2432,39 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Show1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Show1 (Prod fs)).\n @(Prod (f : fs))\n (\\ @a ($dShow['GHC.Types.Many] :: GHC.Show.Show a) ->\n $fShowProd @f @a @fs v $dShow v1)\n ($fShow1Prod_$cliftShowsPrec @f @fs v v1)\n ($fShow1Prod_$cliftShowList @f @fs v v1)]\n-8f5cc8b096172543b66beca898319072\n+121fa5b2932af052532e2e0fb362af80\n $fShow1Prod0 :: Data.Functor.Classes.Show1 (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Show1],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fShowProd0\n $fShow1Prod0_$cliftShowsPrec\n $fShow1Prod0_$cliftShowList]\n-c9ebf33bdc7a7e5cd781bb4c1ef11a55\n+1325d4d4099c4571fd1d73d670e65a7e\n $fShow1Prod0_$cliftShowList ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Prod '[] a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n \\ @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (eta['GHC.Types.Many] :: [Prod '[] a])\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Prod '[] a) ($fShow1Prod4 @a) eta eta1]\n-23bfdbd365bb687d11bca0d85ce97dfe\n+f713e90558045931c878017715a6cd65\n $fShow1Prod0_$cliftShowsPrec ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Prod '[] a\n -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -2474,42 +2474,42 @@\n (ds['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (ds1['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (ds2['GHC.Types.Many] :: GHC.Types.Int)\n (ds3['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds3 of wild { Unit co ->\n GHC.CString.unpackAppendCString# $fShow1Prod5 eta }]\n-6040d85b280aabe26013b2318d960dd0\n+45bb9021211fd05db5f3037acd00857f\n $fShow1Prod1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \" `prod` \"#]\n-a70703d856884be94901f961f53d37e6\n+f4fd576d1c98509a1f9deca9794d9594\n $fShow1Prod2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"oneTuple \"#]\n-05737f14b94806046c763016b9a844c4\n+c17f436ecd12c6353c34d5ed596ef09f\n $fShow1Prod3 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 11#]\n-86560ed452101d6d6bbe9ba21459b910\n+c6dcd855108e1f62f9dd244112d61e46\n $fShow1Prod4 :: Prod '[] a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @a\n (ds['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Unit co ->\n GHC.CString.unpackAppendCString# $fShow1Prod5 eta }]\n-02ed72b02291748ad4f9755ad1e4b0ab\n+a78cfa2e8dd0e61bcdb32448e2956256\n $fShow1Prod5 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"zeroTuple\"#]\n-8fbbd769fb63ad94ff7e2158a9169335\n+a59e0576e735270e51b50ed7a9fe3dbb\n $fShow1Prod_$cliftShowList ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Prod (f : fs) a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n Strictness: <1L>,\n@@ -2525,15 +2525,15 @@\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Prod (f : fs) a)\n (\\ (ds['GHC.Types.Many] :: Prod (f : fs) a) ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a sp sl 0# ds)\n eta\n eta1]\n-df35a415834cbb48a2d441ed1ff9cd85\n+a24aae26efd62d5f14dea9eb23e7a6d4\n $fShow1Prod_$cliftShowsPrec ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Prod (f : fs) a\n@@ -2549,15 +2549,15 @@\n @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (d['GHC.Types.Many] :: GHC.Types.Int)\n (ds['GHC.Types.Many] :: Prod (f : fs) a) ->\n case d of wild { GHC.Types.I# ww ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a sp sl ww ds }]\n-6b704d95bf5d0c4eb0754dc654620af0\n+25fefadfe8f55d5fe94229734a3f80da\n $fShowProd ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n GHC.Show.Show (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -2569,15 +2569,15 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Show1 f)\n (v1['GHC.Types.Many] :: GHC.Show.Show a)\n (v2['GHC.Types.Many] :: Data.Functor.Classes.Show1 (Prod fs)).\n @(Prod (f : fs) a)\n ($fShowProd_$cshowsPrec @f @a @fs v v1 v2)\n ($fShowProd_$cshow @f @a @fs v v1 v2)\n ($fShowProd_$cshowList @f @a @fs v v1 v2)]\n-36bd69d638d84b0c9011e25b94927f37\n+d892891347dd580c41fdb87d355863c1\n $fShowProd0 :: GHC.Show.Show a => GHC.Show.Show (Prod '[] a)\n DFunId\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Show.Show a).\n @(Prod '[] a)\n (\\ (ds['GHC.Types.Many] :: GHC.Types.Int)\n@@ -2592,19 +2592,19 @@\n GHC.Base.foldr @GHC.Types.Char @b c n $fShowProd1)\n eta })\n (\\ (x['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co -> $fShowProd1 })\n (\\ (ls['GHC.Types.Many] :: [Prod '[] a])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Prod '[] a) ($fShow1Prod4 @a) ls s)]\n-9eb66a1c818504181fb9f574e7cd1720\n+8be78c6edde4fb30d49351c8a3284352\n $fShowProd1 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShow1Prod5]\n-a053013a0790033e466a5c562de2b535\n+f7839d77d2b79b4dcfb4fdb8437bf1fc\n $fShowProd_$cshow ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n Prod (f : fs) a -> GHC.Base.String\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2622,15 +2622,15 @@\n $dShow2\n @a\n (GHC.Show.showsPrec @a $dShow)\n (GHC.Show.showList @a $dShow)\n 0#\n x\n (GHC.Types.[] @GHC.Types.Char)]\n-76d3ff93dc37bbf06c2927969ecf3e30\n+ea5904abaa531119e6ded79598aaaf4a\n $fShowProd_$cshowList ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n [Prod (f : fs) a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2651,15 +2651,15 @@\n } in\n GHC.Show.showList__\n @(Prod (f : fs) a)\n (\\ (eta['GHC.Types.Many] :: Prod (f : fs) a) ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a lvl17 lvl18 0# eta)\n ls\n s]\n-1cd08022144c792cd4843c9be57b0294\n+6d3b3f1144defe2af062303cf273429e\n $fShowProd_$cshowsPrec ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n GHC.Types.Int -> Prod (f : fs) a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1!P(L)><1L>,\n Unfolding: Core: StableSystem <5,TrueFalse>\n@@ -2677,15 +2677,15 @@\n $dShow1\n $dShow2\n @a\n (GHC.Show.showsPrec @a $dShow)\n (GHC.Show.showList @a $dShow)\n eta\n eta1]\n-5d01825ab33355d311525636fee8f738\n+d5bd819362f59b1688758c98ac50ea3b\n $fTraversableProd ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n Data.Traversable.Traversable (Prod (f : fs))\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -2697,15 +2697,15 @@\n @(Prod (f : fs))\n ($fTraversableProd_$cp1Traversable @f @fs v v1)\n ($fTraversableProd_$cp2Traversable @f @fs v v1)\n ($fTraversableProd_$ctraverse @f @fs v v1)\n ($fTraversableProd_$csequenceA @f @fs v v1)\n ($fTraversableProd_$cmapM @f @fs v v1)\n ($fTraversableProd_$csequence @f @fs v v1)]\n-3b2a3b73f7dd70b63122c555207ed317\n+7a6baf078396f6ad5b96ceb718b1172d\n $fTraversableProd0 :: Data.Traversable.Traversable (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Traversable.C:Traversable],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n@@ -2736,41 +2736,41 @@\n (eta['GHC.Types.Many] :: Prod '[] (m a)) ->\n case eta of wild { Unit co ->\n GHC.Base.pure\n @m\n (GHC.Base.$p1Monad @m $dMonad)\n @(Prod '[] a)\n ($WUnit @(*) @a) })]\n-c3867ecf5efe7ba588428ce298e53978\n+d2d78e1dc58e2b3245c590ce6a0cb850\n $fTraversableProd0_$ctraverse ::\n GHC.Base.Applicative f =>\n (a -> f b) -> Prod '[] a -> f (Prod '[] b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)><1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @f :: * -> *\n @a\n @b\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative f)\n (ds['GHC.Types.Many] :: a -> f b)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds1 of wild { Unit co ->\n GHC.Base.pure @f $dApplicative @(Prod '[] b) ($WUnit @(*) @b) }]\n-994d310e65b43d87d3863ae3a69c83c3\n+6fb1faa8a386a2f758a3d9fabb3e0958\n $fTraversableProd1 :: f b -> Prod fs b -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @fs :: [* -> *]\n @b\n @f :: * -> *\n (ds['GHC.Types.Many] :: f b)\n (ds1['GHC.Types.Many] :: Prod fs b) ->\n $WCons @(*) @f @b @fs ds ds1]\n-6a78ef91de97b175be1f2b03b10facfe\n+e3b6b0917be90d9232a0a43cf86155c8\n $fTraversableProd_$cmapM ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Monad m) =>\n (a -> m b) -> Prod (f : fs) a -> m (Prod (f : fs) b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(1P(L,L,SC(S,L),L,L,L),A,A,A)><1L>,\n Inline: (sat-args=0),\n@@ -2793,15 +2793,15 @@\n $dTraversable1\n @m\n @a\n @b\n (GHC.Base.$p1Monad @m $dMonad)\n eta\n eta1]\n-0a0327f95920457020c038ffe7dd5aab\n+781f34f21daaaeb91fc4ce3c170eabbd\n $fTraversableProd_$cp1Traversable ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -2812,15 +2812,15 @@\n ($dTraversable1['GHC.Types.Many] :: Data.Traversable.Traversable\n (Prod fs)) ->\n $fFunctorProd\n @f\n @fs\n (Data.Traversable.$p1Traversable @f $dTraversable)\n (Data.Traversable.$p1Traversable @(Prod fs) $dTraversable1)]\n-1f8f48676092672bd6a4378512a1d413\n+4894af1253c0757e5ab63b02b975e612\n $fTraversableProd_$cp2Traversable ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n Data.Foldable.Foldable (Prod (f : fs))\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -2830,15 +2830,15 @@\n ($dTraversable1['GHC.Types.Many] :: Data.Traversable.Traversable\n (Prod fs)) ->\n $fFoldableProd\n @f\n @fs\n (Data.Traversable.$p2Traversable @f $dTraversable)\n (Data.Traversable.$p2Traversable @(Prod fs) $dTraversable1)]\n-a5b4473cc8d08cef8c0902d6550b09f8\n+339ce2a42d32bf48ab37c0bc3c672971\n $fTraversableProd_$csequence ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Monad m) =>\n Prod (f : fs) (m a) -> m (Prod (f : fs) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(1P(L,L,SC(S,L),L,L,L),A,A,A)><1L>,\n Inline: (sat-args=0),\n@@ -2859,15 +2859,15 @@\n $dTraversable1\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))\n eta]\n-9548a0e69b208274d90a8c7dc15518c7\n+df050f680bf221b38bcf0f8dbf7dbcca\n $fTraversableProd_$csequenceA ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Applicative f1) =>\n Prod (f : fs) (f1 a) -> f1 (Prod (f : fs) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Inline: (sat-args=0),\n@@ -2886,15 +2886,15 @@\n $dTraversable\n $dTraversable1\n @f1\n @(f1 a)\n @a\n $dApplicative\n (GHC.Base.id @(f1 a))]\n-0343881b4a56387c10c2a90640c35e57\n+a5a048310f0dae1c8a44b9b9675c0016\n $fTraversableProd_$ctraverse ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Applicative f1) =>\n (a -> f1 b) -> Prod (f : fs) a -> f1 (Prod (f : fs) b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2935,114 +2935,114 @@\n $dTraversable1\n @f1\n @a\n @b\n $dApplicative\n eta\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-3a7e9dbd4e89ac8fd507b72fa2111de7\n+4782daeefb209cc6e70ef18754396e57\n $tc'Cons :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11681214518383820212#Word64\n- 2262654514700322604#Word64\n+ 18095855829200529283#Word64\n+ 9349079441430715829#Word64\n $trModule\n $tc'Cons2\n 4#\n $tc'Cons1]\n-2d30aab6bb6c9f3ccc2dd62a32a8a4e7\n+f490e18cf82ec30f624196fb2d39a6f8\n $tc'Cons1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-08b2ad063a71ee45a7a8536f65c5f05e\n+ac2fac9d90fc111a15d4c4e1f0373958\n $tc'Cons2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Cons3]\n-e3a9582364945a3fdad675ea10bdcc1f\n+673b81b4c9c40dc2d20878f9ec48ef25\n $tc'Cons3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Cons\"#]\n-23c432102357c63bee6ce1d940488243\n+8789339d671dda0e1838d22e1becb0b9\n $tc'Unit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2737625517741220644#Word64\n- 14927981062871196765#Word64\n+ 15781974758605816177#Word64\n+ 16358358308405845360#Word64\n $trModule\n $tc'Unit2\n 2#\n $tc'Unit1]\n-2429097e1acb268ce9793d5db542e0a0\n+418bfb310cc853e69fb766e32e83d141\n $tc'Unit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepTyConApp], Inline: [~]]\n-ef7f66f0388ec3705825a2b11d93dfc1\n+04f400db1544e18727e6796980fb30bf\n $tc'Unit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Unit3]\n-ddaeada3f0566f7815c9e05b7300032e\n+2c734cda52aa5fe049c2bfcf7cfc3840\n $tc'Unit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Unit\"#]\n-0e492da99a3933300f7b3e0d015148c0\n+2ed43a4576836a463acca268b71b8a3d\n $tcProd :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14117411816903489973#Word64\n- 14719450260367156357#Word64\n+ 3702848797303664329#Word64\n+ 10218302260542951913#Word64\n $trModule\n $tcProd2\n 1#\n $tcProd1]\n-2de61373d3d737f58856631f27dceee2\n+f54ab60f1ab8f6a112c7fbfe92586cc8\n $tcProd1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a97e04b764d396aa8167339adaadef46\n+e3e0086e5a1912106894ddb48ff470c0\n $tcProd2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProd3]\n-00e226dbe680d3c6ac85038ff4d4c99a\n+9923d18a971c1c15108c89fd1447c454\n $tcProd3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Prod\"#]\n-96413630781f30772b6c77bfceb7b732\n+906c64d92ef88a476b272f9edc5a91ea\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-73cc961c32c4a687204c0957a65feeb0\n+17f845fc0196fa3ce77813ba405a6638\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-87213e996837faaa8a48f4019e90aa67\n+c20d6e6345b74f747bf755752914420e\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Prod\"#]\n-9d88598cebc62d018fc3a21bcf4fc75a\n+5bfdf37dfd9aa57f39882f24a094c609\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-3dd39a97079e5daf4ad26745a000cb24\n+b28fc42724998d51c11e83bd2397d601\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e7c758d61272018c6faaf4f73d3ffe58\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+5b7d769a077d6ef1675a22ac50823268\n $w$cliftShowsPrec ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Prim.Int#\n -> Prod (f : fs) a\n@@ -3125,76 +3125,76 @@\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShow1Prod2\n (f2\n (GHC.CString.unpackAppendCString#\n $fShow1Prod1\n (g (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x))))) } } }]\n-0b067dc8d1998b2bb8488e3bb8a8fcc6\n+7ed7e132d60bf3187c2f5785260bf37d\n $w$cmaximum :: (# #) -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableUser\n \\ @a (void['GHC.Types.Many] :: (# #)) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString# @b \"maximum: empty structure\"#))]\n-4629527230dd254a906d75e3508133d9\n+47e711ca318660bfa85409cb439f1aa5\n $w$cminimum :: (# #) -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableUser\n \\ @a (void['GHC.Types.Many] :: (# #)) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString# @b \"minimum: empty structure\"#))]\n-8fdd6a3df6caa085c48f6e4cd62d707f\n+9e1a347b81f82e99eae15e6701e5fdc9\n type (++) :: forall k. [k] -> [k] -> [k]\n type family (++) l r where\n forall k (ys :: [k]). (++) '[] ys = ys\n forall k (x :: k) (xs :: [k]) (ys :: [k]).\n (++) (x : xs) ys = x : (xs ++ ys)\n axiom D:R:++\n-81aef0e416fe3eced281ba9e3418f8e5\n+b9e832e839646ad593d0f98d996de215\n type Curried :: * -> *\n type family Curried t where\n forall k (a :: k) (r :: k -> *). Curried (Prod '[] a -> r a) = r a\n forall k (t :: GHC.Types.RuntimeRep) (f :: k -> *) (fs :: [k -> *])\n (a :: k) (r :: k -> GHC.Prim.TYPE t).\n Curried (Prod (f : fs) a -> r a)\n = f a -> Curried (Prod fs a -> r a)\n axiom D:R:Curried\n-c942a9be1f9dd46c9c4c3c3efa39164b\n+2eb68f31ecc22041f9172906f1ef8c19\n axiom D:R:++ ::\n forall k (ys :: [k]). ++ '[] ys = ys\n forall k (x :: k) (xs :: [k]) (ys :: [k]).\n ++ (x : xs) ys = x : (xs ++ ys)\n-215dbd0d8d46680c2d0c3eab2a27a8df\n+48d63156e2c4beaa2ae9d29c8f291fd6\n axiom D:R:Curried ::\n forall k (a :: k) (r :: k -> *). Curried (Prod '[] a -> r a) = r a\n forall k (t :: GHC.Types.RuntimeRep) (f :: k -> *) (fs :: [k -> *])\n (a :: k) (r :: k -> GHC.Prim.TYPE t).\n Curried (Prod (f : fs) a -> r a)\n = f a -> Curried (Prod fs a -> r a)\n-46923a6801bbd445e7f64b45bc2641db\n+72871df9eab61fc1dcceb25a27d59350\n type role Prod nominal nominal\n type Prod :: forall k. [k -> *] -> k -> *\n data Prod a b where\n Unit :: forall {k} (b :: k). Prod '[] b\n Cons :: forall {k} (f :: k -> *) (b :: k) (fs :: [k -> *]).\n f b -> Prod fs b -> Prod (f : fs) b\n-4815e6e8318430a80a5e3a006555c5de\n+6ed6946a398f24c48583bf39fdbda7c5\n fromProduct ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> Prod '[f, g] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(L,L)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n@@ -3208,28 +3208,28 @@\n @'[f, g]\n @a\n @f\n @'[g]\n @~<'[f, g]>_N\n fa\n (Cons @k @'[g] @a @g @'[] @~<'[g]>_N ga ($WUnit @k @a)) }]\n-3db31f80980168074f72230541dcdcbf\n+dccad5e79060be1077ae216131d87662\n oneTuple :: forall {k} (f :: k -> *) (a :: k). f a -> Prod '[f] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * @a :: k (fa['GHC.Types.Many] :: f a) ->\n Cons @k @'[f] @a @f @'[] @~<'[f]>_N fa ($WUnit @k @a)]\n-ce6744d0fed199a0f3297258e8b39d71\n+783ee96f7bfd3c24f11aaa471e0ddbde\n prod ::\n forall {k} (ls :: [k -> *]) (a :: k) (rs :: [k -> *]).\n Prod ls a -> Prod rs a -> Prod (ls ++ rs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1L>]\n-a205c7411346ec6b39452528f4a2813c\n+7f5fa7242adb897c121c28dc2a3de0af\n toProduct ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Prod '[f, g] a -> Data.Functor.Product.Product f g a\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n@@ -3250,27 +3250,27 @@\n fa `cast` (Sub (SelCo:Tc(1) (Sym co)) _N)\n ga\n `cast`\n (Sub (SelCo:Tc(1)\n (Sym co1\n ; SelCo:Tc(2) (Sym co))) _N)\n Cons ipv ipv1 ipv2 ipv3 ipv4 -> toProduct1 @k @f @g @a } } }]\n-d3aadb0a37bb59155db55af33446469a\n+5d07bd02252cbe2363bc3e6bad5ff146\n toProduct1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-ec8e0ae39097ee1266cb70c637d66936\n+f744ba307263901c0d9b705fe9ea6ef8\n uncurryn ::\n forall {k} (fs :: [k -> *]) (a :: k) (r :: k -> *).\n Curried (Prod fs a -> r a) -> Prod fs a -> r a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1L><1L>]\n-7b131559cb13793752218f307d823264\n+26df9dab53a2787881b48ac09e4bb9b7\n zeroTuple :: forall {k} (a :: k). Prod '[] a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: $WUnit]\n instance [safe] GHC.Base.Alternative [Prod] = $fAlternativeProd\n instance [safe] GHC.Base.Alternative [Prod] = $fAlternativeProd0\n instance [safe] GHC.Base.Applicative [Prod] = $fApplicativeProd\n instance [safe] GHC.Base.Applicative [Prod] = $fApplicativeProd0\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.dyn_hi", "comments": ["Files 82% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Data.Functor.Transformer 9066\n- interface hash: b2ad62adf2a30920bb8ec9f2de9c0446\n- ABI hash: 12cc87af2ef508ba724114c0268390b0\n- export-list hash: 4730a0f9a2e2a68edc332389a361be24\n+ interface hash: fc659ef10eb6defb8d7446a4d79544ad\n+ ABI hash: 14df9c3ebd1edd9c535cf1dfeaaf95c6\n+ export-list hash: 3239be74cd8260541a54d1361d625cef\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 50b5afcf740fc430243ec6b19ef8cd9a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: d83995bc8e7444810caab212b91324c0\n sig of: Nothing\n@@ -37,21 +37,21 @@\n Barbies.Internal.ConstraintsT.AllTF\n Barbies.Internal.ConstraintsT.ConstraintsT{Barbies.Internal.ConstraintsT.AllT Barbies.Internal.ConstraintsT.taddDicts}\n Barbies.Internal.DistributiveT.DistributiveT{Barbies.Internal.DistributiveT.tdistribute}\n Barbies.Internal.FunctorT.FunctorT{Barbies.Internal.FunctorT.tmap}\n Barbies.Internal.MonadT.MonadT{Barbies.Internal.MonadT.tembed Barbies.Internal.MonadT.tjoin Barbies.Internal.MonadT.tlift}\n Barbies.Internal.TraversableT.TraversableT{Barbies.Internal.TraversableT.ttraverse}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeT\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveT\n Barbies.Internal.FunctorT Barbies.Internal.TraversableT GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -66,87 +66,87 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- exports: 8f06cd71a7d940a28cb85009a4957b36\n- ApplicativeT a99ce0340646a38f9575b049182a8def\n- tprod 94d237cedb9b905a9c75a58fc4be2d84\n- tpure 3d2d76935d5f8427ccff8120f17ee9cb\n- tunzip 4755a536dffa72b34542174dea9563b9\n- tzip 8be4ece3ae39eae97e8ab2054291029f\n- tzipWith 42a8151822e89abb873919356fdc0652\n- tzipWith3 849c75023385973bb50888c87cceec50\n- tzipWith4 0425deaa0877b3ffee1c1fdf4d05f678\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b0c8e8cd622378ebd4213ca89b09d70f\n- exports: 278101e56b3eacad637b39b7dc733468\n- AllT 92843017dacf42daf57c39082de48fa0\n- AllTF e0763c123e2b8997bb2edc82b327f155\n- ConstraintsT 87036f6d192a044ba64c57ad3852f00b\n- taddDicts ced41e140057be31cb58fcc38e1696fa\n- tmapC a0f909dabfcacacb160fc8fb2fd88ee7\n- ttraverseC 038c8c5c104e8c160fb65247f289334d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT 2d87ad7b0d939518df31ee312faa9bf2\n- exports: 6c54e7bb9d2909cbdea3cafe4057c036\n- DistributiveT 375f90ea1d05e60dc2c4545948c0f64a\n- tcotraverse 73d6c732cec8f656dc5ba8f5d3624a1e\n- tdecompose 5bac02433dfcce8672b96aacbc7690ac\n- tdistribute ac2e5b8fba24fb8dcfa0e8bfe938022d\n- tdistribute' e714a56db976e405999674ba0f38e4c2\n- trecompose 0c7137381fb9c3602e0f4e823599884a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT 28d0df4fa16d3ae0e9b8f569b12ba9f0\n- exports: 9054f11064e0de5d5aff661c18eca5f0\n- MonadT e84a8234960c5d20f03388d207c2d8b6\n- tembed dab8ffac3246d71d11a66a5b96bbc66e\n- tjoin feede2c197e26ea157fb57fcac6b3945\n- tlift e8eb157137ff53ba4e0d0ed6033eabbb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- exports: 625e9e43bc9e9ad84f781f9b7f8b2abf\n- TraversableT 5f45683a672c1e8b493f3644d95842b8\n- tfoldMap dd03935b128f42360c829fd3e249b034\n- tsequence 699ffc06a9598fe004d904a9ee845bc0\n- tsequence' 65f065cd1161989b56f7e2cd49c0b0fe\n- ttraverse d3238a3d0af65058271e05836e392ec5\n- ttraverse_ 057185b130c23ac9c0cc56f1337f5eb9\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ exports: 1b16a7ba7761bb551c6170cbaa7b2e96\n+ ApplicativeT 074070de79264540541cf796d013c0ef\n+ tprod afb228a962be5d495a61627aaf4064db\n+ tpure 45b5a8f3e24017491bb877f3c054cbb9\n+ tunzip c89a7b71ff92b7ceb5cae4db45b4ab65\n+ tzip 8673df67a349ae2cf7af109d88da754f\n+ tzipWith d330f2b0b31b44684ce33684d371e964\n+ tzipWith3 057da6c305029e0e1fcd16a43064b63b\n+ tzipWith4 487b69261ee783048fa31f8edc0ffed1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT 71b29e9d7477d9e65446372adaee6a2c\n+ exports: b9186d4e1071f5bfe56a43df85fcb2fa\n+ AllT 68f051666a31ae642df5d8c761d221de\n+ AllTF 7a7ba72bc88fa2ee4a4b9d2f145c22fc\n+ ConstraintsT 3824b7d50764f926d1ce8e2afa5d6994\n+ taddDicts 0364aca59a49ab9532dd24597d08d3aa\n+ tmapC cd42af4933908ccc6702697d0fe2156b\n+ ttraverseC 4583612791ed456316b18d5ff9373604\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT d42051f3b0e0718fa7a27a87fb621d9a\n+ exports: b8594c61579bef94621e4926ef69c181\n+ DistributiveT bc1ead53dbcac53eb866a8dcc1c81565\n+ tcotraverse f03b4ebaf6b48c851a4327dd347db724\n+ tdecompose aab4f45b55235de00615e82b86ef7600\n+ tdistribute b68f74dc7b1ae0f6c5b72deaf1396df6\n+ tdistribute' 3e95649dc738a015868d28ba7461e91c\n+ trecompose 52a99d2a2d30e70f8a8fe8bdf5c43719\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT d8244999abaa79f27abd2c0dcc73de32\n+ exports: 8552d8625d95205221b624099fdcc01c\n+ MonadT d839d0f99cb980a431ecca3b76659b0d\n+ tembed 8a1dd26046a84bb4062d6eb3ddcc11fc\n+ tjoin fba3cd9f527829b5f0f245764a9381f3\n+ tlift 9ec6faf921b4017b48a7f51e08577ec5\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ exports: 985f3d735f8d8149cf05c5257b3e92df\n+ TraversableT 85e954d72370c1d24f1ff0e67fec5163\n+ tfoldMap 0a332c01a2703820e7a4f3473c24da2e\n+ tsequence 94b2a8072a909ac100fc617a0145ec32\n+ tsequence' af70b4282c041fd2ff1e7bcd5772969b\n+ ttraverse 7d33e27d536aa9640cd0d31bd3eaff70\n+ ttraverse_ ea19842ff99c32a83b73d56b12f9540c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-e8d0846ab6bf10afedc2e173ebee2a3e\n+81e9870506964534fb6560cfdf6b4f6e\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-9c0ae710990cf2f44cb403ad7a173fdf\n+1837800a82c2d6f9714d291344aac372\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-56eafa756bfcad879e9c49db741ced56\n+4573d0735f1ab159832a5bd8b03802a2\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Transformer\"#]\n-eda8bc7060567a1084238d5b9170deaf\n+2668df7ff3d645f0f5a39520985511de\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-1e4007c12d00dd493ea12fb4c5831fe4\n+7fd2e44b7d254ec246cc77b48184f6b1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.hi", "comments": ["Files 81% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Data.Functor.Transformer 9066\n- interface hash: b2ad62adf2a30920bb8ec9f2de9c0446\n- ABI hash: 12cc87af2ef508ba724114c0268390b0\n- export-list hash: 4730a0f9a2e2a68edc332389a361be24\n+ interface hash: fc659ef10eb6defb8d7446a4d79544ad\n+ ABI hash: 14df9c3ebd1edd9c535cf1dfeaaf95c6\n+ export-list hash: 3239be74cd8260541a54d1361d625cef\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f3ef90b23a8894f3c8a76d060589be75\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: d83995bc8e7444810caab212b91324c0\n sig of: Nothing\n@@ -37,21 +37,21 @@\n Barbies.Internal.ConstraintsT.AllTF\n Barbies.Internal.ConstraintsT.ConstraintsT{Barbies.Internal.ConstraintsT.AllT Barbies.Internal.ConstraintsT.taddDicts}\n Barbies.Internal.DistributiveT.DistributiveT{Barbies.Internal.DistributiveT.tdistribute}\n Barbies.Internal.FunctorT.FunctorT{Barbies.Internal.FunctorT.tmap}\n Barbies.Internal.MonadT.MonadT{Barbies.Internal.MonadT.tembed Barbies.Internal.MonadT.tjoin Barbies.Internal.MonadT.tlift}\n Barbies.Internal.TraversableT.TraversableT{Barbies.Internal.TraversableT.ttraverse}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeT\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveT\n Barbies.Internal.FunctorT Barbies.Internal.TraversableT GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -66,87 +66,87 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT f85e5cd2da339db14a0f12808931207a\n- exports: 8f06cd71a7d940a28cb85009a4957b36\n- ApplicativeT a99ce0340646a38f9575b049182a8def\n- tprod 94d237cedb9b905a9c75a58fc4be2d84\n- tpure 3d2d76935d5f8427ccff8120f17ee9cb\n- tunzip 4755a536dffa72b34542174dea9563b9\n- tzip 8be4ece3ae39eae97e8ab2054291029f\n- tzipWith 42a8151822e89abb873919356fdc0652\n- tzipWith3 849c75023385973bb50888c87cceec50\n- tzipWith4 0425deaa0877b3ffee1c1fdf4d05f678\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b0c8e8cd622378ebd4213ca89b09d70f\n- exports: 278101e56b3eacad637b39b7dc733468\n- AllT 92843017dacf42daf57c39082de48fa0\n- AllTF e0763c123e2b8997bb2edc82b327f155\n- ConstraintsT 87036f6d192a044ba64c57ad3852f00b\n- taddDicts ced41e140057be31cb58fcc38e1696fa\n- tmapC a0f909dabfcacacb160fc8fb2fd88ee7\n- ttraverseC 038c8c5c104e8c160fb65247f289334d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT 2d87ad7b0d939518df31ee312faa9bf2\n- exports: 6c54e7bb9d2909cbdea3cafe4057c036\n- DistributiveT 375f90ea1d05e60dc2c4545948c0f64a\n- tcotraverse 73d6c732cec8f656dc5ba8f5d3624a1e\n- tdecompose 5bac02433dfcce8672b96aacbc7690ac\n- tdistribute ac2e5b8fba24fb8dcfa0e8bfe938022d\n- tdistribute' e714a56db976e405999674ba0f38e4c2\n- trecompose 0c7137381fb9c3602e0f4e823599884a\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT c8310e4a2c22e48313a5914948ddeb76\n- exports: 183054a27084bbc8fe4b79328162608e\n- FunctorT e3d3793569ff8c641c51801746e07066\n- tmap bb681f8f41178e3d2453e1602686b761\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT 28d0df4fa16d3ae0e9b8f569b12ba9f0\n- exports: 9054f11064e0de5d5aff661c18eca5f0\n- MonadT e84a8234960c5d20f03388d207c2d8b6\n- tembed dab8ffac3246d71d11a66a5b96bbc66e\n- tjoin feede2c197e26ea157fb57fcac6b3945\n- tlift e8eb157137ff53ba4e0d0ed6033eabbb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 1dad3f4c90632f51452d54a270e61c5c\n- exports: 625e9e43bc9e9ad84f781f9b7f8b2abf\n- TraversableT 5f45683a672c1e8b493f3644d95842b8\n- tfoldMap dd03935b128f42360c829fd3e249b034\n- tsequence 699ffc06a9598fe004d904a9ee845bc0\n- tsequence' 65f065cd1161989b56f7e2cd49c0b0fe\n- ttraverse d3238a3d0af65058271e05836e392ec5\n- ttraverse_ 057185b130c23ac9c0cc56f1337f5eb9\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 04018772b2b4402bf2760dc96217540b\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d21087f1e9d6be93c849bd6307118df4\n- Rec d465c8879e90265de2f6f449eae85d8f\n- unRec 231224a54f5aab48712d757bc9936398\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT f06477dafaca98c451f2b1d6a471ced6\n+ exports: 1b16a7ba7761bb551c6170cbaa7b2e96\n+ ApplicativeT 074070de79264540541cf796d013c0ef\n+ tprod afb228a962be5d495a61627aaf4064db\n+ tpure 45b5a8f3e24017491bb877f3c054cbb9\n+ tunzip c89a7b71ff92b7ceb5cae4db45b4ab65\n+ tzip 8673df67a349ae2cf7af109d88da754f\n+ tzipWith d330f2b0b31b44684ce33684d371e964\n+ tzipWith3 057da6c305029e0e1fcd16a43064b63b\n+ tzipWith4 487b69261ee783048fa31f8edc0ffed1\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT 71b29e9d7477d9e65446372adaee6a2c\n+ exports: b9186d4e1071f5bfe56a43df85fcb2fa\n+ AllT 68f051666a31ae642df5d8c761d221de\n+ AllTF 7a7ba72bc88fa2ee4a4b9d2f145c22fc\n+ ConstraintsT 3824b7d50764f926d1ce8e2afa5d6994\n+ taddDicts 0364aca59a49ab9532dd24597d08d3aa\n+ tmapC cd42af4933908ccc6702697d0fe2156b\n+ ttraverseC 4583612791ed456316b18d5ff9373604\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT d42051f3b0e0718fa7a27a87fb621d9a\n+ exports: b8594c61579bef94621e4926ef69c181\n+ DistributiveT bc1ead53dbcac53eb866a8dcc1c81565\n+ tcotraverse f03b4ebaf6b48c851a4327dd347db724\n+ tdecompose aab4f45b55235de00615e82b86ef7600\n+ tdistribute b68f74dc7b1ae0f6c5b72deaf1396df6\n+ tdistribute' 3e95649dc738a015868d28ba7461e91c\n+ trecompose 52a99d2a2d30e70f8a8fe8bdf5c43719\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 929bf8d925e252c32908ddf92134540e\n+ exports: f8e89bb9ad245dcc0f0a65ae5f446ed8\n+ FunctorT c4169bad3141c057cd702685c69e0cc5\n+ tmap d7066395803bf0bd6ae35961bd5b10e8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT d8244999abaa79f27abd2c0dcc73de32\n+ exports: 8552d8625d95205221b624099fdcc01c\n+ MonadT d839d0f99cb980a431ecca3b76659b0d\n+ tembed 8a1dd26046a84bb4062d6eb3ddcc11fc\n+ tjoin fba3cd9f527829b5f0f245764a9381f3\n+ tlift 9ec6faf921b4017b48a7f51e08577ec5\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 918f93b0edfeba7aeefead5d62361a20\n+ exports: 985f3d735f8d8149cf05c5257b3e92df\n+ TraversableT 85e954d72370c1d24f1ff0e67fec5163\n+ tfoldMap 0a332c01a2703820e7a4f3473c24da2e\n+ tsequence 94b2a8072a909ac100fc617a0145ec32\n+ tsequence' af70b4282c041fd2ff1e7bcd5772969b\n+ ttraverse 7d33e27d536aa9640cd0d31bd3eaff70\n+ ttraverse_ ea19842ff99c32a83b73d56b12f9540c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 036a36959262b68c89d59ecc0b598b13\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec d236510d2f31c36c95deb00da399b7ab\n+ Rec 3b97022e5dc7c591885717d5396519bd\n+ unRec ba37d434963801fbf488db7286cb1d46\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-e8d0846ab6bf10afedc2e173ebee2a3e\n+81e9870506964534fb6560cfdf6b4f6e\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-9c0ae710990cf2f44cb403ad7a173fdf\n+1837800a82c2d6f9714d291344aac372\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-56eafa756bfcad879e9c49db741ced56\n+4573d0735f1ab159832a5bd8b03802a2\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Transformer\"#]\n-eda8bc7060567a1084238d5b9170deaf\n+2668df7ff3d645f0f5a39520985511de\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-1e4007c12d00dd493ea12fb4c5831fe4\n+7fd2e44b7d254ec246cc77b48184f6b1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.dyn_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.dyn_hi", "comments": ["Files 92% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got dyn\n interface Data.Generics.GenericN [family instance module] 9066\n- interface hash: 251ff7555d8fbd0a1c0afd5d7b89b754\n- ABI hash: 04018772b2b4402bf2760dc96217540b\n- export-list hash: 307a2e68cbb21a03a7dd871748641b06\n+ interface hash: 29747de2e680650a396900011f640d96\n+ ABI hash: 036a36959262b68c89d59ecc0b598b13\n+ export-list hash: ddd229d354fb4e9da43735622f139811\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f8c8551a9a937fbabd6ffb288aeafb62\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 20c4705bc3e8084b4769b462455c7608\n sig of: Nothing\n@@ -78,28 +78,28 @@\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-3a3d9ab155d7e08d2d6f8d1d0b086d7a\n+0fb210cc53046c6583cbc2684ab063ed\n $fGenericNa ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n GenericN a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a\n (v['GHC.Types.Many] :: GHC.Types.Coercible\n (GHC.Generics.Rep a) (RepN a))\n (v1['GHC.Types.Many] :: GHC.Generics.Generic a).\n @a v v1 ($fGenericNa_$ctoN @a v v1) ($fGenericNa_$cfromN @a v v1)]\n-6dbdc0e4ccbd5c38314c67564965f616\n+996372e3c737c4775767d845d89cb5f0\n $fGenericNa_$cfromN ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n a -> RepN a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(1L)><1P(1L,A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -111,15 +111,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepN a)\n $dCoercible of co { DEFAULT ->\n (\\ @x -> GHC.Generics.from @a $dGeneric @x)\n `cast`\n (forall (x :: <*>_N). _R %<'GHC.Types.Many>_N ->_R co _N) }]\n-94f7792a776056ef2fee73434a5a4107\n+e70051e83cbe518a62e871bba5f136ef\n $fGenericNa_$ctoN ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n RepN a x -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(1L)><1P(A,1L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -131,15 +131,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepN a)\n $dCoercible of co { DEFAULT ->\n (\\ @x -> GHC.Generics.to @a $dGeneric @x)\n `cast`\n (forall (x :: <*>_N). co _N %<'GHC.Types.Many>_N ->_R _R) }]\n-8534047771eed7b377a5e06f7d1d2a53\n+0668a65402d30f444d4ed3a882682f97\n $fGenericPna ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n GenericP n a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n@@ -150,15 +150,15 @@\n (v1['GHC.Types.Many] :: GHC.Generics.Generic a).\n @n\n @a\n v\n v1\n ($fGenericPna_$ctoP @a @n v v1)\n ($fGenericPna_$cfromP @a @n v v1)]\n-675427d6b1c6048f169dd3aa8fdd6277\n+7660747e5067b86b947dfc317139226c\n $fGenericPna_$cfromP ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n Data.Proxy.Proxy n -> a -> RepP n a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1L)><1P(1L,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -173,15 +173,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepP n a)\n $dCoercible of co { DEFAULT ->\n (GHC.Generics.from @a $dGeneric @x)\n `cast`\n (_R %<'GHC.Types.Many>_N ->_R co _N) }]\n-997f1b58bea62017f0757fcc35fd793d\n+05260ecf46b676920522d9d78f2553c5\n $fGenericPna_$ctoP ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n Data.Proxy.Proxy n -> RepP n a x -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1L)><1P(A,1L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -196,272 +196,272 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepP n a)\n $dCoercible of co { DEFAULT ->\n (GHC.Generics.to @a $dGeneric @x)\n `cast`\n (co _N %<'GHC.Types.Many>_N ->_R _R) }]\n-042d1cc01cc554e4884d8b73df668064\n+1ce19a72b58a0e1a7465a8a8f00dd687\n $tc'Rec :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2010739128158471245#Word64\n- 13967947080697914728#Word64\n+ 3641965112030500663#Word64\n+ 17228817449347045139#Word64\n $trModule\n $tc'Rec2\n 4#\n $tc'Rec1]\n-4a7527726447d1acd2fc9625d9e742aa\n+0ab194d6e23144f60a518a0248d8e242\n $tc'Rec1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-31c16267b28d71d76a362cdbff5b6581\n+4651b5ae438aa5170e60a689cbbd356c\n $tc'Rec2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Rec3]\n-41cafd84bd7d6ec0ea94a25fde216ea9\n+0bad259247e68351a7b5e610c2a16a9b\n $tc'Rec3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Rec\"#]\n-b60c60bc0815f57e5deed1742557986f\n+1eaeaf8e84eb4bcc99588bd1558c7745\n $tcGenericN :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 13366642642489202528#Word64\n- 16533088930544678980#Word64\n+ 8431548670426927589#Word64\n+ 8276686068605313302#Word64\n $trModule\n $tcGenericN2\n 0#\n $tcGenericN1]\n-86fc687e4119a7168fe328fe3c58cfbc\n+b46b24512d4fb0e6131c0fb5cb02d34a\n $tcGenericN1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-f126c1fe640754bb787fd8b7e9b17434\n+245b849b4bf43ea00d8cd2734d3cce9b\n $tcGenericN2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGenericN3]\n-5f3a6a6d699cdbfb51ad634392bfbb3e\n+9c08e0cf76b7d1833000ce77f2a97b4a\n $tcGenericN3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GenericN\"#]\n-22b93de4eaf9a83429e5d5169d9d289f\n+3528bb653433f29d062a7c08e2202cb7\n $tcGenericP :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7746456970720547853#Word64\n- 7869983480876816926#Word64\n+ 10546502919063957716#Word64\n+ 4403573475803759602#Word64\n $trModule\n $tcGenericP2\n 0#\n $tcGenericP1]\n-7841065602a8387f35d0834beb53d35d\n+098a1c8a4da0eafbf0bc46915bdc3cc2\n $tcGenericP1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-819ea323ad6a4f449e3140ecd3edb497\n+17ac0303a08e0f22b2857af4a7b0a424\n $tcGenericP2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGenericP3]\n-a736ebd9bb38bb16eb5234dd49c60986\n+a94442cbc3877b2176ba132254968986\n $tcGenericP3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GenericP\"#]\n-2de73bd748e080c8ba90f2f4c2321a31\n+ec97bcaf2e023750dd1bacfe29de2595\n $tcParam :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3873479314949231875#Word64\n- 3287949389011015102#Word64\n+ 3708105176982407385#Word64\n+ 855080426625777784#Word64\n $trModule\n $tcParam2\n 1#\n $tcParam1]\n-c9d8d518ac2b5bc4e1b23a819e45ed4f\n+d3d520a16e26c3cf8ebc4264dcc10018\n $tcParam1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-7cd22a64393d7d34a18a83cc4d95339d\n+52d05bff125e28f665fac6c34c538178\n $tcParam2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcParam3]\n-e63f5e84ef414935fbe13542a4d11b6b\n+8a5e35570356d9a3cfeb97314c7d1af8\n $tcParam3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Param\"#]\n-6305562a7e44617fc81acbc6ddf568a2\n+5245bea0f94bfffdddad0e205a3e583e\n $tcRec :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7366229076863813425#Word64\n- 17893782013242789224#Word64\n+ 4496317617164788358#Word64\n+ 9240627540514957836#Word64\n $trModule\n $tcRec2\n 1#\n $tcRec1]\n-61ba17b60e0e30efb231f16276df5b3e\n+b23877eca59ea9c909b636baac151f29\n $tcRec1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-802a30c38651e14ac92093b8acc4cf71\n+3dc736b817667ca788cb338ec25c38b5\n $tcRec2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcRec3]\n-b1f13471981b749c3de7d07d9631d7be\n+add2b530503730e66daaf1895998822b\n $tcRec3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Rec\"#]\n-4b558a5a0166b0221acfe75cc8c60029\n+4672c8d772df915ea2576b915fa3c27a\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2928f797403af6c3f5938d73352d2076\n+7e93adc921c872c514fa153e5387b2b4\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-31e202f6d8534b24bf51f4b7532a83c3\n+9fafeb5d57c048cdd1f67aa75ab2f0f3\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Generics.GenericN\"#]\n-d4c12a6817ba80afc664a6226d54a9e2\n+85d6b64d2b0f3bf79292f3f3049c015e\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-4363a9c789de4e96245188639ed3abd8\n+8627082b9155637d4e5b4181b6be3bea\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-4d032684fe99eec242cff5c60828727f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+8383e02d5e99ada2c0c42f50a0b2e7d0\n axiom D:R:FilterIndex ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param n a)) = FilterIndex n t (Param n a)\n forall k1 k2 (_1 :: GHC.TypeNats.Nat) (n :: GHC.TypeNats.Nat)\n (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param _1 a)) = FilterIndex n t a\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). FilterIndex _1 t = t\n-73e21b2157370f5cd1328cde0971d6b0\n+4c33e6968806153750deddb6d613d962\n axiom D:R:Indexed ::\n forall k1 k2 (t :: k1 -> k2) (a :: k1) (i :: GHC.TypeNats.Nat).\n Indexed (t a) i = Indexed t (i GHC.TypeNats.+ 1) (Param i a)\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). Indexed t _1 = t\n-490f42cfc840dfcf11c7f52982ad1254\n+26e87dd4f792eb34b6a9146942cecb13\n axiom D:R:Zip ::\n Zip (GHC.Generics.M1 mt m s) (GHC.Generics.M1 mt m t)\n = GHC.Generics.M1 mt m (Zip s t)\n Zip (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n = Zip l l' GHC.Generics.:+: Zip r r'\n Zip (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n = Zip l l' GHC.Generics.:*: Zip r r'\n Zip (GHC.Generics.Rec0 p) (GHC.Generics.Rec0 a) = Rec p a\n Zip GHC.Generics.U1 GHC.Generics.U1 = GHC.Generics.U1\n Zip GHC.Generics.V1 GHC.Generics.V1 = GHC.Generics.V1\n-28629d2d100254e316c2e2006644bb35\n+d25400e43e9b658f703ceff2ac3de284\n type FilterIndex :: forall k. GHC.TypeNats.Nat -> k -> k\n type family FilterIndex n t where\n forall k1 k2 (n :: GHC.TypeNats.Nat) (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param n a)) = FilterIndex n t (Param n a)\n forall k1 k2 (_1 :: GHC.TypeNats.Nat) (n :: GHC.TypeNats.Nat)\n (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param _1 a)) = FilterIndex n t a\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). FilterIndex _1 t = t\n axiom D:R:FilterIndex\n-dd9794ad08262cbac6264fbf714e582f\n+3c1929812fe1d66fe2228d4ff0e540ce\n type GenericN :: * -> GHC.Types.Constraint\n class (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n GenericN a where\n type RepN :: * -> * -> *\n type family RepN a open\n Default: Zip (GHC.Generics.Rep (Indexed a 0)) (GHC.Generics.Rep a)\n toN :: RepN a x -> a\n fromN :: a -> RepN a x\n {-# MINIMAL toN, fromN #-}\n-f4ef512392aa93755b39a60a61fcb61d\n+6d4114b38c04aef15401b9759854eb7a\n type GenericP :: GHC.TypeNats.Nat -> * -> GHC.Types.Constraint\n class (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n GenericP n a where\n type RepP :: GHC.TypeNats.Nat -> * -> * -> *\n type family RepP n a open\n Default: Zip\n (GHC.Generics.Rep (FilterIndex n (Indexed a 0)))\n (GHC.Generics.Rep a)\n toP :: Data.Proxy.Proxy n -> RepP n a x -> a\n fromP :: Data.Proxy.Proxy n -> a -> RepP n a x\n {-# MINIMAL toP, fromP #-}\n-6d9d16f1708cc593b81a9519125d5cd4\n+a088e1d15833f960906b057a9fbfae7d\n type Indexed :: forall k. k -> GHC.TypeNats.Nat -> k\n type family Indexed t i where\n forall k1 k2 (t :: k1 -> k2) (a :: k1) (i :: GHC.TypeNats.Nat).\n Indexed (t a) i = Indexed t (i GHC.TypeNats.+ 1) (Param i a)\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). Indexed t _1 = t\n axiom D:R:Indexed\n-64ce4f405ce19c0ac06589973a57c10d\n+8a772f1a47d87e197f6034a33fad91b6\n type Param :: forall k. GHC.TypeNats.Nat -> k -> k\n data family Param n a\n-5a7023b0ba5508c9797a55e6b3ef8ec1\n+d0631f74d1e0238e450cc055cc3f1b91\n axiom R:RepNa ::\n RepN a = Zip (GHC.Generics.Rep (Indexed a 0)) (GHC.Generics.Rep a)\n-5056c1a0ed3992131568126b47eeef50\n+3997c4cfc5150fb71c0f0ed7953b7261\n axiom R:RepPna ::\n RepP n a\n = Zip\n (GHC.Generics.Rep (FilterIndex n (Indexed a 0)))\n (GHC.Generics.Rep a)\n-d465c8879e90265de2f6f449eae85d8f\n+3b97022e5dc7c591885717d5396519bd\n type role Rec phantom representational phantom\n type Rec :: forall {k}. * -> * -> k -> *\n newtype Rec p a x\n = Rec {unRec :: GHC.Generics.K1 GHC.Generics.R a x}\n-083bb61db3e8437841ed53dd9a1e12d6\n+05d9accc0b4938dc7787dbe3e50a5c37\n type Zip :: (* -> *) -> (* -> *) -> * -> *\n type family Zip a b where\n Zip (GHC.Generics.M1 mt m s) (GHC.Generics.M1 mt m t)\n = GHC.Generics.M1 mt m (Zip s t)\n Zip (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n = Zip l l' GHC.Generics.:+: Zip r r'\n Zip (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n = Zip l l' GHC.Generics.:*: Zip r r'\n Zip (GHC.Generics.Rec0 p) (GHC.Generics.Rec0 a) = Rec p a\n Zip GHC.Generics.U1 GHC.Generics.U1 = GHC.Generics.U1\n Zip GHC.Generics.V1 GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:Zip\n-231224a54f5aab48712d757bc9936398\n+ba37d434963801fbf488db7286cb1d46\n unRec ::\n forall {k} p a (x :: k).\n Rec p a x -> GHC.Generics.K1 GHC.Generics.R a x\n RecSel Left Rec\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n unRec1\n `cast`\n (forall (k :: <*>_N) (p :: <*>_N) (a :: <*>_N) (x :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Rec[0] _N

_P _N _N)]\n-59baebaed77a2f9f718797fb27f841c5\n+ca29e5a2db4a222ce2976d5c798fbe28\n unRec1 :: forall {k} {p} {a} {x :: k}. Rec p a x -> Rec p a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k @p @a @x :: k (ds['GHC.Types.Many] :: Rec p a x) -> ds]\n instance GenericN [.] = $fGenericNa\n instance GenericP [., .] = $fGenericPna\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.hi", "comments": ["Files 95% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got \n interface Data.Generics.GenericN [family instance module] 9066\n- interface hash: 251ff7555d8fbd0a1c0afd5d7b89b754\n- ABI hash: 04018772b2b4402bf2760dc96217540b\n- export-list hash: 307a2e68cbb21a03a7dd871748641b06\n+ interface hash: 29747de2e680650a396900011f640d96\n+ ABI hash: 036a36959262b68c89d59ecc0b598b13\n+ export-list hash: ddd229d354fb4e9da43735622f139811\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: c7962c99ecb97944c9b82836365a256a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 20c4705bc3e8084b4769b462455c7608\n sig of: Nothing\n@@ -78,28 +78,28 @@\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-3a3d9ab155d7e08d2d6f8d1d0b086d7a\n+0fb210cc53046c6583cbc2684ab063ed\n $fGenericNa ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n GenericN a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a\n (v['GHC.Types.Many] :: GHC.Types.Coercible\n (GHC.Generics.Rep a) (RepN a))\n (v1['GHC.Types.Many] :: GHC.Generics.Generic a).\n @a v v1 ($fGenericNa_$ctoN @a v v1) ($fGenericNa_$cfromN @a v v1)]\n-6dbdc0e4ccbd5c38314c67564965f616\n+996372e3c737c4775767d845d89cb5f0\n $fGenericNa_$cfromN ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n a -> RepN a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(1L)><1P(1L,A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -111,15 +111,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepN a)\n $dCoercible of co { DEFAULT ->\n (\\ @x -> GHC.Generics.from @a $dGeneric @x)\n `cast`\n (forall (x :: <*>_N). _R %<'GHC.Types.Many>_N ->_R co _N) }]\n-94f7792a776056ef2fee73434a5a4107\n+e70051e83cbe518a62e871bba5f136ef\n $fGenericNa_$ctoN ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n RepN a x -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(1L)><1P(A,1L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -131,15 +131,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepN a)\n $dCoercible of co { DEFAULT ->\n (\\ @x -> GHC.Generics.to @a $dGeneric @x)\n `cast`\n (forall (x :: <*>_N). co _N %<'GHC.Types.Many>_N ->_R _R) }]\n-8534047771eed7b377a5e06f7d1d2a53\n+0668a65402d30f444d4ed3a882682f97\n $fGenericPna ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n GenericP n a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n@@ -150,15 +150,15 @@\n (v1['GHC.Types.Many] :: GHC.Generics.Generic a).\n @n\n @a\n v\n v1\n ($fGenericPna_$ctoP @a @n v v1)\n ($fGenericPna_$cfromP @a @n v v1)]\n-675427d6b1c6048f169dd3aa8fdd6277\n+7660747e5067b86b947dfc317139226c\n $fGenericPna_$cfromP ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n Data.Proxy.Proxy n -> a -> RepP n a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1L)><1P(1L,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -173,15 +173,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepP n a)\n $dCoercible of co { DEFAULT ->\n (GHC.Generics.from @a $dGeneric @x)\n `cast`\n (_R %<'GHC.Types.Many>_N ->_R co _N) }]\n-997f1b58bea62017f0757fcc35fd793d\n+05260ecf46b676920522d9d78f2553c5\n $fGenericPna_$ctoP ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n Data.Proxy.Proxy n -> RepP n a x -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1L)><1P(A,1L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -196,272 +196,272 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepP n a)\n $dCoercible of co { DEFAULT ->\n (GHC.Generics.to @a $dGeneric @x)\n `cast`\n (co _N %<'GHC.Types.Many>_N ->_R _R) }]\n-042d1cc01cc554e4884d8b73df668064\n+1ce19a72b58a0e1a7465a8a8f00dd687\n $tc'Rec :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2010739128158471245#Word64\n- 13967947080697914728#Word64\n+ 3641965112030500663#Word64\n+ 17228817449347045139#Word64\n $trModule\n $tc'Rec2\n 4#\n $tc'Rec1]\n-4a7527726447d1acd2fc9625d9e742aa\n+0ab194d6e23144f60a518a0248d8e242\n $tc'Rec1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-31c16267b28d71d76a362cdbff5b6581\n+4651b5ae438aa5170e60a689cbbd356c\n $tc'Rec2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Rec3]\n-41cafd84bd7d6ec0ea94a25fde216ea9\n+0bad259247e68351a7b5e610c2a16a9b\n $tc'Rec3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Rec\"#]\n-b60c60bc0815f57e5deed1742557986f\n+1eaeaf8e84eb4bcc99588bd1558c7745\n $tcGenericN :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 13366642642489202528#Word64\n- 16533088930544678980#Word64\n+ 8431548670426927589#Word64\n+ 8276686068605313302#Word64\n $trModule\n $tcGenericN2\n 0#\n $tcGenericN1]\n-86fc687e4119a7168fe328fe3c58cfbc\n+b46b24512d4fb0e6131c0fb5cb02d34a\n $tcGenericN1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-f126c1fe640754bb787fd8b7e9b17434\n+245b849b4bf43ea00d8cd2734d3cce9b\n $tcGenericN2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGenericN3]\n-5f3a6a6d699cdbfb51ad634392bfbb3e\n+9c08e0cf76b7d1833000ce77f2a97b4a\n $tcGenericN3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GenericN\"#]\n-22b93de4eaf9a83429e5d5169d9d289f\n+3528bb653433f29d062a7c08e2202cb7\n $tcGenericP :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7746456970720547853#Word64\n- 7869983480876816926#Word64\n+ 10546502919063957716#Word64\n+ 4403573475803759602#Word64\n $trModule\n $tcGenericP2\n 0#\n $tcGenericP1]\n-7841065602a8387f35d0834beb53d35d\n+098a1c8a4da0eafbf0bc46915bdc3cc2\n $tcGenericP1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-819ea323ad6a4f449e3140ecd3edb497\n+17ac0303a08e0f22b2857af4a7b0a424\n $tcGenericP2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGenericP3]\n-a736ebd9bb38bb16eb5234dd49c60986\n+a94442cbc3877b2176ba132254968986\n $tcGenericP3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GenericP\"#]\n-2de73bd748e080c8ba90f2f4c2321a31\n+ec97bcaf2e023750dd1bacfe29de2595\n $tcParam :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3873479314949231875#Word64\n- 3287949389011015102#Word64\n+ 3708105176982407385#Word64\n+ 855080426625777784#Word64\n $trModule\n $tcParam2\n 1#\n $tcParam1]\n-c9d8d518ac2b5bc4e1b23a819e45ed4f\n+d3d520a16e26c3cf8ebc4264dcc10018\n $tcParam1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-7cd22a64393d7d34a18a83cc4d95339d\n+52d05bff125e28f665fac6c34c538178\n $tcParam2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcParam3]\n-e63f5e84ef414935fbe13542a4d11b6b\n+8a5e35570356d9a3cfeb97314c7d1af8\n $tcParam3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Param\"#]\n-6305562a7e44617fc81acbc6ddf568a2\n+5245bea0f94bfffdddad0e205a3e583e\n $tcRec :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7366229076863813425#Word64\n- 17893782013242789224#Word64\n+ 4496317617164788358#Word64\n+ 9240627540514957836#Word64\n $trModule\n $tcRec2\n 1#\n $tcRec1]\n-61ba17b60e0e30efb231f16276df5b3e\n+b23877eca59ea9c909b636baac151f29\n $tcRec1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-802a30c38651e14ac92093b8acc4cf71\n+3dc736b817667ca788cb338ec25c38b5\n $tcRec2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcRec3]\n-b1f13471981b749c3de7d07d9631d7be\n+add2b530503730e66daaf1895998822b\n $tcRec3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Rec\"#]\n-4b558a5a0166b0221acfe75cc8c60029\n+4672c8d772df915ea2576b915fa3c27a\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2928f797403af6c3f5938d73352d2076\n+7e93adc921c872c514fa153e5387b2b4\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-31e202f6d8534b24bf51f4b7532a83c3\n+9fafeb5d57c048cdd1f67aa75ab2f0f3\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Generics.GenericN\"#]\n-d4c12a6817ba80afc664a6226d54a9e2\n+85d6b64d2b0f3bf79292f3f3049c015e\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-4363a9c789de4e96245188639ed3abd8\n+8627082b9155637d4e5b4181b6be3bea\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-4d032684fe99eec242cff5c60828727f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+8383e02d5e99ada2c0c42f50a0b2e7d0\n axiom D:R:FilterIndex ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param n a)) = FilterIndex n t (Param n a)\n forall k1 k2 (_1 :: GHC.TypeNats.Nat) (n :: GHC.TypeNats.Nat)\n (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param _1 a)) = FilterIndex n t a\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). FilterIndex _1 t = t\n-73e21b2157370f5cd1328cde0971d6b0\n+4c33e6968806153750deddb6d613d962\n axiom D:R:Indexed ::\n forall k1 k2 (t :: k1 -> k2) (a :: k1) (i :: GHC.TypeNats.Nat).\n Indexed (t a) i = Indexed t (i GHC.TypeNats.+ 1) (Param i a)\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). Indexed t _1 = t\n-490f42cfc840dfcf11c7f52982ad1254\n+26e87dd4f792eb34b6a9146942cecb13\n axiom D:R:Zip ::\n Zip (GHC.Generics.M1 mt m s) (GHC.Generics.M1 mt m t)\n = GHC.Generics.M1 mt m (Zip s t)\n Zip (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n = Zip l l' GHC.Generics.:+: Zip r r'\n Zip (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n = Zip l l' GHC.Generics.:*: Zip r r'\n Zip (GHC.Generics.Rec0 p) (GHC.Generics.Rec0 a) = Rec p a\n Zip GHC.Generics.U1 GHC.Generics.U1 = GHC.Generics.U1\n Zip GHC.Generics.V1 GHC.Generics.V1 = GHC.Generics.V1\n-28629d2d100254e316c2e2006644bb35\n+d25400e43e9b658f703ceff2ac3de284\n type FilterIndex :: forall k. GHC.TypeNats.Nat -> k -> k\n type family FilterIndex n t where\n forall k1 k2 (n :: GHC.TypeNats.Nat) (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param n a)) = FilterIndex n t (Param n a)\n forall k1 k2 (_1 :: GHC.TypeNats.Nat) (n :: GHC.TypeNats.Nat)\n (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param _1 a)) = FilterIndex n t a\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). FilterIndex _1 t = t\n axiom D:R:FilterIndex\n-dd9794ad08262cbac6264fbf714e582f\n+3c1929812fe1d66fe2228d4ff0e540ce\n type GenericN :: * -> GHC.Types.Constraint\n class (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n GenericN a where\n type RepN :: * -> * -> *\n type family RepN a open\n Default: Zip (GHC.Generics.Rep (Indexed a 0)) (GHC.Generics.Rep a)\n toN :: RepN a x -> a\n fromN :: a -> RepN a x\n {-# MINIMAL toN, fromN #-}\n-f4ef512392aa93755b39a60a61fcb61d\n+6d4114b38c04aef15401b9759854eb7a\n type GenericP :: GHC.TypeNats.Nat -> * -> GHC.Types.Constraint\n class (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n GenericP n a where\n type RepP :: GHC.TypeNats.Nat -> * -> * -> *\n type family RepP n a open\n Default: Zip\n (GHC.Generics.Rep (FilterIndex n (Indexed a 0)))\n (GHC.Generics.Rep a)\n toP :: Data.Proxy.Proxy n -> RepP n a x -> a\n fromP :: Data.Proxy.Proxy n -> a -> RepP n a x\n {-# MINIMAL toP, fromP #-}\n-6d9d16f1708cc593b81a9519125d5cd4\n+a088e1d15833f960906b057a9fbfae7d\n type Indexed :: forall k. k -> GHC.TypeNats.Nat -> k\n type family Indexed t i where\n forall k1 k2 (t :: k1 -> k2) (a :: k1) (i :: GHC.TypeNats.Nat).\n Indexed (t a) i = Indexed t (i GHC.TypeNats.+ 1) (Param i a)\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). Indexed t _1 = t\n axiom D:R:Indexed\n-64ce4f405ce19c0ac06589973a57c10d\n+8a772f1a47d87e197f6034a33fad91b6\n type Param :: forall k. GHC.TypeNats.Nat -> k -> k\n data family Param n a\n-5a7023b0ba5508c9797a55e6b3ef8ec1\n+d0631f74d1e0238e450cc055cc3f1b91\n axiom R:RepNa ::\n RepN a = Zip (GHC.Generics.Rep (Indexed a 0)) (GHC.Generics.Rep a)\n-5056c1a0ed3992131568126b47eeef50\n+3997c4cfc5150fb71c0f0ed7953b7261\n axiom R:RepPna ::\n RepP n a\n = Zip\n (GHC.Generics.Rep (FilterIndex n (Indexed a 0)))\n (GHC.Generics.Rep a)\n-d465c8879e90265de2f6f449eae85d8f\n+3b97022e5dc7c591885717d5396519bd\n type role Rec phantom representational phantom\n type Rec :: forall {k}. * -> * -> k -> *\n newtype Rec p a x\n = Rec {unRec :: GHC.Generics.K1 GHC.Generics.R a x}\n-083bb61db3e8437841ed53dd9a1e12d6\n+05d9accc0b4938dc7787dbe3e50a5c37\n type Zip :: (* -> *) -> (* -> *) -> * -> *\n type family Zip a b where\n Zip (GHC.Generics.M1 mt m s) (GHC.Generics.M1 mt m t)\n = GHC.Generics.M1 mt m (Zip s t)\n Zip (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n = Zip l l' GHC.Generics.:+: Zip r r'\n Zip (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n = Zip l l' GHC.Generics.:*: Zip r r'\n Zip (GHC.Generics.Rec0 p) (GHC.Generics.Rec0 a) = Rec p a\n Zip GHC.Generics.U1 GHC.Generics.U1 = GHC.Generics.U1\n Zip GHC.Generics.V1 GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:Zip\n-231224a54f5aab48712d757bc9936398\n+ba37d434963801fbf488db7286cb1d46\n unRec ::\n forall {k} p a (x :: k).\n Rec p a x -> GHC.Generics.K1 GHC.Generics.R a x\n RecSel Left Rec\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n unRec1\n `cast`\n (forall (k :: <*>_N) (p :: <*>_N) (a :: <*>_N) (x :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Rec[0] _N

_P _N _N)]\n-59baebaed77a2f9f718797fb27f841c5\n+ca29e5a2db4a222ce2976d5c798fbe28\n unRec1 :: forall {k} {p} {a} {x :: k}. Rec p a x -> Rec p a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k @p @a @x :: k (ds['GHC.Types.Many] :: Rec p a x) -> ds]\n instance GenericN [.] = $fGenericNa\n instance GenericP [., .] = $fGenericPna\n"}]}]}]}]}, {"source1": "libghc-barbies-doc_2.0.5.0-1_all.deb", "source2": "libghc-barbies-doc_2.0.5.0-1_all.deb", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,3 +1,3 @@\n -rw-r--r-- 0 0 0 4 2024-09-21 21:52:34.000000 debian-binary\n -rw-r--r-- 0 0 0 3024 2024-09-21 21:52:34.000000 control.tar.xz\n--rw-r--r-- 0 0 0 205508 2024-09-21 21:52:34.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 205512 2024-09-21 21:52:34.000000 data.tar.xz\n"}, {"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}]}]}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "./usr/lib/ghc-doc/haddock/barbies-2.0.5.0/barbies.haddock", "source2": "./usr/lib/ghc-doc/haddock/barbies-2.0.5.0/barbies.haddock", "has_internal_linenos": true, "unified_diff": "@@ -2337,16 +2337,16 @@\n 00009200: 0035 00a0 0300 0035 00a1 0300 0035 00a2 .5.....5.....5..\n 00009210: 0300 0035 00a3 0300 0035 00a4 0300 0035 ...5.....5.....5\n 00009220: 00a5 0300 0035 00a6 0300 8d02 8e02 00a7 .....5..........\n 00009230: 0300 0035 00a8 0300 8d02 9b03 00a9 0300 ...5............\n 00009240: 8d02 aa03 03ab 0300 8d02 ac03 03ad 0300 ................\n 00009250: 0044 00ce 0100 0044 00ae 0300 0045 00af .D.....D.....E..\n 00009260: 03b0 0326 6261 7262 6965 732d 322e 302e ...&barbies-2.0.\n-00009270: 352e 302d 3350 544e 4263 7379 626e 3446 5.0-3PTNBcsybn4F\n-00009280: 4877 6962 5430 7757 4265 1744 6174 612e HwibT0wWBe.Data.\n+00009270: 352e 302d 3953 4a35 4d6c 4441 4c67 4d36 5.0-9SJ5MlDALgM6\n+00009280: 3247 3077 6c52 544a 3255 1744 6174 612e 2G0wlRTJ2U.Data.\n 00009290: 4261 7262 6965 2e43 6f6e 7374 7261 696e Barbie.Constrain\n 000092a0: 7473 1144 6174 612e 4675 6e63 746f 722e ts.Data.Functor.\n 000092b0: 5072 6f64 1042 6172 6269 6573 2e49 6e74 Prod.Barbies.Int\n 000092c0: 6572 6e61 6c18 4461 7461 2e46 756e 6374 ernal.Data.Funct\n 000092d0: 6f72 2e54 7261 6e73 666f 726d 6572 0c42 or.Transformer.B\n 000092e0: 6172 6269 6573 2e42 6172 6513 4461 7461 arbies.Bare.Data\n 000092f0: 2e46 756e 6374 6f72 2e42 6172 6269 6513 .Functor.Barbie.\n"}, {"source1": "./usr/share/doc/libghc-barbies-doc/html/Barbies.html", "source2": "./usr/share/doc/libghc-barbies-doc/html/Barbies.html", "unified_diff": "@@ -113,10 +113,10 @@\n \n instance Functor f' => FunctorB (Dependants f')\n instance FunctorT Dependants\n \n type Dependants f = Dependants f f\n

We can thus use btmap1 as a poor man's version of bmap for Dependants.

For more details, see:

module Barbies.Bi

Container-barbies

Some clothes make barbies look like containers, and we can make those\n types behave like normal Functors.

newtype Container b a Source #

Wrapper for barbies that act as containers of a\n- by wearing (Const a).

Constructors

Container 

Fields

Instances

Instances details
TraversableB b => Foldable (Container b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

fold :: Monoid m => Container b m -> m Source #

foldMap :: Monoid m => (a -> m) -> Container b a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Container b a -> m Source #

foldr :: (a -> b0 -> b0) -> b0 -> Container b a -> b0 Source #

foldr' :: (a -> b0 -> b0) -> b0 -> Container b a -> b0 Source #

foldl :: (b0 -> a -> b0) -> b0 -> Container b a -> b0 Source #

foldl' :: (b0 -> a -> b0) -> b0 -> Container b a -> b0 Source #

foldr1 :: (a -> a -> a) -> Container b a -> a Source #

foldl1 :: (a -> a -> a) -> Container b a -> a Source #

toList :: Container b a -> [a] Source #

null :: Container b a -> Bool Source #

length :: Container b a -> Int Source #

elem :: Eq a => a -> Container b a -> Bool Source #

maximum :: Ord a => Container b a -> a Source #

minimum :: Ord a => Container b a -> a Source #

sum :: Num a => Container b a -> a Source #

product :: Num a => Container b a -> a Source #

TraversableB b => Traversable (Container b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

traverse :: Applicative f => (a -> f b0) -> Container b a -> f (Container b b0) Source #

sequenceA :: Applicative f => Container b (f a) -> f (Container b a) Source #

mapM :: Monad m => (a -> m b0) -> Container b a -> m (Container b b0) Source #

sequence :: Monad m => Container b (m a) -> m (Container b a) Source #

ApplicativeB b => Applicative (Container b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

pure :: a -> Container b a Source #

(<*>) :: Container b (a -> b0) -> Container b a -> Container b b0 Source #

liftA2 :: (a -> b0 -> c) -> Container b a -> Container b b0 -> Container b c Source #

(*>) :: Container b a -> Container b b0 -> Container b b0 Source #

(<*) :: Container b a -> Container b b0 -> Container b a Source #

FunctorB b => Functor (Container b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

fmap :: (a -> b0) -> Container b a -> Container b b0 Source #

(<$) :: a -> Container b b0 -> Container b a Source #

Generic (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Associated Types

type Rep (Container b a) :: Type -> Type Source #

Methods

from :: Container b a -> Rep (Container b a) x Source #

to :: Rep (Container b a) x -> Container b a Source #

Read (b (Const a :: Type -> Type)) => Read (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

readsPrec :: Int -> ReadS (Container b a) Source #

readList :: ReadS [Container b a] Source #

readPrec :: ReadPrec (Container b a) Source #

readListPrec :: ReadPrec [Container b a] Source #

Show (b (Const a :: Type -> Type)) => Show (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

showsPrec :: Int -> Container b a -> ShowS Source #

show :: Container b a -> String Source #

showList :: [Container b a] -> ShowS Source #

Eq (b (Const a :: Type -> Type)) => Eq (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

(==) :: Container b a -> Container b a -> Bool Source #

(/=) :: Container b a -> Container b a -> Bool Source #

Ord (b (Const a :: Type -> Type)) => Ord (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

compare :: Container b a -> Container b a -> Ordering Source #

(<) :: Container b a -> Container b a -> Bool Source #

(<=) :: Container b a -> Container b a -> Bool Source #

(>) :: Container b a -> Container b a -> Bool Source #

(>=) :: Container b a -> Container b a -> Bool Source #

max :: Container b a -> Container b a -> Container b a Source #

min :: Container b a -> Container b a -> Container b a Source #

type Rep (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

type Rep (Container b a) = D1 ('MetaData "Container" "Barbies.Internal.Containers" "barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe" 'True) (C1 ('MetaCons "Container" 'PrefixI 'True) (S1 ('MetaSel ('Just "getContainer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (b (Const a :: Type -> Type)))))

newtype ErrorContainer b e Source #

Wrapper for barbies that act as containers of e\n- by wearing Either e.

Constructors

ErrorContainer 

Fields

Instances

Instances details
TraversableB b => Foldable (ErrorContainer b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

fold :: Monoid m => ErrorContainer b m -> m Source #

foldMap :: Monoid m => (a -> m) -> ErrorContainer b a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ErrorContainer b a -> m Source #

foldr :: (a -> b0 -> b0) -> b0 -> ErrorContainer b a -> b0 Source #

foldr' :: (a -> b0 -> b0) -> b0 -> ErrorContainer b a -> b0 Source #

foldl :: (b0 -> a -> b0) -> b0 -> ErrorContainer b a -> b0 Source #

foldl' :: (b0 -> a -> b0) -> b0 -> ErrorContainer b a -> b0 Source #

foldr1 :: (a -> a -> a) -> ErrorContainer b a -> a Source #

foldl1 :: (a -> a -> a) -> ErrorContainer b a -> a Source #

toList :: ErrorContainer b a -> [a] Source #

null :: ErrorContainer b a -> Bool Source #

length :: ErrorContainer b a -> Int Source #

elem :: Eq a => a -> ErrorContainer b a -> Bool Source #

maximum :: Ord a => ErrorContainer b a -> a Source #

minimum :: Ord a => ErrorContainer b a -> a Source #

sum :: Num a => ErrorContainer b a -> a Source #

product :: Num a => ErrorContainer b a -> a Source #

TraversableB b => Traversable (ErrorContainer b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

traverse :: Applicative f => (a -> f b0) -> ErrorContainer b a -> f (ErrorContainer b b0) Source #

sequenceA :: Applicative f => ErrorContainer b (f a) -> f (ErrorContainer b a) Source #

mapM :: Monad m => (a -> m b0) -> ErrorContainer b a -> m (ErrorContainer b b0) Source #

sequence :: Monad m => ErrorContainer b (m a) -> m (ErrorContainer b a) Source #

FunctorB b => Functor (ErrorContainer b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

fmap :: (a -> b0) -> ErrorContainer b a -> ErrorContainer b b0 Source #

(<$) :: a -> ErrorContainer b b0 -> ErrorContainer b a Source #

Generic (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Associated Types

type Rep (ErrorContainer b e) :: Type -> Type Source #

Methods

from :: ErrorContainer b e -> Rep (ErrorContainer b e) x Source #

to :: Rep (ErrorContainer b e) x -> ErrorContainer b e Source #

Read (b (Either e)) => Read (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

readsPrec :: Int -> ReadS (ErrorContainer b e) Source #

readList :: ReadS [ErrorContainer b e] Source #

readPrec :: ReadPrec (ErrorContainer b e) Source #

readListPrec :: ReadPrec [ErrorContainer b e] Source #

Show (b (Either e)) => Show (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

showsPrec :: Int -> ErrorContainer b e -> ShowS Source #

show :: ErrorContainer b e -> String Source #

showList :: [ErrorContainer b e] -> ShowS Source #

Eq (b (Either e)) => Eq (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

(==) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

(/=) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

Ord (b (Either e)) => Ord (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

compare :: ErrorContainer b e -> ErrorContainer b e -> Ordering Source #

(<) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

(<=) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

(>) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

(>=) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

max :: ErrorContainer b e -> ErrorContainer b e -> ErrorContainer b e Source #

min :: ErrorContainer b e -> ErrorContainer b e -> ErrorContainer b e Source #

type Rep (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

type Rep (ErrorContainer b e) = D1 ('MetaData "ErrorContainer" "Barbies.Internal.Containers" "barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe" 'True) (C1 ('MetaCons "ErrorContainer" 'PrefixI 'True) (S1 ('MetaSel ('Just "getErrorContainer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (b (Either e)))))

Wrappers

This can be use with deriving via to automate derivation of instances\n- for Barbie-types.

newtype Barbie (b :: (k -> Type) -> Type) f Source #

A wrapper for Barbie-types, providing useful instances.

Constructors

Barbie 

Fields

Instances

Instances details
ApplicativeB b => ApplicativeB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

bpure :: (forall (a :: k0). f a) -> Barbie b f Source #

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Barbie b f -> Barbie b g -> Barbie b (Product f g) Source #

ConstraintsB b => ConstraintsB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Associated Types

type AllB c (Barbie b) Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c (Barbie b) => Barbie b f -> Barbie b (Product (Dict c) f) Source #

FunctorB b => FunctorB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Barbie b f -> Barbie b g Source #

TraversableB b => TraversableB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Barbie b f -> e (Barbie b g) Source #

ProductB b => ProductB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Barbie b f -> Barbie b g -> Barbie b (Product f g) Source #

buniq :: (forall (a :: k0). f a) -> Barbie b f Source #

ProductBC b => ProductBC (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c (Barbie b) => Barbie b (Dict c) Source #

(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b, AllBF Monoid f b) => Monoid (Barbie b f) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

mempty :: Barbie b f Source #

mappend :: Barbie b f -> Barbie b f -> Barbie b f Source #

mconcat :: [Barbie b f] -> Barbie b f Source #

(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b) => Semigroup (Barbie b f) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

(<>) :: Barbie b f -> Barbie b f -> Barbie b f Source #

sconcat :: NonEmpty (Barbie b f) -> Barbie b f Source #

stimes :: Integral b0 => b0 -> Barbie b f -> Barbie b f Source #

type AllB (c :: k -> Constraint) (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

type AllB (c :: k -> Constraint) (Barbie b :: (k -> Type) -> Type) = AllB c b

Trivial Barbies

data Void (f :: k -> Type) Source #

Uninhabited barbie type.

Instances

Instances details
ConstraintsB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type AllB c Void Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c Void => Void f -> Void (Product (Dict c) f) Source #

FunctorB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Void f -> Void g Source #

TraversableB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Void f -> e (Void g) Source #

Semigroup (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(<>) :: Void f -> Void f -> Void f Source #

sconcat :: NonEmpty (Void f) -> Void f Source #

stimes :: Integral b => b -> Void f -> Void f Source #

Generic (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type Rep (Void f) :: Type -> Type Source #

Methods

from :: Void f -> Rep (Void f) x Source #

to :: Rep (Void f) x -> Void f Source #

Show (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

showsPrec :: Int -> Void f -> ShowS Source #

show :: Void f -> String Source #

showList :: [Void f] -> ShowS Source #

Eq (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(==) :: Void f -> Void f -> Bool Source #

(/=) :: Void f -> Void f -> Bool Source #

Ord (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

compare :: Void f -> Void f -> Ordering Source #

(<) :: Void f -> Void f -> Bool Source #

(<=) :: Void f -> Void f -> Bool Source #

(>) :: Void f -> Void f -> Bool Source #

(>=) :: Void f -> Void f -> Bool Source #

max :: Void f -> Void f -> Void f Source #

min :: Void f -> Void f -> Void f Source #

type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) = GAll 0 c (GAllRepB (Void :: (k -> Type) -> Type))
type Rep (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type Rep (Void f) = D1 ('MetaData "Void" "Barbies.Internal.Trivial" "barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe" 'False) (V1 :: Type -> Type)

data Unit (f :: k -> Type) Source #

A barbie type without structure.

Constructors

Unit 

Instances

Instances details
ApplicativeB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bpure :: (forall (a :: k0). f a) -> Unit f Source #

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Unit f -> Unit g -> Unit (Product f g) Source #

ConstraintsB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type AllB c Unit Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c Unit => Unit f -> Unit (Product (Dict c) f) Source #

DistributiveB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bdistribute :: forall f (g :: k0 -> Type). Functor f => f (Unit g) -> Unit (Compose f g) Source #

FunctorB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Unit f -> Unit g Source #

TraversableB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Unit f -> e (Unit g) Source #

ProductB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Unit f -> Unit g -> Unit (Product f g) Source #

buniq :: (forall (a :: k0). f a) -> Unit f Source #

ProductBC (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c Unit => Unit (Dict c) Source #

(Typeable f, Typeable k) => Data (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Unit f -> c (Unit f) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Unit f) Source #

toConstr :: Unit f -> Constr Source #

dataTypeOf :: Unit f -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Unit f)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Unit f)) Source #

gmapT :: (forall b. Data b => b -> b) -> Unit f -> Unit f Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unit f -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unit f -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Unit f -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Unit f -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

Monoid (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

mempty :: Unit f Source #

mappend :: Unit f -> Unit f -> Unit f Source #

mconcat :: [Unit f] -> Unit f Source #

Semigroup (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(<>) :: Unit f -> Unit f -> Unit f Source #

sconcat :: NonEmpty (Unit f) -> Unit f Source #

stimes :: Integral b => b -> Unit f -> Unit f Source #

Generic (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type Rep (Unit f) :: Type -> Type Source #

Methods

from :: Unit f -> Rep (Unit f) x Source #

to :: Rep (Unit f) x -> Unit f Source #

Read (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

readsPrec :: Int -> ReadS (Unit f) Source #

readList :: ReadS [Unit f] Source #

readPrec :: ReadPrec (Unit f) Source #

readListPrec :: ReadPrec [Unit f] Source #

Show (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

showsPrec :: Int -> Unit f -> ShowS Source #

show :: Unit f -> String Source #

showList :: [Unit f] -> ShowS Source #

Eq (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(==) :: Unit f -> Unit f -> Bool Source #

(/=) :: Unit f -> Unit f -> Bool Source #

Ord (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

compare :: Unit f -> Unit f -> Ordering Source #

(<) :: Unit f -> Unit f -> Bool Source #

(<=) :: Unit f -> Unit f -> Bool Source #

(>) :: Unit f -> Unit f -> Bool Source #

(>=) :: Unit f -> Unit f -> Bool Source #

max :: Unit f -> Unit f -> Unit f Source #

min :: Unit f -> Unit f -> Unit f Source #

type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) = GAll 0 c (GAllRepB (Unit :: (k -> Type) -> Type))
type Rep (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type Rep (Unit f) = D1 ('MetaData "Unit" "Barbies.Internal.Trivial" "barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe" 'False) (C1 ('MetaCons "Unit" 'PrefixI 'False) (U1 :: Type -> Type))

Produced by Haddock version 2.29.2

\n+ by wearing (Const a).

Constructors

Container 

Fields

Instances

Instances details
TraversableB b => Foldable (Container b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

fold :: Monoid m => Container b m -> m Source #

foldMap :: Monoid m => (a -> m) -> Container b a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Container b a -> m Source #

foldr :: (a -> b0 -> b0) -> b0 -> Container b a -> b0 Source #

foldr' :: (a -> b0 -> b0) -> b0 -> Container b a -> b0 Source #

foldl :: (b0 -> a -> b0) -> b0 -> Container b a -> b0 Source #

foldl' :: (b0 -> a -> b0) -> b0 -> Container b a -> b0 Source #

foldr1 :: (a -> a -> a) -> Container b a -> a Source #

foldl1 :: (a -> a -> a) -> Container b a -> a Source #

toList :: Container b a -> [a] Source #

null :: Container b a -> Bool Source #

length :: Container b a -> Int Source #

elem :: Eq a => a -> Container b a -> Bool Source #

maximum :: Ord a => Container b a -> a Source #

minimum :: Ord a => Container b a -> a Source #

sum :: Num a => Container b a -> a Source #

product :: Num a => Container b a -> a Source #

TraversableB b => Traversable (Container b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

traverse :: Applicative f => (a -> f b0) -> Container b a -> f (Container b b0) Source #

sequenceA :: Applicative f => Container b (f a) -> f (Container b a) Source #

mapM :: Monad m => (a -> m b0) -> Container b a -> m (Container b b0) Source #

sequence :: Monad m => Container b (m a) -> m (Container b a) Source #

ApplicativeB b => Applicative (Container b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

pure :: a -> Container b a Source #

(<*>) :: Container b (a -> b0) -> Container b a -> Container b b0 Source #

liftA2 :: (a -> b0 -> c) -> Container b a -> Container b b0 -> Container b c Source #

(*>) :: Container b a -> Container b b0 -> Container b b0 Source #

(<*) :: Container b a -> Container b b0 -> Container b a Source #

FunctorB b => Functor (Container b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

fmap :: (a -> b0) -> Container b a -> Container b b0 Source #

(<$) :: a -> Container b b0 -> Container b a Source #

Generic (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Associated Types

type Rep (Container b a) :: Type -> Type Source #

Methods

from :: Container b a -> Rep (Container b a) x Source #

to :: Rep (Container b a) x -> Container b a Source #

Read (b (Const a :: Type -> Type)) => Read (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

readsPrec :: Int -> ReadS (Container b a) Source #

readList :: ReadS [Container b a] Source #

readPrec :: ReadPrec (Container b a) Source #

readListPrec :: ReadPrec [Container b a] Source #

Show (b (Const a :: Type -> Type)) => Show (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

showsPrec :: Int -> Container b a -> ShowS Source #

show :: Container b a -> String Source #

showList :: [Container b a] -> ShowS Source #

Eq (b (Const a :: Type -> Type)) => Eq (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

(==) :: Container b a -> Container b a -> Bool Source #

(/=) :: Container b a -> Container b a -> Bool Source #

Ord (b (Const a :: Type -> Type)) => Ord (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

compare :: Container b a -> Container b a -> Ordering Source #

(<) :: Container b a -> Container b a -> Bool Source #

(<=) :: Container b a -> Container b a -> Bool Source #

(>) :: Container b a -> Container b a -> Bool Source #

(>=) :: Container b a -> Container b a -> Bool Source #

max :: Container b a -> Container b a -> Container b a Source #

min :: Container b a -> Container b a -> Container b a Source #

type Rep (Container b a) Source # 
Instance details

Defined in Barbies.Internal.Containers

type Rep (Container b a) = D1 ('MetaData "Container" "Barbies.Internal.Containers" "barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U" 'True) (C1 ('MetaCons "Container" 'PrefixI 'True) (S1 ('MetaSel ('Just "getContainer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (b (Const a :: Type -> Type)))))

newtype ErrorContainer b e Source #

Wrapper for barbies that act as containers of e\n+ by wearing Either e.

Constructors

ErrorContainer 

Fields

Instances

Instances details
TraversableB b => Foldable (ErrorContainer b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

fold :: Monoid m => ErrorContainer b m -> m Source #

foldMap :: Monoid m => (a -> m) -> ErrorContainer b a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ErrorContainer b a -> m Source #

foldr :: (a -> b0 -> b0) -> b0 -> ErrorContainer b a -> b0 Source #

foldr' :: (a -> b0 -> b0) -> b0 -> ErrorContainer b a -> b0 Source #

foldl :: (b0 -> a -> b0) -> b0 -> ErrorContainer b a -> b0 Source #

foldl' :: (b0 -> a -> b0) -> b0 -> ErrorContainer b a -> b0 Source #

foldr1 :: (a -> a -> a) -> ErrorContainer b a -> a Source #

foldl1 :: (a -> a -> a) -> ErrorContainer b a -> a Source #

toList :: ErrorContainer b a -> [a] Source #

null :: ErrorContainer b a -> Bool Source #

length :: ErrorContainer b a -> Int Source #

elem :: Eq a => a -> ErrorContainer b a -> Bool Source #

maximum :: Ord a => ErrorContainer b a -> a Source #

minimum :: Ord a => ErrorContainer b a -> a Source #

sum :: Num a => ErrorContainer b a -> a Source #

product :: Num a => ErrorContainer b a -> a Source #

TraversableB b => Traversable (ErrorContainer b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

traverse :: Applicative f => (a -> f b0) -> ErrorContainer b a -> f (ErrorContainer b b0) Source #

sequenceA :: Applicative f => ErrorContainer b (f a) -> f (ErrorContainer b a) Source #

mapM :: Monad m => (a -> m b0) -> ErrorContainer b a -> m (ErrorContainer b b0) Source #

sequence :: Monad m => ErrorContainer b (m a) -> m (ErrorContainer b a) Source #

FunctorB b => Functor (ErrorContainer b) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

fmap :: (a -> b0) -> ErrorContainer b a -> ErrorContainer b b0 Source #

(<$) :: a -> ErrorContainer b b0 -> ErrorContainer b a Source #

Generic (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Associated Types

type Rep (ErrorContainer b e) :: Type -> Type Source #

Methods

from :: ErrorContainer b e -> Rep (ErrorContainer b e) x Source #

to :: Rep (ErrorContainer b e) x -> ErrorContainer b e Source #

Read (b (Either e)) => Read (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

readsPrec :: Int -> ReadS (ErrorContainer b e) Source #

readList :: ReadS [ErrorContainer b e] Source #

readPrec :: ReadPrec (ErrorContainer b e) Source #

readListPrec :: ReadPrec [ErrorContainer b e] Source #

Show (b (Either e)) => Show (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

showsPrec :: Int -> ErrorContainer b e -> ShowS Source #

show :: ErrorContainer b e -> String Source #

showList :: [ErrorContainer b e] -> ShowS Source #

Eq (b (Either e)) => Eq (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

(==) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

(/=) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

Ord (b (Either e)) => Ord (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

Methods

compare :: ErrorContainer b e -> ErrorContainer b e -> Ordering Source #

(<) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

(<=) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

(>) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

(>=) :: ErrorContainer b e -> ErrorContainer b e -> Bool Source #

max :: ErrorContainer b e -> ErrorContainer b e -> ErrorContainer b e Source #

min :: ErrorContainer b e -> ErrorContainer b e -> ErrorContainer b e Source #

type Rep (ErrorContainer b e) Source # 
Instance details

Defined in Barbies.Internal.Containers

type Rep (ErrorContainer b e) = D1 ('MetaData "ErrorContainer" "Barbies.Internal.Containers" "barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U" 'True) (C1 ('MetaCons "ErrorContainer" 'PrefixI 'True) (S1 ('MetaSel ('Just "getErrorContainer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (b (Either e)))))

Wrappers

This can be use with deriving via to automate derivation of instances\n+ for Barbie-types.

newtype Barbie (b :: (k -> Type) -> Type) f Source #

A wrapper for Barbie-types, providing useful instances.

Constructors

Barbie 

Fields

Instances

Instances details
ApplicativeB b => ApplicativeB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

bpure :: (forall (a :: k0). f a) -> Barbie b f Source #

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Barbie b f -> Barbie b g -> Barbie b (Product f g) Source #

ConstraintsB b => ConstraintsB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Associated Types

type AllB c (Barbie b) Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c (Barbie b) => Barbie b f -> Barbie b (Product (Dict c) f) Source #

FunctorB b => FunctorB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Barbie b f -> Barbie b g Source #

TraversableB b => TraversableB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Barbie b f -> e (Barbie b g) Source #

ProductB b => ProductB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Barbie b f -> Barbie b g -> Barbie b (Product f g) Source #

buniq :: (forall (a :: k0). f a) -> Barbie b f Source #

ProductBC b => ProductBC (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c (Barbie b) => Barbie b (Dict c) Source #

(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b, AllBF Monoid f b) => Monoid (Barbie b f) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

mempty :: Barbie b f Source #

mappend :: Barbie b f -> Barbie b f -> Barbie b f Source #

mconcat :: [Barbie b f] -> Barbie b f Source #

(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b) => Semigroup (Barbie b f) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

(<>) :: Barbie b f -> Barbie b f -> Barbie b f Source #

sconcat :: NonEmpty (Barbie b f) -> Barbie b f Source #

stimes :: Integral b0 => b0 -> Barbie b f -> Barbie b f Source #

type AllB (c :: k -> Constraint) (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

type AllB (c :: k -> Constraint) (Barbie b :: (k -> Type) -> Type) = AllB c b

Trivial Barbies

data Void (f :: k -> Type) Source #

Uninhabited barbie type.

Instances

Instances details
ConstraintsB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type AllB c Void Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c Void => Void f -> Void (Product (Dict c) f) Source #

FunctorB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Void f -> Void g Source #

TraversableB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Void f -> e (Void g) Source #

Semigroup (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(<>) :: Void f -> Void f -> Void f Source #

sconcat :: NonEmpty (Void f) -> Void f Source #

stimes :: Integral b => b -> Void f -> Void f Source #

Generic (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type Rep (Void f) :: Type -> Type Source #

Methods

from :: Void f -> Rep (Void f) x Source #

to :: Rep (Void f) x -> Void f Source #

Show (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

showsPrec :: Int -> Void f -> ShowS Source #

show :: Void f -> String Source #

showList :: [Void f] -> ShowS Source #

Eq (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(==) :: Void f -> Void f -> Bool Source #

(/=) :: Void f -> Void f -> Bool Source #

Ord (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

compare :: Void f -> Void f -> Ordering Source #

(<) :: Void f -> Void f -> Bool Source #

(<=) :: Void f -> Void f -> Bool Source #

(>) :: Void f -> Void f -> Bool Source #

(>=) :: Void f -> Void f -> Bool Source #

max :: Void f -> Void f -> Void f Source #

min :: Void f -> Void f -> Void f Source #

type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) = GAll 0 c (GAllRepB (Void :: (k -> Type) -> Type))
type Rep (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type Rep (Void f) = D1 ('MetaData "Void" "Barbies.Internal.Trivial" "barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U" 'False) (V1 :: Type -> Type)

data Unit (f :: k -> Type) Source #

A barbie type without structure.

Constructors

Unit 

Instances

Instances details
ApplicativeB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bpure :: (forall (a :: k0). f a) -> Unit f Source #

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Unit f -> Unit g -> Unit (Product f g) Source #

ConstraintsB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type AllB c Unit Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c Unit => Unit f -> Unit (Product (Dict c) f) Source #

DistributiveB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bdistribute :: forall f (g :: k0 -> Type). Functor f => f (Unit g) -> Unit (Compose f g) Source #

FunctorB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Unit f -> Unit g Source #

TraversableB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Unit f -> e (Unit g) Source #

ProductB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Unit f -> Unit g -> Unit (Product f g) Source #

buniq :: (forall (a :: k0). f a) -> Unit f Source #

ProductBC (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c Unit => Unit (Dict c) Source #

(Typeable f, Typeable k) => Data (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Unit f -> c (Unit f) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Unit f) Source #

toConstr :: Unit f -> Constr Source #

dataTypeOf :: Unit f -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Unit f)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Unit f)) Source #

gmapT :: (forall b. Data b => b -> b) -> Unit f -> Unit f Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unit f -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unit f -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Unit f -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Unit f -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

Monoid (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

mempty :: Unit f Source #

mappend :: Unit f -> Unit f -> Unit f Source #

mconcat :: [Unit f] -> Unit f Source #

Semigroup (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(<>) :: Unit f -> Unit f -> Unit f Source #

sconcat :: NonEmpty (Unit f) -> Unit f Source #

stimes :: Integral b => b -> Unit f -> Unit f Source #

Generic (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type Rep (Unit f) :: Type -> Type Source #

Methods

from :: Unit f -> Rep (Unit f) x Source #

to :: Rep (Unit f) x -> Unit f Source #

Read (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

readsPrec :: Int -> ReadS (Unit f) Source #

readList :: ReadS [Unit f] Source #

readPrec :: ReadPrec (Unit f) Source #

readListPrec :: ReadPrec [Unit f] Source #

Show (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

showsPrec :: Int -> Unit f -> ShowS Source #

show :: Unit f -> String Source #

showList :: [Unit f] -> ShowS Source #

Eq (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(==) :: Unit f -> Unit f -> Bool Source #

(/=) :: Unit f -> Unit f -> Bool Source #

Ord (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

compare :: Unit f -> Unit f -> Ordering Source #

(<) :: Unit f -> Unit f -> Bool Source #

(<=) :: Unit f -> Unit f -> Bool Source #

(>) :: Unit f -> Unit f -> Bool Source #

(>=) :: Unit f -> Unit f -> Bool Source #

max :: Unit f -> Unit f -> Unit f Source #

min :: Unit f -> Unit f -> Unit f Source #

type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) = GAll 0 c (GAllRepB (Unit :: (k -> Type) -> Type))
type Rep (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type Rep (Unit f) = D1 ('MetaData "Unit" "Barbies.Internal.Trivial" "barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U" 'False) (C1 ('MetaCons "Unit" 'PrefixI 'False) (U1 :: Type -> Type))

Produced by Haddock version 2.29.2

\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -285,15 +285,15 @@\n max :: Container b a -> Container b a -> Container b a Source #\n min :: Container b a -> Container b a -> Container b a Source #\n type Rep (Container b a) \u00a0\n Source #\n Instance details\n Defined in Barbies.Internal.Containers\n type Rep (Container b a) = D1 ('MetaData \"Container\"\n-\"Barbies.Internal.Containers\" \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\" 'True)\n+\"Barbies.Internal.Containers\" \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\" 'True)\n (C1 ('MetaCons \"Container\" 'PrefixI 'True) (S1 ('MetaSel ('Just\n \"getContainer\") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0\n (b (Const a :: Type -> Type)))))\n newtype ErrorContainer b e Source #\n Wrapper for barbies that act as containers of e by wearing Either e.\n Constructors\n ErrorContainer \u00a0\n@@ -390,15 +390,15 @@\n max :: ErrorContainer b e -> ErrorContainer b e -> ErrorContainer b e Source #\n min :: ErrorContainer b e -> ErrorContainer b e -> ErrorContainer b e Source #\n type Rep (ErrorContainer b e) \u00a0\n Source #\n Instance details\n Defined in Barbies.Internal.Containers\n type Rep (ErrorContainer b e) = D1 ('MetaData \"ErrorContainer\"\n-\"Barbies.Internal.Containers\" \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\" 'True)\n+\"Barbies.Internal.Containers\" \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\" 'True)\n (C1 ('MetaCons \"ErrorContainer\" 'PrefixI 'True) (S1 ('MetaSel ('Just\n \"getErrorContainer\") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy)\n (Rec0 (b (Either e)))))\n ******_Wrappers_******\n This can be use with deriving via to automate derivation of instances for\n Barbie-types.\n newtype Barbie (b :: (k -> Type) -> Type) f Source #\n@@ -556,15 +556,15 @@\n type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) = GAll 0 c\n (GAllRepB (Void :: (k -> Type) -> Type))\n type Rep (Void f) \u00a0\n Source #\n Instance details\n Defined in Barbies.Internal.Trivial\n type Rep (Void f) = D1 ('MetaData \"Void\" \"Barbies.Internal.Trivial\" \"barbies-\n-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\" 'False) (V1 :: Type -> Type)\n+2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\" 'False) (V1 :: Type -> Type)\n data Unit (f :: k -> Type) Source #\n A barbie type without structure.\n Constructors\n Unit \u00a0\n *** Instances ***\n Instances details\n ApplicativeB (Unit :: (k -> Type) -> Type) \u00a0\n@@ -715,10 +715,10 @@\n type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) = GAll 0 c\n (GAllRepB (Unit :: (k -> Type) -> Type))\n type Rep (Unit f) \u00a0\n Source #\n Instance details\n Defined in Barbies.Internal.Trivial\n type Rep (Unit f) = D1 ('MetaData \"Unit\" \"Barbies.Internal.Trivial\" \"barbies-\n-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\" 'False) (C1 ('MetaCons \"Unit\" 'PrefixI 'False)\n+2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\" 'False) (C1 ('MetaCons \"Unit\" 'PrefixI 'False)\n (U1 :: Type -> Type))\n Produced by Haddock version 2.29.2\n"}]}, {"source1": "./usr/share/doc/libghc-barbies-doc/html/Data-Barbie.html", "source2": "./usr/share/doc/libghc-barbies-doc/html/Data-Barbie.html", "unified_diff": "@@ -32,14 +32,14 @@\n

Utility functions

bmapC :: forall c b f g. (AllB c b, ConstraintsB b) => (forall a. c a => f a -> g a) -> b f -> b g Source #

Like bmap but a constraint is allowed to be required on\n each element of b

E.g. If all fields of b are Showable then you\n could store each shown value in it's slot using Const:

showFields :: (AllB Show b, ConstraintsB b) => b Identity -> b (Const String)\n showFields = bmapC @Show showField\n   where\n     showField :: forall a. Show a => Identity a -> Const String a\n     showField (Identity a) = Const (show a)

Notice that one can use the (&) class as a way to require several\n- constraiints to hold simultaneously:

bmap @(Show & Eq & Enum) r

btraverseC :: forall c b f g e. (TraversableB b, ConstraintsB b, AllB c b, Applicative e) => (forall a. c a => f a -> e (g a)) -> b f -> e (b g) Source #

Like btraverse but with a constraint on the elements of b.

Products and constaints

class (ConstraintsB b, ProductB b) => ProductBC (b :: (k -> Type) -> Type) where Source #

Minimal complete definition

Nothing

Methods

bdicts :: AllB c b => b (Dict c) Source #

default bdicts :: (CanDeriveProductBC c b, AllB c b) => b (Dict c) Source #

Instances

Instances details
ProductBC (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c Unit => Unit (Dict c) Source #

ProductBC (Proxy :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c Proxy => Proxy (Dict c) Source #

ProductBC b => ProductBC (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c (Barbie b) => Barbie b (Dict c) Source #

(ProductBC a, ProductBC b) => ProductBC (Product a b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c (Product a b) => Product a b (Dict c) Source #

type CanDeriveProductBC c b = (GenericN (b (Dict c)), AllB c b ~ GAll 0 c (GAllRepB b), GProductBC c (GAllRepB b) (RepN (b (Dict c)))) Source #

Utility functions

buniqC :: forall c f b. (AllB c b, ProductBC b) => (forall a. c a => f a) -> b f Source #

Deprecated: Use bpureC instead

bmempty :: forall f b. (AllBF Monoid f b, ConstraintsB b, ApplicativeB b) => b f Source #

Builds a b f, by applying mempty on every field of b.

Wrapper

newtype Barbie (b :: (k -> Type) -> Type) f Source #

A wrapper for Barbie-types, providing useful instances.

Constructors

Barbie 

Fields

Instances

Instances details
ApplicativeB b => ApplicativeB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

bpure :: (forall (a :: k0). f a) -> Barbie b f Source #

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Barbie b f -> Barbie b g -> Barbie b (Product f g) Source #

ConstraintsB b => ConstraintsB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Associated Types

type AllB c (Barbie b) Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c (Barbie b) => Barbie b f -> Barbie b (Product (Dict c) f) Source #

FunctorB b => FunctorB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Barbie b f -> Barbie b g Source #

TraversableB b => TraversableB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Barbie b f -> e (Barbie b g) Source #

ProductB b => ProductB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Barbie b f -> Barbie b g -> Barbie b (Product f g) Source #

buniq :: (forall (a :: k0). f a) -> Barbie b f Source #

ProductBC b => ProductBC (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c (Barbie b) => Barbie b (Dict c) Source #

(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b, AllBF Monoid f b) => Monoid (Barbie b f) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

mempty :: Barbie b f Source #

mappend :: Barbie b f -> Barbie b f -> Barbie b f Source #

mconcat :: [Barbie b f] -> Barbie b f Source #

(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b) => Semigroup (Barbie b f) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

(<>) :: Barbie b f -> Barbie b f -> Barbie b f Source #

sconcat :: NonEmpty (Barbie b f) -> Barbie b f Source #

stimes :: Integral b0 => b0 -> Barbie b f -> Barbie b f Source #

type AllB (c :: k -> Constraint) (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

type AllB (c :: k -> Constraint) (Barbie b :: (k -> Type) -> Type) = AllB c b

Trivial Barbies

data Void (f :: k -> Type) Source #

Uninhabited barbie type.

Instances

Instances details
ConstraintsB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type AllB c Void Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c Void => Void f -> Void (Product (Dict c) f) Source #

FunctorB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Void f -> Void g Source #

TraversableB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Void f -> e (Void g) Source #

Semigroup (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(<>) :: Void f -> Void f -> Void f Source #

sconcat :: NonEmpty (Void f) -> Void f Source #

stimes :: Integral b => b -> Void f -> Void f Source #

Generic (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type Rep (Void f) :: Type -> Type Source #

Methods

from :: Void f -> Rep (Void f) x Source #

to :: Rep (Void f) x -> Void f Source #

Show (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

showsPrec :: Int -> Void f -> ShowS Source #

show :: Void f -> String Source #

showList :: [Void f] -> ShowS Source #

Eq (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(==) :: Void f -> Void f -> Bool Source #

(/=) :: Void f -> Void f -> Bool Source #

Ord (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

compare :: Void f -> Void f -> Ordering Source #

(<) :: Void f -> Void f -> Bool Source #

(<=) :: Void f -> Void f -> Bool Source #

(>) :: Void f -> Void f -> Bool Source #

(>=) :: Void f -> Void f -> Bool Source #

max :: Void f -> Void f -> Void f Source #

min :: Void f -> Void f -> Void f Source #

type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) = GAll 0 c (GAllRepB (Void :: (k -> Type) -> Type))
type Rep (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type Rep (Void f) = D1 ('MetaData "Void" "Barbies.Internal.Trivial" "barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe" 'False) (V1 :: Type -> Type)

data Unit (f :: k -> Type) Source #

A barbie type without structure.

Constructors

Unit 

Instances

Instances details
ApplicativeB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bpure :: (forall (a :: k0). f a) -> Unit f Source #

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Unit f -> Unit g -> Unit (Product f g) Source #

ConstraintsB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type AllB c Unit Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c Unit => Unit f -> Unit (Product (Dict c) f) Source #

DistributiveB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bdistribute :: forall f (g :: k0 -> Type). Functor f => f (Unit g) -> Unit (Compose f g) Source #

FunctorB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Unit f -> Unit g Source #

TraversableB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Unit f -> e (Unit g) Source #

ProductB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Unit f -> Unit g -> Unit (Product f g) Source #

buniq :: (forall (a :: k0). f a) -> Unit f Source #

ProductBC (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c Unit => Unit (Dict c) Source #

(Typeable f, Typeable k) => Data (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Unit f -> c (Unit f) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Unit f) Source #

toConstr :: Unit f -> Constr Source #

dataTypeOf :: Unit f -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Unit f)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Unit f)) Source #

gmapT :: (forall b. Data b => b -> b) -> Unit f -> Unit f Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unit f -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unit f -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Unit f -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Unit f -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

Monoid (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

mempty :: Unit f Source #

mappend :: Unit f -> Unit f -> Unit f Source #

mconcat :: [Unit f] -> Unit f Source #

Semigroup (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(<>) :: Unit f -> Unit f -> Unit f Source #

sconcat :: NonEmpty (Unit f) -> Unit f Source #

stimes :: Integral b => b -> Unit f -> Unit f Source #

Generic (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type Rep (Unit f) :: Type -> Type Source #

Methods

from :: Unit f -> Rep (Unit f) x Source #

to :: Rep (Unit f) x -> Unit f Source #

Read (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

readsPrec :: Int -> ReadS (Unit f) Source #

readList :: ReadS [Unit f] Source #

readPrec :: ReadPrec (Unit f) Source #

readListPrec :: ReadPrec [Unit f] Source #

Show (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

showsPrec :: Int -> Unit f -> ShowS Source #

show :: Unit f -> String Source #

showList :: [Unit f] -> ShowS Source #

Eq (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(==) :: Unit f -> Unit f -> Bool Source #

(/=) :: Unit f -> Unit f -> Bool Source #

Ord (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

compare :: Unit f -> Unit f -> Ordering Source #

(<) :: Unit f -> Unit f -> Bool Source #

(<=) :: Unit f -> Unit f -> Bool Source #

(>) :: Unit f -> Unit f -> Bool Source #

(>=) :: Unit f -> Unit f -> Bool Source #

max :: Unit f -> Unit f -> Unit f Source #

min :: Unit f -> Unit f -> Unit f Source #

type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) = GAll 0 c (GAllRepB (Unit :: (k -> Type) -> Type))
type Rep (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type Rep (Unit f) = D1 ('MetaData "Unit" "Barbies.Internal.Trivial" "barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe" 'False) (C1 ('MetaCons "Unit" 'PrefixI 'False) (U1 :: Type -> Type))

Generic derivations

newtype Rec (p :: Type) a x Source #

Constructors

Rec 

Fields

Instances

Instances details
GTraversable (n :: k1) (f :: k2 -> Type) (g :: k2 -> Type) (Rec a a :: k3 -> Type) (Rec a a :: k3 -> Type) Source # 
Instance details

Defined in Barbies.Generics.Traversable

Methods

gtraverse :: forall t (x :: k20). Applicative t => Proxy n -> (forall (a0 :: k10). f a0 -> t (g a0)) -> Rec a a x -> t (Rec a a x) Source #

Monoid x => GApplicative (n :: k1) (f :: k2 -> Type) (g :: k2 -> Type) (Rec x x :: k3 -> Type) (Rec x x :: k3 -> Type) (Rec x x :: k3 -> Type) Source # 
Instance details

Defined in Barbies.Generics.Applicative

Methods

gprod :: forall (x0 :: k10). Proxy n -> Proxy f -> Proxy g -> Rec x x x0 -> Rec x x x0 -> Rec x x x0 Source #

gpure :: forall (x0 :: k10). (f ~ g, Rec x x ~ Rec x x) => Proxy n -> Proxy f -> Proxy (Rec x x) -> Proxy (Rec x x) -> (forall (a :: k20). f a) -> Rec x x x0 Source #

GConstraints n (c :: k1 -> Constraint) (f :: k2) (Rec a' a :: Type -> Type) (Rec b' b :: k3 -> Type) (Rec b' b :: k3 -> Type) Source # 
Instance details

Defined in Barbies.Generics.Constraints

Methods

gaddDicts :: forall (x :: k20). GAll n c (Rec a' a) => Rec b' b x -> Rec b' b x Source #

GFunctor n (f :: k1 -> Type) (g :: k1 -> Type) (Rec x x :: k2 -> Type) (Rec x x :: k2 -> Type) Source # 
Instance details

Defined in Barbies.Generics.Functor

Methods

gmap :: forall (x0 :: k10). Proxy n -> (forall (a :: k). f a -> g a) -> Rec x x x0 -> Rec x x x0 Source #

repbi ~ repbb => GBare n (Rec repbi repbi :: k -> Type) (Rec repbb repbb :: k -> Type) Source # 
Instance details

Defined in Barbies.Generics.Bare

Methods

gstrip :: forall (x :: k0). Proxy n -> Rec repbi repbi x -> Rec repbb repbb x Source #

gcover :: forall (x :: k0). Proxy n -> Rec repbb repbb x -> Rec repbi repbi x Source #

type GAll n (c :: k -> Constraint) (Rec l r :: Type -> Type) Source # 
Instance details

Defined in Barbies.Generics.Constraints

type GAll n (c :: k -> Constraint) (Rec l r :: Type -> Type)

class GProductB (f :: k -> Type) (g :: k -> Type) repbf repbg repbfg where Source #

Methods

gbprod :: Proxy f -> Proxy g -> repbf x -> repbg x -> repbfg x Source #

gbuniq :: (f ~ g, repbf ~ repbg) => Proxy f -> Proxy repbf -> Proxy repbfg -> (forall a. f a) -> repbf x Source #

Instances

Instances details
GProductB (f :: k1 -> Type) (g :: k1 -> Type) (U1 :: k2 -> Type) (U1 :: k2 -> Type) (U1 :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

gbprod :: forall (x :: k). Proxy f -> Proxy g -> U1 x -> U1 x -> U1 x Source #

gbuniq :: forall (x :: k). (f ~ g, U1 ~ U1) => Proxy f -> Proxy U1 -> Proxy U1 -> (forall (a :: k10). f a) -> U1 x Source #

(GProductB f g lf lg lfg, GProductB f g rf rg rfg) => GProductB (f :: k1 -> Type) (g :: k1 -> Type) (lf :*: rf :: k2 -> Type) (lg :*: rg :: k2 -> Type) (lfg :*: rfg :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

gbprod :: forall (x :: k). Proxy f -> Proxy g -> (lf :*: rf) x -> (lg :*: rg) x -> (lfg :*: rfg) x Source #

gbuniq :: forall (x :: k). (f ~ g, (lf :*: rf) ~ (lg :*: rg)) => Proxy f -> Proxy (lf :*: rf) -> Proxy (lfg :*: rfg) -> (forall (a :: k10). f a) -> (lf :*: rf) x Source #

GProductB f g repf repg repfg => GProductB (f :: k1 -> Type) (g :: k1 -> Type) (M1 i c repf :: k2 -> Type) (M1 i c repg :: k2 -> Type) (M1 i c repfg :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

gbprod :: forall (x :: k). Proxy f -> Proxy g -> M1 i c repf x -> M1 i c repg x -> M1 i c repfg x Source #

gbuniq :: forall (x :: k). (f ~ g, M1 i c repf ~ M1 i c repg) => Proxy f -> Proxy (M1 i c repf) -> Proxy (M1 i c repfg) -> (forall (a :: k10). f a) -> M1 i c repf x Source #

class GProductBC c repbx repbd where Source #

Methods

gbdicts :: GAll 0 c repbx => repbd x Source #

Instances

Instances details
GProductBC (c :: k1 -> Constraint) (U1 :: Type -> Type) (U1 :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

gbdicts :: forall (x :: k10). GAll 0 c U1 => U1 x Source #

(GProductBC c lx ld, GProductBC c rx rd) => GProductBC (c :: k1 -> Constraint) (lx :*: rx) (ld :*: rd :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

gbdicts :: forall (x :: k10). GAll 0 c (lx :*: rx) => (ld :*: rd) x Source #

GProductBC c repbx repbd => GProductBC (c :: k1 -> Constraint) (M1 i k3 repbx) (M1 i k3 repbd :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

gbdicts :: forall (x :: k10). GAll 0 c (M1 i k3 repbx) => M1 i k3 repbd x Source #

Deprecations

(/*/) :: ProductB b => b f -> b g -> b (Prod '[f, g]) infixr 4 Source #

Like bprod, but returns a binary Prod, instead of Product, which\n+ constraiints to hold simultaneously:

bmap @(Show & Eq & Enum) r

btraverseC :: forall c b f g e. (TraversableB b, ConstraintsB b, AllB c b, Applicative e) => (forall a. c a => f a -> e (g a)) -> b f -> e (b g) Source #

Like btraverse but with a constraint on the elements of b.

Products and constaints

class (ConstraintsB b, ProductB b) => ProductBC (b :: (k -> Type) -> Type) where Source #

Minimal complete definition

Nothing

Methods

bdicts :: AllB c b => b (Dict c) Source #

default bdicts :: (CanDeriveProductBC c b, AllB c b) => b (Dict c) Source #

Instances

Instances details
ProductBC (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c Unit => Unit (Dict c) Source #

ProductBC (Proxy :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c Proxy => Proxy (Dict c) Source #

ProductBC b => ProductBC (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c (Barbie b) => Barbie b (Dict c) Source #

(ProductBC a, ProductBC b) => ProductBC (Product a b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c (Product a b) => Product a b (Dict c) Source #

type CanDeriveProductBC c b = (GenericN (b (Dict c)), AllB c b ~ GAll 0 c (GAllRepB b), GProductBC c (GAllRepB b) (RepN (b (Dict c)))) Source #

Utility functions

buniqC :: forall c f b. (AllB c b, ProductBC b) => (forall a. c a => f a) -> b f Source #

Deprecated: Use bpureC instead

bmempty :: forall f b. (AllBF Monoid f b, ConstraintsB b, ApplicativeB b) => b f Source #

Builds a b f, by applying mempty on every field of b.

Wrapper

newtype Barbie (b :: (k -> Type) -> Type) f Source #

A wrapper for Barbie-types, providing useful instances.

Constructors

Barbie 

Fields

Instances

Instances details
ApplicativeB b => ApplicativeB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

bpure :: (forall (a :: k0). f a) -> Barbie b f Source #

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Barbie b f -> Barbie b g -> Barbie b (Product f g) Source #

ConstraintsB b => ConstraintsB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Associated Types

type AllB c (Barbie b) Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c (Barbie b) => Barbie b f -> Barbie b (Product (Dict c) f) Source #

FunctorB b => FunctorB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Barbie b f -> Barbie b g Source #

TraversableB b => TraversableB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Barbie b f -> e (Barbie b g) Source #

ProductB b => ProductB (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Barbie b f -> Barbie b g -> Barbie b (Product f g) Source #

buniq :: (forall (a :: k0). f a) -> Barbie b f Source #

ProductBC b => ProductBC (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c (Barbie b) => Barbie b (Dict c) Source #

(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b, AllBF Monoid f b) => Monoid (Barbie b f) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

mempty :: Barbie b f Source #

mappend :: Barbie b f -> Barbie b f -> Barbie b f Source #

mconcat :: [Barbie b f] -> Barbie b f Source #

(ConstraintsB b, ApplicativeB b, AllBF Semigroup f b) => Semigroup (Barbie b f) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

Methods

(<>) :: Barbie b f -> Barbie b f -> Barbie b f Source #

sconcat :: NonEmpty (Barbie b f) -> Barbie b f Source #

stimes :: Integral b0 => b0 -> Barbie b f -> Barbie b f Source #

type AllB (c :: k -> Constraint) (Barbie b :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Wrappers

type AllB (c :: k -> Constraint) (Barbie b :: (k -> Type) -> Type) = AllB c b

Trivial Barbies

data Void (f :: k -> Type) Source #

Uninhabited barbie type.

Instances

Instances details
ConstraintsB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type AllB c Void Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c Void => Void f -> Void (Product (Dict c) f) Source #

FunctorB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Void f -> Void g Source #

TraversableB (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Void f -> e (Void g) Source #

Semigroup (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(<>) :: Void f -> Void f -> Void f Source #

sconcat :: NonEmpty (Void f) -> Void f Source #

stimes :: Integral b => b -> Void f -> Void f Source #

Generic (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type Rep (Void f) :: Type -> Type Source #

Methods

from :: Void f -> Rep (Void f) x Source #

to :: Rep (Void f) x -> Void f Source #

Show (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

showsPrec :: Int -> Void f -> ShowS Source #

show :: Void f -> String Source #

showList :: [Void f] -> ShowS Source #

Eq (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(==) :: Void f -> Void f -> Bool Source #

(/=) :: Void f -> Void f -> Bool Source #

Ord (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

compare :: Void f -> Void f -> Ordering Source #

(<) :: Void f -> Void f -> Bool Source #

(<=) :: Void f -> Void f -> Bool Source #

(>) :: Void f -> Void f -> Bool Source #

(>=) :: Void f -> Void f -> Bool Source #

max :: Void f -> Void f -> Void f Source #

min :: Void f -> Void f -> Void f Source #

type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) = GAll 0 c (GAllRepB (Void :: (k -> Type) -> Type))
type Rep (Void f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type Rep (Void f) = D1 ('MetaData "Void" "Barbies.Internal.Trivial" "barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U" 'False) (V1 :: Type -> Type)

data Unit (f :: k -> Type) Source #

A barbie type without structure.

Constructors

Unit 

Instances

Instances details
ApplicativeB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bpure :: (forall (a :: k0). f a) -> Unit f Source #

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Unit f -> Unit g -> Unit (Product f g) Source #

ConstraintsB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type AllB c Unit Source #

Methods

baddDicts :: forall (c :: k0 -> Constraint) (f :: k0 -> Type). AllB c Unit => Unit f -> Unit (Product (Dict c) f) Source #

DistributiveB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bdistribute :: forall f (g :: k0 -> Type). Functor f => f (Unit g) -> Unit (Compose f g) Source #

FunctorB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

bmap :: (forall (a :: k0). f a -> g a) -> Unit f -> Unit g Source #

TraversableB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

btraverse :: Applicative e => (forall (a :: k0). f a -> e (g a)) -> Unit f -> e (Unit g) Source #

ProductB (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

bprod :: forall (f :: k0 -> Type) (g :: k0 -> Type). Unit f -> Unit g -> Unit (Product f g) Source #

buniq :: (forall (a :: k0). f a) -> Unit f Source #

ProductBC (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

bdicts :: forall (c :: k0 -> Constraint). AllB c Unit => Unit (Dict c) Source #

(Typeable f, Typeable k) => Data (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Unit f -> c (Unit f) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Unit f) Source #

toConstr :: Unit f -> Constr Source #

dataTypeOf :: Unit f -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Unit f)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Unit f)) Source #

gmapT :: (forall b. Data b => b -> b) -> Unit f -> Unit f Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unit f -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unit f -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Unit f -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Unit f -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit f -> m (Unit f) Source #

Monoid (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

mempty :: Unit f Source #

mappend :: Unit f -> Unit f -> Unit f Source #

mconcat :: [Unit f] -> Unit f Source #

Semigroup (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(<>) :: Unit f -> Unit f -> Unit f Source #

sconcat :: NonEmpty (Unit f) -> Unit f Source #

stimes :: Integral b => b -> Unit f -> Unit f Source #

Generic (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Associated Types

type Rep (Unit f) :: Type -> Type Source #

Methods

from :: Unit f -> Rep (Unit f) x Source #

to :: Rep (Unit f) x -> Unit f Source #

Read (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

readsPrec :: Int -> ReadS (Unit f) Source #

readList :: ReadS [Unit f] Source #

readPrec :: ReadPrec (Unit f) Source #

readListPrec :: ReadPrec [Unit f] Source #

Show (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

showsPrec :: Int -> Unit f -> ShowS Source #

show :: Unit f -> String Source #

showList :: [Unit f] -> ShowS Source #

Eq (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

(==) :: Unit f -> Unit f -> Bool Source #

(/=) :: Unit f -> Unit f -> Bool Source #

Ord (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

Methods

compare :: Unit f -> Unit f -> Ordering Source #

(<) :: Unit f -> Unit f -> Bool Source #

(<=) :: Unit f -> Unit f -> Bool Source #

(>) :: Unit f -> Unit f -> Bool Source #

(>=) :: Unit f -> Unit f -> Bool Source #

max :: Unit f -> Unit f -> Unit f Source #

min :: Unit f -> Unit f -> Unit f Source #

type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) = GAll 0 c (GAllRepB (Unit :: (k -> Type) -> Type))
type Rep (Unit f) Source # 
Instance details

Defined in Barbies.Internal.Trivial

type Rep (Unit f) = D1 ('MetaData "Unit" "Barbies.Internal.Trivial" "barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U" 'False) (C1 ('MetaCons "Unit" 'PrefixI 'False) (U1 :: Type -> Type))

Generic derivations

newtype Rec (p :: Type) a x Source #

Constructors

Rec 

Fields

Instances

Instances details
GTraversable (n :: k1) (f :: k2 -> Type) (g :: k2 -> Type) (Rec a a :: k3 -> Type) (Rec a a :: k3 -> Type) Source # 
Instance details

Defined in Barbies.Generics.Traversable

Methods

gtraverse :: forall t (x :: k20). Applicative t => Proxy n -> (forall (a0 :: k10). f a0 -> t (g a0)) -> Rec a a x -> t (Rec a a x) Source #

Monoid x => GApplicative (n :: k1) (f :: k2 -> Type) (g :: k2 -> Type) (Rec x x :: k3 -> Type) (Rec x x :: k3 -> Type) (Rec x x :: k3 -> Type) Source # 
Instance details

Defined in Barbies.Generics.Applicative

Methods

gprod :: forall (x0 :: k10). Proxy n -> Proxy f -> Proxy g -> Rec x x x0 -> Rec x x x0 -> Rec x x x0 Source #

gpure :: forall (x0 :: k10). (f ~ g, Rec x x ~ Rec x x) => Proxy n -> Proxy f -> Proxy (Rec x x) -> Proxy (Rec x x) -> (forall (a :: k20). f a) -> Rec x x x0 Source #

GConstraints n (c :: k1 -> Constraint) (f :: k2) (Rec a' a :: Type -> Type) (Rec b' b :: k3 -> Type) (Rec b' b :: k3 -> Type) Source # 
Instance details

Defined in Barbies.Generics.Constraints

Methods

gaddDicts :: forall (x :: k20). GAll n c (Rec a' a) => Rec b' b x -> Rec b' b x Source #

GFunctor n (f :: k1 -> Type) (g :: k1 -> Type) (Rec x x :: k2 -> Type) (Rec x x :: k2 -> Type) Source # 
Instance details

Defined in Barbies.Generics.Functor

Methods

gmap :: forall (x0 :: k10). Proxy n -> (forall (a :: k). f a -> g a) -> Rec x x x0 -> Rec x x x0 Source #

repbi ~ repbb => GBare n (Rec repbi repbi :: k -> Type) (Rec repbb repbb :: k -> Type) Source # 
Instance details

Defined in Barbies.Generics.Bare

Methods

gstrip :: forall (x :: k0). Proxy n -> Rec repbi repbi x -> Rec repbb repbb x Source #

gcover :: forall (x :: k0). Proxy n -> Rec repbb repbb x -> Rec repbi repbi x Source #

type GAll n (c :: k -> Constraint) (Rec l r :: Type -> Type) Source # 
Instance details

Defined in Barbies.Generics.Constraints

type GAll n (c :: k -> Constraint) (Rec l r :: Type -> Type)

class GProductB (f :: k -> Type) (g :: k -> Type) repbf repbg repbfg where Source #

Methods

gbprod :: Proxy f -> Proxy g -> repbf x -> repbg x -> repbfg x Source #

gbuniq :: (f ~ g, repbf ~ repbg) => Proxy f -> Proxy repbf -> Proxy repbfg -> (forall a. f a) -> repbf x Source #

Instances

Instances details
GProductB (f :: k1 -> Type) (g :: k1 -> Type) (U1 :: k2 -> Type) (U1 :: k2 -> Type) (U1 :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

gbprod :: forall (x :: k). Proxy f -> Proxy g -> U1 x -> U1 x -> U1 x Source #

gbuniq :: forall (x :: k). (f ~ g, U1 ~ U1) => Proxy f -> Proxy U1 -> Proxy U1 -> (forall (a :: k10). f a) -> U1 x Source #

(GProductB f g lf lg lfg, GProductB f g rf rg rfg) => GProductB (f :: k1 -> Type) (g :: k1 -> Type) (lf :*: rf :: k2 -> Type) (lg :*: rg :: k2 -> Type) (lfg :*: rfg :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

gbprod :: forall (x :: k). Proxy f -> Proxy g -> (lf :*: rf) x -> (lg :*: rg) x -> (lfg :*: rfg) x Source #

gbuniq :: forall (x :: k). (f ~ g, (lf :*: rf) ~ (lg :*: rg)) => Proxy f -> Proxy (lf :*: rf) -> Proxy (lfg :*: rfg) -> (forall (a :: k10). f a) -> (lf :*: rf) x Source #

GProductB f g repf repg repfg => GProductB (f :: k1 -> Type) (g :: k1 -> Type) (M1 i c repf :: k2 -> Type) (M1 i c repg :: k2 -> Type) (M1 i c repfg :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.Product

Methods

gbprod :: forall (x :: k). Proxy f -> Proxy g -> M1 i c repf x -> M1 i c repg x -> M1 i c repfg x Source #

gbuniq :: forall (x :: k). (f ~ g, M1 i c repf ~ M1 i c repg) => Proxy f -> Proxy (M1 i c repf) -> Proxy (M1 i c repfg) -> (forall (a :: k10). f a) -> M1 i c repf x Source #

class GProductBC c repbx repbd where Source #

Methods

gbdicts :: GAll 0 c repbx => repbd x Source #

Instances

Instances details
GProductBC (c :: k1 -> Constraint) (U1 :: Type -> Type) (U1 :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

gbdicts :: forall (x :: k10). GAll 0 c U1 => U1 x Source #

(GProductBC c lx ld, GProductBC c rx rd) => GProductBC (c :: k1 -> Constraint) (lx :*: rx) (ld :*: rd :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

gbdicts :: forall (x :: k10). GAll 0 c (lx :*: rx) => (ld :*: rd) x Source #

GProductBC c repbx repbd => GProductBC (c :: k1 -> Constraint) (M1 i k3 repbx) (M1 i k3 repbd :: k2 -> Type) Source # 
Instance details

Defined in Data.Barbie.Internal.ProductC

Methods

gbdicts :: forall (x :: k10). GAll 0 c (M1 i k3 repbx) => M1 i k3 repbd x Source #

Deprecations

(/*/) :: ProductB b => b f -> b g -> b (Prod '[f, g]) infixr 4 Source #

Like bprod, but returns a binary Prod, instead of Product, which\n composes better.

See /*/ for usage.

(/*) :: ProductB b => b f -> b (Prod fs) -> b (Prod (f ': fs)) infixr 4 Source #

Similar to /*/ but one of the sides is already a Prod fs.

Note that /*, /*/ and uncurryn are meant to be used together:\n /* and /*/ combine b f1, b f2...b fn into a single product that\n can then be consumed by using uncurryn on an n-ary function. E.g.

f :: f a -> g a -> h a -> i a\n \n bmap (uncurryn f) (bf /* bg /*/ bh)\n

Produced by Haddock version 2.29.2

\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -665,15 +665,15 @@\n type AllB (c :: k -> Constraint) (Void :: (k -> Type) -> Type) = GAll 0 c\n (GAllRepB (Void :: (k -> Type) -> Type))\n type Rep (Void f) \u00a0\n Source #\n Instance details\n Defined in Barbies.Internal.Trivial\n type Rep (Void f) = D1 ('MetaData \"Void\" \"Barbies.Internal.Trivial\" \"barbies-\n-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\" 'False) (V1 :: Type -> Type)\n+2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\" 'False) (V1 :: Type -> Type)\n data Unit (f :: k -> Type) Source #\n A barbie type without structure.\n Constructors\n Unit \u00a0\n *** Instances ***\n Instances details\n ApplicativeB (Unit :: (k -> Type) -> Type) \u00a0\n@@ -824,15 +824,15 @@\n type AllB (c :: k -> Constraint) (Unit :: (k -> Type) -> Type) = GAll 0 c\n (GAllRepB (Unit :: (k -> Type) -> Type))\n type Rep (Unit f) \u00a0\n Source #\n Instance details\n Defined in Barbies.Internal.Trivial\n type Rep (Unit f) = D1 ('MetaData \"Unit\" \"Barbies.Internal.Trivial\" \"barbies-\n-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\" 'False) (C1 ('MetaCons \"Unit\" 'PrefixI 'False)\n+2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\" 'False) (C1 ('MetaCons \"Unit\" 'PrefixI 'False)\n (U1 :: Type -> Type))\n ******_Generic_derivations_******\n newtype Rec (p :: Type) a x Source #\n Constructors\n Rec \u00a0\n Fields\n * unRec :: K1 R a x\n"}]}]}]}]}, {"source1": "libghc-barbies-prof_2.0.5.0-1_amd64.deb", "source2": "libghc-barbies-prof_2.0.5.0-1_amd64.deb", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,3 +1,3 @@\n -rw-r--r-- 0 0 0 4 2024-09-21 21:52:34.000000 debian-binary\n -rw-r--r-- 0 0 0 1964 2024-09-21 21:52:34.000000 control.tar.xz\n--rw-r--r-- 0 0 0 321580 2024-09-21 21:52:34.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 321572 2024-09-21 21:52:34.000000 data.tar.xz\n"}, {"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./control", "source2": "./control", "unified_diff": "@@ -1,15 +1,15 @@\n Package: libghc-barbies-prof\n Source: haskell-barbies\n Version: 2.0.5.0-1\n Architecture: amd64\n Maintainer: Debian Haskell Group \n Installed-Size: 3338\n Depends: libghc-barbies-dev (= 2.0.5.0-1), libghc-base-prof-4.18.2.1-8e81e, libghc-distributive-prof-0.6.2.1-d9a73, libghc-transformers-prof-0.6.1.0-5335d\n-Provides: libghc-barbies-prof-2.0.5.0-7837f\n+Provides: libghc-barbies-prof-2.0.5.0-06da0\n Section: haskell\n Priority: optional\n Homepage: https://github.com/jcpetruzza/barbies#readme\n Description: Classes for working with types that can change clothes; profiling libraries\n Types that are parametric on a functor are like Barbies that have an outfit\n for each role. This package provides the basic abstractions to work with them\n comfortably.\n"}, {"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}, {"source1": "line order", "source2": "line order", "unified_diff": "@@ -1,42 +1,42 @@\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Constraints.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.p_hi\n-usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/libHSbarbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe_p.a\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Constraints.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.p_hi\n+usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/libHSbarbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U_p.a\n usr/share/doc/libghc-barbies-prof/changelog.Debian.gz\n usr/share/doc/libghc-barbies-prof/changelog.gz\n usr/share/doc/libghc-barbies-prof/copyright\n"}]}]}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,61 +1,61 @@\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/\n--rw-r--r-- 0 root (0) root (0) 1682 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.p_hi\n--rw-r--r-- 0 root (0) root (0) 46386 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.p_hi\n--rw-r--r-- 0 root (0) root (0) 1744 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.p_hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/\n--rw-r--r-- 0 root (0) root (0) 30279 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.p_hi\n--rw-r--r-- 0 root (0) root (0) 15428 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.p_hi\n--rw-r--r-- 0 root (0) root (0) 19809 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.p_hi\n--rw-r--r-- 0 root (0) root (0) 13347 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.p_hi\n--rw-r--r-- 0 root (0) root (0) 17111 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.p_hi\n--rw-r--r-- 0 root (0) root (0) 18892 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.p_hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/\n--rw-r--r-- 0 root (0) root (0) 52485 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.p_hi\n--rw-r--r-- 0 root (0) root (0) 61533 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.p_hi\n--rw-r--r-- 0 root (0) root (0) 41322 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.p_hi\n--rw-r--r-- 0 root (0) root (0) 45708 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.p_hi\n--rw-r--r-- 0 root (0) root (0) 38882 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.p_hi\n--rw-r--r-- 0 root (0) root (0) 73881 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.p_hi\n--rw-r--r-- 0 root (0) root (0) 10063 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.p_hi\n--rw-r--r-- 0 root (0) root (0) 30139 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.p_hi\n--rw-r--r-- 0 root (0) root (0) 45789 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.p_hi\n--rw-r--r-- 0 root (0) root (0) 27997 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.p_hi\n--rw-r--r-- 0 root (0) root (0) 38165 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.p_hi\n--rw-r--r-- 0 root (0) root (0) 18886 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.p_hi\n--rw-r--r-- 0 root (0) root (0) 36407 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.p_hi\n--rw-r--r-- 0 root (0) root (0) 42747 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.p_hi\n--rw-r--r-- 0 root (0) root (0) 49685 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.p_hi\n--rw-r--r-- 0 root (0) root (0) 4691 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.p_hi\n--rw-r--r-- 0 root (0) root (0) 18028 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.p_hi\n--rw-r--r-- 0 root (0) root (0) 9282 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.p_hi\n--rw-r--r-- 0 root (0) root (0) 7189 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.p_hi\n--rw-r--r-- 0 root (0) root (0) 6601 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.p_hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/\n--rw-r--r-- 0 root (0) root (0) 1750 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.p_hi\n--rw-r--r-- 0 root (0) root (0) 2623 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Constraints.p_hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/\n--rw-r--r-- 0 root (0) root (0) 52239 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.p_hi\n--rw-r--r-- 0 root (0) root (0) 24229 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.p_hi\n--rw-r--r-- 0 root (0) root (0) 8221 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.p_hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/\n--rw-r--r-- 0 root (0) root (0) 3463 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.p_hi\n--rw-r--r-- 0 root (0) root (0) 91762 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.p_hi\n--rw-r--r-- 0 root (0) root (0) 3750 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.p_hi\n-drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/\n--rw-r--r-- 0 root (0) root (0) 12718 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.p_hi\n--rw-r--r-- 0 root (0) root (0) 2345304 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/libHSbarbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe_p.a\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/\n+-rw-r--r-- 0 root (0) root (0) 1684 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.p_hi\n+-rw-r--r-- 0 root (0) root (0) 46392 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.p_hi\n+-rw-r--r-- 0 root (0) root (0) 1745 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.p_hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/\n+-rw-r--r-- 0 root (0) root (0) 30279 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.p_hi\n+-rw-r--r-- 0 root (0) root (0) 15426 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.p_hi\n+-rw-r--r-- 0 root (0) root (0) 19816 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.p_hi\n+-rw-r--r-- 0 root (0) root (0) 13352 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.p_hi\n+-rw-r--r-- 0 root (0) root (0) 17108 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.p_hi\n+-rw-r--r-- 0 root (0) root (0) 18896 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.p_hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/\n+-rw-r--r-- 0 root (0) root (0) 52491 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.p_hi\n+-rw-r--r-- 0 root (0) root (0) 61542 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.p_hi\n+-rw-r--r-- 0 root (0) root (0) 41321 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.p_hi\n+-rw-r--r-- 0 root (0) root (0) 45724 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.p_hi\n+-rw-r--r-- 0 root (0) root (0) 38900 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.p_hi\n+-rw-r--r-- 0 root (0) root (0) 73863 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.p_hi\n+-rw-r--r-- 0 root (0) root (0) 10061 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.p_hi\n+-rw-r--r-- 0 root (0) root (0) 30139 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.p_hi\n+-rw-r--r-- 0 root (0) root (0) 45790 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.p_hi\n+-rw-r--r-- 0 root (0) root (0) 28011 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.p_hi\n+-rw-r--r-- 0 root (0) root (0) 38174 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.p_hi\n+-rw-r--r-- 0 root (0) root (0) 18883 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.p_hi\n+-rw-r--r-- 0 root (0) root (0) 36416 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.p_hi\n+-rw-r--r-- 0 root (0) root (0) 42753 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.p_hi\n+-rw-r--r-- 0 root (0) root (0) 49693 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.p_hi\n+-rw-r--r-- 0 root (0) root (0) 4697 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.p_hi\n+-rw-r--r-- 0 root (0) root (0) 18028 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.p_hi\n+-rw-r--r-- 0 root (0) root (0) 9290 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.p_hi\n+-rw-r--r-- 0 root (0) root (0) 7219 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.p_hi\n+-rw-r--r-- 0 root (0) root (0) 6598 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.p_hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/\n+-rw-r--r-- 0 root (0) root (0) 1750 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.p_hi\n+-rw-r--r-- 0 root (0) root (0) 2630 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Constraints.p_hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/\n+-rw-r--r-- 0 root (0) root (0) 52225 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.p_hi\n+-rw-r--r-- 0 root (0) root (0) 24235 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.p_hi\n+-rw-r--r-- 0 root (0) root (0) 8223 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.p_hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/\n+-rw-r--r-- 0 root (0) root (0) 3463 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.p_hi\n+-rw-r--r-- 0 root (0) root (0) 91765 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.p_hi\n+-rw-r--r-- 0 root (0) root (0) 3753 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.p_hi\n+drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/\n+-rw-r--r-- 0 root (0) root (0) 12718 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.p_hi\n+-rw-r--r-- 0 root (0) root (0) 2345304 2024-09-21 21:52:34.000000 ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/libHSbarbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U_p.a\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/share/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/share/doc/\n drwxr-xr-x 0 root (0) root (0) 0 2024-09-21 21:52:34.000000 ./usr/share/doc/libghc-barbies-prof/\n -rw-r--r-- 0 root (0) root (0) 381 2024-09-21 21:52:34.000000 ./usr/share/doc/libghc-barbies-prof/changelog.Debian.gz\n -rw-r--r-- 0 root (0) root (0) 2015 2023-10-21 11:51:17.000000 ./usr/share/doc/libghc-barbies-prof/changelog.gz\n -rw-r--r-- 0 root (0) root (0) 1967 2024-09-21 21:52:34.000000 ./usr/share/doc/libghc-barbies-prof/copyright\n"}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bare.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bare.p_hi", "comments": ["Files 82% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Bare 9066\n- interface hash: 10eb09c90eb61b258a5588046c3df7c7\n- ABI hash: 3092576b5610ad7f7c79df37331fc9da\n- export-list hash: 721cfc3fe3da0e009b49303645fe431b\n+ interface hash: 1f0bd119c214cb4b77d5d4b49ae23ad1\n+ ABI hash: d308329d336770b68c7a204def4f52ba\n+ export-list hash: 3e0e03a30fb89f6dafec8315b72e72e0\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 7c5d95ad0ce22d00d6e54b77dd65cdf6\n sig of: Nothing\n@@ -21,61 +21,61 @@\n Barbies.Internal.BareB.bcoverWith\n Barbies.Internal.BareB.bstripFrom\n Barbies.Internal.BareB.BareB{Barbies.Internal.BareB.bcover Barbies.Internal.BareB.bstrip}\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n Barbies.Internal.Wear.WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.BareB Barbies.Internal.FunctorB GHC.Base\n GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 7033f6c2e9cc418f2345679854cf259e\n- exports: 057ad1cac855b28dfd0964ea6392b49c\n- BareB e892f1bf62bb0f1de4c6900a9e397063\n- bcover ee3e8172705eeb19cb26b0a386210685\n- bcoverWith 457d04fa95b40feadc0d03c1a6be16bc\n- bstrip 4abad9192e0bad22fcce259ce56985ff\n- bstripFrom e4a248fbf92dcb57cc8e7de7b59fafbe\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n- WearTwo d06bb9da09839e1cb4a0a098d403587b\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB c3913e480fb368dab5a321a730bc1175\n+ exports: 1dfc9c56dc6f274967e32628736d7d2f\n+ BareB f15e63f5136f8d2c169b41a4366e7229\n+ bcover 3c05da0a69ac4c253e8361c5f1bbb4eb\n+ bcoverWith 82d8091afcde3f046554d1a3aa013ac7\n+ bstrip d878bc27230338f5bfca2b82fdefc2cc\n+ bstripFrom 834713909fe7cf3a343b98d754fc398d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n+ WearTwo d957b83cc662451223c70d0fed19a0ad\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-2f52703c5b140ac7c7ec2e82a2887c62\n+4440dc3a99dd3a84f5c99d2d5f39123f\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-400bdbce2e1cdaf1c2b2d330625a3940\n+19ef4d2a2c8a4be887dc2c4049bd09bf\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d1e61337c18380f950923843cee1239c\n+14ef2080bf78a831f1d77a8999d4bf85\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Bare\"#]\n-1f06eba38f30e49937023092c8f65bf6\n+d4a7aa5b39994a75edcd60ae67a9a410\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-6e5b963ca06d1ec9f36bcf71b6dbb835\n+ea9b6594da57ea6a95f9ba0592783949\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Bi.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Bi.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Bi 9066\n- interface hash: 37190a355cd2123f5ff0ef82f837e781\n- ABI hash: 339af8ed4a38d13013d3d70b478e9974\n- export-list hash: bb915f9caec98f0ae0a35fe20ca8d48b\n+ interface hash: 50fc4044ebac2e7f523b29ca47184170\n+ ABI hash: 3f8d2466e4841ed8aebbd9a394ea662a\n+ export-list hash: 00ad898e1dde8bc31b80c34429001348\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 8a65f4dafcc458b4531b22c014e823c4\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 230f04ad0eff370d4fb01f412f4dab2e\n sig of: Nothing\n@@ -24,18 +24,18 @@\n btprod\n btpure\n btpure1\n bttraverse\n bttraverse1\n bttraverse_\n Flip{Flip runFlip}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.ConstraintsB\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveB\n Barbies.Internal.DistributiveT Barbies.Internal.FunctorB\n@@ -54,52 +54,52 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- ApplicativeB e831de0bd01221227318ff01f360d4cb\n- bprod faa80cda7d5ebacb4d59ff2581e950e5\n- bpure 8f62c3bd94a72cb3e7cb88067b7fc1f0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT 37b9828a73911edc65682677beef0b01\n- ApplicativeT ac75f9c1033a1a0fa3ed421b0aa1a6ff\n- tprod 836c430f592da5bade76b63a1cf2dc58\n- tpure d70eae245e3327d8eee46b48631b6e4c\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 80d56ad2686884e1a31fedb7de368c13\n- DistributiveB abc18a05f635f61b778ca554da2cea91\n- bdistribute 929c6e7742bbab510e6a6048e74a3699\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT ec0109aac7f95a0f49e357c4692172b6\n- DistributiveT bf60a4b70526597f9806abfbda792bc4\n- tdistribute e3628f1c954601a3a1e88b8b2e9621cf\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- FunctorT 8eecefeea9b4af10c28c6418beb8e35f\n- tmap 7daf6eec37127197117907af82691fc2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- TraversableB 276504176defd37fdae4e05d479e9cc6\n- btraverse 44638623568081a176cfc6fcc0804dca\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 6d9f71dcdc22d5d3261927c7c3f0afd5\n- TraversableT e7c67190d7e0b7e757119c341317ca7c\n- ttraverse 52a07542ffc301896e358aebbb2830d3\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial e8e840d58a71f36f08cf907351677909\n- exports: f2b3ffa6928a822bd57073425bf0c21d\n- Unit 7dad192333f9ffba2f7db338141645a6\n- Unit c1936e142e7230f25a3d66e4ed000254\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 78d58e8d27c1b5f724f59e41fe333ec9\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr 921a5c36501ebb74282d24aea2b9b5ce\n- tell f41472543dcc450dda0d5b8970f323cd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 9dafd74b326111f9ee0b678e4b56d097\n- exports: 776dd022e7184a3e3960ac8208304d11\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer b6c50927a72e994c449237c5015937c7\n- exports: 856a31e58112ee4a1740bc4f8a0a5850\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ ApplicativeB 16deedde4d173b65d0723755e5a93713\n+ bprod 8e131e15a5f98601851c0b27ac4241c0\n+ bpure e8e39b317ff94f27399a39d7e16b86a9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT a4b6dde0959b1b6fc0980131174b93d9\n+ ApplicativeT 8c4c465730cad783db66cced9f6ad1cd\n+ tprod f7a3c13f2f2048c22a31a51a529488c9\n+ tpure 18e1079f018128459a0a8b55ce7b774e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 86907d3a2f9542c8a7e9eb0c9e39c2e1\n+ DistributiveB e760f6db15922c1a6bf57e10ddec6cce\n+ bdistribute f52af13b3c0cdea06e2fe6da23fac44c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT e2516ba32392922786c305c30d832725\n+ DistributiveT 3287b4f0ba90375696b0ae382def28bc\n+ tdistribute 50e04509af645581a3b094a3f3168944\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ FunctorT ae5ec0f7570f82aca6f5f14b2f49b24c\n+ tmap d0b4955d5dbd43342b986bfbb6d3da5d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ TraversableB b16eda90a135f995e76c64fdf076422a\n+ btraverse 2d1803bee429e065a9d4f13a0e12ab46\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 70a0f6bb8ee700f78b9077b3af018bc8\n+ TraversableT 0d4893fb3ceb3c7a5413bd1c7de7657c\n+ ttraverse 0b7ab5f0b9eafcdfa92c0611d78a7459\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial dc4e1c7b489ece1d00e77086237aaa82\n+ exports: d538e05bfbbc0ea212ae5ceedcab88a8\n+ Unit a88e573f0bca8af4d81862878a7ee1dc\n+ Unit a654d0e651ca97ead2ab39e18faca7f6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer efe86a57d978c86b92ee78dca96ae213\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 0ba0f5f1de1b3cb4ff96e635320656e1\n+ tell e2ec237cb577cbd4bb2ed4024c55188f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie cb89b258eede167b2d361dbcd693e5c2\n+ exports: 2d9e067c321d67b0eec7598e2173b9ef\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer eda82e6579172c14a44bb087490ee99a\n+ exports: 385f1ce47f803f58a1667bba336930e6\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Control.Monad a8552ca25f5dcd7ee6fb611cbb0ec055\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Monoid 672247a2f00dd02f4a07408e39ac3b93\n import -/ Data.Semigroup.Internal b9587b96cd753f58ca99258378fd0556\n@@ -107,17 +107,17 @@\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.ParserCombinators.ReadPrec a657147dbd7291808782bfe31b23cd99\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-972e431d7bf04f20feed288a7a9495ba\n+cdc005da0024d5106da6ccb466cb37be\n $fApplicativeBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n Barbies.Internal.ApplicativeB.ApplicativeB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -147,15 +147,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fApplicativeBkFlip_$cbpure @k @k1 @b @f v)\n ($fApplicativeBkFlip_$cbprod @k @k1 @b @f v)]\n-9b397177d9d263902dee8f22ca33e795\n+16a60fb28e9c11876b67ee39e7ce03fc\n $fApplicativeBkFlip_$cbprod ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *)\n (g :: k1 -> *).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n Flip b f f1\n -> Flip b f g -> Flip b f (Data.Functor.Product.Product f1 g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -192,15 +192,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-a390173eb625873cdb8792c34b7a1bcb\n+ef94d0757e1d6c755137fef03e7c98ee\n $fApplicativeBkFlip_$cbpure ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *).\n Barbies.Internal.ApplicativeT.ApplicativeT b =>\n (forall (a :: k1). f1 a) -> Flip b f f1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -228,15 +228,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-12d530f0dece01fe53c30dff9bf50e23\n+83c7e5b3fb48a3bbd85d7f62d82d9357\n $fApplicativeTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n Barbies.Internal.ApplicativeT.ApplicativeT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -268,15 +268,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTkk'Flip_$ctpure @k' @k @b v)\n ($fApplicativeTkk'Flip_$ctprod @k' @k @b v)]\n-dd69ab395a61f394a2a417eb7a49856a\n+bbccd8a438f7922c8b3922c4d437463e\n $fApplicativeTkk'Flip_$ctprod ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (x :: k')\n (g :: k -> *).\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n Flip b f x\n -> Flip b g x -> Flip b (Data.Functor.Product.Product f g) x\n@@ -312,15 +312,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-b0b7ac48b953697fc732e6679af60ae1\n+a98e18919c15f0b78ea34f6bc7312ea7\n $fApplicativeTkk'Flip_$ctpure ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (x :: k').\n (forall (f :: k').\n Barbies.Internal.ApplicativeB.ApplicativeB (b f)) =>\n (forall (a :: k). f a) -> Flip b f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A)>, Inline: (sat-args=1),\n@@ -342,15 +342,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-5354f8199dc6bffe93254d05ea7fe5f4\n+43ec99bf91ee10c335c03c379d755dca\n $fDistributiveBTYPEFlip ::\n forall k (b :: (* -> *) -> k -> *) (f :: k).\n Barbies.Internal.DistributiveT.DistributiveT b =>\n Barbies.Internal.DistributiveB.DistributiveB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -378,29 +378,29 @@\n (forall (f1 :: <* -> *>_N) (g :: <* -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n <* -> *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] <*>_N _N))\n ($fDistributiveBTYPEFlip_$cbdistribute @k @b @f v)]\n-05a6b5c60c7acb42c290422af29a5167\n+b160e4a3b0b1b28eb9f8c2c955ee789c\n $fDistributiveBTYPEFlip1 ::\n forall {k1} {k2} {b :: k1 -> k2 -> *} {l :: k2} {r :: k1}.\n Flip b l r -> Flip b l r\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @k1\n @b :: k -> k1 -> *\n @l :: k1\n @r :: k\n (ds2['GHC.Types.Many] :: Flip b l r) ->\n {__scc {Barbies.Bi.runFlip} True False} ds2]\n-3a6f9fdb91bb0719f4f4cce121fe2a75\n+6d0398e71dd406dff5a9f528dfc6ca61\n $fDistributiveBTYPEFlip_$cbdistribute ::\n forall k (b :: (* -> *) -> k -> *) (f :: k) (f1 :: * -> *)\n (g :: * -> *).\n (Barbies.Internal.DistributiveT.DistributiveT b,\n GHC.Base.Functor f1) =>\n f1 (Flip b f g) -> Flip b f (Data.Functor.Compose.Compose f1 g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -443,15 +443,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n <* -> *>_N\n _N\n _R\n _N\n _N))]\n-143d51afc5fb68f1e1fbb488bdee37d4\n+6abfc2bb50c6d084a3b5a61065b203f2\n $fDistributiveTiFlip ::\n forall i (b :: i -> (* -> *) -> *).\n (forall (f :: i).\n Barbies.Internal.DistributiveB.DistributiveB (b f)) =>\n Barbies.Internal.DistributiveT.DistributiveT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -483,15 +483,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N <* -> *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N _N _N))\n ($fDistributiveTiFlip_$ctdistribute @i @b v)]\n-258ae77d5f1323b4f0c4572983ae92aa\n+c452c6fd231e38b9ba2e177781240f82\n $fDistributiveTiFlip_$ctdistribute ::\n forall i (b :: i -> (* -> *) -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (forall (f :: i).\n Barbies.Internal.DistributiveB.DistributiveB (b f),\n GHC.Base.Functor f) =>\n f (Flip b g x) -> Flip b (Data.Functor.Compose.Compose f g) x\n@@ -534,15 +534,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n <* -> *>_N\n _R\n _N\n _N))]\n-59cce81834e98b8e4cf1c32142bbc586\n+78fe1eccf91f09102f764c0add8bd36b\n $fEqFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Eq (b r l) =>\n GHC.Classes.Eq (Flip b l r)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -561,15 +561,15 @@\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b r l) v)\n `cast`\n (Sym (N:Flip[0] _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-0124f75dd385239d3197bee3d36850de\n+35cd20c1da0b77de94c996cc2827ead1\n $fFunctorBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.FunctorT.FunctorT b =>\n Barbies.Internal.FunctorB.FunctorB (Flip b f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=0),\n@@ -577,15 +577,15 @@\n $fFunctorBkFlip_$cbmap\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (b :: <(k -> *)\n -> k1 -> *>_N) (f :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))]\n-39b67e948ad442bab15b43dfd7bbc33a\n+ccd98a8218acb503c4cc52d42fe36228\n $fFunctorBkFlip_$cbmap ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (f1 :: k1 -> *)\n (g :: k1 -> *).\n Barbies.Internal.FunctorT.FunctorT b =>\n (forall (a :: k1). f1 a -> g a) -> Flip b f f1 -> Flip b f g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=2),\n@@ -618,30 +618,30 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N\n _N\n _R\n _N\n _N))]\n-358c3b4cc1cced6bd0792442767c91b1\n+cd4479ca0525a3ec555e60634ae92b72\n $fFunctorTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k'). Barbies.Internal.FunctorB.FunctorB (b f)) =>\n Barbies.Internal.FunctorT.FunctorT (Flip b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseTrue>\n $fFunctorTkk'Flip_$ctmap\n `cast`\n (forall (k' :: <*>_N) (k :: <*>_N) (b :: (k -> *) -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))]\n-095af4a20b2160e3a96ca6ff67f603d4\n+e4a70d8f16f889029a4a16495e220749\n $fFunctorTkk'Flip_$ctmap ::\n forall k' k (b :: k' -> (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (forall (f :: k'). Barbies.Internal.FunctorB.FunctorB (b f)) =>\n (forall (a :: k). f a -> g a) -> Flip b f x -> Flip b g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=2),\n@@ -672,15 +672,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N\n *>_N\n _R\n _N\n _N))]\n-39c38c4d57b3e9274c5ee72880a4267b\n+5a6cb2596840dc927d2f9612d70aef40\n $fOrdFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Ord (b r l) =>\n GHC.Classes.Ord (Flip b l r)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -733,30 +733,30 @@\n (GHC.Classes.min @(b r l) v)\n `cast`\n (Sym (N:Flip[0] _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N _N _R _N _N))]\n-8886d1c0d857db02e4cd5fc112531078\n+a238d6682b8b8d469fc6b3414a871e06\n $fOrdFlip_$cp1Ord ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Classes.Ord (b r l) =>\n GHC.Classes.Eq (Flip b l r)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k\n @k1\n @b :: k1 -> k -> *\n @l :: k\n @r :: k1\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord (b r l)) ->\n $fEqFlip @k @k1 @b @l @r (GHC.Classes.$p1Ord @(b r l) $dOrd)]\n-8d8f46a624ab633b63691940b795036b\n+8ed27e2d3cfaec47c6e172566ffab0cb\n $fReadFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n GHC.Read.Read (Flip b l r)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n@@ -773,25 +773,25 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadFlip_$creadListPrec @k @k1 @b @l @r v)]\n-3662f7c68b13a34c5d49a5cc61416dd2\n+919ae64c8d258b1929febadac0c4247c\n $fReadFlip1 ::\n forall {k1} {k2} {b :: k2 -> k1 -> *} {l :: k1} {r :: k2}.\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (Flip b l r -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-da4261834beede7502d94858d71beda0\n+40c8efd70b93d601796a38da66d5091e\n $fReadFlip_$creadList ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadP.ReadS [Flip b l r]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -816,15 +816,15 @@\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Flip b l r]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Flip b l r]>_R)\n @[Flip b l r]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[Flip b l r]))]\n-3d6fdb9a12ab537fd7578c81ae64f144\n+23932f5002abd06d06b65dcf7e201e1e\n $fReadFlip_$creadListPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [Flip b l r]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -839,15 +839,15 @@\n ($fReadFlip1 @k @k1 @b @l @r $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-58ee8f214013607bd441df4243cfce2f\n+5c5d32bdf7edb3a476f23829bc57543a\n $fReadFlip_$creadsPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Read.Read (b r l) =>\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Flip b l r)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -867,15 +867,15 @@\n @l\n @r\n $dRead\n eta\n @(Flip b l r)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Flip b l r)))]\n-bec7f3719bf0e040c7da63bf5f4d58ab\n+eb05c083dfc46ba30075807ce20c4391\n $fShowFlip ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n GHC.Show.Show (Flip b l r)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n@@ -885,32 +885,32 @@\n @l :: k\n @r :: k1\n (v['GHC.Types.Many] :: GHC.Show.Show (b r l)).\n @(Flip b l r)\n ($fShowFlip_$cshowsPrec @k @k1 @b @l @r v)\n ($fShowFlip_$cshow @k @k1 @b @l @r v)\n ($fShowFlip_$cshowList @k @k1 @b @l @r v)]\n-d181d1a610be85ba52e10e617386e3c2\n+aa6732ec5c544da0aabd0de2a3f96f4c\n $fShowFlip1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"}\"#]\n-c4dbb9dbd7e56b3fd0240cccc794202a\n+b301dbf2249114aae578ff5c802d7234\n $fShowFlip2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Flip {runFlip = \"#]\n-7139e4da256a5ee153be66976bbddf0a\n+2e0f2ed4c46bfb4b21e11d02cb6e9fd6\n $fShowFlip3 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-d3a02b0d3fa324f6ae28f467d5f70d58\n+4ade2b920c468740ac8a14d5b3192d40\n $fShowFlip4 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShowFlip1]\n-9701f7f1e478de641bbd04e209bc33cd\n+6f1f40c0d13d2d3f9fe03fbe511f2c9e\n $fShowFlip_$cshow ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n Flip b l r -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -925,15 +925,15 @@\n $fShowFlip2\n (GHC.Show.showsPrec\n @(b r l)\n $dShow\n $fShowFlip3\n x `cast` (N:Flip[0] _N _N _R _N _N)\n $fShowFlip4)]\n-710b8674958d36785e47cb6c875ef010\n+764786bd66fe145e036485ed151c4396\n $fShowFlip_$cshowList ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n [Flip b l r] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -947,15 +947,15 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Flip b l r)\n (\\ (ds2['GHC.Types.Many] :: Flip b l r) ->\n $w$cshowsPrec @k @k1 @b @l @r $dShow 0# ds2)\n ls\n s]\n-8b28de9af3e06b5391adab7c63c58a13\n+6666b1644f876a04a62ddf9cf7e810c3\n $fShowFlip_$cshowsPrec ::\n forall k1 k2 (b :: k2 -> k1 -> *) (l :: k1) (r :: k2).\n GHC.Show.Show (b r l) =>\n GHC.Types.Int -> Flip b l r -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n@@ -965,15 +965,15 @@\n @l :: k\n @r :: k1\n ($dShow['GHC.Types.Many] :: GHC.Show.Show (b r l))\n (a['GHC.Types.Many] :: GHC.Types.Int)\n (ds2['GHC.Types.Many] :: Flip b l r) ->\n case a of wild { GHC.Types.I# ww ->\n $w$cshowsPrec @k @k1 @b @l @r $dShow ww ds2 }]\n-4a17f7cf3111069cbf6f19069fdaab3e\n+1c2dde538c9bb5285cb0ca6aea17f405\n $fTraversableBkFlip ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2).\n Barbies.Internal.TraversableT.TraversableT b =>\n Barbies.Internal.TraversableB.TraversableB (Flip b f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -1002,15 +1002,15 @@\n (forall (f1 :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n *>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkFlip_$cbtraverse @k @k1 @b @f v)]\n-eec64f42738fccea5267ede032f07789\n+42a4fae07577b6b5429f4515f5ee85a7\n $fTraversableBkFlip_$cbtraverse ::\n forall k1 k2 (b :: (k1 -> *) -> k2 -> *) (f :: k2) (e :: * -> *)\n (f1 :: k1 -> *) (g :: k1 -> *).\n (Barbies.Internal.TraversableT.TraversableT b,\n GHC.Base.Applicative e) =>\n (forall (a :: k1). f1 a -> e (g a))\n -> Flip b f f1 -> e (Flip b f g)\n@@ -1048,15 +1048,15 @@\n @e\n @f1\n @g\n @f\n $dApplicative\n eta\n eta1 `cast` (N:Flip[0] *>_N _N _R _N _N))]\n-7d89ace40784274a90c4ac6d260d47a6\n+13a7395232e99756cbade9245cf5b17a\n $fTraversableTkk'Flip ::\n forall k' k (b :: k' -> (k -> *) -> *).\n (forall (f :: k').\n Barbies.Internal.TraversableB.TraversableB (b f)) =>\n Barbies.Internal.TraversableT.TraversableT (Flip b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -1087,15 +1087,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Flip[0]\n _N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTkk'Flip_$cttraverse @k' @k @b v)]\n-eaddee0e81f468440f018c42554bda57\n+689c008f5601439e095bfe15ae808e4d\n $fTraversableTkk'Flip_$cttraverse ::\n forall k' k (b :: k' -> (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (forall (f :: k').\n Barbies.Internal.TraversableB.TraversableB (b f),\n GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e (g a)) -> Flip b f x -> e (Flip b g x)\n@@ -1131,89 +1131,89 @@\n (df @x)\n @e\n @f\n @g\n $dApplicative\n eta\n eta1 `cast` (N:Flip[0] _N *>_N _R _N _N))]\n-3a5890873c5b8ec56ba5947e769f5a8e\n+e5ae62cc08285eca3255d96f1b83bdda\n $tc'Flip :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2198245352559246084#Word64\n- 4307912401912817915#Word64\n+ 10936034090562563506#Word64\n+ 3726073953954584908#Word64\n $trModule\n $tc'Flip2\n 5#\n $tc'Flip1]\n-51da3ba6efb25c86fd328e82827f4e87\n+56923ea65452ac1fc94b896643483e92\n $tc'Flip1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-7590ef136c2c6a3dce4b26dfc53fc922\n+d7055a74bc1f5a58c170cb2cd862ebed\n $tc'Flip2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Flip3]\n-64af20d224c1289ac47068e67d863351\n+952c2a29a888b767470bbb0ddcec6366\n $tc'Flip3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Flip\"#]\n-3799348e6fe6ce3f2bc4aed54511f168\n+8ace0e3cf101d5425f0c9647dcbe3006\n $tcFlip :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 10716913605063753350#Word64\n- 3747298549638892042#Word64\n+ 8828279943065681420#Word64\n+ 2583892798175144461#Word64\n $trModule\n $tcFlip2\n 2#\n $tcFlip1]\n-cf50d45f49552f991f5418c4a2913161\n+192efd8ffc54423720c0497d54773baa\n $tcFlip1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a0027ad4b819c4b525c0601468087a39\n+b431a4538d8f917661866ef3795bd64e\n $tcFlip2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFlip3]\n-4b90f2e2488196625f3a6274664fe9fa\n+314b01110438c95f347043a2dac9e4eb\n $tcFlip3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Flip\"#]\n-a75c93f58dbad70b1630779853204eb2\n+279b5b3cde52445568992a0d33c4330d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-005d8881415f9184e2d60fbbf08101ac\n+98254c7a85bfaa65899f39c7265bd9d8\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-a92a825df14480056990e70cfe363c7e\n+30f4629d8544520c5dfecc2e6abed33a\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Bi\"#]\n-14178d5f4fcba167f915bd305feea89d\n+7612ce56b2a62852d084559b5d16eb70\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fe4e8ed3b6681b2f3b02bb3cab8aa084\n+6c4d741393062b4e1d33cc60e23a37a0\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-946c2573739fb4d3d0847cb4f66f8043\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+e9074e1f08f8dc0e67c359e5e73d23ee\n $w$cshowsPrec ::\n forall {k1} {k2} {b :: k2 -> k1 -> *} {l :: k1} {r :: k2}.\n GHC.Show.Show (b r l) =>\n GHC.Prim.Int# -> Flip b l r -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -1245,19 +1245,19 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowFlip2\n (f (GHC.CString.unpackAppendCString#\n $fShowFlip1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-976acd20df94e35ea6836655dc0e8462\n+aaa59f3f08d6ea3be0b48aea1d9fc908\n type role Flip representational nominal nominal\n type Flip :: forall {k} {k1}. (k -> k1 -> *) -> k1 -> k -> *\n newtype Flip b l r = Flip {runFlip :: b r l}\n-4d89d78a3af0dffd5ff98fc3cbda3e09\n+8eb3f32fd82e61ce0d68546934004233\n btfoldMap ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n m (g :: k2 -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monoid m) =>\n (forall (a :: k1). f a -> m)\n -> (forall (a :: k2). g a -> m) -> b f g -> m\n@@ -1341,15 +1341,15 @@\n s\n w1))\n `cast`\n (Sym (Barbies.Internal.Writer.N:St[0]\n _R <()>_R)))\n } in\n \\ (x['GHC.Types.Many] :: b f g) -> f1 (g1 x)]\n-4b407b996daeaf30d0dd64f73e61d320\n+9a06e04464318737a9bf04e355e4db65\n btmap ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (f' :: k1 -> *) (g :: k2 -> *) (g' :: k2 -> *).\n (Barbies.Internal.FunctorB.FunctorB (b f),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k1). f a -> f' a)\n -> (forall (a :: k2). g a -> g' a) -> b f g -> b f' g'\n@@ -1386,15 +1386,15 @@\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @g\n @g'\n hg\n } in\n \\ (x['GHC.Types.Many] :: b f g) -> f1 (g1 x)]\n-76fead2fae4f7b11dc3883aa7479424f\n+69eb59328bfa28ca40f9caa5ec6a534c\n btmap1 ::\n forall {k} (b :: (k -> *) -> (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (Barbies.Internal.FunctorB.FunctorB (b f),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k). f a -> g a) -> b f f -> b g g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1425,15 +1425,15 @@\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n h\n } in\n \\ (x['GHC.Types.Many] :: b f f) -> f1 (g1 x)]\n-8e151b209f8c4d24693fa67c7756fc1a\n+d54e4157a573f40b1016582a6db04b44\n btprod ::\n forall {k} (b :: (* -> *) -> (k -> *) -> *) (f :: * -> *)\n (f' :: * -> *) (g :: k -> *) (g' :: k -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b (Data.Semigroup.Internal.Alt\n (Data.Functor.Product.Product f f'))),\n Barbies.Internal.FunctorT.FunctorT b, GHC.Base.Alternative f,\n@@ -1523,15 +1523,15 @@\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Alt[0]\n <*>_N\n _R) _N)\n r))]\n-c78cfd201a544dee1fe9b66d7bece086\n+2e7358a7b3ffb03be6e4e5f7cc6f9abb\n btpure ::\n forall {k1} {k2} (b :: ((k1 -> *) -> *) -> (k2 -> *) -> *)\n (f :: (k1 -> *) -> *) (g :: k2 -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b Barbies.Internal.Trivial.Unit),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k1 -> *). f a) -> (forall (a :: k2). g a) -> b f g\n@@ -1562,15 +1562,15 @@\n case ds2 of wild { Barbies.Internal.Trivial.Unit -> fa @a })\n (Barbies.Internal.ApplicativeB.bpure\n @k1\n @(b Barbies.Internal.Trivial.Unit)\n $dApplicativeB\n @g\n ga)]\n-b63a6b318e71e55473d656694724442f\n+2cb37e36541b8efea4dc699a5589f6a3\n btpure1 ::\n forall {k} (b :: ((k -> *) -> *) -> ((k -> *) -> *) -> *)\n (f :: (k -> *) -> *).\n (Barbies.Internal.ApplicativeB.ApplicativeB\n (b Barbies.Internal.Trivial.Unit),\n Barbies.Internal.FunctorT.FunctorT b) =>\n (forall (a :: k -> *). f a) -> b f f\n@@ -1598,15 +1598,15 @@\n case ds2 of wild { Barbies.Internal.Trivial.Unit -> h @a })\n (Barbies.Internal.ApplicativeB.bpure\n @(k -> *)\n @(b Barbies.Internal.Trivial.Unit)\n $dApplicativeB\n @f\n h)]\n-4b273fe86019dc2f8d567eb5d4f326ca\n+3f80e4ba552e8d95c47b112e9e3d8ac1\n bttraverse ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (t :: * -> *) (f' :: k1 -> *) (g :: k2 -> *) (g' :: k2 -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad t) =>\n (forall (a :: k1). f a -> t (f' a))\n -> (forall (a :: k2). g a -> t (g' a)) -> b f g -> t (b f' g')\n@@ -1657,15 +1657,15 @@\n @f'\n @g'\n $dApplicative\n eta\n } in\n \\ (x['GHC.Types.Many] :: b f g) ->\n GHC.Base.>>= @t $dMonad @(b f g') @(b f' g') (f1 x) g1]\n-0358e15971363044a2e776950b7c4dc4\n+de3258355b4c538abee1273a87c48252\n bttraverse1 ::\n forall {k} (b :: (k -> *) -> (k -> *) -> *) (f :: k -> *)\n (t :: * -> *) (g :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad t) =>\n (forall (a :: k). f a -> t (g a)) -> b f f -> t (b g g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1711,15 +1711,15 @@\n @g\n @g\n $dApplicative\n h\n } in\n \\ (x['GHC.Types.Many] :: b f f) ->\n GHC.Base.>>= @t $dMonad @(b f g) @(b g g) (f1 x) g1]\n-474418008c9e13b61045d1451faaa8ab\n+03a03ccc120fd2d084a40eb4e911c89e\n bttraverse_ ::\n forall {k1} {k2} (b :: (k1 -> *) -> (k2 -> *) -> *) (f :: k1 -> *)\n (e :: * -> *) c (g :: k2 -> *) d.\n (Barbies.Internal.TraversableB.TraversableB (b f),\n Barbies.Internal.TraversableT.TraversableT b, GHC.Base.Monad e) =>\n (forall (a :: k1). f a -> e c)\n -> (forall (a :: k2). g a -> e d) -> b f g -> e ()\n@@ -1830,21 +1830,21 @@\n @e\n $dMonad\n @(b f (Data.Functor.Const.Const ()))\n @(b (Data.Functor.Const.Const ())\n (Data.Functor.Const.Const ()))\n (f1 x)\n g1)]\n-f9729e767397f4f1ea256eef7f803a75\n+c2423c8c774ae93b3bd362a323b75e21\n bttraverse_1 :: a -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (ds2['GHC.Types.Many] :: a) -> GHC.Tuple.Prim.()]\n-aa6ea7ed8240516e12411c849c1f3dcd\n+f2a9e90f3dda500a33431479b301171a\n runFlip ::\n forall {k1} {k2} (b :: k1 -> k2 -> *) (l :: k2) (r :: k1).\n Flip b l r -> b r l\n RecSel Left Flip\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Constraints.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Constraints.p_hi", "comments": ["Files 86% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Constraints 9066\n- interface hash: ad2cfe58b31c392524660b46e3749444\n- ABI hash: 9e10a8c79d6788110fcbb4c69c4dd91b\n- export-list hash: 761634c9c5afedfbcb06b81158ce398d\n+ interface hash: 2af465a848ca4f606c6306d5c16cfb93\n+ ABI hash: f49356e7e2314b8209b85ae9db477616\n+ export-list hash: 7c36d23e3a51d5c38be6e0aaddec9d7a\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 64cae00ab386ed23967954c49dbf3451\n sig of: Nothing\n@@ -20,64 +20,64 @@\n exports:\n Barbies.Internal.Dicts.requiringDict\n Barbies.Internal.ConstraintsB.&\n Barbies.Internal.ConstraintsB.AllBF\n Barbies.Internal.Dicts.ClassF\n Barbies.Internal.Dicts.ClassFG\n Barbies.Internal.Dicts.Dict{Barbies.Internal.Dicts.Dict}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Barbies.Internal.ConstraintsB Data.Generics.GenericN\n Control.Applicative Control.Arrow Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup.Internal Data.Type.Ord\n Data.Version GHC.Generics GHC.IO.Exception GHC.RTS.Flags\n Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB c915225ce12dec07b484cb0e6c8bc95f\n- exports: 62d29be84a756dd8aa3183dad2a1d146\n- & b4981f1f879e533cf698bb596a0c96e2\n- AllBF 2852bbf285ab6932b0e4764b71b81856\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts 11d9cab4807894b2baa78a0cba8e7494\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- ClassFG 49f1c53a16ecf58347d2954cac6dea25\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict 1ef5ac9bdc38d1886b55376c71cb27fa\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB cb077425686d4bb620c4f51549182b9f\n+ exports: 805180e0c2ac5e4eb5bae7572cee9a36\n+ & 262e3f2037fcd8d28cf63dfb107609ac\n+ AllBF 63bb86e4a6c471b3a0fb28f25103dd36\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 0c882df337c0ddb4b93d319e9df15dee\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ ClassFG 956656054dd5ddd580072614ba216cb3\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 501619b73143cb187d749df6455ffe8e\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-d5e08f9aa425846984beb0e1df4d9890\n+2b3dd5bb37b38ac231e2bf44a76aa75d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d50ccbd0186b57590c1aa18e8680b704\n+cacdc72938810ca679c001b92b36e407\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4f034483c16c58358071819557a3cc2f\n+deae2605fdc4049dacc70bd47d29c7db\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Constraints\"#]\n-5a41b37fc1195c3153a0d231825f6dab\n+2a3f629c6a21e6b227f56cf02628930f\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-817972c0dabe048c41741d392be9ae10\n+b5f419eb10b28cb640d24524eda67cc5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Applicative.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Applicative.p_hi", "comments": ["Files 97% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Generics.Applicative 9066\n- interface hash: c92832960e8478aa5720b5414b6bb9d0\n- ABI hash: f7fe06bbc86fe9884b13a256898eadd7\n- export-list hash: f40c4fca68d431a2e25a33b0ebf2670a\n+ interface hash: 4ca65986925ca7a1e576d2155df0c03a\n+ ABI hash: e6ea3755d60aca77b8b3debd1a2e908f\n+ export-list hash: 8877b8886ac9c53ac49919a9e0e9312a\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2826c8fc0b222c614fbc957914286dc4\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GApplicative{gprod gpure}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Monoid Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-f5114c92000091e41b47a0bb01f2cdc3\n+6d77330d6fb3577de2badfe4b4d0bdd7\n $fGApplicativeNaturalkknfgRecRecRec ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1).\n GHC.Base.Applicative h =>\n GApplicative\n n\n f\n@@ -93,15 +93,15 @@\n @k1\n @h\n @n\n @f\n @g\n @a\n v)]\n-aca6061f417f81742a055a551991f6d7\n+67c4b90f4c87d30b9fd3e791a9e90fef\n $fGApplicativeNaturalkknfgRecRecRec0 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1).\n GApplicative\n n\n f\n g\n@@ -128,15 +128,15 @@\n @(Data.Generics.GenericN.Rec (P n f a) (f a))\n @(Data.Generics.GenericN.Rec (P n g a) (g a))\n @(Data.Generics.GenericN.Rec\n (P n (Data.Functor.Product.Product f g) a)\n (Data.Functor.Product.Product f g a))\n ($fGApplicativeNaturalkknfgRecRecRec0_$cgprod @k @k1 @n @f @g @a)\n ($fGApplicativeNaturalkknfgRecRecRec0_$cgpure @k @k1 @n @f @g @a)]\n-dc91e512d2be548f41503960f262e98b\n+c89bb7f8f7ed68330975fd4528c5b8f9\n $fGApplicativeNaturalkknfgRecRecRec0_$cgprod ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1) (x :: k2).\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (P n f a) (f a) x\n@@ -194,15 +194,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N)]\n-c48d7250d5f4c18fbc08c10dcdccde39\n+5ae5dccc3875d4414bd3f50f90a2801d\n $fGApplicativeNaturalkknfgRecRecRec0_$cgpure ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a :: k1) (x :: k2).\n (f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (P n f a) (f a)\n GHC.Types.~ Data.Generics.GenericN.Rec (P n g a) (g a)) =>\n Data.Proxy.Proxy n\n@@ -255,15 +255,15 @@\n (P n (Data.Functor.Product.Product f g) a)\n (Data.Functor.Product.Product f g a))>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N

_P) _N _N)]\n-8c913d77a27c4a22c998c9a52fd74308\n+23d62c1b07fcf0a83e4777afa1db0131\n $fGApplicativeNaturalkknfgRecRecRec_$cgprod ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (x :: k2).\n GHC.Base.Applicative h =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -342,15 +342,15 @@\n _P) _N _N)]\n-44053405433c009ac5725e0def8e8f4f\n+c690ac0fdbadfd8d7e5506160fd5f19e\n $fGApplicativeNaturalkknfgRecRecRec_$cgpure ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (x :: k2).\n (GHC.Base.Applicative h, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (P n f a)) (h (f a))\n GHC.Types.~ Data.Generics.GenericN.Rec (h (P n g a)) (h (g a))) =>\n Data.Proxy.Proxy n\n@@ -424,15 +424,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-d496bcfe63a164d22d702315b59d3ef3\n+3b97e130719b7d09e84df356788bac14\n $fGApplicativekkknfg:*::*::*: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg) =>\n GApplicative\n n\n@@ -495,15 +495,15 @@\n @lg\n @lfg\n @rf\n @rg\n @rfg\n v\n v1)]\n-6f2ce3a9b3c3aa783d042e859598b635\n+bb57292b1c7f191b9b150f8ca4430361\n $fGApplicativekkknfg:*::*::*:_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *) (x :: k3).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg) =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n@@ -573,15 +573,15 @@\n $dGApplicative1\n @x\n pn\n pf\n pg\n l2\n r2) } }]\n-d7753b80c3af5aca1dde88dc9036ae37\n+b18d22a065eaecbd092590131fa8c6ea\n $fGApplicativekkknfg:*::*::*:_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (lf :: k3 -> *) (lg :: k3 -> *) (lfg :: k3 -> *) (rf :: k3 -> *)\n (rg :: k3 -> *) (rfg :: k3 -> *) (x :: k3).\n (GApplicative n f g lf lg lfg, GApplicative n f g rf rg rfg,\n f GHC.Types.~ g,\n (lf GHC.Generics.:*: rf) GHC.Types.~ (lg GHC.Generics.:*: rg)) =>\n@@ -674,15 +674,15 @@\n `cast`\n ((GHC.Types.~) *>_N (SelCo:Tc(2) (Sym co)) _N)_R\n eta\n eta1\n (Data.Proxy.Proxy @(k2 -> *) @rf)\n (Data.Proxy.Proxy @(k2 -> *) @rfg)\n eta4) } }]\n-0afb0bcb13997a33480fad05068a7aad\n+8dc6bdfd3515ab526dfcf4cb9d8c11ed\n $fGApplicativekkknfgM1M1M1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta).\n GApplicative n f g repf repg repfg =>\n GApplicative\n n\n@@ -739,15 +739,15 @@\n @g\n @repf\n @repg\n @repfg\n @i\n @c\n v)]\n-9766e98e8ccb4a5fba4038b0ba9a79f4\n+395aa048d9f1fa3e6e8e722b4bf0f301\n $fGApplicativekkknfgM1M1M1_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta) (x :: k3).\n GApplicative n f g repf repg repfg =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n@@ -812,15 +812,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-1b9d1e890796252c8c29b5c8ed2ee8f6\n+8236df8f260fa11b888c9714e87bb123\n $fGApplicativekkknfgM1M1M1_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (repf :: k3 -> *) (repg :: k3 -> *) (repfg :: k3 -> *) i\n (c :: GHC.Generics.Meta) (x :: k3).\n (GApplicative n f g repf repg repfg, f GHC.Types.~ g,\n GHC.Generics.M1 i c repf GHC.Types.~ GHC.Generics.M1 i c repg) =>\n Data.Proxy.Proxy n\n@@ -884,15 +884,15 @@\n eta\n eta1\n (Data.Proxy.Proxy @(k2 -> *) @repf)\n (Data.Proxy.Proxy @(k2 -> *) @repfg)\n eta4)\n `cast`\n (Sym (GHC.Generics.N:M1[0] _N _P _P _R) _N) } }]\n-9c80a7a6ba4b35d5d2f4c5770e5dfd3d\n+19e2b039cc7f7dcea8bbb4f571d73ece\n $fGApplicativekkknfgRecRecRec ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GHC.Base.Monoid x =>\n GApplicative\n n\n f\n g\n@@ -918,15 +918,15 @@\n @f\n @g\n @(Data.Generics.GenericN.Rec x x)\n @(Data.Generics.GenericN.Rec x x)\n @(Data.Generics.GenericN.Rec x x)\n ($fGApplicativekkknfgRecRecRec_$cgprod @k @k1 @k2 @x @n @f @g v)\n ($fGApplicativekkknfgRecRecRec_$cgpure @k @k1 @k2 @x @n @f @g v)]\n-c6ac099c251699809265ddd6abc0c8f5\n+b58fd6938a0f66628aefdf39955b45a1\n $fGApplicativekkknfgRecRecRec_$cgprod ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (x1 :: k3).\n GHC.Base.Monoid x =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -979,15 +979,15 @@\n _N\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-6cc7feca35073ac35766e2e60b2f5a06\n+8e0481d5a08ed5c2654a436b8dd8e180\n $fGApplicativekkknfgRecRecRec_$cgpure ::\n forall k1 k2 k3 x (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (x1 :: k3).\n (GHC.Base.Monoid x, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec x x\n GHC.Types.~ Data.Generics.GenericN.Rec x x) =>\n Data.Proxy.Proxy n\n@@ -1043,15 +1043,15 @@\n _N\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-ada792ebc6ca2eb304aa0f0e6f05c1e5\n+c386c071e8c413d82ea808818a5492eb\n $fGApplicativekkknfgU1U1U1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GApplicative n f g GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:GApplicative], Inline: CONLIKE,\n Unfolding: DFun: @k @k1 @k2 @n :: k @f :: k1 -> * @g :: k1 -> *.\n@@ -1062,15 +1062,15 @@\n @f\n @g\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGApplicativekkknfgU1U1U1_$cgprod @k @k1 @k2 @n @f @g)\n ($fGApplicativekkknfgU1U1U1_$cgpure @k @k1 @k2 @n @f @g)]\n-a6918f5cd402eab5d40c5b3ab27a04e1\n+86fe6d5499d4b492f7180f06a114627d\n $fGApplicativekkknfgU1U1U1_$cgprod ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) (x :: k3).\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -1087,15 +1087,15 @@\n @x :: k2\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy g)\n (ds3['GHC.Types.Many] :: GHC.Generics.U1 x)\n (ds4['GHC.Types.Many] :: GHC.Generics.U1 x) ->\n case ds3 of wild { GHC.Generics.U1 -> ds4 }]\n-0c8b7121385101be742005f836ea6b18\n+4da1196f1ca5a920f72c028eece5daec\n $fGApplicativekkknfgU1U1U1_$cgpure ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) (x :: k3).\n (f GHC.Types.~ g, GHC.Generics.U1 GHC.Types.~ GHC.Generics.U1) =>\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> Data.Proxy.Proxy GHC.Generics.U1\n@@ -1117,64 +1117,64 @@\n GHC.Types.~ GHC.Generics.U1)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds3['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds4['GHC.Types.Many] :: forall (a :: k1). f a) ->\n GHC.Generics.U1 @k2 @x]\n-3be54707e58679d8ed495918884366c5\n+a29ee8272c78be8331bcc73cf622cd6c\n $tcGApplicative :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3749123269905399159#Word64\n- 13221859667362474613#Word64\n+ 17841484651063409862#Word64\n+ 5493416516266853058#Word64\n $trModule\n $tcGApplicative2\n 3#\n $tcGApplicative1]\n-a5642de0a34721217bf57de1c6fcb837\n+9b8dca4ebeb253853829d321d9a0b8b7\n $tcGApplicative1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c3a8cacc8c4e75bad115625618227917\n+f5ab903d7c2b6f168369794020c1cc95\n $tcGApplicative2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGApplicative3]\n-a8bd85a0350edaddaf229fb28d8046c3\n+fbe73c0375c1d38791c2c23a1994a8af\n $tcGApplicative3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GApplicative\"#]\n-c5b2cd6cc253a5dc474f41a4946c3012\n+cc8b1abcdab78955e30ca934b9c673f6\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-3297d9b4b509dc1cfb187e11f6d69344\n+ff0c1c72c2461b34c36997cf9d024a49\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d35b1ae7475091dfb0c5f17eac484bdd\n+cf36d00bb6e244031e9ae084c1f47073\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Applicative\"#]\n-a25fd8148124e801cef575e3f9a62afd\n+465048a1dbca355fdd89af870af906ea\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9dd7b83a59e4f1eab42d01151538d44e\n+3baa0a1c6d07f88d34ea19f645d1394e\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-8265f05837c79915d0fdba71843c3b9a\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+a3ad5abf6940b654f465b24e4d5dfd50\n type GApplicative :: forall {k} {k1} k2.\n k\n -> (k2 -> *)\n -> (k2 -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n@@ -1192,15 +1192,15 @@\n Data.Proxy.Proxy n\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy repbf\n -> Data.Proxy.Proxy repbfg\n -> (forall (a :: k2). f a)\n -> repbf x\n {-# MINIMAL gprod, gpure #-}\n-4e48190e47f5ab16fa0b3efb49740e52\n+67719751e01720ae9873dbda6185b49a\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GApplicative [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec,\n Data.Generics.GenericN.Rec]\n = $fGApplicativeNaturalkknfgRecRecRec\n instance GApplicative [GHC.Num.Natural.Natural, ., ., ., ., .,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Bare.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Bare.p_hi", "comments": ["Files 95% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Generics.Bare 9066\n- interface hash: a005b1ee4cf5ff7b110fef9d3bdc2a8b\n- ABI hash: 09933975369d3f88a687502395401290\n- export-list hash: 5efe914a4cb0ec7fc6958e082b874fad\n+ interface hash: 772a32aea89f9340da6797f38253179c\n+ ABI hash: 9eaf074fbaf6c299ad8370fdfcb75057\n+ export-list hash: f2d1301649e8e0815e7e8a010693dc83\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 81f51177b7218c3ed83f386b2bb103de\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GBare{gcover gstrip}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec 9017a94ecd3f60378299e9682a29a339\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-533531e002f67ce698d4709b82eb1b47\n+0e7af95735d873c133dbba4b1c4c9734\n $fGBarekn:*::*: ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *).\n (GBare n l l', GBare n r r') =>\n GBare n (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -62,15 +62,15 @@\n (v1['GHC.Types.Many] :: GBare n r r').\n @k\n @n\n @(l GHC.Generics.:*: r)\n @(l' GHC.Generics.:*: r')\n ($fGBarekn:*::*:_$cgstrip @k @n @l @l' @r @r' v v1)\n ($fGBarekn:*::*:_$cgcover @k @n @l @l' @r @r' v v1)]\n-04f2c185115c627ad0b1bcfaabf60e95\n+ed4c719953b2cb4b328469b1bb71a3b1\n $fGBarekn:*::*:_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:*:) l' r' x -> (GHC.Generics.:*:) l r x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -93,15 +93,15 @@\n GHC.Generics.:*:\n @k\n @l\n @r\n @x\n (gcover @k @n @l @l' $dGBare @x pn l1)\n (gcover @k @n @r @r' $dGBare1 @x pn r1) }]\n-075b2f197b6061b7edadbb399365da4d\n+7cc98af33ded222c29b39dc5ca979092\n $fGBarekn:*::*:_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:*:) l r x -> (GHC.Generics.:*:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -124,15 +124,15 @@\n GHC.Generics.:*:\n @k\n @l'\n @r'\n @x\n (gstrip @k @n @l @l' $dGBare @x pn l1)\n (gstrip @k @n @r @r' $dGBare1 @x pn r1) }]\n-a661d15a22d9cef8e65392b59e1d311d\n+876d0b0e52e1fdfb6413400f552b85ab\n $fGBarekn:+::+: ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *).\n (GBare n l l', GBare n r r') =>\n GBare n (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -149,15 +149,15 @@\n (v1['GHC.Types.Many] :: GBare n r r').\n @k\n @n\n @(l GHC.Generics.:+: r)\n @(l' GHC.Generics.:+: r')\n ($fGBarekn:+::+:_$cgstrip @k @n @l @l' @r @r' v v1)\n ($fGBarekn:+::+:_$cgcover @k @n @l @l' @r @r' v v1)]\n-ec7e576e039043f4e33dd7a86a3945dd\n+8bd18eb979586ff1ee31565cd292dc2b\n $fGBarekn:+::+:_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:+:) l' r' x -> (GHC.Generics.:+:) l r x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -187,15 +187,15 @@\n GHC.Generics.R1 r1\n -> GHC.Generics.R1\n @k\n @l\n @r\n @x\n (gcover @k @n @r @r' $dGBare1 @x pn r1) }]\n-a6aa627c544926d1c4251672817520f9\n+11aae0ed386ba36d0cbf714e71def6a3\n $fGBarekn:+::+:_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (l :: k -> *) (l' :: k -> *)\n (r :: k -> *) (r' :: k -> *) (x :: k).\n (GBare n l l', GBare n r r') =>\n Data.Proxy.Proxy n\n -> (GHC.Generics.:+:) l r x -> (GHC.Generics.:+:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -225,15 +225,15 @@\n GHC.Generics.R1 r1\n -> GHC.Generics.R1\n @k\n @l'\n @r'\n @x\n (gstrip @k @n @r @r' $dGBare1 @x pn r1) }]\n-fe7a92b91f4ab6437513d131edb4b046\n+b7a813f1798accdf1fb53e096511a0d5\n $fGBareknM1M1 ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta).\n GBare n repbi repbb =>\n GBare n (GHC.Generics.M1 i k2 repbi) (GHC.Generics.M1 i k2 repbb)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n@@ -248,15 +248,15 @@\n (v['GHC.Types.Many] :: GBare n repbi repbb).\n @k\n @n\n @(GHC.Generics.M1 i k1 repbi)\n @(GHC.Generics.M1 i k1 repbb)\n ($fGBareknM1M1_$cgstrip @k @n @repbi @repbb @i @k1 v)\n ($fGBareknM1M1_$cgcover @k @n @repbi @repbb @i @k1 v)]\n-614ac7f8390aad10e8c7521ee1a92385\n+f0f6fc1022c34208b3f1c4bd939c12ef\n $fGBareknM1M1_$cgcover ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta) (x :: k1).\n GBare n repbi repbb =>\n Data.Proxy.Proxy n\n -> GHC.Generics.M1 i k2 repbb x -> GHC.Generics.M1 i k2 repbi x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -279,15 +279,15 @@\n f x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-e203a6fb14c7a4903cd6d52c0eeb431e\n+ec848cfbc7a7e63529f330bff2a5c3bc\n $fGBareknM1M1_$cgstrip ::\n forall k1 (n :: GHC.TypeNats.Nat) (repbi :: k1 -> *)\n (repbb :: k1 -> *) i (k2 :: GHC.Generics.Meta) (x :: k1).\n GBare n repbi repbb =>\n Data.Proxy.Proxy n\n -> GHC.Generics.M1 i k2 repbi x -> GHC.Generics.M1 i k2 repbb x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -310,15 +310,15 @@\n f x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-c905c659ca1aaee09db3fef49b468947\n+0fb699483d2d04fd36444383f1f671ae\n $fGBareknRecRec ::\n (repbi GHC.Types.~ repbb) =>\n GBare\n n\n (Data.Generics.GenericN.Rec repbi repbi)\n (Data.Generics.GenericN.Rec repbb repbb)\n DFunId\n@@ -331,15 +331,15 @@\n (v['GHC.Types.Many] :: repbi GHC.Types.~ repbb).\n @k\n @n\n @(Data.Generics.GenericN.Rec repbi repbi)\n @(Data.Generics.GenericN.Rec repbb repbb)\n ($fGBareknRecRec_$cgstrip @k @repbi @repbb @n v)\n ($fGBareknRecRec_$cgcover @k @repbi @repbb @n v)]\n-6f6000a38423e384de0e9ff159415912\n+16256f30c6246075a3e7f094b34128d0\n $fGBareknRecRec0 ::\n GHC.Types.Coercible a b =>\n GBare\n n\n (Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a))\n@@ -356,15 +356,15 @@\n @n\n @(Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a))\n @(Data.Generics.GenericN.Rec b b)\n ($fGBareknRecRec0_$cgstrip @k @a @b @n v)\n ($fGBareknRecRec0_$cgcover @k @a @b @n v)]\n-f7791be0c75f1f6e0ac6c7d2ea49d213\n+13aebc540c888363151814fd38f494e0\n $fGBareknRecRec0_$cgcover ::\n forall k a b (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Types.Coercible a b =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec b b x\n -> Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n@@ -398,15 +398,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N) }]\n-9518e4386ea89c7b389e70a2e8fff7e9\n+4ce2449c611f024d719a0dacc03de163\n $fGBareknRecRec0_$cgstrip ::\n forall k a b (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Types.Coercible a b =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec\n (P n Data.Functor.Identity.Identity a)\n (Data.Functor.Identity.Identity a)\n@@ -441,15 +441,15 @@\n ; GHC.Generics.N:K1[0]\n _N _P _R _P\n ; Data.Functor.Identity.N:Identity[0]\n (co\n ; Sym (GHC.Generics.N:K1[0] _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N _P) _N _N)) }]\n-f753a2d9ffed40b0e958caef1ecbfdea\n+858d9d4418184c8aa717d5039677721d\n $fGBareknRecRec_$cgcover ::\n forall k repbi repbb (n :: GHC.TypeNats.Nat) (x :: k).\n (repbi GHC.Types.~ repbb) =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec repbb repbb x\n -> Data.Generics.GenericN.Rec repbi repbi x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -468,15 +468,15 @@\n eta1\n `cast`\n (Data.Generics.GenericN.Rec\n _N\n Univ(phantom phantom <*>_N :: repbb, repbi)\n (Sub (Sym co))\n _P)_R }]\n-7f307ba0e76d3efe9af78b0dd54c098a\n+94f7ca5ed63da6a5d63e825c337d9ef8\n $fGBareknRecRec_$cgstrip ::\n forall k repbi repbb (n :: GHC.TypeNats.Nat) (x :: k).\n (repbi GHC.Types.~ repbb) =>\n Data.Proxy.Proxy n\n -> Data.Generics.GenericN.Rec repbi repbi x\n -> Data.Generics.GenericN.Rec repbb repbb x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -495,113 +495,113 @@\n eta1\n `cast`\n (Data.Generics.GenericN.Rec\n _N\n Univ(phantom phantom <*>_N :: repbi, repbb)\n (Sub co)\n _P)_R }]\n-4769fdd94965db3bab57ff5d38a85694\n+89b9135401d85fe141a4f94a4f880ddb\n $fGBareknU1U1 :: GBare n GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFCon[C:GBare],\n Inline: CONLIKE,\n Unfolding: DFun: @k @n :: GHC.TypeNats.Nat.\n @k\n @n\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGBareknU1U1_$cgstrip @k @n)\n ($fGBareknU1U1_$cgcover @k @n)]\n-48936db69c456ff30928e3a80efdbcab\n+19b523e164eae7fc531085ea47133b31\n $fGBareknU1U1_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.U1 x -> GHC.Generics.U1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @n :: GHC.TypeNats.Nat\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-0d0a661f78047852e3bcfaf9186d94d8\n+9e253bb31d326c3a2c4d0258b741fe15\n $fGBareknU1U1_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.U1 x -> GHC.Generics.U1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @n :: GHC.TypeNats.Nat\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-fefe8badd2b761656801cf3dd5548b73\n+870c42f226064ee00dfc84ce1ca4514d\n $fGBareknV1V1 :: GBare n GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:GBare],\n Inline: CONLIKE,\n Unfolding: DFun: @k @n :: GHC.TypeNats.Nat.\n @k\n @n\n @GHC.Generics.V1\n @GHC.Generics.V1\n ($fGBareknV1V1_$cgstrip @k @n)\n ($fGBareknV1V1_$cgcover @k @n)]\n-d73f0d6008feffaf2411bc4eb88ce28e\n+2ce3813243476b16f4be28d983c41441\n $fGBareknV1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Bare\"#]\n-c5f8b49e89765048d7599c34f1dbdbd0\n+85288d70d793dd531760f6ad12c4fe70\n $fGBareknV1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V12]\n-b0f3a861f18edafd4797ce1e5e16c25d\n+03faafca5c8f1d4b6701e93447d62214\n $fGBareknV1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-004bebf75841adb85aa45358f40fc1c6\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+3b539a223f4ae0b9f9ffea4bd4df961a\n $fGBareknV1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V14]\n-3821d0ff9b85b39aee07463b2974c835\n+57973f0e9591213408f82e02c32fb446\n $fGBareknV1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-13708e6f649fad2ffed69b9d9a8ea1cc\n+37a8ff6f46e5d08fafc4f0b5b7320686\n $fGBareknV1V15 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGBareknV1V13\n $fGBareknV1V16\n GHC.Stack.Types.EmptyCallStack]\n-93ad89c5b99971ede7ff838240357fc8\n+818d45cdbe61e27a94734a193349e6a8\n $fGBareknV1V16 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGBareknV1V11\n $fGBareknV1V9\n $fGBareknV1V7\n $fGBareknV1V17\n $fGBareknV1V5\n $fGBareknV1V17\n $fGBareknV1V4]\n-77af63b51c3f88f013e2c49c4f085bd0\n+bea0b89d984158ba5bd5753b9f6dfe28\n $fGBareknV1V17 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 34#]\n-1f0b580a3612792232783d355c78773f\n+d7d0275ae4e3567d5210860fa8706b24\n $fGBareknV1V1_$cgcover ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -612,15 +612,15 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGBareknV1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-02e0ddcc222978bd6355c3db4ffae3a2\n+44d9db0c8649261540da10f2ef246c39\n $fGBareknV1V1_$cgstrip ::\n forall k (n :: GHC.TypeNats.Nat) (x :: k).\n Data.Proxy.Proxy n -> GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -631,113 +631,113 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGBareknV1V15\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-c792f79bd3cb5f464216b5b869a6bd48\n+603acab1aa36124cfa521ea79ac8b11d\n $fGBareknV1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGBareknV1V13\n $fGBareknV1V3\n GHC.Stack.Types.EmptyCallStack]\n-193a5ad062dcb3f1bb3fc4954d0c078d\n+801b2140f83dd2096be75d34019bb15a\n $fGBareknV1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGBareknV1V11\n $fGBareknV1V9\n $fGBareknV1V7\n $fGBareknV1V6\n $fGBareknV1V5\n $fGBareknV1V6\n $fGBareknV1V4]\n-f2cdcbc59c3c2a8b69f76fc7d71a96c2\n+4d0602d3294ee212eb07f641cd0e8597\n $fGBareknV1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 25#]\n-61d30a4e5258829985b4d4319196144f\n+be55eb3d78575e50b7bf0e50f6cb06a5\n $fGBareknV1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 16#]\n-d44b6a6227b35fbb2f70b7f23dbb0799\n+7a5832211fc21f3601bd699a14e2fc8f\n $fGBareknV1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 35#]\n-4ef7d8baba01007b7597fccd09cee14b\n+c2ad6a8dc101f4c5ad2ccf3767941af7\n $fGBareknV1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V8]\n-5266bfc3e7d9429748bc9556787efdb0\n+88451be1a9382780279214c064cbe748\n $fGBareknV1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Bare.hs\"#]\n-2c7c83a7bb4eebe5659286873c24d3a7\n+119e90b4421ab7cdd17e4e33f912d633\n $fGBareknV1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGBareknV1V10]\n-0dabd667233d6e9d53cfd571fcd78e34\n+1ddb65a4543a4d0b34e6b34acc6dfb70\n $tcGBare :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 5373179404672895006#Word64\n- 11927831921503033801#Word64\n+ 14720346315237248769#Word64\n+ 6710622583730516072#Word64\n $trModule\n $tcGBare2\n 1#\n $tcGBare1]\n-e124d0efc44f09c8d6666a976420e624\n+7d70da88b92d5247500fe8a1bb7bf80a\n $tcGBare1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c89c0bd942d613b5a4939fd409f44381\n+034836eec54a0bc9d964b1e712d2f56b\n $tcGBare2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGBare3]\n-b0c9b04eda340a2dd3e68e653c1c4bf4\n+0dbbe641e215b3145ce535211f3cebfd\n $tcGBare3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GBare\"#]\n-319848c17b2c9dbdb109914758f6ed03\n+8e766c4c257843c2e017998c0b53adb4\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-9e326d6d27086ec5d0f802496aea90fa\n+91eb4b43b4928dbc300d94123629bab2\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGBareknV1V10]\n-2bbeafa05f52f10322662b6243f72c81\n+506bb521c889e7b2b34fd392f669e80c\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGBareknV1V12]\n-945b4ea07a87e7d0224aa958b95612ad\n+e05c32af4d05b0e8d79b7a6ffd5a83ea\n type GBare :: forall {k}.\n GHC.TypeNats.Nat -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n class GBare n repbi repbb where\n gstrip :: forall (x :: k). Data.Proxy.Proxy n -> repbi x -> repbb x\n gcover :: forall (x :: k). Data.Proxy.Proxy n -> repbb x -> repbi x\n {-# MINIMAL gstrip, gcover #-}\n-36d3f3a9a7407b8a6ffa19f4cb303529\n+0a07eff0d2b443ef8be7bc56d3b032e7\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GBare [., ., GHC.Generics.:*:, GHC.Generics.:*:]\n = $fGBarekn:*::*:\n instance GBare [., ., GHC.Generics.:+:, GHC.Generics.:+:]\n = $fGBarekn:+::+:\n instance GBare [., ., GHC.Generics.M1, GHC.Generics.M1]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Constraints.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Constraints.p_hi", "comments": ["Files 90% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Generics.Constraints [family instance module] 9066\n- interface hash: 528f35d08b51e0abf1f1f41b4df754e4\n- ABI hash: d745d9d282b4b8b1e7a00feaec72f736\n- export-list hash: f5759178cdbb617493eee5630131ae28\n+ interface hash: 8f4bd37ce590352b1810c8ab570fd0b9\n+ ABI hash: 39afe276e15aa255e48d08c5ba712f59\n+ export-list hash: cc7aef2f5c488676d297ae83c45ee82c\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 169552c9599f90e84b8944dab428621d\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 65f7f84670d16c10ad18f2d54576dbfb\n sig of: Nothing\n@@ -21,44 +21,44 @@\n GAll\n GConstraints{gaddDicts}\n Other\n Self\n SelfOrOther\n X\n Y\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Monoid Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts 11d9cab4807894b2baa78a0cba8e7494\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 0c882df337c0ddb4b93d319e9df15dee\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-787fec921a117210bd5fecd8d1f9ac0b\n+1d3aa0b1f2e59e06b4015a80700e01e8\n $fGConstraintskFUNkncfRecRecRec ::\n forall k1 k2 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *) (a' :: k1)\n (a :: k1).\n GConstraints\n n\n c\n@@ -138,15 +138,15 @@\n _N\n _N))]\n-9b9fa64cb9cf1f2bb0645d2496e45a51\n+748e83ab3ea97d279deed2c0be4bf55f\n $fGConstraintskkkncf:*::*::*: ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf) =>\n GConstraints\n@@ -180,15 +180,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-c4bee2fe39446911e5233cee0f0a5ca1\n+ea39de93e58be3c81a16906a2f33398b\n $fGConstraintskkkncf:*::*::*:_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *) (x :: k3).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf,\n GAll n c (lx GHC.Generics.:*: rx)) =>\n@@ -241,15 +241,15 @@\n (GHC.Classes.$p1(%,%)\n @(GAll n c lx)\n @(GAll n c rx)\n irred\n `cast`\n (Sub (D:R:GAllknc:*:[0] _N _N _N _N _N)))\n r) }]\n-d304f1b74a7d5965acca087263453dd9\n+db265c76b17826c40add6c3d9162cb6d\n $fGConstraintskkkncf:+::+::+: ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf) =>\n GConstraints\n@@ -282,15 +282,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-74e57f08b5eace2be99121bef4a4de6a\n+7bee4fc68eb34fc02a6d02fedc2db6d4\n $fGConstraintskkkncf:+::+::+:_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (lx :: * -> *)\n (lf :: k3 -> *) (ldf :: k3 -> *) (rx :: * -> *) (rf :: k3 -> *)\n (rdf :: k3 -> *) (x :: k3).\n (GConstraints n c f lx lf ldf, GConstraints n c f rx rf rdf,\n GAll n c (lx GHC.Generics.:+: rx)) =>\n@@ -349,15 +349,15 @@\n (GHC.Classes.$p1(%,%)\n @(GAll n c lx)\n @(GAll n c rx)\n irred\n `cast`\n (Sub (D:R:GAllknc:+:[0] _N _N _N _N _N)))\n r) }]\n-2023660c2eb1c3c54c36345da51bd38a\n+90c826605b253b1a5ada34c3ca49a65b\n $fGConstraintskkkncfM1M1M1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (repbx :: * -> *)\n (repbf :: k3 -> *) (repbdf :: k3 -> *) i (k4 :: GHC.Generics.Meta).\n GConstraints n c f repbx repbf repbdf =>\n GConstraints\n n\n@@ -384,15 +384,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-afe9f04f731c23b59b1013b51c33882c\n+8ba3f00c6e9ab7d59c092bd254bfb75b\n $fGConstraintskkkncfM1M1M1_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (repbx :: * -> *)\n (repbf :: k3 -> *) (repbdf :: k3 -> *) i (k4 :: GHC.Generics.Meta)\n (x :: k3).\n (GConstraints n c f repbx repbf repbdf,\n GAll n c (GHC.Generics.M1 i k4 repbx)) =>\n@@ -440,15 +440,15 @@\n x1\n `cast`\n (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-d6d0f008c8de0c293039ab8adac6779b\n+58fac89cb7c6fa76e8cef0e1a73b5ea3\n $fGConstraintskkkncfRecRecRec ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) a' a b' b.\n GConstraints\n n\n c\n f\n@@ -482,15 +482,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-a7878a2d867151466e4133bd307be54e\n+fe622d0f8ed72c05d04a6fadfea8e57e\n $fGConstraintskkkncfU1U1U1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2).\n GConstraints n c f GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n@@ -513,15 +513,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b11dac25c462215136658bbd974273f0\n+16cd0798da4cf791975ef2c0094c84b5\n $fGConstraintskkkncfV1V1V1 ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2).\n GConstraints n c f GHC.Generics.V1 GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n@@ -536,38 +536,38 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-09dd9269c81003f55b883d62fa866e5b\n+1172d3dc504d585b8405750fce44b361\n $fGConstraintskkkncfV1V1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Constraints\"#]\n-e998b748a8fb7ae0e7c23e493c1d8fda\n+45a42542b2b8dc88b541806dfa3724a8\n $fGConstraintskkkncfV1V1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V12]\n-3319831b86be7c9a219106a345521e34\n+e092abd396938029b4d859229ff85b5f\n $fGConstraintskkkncfV1V1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e9e430476d1f1fc5ed6d9887beda28e0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+bed0b26fae861fbad3940cbebc8d082b\n $fGConstraintskkkncfV1V1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V14]\n-83e68c3e28fa4f1e33f0a2b8d9badf68\n+08aad8ab0fc5c4b70e532d131d74d22c\n $fGConstraintskkkncfV1V1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-90b1be3e0692fb8b479d738fa5db0eb9\n+c0ceccb528596840e6c4adf3ef8754d3\n $fGConstraintskkkncfV1V1V1_$cgaddDicts ::\n forall k1 k2 k3 (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (f :: k2) (x :: k3).\n GAll n c GHC.Generics.V1 =>\n GHC.Generics.V1 x -> GHC.Generics.V1 x\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n@@ -584,296 +584,296 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGConstraintskkkncfV1V1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-eac176706789b19a8c4b13a0e29a866d\n+0e35236949517d75196078f4bf343325\n $fGConstraintskkkncfV1V1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGConstraintskkkncfV1V1V13\n $fGConstraintskkkncfV1V1V3\n GHC.Stack.Types.EmptyCallStack]\n-491b645464d6c1e1af022a9e847c6e9c\n+9fe1adc0bfc35344a3c7abffb9a31426\n $fGConstraintskkkncfV1V1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGConstraintskkkncfV1V1V11\n $fGConstraintskkkncfV1V1V9\n $fGConstraintskkkncfV1V1V7\n $fGConstraintskkkncfV1V1V6\n $fGConstraintskkkncfV1V1V5\n $fGConstraintskkkncfV1V1V6\n $fGConstraintskkkncfV1V1V4]\n-64c2c84675e37cb320bfe3158b1537aa\n+a8515c74a011c1eb06efa000a73034cd\n $fGConstraintskkkncfV1V1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 26#]\n-b3a480212c401edda8d4e4504ab7d2ca\n+014c17fdb381e7da83381b47c582faa9\n $fGConstraintskkkncfV1V1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 17#]\n-92320647fbbded9f0d8e0640bb3f24ab\n+63f009a2f26314fb11db7f2c5db3ae1b\n $fGConstraintskkkncfV1V1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 50#]\n-5f40d1d7f2653d64a9951a384d095361\n+805d7a23894976ce236ee8d0f8d1c423\n $fGConstraintskkkncfV1V1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V8]\n-c68a90067dc8ad1dfe0abcfbef099f0b\n+2be6becadbecb0f2a61b1892fdf629e4\n $fGConstraintskkkncfV1V1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Constraints.hs\"#]\n-c067e7505a7cdb27b1e928fdc7307bb3\n+f3eaed93e9c7bc39341859b18c7c45e3\n $fGConstraintskkkncfV1V1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGConstraintskkkncfV1V1V10]\n-2a41b6706d9c5841546eae7028423045\n+655574f2700ee59185447eddfcaccf3e\n $tcGConstraints :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6851661124450705764#Word64\n- 14645157912100126483#Word64\n+ 15360508327004011304#Word64\n+ 13365934220198454576#Word64\n $trModule\n $tcGConstraints2\n 3#\n $tcGConstraints1]\n-7284522711e488c2191688c15440762b\n+0a2ac3377f113208f6a477b8f08dc8f1\n $tcGConstraints1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a0b899cb9c52a7603d8ee59fcdfd901d\n+18153f82677e64619f4f9248db2e5c23\n $tcGConstraints2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGConstraints3]\n-f168d2b52c33cb1bdf21b87265728348\n+88bbc48887ca6473a2f8791667003f97\n $tcGConstraints3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GConstraints\"#]\n-9d95c67ab2d8cd01ba9781deebfd112c\n+1e9eb634241ced9e05013fe315b709b9\n $tcOther :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8349147923270837370#Word64\n- 12898881767436466691#Word64\n+ 12498758593334170086#Word64\n+ 10611665333571444453#Word64\n $trModule\n $tcOther2\n 0#\n $tcOther1]\n-fbf6149391bedc0b6da7b000b015eb53\n+09cbc84e35db1602dd69a0d43157a8e8\n $tcOther1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-e9ae7640dc1a0e160e8aa02d5d341bdf\n+3d8a05844054bd7ecbcddbcb312075cd\n $tcOther2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcOther3]\n-1834c41a308c7d796a762eb4c4d6acdd\n+d961ce8527291fb9c823082c678dc8d2\n $tcOther3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Other\"#]\n-5a2523b9af8f2fd234ff1bd5ddd8529c\n+68c8b9f9b8829514ef3ce8e4eb7ba5e7\n $tcSelf :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3882247661755556798#Word64\n- 15914790293505291645#Word64\n+ 8366789200600956343#Word64\n+ 4003837004503057287#Word64\n $trModule\n $tcSelf1\n 0#\n $tcOther1]\n-b671adf40e1368e7d3581270309fc82c\n+2701f811c019203343e9fd50469c7c69\n $tcSelf1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcSelf2]\n-398abe68f6c23a94c56b32dacd196330\n+d6101a88344cbb4a65e1a10de8edc2c3\n $tcSelf2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Self\"#]\n-ca7c4ddc97affc0c1f601771239f0e1c\n+113f0aa342aab23de22045073d9e3fe2\n $tcX :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8089038180435349292#Word64\n- 1459891730328233508#Word64\n+ 8571795711296583517#Word64\n+ 18443914932586086827#Word64\n $trModule\n $tcX2\n 1#\n $tcX1]\n-4cde3fe3946105297047e38367833713\n+903755c4a65e8e118d2835974a4bdce5\n $tcX1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-396b4fd56e0b6a902ad94e4beb77d4a2\n+c5f7a473a5c33f8e2e508aac5d2bef64\n $tcX2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcX3]\n-3c74e3b970ede4ecc44d57343e110f40\n+2caffd952612d01ce26c4d9baf159492\n $tcX3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"X\"#]\n-e3cbdb7534677a5eee435bc6e7b4314d\n+e63b5f464f4e0db2eabb79550ed96208\n $tcY :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 18205050585863117784#Word64\n- 17595235996948877005#Word64\n+ 13364731284302579778#Word64\n+ 8948023015760443949#Word64\n $trModule\n $tcY2\n 1#\n $tcY1]\n-7423c23fbacf4da0558a469880a07bfd\n+ac7ab91638d84d6fbb52be35db5d066d\n $tcY1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepVar], Inline: [~]]\n-e77f2aa4367f691d885d83668fb4bc2b\n+e2e57340ac36ed17647a6222d6ca096c\n $tcY2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcY3]\n-453eff73639999862d0efe377d94f32a\n+6426c433c49b5f15bc9eb0cd385d5ac2\n $tcY3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Y\"#]\n-ab2b108c5248fbda26e14eca105ea733\n+d1c7839d9ff66a0f552f352725cb4d9b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-09801260a0ed73da1cefeefd02df3123\n+8f0fcb9321521d38d394bdc06918818a\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: \n GHC.Types.TrNameS $fGConstraintskkkncfV1V1V10]\n-422d89c651efe9b5ef6079fb62c92413\n+0ce1dd78e41ddbd0e70545bf14ec7940\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: \n GHC.Types.TrNameS $fGConstraintskkkncfV1V1V12]\n-542a8dba38a19ae89db73a9a948e576b\n+985f5a97917857f06462b5bf5d9dbb25\n axiom D:R:GAllRec ::\n forall k1 k2 (_1 :: k2) (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (a :: k1).\n GAllRec n c (P n X _1) (X a) = c a\n forall k (_1 :: GHC.TypeNats.Nat) (_2 :: k -> GHC.Types.Constraint)\n _3 _4.\n GAllRec _1 _2 _3 _4 = () :: Constraint\n-c13402336e383ec4c1226c925b702a88\n+569739405fc2ab18c9e4bcc8305a25a3\n axiom D:R:GAllk1ncM1 ::\n forall k1 (n :: GHC.TypeNats.Nat) (c :: k1 -> GHC.Types.Constraint)\n i (k2 :: GHC.Generics.Meta) (repbf :: * -> *).\n GAll n c (GHC.Generics.M1 i k2 repbf) = GAll n c repbf\n-aa8f2e39141580d534440f3925be5bae\n+8209b24162394dbe641f9ab9496de38b\n axiom D:R:GAllknc:*: ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint)\n (l :: * -> *) (r :: * -> *).\n GAll n c (l GHC.Generics.:*: r) = (GAll n c l, GAll n c r)\n-29a9664607728e66ea7df5f0ea919fb6\n+b317a26f3a30ec61ea4783d0b966763c\n axiom D:R:GAllknc:+: ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint)\n (l :: * -> *) (r :: * -> *).\n GAll n c (l GHC.Generics.:+: r) = (GAll n c l, GAll n c r)\n-43fbb73e2aee1835e65cac758f6f719a\n+bbd7f48dcfe68f321a838937ec8335c6\n axiom D:R:GAllkncRec ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint) l\n r.\n GAll n c (Data.Generics.GenericN.Rec l r) = GAllRec n c l r\n-e3d01d35fb524e88a9dec2da6bc2be67\n+3884bc457a838b2df254e94dc9a489cf\n axiom D:R:GAllkncU1 ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint).\n GAll n c GHC.Generics.U1 = () :: Constraint\n-4973ac6e12f1cc4334b7f4087e18a1d0\n+b1ed65528ab0992c1a60ad7295f5979c\n axiom D:R:GAllkncV1 ::\n forall k (n :: GHC.TypeNats.Nat) (c :: k -> GHC.Types.Constraint).\n GAll n c GHC.Generics.V1 = () :: Constraint\n-63748f827ddf0b2d585f6f9f8b70797a\n+17aca5f66eab94507f638f70bab15e8d\n axiom D:R:SelfOrOther ::\n forall k (b :: k). SelfOrOther b b = Self\n forall k (b :: k) (b' :: k). SelfOrOther b b' = Other\n-a97385b661b56e3be3899c1ab3c9b2ee\n+a7ee244c89fc411256c161efeeeaa7f7\n type GAll :: forall k.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint) -> (* -> *) -> GHC.Types.Constraint\n type family GAll n c repbf open\n-557a0570a0d96d918cf96f9a4087fca6\n+03526228c3e645da09ec91d1b85e9d59\n type GAllRec :: forall k.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint) -> * -> * -> GHC.Types.Constraint\n type family GAllRec n c l r where\n forall k1 k2 (_1 :: k2) (n :: GHC.TypeNats.Nat)\n (c :: k1 -> GHC.Types.Constraint) (a :: k1).\n GAllRec n c (P n X _1) (X a) = c a\n forall k (_1 :: GHC.TypeNats.Nat) (_2 :: k -> GHC.Types.Constraint)\n _3 _4.\n GAllRec _1 _2 _3 _4 = () :: Constraint\n axiom D:R:GAllRec\n-18ae239fe2e28b351bd84011ef359ae0\n+6ccfe857f29008381ec19da46c2e9db1\n type GConstraints :: forall {k} {k1} {k2}.\n GHC.TypeNats.Nat\n -> (k -> GHC.Types.Constraint)\n -> k1\n -> (* -> *)\n -> (k2 -> *)\n -> (k2 -> *)\n -> GHC.Types.Constraint\n class GConstraints n c f repbx repbf repbdf where\n gaddDicts :: forall (x :: k2).\n GAll n c repbx =>\n repbf x -> repbdf x\n {-# MINIMAL gaddDicts #-}\n-37a7ae0c37bbbef9abad416d6d0959ff\n+8bb50890c54679a66314c7386cc22c84\n type role Other phantom phantom phantom\n type Other :: * -> * -> * -> *\n data Other p a x\n-7eb33923cc725a2e1c7609a52d3a1c15\n+359fc6e15013713a9368ad8bfdd5796b\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-2f79d5b19b60d934525cb7f68041b9a3\n+fad44513c200d092a9b1df1339ad21e6\n type role Self phantom phantom phantom\n type Self :: * -> * -> * -> *\n data Self p a x\n-e8303c93bae99168155f7ca174ff8b67\n+34dc852d178b4c8bad9ddef602d60e81\n type SelfOrOther :: forall k. k -> k -> * -> * -> * -> *\n type family SelfOrOther b b' where\n forall k (b :: k). SelfOrOther b b = Self\n forall k (b :: k) (b' :: k). SelfOrOther b b' = Other\n axiom D:R:SelfOrOther\n-171ce71086eece1d472adc01f3a98af1\n+ef8817b68c20d7aa4653a1809b97c873\n type role X phantom\n type X :: forall {k}. k -> *\n data X a\n-ba6a1ba68e95cb981888219d3edc670b\n+d1ab14839ebc0a3f1df64062aa572cc4\n type Y :: forall k. k\n data family Y\n instance GConstraints [., GHC.Prim.FUN, ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec,\n Data.Generics.GenericN.Rec]\n = $fGConstraintskFUNkncfRecRecRec\n instance GConstraints [., ., ., ., ., ., GHC.Generics.:*:,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Distributive.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Distributive.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,58 +1,58 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Generics.Distributive 9066\n- interface hash: 2e8473d1f7edb542d38d836204633566\n- ABI hash: 182d125d0a54c88bdc9bb4ac5562d23f\n- export-list hash: 01bd0bf3c69d9ed41b89304dabe8f1bc\n+ interface hash: adb28758a27f8d4e8b9f583835c73c97\n+ ABI hash: b3b3f8e5e21335496ae8f387d71e93b4\n+ export-list hash: 041ee6c38192ef6dc7d80eda56c4e985\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: b23610d5288c522f9c6e5e364c1f05b2\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GDistributive{gdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k\n plugin package dependencies:\n orphans: GHC.Base GHC.Float Data.Orphans GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Array.Byte Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception GHC.IsList\n GHC.RTS.Flags GHC.Stats Control.DeepSeq Data.Tagged\n Control.Applicative.Backwards Control.Monad.Trans.Identity\n Control.Monad.Trans.Reader Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Distributive 9619938098769df8b6bccbd10ffe32c5\n-afb79bd0b5748ff6c0294f75fbbe2302\n+14113de14744121d0cdda474c9bc99e2\n $fGDistributiveknf:*::*: ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (l :: k -> *)\n (l' :: k -> *) (r :: k -> *) (r' :: k -> *).\n (GDistributive n f l l', GDistributive n f r r') =>\n GDistributive n f (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -79,15 +79,15 @@\n @f\n @l\n @l'\n @r\n @r'\n v\n v1)]\n-fe50c2478a21076b996b181070660b27\n+241c3893b28cd440edd9d2638fac650d\n $fGDistributiveknf:*::*:_$cgdistribute ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (l :: k -> *)\n (l' :: k -> *) (r :: k -> *) (r' :: k -> *) (x :: k).\n (GDistributive n f l l', GDistributive n f r r') =>\n Data.Proxy.Proxy n\n -> f ((GHC.Generics.:*:) l r x) -> (GHC.Generics.:*:) l' r' x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -144,15 +144,15 @@\n (GHC.Base.fmap\n @f\n $dFunctor\n @((GHC.Generics.:*:) l r x)\n @(r x)\n (sndF @k @l @r @x)\n eta1))]\n-099b1b59b456c5a37a29aacbf754c1ae\n+5097ce2f6295781388fde5a1883c424d\n $fGDistributiveknfM1M1 ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (bg :: k -> *)\n (bfg :: k -> *) i (c :: GHC.Generics.Meta).\n GDistributive n f bg bfg =>\n GDistributive\n n f (GHC.Generics.M1 i c bg) (GHC.Generics.M1 i c bfg)\n DFunId\n@@ -169,15 +169,15 @@\n @k\n @n\n @f\n @(GHC.Generics.M1 i c bg)\n @(GHC.Generics.M1 i c bfg)\n ($p1GDistributive @k @n @f @bg @bfg v)\n ($fGDistributiveknfM1M1_$cgdistribute @k @n @f @bg @bfg @i @c v)]\n-3197a5ce88b37c66a035e55ec850ba0e\n+0b7675f169657d260244ed6a7d3844f9\n $fGDistributiveknfM1M1_$cgdistribute ::\n forall k (n :: GHC.TypeNats.Nat) (f :: * -> *) (bg :: k -> *)\n (bfg :: k -> *) i (c :: GHC.Generics.Meta) (x :: k).\n GDistributive n f bg bfg =>\n Data.Proxy.Proxy n\n -> f (GHC.Generics.M1 i c bg x) -> GHC.Generics.M1 i c bfg x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -213,15 +213,15 @@\n } in\n (\\ (x1['GHC.Types.Many] :: f (GHC.Generics.M1 i c bg x)) ->\n f1 (g x1))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-0a1a2ccd3dc95b41b4424b420c90eb84\n+863283f6d57d8a7c7b25eb2a3034c909\n $fGDistributiveknfRecRec ::\n forall k1 k (f :: * -> *) (h :: * -> *) (n :: GHC.TypeNats.Nat)\n (g :: k1 -> *) (a :: k1).\n (GHC.Base.Functor f, Data.Distributive.Distributive h) =>\n GDistributive\n n\n f\n@@ -257,15 +257,15 @@\n @f\n @h\n @n\n @g\n @a\n v\n v1)]\n-3df3ec4ab4b5ace94604de3e6268e890\n+8611c45e089e303815eb631fe2221d13\n $fGDistributiveknfRecRec0 ::\n forall k1 k (f :: * -> *) (n :: GHC.TypeNats.Nat) (g :: k1 -> *)\n (a :: k1).\n GHC.Base.Functor f =>\n GDistributive\n n\n f\n@@ -288,15 +288,15 @@\n @f\n @(Data.Generics.GenericN.Rec (P n g a) (g a))\n @(Data.Generics.GenericN.Rec\n (P n (Data.Functor.Compose.Compose f g) a)\n (Data.Functor.Compose.Compose f g a))\n v\n ($fGDistributiveknfRecRec0_$cgdistribute @k1 @k @f @n @g @a v)]\n-c75cca035318db026a77172b30201b56\n+d4e2c4adcd56a527d3324a38cb6f3d0b\n $fGDistributiveknfRecRec0_$cgdistribute ::\n forall k1 k (f :: * -> *) (n :: GHC.TypeNats.Nat) (g :: k1 -> *)\n (a :: k1) (x :: k).\n GHC.Base.Functor f =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (P n g a) (g a) x)\n -> Data.Generics.GenericN.Rec\n@@ -347,15 +347,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n

_P) _N _N)]\n-50513c5c9bf88169d9d23a4faebc137a\n+6c3a39fab164332ee3a1c207dbd63176\n $fGDistributiveknfRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (h :: * -> *) (n :: GHC.TypeNats.Nat)\n (g :: k1 -> *) (a :: k1) (x :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h) =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (h (P n g a)) (h (g a)) x)\n -> Data.Generics.GenericN.Rec\n@@ -431,15 +431,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-96ca0e531ea1961c4036ab0acf24de8d\n+cf40ef192b48eb1765637e6cf636f254\n $fGDistributiveknfU1U1 ::\n GHC.Base.Functor f =>\n GDistributive n f GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k\n@@ -449,15 +449,15 @@\n @k\n @n\n @f\n @GHC.Generics.U1\n @GHC.Generics.U1\n v\n ($fGDistributiveknfU1U1_$cgdistribute @k @f @n v)]\n-5fd3f5be9237bca305394c959b51b255\n+9ef43b0335fb7269b5bac768a69c9cc5\n $fGDistributiveknfU1U1_$cgdistribute ::\n forall k (f :: * -> *) (n :: GHC.TypeNats.Nat) (x :: k).\n GHC.Base.Functor f =>\n Data.Proxy.Proxy n -> f (GHC.Generics.U1 x) -> GHC.Generics.U1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -465,88 +465,88 @@\n @f :: * -> *\n @n :: GHC.TypeNats.Nat\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n @x :: k\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: f (GHC.Generics.U1 x)) ->\n GHC.Generics.U1 @k @x]\n-b264138cc40ab4669940cf658f168866\n+95f4eb5d0e06cf2cb2451c799168d013\n $tcGDistributive :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 5090494350507771809#Word64\n- 13791180703735360121#Word64\n+ 10274924133335904162#Word64\n+ 10083981124340008161#Word64\n $trModule\n $tcGDistributive2\n 1#\n $tcGDistributive1]\n-cf922480b3b424ffd0f021a5a22c6840\n+1866409628d7dd45c25386be74b3e66c\n $tcGDistributive1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-41d9a8aeb5c2671adf4099c4df5a438f\n+f00451ba03a25273e118d9c61d92f073\n $tcGDistributive2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGDistributive3]\n-acf8bac60e11a50cdd594a27ff9f95de\n+a6b34c3d63379d4086161ad7e0c69470\n $tcGDistributive3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GDistributive\"#]\n-cd165a524aad7919d5d1dbd2160011bb\n+fc332f194d3902f12ecbce8b4deb0267\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-616b90aafc892e78a8a071fc611db665\n+30ec7047df5f51e3ee67174d20834c8c\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-9f54470c7d774c34786c9d4820c5e50f\n+f3e20d5025fb844dd0a6cd8ed36a2543\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Distributive\"#]\n-90458ec20a619b843c1bb081bd0f1f67\n+1dff1523069baa20fca88eb1ec286e15\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-e9b1ebede838fc1951c1281ec419e331\n+05ca5f5fd762ef22c8f37fe3bc8f3260\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-3159f20af5067fbbf12f2d1e0a767bd5\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+b2b99c933ab6f3406ac9b5e18cde4454\n type GDistributive :: forall {k}.\n GHC.TypeNats.Nat\n -> (* -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n class GHC.Base.Functor f => GDistributive n f repbg repbfg where\n gdistribute :: forall (x :: k).\n Data.Proxy.Proxy n -> f (repbg x) -> repbfg x\n {-# MINIMAL gdistribute #-}\n-2491bd7e90dd94f166bf1f059879eaf3\n+baf79258156c0cb96ca7b1a63727c773\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-fdb57ff2609f4e266e8f6291313bae99\n+4ef877e1d6f6ccf6ba9736828ff13e99\n fstF ::\n forall {k} (l :: k -> *) (r :: k -> *) (a :: k).\n (GHC.Generics.:*:) l r a -> l a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @l :: k -> *\n @r :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: (GHC.Generics.:*:) l r a) ->\n case ds of wild { GHC.Generics.:*: x _y -> x }]\n-39fd2b5f18a0c41e47236761d328df40\n+bc893afba0cca8da2fc2b3b9a7993a4a\n sndF ::\n forall {k} (l :: k -> *) (r :: k -> *) (a :: k).\n (GHC.Generics.:*:) l r a -> r a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Functor.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Functor.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Generics.Functor 9066\n- interface hash: 3d1e542de30ba7af740fce34484d0bc3\n- ABI hash: bfe9ee105ade1417e5f83268a25c6c68\n- export-list hash: 5181bc237f1b5142ba8064be4536aca8\n+ interface hash: dddccf945641ce68d834d550a09f780c\n+ ABI hash: bfd180435702e8aa8caeea441416de49\n+ export-list hash: eb91949418fe63f3a6a9b6b4db686fbf\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2f1607cc4dbe0d799266a78b3e363678\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GFunctor{gmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-c9c3059a9106efc942deab668419554d\n+ccd675580ac20b6cc89374544a758806\n $fGFunctorkknfg:*::*: ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n GFunctor n f g (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n@@ -68,15 +68,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-bd3c8f83ab9271a7eaf208c9a2b39e13\n+6d30b2f3c06a5e043b0c6eab42a97f18\n $fGFunctorkknfg:*::*:_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *)\n (x :: k2).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -118,15 +118,15 @@\n ($dGFunctor1\n `cast`\n (N:GFunctor[0] _N _N _N _N _N _N _N)\n @x\n pn\n h\n r1) }]\n-e4312ccefb2ccf6ed5e3572b37bcd9bb\n+4b9a56f9762939dc05b4a8035832f5d5\n $fGFunctorkknfg:+::+: ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n GFunctor n f g (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n@@ -149,15 +149,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-389e385820183c8f2d8ffbd163b2b73b\n+289b0b131ba57069b7ad1c1f86c8cb2f\n $fGFunctorkknfg:+::+:_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (l :: k2 -> *) (l' :: k2 -> *) (r :: k2 -> *) (r' :: k2 -> *)\n (x :: k2).\n (GFunctor n f g l l', GFunctor n f g r r') =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -206,15 +206,15 @@\n ($dGFunctor1\n `cast`\n (N:GFunctor[0] _N _N _N _N _N _N _N)\n @x\n pn\n h\n r1) }]\n-633ab70de8516ea8ba96e46b759f3aeb\n+acdf048ce4c3ee3502326b93735d9540\n $fGFunctorkknfgM1M1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (bf :: k2 -> *) (bg :: k2 -> *) i (c :: GHC.Generics.Meta).\n GFunctor n f g bf bg =>\n GFunctor n f g (GHC.Generics.M1 i c bf) (GHC.Generics.M1 i c bg)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -232,15 +232,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-cdd29846dcdf087bbd1200ec682cff4b\n+f2afcd55cc937434b1481527c5ce491d\n $fGFunctorkknfgM1M1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (bf :: k2 -> *) (bg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n GFunctor n f g bf bg =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n@@ -274,15 +274,15 @@\n (\\ (x1['GHC.Types.Many] :: GHC.Generics.M1 i c bf x) ->\n f1\n x1 `cast` (GHC.Generics.N:M1[0] _N _P _P _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N _P _P _R) _N)]\n-64a1477ac702f344a298b325aa8e417e\n+b798e7897407c17650e9b8ca06ba31cb\n $fGFunctorkknfgRecRec ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n x.\n GFunctor\n n\n f\n g\n@@ -301,15 +301,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-ea3fe53eab8558136e78543f957bbf2a\n+7a470d1d029aa4f664f3c6b588ae4fab\n $fGFunctorkknfgRecRec0 ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a' :: k1) (a :: k1).\n GHC.Base.Functor h =>\n GFunctor\n n\n f\n@@ -333,15 +333,15 @@\n _N\n _N\n _N\n _N\n _N))]\n-0c4caae1a8daff5c6e2bc3fb7eae946a\n+f4f9492734cef3fa4598ca7c70a4ec68\n $fGFunctorkknfgRecRec0_$cgmap ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a' :: k1) (a :: k1) (x :: k2).\n GHC.Base.Functor h =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> g a1)\n -> Data.Generics.GenericN.Rec (h (P n f a')) (h (f a)) x\n@@ -393,15 +393,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-d8d57d067574d42f9a7e1a152b6f6734\n+d4683b91477f743bc0350d953bd41b94\n $fGFunctorkknfgRecRec1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1).\n GFunctor\n n\n f\n g\n@@ -420,15 +420,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-4a66b6125aa8f0b85a65a562761e9a4e\n+35345abbd32d4d847286347c8a5a8cf7\n $fGFunctorkknfgRecRec1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1) (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> g a1)\n -> Data.Generics.GenericN.Rec (P n f a') (f a) x\n -> Data.Generics.GenericN.Rec (P n g a') (g a) x\n@@ -460,15 +460,15 @@\n %<'GHC.Types.Many>_N ->_R g a1>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N

_P) _N _N)]\n-2067472083da25f5278f682efe4e65d3\n+ec27e111d39b9827652b0e54f87a73bb\n $fGFunctorkknfgRecRec_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n x1 (x2 :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> Data.Generics.GenericN.Rec x1 x1 x2\n -> Data.Generics.GenericN.Rec x1 x1 x2\n@@ -481,15 +481,15 @@\n @f :: k -> *\n @g :: k -> *\n @x\n @x1 :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n GHC.Base.id @(Data.Generics.GenericN.Rec x x x1)]\n-4dfaab1c2f7f777ec651b83a63c147e8\n+ae2bbe1716e9535d874850f30652d3f8\n $fGFunctorkknfgU1U1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *).\n GFunctor n f g GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -502,15 +502,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b0d904ea69d81d1251d2233ccda8255c\n+7988f93466beeca9145738210017ce68\n $fGFunctorkknfgU1U1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -522,15 +522,15 @@\n @n :: GHC.TypeNats.Nat\n @f :: k -> *\n @g :: k -> *\n @x :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n GHC.Base.id @(GHC.Generics.U1 x)]\n-3d9e3a3c2726258bb56cd6b8aca7accb\n+2a538df315444fc510721c9e3619ef94\n $fGFunctorkknfgV1V1 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *).\n GFunctor n f g GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -543,38 +543,38 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-3ea3267f72669efeecaf9b813f49058c\n+2da24c592c8dd5fc076d15548ce244d6\n $fGFunctorkknfgV1V10 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Functor\"#]\n-f3a09acb63e2da5ea5b3a36c34667738\n+b2036495e6b21f65775e7fea70a0023d\n $fGFunctorkknfgV1V11 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V12]\n-c691938a8055a7c77ddb92e9930f405f\n+8c79e366645cbad38b925f9461b8e7db\n $fGFunctorkknfgV1V12 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-c0269456c0138c54168950e0db4f55c5\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+04039e3c507aa984913f73af9e31c8c4\n $fGFunctorkknfgV1V13 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V14]\n-7a14a66923770a97c6222289b6e47716\n+1731bbc8de7d2bd609e01725621092fa\n $fGFunctorkknfgV1V14 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"undefined\"#]\n-3134c8a8db3d3c02af1a5fa4d7790c73\n+7ea4b9c5bbec6b4f035a0cb43d9f21b8\n $fGFunctorkknfgV1V1_$cgmap ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (x :: k2).\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> g a)\n -> GHC.Generics.V1 x\n -> GHC.Generics.V1 x\n@@ -593,119 +593,119 @@\n GHC.Err.undefined\n @GHC.Types.LiftedRep\n @(GHC.Generics.V1 x)\n $fGFunctorkknfgV1V2\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-b11d76df155d0a92adac7b133d6ce4ad\n+4f879a529214fedefb6886d031b12872\n $fGFunctorkknfgV1V2 :: GHC.Stack.Types.CallStack\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.PushCallStack],\n Unfolding: Core: \n GHC.Stack.Types.PushCallStack\n $fGFunctorkknfgV1V13\n $fGFunctorkknfgV1V3\n GHC.Stack.Types.EmptyCallStack]\n-93f25da723c09e69d5e0ac3af738fadc\n+aeb3bf10d9965e77ff78a9a5ab7e1b91\n $fGFunctorkknfgV1V3 :: GHC.Stack.Types.SrcLoc\n [TagSig: ,\n LambdaFormInfo: LFCon[GHC.Stack.Types.SrcLoc],\n Unfolding: Core: \n GHC.Stack.Types.SrcLoc\n $fGFunctorkknfgV1V11\n $fGFunctorkknfgV1V9\n $fGFunctorkknfgV1V7\n $fGFunctorkknfgV1V6\n $fGFunctorkknfgV1V5\n $fGFunctorkknfgV1V6\n $fGFunctorkknfgV1V4]\n-c759ec5e94c9fbf9f4e121065a5c44d3\n+28c952da0ed3be757baa5f4f3a3e73da\n $fGFunctorkknfgV1V4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 25#]\n-db5c61d357aff99b382675373058eae2\n+e71ff7a36d83254aebc8a398ea988fef\n $fGFunctorkknfgV1V5 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 16#]\n-379e7c78ca579ffc2ca4b8313ba11c98\n+36444c65f26c031682832bf01e08cc50\n $fGFunctorkknfgV1V6 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 30#]\n-09806f352df54e97ee7080128feef411\n+04325195d00488cc45a62f72b534bef1\n $fGFunctorkknfgV1V7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V8]\n-b4f5d4b9dce0b4632592b713d58b4921\n+dbe90d0b44b336e177422c7d4a2eeaed\n $fGFunctorkknfgV1V8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"src/Barbies/Generics/Functor.hs\"#]\n-a06d30efa824723d487f2a0547544de6\n+549666392b6b81d69b4bfb31ea8070b6\n $fGFunctorkknfgV1V9 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fGFunctorkknfgV1V10]\n-68074776ffd50298a56f8e7adbbb7f5b\n+7e46a2c5e153f3d09ef61aa93e09f276\n $tcGFunctor :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4697584212482043703#Word64\n- 3866459034889150500#Word64\n+ 17624111935747959270#Word64\n+ 2969230431485300830#Word64\n $trModule\n $tcGFunctor2\n 2#\n $tcGFunctor1]\n-4f1e8754370439832b44f9cbb5e9b6de\n+ca82f099091c9a363aa85ae5b6e3dd56\n $tcGFunctor1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-07fb834a6b86dcafeb3b780aad2b6b28\n+ebc01ec389bc064bb000c1c3d30b0572\n $tcGFunctor2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGFunctor3]\n-027ca2ef85470ee31ed038c8fbf99c12\n+158c9d82d4847133dfb71fffce26fc2f\n $tcGFunctor3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GFunctor\"#]\n-99c5888962137f981ac964ce9ebdd6fa\n+127e9e828c6cd946d3493c5bcd1d4bb3\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule2 $trModule1]\n-00475e34d0d6cd72beda39cccc23c948\n+56f6114cc57629637d54b8f9e8fefa43\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGFunctorkknfgV1V10]\n-79a4d1d018b257b74987f544575e66e2\n+26c05980f12a4b9446c7f932f8e7fe35\n $trModule2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fGFunctorkknfgV1V12]\n-c55eefcbafb68adae4442799562f802f\n+c171ebf8be4099e43d49f60c5018274b\n type GFunctor :: forall {k} {k1}.\n GHC.TypeNats.Nat\n -> (k -> *)\n -> (k -> *)\n -> (k1 -> *)\n -> (k1 -> *)\n -> GHC.Types.Constraint\n class GFunctor n f g repbf repbg where\n gmap :: forall (x :: k1).\n Data.Proxy.Proxy n\n -> (forall (a :: k). f a -> g a) -> repbf x -> repbg x\n {-# MINIMAL gmap #-}\n-f94e93a079a6f9433c24029e5a3aea18\n+3b94c7c508f68bc9304732a15425b760\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GFunctor [., ., ., ., ., GHC.Generics.:*:,\n GHC.Generics.:*:]\n = $fGFunctorkknfg:*::*:\n instance GFunctor [., ., ., ., ., GHC.Generics.:+:,\n GHC.Generics.:+:]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Generics/Traversable.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Generics/Traversable.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,51 +1,51 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Generics.Traversable 9066\n- interface hash: 735fae89456a194e6defba7a88d1b7d9\n- ABI hash: 78ba5b8127485172bcdfb5f1a7a2be9f\n- export-list hash: e191cdaf49853917f8b7debdfa6d86ad\n+ interface hash: ae4426f61f855a859c13118f0d06d27b\n+ ABI hash: 24c2969b48d69b5d87bd0015edc00ed7\n+ export-list hash: 689c061279ca4cd1721cb64d922cf03b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 67a5205f8269836ce813133a487f57b0\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 8fe13908cdf66de9b935452c32184ad0\n sig of: Nothing\n used TH splices: False\n where\n exports:\n GTraversable{gtraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Err f7d8ca3417adcb9420b90d3dfc3eb8fa\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-1419e59c7370999b103230729c7b8a56\n+d83c74f3c374901e404719de0a481d0a\n $fGTraversableNaturalkknfgRecRec ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1).\n Data.Traversable.Traversable h =>\n GTraversable\n n\n f\n@@ -71,15 +71,15 @@\n _N\n _N\n _N\n _N\n _N))]\n-4e2672de39b7a595ad8b98a1b6e23e46\n+6c355ad8f64e1a4ce76daa591ea56ee7\n $fGTraversableNaturalkknfgRecRec0 ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1).\n GTraversable\n n\n f\n g\n@@ -100,15 +100,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-4e7527ec7b2691efcae475bbca2f9b9f\n+b59205d0d1da2b130e1af824104b87b1\n $fGTraversableNaturalkknfgRecRec0_$cgtraverse ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (f :: k1 -> *) (g :: k1 -> *)\n (a' :: k1) (a :: k1) (t :: * -> *) (x :: k2).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec (P n f a') (f a) x\n@@ -150,15 +150,15 @@\n f1\n (eta1\n @a\n ({__scc {Data.Generics.GenericN.unRec} True False} x1)\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N

_P _N _N\n ; GHC.Generics.N:K1[0] _N _P _R _P))]\n-762c61730c85ed3600f0267b40913cd6\n+bb5a44dc425c281a6d1e262527143cce\n $fGTraversableNaturalkknfgRecRec_$cgtraverse ::\n forall k1 k2 (h :: * -> *) (n :: GHC.TypeNats.Nat) (f :: k1 -> *)\n (g :: k1 -> *) (a :: k1) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k1). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec (h (P n f a)) (h (f a)) x\n@@ -214,15 +214,15 @@\n (f2\n ({__scc {Data.Generics.GenericN.unRec} True False} x1)\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-59d83b56ca4f6c0e7e016d53ec013d43\n+b9eb0eb33fd13cf8f35edefb486d9b07\n $fGTraversablekkknfg:*::*: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *).\n (GTraversable n f g l l', GTraversable n f g r r') =>\n GTraversable n f g (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -245,15 +245,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-2f2f92b2bb0f0c192a1435f4b4a061a9\n+52bb0604d7a1e17a81b6a28639296a19\n $fGTraversablekkknfg:*::*:_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g l l', GTraversable n f g r r',\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n@@ -311,15 +311,15 @@\n _N _N _N _N _N _N _N _N)\n @t\n @x\n $dApplicative\n eta\n eta1\n r1) }]\n-4d467e9af0acfab73becef4f2a8021e7\n+83078706f6cf048cb988570e87b522e8\n $fGTraversablekkknfg:+::+: ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *).\n (GTraversable n f g l l', GTraversable n f g r r') =>\n GTraversable n f g (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -342,15 +342,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-b4cfbc0cbf561b3167594285832bd5e3\n+a08dd8bbee905633984fe7c19cd3ae48\n $fGTraversablekkknfg:+::+:_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (l :: k3 -> *) (l' :: k3 -> *) (r :: k3 -> *) (r' :: k3 -> *)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g l l', GTraversable n f g r r',\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n@@ -412,15 +412,15 @@\n _N _N _N _N _N _N _N _N)\n @t\n @x\n $dApplicative\n eta\n eta1\n r1) }]\n-f73056424baa5d23bd203988b5be4da4\n+28dff94dc2b3db51b0a8f50d1bcf7099\n $fGTraversablekkknfgM1M1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (bf :: k3 -> *) (bg :: k3 -> *) i (c :: GHC.Generics.Meta).\n GTraversable n f g bf bg =>\n GTraversable\n n f g (GHC.Generics.M1 i c bf) (GHC.Generics.M1 i c bg)\n DFunId\n@@ -441,15 +441,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-cdd1a6b0a5c707e5fb6e5be0a805d989\n+fa137509dc24dca89d5dd0d7acbd12a4\n $fGTraversablekkknfgM1M1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (bf :: k3 -> *) (bg :: k3 -> *) i (c :: GHC.Generics.Meta)\n (t :: * -> *) (x :: k3).\n (GTraversable n f g bf bg, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n@@ -500,15 +500,15 @@\n eta\n eta1\n } in\n \\ (x1['GHC.Types.Many] :: GHC.Generics.M1 i c bf x) ->\n f1\n (f2\n x1 `cast` (GHC.Generics.N:M1[0] _N _P _P _R _N))]\n-af60a417de3a064d22e86f60d0ce1dd3\n+10eb5c11504b0a93c46123e20839ead2\n $fGTraversablekkknfgRecRec ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) a.\n GTraversable\n n\n f\n g\n (Data.Generics.GenericN.Rec a a)\n@@ -527,15 +527,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-9cdd119dee667c24ce4bfec3cd578431\n+95590ff150a1011cff9aef6183732825\n $fGTraversablekkknfgRecRec_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *) a\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a1 :: k2). f a1 -> t (g a1))\n -> Data.Generics.GenericN.Rec a a x\n@@ -552,15 +552,15 @@\n @a\n @t :: * -> *\n @x :: k2\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative t)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a1 :: k1). f a1 -> t (g a1)) ->\n GHC.Base.pure @t $dApplicative @(Data.Generics.GenericN.Rec a a x)]\n-ef1d22f02a43c51bafe47cf99169c95c\n+d68ca1f4df8b7a8b95999be6b86b0926\n $fGTraversablekkknfgU1U1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GTraversable n f g GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1L,A,A,A,A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -574,15 +574,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-dc37c8d7ccf2feb9ff878923464a0b83\n+1864b74b840e21d9561263170576b17f\n $fGTraversablekkknfgU1U1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n -> GHC.Generics.U1 x\n@@ -598,15 +598,15 @@\n @g :: k1 -> *\n @t :: * -> *\n @x :: k2\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative t)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy n)\n (ds1['GHC.Types.Many] :: forall (a :: k1). f a -> t (g a)) ->\n GHC.Base.pure @t $dApplicative @(GHC.Generics.U1 x)]\n-c355de816c1f16b63eaeba35e26225b6\n+e77fe3f7ab4c9ab42f5f246506a72631\n $fGTraversablekkknfgV1V1 ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *).\n GTraversable n f g GHC.Generics.V1 GHC.Generics.V1\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -620,15 +620,15 @@\n _N\n _N\n _N\n _N\n _N\n _N\n _N))]\n-617c7d01c3eb04b0e4a686be7b1039fc\n+f1075d80c1c4af77a14e3d481b431a10\n $fGTraversablekkknfgV1V1_$cgtraverse ::\n forall k1 k2 k3 (n :: k1) (f :: k2 -> *) (g :: k2 -> *)\n (t :: * -> *) (x :: k3).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k2). f a -> t (g a))\n -> GHC.Generics.V1 x\n@@ -658,15 +658,15 @@\n (\\ @b -> GHC.CString.unpackFoldrCString# @b \"undefined\"#))\n (GHC.Stack.Types.SrcLoc\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString#\n @b\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#))\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#))\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString#\n @b\n \"Barbies.Generics.Traversable\"#))\n (GHC.Base.build\n@@ -679,78 +679,78 @@\n (GHC.Types.I# 21#)\n (GHC.Types.I# 32#)\n (GHC.Types.I# 30#))\n GHC.Stack.Types.EmptyCallStack)\n `cast`\n (Sym (GHC.Classes.N:IP[0]\n <\"callStack\">_N _N))]\n-2048cfc731cef46a4f97ae83c3e74816\n+489b0617e906d9eed74ea50f1a13b261\n $tcGTraversable :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 16602354247371775265#Word64\n- 3123105163253640060#Word64\n+ 16683089016182270559#Word64\n+ 3559867911118579067#Word64\n $trModule\n $tcGTraversable2\n 3#\n $tcGTraversable1]\n-a021ed4dcc30364f420aa67e15433824\n+c9ac6ca9e7f30eb55d57ef9f6589db2c\n $tcGTraversable1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ffa7acff0a799b58945993d650dc9524\n+62633e81bfaa96a0068535f40a1d1522\n $tcGTraversable2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGTraversable3]\n-f36a0ee9d4bf5365e3172500e75584e8\n+8cefdc200d59f0f837bc81858be44a9c\n $tcGTraversable3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GTraversable\"#]\n-add60015671bb86a7fc5bb871f08fa46\n+31ab1a25810ca41c91ce6d5899bf81eb\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-025920c1c5b59cd9ba57058e7e0b4068\n+87c0a3c4a1af34fd62ab6256825f30a0\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-e666b80a4c0746ce3ce196e95bd89ba5\n+20bbc8306c1e901f7e63c0f474cac6ce\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Generics.Traversable\"#]\n-a2961c009d5b554dc8bc6d1fe8ce5b27\n+00b6f3d76db51dc5cc4aa3f124bc4b04\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-34aa6482c16e6d20a36e4cdf8f3ad621\n+0a97cbc0a112ff9a0519a48c02301b02\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-07978d60099125b7617e0fdd0bfa9d0e\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+6bc69f1d03cbd1e58f9a67d23d07f501\n type GTraversable :: forall {k} {k1} {k2}.\n k\n -> (k1 -> *)\n -> (k1 -> *)\n -> (k2 -> *)\n -> (k2 -> *)\n -> GHC.Types.Constraint\n class GTraversable n f g repbf repbg where\n gtraverse :: forall (t :: * -> *) (x :: k2).\n GHC.Base.Applicative t =>\n Data.Proxy.Proxy n\n -> (forall (a :: k1). f a -> t (g a)) -> repbf x -> t (repbg x)\n {-# MINIMAL gtraverse #-}\n-358232dbea30fa1abde988b559c1e083\n+a60b7c4e68032a07b76370a7ea160370\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n instance GTraversable [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec]\n = $fGTraversableNaturalkknfgRecRec\n instance GTraversable [GHC.Num.Natural.Natural, ., ., ., ., .,\n Data.Generics.GenericN.Rec, Data.Generics.GenericN.Rec]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeB.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeB.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.ApplicativeB [orphan module] 9066\n- interface hash: 326be6841d548a9e3d08ef4dae09c0da\n- ABI hash: 27b00dfc91c1741bfb2d3c42684e7344\n- export-list hash: 97f76e0a31067bdc9623d74dfb179978\n- orphan hash: 5f5e9719506e3b1822888f63b01ff0d9\n+ interface hash: 46c3635a8e35d117f68dc598c3531998\n+ ABI hash: 32ce9f9db11093baaf3db99a633f6b50\n+ export-list hash: 5b192dab08a0491faf09373600f4b2cd\n+ orphan hash: 0e76ccbccc897cc539c26523eb86b49d\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: e3ec953c6cc2f924446c95503f2a7a47\n sig of: Nothing\n used TH splices: False\n@@ -23,69 +23,69 @@\n bzipWith\n bzipWith3\n bzipWith4\n gbprodDefault\n gbpureDefault\n ApplicativeB{bprod bpure}\n CanDeriveApplicativeB\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative f7fe06bbc86fe9884b13a256898eadd7\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 8265f05837c79915d0fdba71843c3b9a\n- gprod 7cf879a44333e2fb97407129639e2918\n- gpure b37eba7ec6f871e9461567cf3e8aa090\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative e6ea3755d60aca77b8b3debd1a2e908f\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative a3ad5abf6940b654f465b24e4d5dfd50\n+ gprod 7e94421018041d5aa4b77514edf80363\n+ gpure ed4392f5b804dde97786aaf051945c4c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-77cd2d4a6687a3a59a60d24b949eed94\n+a307572e4003302b60c5899a6d9aac5c\n $dmbprod ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (ApplicativeB b, CanDeriveApplicativeB b f g) =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n \\ @k\n @b :: (k -> *) -> *\n ($dApplicativeB['GHC.Types.Many] :: ApplicativeB b)\n @f :: k -> *\n @g :: k -> *\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveApplicativeB b f g) ->\n gbprodDefault @k @b @f @g $d(%,,,%)]\n-068b0b8440ae6fd7923a6a62f5e55f38\n+ef3d33b1803a1cd0a562142bf601b6f8\n $dmbpure ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (ApplicativeB b, CanDeriveApplicativeB b f f) =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -314,30 +314,30 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))) _N)]\n-e7e4099321ab35acdb148ddf4571be57\n+5ffaf12e051bffdec19767d45040f008\n $fApplicativeBkConst ::\n GHC.Base.Monoid a => ApplicativeB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k @a (v['GHC.Types.Many] :: GHC.Base.Monoid a).\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkConst_$cbpure @k @a v)\n ($fApplicativeBkConst_$cbprod @k @a v)]\n-660869d8fe03ac4c3a5e21330344aae2\n+2669d805c61e95c58bda714c29a4dac3\n $fApplicativeBkConst_$cbprod ::\n forall k a (f :: k -> *) (g :: k -> *).\n GHC.Base.Monoid a =>\n Data.Functor.Const.Const a f\n -> Data.Functor.Const.Const a g\n -> Data.Functor.Const.Const a (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -363,15 +363,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-d159b41983c7b0ed19b2db4991e4f801\n+efac6c5b66a2dd483c2e34bec80df9fa\n $fApplicativeBkConst_$cbpure ::\n forall k a (f :: k -> *).\n GHC.Base.Monoid a =>\n (forall (a1 :: k). f a1) -> Data.Functor.Const.Const a f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1L,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -386,15 +386,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-73fbef6a3519c7053767174f0795d69c\n+d97903df78b2874ce026fbf2838f1181\n $fApplicativeBkConstant ::\n GHC.Base.Monoid a =>\n ApplicativeB (Data.Functor.Constant.Constant a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @k @a (v['GHC.Types.Many] :: GHC.Base.Monoid a).\n@@ -402,15 +402,15 @@\n @(Data.Functor.Constant.Constant a)\n (Barbies.Internal.FunctorB.$fFunctorBkConstant_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkConstant_$cbpure @k @a v)\n ($fApplicativeBkConstant_$cbprod @k @a v)]\n-5439fb95b3f4082ff66eb81e8aaf9e46\n+6524e0f276a01b2c0d67f9f814c7fd47\n $fApplicativeBkConstant_$cbprod ::\n forall k a (f :: k -> *) (g :: k -> *).\n GHC.Base.Monoid a =>\n Data.Functor.Constant.Constant a f\n -> Data.Functor.Constant.Constant a g\n -> Data.Functor.Constant.Constant\n a (Data.Functor.Product.Product f g)\n@@ -442,15 +442,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Constant.N:Constant[0]\n *>_N\n _R\n _P))]\n-93f5ff52875376b4ee9e08dd7ed8ded8\n+197cfd2b23516336d69f373481dc2d8d\n $fApplicativeBkConstant_$cbpure ::\n forall k a (f :: k -> *).\n GHC.Base.Monoid a =>\n (forall (a1 :: k). f a1) -> Data.Functor.Constant.Constant a f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1L,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -465,15 +465,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Constant.N:Constant[0]\n *>_N\n _R\n _P))]\n-fad33c94ff4caad292ac0ffa401c3fd7\n+57c1e507f4760ad82fed953a52e6141a\n $fApplicativeBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ApplicativeB a, ApplicativeB b) =>\n ApplicativeB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -488,15 +488,15 @@\n @(Data.Functor.Product.Product a b)\n ($fApplicativeBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkProduct_$cbpure @k @a @b v v1)\n ($fApplicativeBkProduct_$cbprod @k @a @b v v1)]\n-a57892691b369bfbe1a7bec287bb12b2\n+72fb1fba0a1a8bdceddd93768e249429\n $fApplicativeBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -530,15 +530,15 @@\n (($p1ApplicativeB @k @b $dApplicativeB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-753b61d119b93376882c21f039741638\n+0cf74533cc01af71498096098971a4a6\n $fApplicativeBkProduct_$cbprod ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n -> Data.Functor.Product.Product\n@@ -562,15 +562,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @(Data.Functor.Product.Product f g)\n (bprod @k @a $dApplicativeB @f @g ll rl)\n (bprod @k @b $dApplicativeB1 @f @g lr rr) } }]\n-d61525b5cd0bfeedca35281f43ccd054\n+3e5cce0d183079322fdce79a0f2015e1\n $fApplicativeBkProduct_$cbpure ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (ApplicativeB a, ApplicativeB b) =>\n (forall (a1 :: k). f a1) -> Data.Functor.Product.Product a b f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=1),\n@@ -585,53 +585,53 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @f\n (bpure @k @a $dApplicativeB @f x)\n (bpure @k @b $dApplicativeB1 @f x)]\n-35f6045d5d5934b7726f2c8ffe2cac00\n+7ee82707c09579b2fd092324ac4c8d95\n $fApplicativeBkProxy :: ApplicativeB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ApplicativeB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fApplicativeBkProxy_$cbpure @k)\n ($fApplicativeBkProxy_$cbprod @k)]\n-7e7b45a4e0013b9c299b43f52c53bbe1\n+55cbc114f4c42efd8c30c6725970347c\n $fApplicativeBkProxy_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Proxy.Proxy (Data.Functor.Product.Product f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Product.Product f g)]\n-8e5672123880c54764f7dcdad4741eed\n+ac30f093658c169b9b7f964bf875b928\n $fApplicativeBkProxy_$cbpure ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Data.Proxy.Proxy f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Data.Proxy.Proxy @(k -> *) @f]\n-27cee33cbd35a49f33cf97d8b83bcfe6\n+9a6472989631f925988d58dd4fbb5911\n $fGApplicativeNaturalk1k0fgRecRecRec ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b) =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n@@ -685,15 +685,15 @@\n @m\n @b\n @f\n @g\n v\n v1\n v2)]\n-d2e1272de4eff6b9c14be678d91d0683\n+1149bd1c1e57dabb644af2c31e129e8e\n $fGApplicativeNaturalk1k0fgRecRecRec0 ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (GHC.Base.Applicative h, ApplicativeB b) =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n@@ -741,15 +741,15 @@\n @k1\n @h\n @b\n @f\n @g\n v\n v1)]\n-2a37a48e127040daf2c7e4da60a03b00\n+72a35ad50b9fd3f617a12b950c9f380d\n $fGApplicativeNaturalk1k0fgRecRecRec0_$cgprod ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, ApplicativeB b) =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -828,15 +828,15 @@\n _N\n _P) _N _N)]\n-14702ee8ef612ec3e698c8ddf0071d14\n+fc8f2615effa528b02bd4d0651f7da2b\n $fGApplicativeNaturalk1k0fgRecRecRec0_$cgpure ::\n forall k k1 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, ApplicativeB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (b (P 0 f))) (h (b f))\n GHC.Types.~ Data.Generics.GenericN.Rec\n (h (b (P 0 g))) (h (b g))) =>\n@@ -916,15 +916,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-2830e5a85aeba4e566d498495b130102\n+26bc971479ba789b5254ad4fb60d6aab\n $fGApplicativeNaturalk1k0fgRecRecRec1 ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n@@ -952,15 +952,15 @@\n @(Data.Generics.GenericN.Rec (b (P 0 f)) (b f))\n @(Data.Generics.GenericN.Rec (b (P 0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b (P 0 (Data.Functor.Product.Product f g)))\n (b (Data.Functor.Product.Product f g)))\n ($fGApplicativeNaturalk1k0fgRecRecRec1_$cgprod @k @k1 @b @f @g v)\n ($fGApplicativeNaturalk1k0fgRecRecRec1_$cgpure @k @k1 @b @f @g v)]\n-bbd314712800115a1dc8840ff0367848\n+a934954849dababb1f324cdcb01089ec\n $fGApplicativeNaturalk1k0fgRecRecRec1_$cgprod ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k1).\n ApplicativeB b =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1025,15 +1025,15 @@\n _N\n _P) _N _N)]\n-91c6f41d6ae7f750754bac64c12aa4d5\n+1cf14ca60315930cd0bbeb3386920c0b\n $fGApplicativeNaturalk1k0fgRecRecRec1_$cgpure ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (x :: k1).\n (ApplicativeB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (b (P 0 f)) (b f)\n GHC.Types.~ Data.Generics.GenericN.Rec (b (P 0 g)) (b g)) =>\n Data.Proxy.Proxy 0\n@@ -1100,15 +1100,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-44caf874e08ec334031637ce1432a5bf\n+c8358b8a374b5f10ce52a1cabf26f84b\n $fGApplicativeNaturalk1k0fgRecRecRec_$cgprod ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b) =>\n Data.Proxy.Proxy 0\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1212,15 +1212,15 @@\n _N\n _P) _N _N)]\n-dc6ab2a1b56c30f343dc8eb12c42fe77\n+a525b2a12beb1af0c9776aa3951cf80d\n $fGApplicativeNaturalk1k0fgRecRecRec_$cgpure ::\n forall k k1 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (x :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeB b,\n f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (m (h (b (P 0 f)))) (m (h (b f)))\n GHC.Types.~ Data.Generics.GenericN.Rec\n@@ -1311,77 +1311,77 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-5d46cdd99f680884369663710823eba4\n+2d0d725ae3c73d0e9ce1ab6f42a10ad9\n $tcApplicativeB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12947307924732368312#Word64\n- 18371083973462631636#Word64\n+ 16423447268799648649#Word64\n+ 15497646768975084827#Word64\n $trModule\n $tcApplicativeB2\n 1#\n $tcApplicativeB1]\n-de490ec25de8684f665bca0cb71a2a6d\n+4aac118f1a79edd7b4f26a65a3806e89\n $tcApplicativeB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ad2a793451ba1d2cec69f4ce975f8fc3\n+bb41a43844490fe0300e4f8d05feaa3b\n $tcApplicativeB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcApplicativeB3]\n-b37bbdcab1db0d786b21e5a3cc4ef582\n+d48fffa80e9c28a74d53ce38dc63fb81\n $tcApplicativeB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ApplicativeB\"#]\n-f953dc8d5b36d24c0e2e7ef5c921274a\n+067fde38a85d1a127b2e6c503bdd3e2d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-1b19fe21bc12f523332490b874316c3b\n+e8f65c4291dda5909b4066205b0d3731\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-59448607c9b3d1cd8979e10eab2c2bd2\n+2f81709c770e0386fb81c1fbdb897e65\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ApplicativeB\"#]\n-65af7fb9ef4ff25139adc417b47f7be0\n+e632744fe7645099f1d46d2467fd06e6\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-62fd23dd485c83e5c0d9a89ea3be0a93\n+8a146c282b70b036e99a4f55dd9e3456\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e831de0bd01221227318ff01f360d4cb\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+16deedde4d173b65d0723755e5a93713\n type ApplicativeB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => ApplicativeB b where\n bpure :: forall (f :: k -> *). (forall (a :: k). f a) -> b f\n default bpure :: forall (f :: k -> *).\n CanDeriveApplicativeB b f f =>\n (forall (a :: k). f a) -> b f\n bprod :: forall (f :: k -> *) (g :: k -> *).\n b f -> b g -> b (Data.Functor.Product.Product f g)\n default bprod :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveApplicativeB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n-00ca77d067532d0e89a62e371fe84810\n+a3c09ed643d9e6b0b5f7775f164531c4\n type CanDeriveApplicativeB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveApplicativeB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Data.Generics.GenericN.GenericP\n 0 (b (Data.Functor.Product.Product f g)),\n@@ -1390,18 +1390,18 @@\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g))\n (Data.Generics.GenericN.RepP\n 0 (b (Data.Functor.Product.Product f g))))\n :: GHC.Types.Constraint\n-311d5995443cedd969c502ffd614f139\n+4060f178106d02a10e919c580f7f0818\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-34622e94b56e176a2b34b8a67a6855a4\n+11c04082ef1f526743411828ff5e3b0b\n bunzip ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n b (Data.Functor.Product.Product f g) -> (b f, b g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueFalse>\n@@ -1439,41 +1439,41 @@\n g)\n @g\n (bunzip1\n @k\n @f\n @g)\n eta)]\n-decd43b36f6dfa3355042a3e13a72698\n+c10b19d656fe05eeb19f7a6cb454a9fc\n bunzip1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 b -> b }]\n-71fe1f4deb8b67cc487e3d40eb3ab6d1\n+0d17ffa5995665071db47789b96f5d14\n bunzip2 ::\n forall {k} {g :: k -> *} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @g :: k -> *\n @f :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair a1 ds1 -> a1 }]\n-8ed828546c59d721d6faa4464ad47750\n+38f3994007ee30a57645303749d60354\n bzip ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n ApplicativeB b =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(A,A,1L)>,\n Unfolding: Core: \n@@ -1484,15 +1484,15 @@\n ($dApplicativeB['GHC.Types.Many] :: ApplicativeB b) ->\n ({__scc {Barbies.Internal.ApplicativeB.bzip} True True} bprod\n @k\n @b\n $dApplicativeB)\n @f\n @g]\n-4533dac19f2e4b44be72c581c4090d1e\n+bca3958211a37a502853b653649238a6\n bzipWith ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a) -> b f -> b g -> b h\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1528,15 +1528,15 @@\n @k\n @b\n $dApplicativeB\n @f\n @g\n eta1\n eta2)]\n-b2544b9a4f69672e9990c4248d54ad9c\n+0af74d4e86fd92f65a95f59ae545d30a\n bzipWith3 ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a -> i a)\n -> b f -> b g -> b h -> b i\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -1588,15 +1588,15 @@\n @b\n $dApplicativeB\n @f\n @g\n eta1\n eta2)\n eta3)]\n-63a87badbbf671305bc877f7886035a2\n+6fbf99b5bb16c09aedd72b44a835d3de\n bzipWith4 ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (j :: k -> *).\n ApplicativeB b =>\n (forall (a :: k). f a -> g a -> h a -> i a -> j a)\n -> b f -> b g -> b h -> b i -> b j\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1671,15 +1671,15 @@\n $dApplicativeB\n @f\n @g\n eta1\n eta2)\n eta3)\n eta4)]\n-03c2fc30b415a7ef7b04e0bd51a5c5a8\n+f34d0098388fb323b1de6440ab9f2f36\n gbprodDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveApplicativeB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=2),\n@@ -1937,15 +1937,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-17a8dea292c06b6cc0ccb9532409fc6c\n+43d7b125fc47cf609fb07348b0b3434f\n gbpureDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *).\n CanDeriveApplicativeB b f f =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ApplicativeT.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ApplicativeT.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.ApplicativeT [orphan module] 9066\n- interface hash: 31e127a7b3b6e2d2fc9957764f22a2d5\n- ABI hash: 37b9828a73911edc65682677beef0b01\n- export-list hash: 326dd8ed771f20a8bb5ea77e676eb73c\n- orphan hash: 7f615d9ec2bacfbe856455eecbb9df6c\n+ interface hash: 057276a220b3d20f951edbbbeec5b9fd\n+ ABI hash: a4b6dde0959b1b6fc0980131174b93d9\n+ export-list hash: fb4057e5f657bcf51e84559f4e82a422\n+ orphan hash: 8638e3c4fa72de6279c07c2994a3efe1\n flag hash: a376ee4da6356ccdc867a94c1fe11735\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 2b9d249dc274efbd43de936dca602351\n sig of: Nothing\n used TH splices: False\n@@ -23,17 +23,17 @@\n tunzip\n tzip\n tzipWith\n tzipWith3\n tzipWith4\n ApplicativeT{tprod tpure}\n CanDeriveApplicativeT\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -43,47 +43,47 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative f7fe06bbc86fe9884b13a256898eadd7\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 8265f05837c79915d0fdba71843c3b9a\n- gprod 7cf879a44333e2fb97407129639e2918\n- gpure b37eba7ec6f871e9461567cf3e8aa090\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- exports: f80df9d1a671828401e57ca77039e65f\n- FunctorT 8eecefeea9b4af10c28c6418beb8e35f\n- tmap 7daf6eec37127197117907af82691fc2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative e6ea3755d60aca77b8b3debd1a2e908f\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative a3ad5abf6940b654f465b24e4d5dfd50\n+ gprod 7e94421018041d5aa4b77514edf80363\n+ gpure ed4392f5b804dde97786aaf051945c4c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ exports: e02f5d493ca75ffd2f01042546f54905\n+ FunctorT ae5ec0f7570f82aca6f5f14b2f49b24c\n+ tmap d0b4955d5dbd43342b986bfbb6d3da5d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-9fbbc391d66baa29d09416c35c5884b4\n+3491bea51abd2edf62228f8a89c08adf\n $dmtprod ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (ApplicativeT t, CanDeriveApplicativeT t f g x) =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -93,15 +93,15 @@\n @t :: (k -> *) -> k' -> *\n ($dApplicativeT['GHC.Types.Many] :: ApplicativeT t)\n @f :: k -> *\n @g :: k -> *\n @x :: k'\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveApplicativeT t f g x) ->\n gtprodDefault @k @k' @t @f @g @x $d(%,,,%)]\n-e91805d29d5acad0879785e573c6dda8\n+6d360771f193a45299dc793354f99db8\n $dmtpure ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (x :: k').\n (ApplicativeT t, CanDeriveApplicativeT t f f x) =>\n (forall (a :: k). f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -405,15 +405,15 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-01dc94844debbc9478c39a6b09982d8c\n+5cdc1fa71854950ec6329fe2e78157b5\n $fApplicativeTTYPETYPEProduct ::\n GHC.Base.Alternative f =>\n ApplicativeT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n@@ -423,15 +423,15 @@\n @(Data.Functor.Product.Product f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fApplicativeTTYPETYPEProduct_$ctpure @f v)\n ($fApplicativeTTYPETYPEProduct_$ctprod @f v)]\n-ce563e9b5ab7385c92d59ca024f7d105\n+5944243b01129cf0b6befece0ca2aa2d\n $fApplicativeTTYPETYPEProduct_$ctprod ::\n GHC.Base.Alternative f =>\n Data.Functor.Product.Product f f1 x\n -> Data.Functor.Product.Product f g x\n -> Data.Functor.Product.Product\n f (Data.Functor.Product.Product f1 g) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -451,15 +451,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @(Data.Functor.Product.Product f1 g)\n @x\n (GHC.Base.<|> @f $dAlternative @x fl fr)\n (Data.Functor.Product.Pair @(*) @f1 @g @x gl gr) } }]\n-5fb1e3f3e1a05d572eaecd0e5f38d539\n+064228aa7be911653ec44da1637f216d\n $fApplicativeTTYPETYPEProduct_$ctpure ::\n GHC.Base.Alternative f =>\n (forall a. f1 a) -> Data.Functor.Product.Product f f1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -471,15 +471,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @x\n (GHC.Base.empty @f $dAlternative @x)\n (fa @x)]\n-59708d9df108134e2fdb0272b07afcfa\n+bf91d33c2c0601bbf61e3a89b85af4f0\n $fApplicativeTTYPETYPESum ::\n GHC.Base.Alternative f => ApplicativeT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n (v['GHC.Types.Many] :: GHC.Base.Alternative f).\n@@ -488,15 +488,15 @@\n @(Data.Functor.Sum.Sum f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Sum_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fApplicativeTTYPETYPESum_$ctpure @f v)\n ($fApplicativeTTYPETYPESum_$ctprod @f v)]\n-14a13f3764cf9de4b2c4a89d362dd966\n+dc6b79e333994acdebd0ad6c802157a3\n $fApplicativeTTYPETYPESum_$ctprod ::\n GHC.Base.Alternative f =>\n Data.Functor.Sum.Sum f f1 x\n -> Data.Functor.Sum.Sum f g x\n -> Data.Functor.Sum.Sum f (Data.Functor.Product.Product f1 g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L><1L>,\n@@ -538,28 +538,28 @@\n Data.Functor.Sum.InR gr\n -> Data.Functor.Sum.InR\n @(*)\n @f\n @(Data.Functor.Product.Product f1 g)\n @x\n (Data.Functor.Product.Pair @(*) @f1 @g @x gl gr) } }]\n-9345cf7475c5ae21d7f8cabcfe23b9c3\n+d242ca7e0242a46b1e320ec9a4264dd9\n $fApplicativeTTYPETYPESum_$ctpure ::\n GHC.Base.Alternative f =>\n (forall a. f1 a) -> Data.Functor.Sum.Sum f f1 x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 2, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @f :: * -> *\n ($dAlternative['GHC.Types.Many] :: GHC.Base.Alternative f)\n @f1 :: * -> *\n @x\n (fa['GHC.Types.Many] :: forall a. f1 a) ->\n Data.Functor.Sum.InR @(*) @f @f1 @x (fa @x)]\n-d55edacac26103d7c0e1aad4d928ea49\n+57b905f2914cac6e67b1f62309d93420\n $fApplicativeTk'k'Compose ::\n GHC.Base.Applicative f =>\n ApplicativeT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n@@ -577,15 +577,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTk'k'Compose_$ctpure @k' @f v)\n ($fApplicativeTk'k'Compose_$ctprod @k' @f v)]\n-4d54d9f401927d749f55d09ab543e9b9\n+2be7da347efc8d3c12f84d55b4fc1410\n $fApplicativeTk'k'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n GHC.Base.Applicative f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -604,15 +604,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-877754a90d74bbb2a7d0486eedf99905\n+0ad9effbc7dd95c43369cbfec8aae68d\n $fApplicativeTk'k'Compose_$ctprod ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (x :: k') (g :: k' -> *).\n GHC.Base.Applicative f =>\n Data.Functor.Compose.Compose f f1 x\n -> Data.Functor.Compose.Compose f g x\n -> Data.Functor.Compose.Compose\n f (Data.Functor.Product.Product f1 g) x\n@@ -658,15 +658,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-2e27527bd0344fd2e7ef9a2a3e5fef59\n+119a8f9b6e64e60fa8ef2f15c36f4732\n $fApplicativeTk'k'Compose_$ctpure ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (x :: k').\n GHC.Base.Applicative f =>\n (forall (a :: k'). f1 a) -> Data.Functor.Compose.Compose f f1 x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -684,15 +684,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-3a2cd8880049b167b480f0d270b7b2f2\n+ca7c5771c5239b32c943be14477f7041\n $fApplicativeTk'k'Reverse ::\n ApplicativeT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ApplicativeT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -700,15 +700,15 @@\n @Data.Functor.Reverse.Reverse\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Reverse_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fApplicativeTk'k'Reverse_$ctpure @k')\n ($fApplicativeTk'k'Reverse_$ctprod @k')]\n-d2884491187db97705f06feadbe1174f\n+284258341a4e2860d3a3f35fc1b08722\n $fApplicativeTk'k'Reverse_$ctprod ::\n forall k' (f :: k' -> *) (x :: k') (g :: k' -> *).\n Data.Functor.Reverse.Reverse f x\n -> Data.Functor.Reverse.Reverse g x\n -> Data.Functor.Reverse.Reverse\n (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -731,15 +731,15 @@\n (forall (k' :: <*>_N) (f :: *>_N) (x :: _N) (g :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N\n _R) _N)]\n-d55a31aa02d1b0631c72fb3ee773f904\n+c97e5e059ec2ef9f6961bc8a47b3138e\n $fApplicativeTk'k'Reverse_$ctpure ::\n forall k' (f :: k' -> *) (x :: k').\n (forall (a :: k'). f a) -> Data.Functor.Reverse.Reverse f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @k'\n@@ -748,15 +748,15 @@\n (fa['GHC.Types.Many] :: forall (a :: k'). f a) ->\n fa @x)\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N) (x :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)]\n-1f326a0520dc51de533cdf9622658f12\n+e62179e05016edb7b2e11ba59a8519c0\n $fGApplicativeNaturalk1k1fgRecRecRec ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t) =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -816,15 +816,15 @@\n @t\n @f\n @g\n @x\n v\n v1\n v2)]\n-016b49e778acd4c538495e6c37547833\n+fb1f9ab0d28e13017466cf65366678d3\n $fGApplicativeNaturalk1k1fgRecRecRec0 ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Applicative h, ApplicativeT t) =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -878,15 +878,15 @@\n @h\n @t\n @f\n @g\n @x\n v\n v1)]\n-da6c17ab08597d77d559ebe394fe73a5\n+afa275e1d9549e0e24df114e5d6b91a0\n $fGApplicativeNaturalk1k1fgRecRecRec0_$cgprod ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Applicative h, ApplicativeT t) =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -974,15 +974,15 @@\n _P) _N _N)]\n-626457fdff3c38ab1134e988091848cd\n+32001edc18487eed52d2f0cd87096948\n $fGApplicativeNaturalk1k1fgRecRecRec0_$cgpure ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Applicative h, ApplicativeT t, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (h (t (P 1 f) x)) (h (t f x))\n GHC.Types.~ Data.Generics.GenericN.Rec\n (h (t (P 1 g) x)) (h (t g x))) =>\n@@ -1069,15 +1069,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-98515dd4a2be2c7913582858d4c0a0b1\n+b11be7e83c148c544bc2c62832f6d421\n $fGApplicativeNaturalk1k1fgRecRecRec1 ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n ApplicativeT t =>\n Barbies.Generics.Applicative.GApplicative\n 1\n f\n@@ -1124,15 +1124,15 @@\n @k'\n @k1\n @t\n @f\n @g\n @x\n v)]\n-6e69a913c30ccb962cfc797f3789fcaa\n+0ed101a759a5087a9595eedd4a97e976\n $fGApplicativeNaturalk1k1fgRecRecRec1_$cgprod ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n ApplicativeT t =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -1205,15 +1205,15 @@\n _N\n _P) _N _N)]\n-cdfd004e8e7b06a16c1d010ddeb23463\n+aa8968226392d45f4f0fc7a52b8d15da\n $fGApplicativeNaturalk1k1fgRecRecRec1_$cgpure ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n (ApplicativeT t, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x)\n GHC.Types.~ Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x)) =>\n Data.Proxy.Proxy 1\n@@ -1287,15 +1287,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-0487f33b9fa8c53bb7f0c18972ce8576\n+b2e3b020d20e3553c320ccfdb664c0c7\n $fGApplicativeNaturalk1k1fgRecRecRec_$cgprod ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t) =>\n Data.Proxy.Proxy 1\n -> Data.Proxy.Proxy f\n@@ -1409,15 +1409,15 @@\n _P) _N _N)]\n-5e39dbe97096ed6c5be597badc466c64\n+7da61b27cd6d141ce3749e4b84cdd5f1\n $fGApplicativeNaturalk1k1fgRecRecRec_$cgpure ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Applicative h, GHC.Base.Applicative m, ApplicativeT t,\n f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (m (h (t (P 1 f) x))) (m (h (t f x)))\n@@ -1519,78 +1519,78 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-611a4c680642b46e583dd0a3836c3ca2\n+5689b5f24aa2748d958eb5b90051856a\n $tcApplicativeT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2174775567770085663#Word64\n- 7944381188582367962#Word64\n+ 5314690156032248697#Word64\n+ 3808439990830178351#Word64\n $trModule\n $tcApplicativeT2\n 2#\n $tcApplicativeT1]\n-7af8b235ee78bc6f5f264674ab51242b\n+a76a971284118ce1f46aaf1f9e1b08fe\n $tcApplicativeT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-9be4667b966a453a82e91b76d58bcaa4\n+fb6be3b7d52c2f19d27423c8def0ed26\n $tcApplicativeT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcApplicativeT3]\n-5d63451a1120a15267d7588a064c6f8b\n+a5209c0a2cd1b36c07a25e01ecfbc2a2\n $tcApplicativeT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ApplicativeT\"#]\n-b03b7f7ec41d5b4ef60ab00a10d891d9\n+3afba32b96e8348e904173cadc8abce1\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-e6c032436ee9035d9f9d8e4832b288bd\n+a8404d8876efda3f241d3b4076a270c3\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-219e1352f2543a3a3382955c79a050f4\n+811cb46b77c1decc7a101c7bd1de9ff5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ApplicativeT\"#]\n-710d6bcbe0e0380cb7af7b2f4c4362ae\n+73faedb8e11ceba8b2e2bd4760443b0c\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b45da6b034a103a97262446ca0a317ee\n+dd330928c64dcdab7d63b25a3cf59104\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-ac75f9c1033a1a0fa3ed421b0aa1a6ff\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+8c4c465730cad783db66cced9f6ad1cd\n type ApplicativeT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => ApplicativeT t where\n tpure :: forall (f :: k -> *) (x :: k').\n (forall (a :: k). f a) -> t f x\n default tpure :: forall (f :: k -> *) (x :: k').\n CanDeriveApplicativeT t f f x =>\n (forall (a :: k). f a) -> t f x\n tprod :: forall (f :: k -> *) (x :: k') (g :: k -> *).\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n default tprod :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n CanDeriveApplicativeT t f g x =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n-00ecaa286a305ab235b84972179aee06\n+862bd5012a274f82194439bb3bb2412c\n type CanDeriveApplicativeT :: forall {k} {k1}.\n ((k -> *) -> k1 -> *)\n -> (k -> *) -> (k -> *) -> k1 -> GHC.Types.Constraint\n type CanDeriveApplicativeT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Data.Generics.GenericN.GenericP\n@@ -1600,18 +1600,18 @@\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x))\n (Data.Generics.GenericN.RepP\n 1 (t (Data.Functor.Product.Product f g) x)))\n :: GHC.Types.Constraint\n-2e6bbdc728ef48d64284d8da1a5e8985\n+1248c8467ef46450430b9a8dc170b2f1\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-d03c1e036b1e7da06dd7b4fdf7efb99a\n+e77a4fef29095dc0864be8a1432cb33b\n gtprodDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (g :: k1 -> *) (x :: k2).\n CanDeriveApplicativeT t f g x =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1974,15 +1974,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-6a6d97b34e6eb4bd4e7f1795ff9d9781\n+80ee7c7cb650b01cb6ad9d6d4b3280d9\n gtpureDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (x :: k2).\n CanDeriveApplicativeT t f f x =>\n (forall (a :: k1). f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -2287,15 +2287,15 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-d7f86ef8dc97dee17e1bd03b659eecdc\n+19c9841b082e8c9d41dd4d6ca7eb20eb\n tunzip ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n ApplicativeT t =>\n t (Data.Functor.Product.Product f g) x -> (t f x, t g x)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n@@ -2340,41 +2340,41 @@\n @g\n @x\n (tunzip1\n @k\n @f\n @g)\n eta)]\n-a429b6bc4a903c8e339027c5b24276de\n+1cf91e0d8928661a308a7e5868cdd4b8\n tunzip1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 b -> b }]\n-f06958c3280c22cd4e4dfcf39484bc6f\n+acac6a17eb1b6d63eff80c58f1756ffb\n tunzip2 ::\n forall {k} {g :: k -> *} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @g :: k -> *\n @f :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair a1 ds1 -> a1 }]\n-86a7545983d440ce260903a9a0e1494e\n+243b199bba526517ade86985eff9e9ab\n tzip ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *) (x :: k')\n (g :: k -> *).\n ApplicativeT t =>\n t f x -> t g x -> t (Data.Functor.Product.Product f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(A,A,1L)>,\n@@ -2390,15 +2390,15 @@\n @k\n @k'\n @t\n $dApplicativeT)\n @f\n @x\n @g]\n-f350595e933c3e2883cd0c875f9ac195\n+654badf19e125b627d365af82896f5ce\n tzipWith ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a) -> t f x -> t g x -> t h x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -2439,15 +2439,15 @@\n @t\n $dApplicativeT\n @f\n @x\n @g\n eta1\n eta2)]\n-feb1601bb3b05f01c12569756a080f90\n+c787f5f67a26ab8a5b01d080e8d50a1c\n tzipWith3 ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (i :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a -> i a)\n -> t f x -> t g x -> t h x -> t i x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -2506,15 +2506,15 @@\n $dApplicativeT\n @f\n @x\n @g\n eta1\n eta2)\n eta3)]\n-9bc7aa1049fe89605e44d126cdee52a8\n+14a75411752014d3e5c59acd446735af\n tzipWith4 ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (h :: k -> *) (i :: k -> *) (j :: k -> *) (x :: k').\n ApplicativeT t =>\n (forall (a :: k). f a -> g a -> h a -> i a -> j a)\n -> t f x -> t g x -> t h x -> t i x -> t j x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/BareB.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/BareB.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.BareB [orphan module] 9066\n- interface hash: b3e9383560864ee9cbdf283789c307ee\n- ABI hash: 7033f6c2e9cc418f2345679854cf259e\n- export-list hash: 057ad1cac855b28dfd0964ea6392b49c\n- orphan hash: d1e4c5a003cfdc63304d27c0de386be3\n+ interface hash: 544f4df20422dd1ccc3a4bdce1d74cbc\n+ ABI hash: c3913e480fb368dab5a321a730bc1175\n+ export-list hash: 1dfc9c56dc6f274967e32628736d7d2f\n+ orphan hash: a5accd381e260c836afa3603609a76fb\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 47184b6e10fdf7c871eb89be90529266\n sig of: Nothing\n used TH splices: False\n@@ -24,58 +24,58 @@\n gbstripDefault\n BareB{bcover bstrip}\n CanDeriveBareB\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n Barbies.Internal.Wear.WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare 09933975369d3f88a687502395401290\n- exports: 5efe914a4cb0ec7fc6958e082b874fad\n- GBare 945b4ea07a87e7d0224aa958b95612ad\n- gcover 3073112efbf8ff7c6c912014adcb5096\n- gstrip e04ebf4c99787b2d169affe5b0575068\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- exports: 78c8bc7934601c506594bbc6e00d10b4\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n- WearTwo d06bb9da09839e1cb4a0a098d403587b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare 9eaf074fbaf6c299ad8370fdfcb75057\n+ exports: f2d1301649e8e0815e7e8a010693dc83\n+ GBare e05c32af4d05b0e8d79b7a6ffd5a83ea\n+ gcover eeb348f6365a0ac17a9cc2dca443d45c\n+ gstrip 549b7484240c3ce77d2612090c77d27c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ exports: 0844baf41368bc42b02e1f4080c4e399\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n+ WearTwo d957b83cc662451223c70d0fed19a0ad\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-34521cd7fd462368161fc99efec3960f\n+daa9366f18f0a62cbe7ad79a8115dc06\n $dmbcover ::\n (BareB b, CanDeriveBareB b) =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -409,15 +409,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-acdf92290291224568e1c2c192d02abe\n+e50d8d3d3c3c2f569b0a8c2b0defedce\n $dmbstrip ::\n (BareB b, CanDeriveBareB b) =>\n b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -750,15 +750,15 @@\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-557ea115f3cb8616fffe30c88261f7c1\n+60d3e415c3d11292ec3d4ea1e488ca09\n $fGBarek0RecRec ::\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))))\n@@ -790,15 +790,15 @@\n @(Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity))))\n (m (h (b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity))))\n ($fGBarek0RecRec_$cgstrip @k @h @m @b v v1 v2)\n ($fGBarek0RecRec_$cgcover @k @h @m @b v v1 v2)]\n-b4b41f00d53f517afab68c80cea7132f\n+048d1bb527727d6797e1537e46eabeae\n $fGBarek0RecRec0 ::\n (GHC.Base.Functor h, BareB b) =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity)))\n@@ -826,15 +826,15 @@\n Data.Functor.Identity.Identity)))\n @(Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity)))\n (h (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)))\n ($fGBarek0RecRec0_$cgstrip @k @h @b v v1)\n ($fGBarek0RecRec0_$cgcover @k @h @b v v1)]\n-4cdf11b1b0e3f0abc2f1b131f211d2bc\n+e81c1c5c833ac06f907ff9f77aeca7f7\n $fGBarek0RecRec0_$cgcover ::\n forall k (h :: * -> *) (b :: * -> (* -> *) -> *) (x :: k).\n (GHC.Base.Functor h, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Bare\n (P 0 Data.Functor.Identity.Identity)))\n@@ -903,15 +903,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-4bd0589bcd156c82d6983832920f3d64\n+50ea58fbc54d12bab73d7e3b3cb6bbb4\n $fGBarek0RecRec0_$cgstrip ::\n forall k (h :: * -> *) (b :: * -> (* -> *) -> *) (x :: k).\n (GHC.Base.Functor h, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (h (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity)))\n@@ -981,15 +981,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-08df76ad973a10d02703d204cadd9bf6\n+ddc141910b467f922c4f135df6d310df\n $fGBarek0RecRec1 ::\n BareB b =>\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))\n@@ -1010,15 +1010,15 @@\n (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity))\n @(Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Bare (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity))\n ($fGBarek0RecRec1_$cgstrip @k @b v)\n ($fGBarek0RecRec1_$cgcover @k @b v)]\n-e039bf3fe1e33688a96c42b3c651e3b2\n+5d0187adbbe0fb05d99ed1db250cc594\n $fGBarek0RecRec1_$cgcover ::\n forall k (b :: * -> (* -> *) -> *) (x :: k).\n BareB b =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Bare (P 0 Data.Functor.Identity.Identity))\n (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)\n@@ -1078,15 +1078,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-baf8baf379c24275aba54d033cd25120\n+18e1dbffc3dcab81c43143c9e813b212\n $fGBarek0RecRec1_$cgstrip ::\n forall k (b :: * -> (* -> *) -> *) (x :: k).\n BareB b =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (b Barbies.Internal.Wear.Covered\n (P 0 Data.Functor.Identity.Identity))\n@@ -1146,15 +1146,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-4aee7b5a546aea44637590ac913b1bc0\n+1c2ad578ebabcb23f1bc0a8763148b48\n $fGBarek0RecRec_$cgcover ::\n forall k (h :: * -> *) (m :: * -> *) (b :: * -> (* -> *) -> *)\n (x :: k).\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Bare\n@@ -1235,15 +1235,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-1c1bf6a9a7ab1612ac57f9a09ee35765\n+e47853fb63e1bd33031a0e390a998321\n $fGBarek0RecRec_$cgstrip ::\n forall k (h :: * -> *) (m :: * -> *) (b :: * -> (* -> *) -> *)\n (x :: k).\n (GHC.Base.Functor h, GHC.Base.Functor m, BareB b) =>\n Data.Proxy.Proxy 0\n -> Data.Generics.GenericN.Rec\n (m (h (b Barbies.Internal.Wear.Covered\n@@ -1324,89 +1324,89 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-cf70bf9827f927f2e6aca957d49bd251\n+5bff3291bd372309402700719db553e3\n $tc'C:BareB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4941010144831907686#Word64\n- 1802117142514650686#Word64\n+ 17369628445867202523#Word64\n+ 15273525099231623016#Word64\n $trModule\n $tc'C:BareB2\n 1#\n $tc'C:BareB1]\n-44724315a557e42ef463968a97d24100\n+664e2cd7386151fc9ed08c57dd950943\n $tc'C:BareB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-caaef38a59ff0fc77b1097deaf4c8250\n+57003f758647f959710522f6fb3a9ba4\n $tc'C:BareB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:BareB3]\n-c1ce8a5620ad4c07b4a63885655493af\n+8dfe1b363a193c7e25a61438aca96c8c\n $tc'C:BareB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:BareB\"#]\n-69ce5ee10111f5f83f3c281e49b9ebca\n+7281865974919b27ba33dd997f67662e\n $tcBareB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12408751399799494786#Word64\n- 17317989649187227099#Word64\n+ 14547949720316224678#Word64\n+ 3984888836056252279#Word64\n $trModule\n $tcBareB2\n 0#\n $tcBareB1]\n-f48b572b90268d4c8289a57be40cd106\n+232fc67e137303c06cec495e59bcd77c\n $tcBareB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-6b64d91fb84f5fcd620bcdb3ce0a4b1f\n+761d03bfeeabfa239fdb17257bd021e9\n $tcBareB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBareB3]\n-6083a67360363a582a5e85f92977a867\n+77c0cbdc7f64d66ce5905af2479d8813\n $tcBareB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"BareB\"#]\n-2a5d51af1eddfb85a2a168c5fa83fe91\n+558a196b4b91a0ff9d3f549314a138d2\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-4a27aa3d06dedb567414ee7fed14439e\n+1fcd04fdf4cd4def939132a4e839afc4\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-6ae4f6ff3c0a3a0de43c21f8e104862e\n+0ee6acbf3acebc0ccd26403f766378b4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.BareB\"#]\n-16c9a05a73cea28394eeb9c3908d9b22\n+d744b2082c413623398bd06c154dac91\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-716b5bae04f7f78cec84259c23abc769\n+8ae83cb6f8f4e4406442d380d3ae6cd5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e892f1bf62bb0f1de4c6900a9e397063\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+f15e63f5136f8d2c169b41a4366e7229\n type BareB :: (* -> (* -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB\n (b Barbies.Internal.Wear.Covered) =>\n BareB b where\n bstrip :: b Barbies.Internal.Wear.Covered\n Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n@@ -1415,32 +1415,32 @@\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n bcover :: b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n default bcover :: CanDeriveBareB b =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n-b8a5ffbae33709a543685f4c2d3aeb53\n+6dbb7b64c5ac0fc4b933b1ddc3b02238\n type CanDeriveBareB :: (* -> (* -> *) -> *) -> GHC.Types.Constraint\n type CanDeriveBareB b =\n (Data.Generics.GenericN.GenericP\n 0 (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity),\n Data.Generics.GenericN.GenericP\n 0 (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity),\n Barbies.Generics.Bare.GBare\n 0\n (Data.Generics.GenericN.RepP\n 0 (b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity))\n (Data.Generics.GenericN.RepP\n 0 (b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity)))\n :: GHC.Types.Constraint\n-9368e2556f989b081020a1a0e6fd222a\n+8d663956584db6991c7008e9f47805d2\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-457d04fa95b40feadc0d03c1a6be16bc\n+82d8091afcde3f046554d1a3aa013ac7\n bcoverWith ::\n BareB b =>\n (forall a. a -> f a)\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -1484,15 +1484,15 @@\n Data.Functor.Identity.Identity\n []\n = bcover @b $dBareB\n } in\n \\ (x['GHC.Types.Many] :: b Barbies.Internal.Wear.Bare\n Data.Functor.Identity.Identity) ->\n f1 (g x)]\n-e4a248fbf92dcb57cc8e7de7b59fafbe\n+834713909fe7cf3a343b98d754fc398d\n bstripFrom ::\n BareB b =>\n (forall a. f a -> a)\n -> b Barbies.Internal.Wear.Covered f\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -1536,15 +1536,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R))\n } in\n \\ (x['GHC.Types.Many] :: b Barbies.Internal.Wear.Covered\n f) ->\n f1 (g x)]\n-25585011fddb8745f4b609947dfa020c\n+3fc83f42bfec4e5f9e249d1b666043ea\n gbcoverDefault ::\n CanDeriveBareB b =>\n b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1878,15 +1878,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-95ee297556e8e0bf8eb4c463546cfb62\n+21a538133dc5a786cc3243a78b9ec772\n gbstripDefault ::\n CanDeriveBareB b =>\n b Barbies.Internal.Wear.Covered Data.Functor.Identity.Identity\n -> b Barbies.Internal.Wear.Bare Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Inline: (sat-args=0),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsB.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsB.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.ConstraintsB [orphan module] [family instance module] 9066\n- interface hash: 0ab7bd3fa2e05ed636dffcd783f2c7d2\n- ABI hash: c915225ce12dec07b484cb0e6c8bc95f\n- export-list hash: 62d29be84a756dd8aa3183dad2a1d146\n- orphan hash: 1de829ae07c50ed216963d70f2aaa897\n+ interface hash: a1bf2228caed995a9bc8d6834033edea\n+ ABI hash: cb077425686d4bb620c4f51549182b9f\n+ export-list hash: 805180e0c2ac5e4eb5bae7572cee9a36\n+ orphan hash: 1c555dc8b9de72105978809702d8274c\n flag hash: 618e92f46b816a087b8db508ea41f0f7\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 16c69e23b69cf160ffe86c7b9b352b22\n sig of: Nothing\n used TH splices: False\n@@ -31,81 +31,81 @@\n &\n AllBF\n CanDeriveConstraintsB\n ConstraintsB{AllB baddDicts}\n GAllRepB\n TagSelf0\n TagSelf0'\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Data.Generics.GenericN Control.Applicative Control.Arrow\n Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints d745d9d282b4b8b1e7a00feaec72f736\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll a97385b661b56e3be3899c1ab3c9b2ee\n- GConstraints 18ae239fe2e28b351bd84011ef359ae0\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- gaddDicts 0fd53bed8de376636929f15bc941e39d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- exports: 97f76e0a31067bdc9623d74dfb179978\n- ApplicativeB e831de0bd01221227318ff01f360d4cb\n- bprod faa80cda7d5ebacb4d59ff2581e950e5\n- bpure 8f62c3bd94a72cb3e7cb88067b7fc1f0\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts 11d9cab4807894b2baa78a0cba8e7494\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict 1ef5ac9bdc38d1886b55376c71cb27fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- exports: a8196cc20ebeb66df453e15c78d677c9\n- TraversableB 276504176defd37fdae4e05d479e9cc6\n- btraverse 44638623568081a176cfc6fcc0804dca\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN 1b4266d07741206f7b8cba4fa8905e56\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepN ecc6da1ae57d58d707db7b6fe2471abc\n- fromN b5acbe8e27cbdbce5393ad91401fd07d\n- toN c48b8696dd67a7208550e7d178002838\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 39afe276e15aa255e48d08c5ba712f59\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll a7ee244c89fc411256c161efeeeaa7f7\n+ GConstraints 6ccfe857f29008381ec19da46c2e9db1\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ gaddDicts 0b704e4ee989184ba8fe720d1fd6be92\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ exports: 5b192dab08a0491faf09373600f4b2cd\n+ ApplicativeB 16deedde4d173b65d0723755e5a93713\n+ bprod 8e131e15a5f98601851c0b27ac4241c0\n+ bpure e8e39b317ff94f27399a39d7e16b86a9\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 0c882df337c0ddb4b93d319e9df15dee\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 501619b73143cb187d749df6455ffe8e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ exports: 6564e0103587f68d905c5ccbec42ca55\n+ TraversableB b16eda90a135f995e76c64fdf076422a\n+ btraverse 2d1803bee429e065a9d4f13a0e12ab46\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3d9f2f2677a23aa95c2fa5da9877e31f\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepN e96c33128fc679fb69061e7d0ebf0dc0\n+ fromN a5637766ae3ff5f72edb992d534ba56a\n+ toN 78f9321b8015bdafeadc556b0d4f5810\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-01001f8e3d43172bbed88478c2e1a514\n+2e3021362e9afa4af3bf7d6057660dee\n $dmbaddDicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (ConstraintsB b, CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -343,15 +343,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-624346ee2211d05cca5a182f265bc4a2\n+dca31bc9e7b2f2c8ae67d5a7486f3c88\n $f&kcda ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k)\n (d :: k -> GHC.Types.Constraint).\n (c a, d a) =>\n (&) c d a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -359,15 +359,15 @@\n Unfolding: DFun: @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n @d :: k -> GHC.Types.Constraint\n (v['GHC.Types.Many] :: c a)\n (v1['GHC.Types.Many] :: d a).\n @k @c @d @a v v1]\n-e5ce4aa5f8917cef25f54373b5e25be1\n+989f028e0edcbf499a77cbbc4ecf6dc6\n $fConstraintsBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (GHC.Base.Functor f, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n@@ -385,15 +385,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkCompose_$cbaddDicts @k @f @b v v1)]\n-1dafba111ace8dc4c894507f33585d12\n+14fdbe0d39efcce6b06e2e7053dad2d6\n $fConstraintsBkCompose1 ::\n forall {k} {f :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (GHC.Base.Functor f, ConstraintsB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1 -> f (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -419,15 +419,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-2e043589ec1a1e0d35db59d53407b659\n+53fec02a072f18d35bec7476c26f7341\n $fConstraintsBkCompose_$cbaddDicts ::\n forall k (f :: * -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f1 :: k -> *).\n (GHC.Base.Functor f, ConstraintsB b,\n AllB c (Data.Functor.Compose.Compose f b)) =>\n Data.Functor.Compose.Compose f b f1\n -> Data.Functor.Compose.Compose\n@@ -480,28 +480,28 @@\n *>_N\n _R\n _N\n _N))]\n-dc149e53bd2ab22686c73e7c97bb10ba\n+04654c25e7bac5dfe8561070f4c88345\n $fConstraintsBkConst :: ConstraintsB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ConstraintsB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkConst_$cbaddDicts @k @a)]\n-0871ed5c70be087843c09a1fc5796b4f\n+a7af3e27a4b1e42f1b361a3ff46d5c80\n $fConstraintsBkConst_$cbaddDicts ::\n forall k a (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n AllB c (Data.Functor.Const.Const a) =>\n Data.Functor.Const.Const a f\n -> Data.Functor.Const.Const\n a (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -523,15 +523,15 @@\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0]\n *>_N\n _R\n _P))]\n-c27a6ba310d649b7193bd1dcf0a2383e\n+a95fc83f1b7d827a4748eea7dc524afa\n $fConstraintsBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ConstraintsB a, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -545,15 +545,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fConstraintsBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkProduct_$cbaddDicts @k @a @b v v1)]\n-636e54d8fbbaed7be753af86011c416e\n+b99f543c1311eb27bafe03a14b252e59\n $fConstraintsBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ConstraintsB a, ConstraintsB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -587,15 +587,15 @@\n (($p1ConstraintsB @k @b $dConstraintsB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-7e3c31e3b9a3ba79b5c3cf9bf2e924e2\n+8fe08aa670e3960243c2ea7cc78cd3fd\n $fConstraintsBkProduct_$cbaddDicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n (ConstraintsB a, ConstraintsB b,\n AllB c (Data.Functor.Product.Product a b)) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product\n@@ -641,28 +641,28 @@\n @c\n @f\n (GHC.Classes.$p1(%,%)\n @(AllB c a)\n @(AllB c b)\n irred `cast` (Sub (D:R:AllBkcProduct[0] _N _N _N _N)))\n y) }]\n-d66f6f48d6c424600d3528b187f7d874\n+d7d66474cfbb1665617a8211b095ace0\n $fConstraintsBkProxy :: ConstraintsB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ConstraintsB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkProxy_$cbaddDicts @k)]\n-c94c7bfc606f7f821eeed0d62b5ccc92\n+c3f2a08f05a22917cde73feac8a81165\n $fConstraintsBkProxy_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n AllB c Data.Proxy.Proxy =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -672,15 +672,15 @@\n @c :: k -> GHC.Types.Constraint\n @f :: k -> *\n (irred['GHC.Types.Many] :: AllB c Data.Proxy.Proxy)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n Data.Proxy.Proxy\n @(k -> *)\n @(Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)]\n-43d81a5c49542c31efdb82ebea368b4e\n+b8d2b460145142ed868c8e87600bbd63\n $fConstraintsBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ConstraintsB a, ConstraintsB b) =>\n ConstraintsB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -694,15 +694,15 @@\n @k\n @(Data.Functor.Sum.Sum a b)\n ($fConstraintsBkSum1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fConstraintsBkSum_$cbaddDicts @k @a @b v v1)]\n-43f42d29a754340c739207727985cb58\n+3bc8447a961547e941a93e470dfe9471\n $fConstraintsBkSum1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (ConstraintsB a, ConstraintsB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -741,15 +741,15 @@\n (($p1ConstraintsB @k @b $dConstraintsB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n x) }]\n-fc001597cba9153f6354e3342f0bf9c2\n+72bb001e55a83b18c3ff3bf5b255158c\n $fConstraintsBkSum_$cbaddDicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n (ConstraintsB a, ConstraintsB b,\n AllB c (Data.Functor.Sum.Sum a b)) =>\n Data.Functor.Sum.Sum a b f\n -> Data.Functor.Sum.Sum\n@@ -801,15 +801,15 @@\n @c\n @f\n (GHC.Classes.$p1(%,%)\n @(AllB c a)\n @(AllB c b)\n irred `cast` (Sub (D:R:AllBkcSum[0] _N _N _N _N)))\n x) }]\n-c071e3cb312150ffac3afed28125d836\n+b2ba74e85214da0738d954639f2488e7\n $fGConstraintskFUNk20cfOtherRecRec ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *).\n (ConstraintsB b, AllB c b) =>\n Barbies.Generics.Constraints.GConstraints\n 0\n c\n@@ -852,15 +852,15 @@\n _N))]\n-0cdfe73b1d3cb868e4be8cf2dd7040d7\n+eac39b330058fa87ef560f71b41a0535\n $fGConstraintskFUNk20cfOtherRecRec_$cgaddDicts ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *) (x :: k2).\n (ConstraintsB b, AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -922,15 +922,15 @@\n (P 0\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c)\n f))>_P) _N _N)]\n-179e0d3d218ff0c6b8af24ff3d384c2c\n+614f3fbd527966f295269b7efa3f037a\n $fGConstraintskFUNk20cfSelfRecRec ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *).\n (ConstraintsB b, AllB c b) =>\n Barbies.Generics.Constraints.GConstraints\n 0\n c\n@@ -973,15 +973,15 @@\n _N))]\n-d175b475f99d59b01b659822ee846097\n+c7fc2a48196f14c8d74aa431bd346289\n $fGConstraintskFUNk20cfSelfRecRec_$cgaddDicts ::\n forall k k2 (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *) (b' :: (k -> *) -> *) (x :: k2).\n (ConstraintsB b, AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -1043,125 +1043,125 @@\n (P 0\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c)\n f))>_P) _N _N)]\n-6ad532b0cdc3e4175729d36d4a038a4a\n+d791e53b546c637b960ef4317094156a\n $tc& :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 9916593666458410452#Word64\n- 6421382771094541799#Word64\n+ 13020177785925179189#Word64\n+ 13045564775080930199#Word64\n $trModule\n $tc&2\n 1#\n $tc&1]\n-664fe3a32555d4ba5e59d5866ac1ea8f\n+0683cdde772e86d7fec7660a89d46792\n $tc&1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-870dfb418baa49f35a25e6fd0c2b791e\n+9c3f28f3c76ac7900b65d4af5f178608\n $tc&2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc&3]\n-ccf50e19a2c406c7c61edf2717476667\n+d7ee572e151fa2081ce8cb0b3e6be61e\n $tc&3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"&\"#]\n-74217d3c45e605cdfd82405f4e52b32b\n+70be536031de29ef62af06c0461269fb\n $tc'C:& :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 474288608462590941#Word64\n- 9955219644725953820#Word64\n+ 13600891077135783734#Word64\n+ 1264298178773356223#Word64\n $trModule\n $tc'C:&2\n 4#\n $tc'C:&1]\n-f86d2f8f289d0adfbad0171291a47937\n+352019ac8b7e9b04b5b2516248940c78\n $tc'C:&1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-72906164755f082c1d25c9f36cfc301e\n+00fc86b3afd83e622a0de74ef76b3862\n $tc'C:&2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:&3]\n-2e1cc2748acde679e3999f4d3ef0fcf8\n+7321bde29f98a1a3a9b8490234e57b5f\n $tc'C:&3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:&\"#]\n-777a7956bdcb8bd05f7f53a72a665edd\n+c68ec15afb5c1db6204b07410cd105ee\n $tcConstraintsB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17562922986110815955#Word64\n- 3041427980261312880#Word64\n+ 10331265717288792012#Word64\n+ 5256121533431306349#Word64\n $trModule\n $tcConstraintsB2\n 1#\n $tcConstraintsB1]\n-9dc7264d6836117c057abd9543313c55\n+de6fa0bfb5a16ab6cd9ca02253e7e04c\n $tcConstraintsB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-dba5d75f96a06700974ed15154137856\n+716e21701fce84b6cfcffd19a567e2e7\n $tcConstraintsB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcConstraintsB3]\n-4866f9d34e93649c69921c3e01a25a74\n+99fee2e27e393d3636e342854147262a\n $tcConstraintsB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ConstraintsB\"#]\n-ba979df07ab192ca0d94fc0553d5a406\n+7bc93d5d8d078050ff07153c920cca55\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-60f8ed0be815a1363491b6e0b44f29f8\n+a01b20b0b1b6abf6eb979966ecd5089e\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-ccf52b1159d8028d0f6d8a77c05012ca\n+ce03d08066a768b265ffa39023a5bf26\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ConstraintsB\"#]\n-f91611ee3094818f510904066ad22ffa\n+293b354515c26af92b28ef00562774d2\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-5481a219b476509eaf34af9d4a7dd7ec\n+2e3299417754caf3098a089832e07228\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-b4981f1f879e533cf698bb596a0c96e2\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+262e3f2037fcd8d28cf63dfb107609ac\n type (&) :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> (k -> GHC.Types.Constraint) -> k -> GHC.Types.Constraint\n class (c a, d a) => (&) c d a\n-2852bbf285ab6932b0e4764b71b81856\n+63bb86e4a6c471b3a0fb28f25103dd36\n type AllBF :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> ((k1 -> *) -> *) -> GHC.Types.Constraint\n type AllBF c f b =\n AllB (Barbies.Internal.Dicts.ClassF c f) b :: GHC.Types.Constraint\n-f931576f2ea4246945237e059a0faf6b\n+5011a4fbb768bb0b28841f32170e943a\n type CanDeriveConstraintsB :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveConstraintsB c b f =\n (Data.Generics.GenericN.GenericN (b f),\n Data.Generics.GenericN.GenericN\n (b (Data.Functor.Product.Product\n@@ -1174,15 +1174,15 @@\n f\n (GAllRepB b)\n (Data.Generics.GenericN.RepN (b f))\n (Data.Generics.GenericN.RepN\n (b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))))\n :: GHC.Types.Constraint\n-dc18dd2fb15b81c31fdce03ebb848f0f\n+0e5c16bae977600323d72f12d780df0a\n type ConstraintsB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => ConstraintsB b where\n type AllB :: forall k.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> GHC.Types.Constraint\n type family AllB c b open\n@@ -1194,56 +1194,56 @@\n (Barbies.Internal.Dicts.Dict c) f)\n default baddDicts :: forall (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n-518487261b530d2f3661bfdad892f766\n+cd470aef3996272b190809fe93457629\n axiom D:R:AllBkcCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Compose.Compose f b) = AllB c b\n-6f1c33e5b265e82022580ffd0e5a4979\n+1347dddb168fd4ed8cad65e71e659ebd\n axiom D:R:AllBkcConst ::\n forall k a (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Const.Const a) = () :: Constraint\n-5ef6770f2f24feaf45d59ee279147084\n+796b395a224a9bd0742f61b4927dc163\n axiom D:R:AllBkcProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Product.Product a b) = (AllB c a, AllB c b)\n-cd249a1bd4627660860ec1fe0efaf051\n+e1e49ddcaccc2464d229a8fc8373b932\n axiom D:R:AllBkcProxy ::\n forall k (c :: k -> GHC.Types.Constraint).\n AllB c Data.Proxy.Proxy = () :: Constraint\n-1cfefe61973cd8de76787e2de01a15d8\n+a727d1723a21593298aa5251b3e32c71\n axiom D:R:AllBkcSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n AllB c (Data.Functor.Sum.Sum a b) = (AllB c a, AllB c b)\n-8638d1f99c0848d21386500d682be52e\n+1bee922704d2c14975604345541ed38c\n axiom D:R:GAllk10cOther ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint)\n (b' :: (k2 -> *) -> *) (b :: (k1 -> *) -> *).\n Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Generics.Constraints.Other\n (b' (P 0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))\n = AllB c b\n-040b54bba8f0757a487dd672897073c2\n+dcea00efac0d86b50a3e44453a7c4afb\n axiom D:R:GAllk10cSelf ::\n forall k1 k2 k3 (c :: k1 -> GHC.Types.Constraint)\n (b' :: (k2 -> *) -> *) (b :: (k3 -> *) -> *).\n Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Generics.Constraints.Self\n (b' (P 0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))\n = () :: Constraint\n-f52b0a7c58c0f891a9213bfc76520d3b\n+1c565c8588ea72023a489935275905f4\n axiom D:R:TagSelf0' ::\n forall kf (b :: kf -> *) mt (m :: GHC.Generics.Meta) (s :: * -> *).\n TagSelf0' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf0' b s)\n forall kf (b :: kf -> *) (l :: * -> *) (r :: * -> *).\n TagSelf0' b (l GHC.Generics.:+: r)\n = TagSelf0' b l GHC.Generics.:+: TagSelf0' b r\n@@ -1257,28 +1257,28 @@\n forall kf (b :: kf -> *) x y.\n TagSelf0' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.V1 = GHC.Generics.V1\n-277cdc2c0f11943cec79057ddef744d4\n+4b3474a88e083762e3a70813269e0f11\n type GAllRepB :: forall {k}. ((k -> *) -> *) -> * -> *\n type GAllRepB b = TagSelf0 b :: * -> *\n-531e420141742a483ad3f2f9c3b992df\n+352bd6c4a2d8a671e116f35b86938fae\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-4285e3ff55e5e10fe45a26bd4fcfaca7\n+34e42843412c077b2903b8c02bf24b3a\n type TagSelf0 :: forall {k}. ((k -> *) -> *) -> * -> *\n type TagSelf0 b =\n TagSelf0'\n (Data.Generics.GenericN.Indexed b 1)\n (Data.Generics.GenericN.RepN (b Barbies.Generics.Constraints.X))\n :: * -> *\n-bcb76155453544693ac844834859f364\n+d94c1a5683b7a21f1a8f39c49da78cb7\n type TagSelf0' :: forall kf. (kf -> *) -> (* -> *) -> * -> *\n type family TagSelf0' b repbf where\n forall kf (b :: kf -> *) mt (m :: GHC.Generics.Meta) (s :: * -> *).\n TagSelf0' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf0' b s)\n forall kf (b :: kf -> *) (l :: * -> *) (r :: * -> *).\n TagSelf0' b (l GHC.Generics.:+: r)\n@@ -1294,15 +1294,15 @@\n TagSelf0' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf (b :: kf -> *).\n TagSelf0' b GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:TagSelf0'\n-eb562e059c0b85eb1b87b13a0dd3252a\n+e07f5a7ebb838629173d9923292efbda\n bdicts ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *).\n (ConstraintsB b, Barbies.Internal.ApplicativeB.ApplicativeB b,\n AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1339,30 +1339,30 @@\n (Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy\n @k)))]\n-df0469502f2cb597afaef1f210e0460d\n+fd9bec55821a7b6fff92e0e47132cbe2\n bdicts1 ::\n forall {k} {c :: k -> GHC.Types.Constraint} {a :: k}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a\n -> Barbies.Internal.Dicts.Dict c a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(L),A)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a) ->\n case ds of wild { Data.Functor.Product.Pair c1 ds1 -> c1 }]\n-8fdb140fabce3bf6ad1f2739646317d8\n+10664cc3bb59672088e1f9e7b5901501\n bfoldMapC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *) m\n (f :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB b, ConstraintsB b,\n AllB c b, GHC.Base.Monoid m) =>\n (forall (a :: k). c a => f a -> m) -> b f -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1432,15 +1432,15 @@\n irred\n b1))\n `cast`\n ( f a -> m>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n <*>_N _R _P)]\n-bdd35a7e14d54b9b1575987d0382e090\n+e9b37dcfce08040e31146f6b7b8674d2\n bmapC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (AllB c b, ConstraintsB b) =>\n (forall (a :: k). c a => f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1483,15 +1483,15 @@\n @k\n @b\n $dConstraintsB\n @c\n @f\n irred\n eta1)]\n-463212406bd01ecda8db986af75227fd\n+67368e786413af9677c05a4fe1067921\n bmempty ::\n forall {k} (f :: k -> *) (b :: (k -> *) -> *).\n (AllBF GHC.Base.Monoid f b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n b f\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1530,15 +1530,15 @@\n @(Barbies.Internal.Dicts.ClassF\n GHC.Base.Monoid\n f)\n @b\n $dConstraintsB\n $dApplicativeB\n irred)]\n-5cdd9d019b80ba3e3021ad9e03e4d06c\n+92cb7096870d23db6e961763b64ee68c\n bmempty1 ::\n forall {k} {f :: k -> *} {a :: k}.\n Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f) a\n -> f a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Unfolding: Core: \n@@ -1555,15 +1555,15 @@\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N\n _N\n _N\n _N\n _N) }]\n-d87a8a078ca1bb1cba753e8896b062dc\n+a370fb71249c97e99513b1f6d3e55713\n bpureC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (b :: (k -> *) -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1599,15 +1599,15 @@\n (bdicts\n @k\n @c\n @b\n $dConstraintsB\n $dApplicativeB\n irred)]\n-0c7fa01290302656c2c2336197cde099\n+ed469f93d8768c1e1efcc0e74f86d74e\n btraverseC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (e :: * -> *).\n (Barbies.Internal.TraversableB.TraversableB b, ConstraintsB b,\n AllB c b, GHC.Base.Applicative e) =>\n (forall (a :: k). c a => f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1650,15 +1650,15 @@\n @k\n @b\n $dConstraintsB\n @c\n @f\n irred\n b1)]\n-4bbaa65bed1c3a8013ead5fd1cfae5a8\n+fb97dfb54d0e016efc07adbe405ebdc6\n bzipWith3C ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *) (i :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a)\n -> b f -> b g -> b h -> b i\n@@ -1756,15 +1756,15 @@\n @(Data.Functor.Product.Product\n (Data.Functor.Product.Product\n f\n g)\n h)\n irred\n eta)]\n-74930d6ff6579d7f049bebed51131c30\n+93646da27a6ecb575b9979eba8a98445\n bzipWith4C ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *) (i :: k -> *)\n (j :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a -> j a)\n@@ -1885,15 +1885,15 @@\n (Data.Functor.Product.Product\n f\n g)\n h)\n i)\n irred\n eta)]\n-c8bd0d3ffccf02d14b0e98a2ac4957c1\n+882709786427a2557e9b9ec6b5f9f691\n bzipWithC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (h :: k -> *).\n (AllB c b, ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b) =>\n (forall (a :: k). c a => f a -> g a -> h a) -> b f -> b g -> b h\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n@@ -1968,15 +1968,15 @@\n $dConstraintsB\n @c\n @(Data.Functor.Product.Product\n f\n g)\n irred\n eta)]\n-64e262a5347fef431698cc01cca73377\n+836cf3c4d2a75f54b7f52bc803358105\n gbaddDictsDefault ::\n forall {k} (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (CanDeriveConstraintsB c b f, AllB c b) =>\n b f\n -> b (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/ConstraintsT.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/ConstraintsT.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.ConstraintsT [orphan module] [family instance module] 9066\n- interface hash: 06a556d920020834d69a3d6d1a5a47e0\n- ABI hash: b740860c90bc5069368a1402d8ba35ea\n- export-list hash: ff64c12f85a58ce210c289bc5f38b4b0\n- orphan hash: f2074b88ef23b568250c13084724ad38\n+ interface hash: cc751b9493276b3fb53ec3058e76b012\n+ ABI hash: d1df5ef962f0b55196afb59b42e0f1da\n+ export-list hash: ed62ac4a4eb5e94b8facce81e2b4a838\n+ orphan hash: 51034e2441a2065b4f8ecf891a20a322\n flag hash: 47902a655b5a8eeeeb64c2b66e53464a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 111967e97f0a1271387d0135c2956f5a\n sig of: Nothing\n used TH splices: False\n@@ -30,20 +30,20 @@\n tzipWithC\n AllTF\n CanDeriveConstraintsT\n ConstraintsT{AllT taddDicts}\n GAllRepT\n TagSelf1\n TagSelf1'\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeT Barbies.Internal.FunctorT\n Barbies.Internal.TraversableT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Data.Generics.GenericN Control.Applicative Control.Arrow\n@@ -55,63 +55,63 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints d745d9d282b4b8b1e7a00feaec72f736\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll a97385b661b56e3be3899c1ab3c9b2ee\n- GConstraints 18ae239fe2e28b351bd84011ef359ae0\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- Y ba6a1ba68e95cb981888219d3edc670b\n- gaddDicts 0fd53bed8de376636929f15bc941e39d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT 37b9828a73911edc65682677beef0b01\n- exports: 326dd8ed771f20a8bb5ea77e676eb73c\n- ApplicativeT ac75f9c1033a1a0fa3ed421b0aa1a6ff\n- tprod 836c430f592da5bade76b63a1cf2dc58\n- tpure d70eae245e3327d8eee46b48631b6e4c\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts 11d9cab4807894b2baa78a0cba8e7494\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict 1ef5ac9bdc38d1886b55376c71cb27fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- exports: f80df9d1a671828401e57ca77039e65f\n- FunctorT 8eecefeea9b4af10c28c6418beb8e35f\n- tmap 7daf6eec37127197117907af82691fc2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 6d9f71dcdc22d5d3261927c7c3f0afd5\n- exports: 24f5ff092cfd60d1c33d22f7bfc60097\n- TraversableT e7c67190d7e0b7e757119c341317ca7c\n- ttraverse 52a07542ffc301896e358aebbb2830d3\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN 1b4266d07741206f7b8cba4fa8905e56\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepN ecc6da1ae57d58d707db7b6fe2471abc\n- Zip 78f93d71df1aa24b758da222fa746749\n- fromN b5acbe8e27cbdbce5393ad91401fd07d\n- toN c48b8696dd67a7208550e7d178002838\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 39afe276e15aa255e48d08c5ba712f59\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll a7ee244c89fc411256c161efeeeaa7f7\n+ GConstraints 6ccfe857f29008381ec19da46c2e9db1\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ Y d1ab14839ebc0a3f1df64062aa572cc4\n+ gaddDicts 0b704e4ee989184ba8fe720d1fd6be92\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT a4b6dde0959b1b6fc0980131174b93d9\n+ exports: fb4057e5f657bcf51e84559f4e82a422\n+ ApplicativeT 8c4c465730cad783db66cced9f6ad1cd\n+ tprod f7a3c13f2f2048c22a31a51a529488c9\n+ tpure 18e1079f018128459a0a8b55ce7b774e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 0c882df337c0ddb4b93d319e9df15dee\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 501619b73143cb187d749df6455ffe8e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ exports: e02f5d493ca75ffd2f01042546f54905\n+ FunctorT ae5ec0f7570f82aca6f5f14b2f49b24c\n+ tmap d0b4955d5dbd43342b986bfbb6d3da5d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 70a0f6bb8ee700f78b9077b3af018bc8\n+ exports: e6c541e77f859c5116aa0273fe952d3a\n+ TraversableT 0d4893fb3ceb3c7a5413bd1c7de7657c\n+ ttraverse 0b7ab5f0b9eafcdfa92c0611d78a7459\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3d9f2f2677a23aa95c2fa5da9877e31f\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepN e96c33128fc679fb69061e7d0ebf0dc0\n+ Zip d86c23e87aa7cf6ff0da40771f7e9b4d\n+ fromN a5637766ae3ff5f72edb992d534ba56a\n+ toN 78f9321b8015bdafeadc556b0d4f5810\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-8a11ef296126d56bf190d2005a56dad7\n+f2fb598f61638b8ec6cc6ad1278c8ed7\n $dmtaddDicts ::\n forall kl kr (t :: (kl -> *) -> kr -> *)\n (c :: kl -> GHC.Types.Constraint) (f :: kl -> *) (x :: kr).\n (ConstraintsT t, CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -389,15 +389,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-2a297fc2570d84071e1b66a516a0f26c\n+064ebc92a37a12e1845b71b4087fcbeb\n $fGConstraintskFUNk21cfOtherRecRec ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2).\n (ConstraintsT t, AllT c t) =>\n Barbies.Generics.Constraints.GConstraints\n 1\n@@ -451,15 +451,15 @@\n (P 1\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y))\n (t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n y)>_N))]\n-fe3acab5a3b4175ccf7a69767f7cf748\n+66093ec5a1bfa6fe1d420ccdffa4aff5\n $fGConstraintskFUNk21cfOtherRecRec_$cgaddDicts ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2) (x :: k3).\n (ConstraintsT t, AllT c t,\n Barbies.Generics.Constraints.GAll\n 1\n@@ -534,15 +534,15 @@\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y)>_P) _N _N)]\n-de1d0cb1ddfec8ab6209f7ac97549fb1\n+2a95c6dbfb057040daa89f82013d1639\n $fGConstraintskFUNk21cfSelfRecRec ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2).\n (ConstraintsT t, AllT c t) =>\n Barbies.Generics.Constraints.GConstraints\n 1\n@@ -596,15 +596,15 @@\n (P 1\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y))\n (t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n y)>_N))]\n-78c054c7212baf7c4813889b971175d3\n+3de9de05dc438ba917b768fb135bf5a4\n $fGConstraintskFUNk21cfSelfRecRec_$cgaddDicts ::\n forall k1 k2 k3 (t :: (k1 -> *) -> k2 -> *)\n (c :: k1 -> GHC.Types.Constraint) (f :: k1 -> *)\n (t' :: (k1 -> *) -> k2 -> *) (y :: k2) (x :: k3).\n (ConstraintsT t, AllT c t,\n Barbies.Generics.Constraints.GAll\n 1\n@@ -679,70 +679,70 @@\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f))\n (P 0 y)>_P) _N _N)]\n-61c015bbf3be06b6783680111bcd5c82\n+ca6d9ec65b90f7d34a1d20630af5fee4\n $tcConstraintsT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15333559720734858182#Word64\n- 12061792654737755711#Word64\n+ 2767450067758763371#Word64\n+ 17292975853419185995#Word64\n $trModule\n $tcConstraintsT2\n 2#\n $tcConstraintsT1]\n-0a09772adfc916ceae71f7bd9058e196\n+190809f3ed8048fa153489b6fa75fbfd\n $tcConstraintsT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-5ff79e773a396c0a411025cc6390c627\n+41556bb7c44859b01bdd9d29acaa8edd\n $tcConstraintsT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcConstraintsT3]\n-88b5dd52c5a0f741b267fb61a450a4cd\n+ec9927f51a4069f53384d9d0ce4dbbeb\n $tcConstraintsT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ConstraintsT\"#]\n-64d782e080a13bf954a79ff816264599\n+287ca37f539e26ad5636347f6345a58d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f11c65a55e9e5f45212da4a6d87888d5\n+2c4ad8d4716009bf864242f737496946\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-cd560629d054fb8d93359ac9f0f6c6dd\n+ed263a5341283fee6bade90d758175ea\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.ConstraintsT\"#]\n-da2ba0b1f84f5753c41a6d8d576e12d2\n+bf8ca1e6f3caab6311f4e119a0a8330b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-93ec030b3540572a19f4fa25862f6483\n+d9edc351a5c28dd0cfc919606145d972\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-dff074ee18166a22f4f8f47ecb3e6f9e\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+c91b40bc5df4557bc150947824e6d65b\n type AllTF :: forall {k} {k1} {kl} {kr}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n type AllTF c f t =\n AllT (Barbies.Internal.Dicts.ClassF c f) t :: GHC.Types.Constraint\n-bea6cbec129f88280a48b822c3dd34b3\n+7b853f64819e42fcab37285301c567ff\n type CanDeriveConstraintsT :: forall {k} {kg}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> kg -> *) -> (k -> *) -> kg -> GHC.Types.Constraint\n type CanDeriveConstraintsT c t f x =\n (Data.Generics.GenericN.GenericN (t f x),\n Data.Generics.GenericN.GenericN\n (t (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n@@ -755,15 +755,15 @@\n f\n (GAllRepT t)\n (Data.Generics.GenericN.RepN (t f x))\n (Data.Generics.GenericN.RepN\n (t (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n x)))\n :: GHC.Types.Constraint\n-63bcc668eaa4de0e771fce96e43c496c\n+d50d1d4be2b903724d6bf2baa5481d3f\n type ConstraintsT :: forall kl kr.\n ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => ConstraintsT t where\n type AllT :: forall {kl} {kr} k.\n (k -> GHC.Types.Constraint)\n -> ((kl -> *) -> kr -> *) -> GHC.Types.Constraint\n type family AllT c t open\n@@ -778,37 +778,37 @@\n default taddDicts :: forall (c :: kl -> GHC.Types.Constraint)\n (f :: kl -> *) (x :: kr).\n (CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n x\n-794e459882c6f6fd156bae27be1001aa\n+7e49c35bf37f49039b3f002dbf8c15ac\n axiom D:R:GAllk11cOther ::\n forall k1 k2 k3 kl kr (c :: k1 -> GHC.Types.Constraint)\n (t' :: (k2 -> *) -> k3 -> *) (t :: (kl -> *) -> kr -> *).\n Barbies.Generics.Constraints.GAll\n 1 c (Barbies.Generics.Constraints.Other\n (t'\n (P 1 Barbies.Generics.Constraints.X)\n Barbies.Generics.Constraints.Y)\n (t Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y))\n = AllT c t\n-d5b6edfb831bb97466b0eb85e78df31e\n+91c5f3da5aa9973168691b425b737ce3\n axiom D:R:GAllk11cSelf ::\n forall k1 k2 k3 k4 k5 (c :: k1 -> GHC.Types.Constraint)\n (t' :: (k2 -> *) -> k3 -> *) (t :: (k4 -> *) -> k5 -> *).\n Barbies.Generics.Constraints.GAll\n 1 c (Barbies.Generics.Constraints.Self\n (t'\n (P 1 Barbies.Generics.Constraints.X)\n Barbies.Generics.Constraints.Y)\n (t Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y))\n = () :: Constraint\n-45fbe904b01bad9dab4b2bb6a02beca1\n+d72a8d938a52546f610f43d83a110788\n axiom D:R:TagSelf1' ::\n forall kf kg (b :: kf -> kg -> *) mt (m :: GHC.Generics.Meta)\n (s :: * -> *).\n TagSelf1' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf1' b s)\n forall kf kg (b :: kf -> kg -> *) (l :: * -> *) (r :: * -> *).\n TagSelf1' b (l GHC.Generics.:+: r)\n@@ -824,35 +824,35 @@\n forall kf kg (b :: kf -> kg -> *) x y.\n TagSelf1' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.V1 = GHC.Generics.V1\n-37486621ffdc8a5e5fddae6bb1235fca\n+159ad2e3d46e2baa3e58574dc39c6d5c\n type GAllRepT :: forall {k} {kg}. ((k -> *) -> kg -> *) -> * -> *\n type GAllRepT t = TagSelf1 t :: * -> *\n-b8dac055b26b88d4f2163bd4827c0db0\n+ed6076309feeacf626d5beed5e038d3e\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-22ba16a9ac95b3720fe3805cbd2dedef\n+737bcec52eaf6196ebcabcbbf27ee685\n type TagSelf1 :: forall {k} {kg}. ((k -> *) -> kg -> *) -> * -> *\n type TagSelf1 b =\n TagSelf1'\n (Data.Generics.GenericN.Indexed b 2)\n (Data.Generics.GenericN.Zip\n (GHC.Generics.Rep\n (Data.Generics.GenericN.Indexed\n (b Barbies.Generics.Constraints.X)\n 1\n Barbies.Generics.Constraints.Y))\n (GHC.Generics.Rep\n (b Barbies.Generics.Constraints.X Barbies.Generics.Constraints.Y)))\n :: * -> *\n-762c8c64fd4d6e5552beb8cbb5b63857\n+d2b6192f520cecb36027297c416ea5b2\n type TagSelf1' :: forall kf kg.\n (kf -> kg -> *) -> (* -> *) -> * -> *\n type family TagSelf1' b repbf where\n forall kf kg (b :: kf -> kg -> *) mt (m :: GHC.Generics.Meta)\n (s :: * -> *).\n TagSelf1' b (GHC.Generics.M1 mt m s)\n = GHC.Generics.M1 mt m (TagSelf1' b s)\n@@ -871,15 +871,15 @@\n TagSelf1' b (Data.Generics.GenericN.Rec x y)\n = Data.Generics.GenericN.Rec x y\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.U1 = GHC.Generics.U1\n forall kf kg (b :: kf -> kg -> *).\n TagSelf1' b GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:TagSelf1'\n-3e35d04e1db9022f689d09ff824a4000\n+d0c333a07d983af2d89222a83aef8007\n gtaddDictsDefault ::\n forall {k} {kr} (t :: (k -> *) -> kr -> *)\n (c :: k -> GHC.Types.Constraint) (f :: k -> *) (x :: kr).\n (CanDeriveConstraintsT c t f x, AllT c t) =>\n t f x\n -> t (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f)\n@@ -1136,15 +1136,15 @@\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) }]\n-4875bae88b66e38adde8c83c93123ba5\n+73fd66c995185ab399fedc41770b2915\n tdicts ::\n forall {kl} {kr} (c :: kl -> GHC.Types.Constraint)\n (t :: (kl -> *) -> kr -> *) (x :: kr).\n (ConstraintsT t, Barbies.Internal.ApplicativeT.ApplicativeT t,\n AllT c t) =>\n t (Barbies.Internal.Dicts.Dict c) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1189,30 +1189,30 @@\n @kr\n @t\n $dApplicativeT\n @Data.Proxy.Proxy\n @x\n (Data.Proxy.Proxy\n @kl)))]\n-cea1e214f4070d66a52c6af84508abdf\n+84732f8399a3267c260d3d4931879a2f\n tdicts1 ::\n forall {kl} {c :: kl -> GHC.Types.Constraint} {a :: kl}.\n Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a\n -> Barbies.Internal.Dicts.Dict c a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1!P(L),A)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @kl\n @c :: kl -> GHC.Types.Constraint\n @a :: kl\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) Data.Proxy.Proxy a) ->\n case ds of wild { Data.Functor.Product.Pair c1 ds1 -> c1 }]\n-59e558e636fea38c32f8eaf1c4e199b2\n+d31ac3d169aaedbd4f27a4f83ba16a95\n tfoldMapC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) m (f :: k -> *) (x :: kr).\n (Barbies.Internal.TraversableT.TraversableT t, ConstraintsT t,\n AllT c t, GHC.Base.Monoid m) =>\n (forall (a :: k). c a => f a -> m) -> t f x -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1289,15 +1289,15 @@\n irred\n t1))\n `cast`\n ( f a -> m>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n <*>_N _R _P)]\n-c7ff11490dec8c0395bb3c7f9f149f34\n+1bf040f27f0c14d38d137b7a60d57d93\n tmapC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) (f :: k -> *) (g :: k -> *) (x :: kr).\n (AllT c t, ConstraintsT t) =>\n (forall (a :: k). c a => f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n@@ -1345,15 +1345,15 @@\n @t\n $dConstraintsT\n @c\n @f\n @x\n irred\n eta1)]\n-209da7c826789175368b82c9fcc92849\n+a0482fa77d0929cafde92540e35124a3\n tmempty ::\n forall {k} {k'} (f :: k -> *) (t :: (k -> *) -> k' -> *) (x :: k').\n (AllTF GHC.Base.Monoid f t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n t f x\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1399,15 +1399,15 @@\n GHC.Base.Monoid\n f)\n @t\n @x\n $dConstraintsT\n $dApplicativeT\n irred)]\n-3ef0108ea5c6eb6e26f9027c458c0238\n+593917703526bebdf1a74f85cdf79797\n tmempty1 ::\n forall {k} {f :: k -> *} {a :: k}.\n Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Monoid f) a\n -> f a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Unfolding: Core: \n@@ -1424,15 +1424,15 @@\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N\n _N\n _N\n _N\n _N) }]\n-fd3dc259c769c6d10f13244314fc6b5c\n+0feda048905babd38e5d81fc4fc431b5\n tpureC ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (t :: (k -> *) -> k' -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -1473,15 +1473,15 @@\n @k'\n @c\n @t\n @x\n $dConstraintsT\n $dApplicativeT\n irred)]\n-10f64217cafad49e723398b33079651f\n+5f64d3e2e8c919dd82131024647bdfb8\n ttraverseC ::\n forall {k} {kr} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> kr -> *) (f :: k -> *) (g :: k -> *)\n (e :: * -> *) (x :: kr).\n (Barbies.Internal.TraversableT.TraversableT t, ConstraintsT t,\n AllT c t, GHC.Base.Applicative e) =>\n (forall (a :: k). c a => f a -> e (g a)) -> t f x -> e (t g x)\n@@ -1531,15 +1531,15 @@\n @t\n $dConstraintsT\n @c\n @f\n @x\n irred\n t1)]\n-c22d1dc9901860530c44e0bbeb572fa4\n+edc3a45e35e2b1738125a2dc287fe25c\n tzipWith3C ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a)\n@@ -1650,15 +1650,15 @@\n (Data.Functor.Product.Product\n f\n g)\n h)\n @x\n irred\n eta)]\n-10a1853bb6a148376c15b4dd75980cc0\n+0f058430a5129ec2f3c3a804b99a9198\n tzipWith4C ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (i :: k -> *) (j :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a -> i a -> j a)\n@@ -1793,15 +1793,15 @@\n f\n g)\n h)\n i)\n @x\n irred\n eta)]\n-e5fad515763283f623ddeafe458a4e64\n+bd5e9ad9b5d4da210e2e8abd68e706d8\n tzipWithC ::\n forall {k} {k'} (c :: k -> GHC.Types.Constraint)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (h :: k -> *) (x :: k').\n (AllT c t, ConstraintsT t,\n Barbies.Internal.ApplicativeT.ApplicativeT t) =>\n (forall (a :: k). c a => f a -> g a -> h a)\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Containers.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Containers.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,30 +1,30 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.Containers [family instance module] 9066\n- interface hash: c8da36297dfaf5a25b6e78e0296c3075\n- ABI hash: c5fab473bbad9979597074043620626d\n- export-list hash: 4fa8423d55bf9a8386196177440beaeb\n+ interface hash: 675069eb1c01b9dea2cd7bf7894a2af1\n+ ABI hash: 1802c15850fcd61796b047337556cfe7\n+ export-list hash: 44d9d9e490c993955cc49d53d406e44b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 6ac434eb8932d042fc0a76cb16e67cb2\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: e7651a07642b22a2e2105f6c76f4b003\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Container{Container getContainer}\n ErrorContainer{ErrorContainer getErrorContainer}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -34,42 +34,42 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- ApplicativeB e831de0bd01221227318ff01f360d4cb\n- bpure 8f62c3bd94a72cb3e7cb88067b7fc1f0\n- bzipWith 4533dac19f2e4b44be72c581c4090d1e\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- TraversableB 276504176defd37fdae4e05d479e9cc6\n- bfoldMap 14d33185bc8e0b9d6617de4794d0b153\n- btraverse 44638623568081a176cfc6fcc0804dca\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 9dafd74b326111f9ee0b678e4b56d097\n- exports: 776dd022e7184a3e3960ac8208304d11\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ ApplicativeB 16deedde4d173b65d0723755e5a93713\n+ bpure e8e39b317ff94f27399a39d7e16b86a9\n+ bzipWith bca3958211a37a502853b653649238a6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ TraversableB b16eda90a135f995e76c64fdf076422a\n+ bfoldMap 0c258f5bfc94ec71636a457f0c538881\n+ btraverse 2d1803bee429e065a9d4f13a0e12ab46\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie cb89b258eede167b2d361dbcd693e5c2\n+ exports: 2d9e067c321d67b0eec7598e2173b9ef\n import -/ Data.Bifunctor 1d9d7c21b881329380908e0dfd716fa2\n import -/ Data.Bitraversable b3dde5b92e054012e0f42e345cd39579\n import -/ Data.Either 7c47cd251bd107db492912c22e18f784\n import -/ Data.Foldable 37d8b44e2b26697f0bf316460a82287c\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.ParserCombinators.ReadPrec a657147dbd7291808782bfe31b23cd99\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n-32bc878d0ed981d83a59ed20af027670\n+cc8539550b7029025c57fa5e21ee3915\n $fApplicativeContainer ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n GHC.Base.Applicative (Container b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -91,15 +91,15 @@\n `cast`\n (forall (a :: <*>_N).\n _R %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))\n ($fApplicativeContainer_$c<*> @b v)\n ($fApplicativeContainer_$cliftA2 @b v)\n ($fApplicativeContainer_$c*> @b v)\n ($fApplicativeContainer_$c<* @b v)]\n-a7c174a68359cb63f978b02978bbdcf6\n+a76f92d368c95a6640103a384e3329a7\n $fApplicativeContainer1 ::\n Data.Functor.Product.Product\n (Data.Functor.Const.Const (a1 -> b))\n (Data.Functor.Const.Const a1)\n a2\n -> Data.Functor.Const.Const b a2\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -113,39 +113,39 @@\n (Data.Functor.Const.Const a)\n a1) ->\n case ds4 of wild { Data.Functor.Product.Pair fa ga ->\n (fa `cast` (Data.Functor.Const.N:Const[0] <*>_N b>_R _P)\n ga `cast` (Data.Functor.Const.N:Const[0] <*>_N _R _P))\n `cast`\n (Sym (Data.Functor.Const.N:Const[0] <*>_N _R _P)) }]\n-263a0eb332fdafc5cac80114c8a01e4c\n+2696da61da265e00a26cea80999e1aa1\n $fApplicativeContainer2 ::\n Data.Functor.Const.Const a1 a2\n -> b -> Data.Functor.Const.Const a1 a2\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @b\n @a\n @a1\n (ds4['GHC.Types.Many] :: Data.Functor.Const.Const a a1)\n (ds5['GHC.Types.Many] :: b) ->\n ds4]\n-a300a254d90a43ee48a767c1c14378a0\n+38b4aa570b7edc5022e4493ec1aeba7c\n $fApplicativeContainer3 :: Data.Functor.Const.Const a1 a2 -> b -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n @a1\n (ds4['GHC.Types.Many] :: Data.Functor.Const.Const a a1)\n (eta['GHC.Types.Many] :: b) ->\n eta]\n-2bd6acc660add889d8fbbaefbbb15fc4\n+391ca5e170362d4704ab86f9889738a7\n $fApplicativeContainer_$c*> ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b a -> Container b b1 -> Container b b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -218,15 +218,15 @@\n eta2\n eta3\n `cast`\n (N:Container[0]\n _R _N)))\n `cast`\n (Sym (N:Container[0] _R _N))]\n-e30ac99b32003c4d0ed6652afa25fce0\n+2ce49304ff020e7051a91c2c63f7b427\n $fApplicativeContainer_$c<* ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b a -> Container b b1 -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -304,15 +304,15 @@\n eta2\n eta3\n `cast`\n (N:Container[0]\n _R _N)))\n `cast`\n (Sym (N:Container[0] _R _N))]\n-c08bd7467789fc64ef0df239eccfdb32\n+813e0f631c55e2a83f8ea59bec6fe9e6\n $fApplicativeContainer_$c<*> ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Container b (a -> b1) -> Container b a -> Container b b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -366,15 +366,15 @@\n b1>_N)\n eta2\n `cast`\n (N:Container[0]\n _R _N)))\n `cast`\n (Sym (N:Container[0] _R _N))]\n-447cd5bba74c5fb5f431d7371a58dcc1\n+70e9b872e14edf308f8c3d9bdbfb5184\n $fApplicativeContainer_$cliftA2 ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n (a -> b1 -> c) -> Container b a -> Container b b1 -> Container b c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -457,15 +457,15 @@\n eta2\n eta3\n `cast`\n (N:Container[0]\n _R _N)))\n `cast`\n (Sym (N:Container[0] _R _N))]\n-3c6f0654fadfeb3aab335ca8f8c5e116\n+0a21cf62c2f1479dcc078ceef3630e3d\n $fApplicativeContainer_$cp1Applicative ::\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n GHC.Base.Functor (Container b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -473,15 +473,15 @@\n b) ->\n $fFunctorContainer\n @b\n (Barbies.Internal.ApplicativeB.$p1ApplicativeB\n @(*)\n @b\n $dApplicativeB)]\n-cdb61e6f85767c20eefa3200289a292f\n+e6bd3f18b2ec3c20e945c1d375f7400c\n $fEqContainer ::\n GHC.Classes.Eq (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Eq (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -495,15 +495,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b (Data.Functor.Const.Const a)) v)\n `cast`\n (Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-e5fe6c62d8282e6ccc2f5865f1089626\n+a56b9900fbfdf12577c66f982692c274\n $fEqErrorContainer ::\n GHC.Classes.Eq (b (Data.Either.Either e)) =>\n GHC.Classes.Eq (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -516,15 +516,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)\n (GHC.Classes./= @(b (Data.Either.Either e)) v)\n `cast`\n (Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R _R)]\n-81845da439b91498c0323e61548bf044\n+658c667562eefb0cffc6d7524565a81a\n $fFoldableContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Foldable.Foldable (Container b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -561,15 +561,15 @@\n ($fFoldableContainer1 @b v)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-e46579457e03d497a3da9dfa376ed14d\n+76ca6729ad241a604cad1d7e0c8e95f2\n $fFoldableContainer1 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n Container b a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n Unfolding: Core: StableUser\n@@ -615,36 +615,36 @@\n (Data.Semigroup.Internal.N:Endo[0]\n Data.Semigroup.Internal.Product a>_R)\n (GHC.Base.id @(Data.Semigroup.Internal.Product a))\n (Data.Semigroup.Internal.$fMonoidProduct1 @a $dNum)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Product[0] _R))]\n-b7014152f01f89a9ecd803cde44f0cf1\n+80452a0cd5f9ae5adc503e97ff8f61fc\n $fFoldableContainer10 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual (Data.Semigroup.Internal.Endo b))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @b ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo b)\n (Data.Semigroup.Internal.$fMonoidEndo @b)]\n-d975afbe5b741e71879e1bf0aaac3f84\n+10d0361b9d933d61fbc3e06b38394914\n $fFoldableContainer11 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual\n (Data.Semigroup.Internal.Endo (b -> b)))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @b ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo (b -> b))\n (Data.Semigroup.Internal.$fMonoidEndo @(b -> b))]\n-1099133559f201e79fbfbc9e383b98fb\n+4934803713c1fd52d1d25dd2af9f3a75\n $fFoldableContainer2 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n Container b a -> Data.Semigroup.Internal.Sum a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n Unfolding: Core: StableUser\n@@ -686,15 +686,15 @@\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n Data.Semigroup.Internal.Sum a>_R)\n (GHC.Base.id @(Data.Semigroup.Internal.Sum a))\n (Data.Semigroup.Internal.$fMonoidSum1 @a $dNum)\n `cast`\n (Sym (Data.Semigroup.Internal.N:Sum[0] _R))]\n-9a317602f23454d14edc3dfcf5a48697\n+8d47c658a12e395f3d7631c8e36ac612\n $fFoldableContainer3 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Classes.Eq a) =>\n a -> Container b a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -719,20 +719,20 @@\n Sym (Data.Functor.Const.N:Const[0] <*>_N _R _P)\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Any[0]))\n } in\n \\ (x['GHC.Types.Many] :: Container b a) ->\n f ({__scc {Barbies.Internal.Containers.getContainer} True False} x)\n `cast`\n (N:Container[0] _R _N)]\n-0dbc6fd43d53661259b8bd723f5444bd\n+14ba80e83c09ab1a7d2343ccd29b6558\n $fFoldableContainer4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-b213d50559531d1f9a7b06e690d23024\n+75554ce4654551f6c5ee9b9e04052cde\n $fFoldableContainer5 ::\n a1\n -> (GHC.Types.Int -> GHC.Types.Int)\n -> GHC.Types.Int\n -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)><1!P(L)>,\n@@ -740,44 +740,44 @@\n \\ @a\n @a1\n (ds4['GHC.Types.Many] :: a)\n (ds5['GHC.Types.Many] :: GHC.Types.Int -> GHC.Types.Int)\n (v['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case v of z { GHC.Types.I# ipv ->\n ds5 (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }]\n-82df404652ebb86393fa1ec3dbd57af6\n+9bf796267ab18b0dbbb9ae6466c937cb\n $fFoldableContainer6 :: a1 -> GHC.Types.Bool -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @a1\n (ds4['GHC.Types.Many] :: a)\n (ds5['GHC.Types.Many] :: GHC.Types.Bool) ->\n GHC.Types.False]\n-257044b12ed3ec8fa150a265cb24dfe2\n+7a1c9e2de9a8989016a293ab69a88cd7\n $fFoldableContainer7 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-2de2d96125093c41e65cb7082437210f\n+74f764be7de39296496c989fe9b31a37\n $fFoldableContainer8 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual\n (Data.Semigroup.Internal.Endo (GHC.Maybe.Maybe a)))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @a ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo (GHC.Maybe.Maybe a))\n (Data.Semigroup.Internal.$fMonoidEndo @(GHC.Maybe.Maybe a))]\n-968839be78290f6122d80705cc973202\n+63efca2697969985345a802e09261bd3\n $fFoldableContainer9 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-2f3371ddbe126aa124ec78aa6e32c5d5\n+81f10f67bbe60b7397d07250b512b92a\n $fFoldableContainer_$cfold ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n Container b m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -803,15 +803,15 @@\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n <*>_N _R _P)\n } in\n \\ (x['GHC.Types.Many] :: Container b m) ->\n f ({__scc {Barbies.Internal.Containers.getContainer} True False} x)\n `cast`\n (N:Container[0] _R _N)]\n-b4b4044f4134755c560c443327bf72b3\n+49cbb6f647f47ac6d6a18416312878f3\n $fFoldableContainer_$cfoldMap ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> Container b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -838,15 +838,15 @@\n %<'GHC.Types.Many>_N ->_R _R)\n } in\n \\ (x['GHC.Types.Many] :: Container b a) ->\n f1\n ({__scc {Barbies.Internal.Containers.getContainer} True False} x)\n `cast`\n (N:Container[0] _R _N)]\n-56ef61783bb3892baf2ab21080245901\n+85b6bbc7bfe3304a7b23d4b90d812cb0\n $fFoldableContainer_$cfoldMap' ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> Container b a -> m\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n@@ -883,15 +883,15 @@\n ({__scc {Barbies.Internal.Containers.getContainer} True False} eta1)\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m)\n (GHC.Base.mempty @m $dMonoid)]\n-64d1f4041bdb3ebccaa85723733e9972\n+aec0ac4b1c3c1fe4986bebcd84b22b62\n $fFoldableContainer_$cfoldl ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> Container b a -> b1\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -921,15 +921,15 @@\n ({__scc {Barbies.Internal.Containers.getContainer} True False} eta2)\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1]\n-0a9a5545fec96dc3a0b40e2669111e5d\n+ed68a2b07fce6001336dd448991951fc\n $fFoldableContainer_$cfoldl' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> Container b a -> b1\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -961,15 +961,15 @@\n ({__scc {Barbies.Internal.Containers.getContainer} True False} xs)\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] b1>_R)\n (GHC.Base.id @b1)\n eta1]\n-e14edc4b5826a6c5457e2e004296e2be\n+bb42273486347b8fdeb09880d7eb464c\n $fFoldableContainer_$cfoldl1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> Container b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1008,15 +1008,15 @@\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n (GHC.Maybe.Nothing @a) of wild {\n GHC.Maybe.Nothing -> $fFoldableContainer7 @a\n GHC.Maybe.Just v -> v }]\n-ca4a1abb262ec3397a73d0a979af2119\n+ab703965c285b1415a6397bef99f5119\n $fFoldableContainer_$cfoldr ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> Container b a -> b1\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1042,15 +1042,15 @@\n _R))\n ({__scc {Barbies.Internal.Containers.getContainer} True False} t1)\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n z]\n-cce103d18e9f978be04dd0089d2c0d90\n+5759b02413a45ae385ac1240c5b4d38c\n $fFoldableContainer_$cfoldr' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> Container b a -> b1\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1086,15 +1086,15 @@\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] b1>_R))\n (GHC.Base.id @b1)\n z0]\n-ca96f4f4f5de8234c3ae66d0ee7c37ea\n+c1f740cdc6f98806252d4c9e74d88a9b\n $fFoldableContainer_$cfoldr1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> Container b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1126,15 +1126,15 @@\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a) of wild {\n GHC.Maybe.Nothing -> $fFoldableContainer9 @a\n GHC.Maybe.Just v -> v }]\n-847730f17a79f2ff16c4f688fcec06bc\n+2a39046407afca306e6b553696d11490\n $fFoldableContainer_$clength ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> GHC.Types.Int\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1160,15 +1160,15 @@\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int)\n $fFoldableContainer4]\n-9ee3286d8163c61e7650800bee7a340e\n+f701229cae989d44cdf8c1991539971b\n $fFoldableContainer_$cmaximum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n Container b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1232,15 +1232,15 @@\n @GHC.Types.LiftedRep\n @a\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b1 ->\n GHC.CString.unpackFoldrCString# @b1 \"maximum: empty structure\"#))\n GHC.Maybe.Just v -> v }]\n-41f86228b3befb4f5277fa2562877c23\n+606f385d9c3049c67c47b42b7557e880\n $fFoldableContainer_$cminimum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n Container b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1304,15 +1304,15 @@\n @GHC.Types.LiftedRep\n @a\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b1 ->\n GHC.CString.unpackFoldrCString# @b1 \"minimum: empty structure\"#))\n GHC.Maybe.Just v -> v }]\n-61d55bd77392b394e43f09c8949ee90f\n+2d8066907d776aebb16ab6cc94094fe8\n $fFoldableContainer_$cnull ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> GHC.Types.Bool\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1335,15 +1335,15 @@\n _R))\n ({__scc {Barbies.Internal.Containers.getContainer} True False} eta)\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True]\n-90fa98e6be194ba5afa794b1f070bd86\n+30f6e10c8bdcc6755a5f1f3643d2b37e\n $fFoldableContainer_$ctoList ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Container b a -> [a]\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @b :: (* -> *) -> *\n@@ -1353,15 +1353,15 @@\n (eta['GHC.Types.Many] :: Container b a) ->\n GHC.Base.build\n @a\n (\\ @b1\n (c['GHC.Types.Many] :: a -> b1 -> b1)[OneShot]\n (n['GHC.Types.Many] :: b1)[OneShot] ->\n $fFoldableContainer_$cfoldr @b $dTraversableB @a @b1 c n eta)]\n-42b32f67255c650e61afc68c953262f5\n+9f9b44cb1714cc41ca80fa89a05a1680\n $fFoldableErrorContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Foldable.Foldable (ErrorContainer b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -1398,15 +1398,15 @@\n ($fFoldableErrorContainer1 @b v)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-aaf969f2b112494ba0bd89575bb743a5\n+0a13ac4b62cd7af81e19a6cd485f42c3\n $fFoldableErrorContainer1 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n ErrorContainer b a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline:,\n Unfolding: Core: StableUser\n \\ @b :: (* -> *) -> *\n@@ -1421,15 +1421,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidProduct @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Product[0]\n _R))]\n-e993fb46a5cc19fd3f251e2fc25be47b\n+6d64963853648c54b7d6b91864f6e222\n $fFoldableErrorContainer2 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Num.Num a) =>\n ErrorContainer b a -> Data.Semigroup.Internal.Sum a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n Unfolding: Core: StableUser\n@@ -1445,15 +1445,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidSum @a $dNum)\n (\\ (ds4['GHC.Types.Many] :: a) -> ds4)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Sum[0]\n _R))]\n-b711465ac50ac0b474652dd81da06869\n+9d008d16faf5aa4c7ac137e78d0e5473\n $fFoldableErrorContainer3 ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Classes.Eq a) =>\n a -> ErrorContainer b a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1483,15 +1483,15 @@\n `cast`\n (Sym (Data.Semigroup.Internal.N:Any[0])) })\n } in\n \\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n f ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} x)\n `cast`\n (N:ErrorContainer[0] _R _N)]\n-3a803db620b21159f9a4a3f65a03d403\n+66600e604fe37dcbddcabbca305f6cdc\n $fFoldableErrorContainer4 ::\n Data.Either.Either a1 a2\n -> (GHC.Types.Int -> GHC.Types.Int)\n -> GHC.Types.Int\n -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L><1C(1,L)>,\n@@ -1502,27 +1502,27 @@\n (eta['GHC.Types.Many] :: GHC.Types.Int -> GHC.Types.Int)\n (eta1['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case ds4 of wild {\n Data.Either.Left x\n -> case eta1 of z { GHC.Types.I# ipv ->\n eta (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }\n Data.Either.Right y -> eta eta1 }]\n-7ecd55c690f4e4a34de6356e063ab696\n+749cc07b601572ea8a2a0d0b9ba10b77\n $fFoldableErrorContainer5 ::\n Data.Either.Either a1 a2 -> GHC.Types.Bool -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @a\n @a1\n (ds4['GHC.Types.Many] :: Data.Either.Either a a1)\n (eta['GHC.Types.Many] :: GHC.Types.Bool) ->\n case ds4 of wild {\n Data.Either.Left x -> GHC.Types.False Data.Either.Right y -> eta }]\n-5775b1a99643a4d33fd63c638b4f8950\n+08c963915a521ba95cfe0f1c221455ea\n $fFoldableErrorContainer_$cfold ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n ErrorContainer b m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1549,15 +1549,15 @@\n case ds4 of wild {\n Data.Either.Left x1 -> x1 Data.Either.Right y -> x })\n } in\n \\ (x['GHC.Types.Many] :: ErrorContainer b m) ->\n f ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} x)\n `cast`\n (N:ErrorContainer[0] _R _N)]\n-2cfe7e9c50640ba8fb9585b4e51445ba\n+15da7d58bde5ba51e040d46582be5e5f\n $fFoldableErrorContainer_$cfoldMap ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> ErrorContainer b a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1586,15 +1586,15 @@\n Data.Either.Left x1 -> f x1 Data.Either.Right y -> x })\n } in\n \\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n f1\n ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} x)\n `cast`\n (N:ErrorContainer[0] _R _N)]\n-6b6c7bf1e7f6f57ed0dbebed17493771\n+cdac6581d6147c99ced138a5e6fe6ffc\n $fFoldableErrorContainer_$cfoldMap' ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Monoid m) =>\n (a -> m) -> ErrorContainer b a -> m\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n@@ -1634,15 +1634,15 @@\n ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} eta1)\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m)\n (GHC.Base.mempty @m $dMonoid)]\n-c1e84d353e43930cf971926644c0fa40\n+3b52db3c5aff777335e270f52d9079cf\n $fFoldableErrorContainer_$cfoldl ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> ErrorContainer b a -> b1\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1673,15 +1673,15 @@\n ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} eta2)\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1]\n-988b7c53e787ef325838f60e4f2e7261\n+d0c24f44d2d6b9d41f450fa25cbce710\n $fFoldableErrorContainer_$cfoldl' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (b1 -> a -> b1) -> b1 -> ErrorContainer b a -> b1\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -1715,15 +1715,15 @@\n ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} xs)\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] b1>_R)\n (GHC.Base.id @b1)\n eta1]\n-569ad3ee11d6427af5e02fd70c374b35\n+adddf226b9d951a091a511cf67627d97\n $fFoldableErrorContainer_$cfoldl1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1761,15 +1761,15 @@\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n (GHC.Maybe.Nothing @a) of wild {\n GHC.Maybe.Nothing -> $fFoldableContainer7 @a\n GHC.Maybe.Just v -> v }]\n-f1b71284b746a932a96023fa823771c4\n+a989d52a27c5ce6d3b4f3386d942d289\n $fFoldableErrorContainer_$cfoldr ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> ErrorContainer b a -> b1\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1797,15 +1797,15 @@\n (Sym (Data.Semigroup.Internal.N:Endo[0] _R)) })\n ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} t1)\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n z]\n-87c73c4c369b124dfdf31cbe9aeef806\n+7c71c070001cc9e8c6f1b3e3806196c4\n $fFoldableErrorContainer_$cfoldr' ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> b1 -> b1) -> b1 -> ErrorContainer b a -> b1\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1841,15 +1841,15 @@\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] b1>_R))\n (GHC.Base.id @b1)\n z0]\n-f1cbb3c5fd73d29fa6f53add7e0f426b\n+b1612dbd9ea8df2765b41e513f3e2fef\n $fFoldableErrorContainer_$cfoldr1 ::\n Barbies.Internal.TraversableB.TraversableB b =>\n (a -> a -> a) -> ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1884,15 +1884,15 @@\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a) of wild {\n GHC.Maybe.Nothing -> $fFoldableContainer9 @a\n GHC.Maybe.Just v -> v }]\n-5a08efcb2555cdee8ca8296460fcea59\n+e1126705a589ca099a3067d7c584b898\n $fFoldableErrorContainer_$clength ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> GHC.Types.Int\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1918,15 +1918,15 @@\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int)\n $fFoldableContainer4]\n-678b85c2e0198304175c22efc459ed1e\n+4c379e32e608f1e7b83f0c6105fbc7d7\n $fFoldableErrorContainer_$cmaximum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -1965,15 +1965,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Max[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Max[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-b8a3bdc3d3a2b12f099ca222f441888d\n+d82779b94d6a33ba95a05481d27d4337\n $fFoldableErrorContainer_$cminimum ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Classes.Ord a) =>\n ErrorContainer b a -> a\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline:,\n@@ -2012,15 +2012,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Min[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Min[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-525026f5185b84da0e71110aeef63d35\n+e1eccf6db3ab7dd64764af418506c2fd\n $fFoldableErrorContainer_$cnull ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> GHC.Types.Bool\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2043,15 +2043,15 @@\n _R))\n ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} t1)\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True]\n-da63a1b25f2fa06ed194e24f0a29b664\n+c453a612bc30127e2d31fbae04f3f8b7\n $fFoldableErrorContainer_$ctoList ::\n Barbies.Internal.TraversableB.TraversableB b =>\n ErrorContainer b a -> [a]\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: (sat-args=1),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @b :: (* -> *) -> *\n@@ -2061,27 +2061,27 @@\n (eta['GHC.Types.Many] :: ErrorContainer b a) ->\n GHC.Base.build\n @a\n (\\ @b1\n (c['GHC.Types.Many] :: a -> b1 -> b1)[OneShot]\n (n['GHC.Types.Many] :: b1)[OneShot] ->\n $fFoldableErrorContainer_$cfoldr @b $dTraversableB @a @b1 c n eta)]\n-4428c06d243d632d8b6d1f29034cccbb\n+f5ec773bec217c63a407cf10240a0a94\n $fFunctorContainer ::\n Barbies.Internal.FunctorB.FunctorB b =>\n GHC.Base.Functor (Container b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n (v['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @(Container b)\n ($fFunctorContainer_$cfmap @b v)\n ($fFunctorContainer_$c<$ @b v)]\n-ef4a27a2bd88bd1a33436ae8f1aaa6e9\n+eb53397857ed08826ff143b35f31ae27\n $fFunctorContainer_$c<$ ::\n Barbies.Internal.FunctorB.FunctorB b =>\n a -> Container b b1 -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2110,15 +2110,15 @@\n (\\ (x['GHC.Types.Many] :: Container b b1) ->\n f ({__scc {Barbies.Internal.Containers.getContainer} True False} x)\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-3079c12523c6958db961b8ba49248fcd\n+78019543701cc5867121c85a43d5e1ca\n $fFunctorContainer_$cfmap ::\n Barbies.Internal.FunctorB.FunctorB b =>\n (a -> b1) -> Container b a -> Container b b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2148,27 +2148,27 @@\n f1\n ({__scc {Barbies.Internal.Containers.getContainer} True False} x)\n `cast`\n (N:Container[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-8fbec081ae8b929bea8c6603c7b55a3d\n+9f68a23ed6804e389956d79d6dd18390\n $fFunctorErrorContainer ::\n Barbies.Internal.FunctorB.FunctorB b =>\n GHC.Base.Functor (ErrorContainer b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n (v['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @(ErrorContainer b)\n ($fFunctorErrorContainer_$cfmap @b v)\n ($fFunctorErrorContainer_$c<$ @b v)]\n-46b23462c6ab694d23a4e7580dc01bc4\n+79b01b9510d557cde89de14485edee14\n $fFunctorErrorContainer_$c<$ ::\n Barbies.Internal.FunctorB.FunctorB b =>\n a -> ErrorContainer b b1 -> ErrorContainer b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2196,15 +2196,15 @@\n (\\ (x['GHC.Types.Many] :: ErrorContainer b b1) ->\n f ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} x)\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-8d5fa1f0582ef0741be47bb31943fd1b\n+24c4980babb965d16e39c4c709c97068\n $fFunctorErrorContainer_$cfmap ::\n Barbies.Internal.FunctorB.FunctorB b =>\n (a -> b1) -> ErrorContainer b a -> ErrorContainer b b1\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2226,24 +2226,24 @@\n f1\n ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} x)\n `cast`\n (N:ErrorContainer[0] _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-801562710c510ae160723e14dbdb0b5e\n+88ab5a591a7aab6e1a00bae3a7c7cb93\n $fGenericContainer :: GHC.Generics.Generic (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> * @a.\n @(Container b a)\n ($fGenericContainer_$cfrom @b @a)\n ($fGenericContainer_$cto @b @a)]\n-c3aad390cafc4e100d8242508bb57cd4\n+039a4652e60730c3ff060fd046339440\n $fGenericContainer_$cfrom ::\n Container b a -> GHC.Generics.Rep (Container b a) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @a\n@@ -2289,15 +2289,15 @@\n (b (Data.Functor.Const.Const a)))>_R)\n ; Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R)\n ; Sub (Sym (Rep_Container[0] _N _N))) _N)]\n-ba10f115cc206b04f82730abc70dfd54\n+3a852607cdc0f8daab1e171b50366e9c\n $fGenericContainer_$cto ::\n GHC.Generics.Rep (Container b a) x -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @a\n@@ -2330,15 +2330,15 @@\n %<'GHC.Types.Many>_N ->_R (Sub (Rep_Container[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R) _N\n ; GHC.Generics.N:K1[0]\n <*>_N\n _P\n _R\n _P\n ; Sym (N:Container[0] _R _N))]\n-967ca645e2bdf6e4e87eda8f917f0e98\n+7ce023ee2109edd47a7d1c54b383d0f2\n $fGenericErrorContainer ::\n GHC.Generics.Generic (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> * @e.\n @(ErrorContainer b e)\n ($fGenericErrorContainer_$cfrom @b @e)\n ($fGenericErrorContainer_$cto @b @e)]\n-f514a6ad7ef22851330b246fdc4a025c\n+e3b1ffe67cfa2df462e7229604bb0010\n $fGenericErrorContainer_$cfrom ::\n ErrorContainer b e -> GHC.Generics.Rep (ErrorContainer b e) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @e\n@@ -2446,15 +2446,15 @@\n (b (Data.Either.Either e)))>_R)\n ; Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R)\n ; Sub (Sym (Rep_ErrorContainer[0] _N _N))) _N)]\n-340e798c0b17ef314502e28ba74b5d39\n+c36b1b8b0c3eb60b3ee8a8ba68f77676\n $fGenericErrorContainer_$cto ::\n GHC.Generics.Rep (ErrorContainer b e) x -> ErrorContainer b e\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n (\\ @b :: (* -> *) -> *\n @e\n@@ -2488,15 +2488,15 @@\n %<'GHC.Types.Many>_N ->_R (Sub (Rep_ErrorContainer[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True>_P\n _R) _N\n ; GHC.Generics.N:K1[0]\n <*>_N\n _P\n _R\n _P\n ; Sym (N:ErrorContainer[0] _R _N))]\n-9141a0d2ab643d920d03855847523bb3\n+8e023dd8a955f145e6b73cad370e65f5\n $fOrdContainer ::\n GHC.Classes.Ord (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Ord (Container b a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -2588,30 +2588,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))\n (GHC.Classes.min @(b (Data.Functor.Const.Const a)) v)\n `cast`\n (Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:Container[0] _R _N))]\n-445c059e112756760c8b0c9aee1df645\n+79a879c9166241451ed1bc2a98fce16c\n $fOrdContainer_$cp1Ord ::\n GHC.Classes.Ord (b (Data.Functor.Const.Const a)) =>\n GHC.Classes.Eq (Container b a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord\n (b (Data.Functor.Const.Const a))) ->\n $fEqContainer\n @b\n @a\n (GHC.Classes.$p1Ord @(b (Data.Functor.Const.Const a)) $dOrd)]\n-d98fe268314158a05840e6b31d98713e\n+242cdddc5516693e99cc6358a7389d01\n $fOrdErrorContainer ::\n GHC.Classes.Ord (b (Data.Either.Either e)) =>\n GHC.Classes.Ord (ErrorContainer b e)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -2651,30 +2651,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))\n (GHC.Classes.min @(b (Data.Either.Either e)) v)\n `cast`\n (Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N)\n %<'GHC.Types.Many>_N ->_R Sym (N:ErrorContainer[0] _R _N))]\n-6acaede47efe2f768d7bb9b985a210af\n+e9d31e26d2eb508d07fe3247a4b22bd2\n $fOrdErrorContainer_$cp1Ord ::\n GHC.Classes.Ord (b (Data.Either.Either e)) =>\n GHC.Classes.Eq (ErrorContainer b e)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @e\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord\n (b (Data.Either.Either e))) ->\n $fEqErrorContainer\n @b\n @e\n (GHC.Classes.$p1Ord @(b (Data.Either.Either e)) $dOrd)]\n-597ffa7e3b77f55a125726e718f04b85\n+17bb5dc595349bb93fcf6fa44891da0c\n $fReadContainer ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n GHC.Read.Read (Container b a)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -2688,24 +2688,24 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadContainer_$creadListPrec @b @a v)]\n-c36fe33edd023dc53865ac1dc889eb9c\n+71fc19f85e187da9a4933483af35c7cb\n $fReadContainer1 ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (Container b a -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-464656cc5db8b54a799ba8b4808ff218\n+a7460d5cea038fac954812750d07b2e3\n $fReadContainer_$creadList ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadP.ReadS [Container b a]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2727,15 +2727,15 @@\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Container b a]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Container b a]>_R)\n @[Container b a]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[Container b a]))]\n-afb169ee18b1c8f7dcc8a91941360518\n+a501bf4c5031e7ffbf3e2cd7df803db3\n $fReadContainer_$creadListPrec ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [Container b a]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2747,15 +2747,15 @@\n ($fReadContainer1 @b @a $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-4bf904b47b115d11deea586b6d1865af\n+34ba447c60433cdcc70d1176b2251a1e\n $fReadContainer_$creadsPrec ::\n GHC.Read.Read (b (Data.Functor.Const.Const a)) =>\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Container b a)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2769,15 +2769,15 @@\n @b\n @a\n $dRead\n eta\n @(Container b a)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Container b a)))]\n-4bcf0d3a77ad27d23c9f923031686878\n+9da573c64033d64be41d40edb45d9f09\n $fReadErrorContainer ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n GHC.Read.Read (ErrorContainer b e)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -2790,24 +2790,24 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))\n ($fReadErrorContainer_$creadListPrec @b @e v)]\n-9ebddddd32acde78d76d343abeac6f98\n+01e1d0f19bc63942215ae8c9f70d163f\n $fReadErrorContainer1 ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b1.\n (ErrorContainer b e -> Text.ParserCombinators.ReadP.P b1)\n -> Text.ParserCombinators.ReadP.P b1\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-e3487105287acba6d88c12edfe0076a4\n+a3e8524817e49787ce383b7bd075b784\n $fReadErrorContainer_$creadList ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadP.ReadS [ErrorContainer b e]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2830,15 +2830,15 @@\n <[ErrorContainer b e]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[ErrorContainer b e]>_R)\n @[ErrorContainer b e]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @[ErrorContainer b e]))]\n-3d0e8f84862b3b7665498aaec42d09ac\n+3a72a93156c41549460e909fc0e877b2\n $fReadErrorContainer_$creadListPrec ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n Text.ParserCombinators.ReadPrec.ReadPrec [ErrorContainer b e]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2850,15 +2850,15 @@\n ($fReadErrorContainer1 @b @e $dRead)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0]\n _R))]\n-d59b4842270633cf7dd3f5434556153f\n+8ec4beb736d72d2c31e173adb9e4298e\n $fReadErrorContainer_$creadsPrec ::\n GHC.Read.Read (b (Data.Either.Either e)) =>\n GHC.Types.Int\n -> Text.ParserCombinators.ReadP.ReadS (ErrorContainer b e)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -2873,43 +2873,43 @@\n @b\n @e\n $dRead\n eta\n @(ErrorContainer b e)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(ErrorContainer b e)))]\n-8a911e72f30504a047ef930b1ad4df5b\n+239b4b98d21faeced29a45b033899db1\n $fShowContainer ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Show.Show (Container b a)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n @a\n (v['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Functor.Const.Const a))).\n @(Container b a)\n ($fShowContainer_$cshowsPrec @b @a v)\n ($fShowContainer_$cshow @b @a v)\n ($fShowContainer_$cshowList @b @a v)]\n-2032aae23242b337cc50e1b17b1feacf\n+03befb5b9697a23286491c2a5171cbd9\n $fShowContainer1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"}\"#]\n-a89d6e760355821b353d4df175a57a12\n+c850f02564295824a48796c89dee2ea2\n $fShowContainer2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Container {getContainer = \"#]\n-6ff10b3963dcdb901d12e6b5c9d29aa8\n+e4e44f10c1aaee38bc61867f50694ae8\n $fShowContainer3 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fShowContainer1]\n-40d7e39ea91143799c2facb0f8ca7318\n+17dcf3cf96df0fdc7d29c145a841defe\n $fShowContainer_$cshow ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n Container b a -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2921,15 +2921,15 @@\n $fShowContainer2\n (GHC.Show.showsPrec\n @(b (Data.Functor.Const.Const a))\n $dShow\n $fFoldableContainer4\n x `cast` (N:Container[0] _R _N)\n $fShowContainer3)]\n-ce4af388d4652a876bb15042ab42577f\n+cccbfd60618fadfe386741a113e19b82\n $fShowContainer_$cshowList ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n [Container b a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2940,48 +2940,48 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Container b a)\n (\\ (ds4['GHC.Types.Many] :: Container b a) ->\n $w$cshowsPrec @b @a $dShow 0# ds4)\n ls\n s]\n-9a5620ad453ba01f4b6581dd47cba03a\n+57a5439ab60bebf0d3e87d61933fa6eb\n $fShowContainer_$cshowsPrec ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Types.Int -> Container b a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @b :: (* -> *) -> *\n @a\n ($dShow['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Functor.Const.Const a)))\n (a1['GHC.Types.Many] :: GHC.Types.Int)\n (ds4['GHC.Types.Many] :: Container b a) ->\n case a1 of wild { GHC.Types.I# ww ->\n $w$cshowsPrec @b @a $dShow ww ds4 }]\n-6a4d7f044a37f141e75d3f5c49f69b06\n+a1d778b5c8a6f07ecbd534bc4013f95b\n $fShowErrorContainer ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Show.Show (ErrorContainer b e)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n @e\n (v['GHC.Types.Many] :: GHC.Show.Show (b (Data.Either.Either e))).\n @(ErrorContainer b e)\n ($fShowErrorContainer_$cshowsPrec @b @e v)\n ($fShowErrorContainer_$cshow @b @e v)\n ($fShowErrorContainer_$cshowList @b @e v)]\n-16102b630752639031beab1ef48a2707\n+881e4b184d8e375806420561b18935ec\n $fShowErrorContainer1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ErrorContainer {getErrorContainer = \"#]\n-e3522d5330f9da140b86f9dc5bde53da\n+a3a8e0cb45bff2e4084f2d4e128909b7\n $fShowErrorContainer_$cshow ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n ErrorContainer b e -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -2993,15 +2993,15 @@\n $fShowErrorContainer1\n (GHC.Show.showsPrec\n @(b (Data.Either.Either e))\n $dShow\n $fFoldableContainer4\n x `cast` (N:ErrorContainer[0] _R _N)\n $fShowContainer3)]\n-cf07b3480c4c18f7f7653ba6919c4664\n+d66e87df173660aba33d89475dc72326\n $fShowErrorContainer_$cshowList ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n [ErrorContainer b e] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3012,30 +3012,30 @@\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(ErrorContainer b e)\n (\\ (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n $w$cshowsPrec1 @b @e $dShow 0# ds4)\n ls\n s]\n-0ea750c88e17d9240e26ff1447986485\n+4e04db3093569d41fd33b93d27973cd0\n $fShowErrorContainer_$cshowsPrec ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Types.Int -> ErrorContainer b e -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(L)>, Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @b :: (* -> *) -> *\n @e\n ($dShow['GHC.Types.Many] :: GHC.Show.Show\n (b (Data.Either.Either e)))\n (a['GHC.Types.Many] :: GHC.Types.Int)\n (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n case a of wild { GHC.Types.I# ww ->\n $w$cshowsPrec1 @b @e $dShow ww ds4 }]\n-f6980a1591bb39b7ed578075039c06a7\n+47e658d8808268a6150034f37e162d84\n $fTraversableContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Traversable.Traversable (Container b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -3044,26 +3044,26 @@\n @(Container b)\n ($fTraversableContainer_$cp1Traversable @b v)\n ($fFoldableContainer @b v)\n ($fTraversableContainer_$ctraverse @b v)\n ($fTraversableContainer_$csequenceA @b v)\n ($fTraversableContainer_$cmapM @b v)\n ($fTraversableContainer_$csequence @b v)]\n-717ba1b82fcfe1e0c97a92c767b59de3\n+837ba216895480238e161d3a301e074b\n $fTraversableContainer1 ::\n b2 (Data.Functor.Const.Const b1)\n -> b2 (Data.Functor.Const.Const b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b\n @b1 :: (* -> *) -> *\n (ds4['GHC.Types.Many] :: b1 (Data.Functor.Const.Const b)) ->\n ds4]\n-5dd73eeedb91c97f34520cba50c4f7fe\n+8915ff8f1cd795c03342a89c0fbca8ae\n $fTraversableContainer_$cmapM ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n (a -> m b1) -> Container b a -> m (Container b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3079,15 +3079,15 @@\n @b\n $dTraversableB\n @m\n @a\n @b1\n (GHC.Base.$p1Monad @m $dMonad)\n eta]\n-a9acd131f048e6a1201a0d542b15a8c1\n+3d04e6bdd4f54084ab1b0f572b4f0cfd\n $fTraversableContainer_$cp1Traversable ::\n Barbies.Internal.TraversableB.TraversableB b =>\n GHC.Base.Functor (Container b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3095,15 +3095,15 @@\n b) ->\n $fFunctorContainer\n @b\n (Barbies.Internal.TraversableB.$p1TraversableB\n @(*)\n @b\n $dTraversableB)]\n-462971cce01b67d6ae533ab881c152ad\n+00f758300299633f9620ca19e32f2956\n $fTraversableContainer_$csequence ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n Container b (m a) -> m (Container b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3117,15 +3117,15 @@\n @b\n $dTraversableB\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))]\n-7db0d9c6c53d15a1c9096aabe2833617\n+d015fbc24fdcbd026404b4a79d89a4e2\n $fTraversableContainer_$csequenceA ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n Container b (f a) -> f (Container b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3139,15 +3139,15 @@\n @b\n $dTraversableB\n @f\n @(f a)\n @a\n $dApplicative\n (GHC.Base.id @(f a))]\n-cd8286ace8653153db87b236bfd875db\n+ad18c489c1e856248eee6e01d4521f29\n $fTraversableContainer_$ctraverse ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n (a -> f b1) -> Container b a -> f (Container b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -3203,15 +3203,15 @@\n } in\n \\ (x['GHC.Types.Many] :: Container b a) ->\n f1\n (f2\n ({__scc {Barbies.Internal.Containers.getContainer} True False} x)\n `cast`\n (N:Container[0] _R _N))]\n-200988ac73dc5c04c9b3012f8f8cb679\n+5d8d3672998729a94e16e3c29606ac6a\n $fTraversableErrorContainer ::\n Barbies.Internal.TraversableB.TraversableB b =>\n Data.Traversable.Traversable (ErrorContainer b)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @b :: (* -> *) -> *\n@@ -3220,25 +3220,25 @@\n @(ErrorContainer b)\n ($fTraversableErrorContainer_$cp1Traversable @b v)\n ($fFoldableErrorContainer @b v)\n ($fTraversableErrorContainer_$ctraverse @b v)\n ($fTraversableErrorContainer_$csequenceA @b v)\n ($fTraversableErrorContainer_$cmapM @b v)\n ($fTraversableErrorContainer_$csequence @b v)]\n-9dd937c4276fd52efaae83faed4c19d7\n+e0c0c1ffb4dc112e786e53bc01947ff1\n $fTraversableErrorContainer1 ::\n b2 (Data.Either.Either b1) -> b2 (Data.Either.Either b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b\n @b1 :: (* -> *) -> *\n (ds4['GHC.Types.Many] :: b1 (Data.Either.Either b)) ->\n ds4]\n-5deb0aa08164c14dd484de6acd5cbec9\n+0e60a4215448440890ddde40ee33c089\n $fTraversableErrorContainer_$cmapM ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n (a -> m b1) -> ErrorContainer b a -> m (ErrorContainer b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3254,15 +3254,15 @@\n @b\n $dTraversableB\n @m\n @a\n @b1\n (GHC.Base.$p1Monad @m $dMonad)\n eta]\n-a9809ad39e8a8ba7d5b9c68fa1aa2ed2\n+c78a9c7e1285eafa52b63cbb0a34c158\n $fTraversableErrorContainer_$cp1Traversable ::\n Barbies.Internal.TraversableB.TraversableB b =>\n GHC.Base.Functor (ErrorContainer b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3270,15 +3270,15 @@\n b) ->\n $fFunctorErrorContainer\n @b\n (Barbies.Internal.TraversableB.$p1TraversableB\n @(*)\n @b\n $dTraversableB)]\n-47bc61aca26b8a877f71b805520c7843\n+34c371fb925cd10b7a607263bbb8ebc9\n $fTraversableErrorContainer_$csequence ::\n (Barbies.Internal.TraversableB.TraversableB b, GHC.Base.Monad m) =>\n ErrorContainer b (m a) -> m (ErrorContainer b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3292,15 +3292,15 @@\n @b\n $dTraversableB\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))]\n-4d1931d1877adaf9e790eae074fe9a61\n+3f1f02dadea6ebbb83224a431ba0b264\n $fTraversableErrorContainer_$csequenceA ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n ErrorContainer b (f a) -> f (ErrorContainer b a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -3314,15 +3314,15 @@\n @b\n $dTraversableB\n @f\n @(f a)\n @a\n $dApplicative\n (GHC.Base.id @(f a))]\n-c67d161bcee133bf586ff081e2c2fd92\n+f103f2758e3119ea7a9283eb53d4e261\n $fTraversableErrorContainer_$ctraverse ::\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative f) =>\n (a -> f b1) -> ErrorContainer b a -> f (ErrorContainer b b1)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -3369,135 +3369,135 @@\n } in\n \\ (x['GHC.Types.Many] :: ErrorContainer b a) ->\n f1\n (f2\n ({__scc {Barbies.Internal.Containers.getErrorContainer} True False} x)\n `cast`\n (N:ErrorContainer[0] _R _N))]\n-a7d553536c19c8c89437903e6bd41713\n+abec5944924ceeb57d9923f76fd90c13\n $tc'Container :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11674959523014724987#Word64\n- 1860771261668301389#Word64\n+ 16354380718495274812#Word64\n+ 814762301798279210#Word64\n $trModule\n $tc'Container2\n 2#\n $tc'Container1]\n-9ea44b098e6735e5f7def144b34045a9\n+3c6719a3cf1c52d92e087047398e21be\n $tc'Container1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-ea9b4253927541a2a95f536bcd12d2b9\n+fc2245575b86aeb3426f9a72dc8c0aff\n $tc'Container2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Container3]\n-94cafa23f2389006462d81d5243e5efa\n+e1c0c7493448cabfc6716ffbda7ce454\n $tc'Container3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Container\"#]\n-554f83925b1f0cdb8ec4d9b74879c5f6\n+01583243b60b3294363d61968d75ad77\n $tc'ErrorContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14855527359701066264#Word64\n- 17109921949346698154#Word64\n+ 707883891224460668#Word64\n+ 7429744106433036516#Word64\n $trModule\n $tc'ErrorContainer2\n 2#\n $tc'ErrorContainer1]\n-1dbfd41f241749be3656423a638557d9\n+b853587716ed860d725b3bc6c39f31e8\n $tc'ErrorContainer1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-c1ffa79a9d019db2566092db116fe8cc\n+74bce785af8baf27733fcf4ed4f7bbdc\n $tc'ErrorContainer2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'ErrorContainer3]\n-6095c312432d793e73b37f611b60650e\n+abcd0757ecc44467e35f9d8eaef8eb66\n $tc'ErrorContainer3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'ErrorContainer\"#]\n-94fed29885847ef0e8db48cd49dc25a0\n+e09e42f324addfbda1003c3359d5a2b4\n $tcContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4808676420053827782#Word64\n- 2573184056300013498#Word64\n+ 16357764481247289159#Word64\n+ 11149079116675027957#Word64\n $trModule\n $tcContainer2\n 0#\n $tcContainer1]\n-97a60ed0132472130ac0c191ddfac945\n+6a72172f960f21f1de6a74a4767ccc7a\n $tcContainer1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-652be147eddd34492440c8b9a79bb950\n+034588f16509fb7a7c4f1146ef49eff4\n $tcContainer2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcContainer3]\n-e68bb986b4d2c6850bb15b031a213f04\n+0a6f875d485561491827b0d328a0ca61\n $tcContainer3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Container\"#]\n-e8b95d37184a31288262949263b000ce\n+daec6c3178b5fe2342deb374d72036c8\n $tcErrorContainer :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7004789969558376778#Word64\n- 695522309174708933#Word64\n+ 15701051175288362856#Word64\n+ 16272261420726116207#Word64\n $trModule\n $tcErrorContainer1\n 0#\n $tcContainer1]\n-60311b871bc548b72437eb38fe5aa060\n+afc841f19721252bbfcd0f18d88ec835\n $tcErrorContainer1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcErrorContainer2]\n-44c534df5ccce9c80e19e400dd76466b\n+e387b02bd167a24bab0346af84442d27\n $tcErrorContainer2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ErrorContainer\"#]\n-4e00e18ce73373e0fcc2dc56135038df\n+1182cf7050b799e976f9dcb8fa02b959\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-674ceeaf6454993e22fec7da0006201a\n+b1cf3f1c71f6bbcbed080db8b8d9de1e\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4ff5bda54562710e91dd770a4edc3c83\n+cf034d5cfda3799422a5109b8634ac67\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Containers\"#]\n-f97c70b4c314717c6b1d2536b501d69f\n+a38c26ea0e242de50c46b585f8dad278\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9218a400d5799b5b1f6d3be130b52061\n+c4d162abc812c8123fff7855238d1a44\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-c9da7243e9e8b09eb9fe03767546d0ec\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+24d7546cad2a1acd492deec4705ce6da\n $w$cshowsPrec ::\n GHC.Show.Show (b (Data.Functor.Const.Const a)) =>\n GHC.Prim.Int# -> Container b a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3526,15 +3526,15 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowContainer2\n (f (GHC.CString.unpackAppendCString#\n $fShowContainer1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-1f849665a7bea3b8f85aea6ae5de6c99\n+1b2fb1daeb244f6e6ae87020b1c9c719\n $w$cshowsPrec1 ::\n GHC.Show.Show (b (Data.Either.Either e)) =>\n GHC.Prim.Int# -> ErrorContainer b e -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -3563,92 +3563,92 @@\n @GHC.Types.Char\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShowErrorContainer1\n (f (GHC.CString.unpackAppendCString#\n $fShowContainer1\n (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x)))) }]\n-699f6cf3964a151e54d2903fd8c234e3\n+4cd9cdbdd275a14dd33079c199d840a5\n type role Container representational nominal\n type Container :: ((* -> *) -> *) -> * -> *\n newtype Container b a\n = Container {getContainer :: b (Data.Functor.Const.Const a)}\n-8cb182814fc009809a5b496c9366bbfc\n+318f6a4f8293b61fe472ac68cd957013\n type role ErrorContainer representational nominal\n type ErrorContainer :: ((* -> *) -> *) -> * -> *\n newtype ErrorContainer b e\n = ErrorContainer {getErrorContainer :: b (Data.Either.Either e)}\n-d9e5c3fee3e41f9b0d4349fbd6cbfc0a\n+7ade2c743d23d13ff086e09585424db7\n axiom Rep_Container ::\n GHC.Generics.Rep (Container b a)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Container\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Container\" 'GHC.Generics.PrefixI 'GHC.Types.True)\n (GHC.Generics.S1\n ('GHC.Generics.MetaSel\n ('GHC.Maybe.Just \"getContainer\")\n 'GHC.Generics.NoSourceUnpackedness\n 'GHC.Generics.NoSourceStrictness\n 'GHC.Generics.DecidedLazy)\n (GHC.Generics.Rec0 (b (Data.Functor.Const.Const a)))))\n-cce23f6b1ca4ffd0887552c86d567214\n+22663d5425b5b22b42a5095b1d49c308\n axiom Rep_ErrorContainer ::\n GHC.Generics.Rep (ErrorContainer b e)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"ErrorContainer\"\n \"Barbies.Internal.Containers\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.True)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"ErrorContainer\" 'GHC.Generics.PrefixI 'GHC.Types.True)\n (GHC.Generics.S1\n ('GHC.Generics.MetaSel\n ('GHC.Maybe.Just \"getErrorContainer\")\n 'GHC.Generics.NoSourceUnpackedness\n 'GHC.Generics.NoSourceStrictness\n 'GHC.Generics.DecidedLazy)\n (GHC.Generics.Rec0 (b (Data.Either.Either e)))))\n-a8f965de8a77585eb604c7f0d477e492\n+5d6c7cdb9410697c1699d3288d4ba3d6\n getContainer :: Container b a -> b (Data.Functor.Const.Const a)\n RecSel Left Container\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getContainer1\n `cast`\n (forall (b :: <(* -> *) -> *>_N) (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Container[0] _R _N)]\n-c2889ff71c5faf6f7c86274fd7e178a4\n+21e7989f31581cf01b05f36a9cb80401\n getContainer1 :: Container b a -> Container b a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> * @a (ds4['GHC.Types.Many] :: Container b a) ->\n {__scc {Barbies.Internal.Containers.getContainer} True False} ds4]\n-fa34dbd2e0df8819f2b92894f076b637\n+ad439623074019e6bb1562905220f407\n getErrorContainer :: ErrorContainer b e -> b (Data.Either.Either e)\n RecSel Left ErrorContainer\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getErrorContainer1\n `cast`\n (forall (b :: <(* -> *) -> *>_N) (e :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:ErrorContainer[0] _R _N)]\n-47487e81251c5bd8bd6b74fc49bff05a\n+ee8c05ff9a96f4236ae88f9501231bf8\n getErrorContainer1 :: ErrorContainer b e -> ErrorContainer b e\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n @e\n (ds4['GHC.Types.Many] :: ErrorContainer b e) ->\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Dicts.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Dicts.p_hi", "comments": ["Files 97% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.Dicts 9066\n- interface hash: 21f6eb7cc60d15849501dbaaa3e7ffab\n- ABI hash: 11d9cab4807894b2baa78a0cba8e7494\n- export-list hash: 9f8c69c553b186c41f515294f9b7135a\n+ interface hash: 059e7fd59059fe183dac345cecf217cf\n+ ABI hash: 0c882df337c0ddb4b93d319e9df15dee\n+ export-list hash: aef70c927dc71262ae11a005378b77ba\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 2252bf70aa01462b0ae7a43a53537663\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: f66ac557d003e50b346f058447f6bfbf\n sig of: Nothing\n@@ -32,15 +32,15 @@\n Data.Complex Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.RTS.Flags\n import -/ Data.Functor.Classes 49d38fb3e78a1230bce3b4889c8a6dcf\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n-5f2ddf5529996abc63a6946df67ff16f\n+8bcaf9fbf928188149e8f365fdcbacc9\n $fClassFGkkkcfga ::\n forall k1 k2 k3 (c :: k1 -> k2 -> GHC.Types.Constraint)\n (f :: k3 -> k1) (a :: k3) (g :: k3 -> k2).\n c (f a) (g a) =>\n ClassFG c f g a\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -52,15 +52,15 @@\n -> k1\n -> GHC.Types.Constraint>_N) (f :: k>_N) (a :: _N) (g :: k1>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:ClassFG[0]\n _N _N _N _N _N _N _N))]\n-09511cb944abade6cbbacf3b539f0372\n+f3442b0f31c3994bfef524440f75b29c\n $fClassFGkkkcfga_$cp1ClassFG ::\n forall k1 k2 k3 (c :: k1 -> k2 -> GHC.Types.Constraint)\n (f :: k3 -> k1) (a :: k3) (g :: k3 -> k2).\n c (f a) (g a) =>\n c (f a) (g a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n@@ -70,15 +70,15 @@\n @k2\n @c :: k -> k1 -> GHC.Types.Constraint\n @f :: k2 -> k\n @a :: k2\n @g :: k2 -> k1\n (irred['GHC.Types.Many] :: c (f a) (g a)) ->\n irred]\n-6d8249f164eade28dc493615bb3d42ee\n+0c484de3d8ca8666b8844ee2075ddc4e\n $fClassFkkcfa ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (f :: k2 -> k1)\n (a :: k2).\n c (f a) =>\n ClassF c f a\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n@@ -88,15 +88,15 @@\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (c :: GHC.Types.Constraint>_N) (f :: k>_N) (a :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:ClassF[0]\n _N _N _N _N _N))]\n-c95ddc765c0bd511c05f7b730dff1d88\n+72974069789500f5e6b681f64631011e\n $fClassFkkcfa_$cp1ClassF ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (f :: k2 -> k1)\n (a :: k2).\n c (f a) =>\n c (f a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n@@ -104,370 +104,370 @@\n \\ @k\n @k1\n @c :: k -> GHC.Types.Constraint\n @f :: k1 -> k\n @a :: k1\n (irred['GHC.Types.Many] :: c (f a)) ->\n irred]\n-1b36a88a7bb2f9c83c96a6b45589002c\n+1b6c217629ce99169b407e9c9235a977\n $fEqDict ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Classes.Eq (Dict c a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @c :: k -> GHC.Types.Constraint @a :: k.\n @(Dict c a) ($fEqDict_$c== @k @c @a) ($fEqDict_$c/= @k @c @a)]\n-4608663d90522fa780b87dc64d52e058\n+69b9e14ccd281d2d1574ef2d8cd8f075\n $fEqDict_$c/= ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> Dict c a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (x['GHC.Types.Many] :: Dict c a)\n (y['GHC.Types.Many] :: Dict c a) ->\n GHC.Types.False]\n-d21d37b8157f192e18efc6022145ea47\n+be0f866d475fc4f9d75aa8d968024a7e\n $fEqDict_$c== ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> Dict c a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: Dict c a)\n (ds1['GHC.Types.Many] :: Dict c a) ->\n GHC.Types.True]\n-184a67e5d828306da58623d209c94ffe\n+c5d20170e97a77543cf200ad19d3498c\n $fShow1Dict :: Data.Functor.Classes.Show1 (Dict c)\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Show1],\n Inline: CONLIKE,\n Unfolding: DFun: @c :: * -> GHC.Types.Constraint.\n @(Dict c)\n ($fShow1Dict_$cp1Show1 @c)\n ($fShow1Dict_$cliftShowsPrec @c)\n ($fShow1Dict_$cliftShowList @c)]\n-fc68bb86df1719b7f33f87d450faa03c\n+1cdd4b4eb5af759aa6d63a63925b1711\n $fShow1Dict1 :: Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @a\n @c :: * -> GHC.Types.Constraint\n (ds['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-93f1f1200b775b6ee7af60330c93b522\n+7b336359f144998b1e0eb19f9dc74a48\n $fShow1Dict2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Dict\"#]\n-81a3d2edea968b35bbad5c0efdd002c3\n+96b6f3199cbbcdd49da5f292c11d1915\n $fShow1Dict_$cliftShowList ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Dict c a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n \\ @c :: * -> GHC.Types.Constraint\n @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (eta['GHC.Types.Many] :: [Dict c a])\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Dict c a) ($fShow1Dict1 @a @c) eta eta1]\n-c79b40bcb3a8bb3b8d5734ef3cfb00e9\n+d7981d6efb1582164d2367caa9a0d592\n $fShow1Dict_$cliftShowsPrec ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Dict c a\n -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1!A>,\n Unfolding: Core: \n \\ @c :: * -> GHC.Types.Constraint\n @a\n (ds['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (ds1['GHC.Types.Many] :: [a] -> GHC.Show.ShowS) ->\n $fShow1Dict_$cshowsPrec @(*) @c @a]\n-28dcefd1f72aae796b77e6f60c753bb0\n+c88b3569d35b8a77d869258105a7f53a\n $fShow1Dict_$cp1Show1 ::\n GHC.Show.Show a => GHC.Show.Show (Dict c a)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c :: * -> GHC.Types.Constraint\n @a\n ($dShow['GHC.Types.Many] :: GHC.Show.Show a) ->\n $fShowDict @(*) @c @a]\n-1bfea3d3fc2cd2e1a139dd099c47fb6e\n+7b627c35a690b118d5c522973fe01cd1\n $fShow1Dict_$cshowsPrec ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Types.Int -> Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (ds1['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds1 of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-23de47ae1960a6bf27692f14303bf5d7\n+a20649268f52f7a90cdda1322c90e431\n $fShowDict ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n GHC.Show.Show (Dict c a)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Show.C:Show],\n Inline: CONLIKE,\n Unfolding: DFun: @k @c :: k -> GHC.Types.Constraint @a :: k.\n @(Dict c a)\n ($fShow1Dict_$cshowsPrec @k @c @a)\n ($fShowDict_$cshow @k @c @a)\n ($fShowDict_$cshowList @k @c @a)]\n-29de7ea399c427bc38bc5b0748e12392\n+4ce147e837574ee68c9b81e647e7e3f7\n $fShowDict1 ::\n forall {k} {a :: k} {c :: k -> GHC.Types.Constraint}.\n Dict c a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @a :: k\n @c :: k -> GHC.Types.Constraint\n (ds['GHC.Types.Many] :: Dict c a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Dict irred ->\n GHC.CString.unpackAppendCString# $fShow1Dict2 eta }]\n-f184b26b332b8f78519f016671103d24\n+750ead87a0a50ee8072955343da7840e\n $fShowDict2 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShow1Dict2]\n-223274ca99ff7d0ecab13f12c3e01b88\n+752c971d429b8fa722b862b66153b5b7\n $fShowDict_$cshow ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n Dict c a -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1!A>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (x['GHC.Types.Many] :: Dict c a) ->\n case x of wild { Dict irred -> $fShowDict2 }]\n-053d26b9dd9b456788d153afbcb830e1\n+81093b8cca9ba8b4cc1b8cf9c0aab3b4\n $fShowDict_$cshowList ::\n forall k (c :: k -> GHC.Types.Constraint) (a :: k).\n [Dict c a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @c :: k -> GHC.Types.Constraint\n @a :: k\n (ls['GHC.Types.Many] :: [Dict c a])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Dict c a) ($fShowDict1 @k @a @c) ls s]\n-bfd03fb32b454373dff606fe83ac9af0\n+4f5982279307853ee9a05b7e8c8f594c\n $tc'C:ClassF :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 9962091086868300227#Word64\n- 8845953831145920307#Word64\n+ 15823410447598864844#Word64\n+ 15637787440345167551#Word64\n $trModule\n $tc'C:ClassF2\n 5#\n $tc'C:ClassF1]\n-e43bdab2bac9c5b71822f7d9dd2edab2\n+f6f479eb5ec9d84a38a20a63898d9a58\n $tc'C:ClassF1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-2e5f2a83da5bdf7cbdf30a895f02bb15\n+004d9d00aab7f5d36706711680d07d7d\n $tc'C:ClassF2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:ClassF3]\n-00d1b8cb952e7ce23695801a1c13452b\n+1d13b5da603230f20c7a53eab7dd9a52\n $tc'C:ClassF3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:ClassF\"#]\n-492089e2336e712040f690a19eed92c6\n+297f14aa42ddd4d346d400028e2e0046\n $tc'C:ClassFG :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8175737591424614896#Word64\n- 14521411132137238231#Word64\n+ 17538473654808530638#Word64\n+ 66217755439753604#Word64\n $trModule\n $tc'C:ClassFG2\n 7#\n $tc'C:ClassFG1]\n-efbb0abb348eb02d3e3cc597f0f50360\n+c98c204c787fa52c75a72b6503938020\n $tc'C:ClassFG1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-21826db568a9b8f7ff9ccb01ea2b33c7\n+230666d8df509c0448d2c584e18eefa5\n $tc'C:ClassFG2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'C:ClassFG3]\n-20139cff8481b65ad20a0344fdd4875a\n+08015a7df416a1f51ba3c354b4db5b14\n $tc'C:ClassFG3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'C:ClassFG\"#]\n-0d034d07486b8810a66da72e92ea6b78\n+d72654b7c01ec5b8cc1a6feffaa341c3\n $tc'Dict :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 10981873746971651832#Word64\n- 8654492964909526752#Word64\n+ 10115453066248321123#Word64\n+ 7909610162688476029#Word64\n $trModule\n $tc'Dict2\n 3#\n $tc'Dict1]\n-b162a31002c1668c5b825ac4889387fe\n+cd9bbc9e913fc3e1c98c567138f6c9c2\n $tc'Dict1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-60e77b8e5fbbcee385a383fb056f1811\n+a7f312ea1fe663c76a7c7fc6e3ad9905\n $tc'Dict2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Dict3]\n-3bcc03e687a530e586c9bcffed5f7645\n+7f8c016705efe1248f8b936b836e01d4\n $tc'Dict3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Dict\"#]\n-1093905e5a8a64632d3ffe0739ce9b4d\n+db7942785a33ed4e76820f00ec74214f\n $tcClassF :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2192194475331318293#Word64\n- 12159286453195903486#Word64\n+ 16573094829897681291#Word64\n+ 7117219717354670587#Word64\n $trModule\n $tcClassF2\n 2#\n $tcClassF1]\n-289bbe12db9d7c78f2d0c1a3558beceb\n+5c8a51eb7425f7d635152bbf099b426f\n $tcClassF1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-0aaf25eda53b76aa92412741018b9f9c\n+24c0f40b6b1879c236262cdab7bd107c\n $tcClassF2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcClassF3]\n-1a47105888c690f77f9abac92863a439\n+4a60a41611705a45eb9e0ed43a4a4e01\n $tcClassF3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ClassF\"#]\n-e41c9715c68d9b1299447e7cbbce44eb\n+2f567234bf118301a108cbf8dc5d198c\n $tcClassFG :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15628299198473036439#Word64\n- 8813852324344749869#Word64\n+ 6905121547713486777#Word64\n+ 2215468622041004873#Word64\n $trModule\n $tcClassFG2\n 3#\n $tcClassFG1]\n-dc7abe7e2eb61f349cf831a1d96fb45b\n+a491e2f396025f1639b7d90fbb802ec8\n $tcClassFG1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-4f4fbd160895fe6afd77831e8db383ad\n+3d42e6c068ee5c87276f3fe12a9a0a5a\n $tcClassFG2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcClassFG3]\n-5e702121cd48060b1d4ef614c05b629a\n+cd55d1af4853ea4ae82df0fbd8a19559\n $tcClassFG3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ClassFG\"#]\n-227d2d8b748335c38ef3b9e73d20b1af\n+34906199a19587b5400af3aee2a86070\n $tcDict :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 13896956498795007266#Word64\n- 1622262699365558675#Word64\n+ 14421220535303563688#Word64\n+ 5859309667596463422#Word64\n $trModule\n $tcDict2\n 1#\n $tcDict1]\n-b5624aa5e1a80ca56e68e43fc863043b\n+21606409c14d10f4c18c076286099713\n $tcDict1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-91a2fd963015fcbf953853468908d277\n+f4dffc8da05cb0b7235f7dfb375a9de2\n $tcDict2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $fShow1Dict2]\n-485df9713f0fc2b18091c77227e703fe\n+6a27f0d4c1da52d132e9bb28448188b1\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-40a8d6690c88d3053cae578369e4eeee\n+6ff6da52db330393dddcb8d533a15d79\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-a75f60dba04b683287ca3d2721b6772b\n+ed962f00d50ac18572abc1481cda616f\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Dicts\"#]\n-5c42d8ec8db49122fac8b764e10396e4\n+676fb9d26c88441ce38806d59d76fe0b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-ef2065b9990a1ec95015109c8d679194\n+874dfd6e4c0e2a3f4b04288729e332d1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-b821ba43283d58af1dc72dc522c3f3e0\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+cedbbc004e9d832ea18c4ef8ea2a51e5\n type ClassF :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (k1 -> k) -> k1 -> GHC.Types.Constraint\n class c (f a) => ClassF c f a\n-49f1c53a16ecf58347d2954cac6dea25\n+956656054dd5ddd580072614ba216cb3\n type ClassFG :: forall {k} {k1} {k2}.\n (k -> k1 -> GHC.Types.Constraint)\n -> (k2 -> k) -> (k2 -> k1) -> k2 -> GHC.Types.Constraint\n class c (f a) (g a) => ClassFG c f g a\n-ec60591113f8a2b0cd5ff8ded40ccb22\n+dd2349f8d9e28b14c434ca84ff9690b6\n type role Dict representational nominal\n type Dict :: forall {k}. (k -> GHC.Types.Constraint) -> k -> *\n data Dict c a where\n Dict :: forall {k} (c :: k -> GHC.Types.Constraint) (a :: k).\n c a =>\n Dict c a\n-1ef5ac9bdc38d1886b55376c71cb27fa\n+501619b73143cb187d749df6455ffe8e\n requiringDict ::\n forall {k} (c :: k -> GHC.Types.Constraint) (a :: k) r.\n (c a => r) -> Dict c a -> r\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveB.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveB.p_hi", "comments": ["Files 97% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.DistributiveB [orphan module] 9066\n- interface hash: 245400ef20c23dbaddb0a73b3c329ea1\n- ABI hash: 80d56ad2686884e1a31fedb7de368c13\n- export-list hash: 67f047624c17612bc49b9fde883b9428\n- orphan hash: 52b62608b7bce41d67302745f65aea8c\n+ interface hash: 0f77ee1c575b5a04bddf93ca63b4c1c2\n+ ABI hash: 86907d3a2f9542c8a7e9eb0c9e39c2e1\n+ export-list hash: 35baad0665225d23105900c3f9071c68\n+ orphan hash: 3f3c94da15d0ab0efff9208a89fe2389\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 09bdb01a99bc2ced42488e207e49fe39\n sig of: Nothing\n used TH splices: False\n@@ -21,17 +21,17 @@\n bcotraverse\n bdecompose\n bdistribute'\n brecompose\n gbdistributeDefault\n CanDeriveDistributiveB\n DistributiveB{bdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float Data.Orphans\n GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n@@ -39,43 +39,43 @@\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup Data.Semigroup.Internal\n Data.Type.Ord Data.Version GHC.Generics GHC.IO.Exception GHC.IsList\n GHC.RTS.Flags GHC.Stats Control.DeepSeq Data.Tagged\n Control.Applicative.Backwards Control.Monad.Trans.Identity\n Control.Monad.Trans.Reader Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive 182d125d0a54c88bdc9bb4ac5562d23f\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 3159f20af5067fbbf12f2d1e0a767bd5\n- gdistribute e171f037c4637cf535aaf1fe433ebefc\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive b3b3f8e5e21335496ae8f387d71e93b4\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive b2b99c933ab6f3406ac9b5e18cde4454\n+ gdistribute cf13d51cf58359bcfc62724d72240f25\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Distributive 9619938098769df8b6bccbd10ffe32c5\n-bd977de2771e1a87ec5fdeb822a29e38\n+2a3fcffb3252e0cd2c24b65053928e64\n $dmbdistribute ::\n forall k (b :: (k -> *) -> *) (f :: * -> *) (g :: k -> *).\n (DistributiveB b, CanDeriveDistributiveB b f g,\n GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -305,15 +305,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-b07db7846b1a2bcde0d9a245a10f7aed\n+c5022aa5b9a16e7d81cc890f377ff6d4\n $fDistributiveBkCompose ::\n forall k (h :: * -> *) (b :: (k -> *) -> *).\n (Data.Distributive.Distributive h, DistributiveB b) =>\n DistributiveB (Data.Functor.Compose.Compose h b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -332,15 +332,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkCompose_$cbdistribute @k @h @b v v1)]\n-934fe95089d148e70bbc05ffe68a55da\n+93941b6135f86b76934097122e72b2c3\n $fDistributiveBkCompose1 ::\n forall {k} {h :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (Data.Distributive.Distributive h, DistributiveB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose h b f1 -> h (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -367,15 +367,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-583d7dd8c4d29d612bd1b4f63ffdd68c\n+06a465ce84689ab0c6c693873a45013f\n $fDistributiveBkCompose_$cbdistribute ::\n forall k (h :: * -> *) (b :: (k -> *) -> *) (f :: * -> *)\n (g :: k -> *).\n (Data.Distributive.Distributive h, DistributiveB b,\n GHC.Base.Functor f) =>\n f (Data.Functor.Compose.Compose h b g)\n -> Data.Functor.Compose.Compose\n@@ -426,15 +426,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n *>_N\n _R\n _N\n _N))]\n-df30b81d251212e1fc7da7de06817623\n+56f24f41f4f3fb012e7ecbed01003775\n $fDistributiveBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (DistributiveB a, DistributiveB b) =>\n DistributiveB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -448,15 +448,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fDistributiveBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkProduct_$cbdistribute @k @a @b v v1)]\n-bc2f3cbb27c1d6f37cb6e6e709080137\n+51a567b8396b69ca5a52a04580b37f69\n $fDistributiveBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (DistributiveB a, DistributiveB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -490,15 +490,15 @@\n (($p1DistributiveB @k @b $dDistributiveB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-528100ea41ed0e7ab4706f9885730179\n+6ca58bc20355facfef5acf7fb8080a86\n $fDistributiveBkProduct_$cbdistribute ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: * -> *)\n (g :: k -> *).\n (DistributiveB a, DistributiveB b, GHC.Base.Functor f) =>\n f (Data.Functor.Product.Product a b g)\n -> Data.Functor.Product.Product\n a b (Data.Functor.Compose.Compose f g)\n@@ -545,43 +545,43 @@\n (GHC.Base.fmap\n @f\n $dFunctor\n @(Data.Functor.Product.Product a b g)\n @(b g)\n (sndF @(k -> *) @a @b @g)\n xy))]\n-59515804991c91c1e66b507c0972316f\n+6ccb7fb81ef6b01d4b43267188750658\n $fDistributiveBkProxy :: DistributiveB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fDistributiveBkProxy_$cbdistribute @k)]\n-2005f3bf32e3783a22246cf7c468e6b8\n+67030c0d14c8133390ebe1075100fddd\n $fDistributiveBkProxy_$cbdistribute ::\n forall k (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (Data.Proxy.Proxy g)\n -> Data.Proxy.Proxy (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k\n @f :: * -> *\n @g :: k -> *\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n (ds['GHC.Types.Many] :: f (Data.Proxy.Proxy g)) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Compose.Compose f g)]\n-639c83dd36e4a8e7bfec30f63f77f634\n+8a56764f376081c643dfa9de7044712f\n $fGDistributivek0fRecRec ::\n forall k1 k (f :: * -> *) (b :: (k1 -> *) -> *)\n (b' :: (k1 -> *) -> *) (g :: k1 -> *).\n (GHC.Base.Functor f, DistributiveB b) =>\n Barbies.Generics.Distributive.GDistributive\n 0\n f\n@@ -605,15 +605,15 @@\n @f\n @(Data.Generics.GenericN.Rec (b' (P 0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b' (P 0 (Data.Functor.Compose.Compose f g)))\n (b (Data.Functor.Compose.Compose f g)))\n v\n ($fGDistributivek0fRecRec_$cgdistribute @k1 @k @f @b @b' @g v v1)]\n-e16cbf4692b41ec3368335c5c92f060b\n+cd2aca308a9cab8efab8b919cadc2d93\n $fGDistributivek0fRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (b :: (k1 -> *) -> *)\n (b' :: (k1 -> *) -> *) (g :: k1 -> *) (x :: k).\n (GHC.Base.Functor f, DistributiveB b) =>\n Data.Proxy.Proxy 0\n -> f (Data.Generics.GenericN.Rec (b' (P 0 g)) (b g) x)\n -> Data.Generics.GenericN.Rec\n@@ -670,15 +670,15 @@\n _N\n _P) _N _N)]\n-1adf68ea2dac60933daa4c46eeb615c3\n+06f13203e6c01985f4142b80de4eafc0\n $fGDistributiveknfRecRec ::\n forall k1 k (f :: * -> *) (h :: * -> *) (b :: (k1 -> *) -> *)\n (n :: GHC.TypeNats.Nat) (g :: k1 -> *).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveB b) =>\n Barbies.Generics.Distributive.GDistributive\n n\n@@ -717,15 +717,15 @@\n @h\n @b\n @n\n @g\n v\n v1\n v2)]\n-d2cd5522aa7a3b1bc91cfa05b83d371e\n+1aa910728dffad363654c49cf564b21e\n $fGDistributiveknfRecRec_$cgdistribute ::\n forall k1 k (f :: * -> *) (h :: * -> *) (b :: (k1 -> *) -> *)\n (n :: GHC.TypeNats.Nat) (g :: k1 -> *) (x :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveB b) =>\n Data.Proxy.Proxy n\n -> f (Data.Generics.GenericN.Rec (h (b (P n g))) (h (b g)) x)\n@@ -800,91 +800,91 @@\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-8caab2e37b072045ab35c060756f6a68\n+ce8ea6b624f0b9f38efe1e95e9df4adc\n $tcDistributiveB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15471774058183975324#Word64\n- 12963566728231169884#Word64\n+ 3526910175284033893#Word64\n+ 1659290968467588520#Word64\n $trModule\n $tcDistributiveB2\n 1#\n $tcDistributiveB1]\n-05eb46d2a93037b8c6af74baa190754b\n+e052f7eefe330d2a9555fe6eab2834e9\n $tcDistributiveB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-9001dd58568d6cbc8461b8adc882a101\n+6db3f66364ef60dc160570004be8c77c\n $tcDistributiveB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcDistributiveB3]\n-b7f44c7d863d9eeaf0e1c0eb9d6be848\n+3c532791d1f3a5881dd304dcf4c1d5ed\n $tcDistributiveB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"DistributiveB\"#]\n-334c525f32c955f70d83ccc0234c8e48\n+70a08e43f0d344419e11537179072532\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d96f230cac9c4ad4e76c8ddeb5578ffa\n+c55af8a291c93fab19bd0c6c573aca9f\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-0d39d391acce993f4efd9b297573f858\n+37dd3e0cf096fe907c6a2358b601147c\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.DistributiveB\"#]\n-133f381ddb7e88d95a39cd5c5db42945\n+0e75800ba3e2346ec1be8626534c1f28\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-2aa03346a362cb7f8a339251fd74b4b1\n+9fc7f8841aba83a2ec851a5bc589fc86\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-6d411704fae64df03f8cddbc8aee46df\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+c0dff2dd84d30d6064e5715809259ca8\n type CanDeriveDistributiveB :: forall {k1}.\n ((k1 -> *) -> *) -> (* -> *) -> (k1 -> *) -> GHC.Types.Constraint\n type CanDeriveDistributiveB b f g =\n (Data.Generics.GenericN.GenericP 0 (b g),\n Data.Generics.GenericN.GenericP\n 0 (b (Data.Functor.Compose.Compose f g)),\n Barbies.Generics.Distributive.GDistributive\n 0\n f\n (Data.Generics.GenericN.RepP 0 (b g))\n (Data.Generics.GenericN.RepP\n 0 (b (Data.Functor.Compose.Compose f g))))\n :: GHC.Types.Constraint\n-abc18a05f635f61b778ca554da2cea91\n+e760f6db15922c1a6bf57e10ddec6cce\n type DistributiveB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => DistributiveB b where\n bdistribute :: forall (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n default bdistribute :: forall (f :: * -> *) (g :: k -> *).\n (CanDeriveDistributiveB b f g, GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n-a69bf4edf097f85b68c1f6d227fea6a2\n+391e4937f9da7a79437be14e9018a5cb\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-5b137986834428d60f93c388b01f2dfd\n+a8a061943b1c3b24388fd821cae4be7b\n bcotraverse ::\n (DistributiveB b, GHC.Base.Functor f) =>\n (forall a. f (g a) -> f a) -> f (b g) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -935,15 +935,15 @@\n $dDistributiveB\n @f\n @g\n $dFunctor\n } in\n \\ (x['GHC.Types.Many] :: f (b g)) ->\n f1 (g1 x)]\n-09b00b94e8b880130b026e824bcbf703\n+0142f5300f444349da9d515d163638ab\n bdecompose ::\n DistributiveB b =>\n (a -> b Data.Functor.Identity.Identity) -> b ((->) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -951,15 +951,15 @@\n ($dDistributiveB['GHC.Types.Many] :: DistributiveB b) ->\n {__scc {Barbies.Internal.DistributiveB.bdecompose} True True} bdistribute'\n @b\n @((->) a)\n $dDistributiveB\n (GHC.Base.$fFunctorFUN\n @a)]\n-896f1efd92130f4e15b5ad9acc0dae93\n+63900afaf615a8e78a6f402034631215\n bdistribute' ::\n (DistributiveB b, GHC.Base.Functor f) =>\n f (b Data.Functor.Identity.Identity) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1029,15 +1029,15 @@\n $dDistributiveB\n @f\n @Data.Functor.Identity.Identity\n $dFunctor\n } in\n \\ (x['GHC.Types.Many] :: f (b Data.Functor.Identity.Identity)) ->\n f1 (g x)]\n-62de9518f265581b2d8bc112fc936ade\n+110986f7d420332c06f6d3ded0bdc876\n brecompose ::\n Barbies.Internal.FunctorB.FunctorB b =>\n b ((->) a) -> a -> b Data.Functor.Identity.Identity\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -1061,28 +1061,28 @@\n `cast`\n (forall (a2 :: <*>_N).\n a2>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R))\n bfs]\n-fb1b97c5bd212bae2ac7ae2e0a201ebe\n+69dccefb970d040aadd568bbc2ded2db\n fstF ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(1L,A)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n @a :: k\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f g a) ->\n case ds of wild { Data.Functor.Product.Pair x _y -> x }]\n-262beff7b1bd67aab0cb6c6becf6789e\n+a977933744a01884d0f598c3de1b859f\n gbdistributeDefault ::\n forall {k1} (b :: (k1 -> *) -> *) (f :: * -> *) (g :: k1 -> *).\n (CanDeriveDistributiveB b f g, GHC.Base.Functor f) =>\n f (b g) -> b (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n@@ -1311,15 +1311,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N\n _N))) _N)]\n-03b7a4e328c1bf3a0b7b8084069e2f01\n+5194cbbbb85c54f83450173bf83481b3\n sndF ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(A,1L)>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/DistributiveT.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/DistributiveT.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.DistributiveT [orphan module] 9066\n- interface hash: eac396b873ecb74b614c796261b8b2da\n- ABI hash: ec0109aac7f95a0f49e357c4692172b6\n- export-list hash: e4bb445090ae9da31a739b0e3da69c11\n- orphan hash: 4685e7cea2146174d9c3a0aa7a9545f3\n+ interface hash: 41604778ceb1b5c09770de6973f28e6c\n+ ABI hash: e2516ba32392922786c305c30d832725\n+ export-list hash: ed1c5309290b8a2cf9319bed55a63450\n+ orphan hash: 2de2d74322d5668e7fab241acacde4d6\n flag hash: 91a539610dcef95e6ee242be7fa5dc4f\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 0ae3776247dbe274aa58d6e6b79a6ccf\n sig of: Nothing\n used TH splices: False\n@@ -21,17 +21,17 @@\n gtdistributeDefault\n tcotraverse\n tdecompose\n tdistribute'\n trecompose\n CanDeriveDistributiveT\n DistributiveT{tdistribute}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n distributive-0.6.2.1-KjxcgweLuavE5urVHzHy6k transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float Data.Orphans\n GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n@@ -44,32 +44,32 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive 182d125d0a54c88bdc9bb4ac5562d23f\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 3159f20af5067fbbf12f2d1e0a767bd5\n- gdistribute e171f037c4637cf535aaf1fe433ebefc\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- exports: f80df9d1a671828401e57ca77039e65f\n- FunctorT 8eecefeea9b4af10c28c6418beb8e35f\n- tmap 7daf6eec37127197117907af82691fc2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive b3b3f8e5e21335496ae8f387d71e93b4\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive b2b99c933ab6f3406ac9b5e18cde4454\n+ gdistribute cf13d51cf58359bcfc62724d72240f25\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ exports: e02f5d493ca75ffd2f01042546f54905\n+ FunctorT ae5ec0f7570f82aca6f5f14b2f49b24c\n+ tmap d0b4955d5dbd43342b986bfbb6d3da5d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n@@ -84,17 +84,17 @@\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Control.Monad.Trans.State.Lazy 8427de03afe8955c0c64907138bb8d1e\n import -/ Control.Monad.Trans.State.Strict 29c1fe6de83c54f9690c1f1b22fcbe30\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-fea33652cc24c98386215287659847f9\n+d050a06c1b9665ca1b5cb0f95ccd6538\n $dmtdistribute ::\n forall i (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (DistributiveT t, CanDeriveDistributiveT t f g x) =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -426,29 +426,29 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-77209e646500490a11c4a3649b91fc65\n+e259296066fe5c4cd2a841c4c4851beb\n $fDistributiveTTYPEAccumT ::\n DistributiveT (Control.Monad.Trans.Accum.AccumT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(Control.Monad.Trans.Accum.AccumT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEAccumT_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEAccumT_$ctdistribute @w)]\n-865b8cd908067fa5777d96a0250941fa\n+52de6d4d1f96a0b6ae081d9b89209b48\n $fDistributiveTTYPEAccumT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.Accum.AccumT w g x)\n -> Control.Monad.Trans.Accum.AccumT\n w (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -483,15 +483,15 @@\n _R\n _N\n <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Accum.N:AccumT[0]\n _N\n _R\n _N))]\n-5a045fe566bcb2e0db7f79d6c2e29329\n+07091aa1aaecbf7d05552b0bbd4dfaf9\n $fDistributiveTTYPEBackwards ::\n DistributiveT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -524,15 +524,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Applicative.Backwards.N:Backwards[0]\n <*>_N\n _R) _N))]\n-620d116a5b6e800c20385bfe0d8a3afd\n+4dae03b470eecc52c72611b9013f33b0\n $fDistributiveTTYPECompose ::\n Data.Distributive.Distributive f =>\n DistributiveT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Inline: CONLIKE,\n@@ -546,15 +546,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPECompose_$ctdistribute @f v)]\n-ded675aad8184dffa5877d5d9eca683c\n+3488191d5f19de0a631ac825a4aadd07\n $fDistributiveTTYPECompose1 ::\n Data.Distributive.Distributive f =>\n (forall a. f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A)>,\n Unfolding: Core: \n@@ -571,15 +571,15 @@\n (Data.Distributive.$p1Distributive @f $dDistributive)\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0] <*>_N <*>_N _R _N _N)]\n-164d4bc6c3906043c2fc36aaf8f63daa\n+e187337375ccdd96e2a5ad0d79fe8f31\n $fDistributiveTTYPECompose_$ctdistribute ::\n (Data.Distributive.Distributive f, GHC.Base.Functor f1) =>\n f1 (Data.Functor.Compose.Compose f g x)\n -> Data.Functor.Compose.Compose\n f (Data.Functor.Compose.Compose f1 g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -629,15 +629,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n <*>_N\n _R\n _N\n _N))]\n-7304e7785e2908d3fe230eb3b2004b3a\n+d4edc706ff26cb99901aefba7afd2a09\n $fDistributiveTTYPEExceptT ::\n DistributiveT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @e.\n @(*)\n@@ -672,15 +672,15 @@\n _R\n _N\n _N)\n ; Sym (Control.Monad.Trans.Except.N:ExceptT[0]\n _N\n _R\n _N)))]\n-4cc7ef140ddb21ae9d12c5fdc5273929\n+316504bb31c1bec2b871f27417185282\n $fDistributiveTTYPEIdentityT ::\n DistributiveT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -713,15 +713,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n <*>_N\n _R) _N))]\n-94042a2efdc56a44dd5b79757d870d50\n+57e781779ff38cef4467c99717d5b55a\n $fDistributiveTTYPEMaybeT ::\n DistributiveT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -755,43 +755,43 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R\n _N)))]\n-851d1d1dcc744ab68f3ff22f1c579e6d\n+48e46ec0ba977307820d873110ba24c9\n $fDistributiveTTYPERWST ::\n DistributiveT (Control.Monad.Trans.RWS.Strict.RWST r w s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r @w @s.\n @(*)\n @(Control.Monad.Trans.RWS.Strict.RWST r w s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPERWST_$ctmap @r @w @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPERWST_$ctdistribute @r @w @s)]\n-e5011df9d87199850ffd07b54d01f26f\n+bf13a44a13255e537748d4cca269a64c\n $fDistributiveTTYPERWST0 ::\n DistributiveT (Control.Monad.Trans.RWS.Lazy.RWST r w s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r @w @s.\n @(*)\n @(Control.Monad.Trans.RWS.Lazy.RWST r w s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPERWST0_$ctmap @r @w @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPERWST0_$ctdistribute @r @w @s)]\n-611b224b07ba87e173cf7d60f50d884a\n+a11cc583152b826db4424a42a8004c8f\n $fDistributiveTTYPERWST0_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.RWS.Lazy.RWST r w s g x)\n -> Control.Monad.Trans.RWS.Lazy.RWST\n r w s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -837,15 +837,15 @@\n <(x, s, w)>_N)\n ; Sym (Control.Monad.Trans.RWS.Lazy.N:RWST[0]\n _R\n _N\n _N\n _R\n _N))]\n-d1585e11436db6a32061af1cb9d8d21c\n+35c706e7a867a058131dfd6a34d4caa4\n $fDistributiveTTYPERWST_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.RWS.Strict.RWST r w s g x)\n -> Control.Monad.Trans.RWS.Strict.RWST\n r w s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -891,29 +891,29 @@\n <(x, s, w)>_N)\n ; Sym (Control.Monad.Trans.RWS.Strict.N:RWST[0]\n _R\n _N\n _N\n _R\n _N))]\n-f0ff386220d0f137c10e8110d35957d3\n+1ef758c414a83ea22c971815c937a609\n $fDistributiveTTYPEReaderT ::\n DistributiveT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @r.\n @(*)\n @(Control.Monad.Trans.Reader.ReaderT r)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEReaderT_$ctmap @r)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEReaderT_$ctdistribute @r)]\n-b93f9b4100fd35e378a397132d5011dd\n+a8065815795f7f712965f81248b4d3b3\n $fDistributiveTTYPEReaderT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.Reader.ReaderT r g x)\n -> Control.Monad.Trans.Reader.ReaderT\n r (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -950,15 +950,15 @@\n _R\n _N\n _N)\n ; Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R\n _R\n _N))]\n-97413ed41890b09f0feeb71fdf135b02\n+62d5251d9a03f6c20d9374dc305bc24a\n $fDistributiveTTYPEReverse ::\n DistributiveT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n@@ -990,43 +990,43 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N _N)\n ; Sym (Data.Functor.Reverse.N:Reverse[0]\n <*>_N\n _R) _N))]\n-468bd6d544231027762e3a1e6a519ee9\n+63e2aa81355f53b0f3070b2b7efc656d\n $fDistributiveTTYPEStateT ::\n DistributiveT (Control.Monad.Trans.State.Strict.StateT s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(*)\n @(Control.Monad.Trans.State.Strict.StateT s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEStateT_$ctmap @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEStateT_$ctdistribute @s)]\n-31fd1c28890db5cd22904b716267257c\n+b1090ce55445bbae2ee2f946a1f4d32d\n $fDistributiveTTYPEStateT0 ::\n DistributiveT (Control.Monad.Trans.State.Lazy.StateT s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(*)\n @(Control.Monad.Trans.State.Lazy.StateT s)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEStateT0_$ctmap @s)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fDistributiveTTYPEStateT0_$ctdistribute @s)]\n-212ae98398583e3dd07000363f589d0c\n+44602dbbf15ae44898a629f45bf2a334\n $fDistributiveTTYPEStateT0_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.State.Lazy.StateT s g x)\n -> Control.Monad.Trans.State.Lazy.StateT\n s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -1063,15 +1063,15 @@\n _R\n _N\n <(x, s)>_N)\n ; Sym (Control.Monad.Trans.State.Lazy.N:StateT[0]\n _N\n _R\n _N))]\n-3a8b27777f4da31187bf8b2035a3cd64\n+09388c27c99435f7156191a1d3aa8a17\n $fDistributiveTTYPEStateT_$ctdistribute ::\n GHC.Base.Functor f =>\n f (Control.Monad.Trans.State.Strict.StateT s g x)\n -> Control.Monad.Trans.State.Strict.StateT\n s (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=1),\n@@ -1108,15 +1108,15 @@\n _R\n _N\n <(x, s)>_N)\n ; Sym (Control.Monad.Trans.State.Strict.N:StateT[0]\n _N\n _R\n _N))]\n-ffbdcbde716c94db30bb0d42c19f572a\n+3979ccaa44a23be5af3f634ddf8f9938\n $fDistributiveTTYPEWriterT ::\n DistributiveT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n@@ -1151,15 +1151,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Writer.Strict.N:WriterT[0]\n _N\n _R\n _N)))]\n-dd39a16d556e8a9699cb651b7e957946\n+4aab7baa49424d9024d5853a82c8e6df\n $fDistributiveTTYPEWriterT0 ::\n DistributiveT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:DistributiveT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n@@ -1194,15 +1194,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N <*>_N _R _N <(x, w)>_N)\n ; Sym (Control.Monad.Trans.Writer.Lazy.N:WriterT[0]\n _N\n _R\n _N)))]\n-509c471722a8655b04ed2e99e6f37487\n+8853a15328cc3648d49d31e1d5037165\n $fGDistributivek1fRecRec ::\n forall i k (f :: * -> *) (h :: * -> *) (t :: (* -> *) -> i -> *)\n (g :: * -> *) (x :: i).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveT t) =>\n Barbies.Generics.Distributive.GDistributive\n 1\n@@ -1241,15 +1241,15 @@\n @h\n @t\n @g\n @x\n v\n v1\n v2)]\n-9ab0a748d45b0f0edbb8e84b0d8944f8\n+a048c0340eca66ab98746410fd2cd4f6\n $fGDistributivek1fRecRec0 ::\n forall i k (f :: * -> *) (t :: (* -> *) -> i -> *) (g :: * -> *)\n (x :: i).\n (GHC.Base.Functor f, DistributiveT t) =>\n Barbies.Generics.Distributive.GDistributive\n 1\n f\n@@ -1273,15 +1273,15 @@\n @f\n @(Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x))\n @(Data.Generics.GenericN.Rec\n (t (P 1 (Data.Functor.Compose.Compose f g)) x)\n (t (Data.Functor.Compose.Compose f g) x))\n v\n ($fGDistributivek1fRecRec0_$cgdistribute @i @k @f @t @g @x v v1)]\n-0ec21b292aa9fe1e2dff76a475d82630\n+834e4148cb257727bcf3b43b4d1cdb4e\n $fGDistributivek1fRecRec0_$cgdistribute ::\n forall i k (f :: * -> *) (t :: (* -> *) -> i -> *) (g :: * -> *)\n (x :: i) (x1 :: k).\n (GHC.Base.Functor f, DistributiveT t) =>\n Data.Proxy.Proxy 1\n -> f (Data.Generics.GenericN.Rec (t (P 1 g) x) (t g x) x1)\n -> Data.Generics.GenericN.Rec\n@@ -1335,15 +1335,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-5aff3d1ee56b806b70cb6b31c0ee6c84\n+b3f891e1e896a053e5437f45edb02ad6\n $fGDistributivek1fRecRec_$cgdistribute ::\n forall i k (f :: * -> *) (h :: * -> *) (t :: (* -> *) -> i -> *)\n (g :: * -> *) (x :: i) (x1 :: k).\n (GHC.Base.Functor f, Data.Distributive.Distributive h,\n DistributiveT t) =>\n Data.Proxy.Proxy 1\n -> f (Data.Generics.GenericN.Rec (h (t (P 1 g) x)) (h (t g x)) x1)\n@@ -1420,92 +1420,92 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-7657308133dfe502ccb20ecc24da0d75\n+6c26cdffb0bcd8417468d480f62a66e0\n $tcDistributiveT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11404435686323447200#Word64\n- 7673338768845277249#Word64\n+ 12799498695229957832#Word64\n+ 13843044837134932019#Word64\n $trModule\n $tcDistributiveT2\n 1#\n $tcDistributiveT1]\n-e7645151f743523f14bec9154bcb427a\n+d39d8bf76b6c8d18210975e432577ef7\n $tcDistributiveT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-e017b9f4f9b090c64a525a23431ec48d\n+9411baaaf2d3e2b7f4e861f3bd3ca1ae\n $tcDistributiveT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcDistributiveT3]\n-e2ce07879d8ee8cfa38151e6eb962f4f\n+734138eaca1f0fdea56568b7fcf21349\n $tcDistributiveT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"DistributiveT\"#]\n-68214723152a8160d55b7c260dae2ef7\n+7d2ec9676d5fffe30bcdcd14e6681df7\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-d1fd14bd5191b52ebd3f72364e7e9cdb\n+55153a8aeac5e6fde33dc59ed5beaf97\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-7061d5152dd3413c5d2e38864d9e489d\n+4333d7418cc0a8b889052d3e711c82e9\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.DistributiveT\"#]\n-46c946704ce1a66ea430a42e5ca8227e\n+9072a84ab6d2bdc9ba1adedcde474f82\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-5e3ba795c34bf00298e79e16420932d3\n+bd05fd02ec4223a168c89f3c366c8302\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-481119e21d542aabf6a6b847a4c11114\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+d67949891645cd06851c82920fbec931\n type CanDeriveDistributiveT :: forall i.\n ((* -> *) -> i -> *)\n -> (* -> *) -> (* -> *) -> i -> GHC.Types.Constraint\n type CanDeriveDistributiveT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t g x),\n Data.Generics.GenericN.GenericP\n 1 (t (Data.Functor.Compose.Compose f g) x),\n Barbies.Generics.Distributive.GDistributive\n 1\n f\n (Data.Generics.GenericN.RepP 1 (t g x))\n (Data.Generics.GenericN.RepP\n 1 (t (Data.Functor.Compose.Compose f g) x)))\n :: GHC.Types.Constraint\n-bf60a4b70526597f9806abfbda792bc4\n+3287b4f0ba90375696b0ae382def28bc\n type DistributiveT :: forall i.\n ((* -> *) -> i -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => DistributiveT t where\n tdistribute :: forall (f :: * -> *) (g :: * -> *) (x :: i).\n GHC.Base.Functor f =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n default tdistribute :: forall (f :: * -> *) (g :: * -> *) (x :: i).\n CanDeriveDistributiveT t f g x =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n-2b60b8a3818a60f04c74b8e1aea7247b\n+4fff01273faff63c5d8891d0b590f334\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-6aa513cc490171c3a3e2cb006c9b9acc\n+09f0bf3a135f830c06313001f97ebcee\n gtdistributeDefault ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n CanDeriveDistributiveT t f g x =>\n f (t g x) -> t (Data.Functor.Compose.Compose f g) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n@@ -1837,15 +1837,15 @@\n _N\n _N\n <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N\n _N))) _N)]\n-2dc7e6fe6bf1f4e02803c5fcccf833b7\n+016be32a0da9662c14df822159e8726b\n tcotraverse ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (g :: * -> *)\n (x :: i).\n (DistributiveT t, GHC.Base.Functor f) =>\n (forall a. f (g a) -> f a) -> f (t g x) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1908,15 +1908,15 @@\n @g\n @x\n $dFunctor\n } in\n \\ (x1['GHC.Types.Many] :: f (t g\n x)) ->\n f1 (g1 x1)]\n-5bcdca0f2e664d1fc81634f7cd2be293\n+4f5723c8ae8da00ff81fa74a410ea794\n tdecompose ::\n forall {i} (t :: (* -> *) -> i -> *) a (x :: i).\n DistributiveT t =>\n (a -> t Data.Functor.Identity.Identity x) -> t ((->) a) x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n@@ -1929,15 +1929,15 @@\n @i\n @t\n @((->) a)\n @x\n $dDistributiveT\n (GHC.Base.$fFunctorFUN\n @a)]\n-b01def03abeebe4cc399564d96dac8a8\n+28eae7229d2fc317892c749d705ea543\n tdistribute' ::\n forall {i} (t :: (* -> *) -> i -> *) (f :: * -> *) (x :: i).\n (DistributiveT t, GHC.Base.Functor f) =>\n f (t Data.Functor.Identity.Identity x) -> t f x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -2019,15 +2019,15 @@\n @Data.Functor.Identity.Identity\n @x\n $dFunctor\n } in\n \\ (x1['GHC.Types.Many] :: f (t Data.Functor.Identity.Identity\n x)) ->\n f1 (g x1)]\n-f413036664271a59346594cae1034ca2\n+722eedbd64f0646c25e42b9733b9f082\n trecompose ::\n forall {k'} (t :: (* -> *) -> k' -> *) a (x :: k').\n Barbies.Internal.FunctorT.FunctorT t =>\n t ((->) a) x -> a -> t Data.Functor.Identity.Identity x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorB.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorB.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,66 +1,66 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.FunctorB [orphan module] 9066\n- interface hash: 36aa30777646e6c9751fbcef1d261d6a\n- ABI hash: 5215c73425d0f8767ce576b78637b89c\n- export-list hash: ae757957079040973e48be398804a0fe\n- orphan hash: 3a6a7a8b6168a8561247d0ec64cf81d0\n+ interface hash: d79ba112b1ebe0ededba3b2b9e894b01\n+ ABI hash: 33fac1937871e3c31a09713b2ed12108\n+ export-list hash: 72737807c29b596e79548733975e0291\n+ orphan hash: 84e5418ae531156136ff1a5c0746b8a4\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 346bed84494b1f9e793d2a830c2d5f2f\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gbmapDefault\n CanDeriveFunctorB\n FunctorB{bmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor bfe9ee105ade1417e5f83268a25c6c68\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor c55eefcbafb68adae4442799562f802f\n- gmap 265f473a7200ebd296da064e8ee59d66\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor bfd180435702e8aa8caeea441416de49\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor c171ebf8be4099e43d49f60c5018274b\n+ gmap ffd843e5ac4282689a6c4f73a7e4657c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-044c4b0ca76fa829c24aeefec092885e\n+3d4345847acee665a4d957d640cc194b\n $dmbmap ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (FunctorB b, CanDeriveFunctorB b f g) =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -229,15 +229,15 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))) _N)]\n-2c3642c6e539f45573f83f32ccb89f8b\n+e190ae3c2077d474adf696a7da2ea95c\n $fFunctorBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (GHC.Base.Functor f, FunctorB b) =>\n FunctorB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1!P(1C(1,C(1,L)),A)>,\n@@ -246,15 +246,15 @@\n $fFunctorBkCompose_$cbmap\n `cast`\n (forall (k :: <*>_N) (f :: <* -> *>_N) (b :: <(k -> *) -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-3aa27ffb439cbb3a0bd2a655b99599d2\n+73440c8fdaa8cadaec68235339ac797c\n $fFunctorBkCompose_$cbmap ::\n forall k (f :: * -> *) (b :: (k -> *) -> *) (f1 :: k -> *)\n (g :: k -> *).\n (GHC.Base.Functor f, FunctorB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1\n -> Data.Functor.Compose.Compose f b g\n@@ -292,25 +292,25 @@\n f b f1>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n *>_N\n _R\n _N\n _N))]\n-17b22681a4e0a8e232be9b6421507545\n+da879a58972eb12567e9d28619ab2de6\n $fFunctorBkConst :: FunctorB (Data.Functor.Const.Const x)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkConst_$cbmap\n `cast`\n (forall (k :: <*>_N) (x :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-e92d2fbdd515974a863bcb32ad12a242\n+b1acbb7bb8e67441bca465909aa8ef6a\n $fFunctorBkConst_$cbmap ::\n forall k x (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Functor.Const.Const x f -> Data.Functor.Const.Const x g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n@@ -326,25 +326,25 @@\n -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Const.N:Const[0]\n *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0]\n *>_N _R _P))]\n-d3ee08d51b21bedbe7742634fe46ba35\n+f680d507747be6283182dcaf3c73d699\n $fFunctorBkConstant :: FunctorB (Data.Functor.Constant.Constant x)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkConstant_$cbmap\n `cast`\n (forall (k :: <*>_N) (x :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-9d86a7001fc6d8023899d6e6aad889df\n+0eb246c3f132779fc612f03933460a35\n $fFunctorBkConstant_$cbmap ::\n forall k x (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Functor.Constant.Constant x f\n -> Data.Functor.Constant.Constant x g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=2),\n@@ -361,15 +361,15 @@\n -> *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Constant.N:Constant[0]\n *>_N _R _P\n ; Sym (Data.Functor.Constant.N:Constant[0]\n *>_N _R _P))]\n-6debdd9d9fd712d9574829dc2febde43\n+9eee7b91b7c7a21c8bf65f7122e0e5a4\n $fFunctorBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (FunctorB a, FunctorB b) =>\n FunctorB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4, Strictness: <1!P(L,L)>,\n@@ -379,15 +379,15 @@\n `cast`\n (forall (k :: <*>_N) (a :: <(k -> *) -> *>_N) (b :: <(k -> *)\n -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-3227ab235e7b8fc3514e5ed4f3d50285\n+8f0ab9bb15bc6da3301295129f5f5a94\n $fFunctorBkProduct_$cbmap ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (FunctorB a, FunctorB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -408,39 +408,39 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @g\n ($dFunctorB `cast` (N:FunctorB[0] _N _N) @f @g f1 x)\n ($dFunctorB1 `cast` (N:FunctorB[0] _N _N) @f @g f1 y) }]\n-e8f2a0816315c0f7778af78fd4f98cf6\n+0df8ac28ba0a60dc98d3e81fc4ab4c6b\n $fFunctorBkProxy :: FunctorB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorBkProxy_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (N:FunctorB[0] _N _N))]\n-06e0e78778369145dbf768756656159e\n+a44954fb381e6e808b3de88a4b65ffe1\n $fFunctorBkProxy_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a)\n -> Data.Proxy.Proxy f -> Data.Proxy.Proxy g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n Data.Proxy.Proxy @(k -> *) @g]\n-c2441333ca14e206143be5d81a8fbea8\n+0ec2386a4b754fa9b47e92051d1300e0\n $fFunctorBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (FunctorB a, FunctorB b) =>\n FunctorB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4, Strictness: <1L>,\n@@ -450,15 +450,15 @@\n `cast`\n (forall (k :: <*>_N) (a :: <(k -> *) -> *>_N) (b :: <(k -> *)\n -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorB[0]\n _N _N))]\n-49f5c0fa5e5ec07620cf77eac64fcfc6\n+982f3c8f2ca596e6b165507599485005\n $fFunctorBkSum_$cbmap ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (FunctorB a, FunctorB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -485,15 +485,15 @@\n Data.Functor.Sum.InR x\n -> Data.Functor.Sum.InR\n @(k -> *)\n @a\n @b\n @g\n ($dFunctorB1 `cast` (N:FunctorB[0] _N _N) @f @g f1 x) }]\n-fea1a0b2c17e85248c8c632eabdfd80f\n+a0e4f99059bcf9778bcdcf676f7e2f7c\n $fGFunctorkk10fgRecRec ::\n forall k1 k2 k3 k4 (h :: * -> *) (m :: * -> *)\n (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *) (m' :: k2 -> *)\n (h' :: k3 -> k2) (b' :: (k1 -> *) -> k3).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorB b) =>\n Barbies.Generics.Functor.GFunctor\n 0\n@@ -528,15 +528,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-da91e3dad699693bf20c9d61e7fa0446\n+908cf0b974af10196cce1b474a3b95a9\n $fGFunctorkk10fgRecRec0 ::\n forall k1 k2 k3 (h :: * -> *) (b :: (k1 -> *) -> *) (f :: k1 -> *)\n (g :: k1 -> *) (h' :: k2 -> *) (b' :: (k1 -> *) -> k2).\n (GHC.Base.Functor h, FunctorB b) =>\n Barbies.Generics.Functor.GFunctor\n 0\n f\n@@ -566,15 +566,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-eb2449a55351fd5b2375a5066b1e7da6\n+8c6d7bfe42ff2c3b9e1b9718aa4b93ad\n $fGFunctorkk10fgRecRec0_$cgmap ::\n forall k1 k2 k3 (h :: * -> *) (b :: (k1 -> *) -> *) (f :: k1 -> *)\n (g :: k1 -> *) (h' :: k2 -> *) (b' :: (k1 -> *) -> k2) (x :: k3).\n (GHC.Base.Functor h, FunctorB b) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k1). f a -> g a)\n -> Data.Generics.GenericN.Rec (h' (b' (P 0 f))) (h (b f)) x\n@@ -636,15 +636,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-34d82d67807131be49e1fb128bec3ae4\n+0bb9a0ff9cb7963324701d09b481227d\n $fGFunctorkk10fgRecRec1 ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (b' :: (k -> *) -> *).\n FunctorB b =>\n Barbies.Generics.Functor.GFunctor\n 0\n f\n@@ -668,15 +668,15 @@\n _N\n <0>_N\n _N\n _N\n _N\n _N))]\n-73b37ec5fc900b3723d8bbee6f54843d\n+c4ec5b06985ae17242a0737661ad5c1a\n $fGFunctorkk10fgRecRec1_$cgmap ::\n forall k k1 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (b' :: (k -> *) -> *) (x :: k1).\n FunctorB b =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (b' (P 0 f)) (b f) x\n@@ -723,15 +723,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-66aec0efc3212b0a68cf95ff37a24793\n+dc48213c965a166431f8fa9f5bafa458\n $fGFunctorkk10fgRecRec_$cgmap ::\n forall k1 k2 k3 k4 (h :: * -> *) (m :: * -> *)\n (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *) (m' :: k2 -> *)\n (h' :: k3 -> k2) (b' :: (k1 -> *) -> k3) (x :: k4).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorB b) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k1). f a -> g a)\n@@ -810,88 +810,88 @@\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-9e625c3cf9c943282c41a468e7937632\n+29407c9d63122145f8048798eba59c6d\n $tcFunctorB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 18222313625673957513#Word64\n- 2068769498035295293#Word64\n+ 15756948957532678109#Word64\n+ 11929699411533830653#Word64\n $trModule\n $tcFunctorB2\n 1#\n $tcFunctorB1]\n-a5f044033ffffaa263999c98cd20d530\n+1a7dd0a291d01edf08da8e88dd01dd5e\n $tcFunctorB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-f93c47de414170bb2da020d92a0c9c3b\n+1bc67813811badf623ce95ced1679f1e\n $tcFunctorB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFunctorB3]\n-661ee696d1d707c8693270ef3130acd0\n+d40c2913555594e25e20cad5f5b572bf\n $tcFunctorB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"FunctorB\"#]\n-bf4641218ae0edb681d9197b1433eee5\n+251cad0e49dd1e1b5ccf3769259ead6b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-541e27a3f06373ed1585836102f17727\n+2ce86debf573e9f1092dd444b97dc032\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-3f99edf593ecbdb89a4a7059573a0da1\n+7832f19a2fa0f059f55a7071c2fed0d1\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.FunctorB\"#]\n-f07b00f6ef59fd3f7790fba872cfddcd\n+1c44330b7686417547adc3a6bd24c9ad\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-148e7806932ec7bae08a14067dbe8ad2\n+e5a927a83d7b72cede5ce8738dfd1469\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-a33c546469572fd3f95a04ba9b747b5a\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+9a1d36244895d161a160d150ec7d8d6f\n type CanDeriveFunctorB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveFunctorB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Barbies.Generics.Functor.GFunctor\n 0\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g)))\n :: GHC.Types.Constraint\n-2039eedef490295ecfb676fcb2520788\n+0846d81162bf82239d06a8cc310f49f3\n type FunctorB :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class FunctorB b where\n bmap :: forall (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> b f -> b g\n default bmap :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveFunctorB b f g =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n-397dba72a5366a7a549980b55c40db11\n+9715695b1f925d242c8bc20488d1623c\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-e71f2f31d9bcf3e7045639bfbdb6d365\n+eaf162e2a00e1e55e8e68c63a115552f\n gbmapDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveFunctorB b f g =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/FunctorT.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/FunctorT.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,32 +1,32 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.FunctorT [orphan module] 9066\n- interface hash: 8a2e3695d97f22f96ab8b68568cc7def\n- ABI hash: 740b571b183b6fedf549dc7d55b49ebc\n- export-list hash: f80df9d1a671828401e57ca77039e65f\n- orphan hash: 4ae5d125840f6390e4e9eb4bb728b1b5\n+ interface hash: 80a23a71e6f72418d6502ee3b75d4135\n+ ABI hash: 385628ba6df11d9bcfdcefda46278ea8\n+ export-list hash: e02f5d493ca75ffd2f01042546f54905\n+ orphan hash: 1f4cbee12e246eb658d479650bd1a501\n flag hash: 91a539610dcef95e6ee242be7fa5dc4f\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 0d836fb8f1d36d16b99cafee5bf8e57a\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gtmapDefault\n CanDeriveFunctorT\n FunctorT{tmap}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -36,27 +36,27 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor bfe9ee105ade1417e5f83268a25c6c68\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor c55eefcbafb68adae4442799562f802f\n- gmap 265f473a7200ebd296da064e8ee59d66\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor bfd180435702e8aa8caeea441416de49\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor c171ebf8be4099e43d49f60c5018274b\n+ gmap ffd843e5ac4282689a6c4f73a7e4657c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n@@ -72,17 +72,17 @@\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Control.Monad.Trans.State.Lazy 8427de03afe8955c0c64907138bb8d1e\n import -/ Control.Monad.Trans.State.Strict 29c1fe6de83c54f9690c1f1b22fcbe30\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n addDependentFile \"/usr/lib/ghc/lib/../lib/x86_64-linux-ghc-9.6.6/rts-1.0.2/include/ghcversion.h\" ed2abc0c378d044c7bbfd76a73a209e2\n-addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 59c6674bc8a93fa360c1e25188e6e195\n+addDependentFile \"dist-ghc/build/autogen/cabal_macros.h\" 74fae48a3646cbc72af96dc5afca20fc\n addDependentFile \"/usr/include/stdc-predef.h\" e0e98fa6835be825bf17295c7217815d\n-b37d5747dc8cc6bb7b504c05f997a785\n+1e0e0b1d872ba1f9d8f687b34190d741\n $dmtmap ::\n forall k k' (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n (FunctorT t, CanDeriveFunctorT t f g x) =>\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -327,53 +327,53 @@\n <0 GHC.TypeNats.+ 1>_N)) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n _N <*>_N _N _N <0>_N)))_N))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <1>_N _N))) _N)]\n-8661ffd8b50560c2170db581ed5130bf\n+e85130d2d9a12a3ea5a5687a7ea0a74d\n $fFunctorTTYPETYPEAccumT ::\n FunctorT (Control.Monad.Trans.Accum.AccumT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEAccumT_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-6238e90f4171b32a959728e0ce5506a9\n+da00aed1be2a98ff7ec90c6254b4fdd2\n $fFunctorTTYPETYPEAccumT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Accum.AccumT w f x\n -> Control.Monad.Trans.Accum.AccumT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @w\n @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Monad.Trans.Accum.mapAccumT @f @x @w @g @x (h @(x, w))]\n-7839d61d1860d22827faabfd8da81394\n+2b72239ae02a9bbf90da4be6e5f7209c\n $fFunctorTTYPETYPEExceptT ::\n FunctorT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEExceptT_$ctmap\n `cast`\n (forall (e :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-493a0c259d103a29092a6dd029b8309b\n+7f45cda79f0d98af678a3d1aafa215d3\n $fFunctorTTYPETYPEExceptT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Except.ExceptT e f x\n -> Control.Monad.Trans.Except.ExceptT e g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -386,49 +386,49 @@\n @f\n @e\n @x\n @g\n @e\n @x\n (h @(Data.Either.Either e x))]\n-fcc88964085ff4419f14aad408cf0044\n+ff9379ad5a8e5e2d9aba6355e0236ba9\n $fFunctorTTYPETYPELift :: FunctorT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPELift_$ctmap\n `cast`\n (Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-d852cc2bb2dad781e33bd8a16f4ffcfb\n+8a607000c22de8de4d5f498bcb3a2a64\n $fFunctorTTYPETYPELift_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Applicative.Lift.Lift f x\n -> Control.Applicative.Lift.Lift g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Applicative.Lift.mapLift @f @x @g (h @x)]\n-cd30405a353fec723955585ccacfceef\n+b65c1120f91a1ad5b7477aac3831e6e2\n $fFunctorTTYPETYPEMaybeT ::\n FunctorT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEMaybeT_$ctmap\n `cast`\n (Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-1844709a72297daecc6e037985e34624\n+8c62b79ea1f9e46a255661e98790bcaf\n $fFunctorTTYPETYPEMaybeT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Maybe.MaybeT f x\n -> Control.Monad.Trans.Maybe.MaybeT g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -441,39 +441,39 @@\n x1 `cast` (Control.Monad.Trans.Maybe.N:MaybeT[0] _R _N))\n `cast`\n (forall (f :: <* -> *>_N) (g :: <* -> *>_N) (x :: <*>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R _N))]\n-6f462644bf7e277bbebd492257c9e368\n+3b04c0499c7049fb31fa40022cf26e3f\n $fFunctorTTYPETYPERWST ::\n FunctorT (Control.Monad.Trans.RWS.Strict.RWST r w s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPERWST_$ctmap\n `cast`\n (forall (r :: <*>_N) (w :: <*>_N) (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-a08b5cfab909c6209dcaa7e0ce3ec1fd\n+53a828ad857bc41169f41e50f11448d5\n $fFunctorTTYPETYPERWST0 ::\n FunctorT (Control.Monad.Trans.RWS.Lazy.RWST r w s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPERWST0_$ctmap\n `cast`\n (forall (r :: <*>_N) (w :: <*>_N) (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-121d1acfc07a7794f399facc4955a5e0\n+a2ddb5498abb9d650ab5de9920ec7256\n $fFunctorTTYPETYPERWST0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.RWS.Lazy.RWST r w s f x\n -> Control.Monad.Trans.RWS.Lazy.RWST r w s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -490,15 +490,15 @@\n @s\n @w\n @g\n @x\n @w\n @r\n (h @(x, s, w))]\n-abeea962aae4a297783e126be9a6e65c\n+a17221651ae64b5f6ca86347787cdf47\n $fFunctorTTYPETYPERWST_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.RWS.Strict.RWST r w s f x\n -> Control.Monad.Trans.RWS.Strict.RWST r w s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -515,65 +515,65 @@\n @s\n @w\n @g\n @x\n @w\n @r\n (h @(x, s, w))]\n-65ae6b45ebd12c5f020e3d6bd77b5c0a\n+f3c637ebebbbe991d12f834e39a4391e\n $fFunctorTTYPETYPEReaderT ::\n FunctorT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEReaderT_$ctmap\n `cast`\n (forall (r :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-6faeda134b8309703b120004e6719357\n+fbf37604498ff9aaa6f369d43d977749\n $fFunctorTTYPETYPEReaderT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Reader.ReaderT r f x\n -> Control.Monad.Trans.Reader.ReaderT r g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @r\n @f :: * -> *\n @g :: * -> *\n @x\n (h['GHC.Types.Many] :: forall a. f a -> g a) ->\n Control.Monad.Trans.Reader.mapReaderT @f @x @g @x @r (h @x)]\n-1bfa8caef62fcb883f138b9d3d00f7ce\n+62a0514e5d69ee12bf6010fc42d4096f\n $fFunctorTTYPETYPEStateT ::\n FunctorT (Control.Monad.Trans.State.Strict.StateT s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEStateT_$ctmap\n `cast`\n (forall (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-8d91fe4d71583881705ca9081a720369\n+86391d742d2d7938fcfa4bd8ecc72332\n $fFunctorTTYPETYPEStateT0 ::\n FunctorT (Control.Monad.Trans.State.Lazy.StateT s)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEStateT0_$ctmap\n `cast`\n (forall (s :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-7bc200e7e0ae77485ba22e01f2f2cee0\n+9caed73c3f1a202fa7f7bb12d474ee9d\n $fFunctorTTYPETYPEStateT0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.State.Lazy.StateT s f x\n -> Control.Monad.Trans.State.Lazy.StateT s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -585,15 +585,15 @@\n Control.Monad.Trans.State.Lazy.mapStateT\n @f\n @x\n @s\n @g\n @x\n (h @(x, s))]\n-66e1152962a84f93dbbac1c45045d2db\n+de553979aca5143bef7cdb53a42224d7\n $fFunctorTTYPETYPEStateT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.State.Strict.StateT s f x\n -> Control.Monad.Trans.State.Strict.StateT s g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -605,39 +605,39 @@\n Control.Monad.Trans.State.Strict.mapStateT\n @f\n @x\n @s\n @g\n @x\n (h @(x, s))]\n-680062ea64d2fd894bfecc20eba0f846\n+52d712e4509ad2413afcba602c79765c\n $fFunctorTTYPETYPEWriterT ::\n FunctorT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEWriterT_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-689e8a01306ccea16f7d9ac6a9056c88\n+2f9a71def5cce366be633468554cbe91\n $fFunctorTTYPETYPEWriterT0 ::\n FunctorT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTTYPETYPEWriterT0_$ctmap\n `cast`\n (forall (w :: <*>_N).\n Sym (N:FunctorT[0]\n <*>_N <*>_N _N))]\n-173ab081d325545f46a602a169110917\n+57361af68ccc414ad03e6ac06b27f25f\n $fFunctorTTYPETYPEWriterT0_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Writer.Lazy.WriterT w f x\n -> Control.Monad.Trans.Writer.Lazy.WriterT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -650,15 +650,15 @@\n @f\n @x\n @w\n @g\n @x\n @w\n (h @(x, w))]\n-042b5e2819a4ea9c37ef8b924eb75c40\n+a1f6e56b19f4a17ce2171f2e97b2325a\n $fFunctorTTYPETYPEWriterT_$ctmap ::\n (forall a. f a -> g a)\n -> Control.Monad.Trans.Writer.Strict.WriterT w f x\n -> Control.Monad.Trans.Writer.Strict.WriterT w g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -671,27 +671,27 @@\n @f\n @x\n @w\n @g\n @x\n @w\n (h @(x, w))]\n-b3a2170738931efbf3a5dee531a93c3c\n+642c881bcd930d56f2bf5103a6fb15af\n $fFunctorTk'k'Backwards ::\n FunctorT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Backwards_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-fe0e8f2a2be09e78fb0b16fe2de09980\n+136c4ee020f965ec86a828d71160cc28\n $fFunctorTk'k'Backwards_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Control.Applicative.Backwards.Backwards f x\n -> Control.Applicative.Backwards.Backwards g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n@@ -711,30 +711,30 @@\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R) _N)]\n-49490dd6a528f341ef3aac280b19248e\n+8cea4ae8be283eb10ec3266474be7ae5\n $fFunctorTk'k'Compose ::\n GHC.Base.Functor f => FunctorT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!P(1C(1,C(1,L)),A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseTrue>\n $fFunctorTk'k'Compose_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: <* -> *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:FunctorT[0]\n _N\n _N\n _N))]\n-fb9c9e79c802674166f113e9ccdca1b2\n+5e2a64be7b195e70dfbea4615d8cc369\n $fFunctorTk'k'Compose_$ctmap ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Functor f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x\n -> Data.Functor.Compose.Compose f g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -768,27 +768,27 @@\n f f1 x>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-8ef74564da43ac90c1092b486e99819c\n+d8d6213348dc1cf9e622d135ef937e7a\n $fFunctorTk'k'IdentityT ::\n FunctorT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'IdentityT_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-970c6be34d0fd83a5d72b1ff608d0118\n+766906b1dd27dba137f68e89764785e0\n $fFunctorTk'k'IdentityT_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Control.Monad.Trans.Identity.IdentityT f x\n -> Control.Monad.Trans.Identity.IdentityT g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=1),\n@@ -808,27 +808,27 @@\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R) _N)]\n-4c00a3737e9772e81e083760836d349d\n+3f622e0d54ef395f57896a318aa045b0\n $fFunctorTk'k'Product ::\n forall k' (f :: k' -> *). FunctorT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Product_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-2eb80c05beb1f7d007db9eb0c12d4710\n+73dee846534c79f0e7bebcdd29510be6\n $fFunctorTk'k'Product_$ctmap ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f2 a -> g a)\n -> Data.Functor.Product.Product f1 f2 x\n -> Data.Functor.Product.Product f1 g x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,L)>, CPR: 1,\n@@ -839,26 +839,26 @@\n @f1 :: k' -> *\n @g :: k' -> *\n @x :: k'\n (h['GHC.Types.Many] :: forall (a :: k'). f1 a -> g a)\n (ds['GHC.Types.Many] :: Data.Functor.Product.Product f f1 x) ->\n case ds of wild { Data.Functor.Product.Pair fa ga ->\n Data.Functor.Product.Pair @k' @f @g @x fa (h @x ga) }]\n-6851e57c836f5f4fe41ccab49179e63e\n+f47b64db66562814f347715577bf4b5b\n $fFunctorTk'k'Reverse :: FunctorT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Reverse_$ctmap\n `cast`\n (forall (k' :: <*>_N).\n Sym (N:FunctorT[0]\n _N _N _N))]\n-af8441c327cbe4141c30b6fc07af7fc7\n+ad9a3f70784430f065270fbe65f2524c\n $fFunctorTk'k'Reverse_$ctmap ::\n forall k' (f :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f a -> g a)\n -> Data.Functor.Reverse.Reverse f x\n -> Data.Functor.Reverse.Reverse g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n@@ -874,26 +874,26 @@\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N) (g :: *>_N) (x :: _N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)]\n-1054234fb87d94420d5ce67ad52097fc\n+1da1f3520f8508d51365d03573a7d204\n $fFunctorTk'k'Sum ::\n forall k' (f :: k' -> *). FunctorT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fFunctorTk'k'Sum_$ctmap\n `cast`\n (forall (k' :: <*>_N) (f :: *>_N).\n Sym (N:FunctorT[0] _N _N _N))]\n-ddf4e547d63168da3d6d942b13340512\n+0f7b8eb6eee60e1825339cd675931284\n $fFunctorTk'k'Sum_$ctmap ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (x :: k').\n (forall (a :: k'). f2 a -> g a)\n -> Data.Functor.Sum.Sum f1 f2 x -> Data.Functor.Sum.Sum f1 g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -904,15 +904,15 @@\n @x :: k'\n (h['GHC.Types.Many] :: forall (a :: k'). f1 a -> g a)\n (ds['GHC.Types.Many] :: Data.Functor.Sum.Sum f f1 x) ->\n case ds of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @g @x fa\n Data.Functor.Sum.InR ga\n -> Data.Functor.Sum.InR @k' @f @g @x (h @x ga) }]\n-9b5d6b5aeff0f13eb6face930d6154a8\n+feafaada03abc6809e1f53ce6cd6c8d3\n $fGFunctorkk11fgRecRec ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorT t) =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -943,15 +943,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-4fe0ce78b642d677169de6da6c6e39f6\n+0db6468f3e2667991b5e84eb72b47d04\n $fGFunctorkk11fgRecRec0 ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (GHC.Base.Functor h, FunctorT t) =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -979,15 +979,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-546b02631ae40956b8059ce8c7ae0d29\n+c9cc251856ec1a8fbda3eaef3238852c\n $fGFunctorkk11fgRecRec0_$cgmap ::\n forall k k' k1 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (x1 :: k1).\n (GHC.Base.Functor h, FunctorT t) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (h (t (P 1 f) x)) (h (t f x)) x1\n@@ -1045,15 +1045,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-ab5da8dcc4c52262c5ac24e912805ad9\n+a3f048f43d00144a21f0aeda7c4b8736\n $fGFunctorkk11fgRecRec1 ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n FunctorT t =>\n Barbies.Generics.Functor.GFunctor\n 1\n f\n@@ -1077,15 +1077,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-e95efae905c108813be0db6723a02046\n+c1089a8b476756485f071d85a186317f\n $fGFunctorkk11fgRecRec1_$cgmap ::\n forall k k' k1 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (x1 :: k1).\n FunctorT t =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n -> Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x) x1\n@@ -1132,15 +1132,15 @@\n _P\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-e22b3e22be785f816f34a75ba7628599\n+97a61ce8addeccc85874aca83911f7b2\n $fGFunctorkk11fgRecRec_$cgmap ::\n forall k k' k1 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (x1 :: k1).\n (GHC.Base.Functor h, GHC.Base.Functor m, FunctorT t) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> g a)\n@@ -1211,90 +1211,90 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-96b8ab5613539eac8ef062e5dc9454ce\n+6885a85777b51428ac22d1b57b63e27e\n $tcFunctorT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6751053597812226781#Word64\n- 8775020075333287872#Word64\n+ 14658597566253021173#Word64\n+ 7903216527128616906#Word64\n $trModule\n $tcFunctorT2\n 2#\n $tcFunctorT1]\n-c6b7d77dcbe23e48f3842ff36b563a09\n+c19ceb8cffdeb002fd07190890b62e14\n $tcFunctorT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-1b119a0f711d9f056ed744e214c80da2\n+1ad19da9ca2dfbc9167cc91c08914778\n $tcFunctorT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcFunctorT3]\n-c9cc504dc511bdea8aa2b95dca76c36f\n+1041d5040913618ed5635cc426a66cad\n $tcFunctorT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"FunctorT\"#]\n-995d5aa18cc07d449cd305406cfad6cc\n+f0f513c879a9c35f1bc19205858a1271\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-e9021bde4ee6ca4e6b30a14d276976e7\n+90f96debfe43404598abde3bab41d31f\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4a9e5f1307d0dc14da58a7c5807fe190\n+7defdc4a0081e46639d2628b408b4ac0\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.FunctorT\"#]\n-2410030ef5e3623bd42235a34f2daa83\n+b93436141ffd0f5fe3b3b9e93e4cf463\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fd8d4f8c143806ea4f2a02a454cef830\n+ea099a2e4a80a0ff037ee77a422ee501\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-24f80aeaed8a04f8758f9910125fd871\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+b1bd7a710ee8f1124c448f9c98f78a7e\n type CanDeriveFunctorT :: forall {k} {k1}.\n ((k -> *) -> k1 -> *)\n -> (k -> *) -> (k -> *) -> k1 -> GHC.Types.Constraint\n type CanDeriveFunctorT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Barbies.Generics.Functor.GFunctor\n 1\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x)))\n :: GHC.Types.Constraint\n-8eecefeea9b4af10c28c6418beb8e35f\n+ae5ec0f7570f82aca6f5f14b2f49b24c\n type FunctorT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class FunctorT t where\n tmap :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n default tmap :: forall (f :: k -> *) (g :: k -> *) (x :: k').\n CanDeriveFunctorT t f g x =>\n (forall (a :: k). f a -> g a) -> t f x -> t g x\n-9508a024aed85a3d37cff0009fdc4009\n+c8e297581604b9347d5c6e275575738a\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-b2a1bf83d053dbba2bb641073ccb9e8d\n+1b03232ed8638adf0fea411fa67d6438\n gtmapDefault ::\n forall {k1} {k2} (t :: (k1 -> *) -> k2 -> *) (f :: k1 -> *)\n (g :: k1 -> *) (x :: k2).\n CanDeriveFunctorT t f g x =>\n (forall (a :: k1). f a -> g a) -> t f x -> t g x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/MonadT.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/MonadT.p_hi", "comments": ["Files 90% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,29 +1,29 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.MonadT 9066\n- interface hash: a30356964d91f8c851fcea98890070de\n- ABI hash: 2e45532830ced35fcf64ea307ca3f5c2\n- export-list hash: 34162405ec478d3f9aacb5beb1bd0be5\n+ interface hash: 3957bf6f25381f323a5ca8c2938e1e20\n+ ABI hash: a5e6475ab282416ed2d4778ea69017b2\n+ export-list hash: 847c759e05e334128713d431e8407f6d\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 67a5205f8269836ce813133a487f57b0\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a1c28b3136060853fd5ab89156561301\n sig of: Nothing\n used TH splices: False\n where\n exports:\n MonadT{tembed tjoin tlift}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -33,33 +33,33 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- exports: f80df9d1a671828401e57ca77039e65f\n- FunctorT 8eecefeea9b4af10c28c6418beb8e35f\n- tmap 7daf6eec37127197117907af82691fc2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ exports: e02f5d493ca75ffd2f01042546f54905\n+ FunctorT ae5ec0f7570f82aca6f5f14b2f49b24c\n+ tmap d0b4955d5dbd43342b986bfbb6d3da5d\n import -/ Control.Applicative 96cb359fa425348e301db4972e211d90\n import -/ Control.Monad a8552ca25f5dcd7ee6fb611cbb0ec055\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Control.Applicative.Backwards 3fb0e914e7e0118ebd824606855e73c5\n import -/ Control.Applicative.Lift 4c061bd1a73d1b6820b48c8d4eb45f87\n import -/ Control.Monad.Trans.Identity c6d9f8408d560420ccee35cf25d55d29\n import -/ Control.Monad.Trans.Reader f0f89c719914f6308eba0116ac42816b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n-f0595d0d91433e3bca6376c2d735e2c8\n+3d3d295c5950ec5aa975d35acd1b6714\n $dmtembed ::\n forall {k'} (t :: (k' -> *) -> k' -> *) (f :: k' -> *)\n (g :: k' -> *) (a :: k').\n (MonadT t, MonadT t) =>\n (forall (x :: k'). f x -> t g x) -> t f a -> t g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -82,15 +82,15 @@\n (Barbies.Internal.FunctorT.N:FunctorT[0] _N _N _N)\n @f\n @(t g)\n @a\n eta1\n } in\n \\ (x['GHC.Types.Many] :: t f a) -> f1 (g1 x)]\n-1db8f3e2197581b16e9f75b25493e1d9\n+a4078beaee5e2c4599c4ad75a9dc5c88\n $dmtjoin ::\n forall {k'} (t :: (k' -> *) -> k' -> *) (f :: k' -> *) (a :: k').\n MonadT t =>\n t (t f) a -> t f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -104,15 +104,15 @@\n @t\n $dMonadT\n @(t f)\n @f\n @a\n $dMonadT\n (\\ @x :: k' -> GHC.Base.id @(t f x))]\n-b985059b4a22fe343099786da19513d5\n+d223c9464f9767fff1a89197ac312315\n $fMonadTTYPELift :: MonadT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @Control.Applicative.Lift.Lift\n@@ -127,15 +127,15 @@\n (ds['GHC.Types.Many] :: Control.Applicative.Lift.Lift\n (Control.Applicative.Lift.Lift f) a) ->\n case ds of wild {\n Control.Applicative.Lift.Pure a1\n -> Control.Applicative.Lift.Pure @f @a a1\n Control.Applicative.Lift.Other ds1 -> ds1 })\n $fMonadTTYPELift_$ctembed]\n-b9a4bfdd39c481922172b32ab7fa7a07\n+a8fef0b7200447837ecd1c82a338bb74\n $fMonadTTYPELift_$ctembed ::\n MonadT Control.Applicative.Lift.Lift =>\n (forall x. f x -> Control.Applicative.Lift.Lift g x)\n -> Control.Applicative.Lift.Lift f a\n -> Control.Applicative.Lift.Lift g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n@@ -147,15 +147,15 @@\n (ds['GHC.Types.Many] :: forall x.\n f x -> Control.Applicative.Lift.Lift g x)\n (x['GHC.Types.Many] :: Control.Applicative.Lift.Lift f a) ->\n case x of wild {\n Control.Applicative.Lift.Pure x1\n -> Control.Applicative.Lift.Pure @g @a x1\n Control.Applicative.Lift.Other e -> ds @a e }]\n-bf22138da40d4b7364362718ee0444fa\n+c4f4ab90195a8b532ddccc4d18095a1c\n $fMonadTTYPEProduct ::\n GHC.Base.Alternative f => MonadT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n (v['GHC.Types.Many] :: GHC.Base.Alternative f).\n@@ -164,15 +164,15 @@\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @(*) @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fMonadTTYPEProduct_$ctlift @f v)\n ($fMonadTTYPEProduct_$ctjoin @f v)\n ($fMonadTTYPEProduct_$ctembed @f v)]\n-b8262467e4ae1e6fa967baeddff3d8e8\n+e40249db4a9fb42eb1f50488fbfc2694\n $fMonadTTYPEProduct_$ctembed ::\n (GHC.Base.Alternative f,\n MonadT (Data.Functor.Product.Product f)) =>\n (forall x. f1 x -> Data.Functor.Product.Product f g x)\n -> Data.Functor.Product.Product f f1 a\n -> Data.Functor.Product.Product f g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -206,15 +206,15 @@\n f (Data.Functor.Product.Product f g) a\n -> Data.Functor.Product.Product f g a\n []\n = tjoin @(*) @(Data.Functor.Product.Product f) $dMonadT @g @a\n } in\n \\ (x['GHC.Types.Many] :: Data.Functor.Product.Product f f1 a) ->\n f2 (g1 x)]\n-01f527706546cfd9d8802e3287727c42\n+26e66049a00d6c71d89b41d5977467d8\n $fMonadTTYPEProduct_$ctjoin ::\n GHC.Base.Alternative f =>\n Data.Functor.Product.Product\n f (Data.Functor.Product.Product f f1) a\n -> Data.Functor.Product.Product f f1 a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!P(L,1!P(L,L))>,\n@@ -231,15 +231,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @a\n (GHC.Base.<|> @f $dAlternative @a fa fa')\n ga } }]\n-69d8b5fc3fe31c8d9d629ddb3d887990\n+ff4ad9b5aae0f6046be3079bc5999c11\n $fMonadTTYPEProduct_$ctlift ::\n GHC.Base.Alternative f =>\n f1 a -> Data.Functor.Product.Product f f1 a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Inline: (sat-args=0),\n Unfolding: Core: StableUser <1,FalseFalse>\n@@ -251,15 +251,15 @@\n Data.Functor.Product.Pair\n @(*)\n @f\n @f1\n @a\n (GHC.Base.empty @f $dAlternative @a)\n eta]\n-7c7b508479205435eb2664e0e78324c7\n+a429943ffeb7ac23a2e1e98b986440e1\n $fMonadTTYPEReaderT ::\n MonadT (Control.Monad.Trans.Reader.ReaderT r)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @r.\n @(*)\n@@ -285,15 +285,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Control.Monad.Trans.Reader.ReaderT r g x>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R _R _N))]\n-1cba710cf4f88d6ce28673fe86cb7032\n+773c789a0a1215c97b87ead35b14e39a\n $fMonadTTYPEReaderT1 ::\n MonadT (Control.Monad.Trans.Reader.ReaderT r) =>\n (forall x. f x -> Control.Monad.Trans.Reader.ReaderT r g x)\n -> Control.Monad.Trans.Reader.ReaderT r f a -> r -> g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1C(1,C(1,L))>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n@@ -311,15 +311,15 @@\n @a\n (x `cast`\n (Control.Monad.Trans.Reader.N:ReaderT[0] _R _R _N)\n eta))\n `cast`\n (Control.Monad.Trans.Reader.N:ReaderT[0] _R _R _N)\n eta]\n-387cd47022c017fe6c3789fa6e91033a\n+d9f14234c2de4b8e50b291c3102b6d3d\n $fMonadTTYPEReaderT_$ctjoin ::\n Control.Monad.Trans.Reader.ReaderT\n r (Control.Monad.Trans.Reader.ReaderT r f) a\n -> Control.Monad.Trans.Reader.ReaderT r f a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,C(1,L))>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n@@ -340,15 +340,15 @@\n e)\n `cast`\n (forall (r :: <*>_N) (f :: <* -> *>_N) (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Reader.N:ReaderT[0]\n _R _R _N))]\n-d34b5258300ee8e3898d5433cf1f08b5\n+24ae8903cc10730b577e136bde5d8db5\n $fMonadTk'Backwards ::\n MonadT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -375,15 +375,15 @@\n %<'GHC.Types.Many>_N ->_R Control.Applicative.Backwards.N:Backwards[0]\n _N\n (Control.Applicative.Backwards.N:Backwards[0]\n _N\n (Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R))) _N)\n ($fMonadTk'Backwards_$ctembed @k')]\n-45ca9042759d1a0520316adbf7760ab6\n+a0c3dec464f254eb657826571328f30d\n $fMonadTk'Backwards_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Control.Applicative.Backwards.Backwards =>\n (forall (x :: k').\n f x -> Control.Applicative.Backwards.Backwards g x)\n -> Control.Applicative.Backwards.Backwards f a\n -> Control.Applicative.Backwards.Backwards g a\n@@ -400,15 +400,15 @@\n f x -> Control.Applicative.Backwards.Backwards g x)\n (x['GHC.Types.Many] :: Control.Applicative.Backwards.Backwards\n f a) ->\n ds\n @a\n x `cast`\n (Control.Applicative.Backwards.N:Backwards[0] _N _R _N)]\n-e3625a434265153f46166b4329ac940f\n+4e311fdff439559c402898f1b0f08c85\n $fMonadTk'Compose ::\n GHC.Base.Monad f => MonadT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n Inline: CONLIKE,\n@@ -425,15 +425,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fMonadTk'Compose_$ctlift @k' @f v)\n ($fMonadTk'Compose_$ctjoin @k' @f v)\n ($fMonadTk'Compose_$ctembed @k' @f v)]\n-be1ea02099fce61ace3ca46f00ccefa2\n+8c7ed97238dc0315d481395f78cffe9e\n $fMonadTk'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n GHC.Base.Monad f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1P(1C(1,C(1,L)),A),A,A,A,A,A),A,A,A)>,\n@@ -452,15 +452,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-a3ec4cd24fccc22e047145c58e3b1e16\n+0c5a1b85e18e161057c2bdf38d265dea\n $fMonadTk'Compose_$ctembed ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (g :: k' -> *) (a :: k').\n (GHC.Base.Monad f, MonadT (Data.Functor.Compose.Compose f)) =>\n (forall (x :: k'). f1 x -> Data.Functor.Compose.Compose f g x)\n -> Data.Functor.Compose.Compose f f1 a\n -> Data.Functor.Compose.Compose f g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -495,15 +495,15 @@\n f (Data.Functor.Compose.Compose f g) a\n -> Data.Functor.Compose.Compose f g a\n []\n = tjoin @k' @(Data.Functor.Compose.Compose f) $dMonadT @g @a\n } in\n \\ (x['GHC.Types.Many] :: Data.Functor.Compose.Compose f f1 a) ->\n f2 (g1 x)]\n-1f8de7477da37fa98d71ff613e7ba250\n+c5a44f5d23dc69b85331678fe2a6565d\n $fMonadTk'Compose_$ctjoin ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (a :: k').\n GHC.Base.Monad f =>\n Data.Functor.Compose.Compose\n f (Data.Functor.Compose.Compose f f1) a\n -> Data.Functor.Compose.Compose f f1 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -546,15 +546,15 @@\n f (Data.Functor.Compose.Compose f f1) a>_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-ec7d2229e94620f590c2dd38779f18b3\n+e1d735864010777818b4d722034d0717\n $fMonadTk'Compose_$ctlift ::\n forall k' (f :: * -> *) (f1 :: k' -> *) (a :: k').\n GHC.Base.Monad f =>\n f1 a -> Data.Functor.Compose.Compose f f1 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!P(1!P(A,1C(1,L),A,A,A,A),A,A,A)>,\n Inline: (sat-args=0),\n@@ -573,15 +573,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N))]\n-19cf74290d11ac9145914699d0a3b5ef\n+124423861d458db524cf9931c213c3d2\n $fMonadTk'IdentityT ::\n MonadT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n@@ -608,15 +608,15 @@\n %<'GHC.Types.Many>_N ->_R Control.Monad.Trans.Identity.N:IdentityT[0]\n _N\n (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N\n (Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R))) _N)\n ($fMonadTk'IdentityT_$ctembed @k')]\n-ec052b00c177c54c25abccbdf2126a3f\n+76d046fa15c5b2cf6cd90a7db9bba8cd\n $fMonadTk'IdentityT_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Control.Monad.Trans.Identity.IdentityT =>\n (forall (x :: k').\n f x -> Control.Monad.Trans.Identity.IdentityT g x)\n -> Control.Monad.Trans.Identity.IdentityT f a\n -> Control.Monad.Trans.Identity.IdentityT g a\n@@ -633,15 +633,15 @@\n f x -> Control.Monad.Trans.Identity.IdentityT g x)\n (x['GHC.Types.Many] :: Control.Monad.Trans.Identity.IdentityT\n f a) ->\n ds\n @a\n x `cast`\n (Control.Monad.Trans.Identity.N:IdentityT[0] _N _R _N)]\n-03302d1362e4d880c714b062ca3a5e14\n+2bb27cba465550daacd3eda6b200d167\n $fMonadTk'Reverse :: MonadT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @Data.Functor.Reverse.Reverse\n@@ -666,15 +666,15 @@\n %<'GHC.Types.Many>_N ->_R Data.Functor.Reverse.N:Reverse[0]\n _N\n (Data.Functor.Reverse.N:Reverse[0]\n _N\n (Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R))) _N)\n ($fMonadTk'Reverse_$ctembed @k')]\n-b62906600ccaf34df59674c83cc798a0\n+65e2c81195a179013a84f3a3d0e1f54d\n $fMonadTk'Reverse_$ctembed ::\n forall k' (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT Data.Functor.Reverse.Reverse =>\n (forall (x :: k'). f x -> Data.Functor.Reverse.Reverse g x)\n -> Data.Functor.Reverse.Reverse f a\n -> Data.Functor.Reverse.Reverse g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -687,15 +687,15 @@\n ($dMonadT['GHC.Types.Many] :: MonadT Data.Functor.Reverse.Reverse)\n (ds['GHC.Types.Many] :: forall (x :: k').\n f x -> Data.Functor.Reverse.Reverse g x)\n (x['GHC.Types.Many] :: Data.Functor.Reverse.Reverse f a) ->\n ds\n @a\n x `cast` (Data.Functor.Reverse.N:Reverse[0] _N _R _N)]\n-acc630e7d1fb8a5a5c0ae6dd972f17c6\n+1f2dfba208a3766949f6cc110c34e261\n $fMonadTk'Sum ::\n forall k' (f :: k' -> *). MonadT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:MonadT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n @k'\n@@ -704,15 +704,15 @@\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n (\\ @f1 :: k' -> * @a :: k' (ds['GHC.Types.Many] :: f1 a) ->\n Data.Functor.Sum.InR @k' @f @f1 @a ds)\n ($fMonadTk'Sum_$ctjoin @k' @f)\n ($fMonadTk'Sum_$ctembed @k' @f)]\n-37d6af8b559f0f1b77de7c1e5b46641a\n+9fee421e83baa0e50856c5692ab5f263\n $fMonadTk'Sum_$ctembed ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT (Data.Functor.Sum.Sum f1) =>\n (forall (x :: k'). f2 x -> Data.Functor.Sum.Sum f1 g x)\n -> Data.Functor.Sum.Sum f1 f2 a -> Data.Functor.Sum.Sum f1 g a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n@@ -725,15 +725,15 @@\n ($dMonadT['GHC.Types.Many] :: MonadT (Data.Functor.Sum.Sum f))\n (ds['GHC.Types.Many] :: forall (x :: k').\n f1 x -> Data.Functor.Sum.Sum f g x)\n (x['GHC.Types.Many] :: Data.Functor.Sum.Sum f f1 a) ->\n case x of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @g @a fa\n Data.Functor.Sum.InR ga -> ds @a ga }]\n-5ab908c707f41b649cff04e6a93ee688\n+8d53e96331aeab48cbfa0556ff5cd684\n $fMonadTk'Sum_$ctjoin ::\n forall k' (f1 :: k' -> *) (f2 :: k' -> *) (a :: k').\n Data.Functor.Sum.Sum f1 (Data.Functor.Sum.Sum f1 f2) a\n -> Data.Functor.Sum.Sum f1 f2 a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -742,64 +742,64 @@\n @f1 :: k' -> *\n @a :: k'\n (ds['GHC.Types.Many] :: Data.Functor.Sum.Sum\n f (Data.Functor.Sum.Sum f f1) a) ->\n case ds of wild {\n Data.Functor.Sum.InL fa -> Data.Functor.Sum.InL @k' @f @f1 @a fa\n Data.Functor.Sum.InR ds1 -> ds1 }]\n-7dac82c3185121b0a978cb162c501420\n+a052e400a5d8236c20ecf381cc805a45\n $tcMonadT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3580657594039770991#Word64\n- 15043022534608447110#Word64\n+ 4185748482054427665#Word64\n+ 16106999681576663642#Word64\n $trModule\n $tcMonadT2\n 1#\n $tcMonadT1]\n-38a1054205666877893c9ab559ed3c9d\n+71d9972b35c954a82a2e80c094de1865\n $tcMonadT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a6ab65e404e8c85f74575ccb89e3f711\n+6631c6fbe2af33d23eb6189c19df90b6\n $tcMonadT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcMonadT3]\n-72d5c40ca5adbce17bb492232fe7d45f\n+ff1b9596d9bff0a9973d3640f08a8fde\n $tcMonadT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"MonadT\"#]\n-83763ad1247bc44b5aa5279131a9551b\n+683f50c8eef617167a73dbe7d0da3259\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-06ab1c76e69d2d079c35e048effa5906\n+94050f02e16bc2a429be27402e2ac554\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-be7d31b0b4539d0a0b4c08de4d454fdc\n+8128d766ba0d2133060a8447ef3ee543\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.MonadT\"#]\n-f80382551d6d88f18b6a9c0094d4cdb3\n+cffcac7810ae7c224c1f46b261802f39\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-20a3304453d1588015b5eeb6dd949790\n+0e07036d0d7936af110208dd72d26d55\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-97dbe0e46fe68cde416cece814284e6f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+901f738abac3be5c36af79b68794e7ff\n type MonadT :: forall {k'}.\n ((k' -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => MonadT t where\n tlift :: forall (f :: k' -> *) (a :: k'). f a -> t f a\n tjoin :: forall (f :: k' -> *) (a :: k'). t (t f) a -> t f a\n tembed :: forall (f :: k' -> *) (g :: k' -> *) (a :: k').\n MonadT t =>\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableB.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableB.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.TraversableB [orphan module] 9066\n- interface hash: 9c01741a6b5f89caeb88d4a7283a6213\n- ABI hash: b69366efe3ba5e39658c918b8401e4c9\n- export-list hash: a8196cc20ebeb66df453e15c78d677c9\n- orphan hash: 35d1d872840c54582ff51dd170c44a5a\n+ interface hash: 4c24b56625c566a786301d73af6b08ba\n+ ABI hash: b9e873dc2abb3de19a48edc0b46ae5d1\n+ export-list hash: 6564e0103587f68d905c5ccbec42ca55\n+ orphan hash: 31abe1296b545370341cd09e67136ad4\n flag hash: 50ad4a09a94929385a28b5775c91be29\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 954f0b465549c0404fb9a3c25eca6418\n sig of: Nothing\n used TH splices: False\n@@ -21,62 +21,62 @@\n bfoldMap\n bsequence\n bsequence'\n btraverse_\n gbtraverseDefault\n CanDeriveTraversableB\n TraversableB{btraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable 78ba5b8127485172bcdfb5f1a7a2be9f\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 07978d60099125b7617e0fdd0bfa9d0e\n- gtraverse 479847134d0fca5201cb163e7c365d6d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 78d58e8d27c1b5f724f59e41fe333ec9\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr 921a5c36501ebb74282d24aea2b9b5ce\n- tell f41472543dcc450dda0d5b8970f323cd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 24c2969b48d69b5d87bd0015edc00ed7\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable 6bc69f1d03cbd1e58f9a67d23d07f501\n+ gtraverse 70ec7cdfe89035cca9af3957b43ff6c2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer efe86a57d978c86b92ee78dca96ae213\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 0ba0f5f1de1b3cb4ff96e635320656e1\n+ tell e2ec237cb577cbd4bb2ed4024c55188f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Data.Functor.Constant 52282bc1bf385e3c7296f6c86c5c51f5\n-33c9ecddeeebba17235040223b27e7e0\n+39bc82b37538be32d65c21dd7267e389\n $dmbtraverse ::\n forall k (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (TraversableB b, GHC.Base.Applicative e,\n CanDeriveTraversableB b f g) =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -273,15 +273,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n <*>_N\n <0>_N\n _N\n _N))_N\n _N)_R) _N))]\n-2ec7a72d116c6898db54a704a86cfee5\n+14324638cf1de732a54815ecbc229377\n $fGTraversableNaturalkk20fgRecRec ::\n forall k k2 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableB b) =>\n Barbies.Generics.Traversable.GTraversable\n 0\n@@ -311,15 +311,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-db94a887a2af382d43db558a5c04564f\n+994cbf1f6e987e2952608762b8e45c59\n $fGTraversableNaturalkk20fgRecRec0 ::\n forall k k2 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (Data.Traversable.Traversable h, TraversableB b) =>\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n@@ -347,15 +347,15 @@\n <0>_N\n _N\n _N\n _N\n _N))]\n-49b363a38afc2ac51a871301e3b3b35a\n+6587ef2fe37b9fe5ba92b832474c50df\n $fGTraversableNaturalkk20fgRecRec0_$cgtraverse ::\n forall k k2 (h :: * -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, TraversableB b,\n GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n@@ -413,15 +413,15 @@\n (f2\n ({__scc {Data.Generics.GenericN.unRec} True False} x1)\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-ba2ddd40ae856c7341de1bd4c490fb9d\n+62a71e52be280d9bd9bdd934828615e2\n $fGTraversableNaturalkk20fgRecRec1 ::\n forall k k2 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n TraversableB b =>\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n g\n@@ -444,15 +444,15 @@\n _N\n <0>_N\n _N\n _N\n _N\n _N))]\n-d72264cefb8d51b3b77cd5e6481f3ae9\n+dbed2f6c8a993d068eeb0ca69668dac7\n $fGTraversableNaturalkk20fgRecRec1_$cgtraverse ::\n forall k k2 (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *)\n (t :: * -> *) (x :: k2).\n (TraversableB b, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n -> Data.Generics.GenericN.Rec (b (P 0 f)) (b f) x\n@@ -496,15 +496,15 @@\n (b (P 0 f)) (b f) x) ->\n f1\n (f2\n ({__scc {Data.Generics.GenericN.unRec} True False} x1)\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0] _N _P _R _P))]\n-260fb9aa64b390f2843612d6c1efafc3\n+ce1766c0437677154e084850cc0adca6\n $fGTraversableNaturalkk20fgRecRec_$cgtraverse ::\n forall k k2 (h :: * -> *) (m :: * -> *) (b :: (k -> *) -> *)\n (f :: k -> *) (g :: k -> *) (t :: * -> *) (x :: k2).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableB b, GHC.Base.Applicative t) =>\n Data.Proxy.Proxy 0\n -> (forall (a :: k). f a -> t (g a))\n@@ -577,15 +577,15 @@\n (f2\n ({__scc {Data.Generics.GenericN.unRec} True False} x1)\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-19dece95ad1e3ac601ade4664c8874de\n+98dc672dd421b7d7e2d864ea1af2f73a\n $fTraversableBkCompose ::\n forall k (f :: * -> *) (b :: (k -> *) -> *).\n (Data.Traversable.Traversable f, TraversableB b) =>\n TraversableB (Data.Functor.Compose.Compose f b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -604,15 +604,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkCompose_$cbtraverse @k @f @b v v1)]\n-27c8b1886ea99ecec7ca457f7bf317ed\n+b0d132e64a8f11c46734df05d46588eb\n $fTraversableBkCompose1 ::\n forall {k} {f :: * -> *} {b :: (k -> *) -> *} {f1 :: k -> *}\n {g :: k -> *}.\n (Data.Traversable.Traversable f, TraversableB b) =>\n (forall (a :: k). f1 a -> g a)\n -> Data.Functor.Compose.Compose f b f1 -> f (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -638,15 +638,15 @@\n @f1\n @g\n eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N)]\n-19b32ad3fb7d4740094e434aac5adfa6\n+025e58d3d1c0ac4ef3b3b972e7546ef3\n $fTraversableBkCompose_$cbtraverse ::\n forall k (f :: * -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f1 :: k -> *) (g :: k -> *).\n (Data.Traversable.Traversable f, TraversableB b,\n GHC.Base.Applicative e) =>\n (forall (a :: k). f1 a -> e (g a))\n -> Data.Functor.Compose.Compose f b f1\n@@ -684,28 +684,28 @@\n @(b g)\n $dApplicative\n (btraverse @k @b $dTraversableB @e @f1 @g $dApplicative eta)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N *>_N _R _N _N))]\n-14d0fb1202c496de0811d9ef9b353dba\n+6b42a24e2fc6c84f4728712aff792cac\n $fTraversableBkConst :: TraversableB (Data.Functor.Const.Const a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Const.Const a)\n (Barbies.Internal.FunctorB.$fFunctorBkConst_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkConst_$cbtraverse @k @a)]\n-e3e1746b41234e5cae95b9609d148d25\n+15ab705b96e0df66afbc3aa6e0e063e6\n $fTraversableBkConst_$cbtraverse ::\n forall k a (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Const.Const a f -> e (Data.Functor.Const.Const a g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=2),\n@@ -722,29 +722,29 @@\n @e\n $dApplicative\n @(Data.Functor.Const.Const a g)\n ds1\n `cast`\n (Data.Functor.Const.N:Const[0] *>_N _R _P\n ; Sym (Data.Functor.Const.N:Const[0] *>_N _R _P))]\n-e0cf85538511cc871a114d59c3c02669\n+eb36f645ce9fa63e0c91e7aebabd8dc0\n $fTraversableBkConstant ::\n TraversableB (Data.Functor.Constant.Constant a)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k @a.\n @k\n @(Data.Functor.Constant.Constant a)\n (Barbies.Internal.FunctorB.$fFunctorBkConstant_$cbmap @k @a)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkConstant_$cbtraverse @k @a)]\n-290a5c4b471d5d301f99b332bca74950\n+60a30098017ffac097bf993fed77e66f\n $fTraversableBkConstant_$cbtraverse ::\n forall k a (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Constant.Constant a f\n -> e (Data.Functor.Constant.Constant a g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -763,15 +763,15 @@\n $dApplicative\n @(Data.Functor.Constant.Constant a g)\n ds1\n `cast`\n (Data.Functor.Constant.N:Constant[0] *>_N _R _P\n ; Sym (Data.Functor.Constant.N:Constant[0]\n *>_N _R _P))]\n-fd60f5bd2c4f9d7ec978f73f9214baff\n+4246053d5084b8890f3266f13361b0c2\n $fTraversableBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (TraversableB a, TraversableB b) =>\n TraversableB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -785,15 +785,15 @@\n @k\n @(Data.Functor.Product.Product a b)\n ($fTraversableBkProduct1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkProduct_$cbtraverse @k @a @b v v1)]\n-527563cef889a958c3a00f0b1b2c8672\n+d0d047cb8652956660fd75679de662db\n $fTraversableBkProduct1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (TraversableB a, TraversableB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n@@ -827,15 +827,15 @@\n (($p1TraversableB @k @b $dTraversableB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n y) }]\n-2d371bcfc76e587b0e6fa95a447ba9f4\n+0f92c04b17c1009e8813b66270343689\n $fTraversableBkProduct_$cbtraverse ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f :: k -> *) (g :: k -> *).\n (TraversableB a, TraversableB b, GHC.Base.Applicative e) =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Product.Product a b f\n -> e (Data.Functor.Product.Product a b g)\n@@ -865,28 +865,28 @@\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(a g)\n @(b g -> Data.Functor.Product.Product a b g)\n (\\ (ds['GHC.Types.Many] :: a g) (ds1['GHC.Types.Many] :: b g) ->\n Data.Functor.Product.Pair @(k -> *) @a @b @g ds ds1)\n (btraverse @k @a $dTraversableB @e @f @g $dApplicative eta x))\n (btraverse @k @b $dTraversableB1 @e @f @g $dApplicative eta y) }]\n-1bfae925a7d78eb29629646191e6a3ca\n+adf1ba2b597e97f647f8ad5e89bb8fc6\n $fTraversableBkProxy :: TraversableB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.FunctorB.$fFunctorBkProxy_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkProxy_$cbtraverse @k)]\n-db98f3c4b674c487e40d02be5dd7603e\n+b0ef824d4d4f8e38985dea340cdb221c\n $fTraversableBkProxy_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a))\n -> Data.Proxy.Proxy f -> e (Data.Proxy.Proxy g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)>, Inline: (sat-args=2),\n@@ -899,15 +899,15 @@\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a))\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy f) ->\n GHC.Base.pure\n @e\n $dApplicative\n @(Data.Proxy.Proxy g)\n (Data.Proxy.Proxy @(k -> *) @g)]\n-924ba127545cea625667da458890ac59\n+b16a228aa4d5c4c6a03f23cc9d82a17f\n $fTraversableBkSum ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (TraversableB a, TraversableB b) =>\n TraversableB (Data.Functor.Sum.Sum a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -921,15 +921,15 @@\n @k\n @(Data.Functor.Sum.Sum a b)\n ($fTraversableBkSum1 @k @a @b v v1)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))\n ($fTraversableBkSum_$cbtraverse @k @a @b v v1)]\n-909ee79fb0d447dfedfd6360c1207306\n+451c58e6934cec606e44cd1bbfdd23c8\n $fTraversableBkSum1 ::\n forall {k} {a :: (k -> *) -> *} {b :: (k -> *) -> *} (f :: k -> *)\n (g :: k -> *).\n (TraversableB a, TraversableB b) =>\n (forall (a1 :: k). f a1 -> g a1)\n -> Data.Functor.Sum.Sum a b f -> Data.Functor.Sum.Sum a b g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n@@ -968,15 +968,15 @@\n (($p1TraversableB @k @b $dTraversableB1)\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n eta\n x) }]\n-464d7d3edcdeb1924b26dcc17b9a5f78\n+327b1035a036c7f1f8b969e065d3331c\n $fTraversableBkSum_$cbtraverse ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (e :: * -> *)\n (f :: k -> *) (g :: k -> *).\n (TraversableB a, TraversableB b, GHC.Base.Applicative e) =>\n (forall (a1 :: k). f a1 -> e (g a1))\n -> Data.Functor.Sum.Sum a b f -> e (Data.Functor.Sum.Sum a b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -1009,91 +1009,91 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(b g)\n @(Data.Functor.Sum.Sum a b g)\n (\\ (ds['GHC.Types.Many] :: b g) ->\n Data.Functor.Sum.InR @(k -> *) @a @b @g ds)\n (btraverse @k @b $dTraversableB1 @e @f @g $dApplicative eta x) }]\n-506adcd8de5f96b431e7bd9c1518a1eb\n+944f56733c73f70e67504b03db3e5272\n $tcTraversableB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 4017740665315007311#Word64\n- 12641569116592177529#Word64\n+ 18179578676235463987#Word64\n+ 2489881737007706769#Word64\n $trModule\n $tcTraversableB2\n 1#\n $tcTraversableB1]\n-1d5e7391cfce86e64b12ab9e4ad46d77\n+fd0a83cbb12d57da33ddc1ae283cebbe\n $tcTraversableB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-4c3cc0d49f5352ac46e3fe66d4d03f1d\n+9b81753d0bcf08cfa395b5232dca0b53\n $tcTraversableB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcTraversableB3]\n-c4e1a220af90cdcfb049cd30028fd29c\n+03be57e758250e91ddfb0aeec1c7e89a\n $tcTraversableB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"TraversableB\"#]\n-d07aebed8b303ad614b7f0f9fa991f63\n+22102049ffc1f3dafb2a8230d57d0a14\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-04d78d7e00d3e5e60bfdab4df1e9db8a\n+68aa65e57545ce2138358d634ca88ef8\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-b421a7d4fb73a4c2bc8df6e3b5f9a4e1\n+f10fd5008e8694606169b4308f3b103b\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.TraversableB\"#]\n-57152d0194320c271fa4ffdc7205adc7\n+337945a41551c3da1fad4e8768e34141\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-78bea3302496ee24b7a58c26d98be406\n+863dc28117f3116c9114941a36854b54\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-c0fcb3f91d286c4e24aa9ba938f58a0b\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+d7d392b1c7fc8b91ce9dfad4efc2b6d3\n type CanDeriveTraversableB :: forall {k1}.\n ((k1 -> *) -> *) -> (k1 -> *) -> (k1 -> *) -> GHC.Types.Constraint\n type CanDeriveTraversableB b f g =\n (Data.Generics.GenericN.GenericP 0 (b f),\n Data.Generics.GenericN.GenericP 0 (b g),\n Barbies.Generics.Traversable.GTraversable\n 0\n f\n g\n (Data.Generics.GenericN.RepP 0 (b f))\n (Data.Generics.GenericN.RepP 0 (b g)))\n :: GHC.Types.Constraint\n-6ecb9054dad4354a5b77cf31ccc6cecb\n+3479509828c4a984a91d78f529880382\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-276504176defd37fdae4e05d479e9cc6\n+b16eda90a135f995e76c64fdf076422a\n type TraversableB :: forall k.\n ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorB.FunctorB b => TraversableB b where\n btraverse :: forall (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n default btraverse :: forall (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (GHC.Base.Applicative e, CanDeriveTraversableB b f g) =>\n (forall (a :: k). f a -> e (g a)) -> b f -> e (b g)\n-14d33185bc8e0b9d6617de4794d0b153\n+0c258f5bfc94ec71636a457f0c538881\n bfoldMap ::\n forall {k} (b :: (k -> *) -> *) m (f :: k -> *).\n (TraversableB b, GHC.Base.Monoid m) =>\n (forall (a :: k). f a -> m) -> b f -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1219,15 +1219,15 @@\n `cast`\n (Sym (Barbies.Internal.Writer.N:St[0]\n _R\n <()>_R))\n } in\n \\ (x['GHC.Types.Many] :: b f) ->\n f2 (g x)]\n-c342788bd922f3596acc43592b92d6ee\n+0ae024feb9303d386ddf012477d382bb\n bsequence ::\n forall {k} (e :: * -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (GHC.Base.Applicative e, TraversableB b) =>\n b (Data.Functor.Compose.Compose e f) -> e (b f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n@@ -1257,15 +1257,15 @@\n e f a>_R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N)]\n-ddba99e0a036e38514b81b4420ddd569\n+76f2a385900fef20091423a0bc93fc51\n bsequence' ::\n (GHC.Base.Applicative e, TraversableB b) =>\n b e -> e (b Data.Functor.Identity.Identity)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n \\ @e :: * -> *\n@@ -1292,20 +1292,20 @@\n @(Data.Functor.Identity.Identity\n a)\n (bsequence'1 @a)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R)))]\n-58ecb3f26f46e178eab0fd2013cb8ef4\n+42cdaad5dbd770c73a20f9a48f9810c8\n bsequence'1 :: a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \\ @a (ds['GHC.Types.Many] :: a) -> ds]\n-db6a81411d9b3d9f573baa0f326e7828\n+60242f95eece2e38ab3dfa24ebca6d72\n btraverse_ ::\n forall {k} (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *) c.\n (TraversableB b, GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e c) -> b f -> e ()\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -1365,21 +1365,21 @@\n @e\n $dFunctor\n @()\n @(b (Data.Functor.Const.Const\n ()))\n GHC.Tuple.Prim.()\n (g x)]\n-a7c090f54d3a6128d8402d77a1af1a38\n+91edaa05c1d130f137897731ac90aeb0\n btraverse_1 :: c -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c (ds['GHC.Types.Many] :: c) -> GHC.Tuple.Prim.()]\n-10c8101760dc1adeb285607f85e35b38\n+dae0a772e88ff6f604743bb5d4a0e092\n gbtraverseDefault ::\n forall {k1} (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (e :: * -> *).\n (GHC.Base.Applicative e, CanDeriveTraversableB b f g) =>\n (forall (a :: k1). f a -> e (g a)) -> b f -> e (b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/TraversableT.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/TraversableT.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,18 +1,18 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.TraversableT [orphan module] 9066\n- interface hash: e62ae5b02cb5dc5c840f14a2e5917a88\n- ABI hash: 6d9f71dcdc22d5d3261927c7c3f0afd5\n- export-list hash: 24f5ff092cfd60d1c33d22f7bfc60097\n- orphan hash: 7436c106bf3c519174e501fc089cf08d\n+ interface hash: f2841e5eb751ebffff2f91837b19db12\n+ ABI hash: 70a0f6bb8ee700f78b9077b3af018bc8\n+ export-list hash: e6c541e77f859c5116aa0273fe952d3a\n+ orphan hash: c26bce223d7cad422acaf9f4dcd0b231\n flag hash: 6356b00d94b2d1da65c3f2fa68e13284\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a2d68cb522029ad5b03f068295b394ec\n sig of: Nothing\n used TH splices: False\n@@ -21,18 +21,18 @@\n tfoldMap\n tsequence\n tsequence'\n ttraverseDefault\n ttraverse_\n CanDeriveTraversableT\n TraversableT{ttraverse}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1 transformers-0.6.1.0\n plugin package dependencies:\n orphans: Barbies.Internal.FunctorT GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n@@ -42,35 +42,35 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable 78ba5b8127485172bcdfb5f1a7a2be9f\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 07978d60099125b7617e0fdd0bfa9d0e\n- gtraverse 479847134d0fca5201cb163e7c365d6d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- exports: f80df9d1a671828401e57ca77039e65f\n- FunctorT 8eecefeea9b4af10c28c6418beb8e35f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Writer 78d58e8d27c1b5f724f59e41fe333ec9\n- exports: 59ffb401d09093d618de38060033b75c\n- execWr 921a5c36501ebb74282d24aea2b9b5ce\n- tell f41472543dcc450dda0d5b8970f323cd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericP a69a411bf0015ec405253821470b1398\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toP 1c04f23335bb942f8b39a9f75761181c\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 24c2969b48d69b5d87bd0015edc00ed7\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable 6bc69f1d03cbd1e58f9a67d23d07f501\n+ gtraverse 70ec7cdfe89035cca9af3957b43ff6c2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ exports: e02f5d493ca75ffd2f01042546f54905\n+ FunctorT ae5ec0f7570f82aca6f5f14b2f49b24c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Writer efe86a57d978c86b92ee78dca96ae213\n+ exports: ce690a8d0554a90ffe27eb89b53500c9\n+ execWr 0ba0f5f1de1b3cb4ff96e635320656e1\n+ tell e2ec237cb577cbd4bb2ed4024c55188f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor 543c30b6d23ff983f428ef0903f0b76f\n import -/ Data.Functor.Compose 03493c6a5625fc479494b674d69acd7d\n import -/ Data.Functor.Const 7a2b137e71d15c337dd0fa523e792287\n import -/ Data.Functor.Identity e4f36042ef5b7475db50188325dfab0b\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Functor.Sum a6467797b65ae7f7026de3e8d20d74f3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n@@ -83,15 +83,15 @@\n import -/ Control.Applicative.Lift 4c061bd1a73d1b6820b48c8d4eb45f87\n import -/ Control.Monad.Trans.Except 176ed1556759282f04fc46f042d6e45b\n import -/ Control.Monad.Trans.Identity c6d9f8408d560420ccee35cf25d55d29\n import -/ Control.Monad.Trans.Maybe 82f0d330853126ad24cf41b00e8c8903\n import -/ Control.Monad.Trans.Writer.Lazy 8de1a8c7755853781a7eb22d528c0eeb\n import -/ Control.Monad.Trans.Writer.Strict 0b0510476c3f679e0e32dad3540d096b\n import -/ Data.Functor.Reverse 754946e3ed2842b80ee28f61db850fff\n-923ba57e6fb8c2c7eda10bfa31f8a616\n+0c5a6819241f5ab63d7817d2f0184484\n $dmttraverse ::\n forall k k' (t :: (k -> *) -> k' -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (TraversableT t, GHC.Base.Applicative e,\n CanDeriveTraversableT t f g x) =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -361,15 +361,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n *>_N\n <1>_N\n _N\n _N _N))_N\n _N)_R) _N))]\n-b687d2a201c430bd3264791840fd992e\n+d63d4e4c79e11f918ef5456a8ce3c13c\n $fGTraversableNaturalkk21fgRecRec ::\n forall k k' k2 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k').\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableT t) =>\n Barbies.Generics.Traversable.GTraversable\n 1\n@@ -402,15 +402,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-57388cad7c7841bf939783b6da526909\n+a632b6ad8abf12ce9117b23a044ac272\n $fGTraversableNaturalkk21fgRecRec0 ::\n forall k k' k2 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k').\n (Data.Traversable.Traversable h, TraversableT t) =>\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n@@ -439,15 +439,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-61494c1358956f03474c8e1ef1744d99\n+c755a859a17de3afb9efd42750a736b7\n $fGTraversableNaturalkk21fgRecRec0_$cgtraverse ::\n forall k k' k2 (h :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (g :: k -> *) (x :: k') (t1 :: * -> *) (x1 :: k2).\n (Data.Traversable.Traversable h, TraversableT t,\n GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> t1 (g a))\n@@ -520,15 +520,15 @@\n (f2\n ({__scc {Data.Generics.GenericN.unRec} True False} x2)\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-f3b4a465342193e8e796bb04e357ed5e\n+fbe2ccd617d7bfc33ffb6c653a1c434c\n $fGTraversableNaturalkk21fgRecRec1 ::\n forall k k' k2 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n TraversableT t =>\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n@@ -554,15 +554,15 @@\n <1>_N\n _N\n _N\n _N\n _N))]\n-1ededa9657c38a1f55f6f7d64ecf5969\n+38f2cf055f3d5c36ad38f2275570b54b\n $fGTraversableNaturalkk21fgRecRec1_$cgtraverse ::\n forall k k' k2 (t :: (k -> *) -> k' -> *) (f :: k -> *)\n (g :: k -> *) (x :: k') (t1 :: * -> *) (x1 :: k2).\n (TraversableT t, GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n -> (forall (a :: k). f a -> t1 (g a))\n -> Data.Generics.GenericN.Rec (t (P 1 f) x) (t f x) x1\n@@ -621,15 +621,15 @@\n (f2\n ({__scc {Data.Generics.GenericN.unRec} True False} x2)\n `cast`\n (Data.Generics.GenericN.N:Rec[0] _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-3ec7950d3da6b553846dd6fb8d4fe575\n+a8952b9a6eaf41712f0e66dfa5122e89\n $fGTraversableNaturalkk21fgRecRec_$cgtraverse ::\n forall k k' k2 (h :: * -> *) (m :: * -> *)\n (t :: (k -> *) -> k' -> *) (f :: k -> *) (g :: k -> *) (x :: k')\n (t1 :: * -> *) (x1 :: k2).\n (Data.Traversable.Traversable h, Data.Traversable.Traversable m,\n TraversableT t, GHC.Base.Applicative t1) =>\n Data.Proxy.Proxy 1\n@@ -718,30 +718,30 @@\n (f2\n ({__scc {Data.Generics.GenericN.unRec} True False} x2)\n `cast`\n (Data.Generics.GenericN.N:Rec[0]\n _N _P _N _N\n ; GHC.Generics.N:K1[0]\n _N _P _R _P))]\n-03d071b7ace58d682518afe0997b55a9\n+a85e0bace042f17c835a655113e9d1b0\n $fTraversableTTYPETYPEExceptT ::\n TraversableT (Control.Monad.Trans.Except.ExceptT e)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @e.\n @(*)\n @(*)\n @(Control.Monad.Trans.Except.ExceptT e)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEExceptT_$ctmap @e)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEExceptT_$cttraverse @e)]\n-c58a165f2e2d99f31694aaae9fb5a459\n+f260617128c13a5052bf10b1ac6daeab\n $fTraversableTTYPETYPEExceptT_$cttraverse ::\n GHC.Base.Applicative e2 =>\n (forall a. f a -> e2 (g a))\n -> Control.Monad.Trans.Except.ExceptT e1 f x\n -> e2 (Control.Monad.Trans.Except.ExceptT e1 g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -767,30 +767,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Except.N:ExceptT[0]\n _N _R _N))\n (eta\n @(Data.Either.Either e x)\n eta1\n `cast`\n (Control.Monad.Trans.Except.N:ExceptT[0] _N _R _N))]\n-50fdc8f21b2d94bc81ce77601ebd87a1\n+11f242767367579f8e22b0d52aa3e43a\n $fTraversableTTYPETYPELift ::\n TraversableT Control.Applicative.Lift.Lift\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @(*)\n @Control.Applicative.Lift.Lift\n Barbies.Internal.FunctorT.$fFunctorTTYPETYPELift_$ctmap\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n $fTraversableTTYPETYPELift_$cttraverse]\n-e501ad56e81ddfe5da3b7d4b579e4257\n+b4e7480abb394b7591771e79134e183c\n $fTraversableTTYPETYPELift_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Applicative.Lift.Lift f x\n -> e (Control.Applicative.Lift.Lift g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(MP(1C(1,C(1,L)),A),MC(1,L),A,A,A,A)><1L>,\n@@ -815,30 +815,30 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Control.Applicative.Lift.Lift g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Control.Applicative.Lift.Other @g @x ds)\n (eta @x fa) }]\n-0a4a60978a2f405477812024297a2a75\n+2b5f810ae4d6c668d7d6e87c60e8f1d8\n $fTraversableTTYPETYPEMaybeT ::\n TraversableT Control.Monad.Trans.Maybe.MaybeT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun:.\n @(*)\n @(*)\n @Control.Monad.Trans.Maybe.MaybeT\n Barbies.Internal.FunctorT.$fFunctorTTYPETYPEMaybeT_$ctmap\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n $fTraversableTTYPETYPEMaybeT_$cttraverse]\n-86c8e41e43df19c043aee2ebf0511477\n+af8fe33ddc07cbba4239cfd9ebb5bc79\n $fTraversableTTYPETYPEMaybeT_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Maybe.MaybeT f x\n -> e (Control.Monad.Trans.Maybe.MaybeT g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -860,45 +860,45 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Maybe.N:MaybeT[0]\n _R _N))\n (eta\n @(GHC.Maybe.Maybe x)\n eta1 `cast` (Control.Monad.Trans.Maybe.N:MaybeT[0] _R _N))]\n-9f4c520378d5c1bf8cfc5e58e59deadd\n+fc6ff4b6f1722fa6076ab75753ab3e1d\n $fTraversableTTYPETYPEWriterT ::\n TraversableT (Control.Monad.Trans.Writer.Strict.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(*)\n @(Control.Monad.Trans.Writer.Strict.WriterT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEWriterT_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEWriterT_$cttraverse @w)]\n-d203d0189204b3c3c3c062f5086b028f\n+e826b8ff4d7907044b08725cc03b1392\n $fTraversableTTYPETYPEWriterT0 ::\n TraversableT (Control.Monad.Trans.Writer.Lazy.WriterT w)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @w.\n @(*)\n @(*)\n @(Control.Monad.Trans.Writer.Lazy.WriterT w)\n (Barbies.Internal.FunctorT.$fFunctorTTYPETYPEWriterT0_$ctmap @w)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n <*>_N <*>_N _N))\n ($fTraversableTTYPETYPEWriterT0_$cttraverse @w)]\n-f0b6df77c7d5d035f980388131b454ce\n+8cb809fd16e917db36303a29c7c63151\n $fTraversableTTYPETYPEWriterT0_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Writer.Lazy.WriterT w f x\n -> e (Control.Monad.Trans.Writer.Lazy.WriterT w g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -924,15 +924,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Writer.Lazy.N:WriterT[0]\n _N _R _N))\n (eta\n @(x, w)\n eta1\n `cast`\n (Control.Monad.Trans.Writer.Lazy.N:WriterT[0] _N _R _N))]\n-84a6d96f2fbb7cca489dd7859acaca3c\n+2b88ffd9f708b40f440b37e6647532ef\n $fTraversableTTYPETYPEWriterT_$cttraverse ::\n GHC.Base.Applicative e =>\n (forall a. f a -> e (g a))\n -> Control.Monad.Trans.Writer.Strict.WriterT w f x\n -> e (Control.Monad.Trans.Writer.Strict.WriterT w g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -959,30 +959,30 @@\n _N _R _N))\n (eta\n @(x, w)\n eta1\n `cast`\n (Control.Monad.Trans.Writer.Strict.N:WriterT[0]\n _N _R _N))]\n-b1aaba3b36102deef0f4d84625247a09\n+be3c597f3e885fe032928dfb78a4f5ad\n $fTraversableTk'k'Backwards ::\n TraversableT Control.Applicative.Backwards.Backwards\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Control.Applicative.Backwards.Backwards\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Backwards_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Backwards_$cttraverse @k')]\n-da2105ad30c779f22d49f03e5e7101b0\n+2ed75264508fb96350a7b6544904a416\n $fTraversableTk'k'Backwards_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Control.Applicative.Backwards.Backwards f x\n -> e (Control.Applicative.Backwards.Backwards g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1009,15 +1009,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Applicative.Backwards.N:Backwards[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Control.Applicative.Backwards.N:Backwards[0] _N _R _N))]\n-19fb35a6b48bfe241885dda099f7344a\n+f7cc18aeceee20419920c3c6af21c809\n $fTraversableTk'k'Compose ::\n Data.Traversable.Traversable f =>\n TraversableT (Data.Functor.Compose.Compose f)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n Strictness: ,\n@@ -1034,15 +1034,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)\n ; Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Compose_$cttraverse @k' @f v)]\n-18c45dc97847fba081cc2cb2b359de5c\n+5296a2022ac1a82432298e110bb7cf88\n $fTraversableTk'k'Compose1 ::\n forall {k'} {f :: * -> *} {f1 :: k' -> *} {g :: k' -> *} {x :: k'}.\n Data.Traversable.Traversable f =>\n (forall (a :: k'). f1 a -> g a)\n -> Data.Functor.Compose.Compose f f1 x -> f (g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1P(1C(1,C(1,L)),A),A,A,A,A,A)>,\n@@ -1061,15 +1061,15 @@\n @(f1 x)\n @(g x)\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N)]\n-8bc0013248c4ab131ec7d3ca69a6e1ac\n+456a0e5bd56fe3de9987360da9565570\n $fTraversableTk'k'Compose_$cttraverse ::\n forall k' (f :: * -> *) (e :: * -> *) (f1 :: k' -> *)\n (g :: k' -> *) (x :: k').\n (Data.Traversable.Traversable f, GHC.Base.Applicative e) =>\n (forall (a :: k'). f1 a -> e (g a))\n -> Data.Functor.Compose.Compose f f1 x\n -> e (Data.Functor.Compose.Compose f g x)\n@@ -1105,30 +1105,30 @@\n @(g x)\n $dApplicative\n (eta @x)\n eta1\n `cast`\n (Data.Functor.Compose.N:Compose[0]\n <*>_N _N _R _N _N))]\n-7a3871ce208c9f58ad262043006652da\n+a9662b292608fd189b1a7670be16e837\n $fTraversableTk'k'IdentityT ::\n TraversableT Control.Monad.Trans.Identity.IdentityT\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Control.Monad.Trans.Identity.IdentityT\n (Barbies.Internal.FunctorT.$fFunctorTk'k'IdentityT_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'IdentityT_$cttraverse @k')]\n-87e95847af0b9ad2f42a25bde25e26cf\n+88bb3f1947d902de2b0537828ad54ad2\n $fTraversableTk'k'IdentityT_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Control.Monad.Trans.Identity.IdentityT f x\n -> e (Control.Monad.Trans.Identity.IdentityT g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1155,15 +1155,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Control.Monad.Trans.Identity.N:IdentityT[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Control.Monad.Trans.Identity.N:IdentityT[0] _N _R _N))]\n-155ccde8419bcacdf833baf21dff2154\n+122de1c4b61c4cb7231dad3ea5378335\n $fTraversableTk'k'Product ::\n forall k' (f :: k' -> *).\n TraversableT (Data.Functor.Product.Product f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n@@ -1171,15 +1171,15 @@\n @k'\n @(Data.Functor.Product.Product f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Product_$ctmap @k' @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Product_$cttraverse @k' @f)]\n-7dd39b699a4be58873531a9f66013e2c\n+17936fc076c76ecad9dbda09da73a882\n $fTraversableTk'k'Product_$cttraverse ::\n forall k' (f1 :: k' -> *) (e :: * -> *) (f2 :: k' -> *)\n (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f2 a -> e (g a))\n -> Data.Functor.Product.Product f1 f2 x\n -> e (Data.Functor.Product.Product f1 g x)\n@@ -1201,30 +1201,30 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Data.Functor.Product.Product f g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Data.Functor.Product.Pair @k' @f @g @x fa ds)\n (eta @x ga) }]\n-cb099027e397233dfaf436fb9b6bf115\n+32a7edbf195be11cd3e2fdd769145abc\n $fTraversableTk'k'Reverse ::\n TraversableT Data.Functor.Reverse.Reverse\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k'.\n @k'\n @k'\n @Data.Functor.Reverse.Reverse\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Reverse_$ctmap @k')\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Reverse_$cttraverse @k')]\n-3a13296464ba0034d5dacac1f642ca8f\n+2485e36df594fef8e608fadfdef0e1d0\n $fTraversableTk'k'Reverse_$cttraverse ::\n forall k' (e :: * -> *) (f :: k' -> *) (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f a -> e (g a))\n -> Data.Functor.Reverse.Reverse f x\n -> e (Data.Functor.Reverse.Reverse g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1250,30 +1250,30 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Reverse.N:Reverse[0]\n _N _R) _N)\n (eta\n @x\n eta1\n `cast`\n (Data.Functor.Reverse.N:Reverse[0] _N _R _N))]\n-dc573da9b054538d810edb912ce58307\n+167db30b8ad446a41b71747348678332\n $fTraversableTk'k'Sum ::\n forall k' (f :: k' -> *). TraversableT (Data.Functor.Sum.Sum f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:TraversableT], Inline: CONLIKE,\n Unfolding: DFun: @k' @f :: k' -> *.\n @k'\n @k'\n @(Data.Functor.Sum.Sum f)\n (Barbies.Internal.FunctorT.$fFunctorTk'k'Sum_$ctmap @k' @f)\n `cast`\n (Sym (Barbies.Internal.FunctorT.N:FunctorT[0]\n _N _N _N))\n ($fTraversableTk'k'Sum_$cttraverse @k' @f)]\n-9762fc05e957485c505c5ec5ee227550\n+7e7b22a9a9a2dd27dc560dae8369a9df\n $fTraversableTk'k'Sum_$cttraverse ::\n forall k' (f1 :: k' -> *) (e :: * -> *) (f2 :: k' -> *)\n (g :: k' -> *) (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k'). f2 a -> e (g a))\n -> Data.Functor.Sum.Sum f1 f2 x -> e (Data.Functor.Sum.Sum f1 g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -1301,93 +1301,93 @@\n @e\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(g x)\n @(Data.Functor.Sum.Sum f g x)\n (\\ (ds['GHC.Types.Many] :: g x) ->\n Data.Functor.Sum.InR @k' @f @g @x ds)\n (eta @x ga) }]\n-15b913e91fe7ffce70317f1c94c35c41\n+d4a435e9d199fa9dcbde962fe95b3f02\n $tcTraversableT :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17484927838105860982#Word64\n- 13476100267539065414#Word64\n+ 15964797787614909903#Word64\n+ 371415074421031179#Word64\n $trModule\n $tcTraversableT2\n 2#\n $tcTraversableT1]\n-bdd9dbc2d8d54295f90c37aefa9ab182\n+42ed9c51113e9551c1c6d0cd39929c75\n $tcTraversableT1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a7af357a3177dcc719423a7cab610927\n+6c64e879dd4ee197d61e579091aa1753\n $tcTraversableT2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcTraversableT3]\n-e561c4f16730ddf1752da4b3f216afea\n+0251ed4fcb57a53972e51730338a9923\n $tcTraversableT3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"TraversableT\"#]\n-660e77831fdd2609571eb9695722c127\n+0d94928be9e08027dcebe7ed62d176f5\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f268fa9f7238f3bbb0e914245aaca0ea\n+b1f37fb74771f0ef184393aa7ec14eba\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-7397c64acd96499afdcdf1ce9484c000\n+9d0431d3f58d2d4590858b17033151c5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.TraversableT\"#]\n-6767db4855982bb6011ae32d7d475961\n+a4e6c7eab5b5e274154da1109d4687e1\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-74b454dd80c33f97f4e255b7927bdd22\n+f093f10034f7b2098972aa0ade24b43a\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-873ed5c7b58f38175ac5870e02a86816\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+aeee038023f8749871204a191e3682cf\n type CanDeriveTraversableT :: forall {k1} {k}.\n ((k1 -> *) -> k -> *)\n -> (k1 -> *) -> (k1 -> *) -> k -> GHC.Types.Constraint\n type CanDeriveTraversableT t f g x =\n (Data.Generics.GenericN.GenericP 1 (t f x),\n Data.Generics.GenericN.GenericP 1 (t g x),\n Barbies.Generics.Traversable.GTraversable\n 1\n f\n g\n (Data.Generics.GenericN.RepP 1 (t f x))\n (Data.Generics.GenericN.RepP 1 (t g x)))\n :: GHC.Types.Constraint\n-f2f6cc9fbc491070711444fe9808fd9a\n+cde7afd24f19b9145b973d3b2bd3b27d\n type P :: forall {k}. GHC.TypeNats.Nat -> k -> k\n type P = Data.Generics.GenericN.Param :: GHC.TypeNats.Nat -> k -> k\n-e7c67190d7e0b7e757119c341317ca7c\n+0d4893fb3ceb3c7a5413bd1c7de7657c\n type TraversableT :: forall k k'.\n ((k -> *) -> k' -> *) -> GHC.Types.Constraint\n class Barbies.Internal.FunctorT.FunctorT t => TraversableT t where\n ttraverse :: forall (e :: * -> *) (f :: k -> *) (g :: k -> *)\n (x :: k').\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n default ttraverse :: forall (e :: * -> *) (f :: k -> *)\n (g :: k -> *) (x :: k').\n (GHC.Base.Applicative e, CanDeriveTraversableT t f g x) =>\n (forall (a :: k). f a -> e (g a)) -> t f x -> e (t g x)\n-89aba6788a37742a350980fb20f7fd7d\n+1f6b797c47fe546509e6e115aa72cc9a\n tfoldMap ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) m (f :: k -> *)\n (x :: k').\n (TraversableT t, GHC.Base.Monoid m) =>\n (forall (a :: k). f a -> m) -> t f x -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1525,15 +1525,15 @@\n (Sym (Barbies.Internal.Writer.N:St[0]\n _R\n <()>_R))\n } in\n \\ (x1['GHC.Types.Many] :: t f\n x) ->\n f2 (g x1)]\n-f3a225e91845d5e7470e50de6f7eea6f\n+9248ca66fed49993685fa174b2adebf3\n tsequence ::\n forall {k} {k'} (e :: * -> *) (t :: (k -> *) -> k' -> *)\n (f :: k -> *) (x :: k').\n (GHC.Base.Applicative e, TraversableT t) =>\n t (Data.Functor.Compose.Compose e f) x -> e (t f x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n@@ -1568,15 +1568,15 @@\n e f a>_R\n %<'GHC.Types.Many>_N ->_R Data.Functor.Compose.N:Compose[0]\n <*>_N\n _N\n _R\n _N\n _N)]\n-32ebe38fec21ca397a0ee3ba29d55bec\n+b909f470cf0600c6d7e5c98ae4f39532\n tsequence' ::\n forall {k'} (e :: * -> *) (t :: (* -> *) -> k' -> *) (x :: k').\n (GHC.Base.Applicative e, TraversableT t) =>\n t e x -> e (t Data.Functor.Identity.Identity x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,1C(1,C(1,L)))>,\n Unfolding: Core: \n@@ -1608,20 +1608,20 @@\n @(Data.Functor.Identity.Identity\n a)\n (tsequence'1 @a)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Identity.N:Identity[0]\n _R)))]\n-c6b271dd9dff13e039067d0e04ad3aef\n+2f309dbc964cdfeed18ed10b30fc87fb\n tsequence'1 :: a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \\ @a (ds['GHC.Types.Many] :: a) -> ds]\n-cefc2d97d9b1970474444d018f293e9a\n+3f6f6f2d4d09b946a0e333c5c5c206d0\n ttraverseDefault ::\n forall {k1} {k} (t :: (k1 -> *) -> k -> *) (f :: k1 -> *)\n (g :: k1 -> *) (e :: * -> *) (x :: k).\n (GHC.Base.Applicative e, CanDeriveTraversableT t f g x) =>\n (forall (a :: k1). f a -> e (g a)) -> t f x -> e (t g x)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1890,15 +1890,15 @@\n ; Data.Generics.GenericN.D:R:FilterIndex[0]\n *>_N\n *>_N\n <1>_N\n _N\n _N _N))_N\n _N)_R) _N))]\n-d0d74b1d03ca0a1d47af8dee84b6ed90\n+78999db991d8975be40c74b1d6d967dc\n ttraverse_ ::\n forall {k} {k'} (t :: (k -> *) -> k' -> *) (e :: * -> *)\n (f :: k -> *) c (x :: k').\n (TraversableT t, GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e c) -> t f x -> e ()\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -1966,15 +1966,15 @@\n $dFunctor\n @()\n @(t (Data.Functor.Const.Const\n ())\n x)\n GHC.Tuple.Prim.()\n (g x1)]\n-9c2ab1662e2aa40099e90fb333605dcf\n+9d57e83bef1894dd3432da4395f8ad28\n ttraverse_1 :: c -> ()\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @c (ds['GHC.Types.Many] :: c) -> GHC.Tuple.Prim.()]\n instance [orphan] Barbies.Generics.Traversable.GTraversable [GHC.Num.Natural.Natural,\n ., ., ., ., .,\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Trivial.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Trivial.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,34 +1,34 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.Trivial [family instance module] 9066\n- interface hash: 73f9516faaf11def983e0b0e2f62c122\n- ABI hash: e8e840d58a71f36f08cf907351677909\n- export-list hash: f2b3ffa6928a822bd57073425bf0c21d\n+ interface hash: c1f51c50ca2635c707f847486c9b4ff7\n+ ABI hash: dc4e1c7b489ece1d00e77086237aaa82\n+ export-list hash: d538e05bfbbc0ea212ae5ceedcab88a8\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 67a5205f8269836ce813133a487f57b0\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 8ccd4ad300023cc5720879a647526abe\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Unit{Unit}\n Void\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -38,57 +38,57 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- exports: 97f76e0a31067bdc9623d74dfb179978\n- ApplicativeB e831de0bd01221227318ff01f360d4cb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB c915225ce12dec07b484cb0e6c8bc95f\n- exports: 62d29be84a756dd8aa3183dad2a1d146\n- ConstraintsB dc18dd2fb15b81c31fdce03ebb848f0f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 80d56ad2686884e1a31fedb7de368c13\n- exports: 67f047624c17612bc49b9fde883b9428\n- DistributiveB abc18a05f635f61b778ca554da2cea91\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- exports: a8196cc20ebeb66df453e15c78d677c9\n- TraversableB 276504176defd37fdae4e05d479e9cc6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ exports: 5b192dab08a0491faf09373600f4b2cd\n+ ApplicativeB 16deedde4d173b65d0723755e5a93713\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB cb077425686d4bb620c4f51549182b9f\n+ exports: 805180e0c2ac5e4eb5bae7572cee9a36\n+ ConstraintsB 0e5c16bae977600323d72f12d780df0a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 86907d3a2f9542c8a7e9eb0c9e39c2e1\n+ exports: 35baad0665225d23105900c3f9071c68\n+ DistributiveB e760f6db15922c1a6bf57e10ddec6cce\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ exports: 6564e0103587f68d905c5ccbec42ca55\n+ TraversableB b16eda90a135f995e76c64fdf076422a\n import -/ Data.Data a17655407a6710a2f91ae803ac52155a\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Typeable c952aa0add0f12de59ceef5057861fe9\n import -/ Data.Typeable.Internal 5de750529a681b69049321c2001dc613\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.Read ba5dce38a7afde3b9905828c32529080\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ Text.Read.Lex fa35b276d63ddd86fac347999b64f2f6\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n import -/ GHC.Types 40ada155ed73681c14b0e90149f6df94\n-380a93bca1f11e0abaad4ae86bea0e90\n+c6cf6a7537ce7c6a9e452321753ee5d7\n $fApplicativeBkUnit ::\n Barbies.Internal.ApplicativeB.ApplicativeB Unit\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ApplicativeB.C:ApplicativeB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fApplicativeBkUnit_$cbpure @k)\n ($fApplicativeBkUnit_$cbprod @k)]\n-c369f52655c1e698c4cfe215516083a3\n+78e4b3e41739836cf6624bf59a00c74f\n $fApplicativeBkUnit1 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n (Data.Generics.GenericN.GenericP 0 (Unit f),\n Data.Generics.GenericN.GenericP 0 (Unit g),\n Data.Generics.GenericN.GenericP\n 0 (Unit (Data.Functor.Product.Product f g)),\n Barbies.Generics.Applicative.GApplicative\n@@ -96,87 +96,87 @@\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)))\n [TagSig: , LambdaFormInfo: LFCon[(%,,,%)],\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n ($fApplicativeBkUnit6 @k @f, $fApplicativeBkUnit6 @k @g,\n $fApplicativeBkUnit4 @k @f @g, $fApplicativeBkUnit2 @k @f @g)]\n-3cac05d5d3d15c3da1a6a079fd0fd5bb\n+36844d5ed6ffc9c41b0ae20aa550b848\n $fApplicativeBkUnit2 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n@@ -204,18 +204,18 @@\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n @GHC.Generics.D\n @('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n ($fApplicativeBkUnit3 @k @f @g)]\n-52bcdd007a886b991f4eba125f7e3003\n+bdb34c0e4fe6dcd0da49967c74b6b917\n $fApplicativeBkUnit3 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Barbies.Generics.Applicative.GApplicative\n 0\n f\n g\n (GHC.Generics.M1\n@@ -252,15 +252,15 @@\n (Barbies.Generics.Applicative.$fGApplicativekkknfgU1U1U1\n @GHC.Num.Natural.Natural\n @k\n @(*)\n @0\n @f\n @g)]\n-51a662acdc7b688027eeac5febb1d771\n+4c46fa55b861b039ebc97aa26e26e418\n $fApplicativeBkUnit4 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Data.Generics.GenericN.GenericP\n 0 (Unit (Data.Functor.Product.Product f g))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n@@ -275,15 +275,15 @@\n _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -294,15 +294,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))))_R\n ($fGenericUnit @k @(Data.Functor.Product.Product f g))]\n-87d5cc7856dae72a1509cec694b60868\n+5d5308cf730332b736d4a24d64388545\n $fApplicativeBkUnit5 ::\n GHC.Types.Coercible\n (GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [HasNoCafRefs, TagSig: ,\n@@ -375,45 +375,45 @@\n Unfolding: Core: \n GHC.Types.MkCoercible\n @(* -> *)\n @(GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @~_R]\n-7321ad5c579078b53ba9e2764a760186\n+94a9460007672af7814e004a9e7a8188\n $fApplicativeBkUnit6 ::\n forall {k} {f :: k -> *}.\n Data.Generics.GenericN.GenericP 0 (Unit f)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n Data.Generics.GenericN.$fGenericPna\n@@ -426,15 +426,15 @@\n (Sub (Sym (Rep_Unit[0] _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -445,15 +445,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N) _N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N))))_R\n ($fGenericUnit @k @f)]\n-61b78c8ad355c6699e60b634a7b95d7c\n+72027a994d9ef65ba2f22aefc44d684b\n $fApplicativeBkUnit_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> Unit f -> Unit g\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a)\n (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit -> Unit @k @g }]\n-5c4e55346768739c80b762afb094a2f8\n+ec4d3e8288f4dc8e61fc40cba04a6501\n $fApplicativeBkUnit_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Unit f -> Unit g -> Unit (Data.Functor.Product.Product f g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n Barbies.Internal.ApplicativeB.gbprodDefault\n@@ -524,15 +524,15 @@\n _N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -543,15 +543,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -600,15 +600,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -657,15 +657,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n _N\n <0>_N)))_N))_N)\n (Sym (Rep_Unit[0] _N _N)))_N\n ; Sym (Data.Generics.GenericN.R:RepPna[0]\n <0>_N _N)))_N)_R]\n-5d366c51bba7316b66e48096cbfdefe1\n+6dbc58ca3d4a4f110d71abd1e21ef00d\n $fApplicativeBkUnit_$cbpure ::\n forall k (f :: k -> *). (forall (a :: k). f a) -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Unit @k @f]\n-ac40a56d34a614d3fd146a1cd97952da\n+dbca66b7cf031a8fd2ad70a6342e8648\n $fConstraintsBkUnit ::\n Barbies.Internal.ConstraintsB.ConstraintsB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ConstraintsB.C:ConstraintsB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkUnit_$cbaddDicts @k)]\n-f4dd84998d8f0514f596e869b27685d2\n+04af1133c313063250b408945f191fb5\n $fConstraintsBkUnit_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n Barbies.Internal.ConstraintsB.AllB c Unit =>\n Unit f\n -> Unit\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n@@ -747,37 +747,37 @@\n c Unit)\n (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit ->\n Unit\n @k\n @(Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict c) f) }]\n-61c9923a99003961d94dde887c8b0fd3\n+ffa21b34149494a69292a78d36612d2d\n $fConstraintsBkVoid ::\n Barbies.Internal.ConstraintsB.ConstraintsB Void\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.ConstraintsB.C:ConstraintsB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Void\n ($fConstraintsBkVoid_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkVoid_$cbaddDicts @k)]\n-53c4479002535986ba7b7ba4c66dc501\n+7830737359acf29f3f9811a653573259\n $fConstraintsBkVoid1 :: GHC.Generics.V1 GHC.Types.Any\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-f62c1d8b95a5b2c099c1a8d9857951b5\n+279691d5c28f568c4e20b5231863b4c9\n $fConstraintsBkVoid2 :: GHC.Generics.V1 GHC.Types.Any\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-38a78fe46baaa0b3752b2cc41fbadf88\n+d113bb6c9c17f9bfd21005cd5ee8f095\n $fConstraintsBkVoid_$cbaddDicts ::\n forall k (c :: k -> GHC.Types.Constraint) (f :: k -> *).\n Barbies.Internal.ConstraintsB.AllB c Void =>\n Void f\n -> Void\n (Data.Functor.Product.Product (Barbies.Internal.Dicts.Dict c) f)\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -797,22 +797,22 @@\n `cast`\n ((Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0]\n _N\n _N))) _N)]\n-3d48338f756b4e7d1f02bfbc9b373c93\n+73b5344d644b7d778e5a09b616f00bd9\n $fConstraintsBkVoid_$cbmap ::\n forall k (f :: k -> *) (g :: k -> *).\n (forall (a :: k). f a -> g a) -> Void f -> Void g\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n@@ -828,19 +828,19 @@\n `cast`\n ((Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0] _N _N))) _N)]\n-45c1a2fc50b46240b6442ee98d18de65\n+80d5fdf698f5d15eafb0d21871bbec24\n $fConstraintsBkVoid_$cto ::\n forall k (f :: k -> *) x. GHC.Generics.Rep (Void f) x -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @k\n @f :: k -> *\n@@ -851,20 +851,20 @@\n ((Sub (Rep_Void[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R) _N)\n ret_ty (Void f)\n of {}]\n-e7b7b2c32608e4b0f6819be8ea75e476\n+6f50dd94b2f93859dcab8b9037752b74\n $fDataUnit ::\n forall k (f :: k -> *).\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k) =>\n Data.Data.Data (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -949,52 +949,52 @@\n ($dMonad['GHC.Types.Many] :: GHC.Base.Monad m)\n (ds['GHC.Types.Many] :: forall d. Data.Data.Data d => d -> m d)\n (eta['GHC.Types.Many] :: Unit f) ->\n case eta of wild { Unit ->\n GHC.Base.return @m $dMonad @(Unit f) (Unit @k @f) })\n ($fDataUnit_$cgmapMo @k @f v v1)\n ($fDataUnit_$cgmapMo @k @f v v1)]\n-5453d8c8992013fd5bc5f1cc1bf1bfa1\n+da8e5953dd272dd10f8231587c258ba7\n $fDataUnit1 :: forall {k} {f :: k -> *}. (Unit f, GHC.Types.Bool)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFCon[(,)],\n Unfolding: Core: \n \\ @k @f :: k -> * -> (Unit @k @f, GHC.Types.False)]\n-aa5d13821d8ba92a57a1ff5b5a4d213b\n+0a01773d43026ae8d561d74d67a22c87\n $fDataUnit2 :: u\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-4697eb201772d2bd1d187b75b1224482\n+a08bd09d1b3504072557b4d88d9deb99\n $fDataUnit3 :: Data.Data.DataType\n [LambdaFormInfo: LFCon[Data.Data.DataType],\n Unfolding: Core: \n Data.Data.DataType $fDataUnit7 $fDataUnit4]\n-96d138ba575ca0721548b85d71b9072f\n+71d27f4818181e63eb6b7580d34ea1b2\n $fDataUnit4 :: Data.Data.DataRep\n [LambdaFormInfo: LFCon[Data.Data.AlgRep],\n Unfolding: Core: Data.Data.AlgRep $fDataUnit5]\n-dd91f8f415a601bed629a3a1b61ac869\n+3824bbe322ab18ffbdf19667bff8f222\n $fDataUnit5 :: [Data.Data.Constr]\n [LambdaFormInfo: LFCon[:],\n Unfolding: Core: \n GHC.Types.:\n @Data.Data.Constr\n $fDataUnit6\n (GHC.Types.[] @Data.Data.Constr)]\n-d95c991b35e281a5c59840b49913aac8\n+e7c1fa0f8e31855f8373d4546eb852d0\n $fDataUnit6 :: Data.Data.Constr\n [LambdaFormInfo: LFCon[Data.Data.Constr]]\n-fe4364bdeba819ca4302551b39b5b738\n+912ca35a62ece4687494645b3a803407\n $fDataUnit7 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fDataUnit8]\n-b4984323061c7667887f624eb42f8a5c\n+86fee5a359095f2f51596ea9af4a1312\n $fDataUnit8 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Trivial.Unit\"#]\n-b96a200ac46290e8a4f3eb40253bbdd3\n+706fcc33714d4c9ede53180041be815b\n $fDataUnit9 ::\n forall {k} {f :: k -> *}.\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k) =>\n Data.Typeable.Internal.TypeRep (Unit f)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n@@ -1020,15 +1020,15 @@\n $dTypeable1\n `cast`\n (Data.Typeable.Internal.N:Typeable[0] <*>_N _N))\n (GHC.Types.[] @Data.Typeable.Internal.SomeTypeRep)))\n $dTypeable\n `cast`\n (Data.Typeable.Internal.N:Typeable[0] *>_N _N)]\n-0bcea74b7c7f08fe3561902c599d6a93\n+3b58c3e5cccc1f5b43e0c85996d18389\n $fDataUnit_$cgmapMo ::\n forall k (f :: k -> *) (m :: * -> *).\n (Data.Typeable.Internal.Typeable f,\n Data.Typeable.Internal.Typeable k, GHC.Base.MonadPlus m) =>\n (forall d. Data.Data.Data d => d -> m d) -> Unit f -> m (Unit f)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: ,\n@@ -1039,128 +1039,128 @@\n ($dTypeable['GHC.Types.Many] :: Data.Typeable.Internal.Typeable f)\n ($dTypeable1['GHC.Types.Many] :: Data.Typeable.Internal.Typeable k)\n @m :: * -> *\n ($dMonadPlus['GHC.Types.Many] :: GHC.Base.MonadPlus m)\n (ds['GHC.Types.Many] :: forall d. Data.Data.Data d => d -> m d)\n (eta1['GHC.Types.Many] :: Unit f) ->\n $w$cgmapMo @k @f @m $dMonadPlus eta1]\n-334d2a1aa114edbd2088ad0979b89888\n+67bc5f873a4db9279bb072e534776310\n $fDistributiveBkUnit ::\n Barbies.Internal.DistributiveB.DistributiveB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.DistributiveB.C:DistributiveB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fDistributiveBkUnit_$cbdistribute @k)]\n-ce9d86ca6e4aef27d773d6609869548d\n+c584fa26fa86f624d8d9d57c431f8ca8\n $fDistributiveBkUnit_$cbdistribute ::\n forall k (f :: * -> *) (g :: k -> *).\n GHC.Base.Functor f =>\n f (Unit g) -> Unit (Data.Functor.Compose.Compose f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: * -> *\n @g :: k -> *\n ($dFunctor['GHC.Types.Many] :: GHC.Base.Functor f)\n (x['GHC.Types.Many] :: f (Unit g)) ->\n Unit @k @(Data.Functor.Compose.Compose f g)]\n-5bdb65a944c17ae04c1e2d28798e6dc6\n+7d7d872d8e89842d1af6025b1519d77e\n $fEqUnit :: forall k (f :: k -> *). GHC.Classes.Eq (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f) ($fEqUnit_$c== @k @f) ($fEqUnit_$c< @k @f)]\n-b497a7cc61296fc7a3955d1ceddc4c2d\n+252745b8a73a7604cf2f8728999379c8\n $fEqUnit_$c< ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case a of wild { Unit ->\n case b of wild1 { Unit -> GHC.Types.False } }]\n-196ef4f4dd002fe78c4b024976b231d5\n+02cdf2e9c916ca17d6b5a07ee7557295\n $fEqUnit_$c== ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: Unit f) ->\n case ds of wild { Unit ->\n case ds1 of wild1 { Unit -> GHC.Types.True } }]\n-c9e20a12f84cdf1c09d2a7f6ddb050e1\n+4929aa5a73d25c058605de00b209236c\n $fEqVoid :: forall k (f :: k -> *). GHC.Classes.Eq (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Eq], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f) ($fEqVoid_$c== @k @f) ($fEqVoid_$c/= @k @f)]\n-33910c9cd826be4aa6efe408cecfac14\n+a5daa2e37fa53eda9c132955a564fc11\n $fEqVoid_$c/= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Types.Bool of {}]\n-8ec9108e68692f3496c146277d0595b3\n+c0fe0ab47b0744fcb2975be5e24b2a31\n $fEqVoid_$c== ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> GHC.Types.Bool) of {}]\n-30aa064c72e0749e452a88316a1c07bf\n+886e5721218f7c72a75739566d0f1ad1\n $fFunctorBkUnit :: Barbies.Internal.FunctorB.FunctorB Unit\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fApplicativeBkUnit_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))]\n-cbf18f24487c4070b8d2ad55447c0c1e\n+fd293160347cd21a782d82e1e1389c50\n $fFunctorBkVoid :: Barbies.Internal.FunctorB.FunctorB Void\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n $fConstraintsBkVoid_$cbmap\n `cast`\n (forall (k :: <*>_N).\n Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))]\n-f288a34613eaccf5dcffaee696d7a12a\n+835fd71472e58f0444d3e5b47f196be9\n $fGenericUnit ::\n forall k (f :: k -> *). GHC.Generics.Generic (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f) ($fGenericUnit_$cfrom @k @f) ($fGenericUnit_$cto @k @f)]\n-988d30f3a4596b2cd0e5dc6395c73210\n+fe10b1831578fa5c66be8fc12d898dee\n $fGenericUnit_$cfrom ::\n forall k (f :: k -> *) x. Unit f -> GHC.Generics.Rep (Unit f) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!A>, CPR: 1, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n (\\ @k @f :: k -> * @x (x1['GHC.Types.Many] :: Unit f) ->\n case x1 of wild { Unit ->\n@@ -1177,25 +1177,25 @@\n _R\n %<'GHC.Types.Many>_N ->_R (Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Unit[0] _N _N))) _N)]\n-daeb0ecb0553598744d2bbffb657bcb1\n+154e64e1633e02050b5a1160f99ee9c3\n $fGenericUnit_$cto ::\n forall k (f :: k -> *) x. GHC.Generics.Rep (Unit f) x -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!A>, CPR: 1, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @k\n @f :: k -> *\n@@ -1206,39 +1206,39 @@\n ((Sub (Rep_Unit[0] _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n _R) _N) of wild { GHC.Generics.U1 ->\n Unit @k @f }]\n-608759e3de07c95b82bd6fa18ac71ff1\n+9bde85f2797fae8570dcf6fff6a3373a\n $fGenericVoid ::\n forall k (f :: k -> *). GHC.Generics.Generic (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Generics.C:Generic], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fGenericVoid_$cfrom @k @f)\n ($fConstraintsBkVoid_$cto @k @f)]\n-5b3bb8e3eac1587571d7c8e55be5c8fd\n+ef704b9128d29a468fba5e8ea58af5cf\n $fGenericVoid_$cfrom ::\n forall k (f :: k -> *) x. Void f -> GHC.Generics.Rep (Void f) x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b, Inline: [1] (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n (\\ @k @f :: k -> * @x (x1['GHC.Types.Many] :: Void f) ->\n case x1 ret_ty (GHC.Generics.V1 x) of {})\n@@ -1247,19 +1247,19 @@\n _R\n %<'GHC.Types.Many>_N ->_R (Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R)\n ; Sub (Sym (Rep_Void[0] _N _N))) _N)]\n-6bf612e77c8532a52b77efa05d4386be\n+7972486db1d0ce9c967a29d88e4554a6\n $fMonoidUnit :: forall k (f :: k -> *). GHC.Base.Monoid (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Base.C:Monoid],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fSemigroupUnit @k @f)\n@@ -1268,144 +1268,144 @@\n (\\ (eta['GHC.Types.Many] :: [Unit f]) ->\n GHC.Base.foldr\n @(Unit f)\n @(Unit f)\n ($fMonoidUnit_$c<> @k @f)\n (Unit @k @f)\n eta)]\n-25658b865bebad3e3d2ef83e10f29fdf\n+da19f87290552ad93437ebb9778715bd\n $fMonoidUnit_$c<> ::\n forall k (f :: k -> *). Unit f -> Unit f -> Unit f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: Unit f) ->\n case ds of wild { Unit -> ds1 }]\n-e419b75608753b67ab3ed99a8e39427d\n+cec175889e93a676a7b7055e7760e35b\n $fOrdUnit :: forall k (f :: k -> *). GHC.Classes.Ord (Unit f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Ord], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fEqUnit @k @f)\n ($fOrdUnit_$ccompare @k @f)\n ($fEqUnit_$c< @k @f)\n ($fOrdUnit_$c<= @k @f)\n ($fOrdUnit_$c> @k @f)\n ($fEqUnit_$c== @k @f)\n ($fOrdUnit_$cmax @k @f)\n ($fOrdUnit_$cmax @k @f)]\n-737ab37c2e2a1557736280f76b569a21\n+6e7a7afa8ff87b773524467537327fa6\n $fOrdUnit_$c<= ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case b of wild { Unit ->\n case a of wild1 { Unit -> GHC.Types.True } }]\n-f9a66f6aeb3208ea14f6027e08ee348b\n+68e05fe53339d9a51a660f48fc15af38\n $fOrdUnit_$c> ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case b of wild { Unit ->\n case a of wild1 { Unit -> GHC.Types.False } }]\n-bc5a2af7d200a6a55a878636a01ade2f\n+1ee527845aea2dd2fe5474d69735b406\n $fOrdUnit_$ccompare ::\n forall k (f :: k -> *). Unit f -> Unit f -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1!A>, CPR: 2,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (a['GHC.Types.Many] :: Unit f)\n (b['GHC.Types.Many] :: Unit f) ->\n case a of wild { Unit ->\n case b of wild1 { Unit -> GHC.Types.EQ } }]\n-498e3aa10b364aefff0ee1696fe49738\n+04eee19f1c787b121d775bffaa06bac0\n $fOrdUnit_$cmax ::\n forall k (f :: k -> *). Unit f -> Unit f -> Unit f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A><1!A>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Unit f)\n (y['GHC.Types.Many] :: Unit f) ->\n case y of wild { Unit -> x }]\n-4021c2c9a289571146e8c106fb7d5159\n+a3d4cd7b6a882466f5d41f45027cc301\n $fOrdVoid :: forall k (f :: k -> *). GHC.Classes.Ord (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Classes.C:Ord], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fEqVoid @k @f)\n ($fOrdVoid_$ccompare @k @f)\n ($fOrdVoid_$c>= @k @f)\n ($fOrdVoid_$c<= @k @f)\n ($fOrdVoid_$c<= @k @f)\n ($fOrdVoid_$c>= @k @f)\n ($fOrdVoid_$cmax @k @f)\n ($fOrdVoid_$cmax @k @f)]\n-3d7564034f1f3c902b66f31b06e140bd\n+438d6c3a8724710ba345770773591db5\n $fOrdVoid_$c<= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Types.Bool of {}]\n-18c2ae080df8a8e523fbf6929b64bb07\n+1bd49341fe8a68ca4965e5ec1e6c4a1c\n $fOrdVoid_$c>= ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case y ret_ty GHC.Types.Bool of {}]\n-4da813479d70bca940e7148bb2a4915e\n+f15021678e19dca28c31484f24e245bd\n $fOrdVoid_$ccompare ::\n forall k (f :: k -> *). Void f -> Void f -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> GHC.Types.Ordering) of {}]\n-d9142c5cd7cbc93208bc854741e9dc61\n+06867c8e80d874be135aadedb7150809\n $fOrdVoid_$cmax ::\n forall k (f :: k -> *). Void f -> Void f -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (x['GHC.Types.Many] :: Void f)\n (y['GHC.Types.Many] :: Void f) ->\n case x ret_ty (Void f) of {}]\n-fd61e7f8ef561173ee54d9c3ae6c4450\n+aca70b476e4eb188205c8781539f93ff\n $fReadUnit :: forall k (f :: k -> *). GHC.Read.Read (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Read.C:Read],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fReadUnit_$creadsPrec @k @f)\n@@ -1413,15 +1413,15 @@\n ($fReadUnit1 @k @f)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n ($fReadUnit_$creadListPrec @k @f)]\n-2230d2fde13195a03c3da2de484d28af\n+427e50ba06360009377a52bc643bae3c\n $fReadUnit1 ::\n forall {k} {f :: k -> *}.\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> Text.ParserCombinators.ReadP.P b\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -1441,15 +1441,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n eta\n @b\n eta1 of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @b ww }]\n-08964fce1ad4c37c487228ee48aed69e\n+8e90666fcce5b5a8cb9f10f02b11efdc\n $fReadUnit2 ::\n forall {k} {f :: k -> *}.\n Text.ParserCombinators.ReadPrec.Prec\n -> forall b.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> Text.ParserCombinators.ReadP.P b\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n@@ -1459,55 +1459,55 @@\n @f :: k -> *\n (n['GHC.Types.Many] :: Text.ParserCombinators.ReadPrec.Prec)\n @b\n (eta['GHC.Types.Many] :: Unit f\n -> Text.ParserCombinators.ReadP.P b) ->\n case $w$creadPrec @k @f @b eta of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @b ww }]\n-2c2688a27ddc1af5d4e1402a75c6b226\n+caaacb3dbc5b64c2b215017976936780\n $fReadUnit3 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $tcUnit3]\n-1ae6b258e10076c3b9df05498ae213c1\n+43a51f9f6913cfdb0e36d2a6a77d2805\n $fReadUnit4 ::\n forall {k} {f :: k -> *}. Text.ParserCombinators.ReadP.P [Unit f]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n (($fReadUnit_$creadListPrec @k @f)\n `cast`\n (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] <[Unit f]>_R)\n GHC.Read.$fRead()7)\n `cast`\n (Text.ParserCombinators.ReadP.N:ReadP[0] <[Unit f]>_R)\n @[Unit f]\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure @[Unit f])]\n-c6779d6f42f39a2ca9aa6be4d9d470cf\n+0b73d0f3b13fee171bec1aea55bed8c5\n $fReadUnit_$creadList ::\n forall k (f :: k -> *). Text.ParserCombinators.ReadP.ReadS [Unit f]\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n Text.ParserCombinators.ReadP.run @[Unit f] ($fReadUnit4 @k @f)]\n-cf253a227255d615533d24c44d9fb59e\n+cc31994998bbe055b88bc3ec436018ce\n $fReadUnit_$creadListPrec ::\n forall k (f :: k -> *).\n Text.ParserCombinators.ReadPrec.ReadPrec [Unit f]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Unfolding: Core: \n \\ @k @f :: k -> * ->\n GHC.Read.list\n @(Unit f)\n ($fReadUnit1 @k @f)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Text.ParserCombinators.ReadP.N:ReadP[0]\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))]\n-4ef63b73282d5eacc20bee8d3d4bd059\n+7e20454831825a301e43b68d4193049d\n $fReadUnit_$creadsPrec ::\n forall k (f :: k -> *).\n GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (Unit f)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * (eta['GHC.Types.Many] :: GHC.Types.Int) ->\n Text.ParserCombinators.ReadP.run\n@@ -1521,216 +1521,216 @@\n _R)\n ; Sym (Text.ParserCombinators.ReadPrec.N:ReadPrec[0] _R))\n eta\n @(Unit f)\n (Text.ParserCombinators.ReadP.$fApplicativeP_$cpure\n @(Unit f)) of wild { Solo# ww ->\n Text.ParserCombinators.ReadP.Look @(Unit f) ww })]\n-3fc8d31621f7052633eb0319573a725a\n+764b02bc804a7b80fbc26933ce18dba5\n $fReadUnit_lexeme18 :: Text.Read.Lex.Lexeme\n [TagSig: , LambdaFormInfo: LFCon[Text.Read.Lex.Ident],\n Unfolding: Core: Text.Read.Lex.Ident $fReadUnit3]\n-9973147d4ca2d5c23fba36b3ce10191b\n+310bbfcd5f18bb30088766ffe923fb9c\n $fSemigroupUnit ::\n forall k (f :: k -> *). GHC.Base.Semigroup (Unit f)\n DFunId\n [LambdaFormInfo: LFCon[GHC.Base.C:Semigroup], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fMonoidUnit_$c<> @k @f)\n ($fSemigroupUnit_$csconcat @k @f)\n ($fSemigroupUnit_$cstimes @k @f)]\n-b2fc45a03da5d6e0037bc2f868fc02d6\n+d5e71130c767a58d5448805038e8f643\n $fSemigroupUnit1 ::\n forall {k} {f :: k -> *}. Unit f -> [Unit f] -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1!A><1L>, CPR: 1, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @f :: k -> *\n (b['GHC.Types.Many] :: Unit f)\n (ds1['GHC.Types.Many] :: [Unit f]) ->\n case b of wild { Unit ->\n case $wpoly_go1 @k @f ds1 of wild1 { (##) -> Unit @k @f } }]\n-8c4f42152449e3ae6cdfd0f0ac837a6d\n+d434745cd1558255ac3d496ca563832c\n $fSemigroupUnit_$csconcat ::\n forall k (f :: k -> *). GHC.Base.NonEmpty (Unit f) -> Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(1!A,1L)>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Unit f)) ->\n case ds of wild { GHC.Base.:| a1 as ->\n $fSemigroupUnit1 @k @f a1 as }]\n-78e942ef424415a562da4b8d063cc7cb\n+f1ee96770ff4b4ae0c7c2d1530ee3c2d\n $fSemigroupUnit_$cstimes ::\n forall k (f :: k -> *) b.\n GHC.Real.Integral b =>\n b -> Unit f -> Unit f\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-759fe6ffe7ecff5b24d784faa2a159e0\n+6b0bac5c7bf345c67a23096c5a5c30ff\n $fSemigroupVoid ::\n forall k (f :: k -> *). GHC.Base.Semigroup (Void f)\n DFunId\n [LambdaFormInfo: LFCon[GHC.Base.C:Semigroup], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fSemigroupVoid_$c<> @k @f)\n ($fSemigroupVoid_$csconcat @k @f)\n ($fSemigroupVoid_$cstimes @k @f)]\n-4cf101b648fde4d8eaf3955556210ed0\n+23e9c387a670fd4dc343aa4b0edd7398\n $fSemigroupVoid_$c<> ::\n forall k (f :: k -> *). Void f -> Void f -> Void f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty (Void f -> Void f) of {}]\n-682c1b55924c7ee1a20d8cc5ca1bab31\n+e55a410f14eea97be370371eb94a4917\n $fSemigroupVoid_$csconcat ::\n forall k (f :: k -> *). GHC.Base.NonEmpty (Void f) -> Void f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1P(1L,1L)>, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Void f)) ->\n case ds of wild { GHC.Base.:| ww ww1 ->\n case ww1 of wild1 {\n [] -> ww : c cs -> case ww ret_ty (Void f) of {} } }]\n-e152c5f0756983f2ef98f1b156f8356a\n+56059cb38b891282bb608297097c8d24\n $fSemigroupVoid_$cstimes ::\n forall k (f :: k -> *) b.\n GHC.Real.Integral b =>\n b -> Void f -> Void f\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ]\n-17897a0eb86461af684773439077f834\n+7dc9de16e2e559f5b691c7d50fb24dc0\n $fShowUnit :: forall k (f :: k -> *). GHC.Show.Show (Unit f)\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[GHC.Show.C:Show],\n Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Unit f)\n ($fShowUnit_$cshowsPrec @k @f)\n ($fShowUnit_$cshow @k @f)\n ($fShowUnit_$cshowList @k @f)]\n-77cc33de874df3e4a95ead852d28716a\n+602bd70f7e4176198dafc402eb58db5f\n $fShowUnit1 :: forall {k} {f :: k -> *}. Unit f -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <2,TrueFalse>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: Unit f)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Unit ->\n GHC.CString.unpackAppendCString# $tcUnit3 eta }]\n-fa226c517bdfbdf2d25c9ca471eee715\n+fdeec03a53703dc5d2addf82913321cf\n $fShowUnit_$cshow ::\n forall k (f :: k -> *). Unit f -> GHC.Base.String\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1!A>,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (x['GHC.Types.Many] :: Unit f) ->\n case x of wild { Unit -> $fReadUnit3 }]\n-ac41a036b912c40c4784a5bb4dfc7fd6\n+f9ce762e84d826f3c60adc0cfe4c5914\n $fShowUnit_$cshowList ::\n forall k (f :: k -> *). [Unit f] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @f :: k -> *\n (ls['GHC.Types.Many] :: [Unit f])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Unit f) ($fShowUnit1 @k @f) ls s]\n-71bcc0537e844de9a73fb17688e9d08f\n+831da9300fc04dd498dd645bfdcf7e36\n $fShowUnit_$cshowsPrec ::\n forall k (f :: k -> *). GHC.Types.Int -> Unit f -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1!A>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (ds1['GHC.Types.Many] :: Unit f)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds1 of wild { Unit ->\n GHC.CString.unpackAppendCString# $tcUnit3 eta }]\n-a8c119730bb9eac5974ef9bf26260ff5\n+6f6d4ce8c9312967a4c88ab25c065036\n $fShowVoid :: forall k (f :: k -> *). GHC.Show.Show (Void f)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Show.C:Show], Inline: CONLIKE,\n Unfolding: DFun: @k @f :: k -> *.\n @(Void f)\n ($fShowVoid_$cshowsPrec @k @f)\n ($fShowVoid_$cshow @k @f)\n ($fShowVoid_$cshowList @k @f)]\n-efaed998ac7467c86c0b8621b7e4d805\n+a85c6f852306de4efc0e7a5da5573011\n $fShowVoid1 :: forall {k} {f :: k -> *}. Void f -> GHC.Show.ShowS\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty GHC.Show.ShowS of {}]\n-491ef704aa9746d713653b8ff5beb5d0\n+b2707d816455248133b1d311695c46e5\n $fShowVoid_$cshow ::\n forall k (f :: k -> *). Void f -> GHC.Base.String\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1S>b, CPR: b,\n Unfolding: Core: \n \\ @k @f :: k -> * (x['GHC.Types.Many] :: Void f) ->\n case x ret_ty GHC.Base.String of {}]\n-38c87b3247d9f205cf296e342c19eb04\n+477f1248c8b09029b62b03e7cc4038b7\n $fShowVoid_$cshowList ::\n forall k (f :: k -> *). [Void f] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @f :: k -> *\n (ls['GHC.Types.Many] :: [Void f])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Void f) ($fShowVoid1 @k @f) ls s]\n-c4d96ab2efa1b3d7b64f82ec865759b5\n+282fbbc5b4032169e29124cc00227893\n $fShowVoid_$cshowsPrec ::\n forall k (f :: k -> *). GHC.Types.Int -> Void f -> GHC.Show.ShowS\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1S>b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @f :: k -> *\n (ds['GHC.Types.Many] :: GHC.Types.Int)\n (v['GHC.Types.Many] :: Void f) ->\n case v ret_ty GHC.Show.ShowS of {}]\n-7ae919f0fb416334ee0ad7c135e83c1e\n+a419239b521f913284f4b60d91350731\n $fTraversableBkUnit ::\n Barbies.Internal.TraversableB.TraversableB Unit\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.TraversableB.C:TraversableB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Unit\n ($fApplicativeBkUnit_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkUnit_$cbtraverse @k)]\n-bf9f476a5ab643dca138380558a5b926\n+a25518b4dafea274604ea71ec89b31a4\n $fTraversableBkUnit1 ::\n GHC.Generics.U1 GHC.Types.Any -> GHC.Generics.U1 GHC.Types.Any\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!A>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ (ds['GHC.Types.Many] :: GHC.Generics.U1 GHC.Types.Any) -> ds]\n-e2093140333b8caa5526fa7a8b07dbed\n+e4ac526cf73f8ba187a1f69f0991d7b9\n $fTraversableBkUnit2 ::\n GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1\n GHC.Types.Any\n@@ -1746,15 +1746,15 @@\n \\ (ds['GHC.Types.Many] :: GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1\n GHC.Types.Any) ->\n ds]\n-cddfdc465f53eda56819e71f1d26cbb9\n+3cbd0ca9662674afcd704f61c7f97e94\n $fTraversableBkUnit_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> Unit f -> e (Unit g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: [2],\n@@ -1762,150 +1762,150 @@\n \\ @k\n @e :: * -> *\n @f :: k -> *\n @g :: k -> *\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative e)\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a)) ->\n $w$cbtraverse @k @e @f @g $dApplicative]\n-f4423422beaf0a31a2fbc9fe9cb78a4f\n+9b3aa75f47d406f4362e96727b2d1d9e\n $fTraversableBkVoid ::\n Barbies.Internal.TraversableB.TraversableB Void\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Barbies.Internal.TraversableB.C:TraversableB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Void\n ($fConstraintsBkVoid_$cbmap @k)\n `cast`\n (Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkVoid_$cbtraverse @k)]\n-f5453925a21f745a6e45297a61fc97dc\n+c5379ecc50562fe81c14e74961298db0\n $fTraversableBkVoid1 :: e (GHC.Generics.V1 GHC.Types.Any)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-1ac952f93965abe7753d5403f6c8021c\n+2ac0263de78f09012ae14d679c503db3\n $fTraversableBkVoid2 ::\n GHC.Generics.V1 GHC.Types.Any -> GHC.Generics.V1 GHC.Types.Any\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, CPR: b,\n Unfolding: Core: \n \\ (ds['GHC.Types.Many] :: GHC.Generics.V1 GHC.Types.Any) -> ds]\n-fdf8dc9929163d6f71e878c01efbf00b\n+0fb8449d658a70078920664b3da26baf\n $fTraversableBkVoid_$cbtraverse ::\n forall k (e :: * -> *) (f :: k -> *) (g :: k -> *).\n GHC.Base.Applicative e =>\n (forall (a :: k). f a -> e (g a)) -> Void f -> e (Void g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @k\n @e :: * -> *\n @f :: k -> *\n @g :: k -> *\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative e)\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> e (g a)) ->\n $w$cbtraverse1 @k @e @f @g $dApplicative]\n-7d87e1e6de936ad4f2b660002a5bb4a2\n+5a7b2997c5aeffc2a7db991a19eefc4d\n $tc'Unit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2037945628109684343#Word64\n- 3105404948668750788#Word64\n+ 11182171310931468719#Word64\n+ 15130054231645004319#Word64\n $trModule\n $tc'Unit2\n 2#\n $tc'Unit1]\n-6d9d58d423e3c8433afc20c36ca55660\n+ba7283be9cde66c007985346f61c5adc\n $tc'Unit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepTyConApp], Inline: [~]]\n-197954868841bb9a2a7e5ad4e2eb1690\n+37cb0a3e1453daa5245195e9fd914145\n $tc'Unit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Unit3]\n-e38c9b5774ffaddd577a9da1243b9c01\n+df550ca6607aacf3ced74baabd787150\n $tc'Unit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Unit\"#]\n-76d7bd2419a8b1ccd453a2c37d3afc1f\n+60667ee87fd6c04f0f4b6c638a1819ca\n $tcUnit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 376088529795041861#Word64\n- 17036368632291288187#Word64\n+ 4400758968235990726#Word64\n+ 10609866802840247821#Word64\n $trModule\n $tcUnit2\n 1#\n $tcUnit1]\n-ac7826a56b85bfa91610ca5c044cf7fd\n+b4e5599a2e0a6fc106f274eacea97db4\n $tcUnit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-6f6ab7b32c6f8df93c076e4f29b4d0d3\n+eadacb3e0f8420eae859a40757928bf5\n $tcUnit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcUnit3]\n-c4b818509730ae1df37cd1431bfac0d0\n+48213a220ddbce89449619d55bfc6f29\n $tcUnit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Unit\"#]\n-59b8bdbb38b837efb9b92da37ec57cfa\n+3fa553ec849965a49744bd53545ed41e\n $tcVoid :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11724475054022156485#Word64\n- 16512914446536540340#Word64\n+ 15534941731016754011#Word64\n+ 14556625491385436117#Word64\n $trModule\n $tcVoid1\n 1#\n $tcUnit1]\n-989bc38fe9b68b062cad2bc8ed2f7ff0\n+0f3e1656da072f781514b688f628382c\n $tcVoid1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcVoid2]\n-9ec764fb4bef8c2995c4cfb105a7b2d5\n+a127e11570f7fc56b7eb6d5a9df0081b\n $tcVoid2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Void\"#]\n-37fabeae6e71866f018d3ecf19babc99\n+8d2fc5374840026ed70dd271fdfe15ff\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-7f27288f386466f8030e41df04171ef4\n+15f6c340cb21b7720537e862b23b1654\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-343d429f740b11d7056fb2985f05f9f1\n+99ef5acab82fa44157a5c9867c67a2b4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Trivial\"#]\n-6b6b7c194bd03929444667004c2e6f1c\n+81c3d87de01b16e1922d6e7f880a1be9\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b5f045fe37aad4d42ddc0e88f3f20b3f\n+c3c9295c398cba836967ee71be3e8068\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-86cc35b38237cfc9217db81bb68c6d66\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+114c864fd268a20b6f2ace92caeebf85\n $w$cbtraverse ::\n forall {k} {e :: * -> *} {f :: k -> *} {g :: k -> *}.\n GHC.Base.Applicative e =>\n Unit f -> e (Unit g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -1942,15 +1942,15 @@\n ((Sub (Rep_Unit[0] _N _N)\n ; (GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1961,15 +1961,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n e (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n GHC.Types.Any)\n@@ -2024,15 +2024,15 @@\n GHC.Generics.U1\n GHC.Types.Any)\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n GHC.Types.Any)\n@@ -2046,15 +2046,15 @@\n GHC.Types.Any>_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _N _N)\n ; GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R\n ; GHC.Generics.N:M1[0]\n@@ -2127,15 +2127,15 @@\n `cast`\n (_R (((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -2146,15 +2146,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n (Sym (Data.Generics.GenericN.D:R:Indexed[1]\n <(k -> *) -> *>_N\n (Sym (Add0L (<1>_N)))\n _N)))_N) _N))_N)\n (Sym (Rep_Unit[0] _N _N)))_N) _N))]\n-0f9e65baf6f68fee150d729b30fa37ce\n+e664185784f109c5e46578d829b1686d\n $w$cbtraverse1 ::\n forall {k} {e :: * -> *} {f :: k -> *} {g :: k -> *}.\n GHC.Base.Applicative e =>\n Void f -> e (Void g)\n [LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -2208,23 +2208,23 @@\n ((Sub (Rep_Void[0] _N _N)\n ; (GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[5]))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ; (Data.Generics.GenericN.Zip\n (Sym (Rep_Void[0] _N _N)\n ; (GHC.Generics.Rep\n ((Sym (Data.Generics.GenericN.D:R:FilterIndex[2]\n@@ -2244,47 +2244,47 @@\n (GHC.Base.$p1Applicative @e $dApplicative)\n @(GHC.Generics.V1 GHC.Types.Any)\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n GHC.Generics.V1\n GHC.Types.Any)\n $fTraversableBkVoid2\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n _R) _N)\n ($fTraversableBkVoid1 @e))\n `cast`\n (_R (((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[5])))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N)\n ; (Data.Generics.GenericN.Zip\n (Sym (Rep_Void[0] _N _N)\n ; (GHC.Generics.Rep\n ((Sym (Data.Generics.GenericN.D:R:FilterIndex[2]\n@@ -2296,15 +2296,15 @@\n <(k -> *) -> *>_N\n (Sym (Add0L (<1>_N)))\n _N)))_N) _N))_N)\n (Sym (Rep_Void[0] _N _N)))_N) _N))\n } in\n \\ (x['GHC.Types.Many] :: Void f) -> lvl38]\n-fce7d0d518403d19515a9a10804a910e\n+76a9cd4ee6bb2db47aa16daf31bbcd75\n $w$cgmapMo ::\n forall {k} {f :: k -> *} {m :: * -> *}.\n GHC.Base.MonadPlus m =>\n Unit f -> m (Unit f)\n StrWork([!])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: , Inline: [2],\n@@ -2325,15 +2325,15 @@\n @(Unit f)\n (case eta1 of wild1 { Unit ->\n ww3 @(Unit f, GHC.Types.Bool) ($fDataUnit1 @k @f) })\n (\\ (ds['GHC.Types.Many] :: (Unit f, GHC.Types.Bool)) ->\n case ds of wild1 { (,) x' b ->\n case b of wild2 {\n GHC.Types.False -> lvl38 GHC.Types.True -> ww3 @(Unit f) x' } }) }]\n-40ea6af37af998fcc440c6d6e9eb3352\n+99c07ec07340184ba30475bac40a5415\n $w$creadPrec ::\n forall {k} {f :: k -> *} {b}.\n (Unit f -> Text.ParserCombinators.ReadP.P b)\n -> (# GHC.Base.String -> Text.ParserCombinators.ReadP.P b #)\n [TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: [2],\n Unfolding: Core: \n@@ -2359,61 +2359,61 @@\n [Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ (a1['GHC.Types.Many] :: ()) -> lvl126]\n = \\ (a1['GHC.Types.Many] :: ()) -> lvl126\n } in\n (# \\ (a['GHC.Types.Many] :: GHC.Base.String) ->\n Text.ParserCombinators.ReadP.skipSpaces2 a @b k1 #)]\n-c38f58dd2fc1efd280762699ea11698c\n+f3c4a4e25b40bfc65c0ac5abebc3aa7f\n $wpoly_go1 :: forall {k} {f :: k -> *}. [Unit f] -> (# #)\n StrWork([!])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>, Inline: [2]]\n-a6c6b351bacdf7b6e7761bdcdd5068d6\n+53ad87fb4dabbcad025afeb6f31e69ad\n axiom R:AllBkcUnit ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c Unit\n = Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB Unit)\n-ae173a4dfa1c8503685a590e91911842\n+717874956d0a8db4ee6c5ef196c76e53\n axiom R:AllBkcVoid ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c Void\n = Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB Void)\n-5bf82e658d764ffe9224ffcab9832439\n+ea39edac98d2027e00da6855a84beb89\n axiom Rep_Unit ::\n forall k (f :: k -> *).\n GHC.Generics.Rep (Unit f)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n-a83c84f4d35d9b9a81a89e1a37c36b39\n+c1aa0b2245166345f8f2171195f91eea\n axiom Rep_Void ::\n forall k (f :: k -> *).\n GHC.Generics.Rep (Void f)\n = GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Void\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n GHC.Generics.V1\n-c1936e142e7230f25a3d66e4ed000254\n+a654d0e651ca97ead2ab39e18faca7f6\n type role Unit phantom\n type Unit :: forall k. (k -> *) -> *\n data Unit f = Unit\n-5d92e28d57b6d96e3f5a3ac3e40a4208\n+72c7639709c23990593c7129be2962f0\n type role Void phantom\n type Void :: forall k. (k -> *) -> *\n data Void f\n instance Barbies.Internal.ApplicativeB.ApplicativeB [., Unit]\n = $fApplicativeBkUnit\n instance Barbies.Internal.ConstraintsB.ConstraintsB [., Unit]\n = $fConstraintsBkUnit\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wear.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wear.p_hi", "comments": ["Files 88% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,139 +1,139 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.Wear 9066\n- interface hash: a96e6224c6de26a9a7efe8ed5decb606\n- ABI hash: e7f22eb15cb784a998456b5140cf200d\n- export-list hash: 78c8bc7934601c506594bbc6e00d10b4\n+ interface hash: db4341927fe88b4e216b9fd80bf55ebc\n+ ABI hash: 14f242eb3d2574da8af91a6231554daf\n+ export-list hash: 0844baf41368bc42b02e1f4080c4e399\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: d07d716e4378a7121ecb3786865367fa\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 3d14163eb7acfe46c239d55131a80be5\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Bare\n Covered\n Wear\n WearTwo\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Param 64ce4f405ce19c0ac06589973a57c10d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n import -/ GHC.TypeError 79dfedc7ca947db73137bb493c3e707f\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-67f3d54b29a2687310c64890ce5b10d4\n+3b855753268c3a8306cc413dfc51a551\n $tcBare :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12345073740570411872#Word64\n- 741779550252200127#Word64\n+ 405425250779376933#Word64\n+ 4956015487972208583#Word64\n $trModule\n $tcBare1\n 0#\n GHC.Types.krep$*]\n-e04de1dc3a2b7ad84d362bc4b719faa6\n+22f0ee970b086bd5c65d6bacfa157919\n $tcBare1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBare2]\n-cf8195b3e9411b2c8346ad18ec151001\n+9edaa9d688671a970b3e5c85bb60182e\n $tcBare2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Bare\"#]\n-dabf56891c8664871dafbb6917c271aa\n+bca89cebac9322e398f97247f97de8f3\n $tcCovered :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3022141369616637646#Word64\n- 10375174585551583116#Word64\n+ 5468045204005402524#Word64\n+ 7421514990380126091#Word64\n $trModule\n $tcCovered1\n 0#\n GHC.Types.krep$*]\n-9e7a2dca47d7084438895c0e2c866770\n+f644d22f82609c671b31b2cab6c3a1a5\n $tcCovered1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcCovered2]\n-73dc93a647e3e6936664a3b99825c48b\n+9c5b14f20b0be5048cb7ac4c48380a15\n $tcCovered2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Covered\"#]\n-4322ce4b8568f4253e4a158c0ae990f6\n+bfdb3f569dee5beacd07f13442757fcf\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2a10c039b5e50588dd5e0278919ffa17\n+bf3f5f104f04987105afa4873ac21da1\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-d4a09d97dea71c44da93a669ab133ef4\n+753355dd71efb780d0d06fef7dedf4a4\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Wear\"#]\n-38708f0d06e475235c364c95c9c76dcf\n+d36c1e1f32d600cc37ec6222b01c8c24\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-d868079f0217d5dd1d25ca6afb7f825b\n+6fe7e741ec62bb5572f4ba8b0174c91d\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-2c0b113e3f5ede6fc221c55203ab8fd8\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+fa36594200f27a69b52f2f7a64b80fab\n type Bare :: *\n data Bare\n-80eea34d14e8600810c9ab377badacc1\n+eeaf328cbe4a57c6e3233af96bb554e7\n type Covered :: *\n data Covered\n-1a1a4a4c87e02f1ea861ad1e9b416487\n+7a692a95a35079399d24fd04e6ff0213\n axiom D:R:Wear ::\n Wear Bare f a = a\n Wear Covered f a = f a\n Wear (Data.Generics.GenericN.Param _1 t) f a = Wear t f a\n Wear t _1 _2 = (TypeError ...)\n-236ea46a0f2decdd8d0aeb99eb30ae38\n+6faabd0f19dcb6b56f70a3d39f1054a8\n axiom D:R:WearTwo ::\n WearTwo Bare f g a = a\n WearTwo Covered f g a = f (g a)\n WearTwo (Data.Generics.GenericN.Param _1 t) f g a = WearTwo t f g a\n WearTwo t _1 _2 _3 = (TypeError ...)\n-bc12aa8c9f74907821f2b32c6dbbc3ed\n+1612dc273c345679bd612935358ae645\n type Wear :: * -> (* -> *) -> * -> *\n type family Wear t f a where\n Wear Bare f a = a\n Wear Covered f a = f a\n Wear (Data.Generics.GenericN.Param _1 t) f a = Wear t f a\n Wear t _1 _2 = (TypeError ...)\n axiom D:R:Wear\n-d06bb9da09839e1cb4a0a098d403587b\n+d957b83cc662451223c70d0fed19a0ad\n type WearTwo :: * -> (* -> *) -> (* -> *) -> * -> *\n type family WearTwo t f g a where\n WearTwo Bare f g a = a\n WearTwo Covered f g a = f (g a)\n WearTwo (Data.Generics.GenericN.Param _1 t) f g a = WearTwo t f g a\n WearTwo t _1 _2 _3 = (TypeError ...)\n axiom D:R:WearTwo\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Wrappers.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Wrappers.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,77 +1,77 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.Wrappers [family instance module] 9066\n- interface hash: 266ff3cb96bbd26773d73e8b83f20193\n- ABI hash: 7958e4aadfb4871559a27df0095b994b\n- export-list hash: 9f5517e3ff8f369efce374339dce99ad\n+ interface hash: 1a02ccd32ec40a892d4439753b0b3fce\n+ ABI hash: 43d6d92d6f288625dea9f42a20c3850f\n+ export-list hash: def7f398dd21c52b4a641939c81ad0d7\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: dd082c773c8d896b129bce66811ca816\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: ca1c0caae6aafa314e50ef3ded92a5a5\n sig of: Nothing\n used TH splices: False\n where\n exports:\n Barbie{Barbie getBarbie}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.FunctorB\n Barbies.Internal.TraversableB GHC.Base GHC.Float GHC.Prim.Ext\n family instance modules: Barbies.Generics.Constraints\n Barbies.Internal.ConstraintsB Data.Generics.GenericN\n Control.Applicative Control.Arrow Data.Complex Data.Functor.Compose\n Data.Functor.Const Data.Functor.Identity Data.Functor.Product\n Data.Functor.Sum Data.Monoid Data.Semigroup.Internal Data.Type.Ord\n Data.Version GHC.Generics GHC.IO.Exception GHC.RTS.Flags\n Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- exports: 97f76e0a31067bdc9623d74dfb179978\n- ApplicativeB e831de0bd01221227318ff01f360d4cb\n- bprod faa80cda7d5ebacb4d59ff2581e950e5\n- bpure 8f62c3bd94a72cb3e7cb88067b7fc1f0\n- bzipWith3 b2544b9a4f69672e9990c4248d54ad9c\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB c915225ce12dec07b484cb0e6c8bc95f\n- exports: 62d29be84a756dd8aa3183dad2a1d146\n- AllB 742934a1aef6759c559e39d90cf8ee7d\n- AllBF 2852bbf285ab6932b0e4764b71b81856\n- ConstraintsB dc18dd2fb15b81c31fdce03ebb848f0f\n- baddDicts 9e213c6aa1b780911ccc0eff66d247dd\n- bdicts eb562e059c0b85eb1b87b13a0dd3252a\n- bmempty 463212406bd01ecda8db986af75227fd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts 11d9cab4807894b2baa78a0cba8e7494\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- ClassF b821ba43283d58af1dc72dc522c3f3e0\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict 1ef5ac9bdc38d1886b55376c71cb27fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- exports: a8196cc20ebeb66df453e15c78d677c9\n- TraversableB 276504176defd37fdae4e05d479e9cc6\n- btraverse 44638623568081a176cfc6fcc0804dca\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ exports: 5b192dab08a0491faf09373600f4b2cd\n+ ApplicativeB 16deedde4d173b65d0723755e5a93713\n+ bprod 8e131e15a5f98601851c0b27ac4241c0\n+ bpure e8e39b317ff94f27399a39d7e16b86a9\n+ bzipWith3 0af74d4e86fd92f65a95f59ae545d30a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB cb077425686d4bb620c4f51549182b9f\n+ exports: 805180e0c2ac5e4eb5bae7572cee9a36\n+ AllB 1b4f9a291ec9d45a18d31df601e0aeeb\n+ AllBF 63bb86e4a6c471b3a0fb28f25103dd36\n+ ConstraintsB 0e5c16bae977600323d72f12d780df0a\n+ baddDicts 45de3f1644ad793bfa156162f97dcda3\n+ bdicts e07f5a7ebb838629173d9923292efbda\n+ bmempty 67368e786413af9677c05a4fe1067921\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 0c882df337c0ddb4b93d319e9df15dee\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ ClassF cedbbc004e9d832ea18c4ef8ea2a51e5\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 501619b73143cb187d749df6455ffe8e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ exports: 6564e0103587f68d905c5ccbec42ca55\n+ TraversableB b16eda90a135f995e76c64fdf076422a\n+ btraverse 2d1803bee429e065a9d4f13a0e12ab46\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-c2b188eff4b3ff8e734c3b189bb48872\n+9eb7f3edab31720d392abb96ccb25b84\n $fApplicativeBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.ApplicativeB.ApplicativeB b =>\n Barbies.Internal.ApplicativeB.ApplicativeB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -106,15 +106,15 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N)]\n-c3144ffc6c1ffe7e2bd07a4a2fb159d5\n+fa6de7a761f230d3a65f1821b7193668\n $fConstraintsBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.ConstraintsB.ConstraintsB b =>\n Barbies.Internal.ConstraintsB.ConstraintsB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n@@ -136,15 +136,15 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fConstraintsBkBarbie_$cbaddDicts @k @b v)]\n-569fe9fb63402a3eec9a04ba5c9a02ec\n+7446719df3fa3efbfec195566742958e\n $fConstraintsBkBarbie_$cbaddDicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint)\n (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ConstraintsB.AllB c (Barbie b)) =>\n Barbie b f\n -> Barbie\n@@ -180,15 +180,15 @@\n (N:Barbie[0] _N _R _N))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N)]\n-6758310e157b3e29cbbed6bc933c659e\n+61cfeb44b11f6310c8bdbbce75d6cd67\n $fFunctorBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.FunctorB.FunctorB b =>\n Barbies.Internal.FunctorB.FunctorB (Barbie b)\n DFunId\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>, Inline: (sat-args=0),\n@@ -202,15 +202,15 @@\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0]\n _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0]\n _N _N))]\n-248a203a76ec3181861d3169db1d7a5f\n+ab630dd399d6b8608568e36d5699f931\n $fFunctorBkBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *} {g :: k -> *}.\n Barbies.Internal.FunctorB.FunctorB b =>\n (forall (a :: k). f a -> g a) -> b f -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1C(1,L)>,\n Unfolding: Core: \n@@ -223,15 +223,15 @@\n (ds['GHC.Types.Many] :: forall (a :: k). f a -> g a) ->\n $dFunctorB\n `cast`\n (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N)\n @f\n @g\n ds]\n-41d12c4b17740bf56f23889c488805cb\n+7f36327e08e78a308dec9066c0118f75\n $fMonoidBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n GHC.Base.Monoid (Barbie b f)\n@@ -253,15 +253,15 @@\n @(Barbie b f)\n ($fSemigroupBarbie @k @b @f v v1 v2)\n ($fMonoidBarbie1 @k @b @f v v1 v2 v3)\n `cast`\n (Sym (N:Barbie[0] _N _R) _N)\n ($fMonoidBarbie_$c<> @k @b @f v v1 v2)\n ($fMonoidBarbie_$cmconcat @k @b @f v v1 v2 v3)]\n-10d3763793baca9498f60c5633b5b2b2\n+16567518ba8cc13562dd8a51f3174524\n $fMonoidBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n b f\n@@ -277,15 +277,15 @@\n ($dApplicativeB['GHC.Types.Many] :: Barbies.Internal.ApplicativeB.ApplicativeB\n b)\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b)\n (irred1['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Monoid f b) ->\n $w$cmempty @k @b @f $dConstraintsB $dApplicativeB irred1]\n-e1478f3a9c5a7c5a4511b502b0b83f6e\n+d9f864c6489905f6d0be9031af7c6cfa\n $fMonoidBarbie2 ::\n forall {k} {f :: k -> *} {a :: k}.\n Data.Functor.Product.Product\n (Data.Functor.Product.Product\n (Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Semigroup f))\n f)\n@@ -305,15 +305,15 @@\n GHC.Base.Semigroup f))\n f)\n f\n a) ->\n case ds of wild { Data.Functor.Product.Pair ds1 ha ->\n case ds1 of wild1 { Data.Functor.Product.Pair fa ga ->\n $fMonoidBarbie3 @k @f @a fa ga ha } }]\n-bba91baf8544473040a91c97ff889988\n+cf573e21e788cc2a69798577a63a4595\n $fMonoidBarbie3 ::\n forall {k} {f :: k -> *} (a :: k).\n Barbies.Internal.Dicts.Dict\n (Barbies.Internal.Dicts.ClassF GHC.Base.Semigroup f) a\n -> f a -> f a -> f a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Unfolding: Core: \n@@ -330,15 +330,15 @@\n `cast`\n (Barbies.Internal.Dicts.N:ClassF[0]\n <*>_N\n _N\n _N\n _N\n _N) }]\n-e849d0ad8bdbca90a7d9fb783f3685d6\n+292a85e893fb6e5846a2fdffd6e7cb4e\n $fMonoidBarbie_$c<> ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n Barbie b f -> Barbie b f -> Barbie b f\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -446,15 +446,15 @@\n (N:Barbie[0]\n _N\n _R _N)))\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N)]\n-2157add625f1576b54110cfd6ec3ee49\n+12793df733f25c218792cd3eed8fdd37\n $fMonoidBarbie_$cmconcat ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n [Barbie b f] -> Barbie b f\n@@ -485,15 +485,15 @@\n $dConstraintsB\n $dApplicativeB\n irred\n irred1)\n `cast`\n (Sym (N:Barbie[0] _N _R) _N)\n eta]\n-c3047ae968b3c248c140f11e99a7c9cd\n+5a86d2736cdedc14e35bc4c938690ee2\n $fSemigroupBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n GHC.Base.Semigroup (Barbie b f)\n DFunId\n@@ -509,15 +509,15 @@\n b)\n (v2['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b).\n @(Barbie b f)\n ($fMonoidBarbie_$c<> @k @b @f v v1 v2)\n ($fSemigroupBarbie_$csconcat @k @b @f v v1 v2)\n ($fSemigroupBarbie_$cstimes @k @b @f v v1 v2)]\n-16b7bda8d52da8933761d1a0a3bc459e\n+f9f8f22c12f80bcc760c4f5411e97768\n $fSemigroupBarbie_$csconcat ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n GHC.Base.NonEmpty (Barbie b f) -> Barbie b f\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n@@ -532,25 +532,25 @@\n ($dApplicativeB['GHC.Types.Many] :: Barbies.Internal.ApplicativeB.ApplicativeB\n b)\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllBF\n GHC.Base.Semigroup f b)\n (ds['GHC.Types.Many] :: GHC.Base.NonEmpty (Barbie b f)) ->\n case ds of wild { GHC.Base.:| ww ww1 ->\n $w$csconcat @k @b @f $dConstraintsB $dApplicativeB irred ww ww1 }]\n-afce6fa4a1948cfe6556fb1c128e0bf0\n+06b0de7caa3f3cc87be5d7195dedbac1\n $fSemigroupBarbie_$cstimes ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) b1.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b,\n GHC.Real.Integral b1) =>\n b1 -> Barbie b f -> Barbie b f\n [TagSig: , LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ]\n-00efc83bad231dc4bc54f2f0fda79a1c\n+df8b7cb3146a3dce26acfe00894da1b3\n $fTraversableBkBarbie ::\n forall k (b :: (k -> *) -> *).\n Barbies.Internal.TraversableB.TraversableB b =>\n Barbies.Internal.TraversableB.TraversableB (Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -573,26 +573,26 @@\n `cast`\n (forall (f :: *>_N) (g :: *>_N).\n g a>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n %<'GHC.Types.Many>_N ->_R Sym (N:Barbie[0] _N _R) _N\n ; Sym (Barbies.Internal.FunctorB.N:FunctorB[0] _N _N))\n ($fTraversableBkBarbie_$cbtraverse @k @b v)]\n-82108aa41bbdfc586f9cfb3d67854be0\n+deea81d66ad4de434250926965ec78d1\n $fTraversableBkBarbie1 ::\n forall {k} {g :: k -> *} {b :: (k -> *) -> *}. b g -> b g\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n @g :: k -> *\n @b :: (k -> *) -> *\n (ds['GHC.Types.Many] :: b g) ->\n ds]\n-0ce3fed585803405a93318f409e50c8b\n+ab3500dbaf3a00a267815a8e5b4be590\n $fTraversableBkBarbie_$cbtraverse ::\n forall k (b :: (k -> *) -> *) (e :: * -> *) (f :: k -> *)\n (g :: k -> *).\n (Barbies.Internal.TraversableB.TraversableB b,\n GHC.Base.Applicative e) =>\n (forall (a :: k). f a -> e (g a)) -> Barbie b f -> e (Barbie b g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n@@ -633,89 +633,89 @@\n } in\n \\ (x['GHC.Types.Many] :: Barbie b f) ->\n f1\n (f2\n ({__scc {Barbies.Internal.Wrappers.getBarbie} True False} x)\n `cast`\n (N:Barbie[0] _N _R _N))]\n-76525e76f13a161d68ca3fd2f348df33\n+ca8bb4b28b8a31e522ec2308d476b507\n $tc'Barbie :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 15615530109360289637#Word64\n- 15990056711384804469#Word64\n+ 13918703368884499321#Word64\n+ 8936931840849295103#Word64\n $trModule\n $tc'Barbie2\n 3#\n $tc'Barbie1]\n-40a7ada842c41ca6af65caa3f4f2b705\n+2f858be8e6da41cc4432b060dea106fe\n $tc'Barbie1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-40e551c5e0deb8418f20680a64b0877b\n+652ba274d0a16a89792543a9036ba401\n $tc'Barbie2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Barbie3]\n-0f94161774fd55d18630549bec85c297\n+171037b2c3ce7999c22eac8ad28f353a\n $tc'Barbie3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Barbie\"#]\n-fe446ca092fa482cc453eb015dfaa3ee\n+5b6e7f610e7cf5ef0a18138c0bc0b9eb\n $tcBarbie :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 12284314168126100922#Word64\n- 11257103210016545368#Word64\n+ 3192024412159074143#Word64\n+ 1664728315722168277#Word64\n $trModule\n $tcBarbie2\n 1#\n $tcBarbie1]\n-40acd3263912b8eeb3a4c719906ac4c4\n+bd52e9839a488bd3574db5c44ef7acce\n $tcBarbie1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8d148eef945ecf2b631bb0efdc2ff852\n+df2152e2c1ef0914198e9e4b1cda0b19\n $tcBarbie2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcBarbie3]\n-b552c8172474f0cc35eb4b7c025b45bc\n+88a8c74aa5e8aca8fb99b881c797601b\n $tcBarbie3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbie\"#]\n-167e06f36ec10fc1655a5b425b6bb193\n+d8dfcc456b14062acabb14720fae5deb\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-03e6abee023a50f09c5516ad05c83883\n+2850c919a9d24a35f022cf256e62812a\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-b41c24bf25211565bcb506c9d737073e\n+e7d45b3661c4d9a96db4044801c49d4b\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Wrappers\"#]\n-20d05693f624b96bbc9391ab9f941442\n+1bd9450106ebea90a9235433bbba71b1\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-f253185464294a90d185b954bf372084\n+6234285fb6be85a5fdc609a38328aba1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-7555267d2e0e674a9d496071c91087f9\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+ef59176258631107e7033010032c988c\n $w$cmempty ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Monoid f b) =>\n b f\n StrWork([!])\n@@ -783,15 +783,15 @@\n ({__scc {Barbies.Internal.Wrappers.getBarbie} True False} Barbies.Internal.ApplicativeB.bpure\n @k\n @b\n $dApplicativeB\n @Data.Proxy.Proxy\n (Data.Proxy.Proxy\n @k))))]\n-8e530783848d6c1c4ba44a2980d3241c\n+bc173b60abd8339948a8f740d43e1658\n $w$csconcat ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Barbies.Internal.ApplicativeB.ApplicativeB b,\n Barbies.Internal.ConstraintsB.AllBF GHC.Base.Semigroup f b) =>\n Barbie b f -> [Barbie b f] -> Barbie b f\n StrWork([~, ~, ~, ~, !])\n@@ -818,36 +818,36 @@\n go1 :: Barbie b f -> [Barbie b f] -> Barbie b f\n [Arity: 2, Strictness: <1L>]\n = \\ (b1['GHC.Types.Many] :: Barbie b f)\n (ds1['GHC.Types.Many] :: [Barbie b f]) ->\n case ds1 of wild1 { [] -> b1 : c cs -> lvl b1 (go1 c cs) }\n } in\n go1 ww ww1]\n-543cc7d88fba5fd7fa94489181729f3d\n+7d2a0f885d17d9961202bcfe87e12623\n type role Barbie representational nominal\n type Barbie :: forall k. ((k -> *) -> *) -> (k -> *) -> *\n newtype Barbie b f = Barbie {getBarbie :: b f}\n-79273ee21b9a01c973c919d09be543b0\n+63a3c946799fed4c47aac986daa688ab\n axiom D:R:AllBkcBarbie ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c (Barbie b)\n = Barbies.Internal.ConstraintsB.AllB c b\n-6d368f21fe7c0589f6250535ac3d10f7\n+77076a16715a82e7b992fa0a9eb6f20c\n getBarbie ::\n forall k (b :: (k -> *) -> *) (f :: k -> *). Barbie b f -> b f\n RecSel Left Barbie\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n getBarbie1\n `cast`\n (forall (k :: <*>_N) (b :: <(k -> *) -> *>_N) (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Barbie[0] _N _R _N)]\n-3e1299c86100b11d41a5687143c747ae\n+e9e1c7c0dcc95de5f5da37e16eca1000\n getBarbie1 ::\n forall {k} {b :: (k -> *) -> *} {f :: k -> *}.\n Barbie b f -> Barbie b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal/Writer.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal/Writer.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal.Writer 9066\n- interface hash: 8626b79b01e7d5dd2efcdfb4eb42185a\n- ABI hash: 78d58e8d27c1b5f724f59e41fe333ec9\n- export-list hash: 59ffb401d09093d618de38060033b75c\n+ interface hash: b5e1ef897fe72b7d62d1a5d8b7cf68fc\n+ ABI hash: efe86a57d978c86b92ee78dca96ae213\n+ export-list hash: ce690a8d0554a90ffe27eb89b53500c9\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 6f96bd3a8d68a76f1e5b1283015f6218\n sig of: Nothing\n@@ -30,15 +30,15 @@\n family instance modules: Control.Applicative Control.Arrow\n Data.Functor.Const Data.Functor.Identity Data.Monoid\n Data.Semigroup.Internal Data.Type.Ord GHC.Generics GHC.IO.Exception\n GHC.RTS.Flags\n import -/ Data.Tuple d9beb5d70c09aac855be2a098f256b86\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-bfc198c5b3351f241a79282502ecfe1e\n+96e27e80aaf6baa58bcbab94de43d4ca\n $fApplicativeSt :: GHC.Base.Applicative (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Applicative], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fFunctorSt @s)\n@@ -63,29 +63,29 @@\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))\n ($fApplicativeSt1 @s)\n `cast`\n (forall (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-43263678de430610e66ed3ccd7f2e471\n+9ee5e5ee71910b18877c39402c8059f8\n $fApplicativeSt1 :: St s a -> St s b -> s -> (a, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @s\n @a\n @b\n (eta1['GHC.Types.Many] :: St s a)\n (eta['GHC.Types.Many] :: St s b)\n (eta2['GHC.Types.Many] :: s) ->\n case $w$c<* @s @a @b eta1 eta eta2 of wild { (#,#) ww ww1 ->\n (ww, ww1) }]\n-94a21167fdbdd5d3ff3ceb224255ddf2\n+d719881837d6a61b410e8e233b57f9cf\n $fApplicativeSt2 :: St s a -> St s b -> s -> (b, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Inline: [2],\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @s\n @a\n@@ -102,15 +102,15 @@\n ds1 :: (b, s) []\n = eta1 `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' })]\n-cfd5b465e5c2f6cbf02705d486e468fd\n+ce4f5eba92af60c56cfd481e66494dbb\n $fApplicativeSt3 ::\n (a -> b -> c) -> St s a -> St s b -> s -> (c, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: ,\n CPR: 1, Inline: [2],\n Unfolding: Core: StableSystem <4,TrueFalse>\n@@ -128,15 +128,15 @@\n @b\n @c\n eta\n eta1\n eta2\n eta3 of wild { (#,#) ww ww1 ->\n (ww, ww1) }]\n-364010e0a3987dbfed7d8e9dc6f02fe1\n+68418144ef3f4076981f96d9c7bf046f\n $fApplicativeSt_$c<*> :: St s (a -> b) -> St s a -> St s b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -156,42 +156,42 @@\n f (case ds3 of wild1 { (,) x s'' -> x }) },\n case ds3 of wild { (,) x s'' -> s'' }))\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n b)>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-f865f441f5ee5f4ea5d5afb923a05306\n+bf3ebcd6e774da93bba501328dfbf836\n $fFunctorSt :: GHC.Base.Functor (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Functor], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fFunctorSt_$cfmap @s)\n ($fFunctorSt1 @s)\n `cast`\n (forall (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-a9d0645a17c3ea1db4c707cbd50dfdf8\n+957c090af0b458e36aa271f35bb88d63\n $fFunctorSt1 :: a -> St s b -> s -> (a, s)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1C(1,P(A,L))>, CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @s\n @a\n @b\n (eta['GHC.Types.Many] :: a)\n (eta1['GHC.Types.Many] :: St s b)\n (eta2['GHC.Types.Many] :: s) ->\n case eta1 `cast` (N:St[0] _R _R) eta2 of wild { (,) a1 s' ->\n (eta, s') }]\n-4e35ccb8d0ac90bcac8f8e2b12bff9ab\n+cf6f2fb69a064db263a5c79853dd9154\n $fFunctorSt_$cfmap :: (a -> b) -> St s a -> St s b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1C(1,L)>, CPR: 1,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -202,15 +202,15 @@\n case ds `cast` (N:St[0] _R _R) x of wild { (,) a1 s' ->\n (f a1, s') })\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n b>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-3fb3d6f56e0a8dc6ac56fb6ba34017b5\n+fffd591b31a760d65e852b82d79f1c29\n $fMonadSt :: GHC.Base.Monad (St s)\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Monad], Inline: CONLIKE,\n Unfolding: DFun: @s.\n @(St s)\n ($fApplicativeSt @s)\n@@ -222,29 +222,29 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))\n (\\ @a (x['GHC.Types.Many] :: a) (ds['GHC.Types.Many] :: s) ->\n (x, ds))\n `cast`\n (forall (a :: <*>_N).\n _R %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-295b8a7a75ac8cf6987bb83fc9207c0e\n+3fb18c521bb864e9aec645d2d996bf5c\n $fMonadSt1 :: St s a -> St s b -> s -> (b, s)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n \\ @s\n @a\n @b\n (m1['GHC.Types.Many] :: St s a)\n (k['GHC.Types.Many] :: St s b)\n (s1['GHC.Types.Many] :: s) ->\n k `cast` (N:St[0] _R _R)\n (case m1 `cast` (N:St[0] _R _R) s1 of wild { (,) a1 s' ->\n s' })]\n-0a02d2aa2f9436e33d665421fb42b7a9\n+d9f4200717edbb65ca2061fca6b1ed84\n $fMonadSt_$c>>= :: St s a -> (a -> St s b) -> St s b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,C(1,L))>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseFalse>\n (\\ @s\n @a\n@@ -260,85 +260,85 @@\n (N:St[0] _R _R)\n (case ds1 of wild { (,) a1 s' -> s' }))\n `cast`\n (forall (s :: <*>_N) (a :: <*>_N) (b :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R St s b>_R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R _R))]\n-7c9fadbdcbdfdce883da7941de0dd0f6\n+ece98797e6555a3d21951562f7536afd\n $tc'St :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 17137296724483593234#Word64\n- 15342594746634876286#Word64\n+ 14575921077927140588#Word64\n+ 17744582276066025322#Word64\n $trModule\n $tc'St2\n 2#\n $tc'St1]\n-e207f0ef5c97c21e5e4606f187334e61\n+047c4be4c28361b88550cfc79996ec6c\n $tc'St1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8fc97bf1148fb5c9039ce7f52743590b\n+35729dfd9f91fba46b1aeed047b8e188\n $tc'St2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'St3]\n-5ea88f191f90e222f4042b9317fff4d0\n+7ed9d3203af5c3c2b9fc67c9920d8b13\n $tc'St3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'St\"#]\n-3b50cba44370641f59ceb827d609c2e5\n+f0525f91074a0fe14cdba17cd16563a0\n $tcSt :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14342996833280856989#Word64\n- 6134876221187232#Word64\n+ 9351261565769487758#Word64\n+ 16041359534195592504#Word64\n $trModule\n $tcSt1\n 0#\n GHC.Types.krep$*->*->*]\n-f29d049536aae447075e4e194e62513e\n+638b12e6d7a0872f7821247499e91fa6\n $tcSt1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcSt2]\n-9dc4c0e1628bc5a6524e525c9cca0635\n+7cc60b56f12ddc00454a5ff2a4eaff2d\n $tcSt2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"St\"#]\n-364e12407a24cb3822d0365c5e66c561\n+4b78f74479c3070ba675e5b1c583b85d\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-16949b3683859db03612f07f0cd1064b\n+8e98aa8ef87ec6ddb2f7001dacbb6449\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-1fc69734d4a27743af6b920b1eb8aa43\n+6755958bcfa15994f265e26c4227279c\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal.Writer\"#]\n-282cca0f8160a283577521b316004afc\n+cacd33dd13865c32917c3c665a68002b\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-2257a0ee22e8f2855e1db854c20a2d78\n+e1d865b941eeefaba826eece520949f5\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e37b1fdaea29c5da9cf0aadde4b6e94e\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+c948ae21f12abe9e8451aacde7ed4582\n $w$c<* :: St s a -> St s b -> s -> (# a, s #)\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: , Inline: [2],\n Unfolding: Core: \n \\ @s\n @a\n@@ -356,15 +356,15 @@\n ds1 :: (b, s) []\n = eta `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (# case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' } #)]\n-794be2d89c233e9bdb149949477408ea\n+c75169780b583ab208b2333d97792e16\n $w$cliftA2 :: (a -> b -> c) -> St s a -> St s b -> s -> (# c, s #)\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Inline: [2],\n Unfolding: Core: \n \\ @s\n@@ -385,46 +385,46 @@\n ds1 :: (b, s) []\n = eta2 `cast` (N:St[0] _R _R)\n (case ds of wild { (,) f s' -> s' })\n } in\n (# case ds of wild { (,) f s' ->\n f (case ds1 of wild1 { (,) x s'' -> x }) },\n case ds1 of wild { (,) x s'' -> s'' } #)]\n-41d548db61998d7bb4ee6512e448f2a6\n+4ebc86834f72ff9851d68bf2c4e0c1f2\n type St :: * -> * -> *\n newtype St s a = St (s -> (a, s))\n-fd10f143ecbe29fac6799b659e0f09ed\n+65d6942013126dcf2189a9928657758a\n type Wr :: * -> * -> *\n type Wr = St :: * -> * -> *\n-921a5c36501ebb74282d24aea2b9b5ce\n+0ba0f5f1de1b3cb4ff96e635320656e1\n execWr :: GHC.Base.Monoid w => Wr w a -> w\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: ,\n Unfolding: Core: \n \\ @w @a ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid w) ->\n {__scc {Barbies.Internal.Writer.execWr} True True} let {\n s :: w []\n = GHC.Base.mempty @w $dMonoid\n } in\n \\ (x['GHC.Types.Many] :: Wr w a) ->\n case x `cast` (N:St[0] _R _R)\n s of wild { (,) ds1 y ->\n y }]\n-f41472543dcc450dda0d5b8970f323cd\n+e2ec237cb577cbd4bb2ed4024c55188f\n tell :: GHC.Base.Monoid w => w -> Wr w ()\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n tell1\n `cast`\n (forall (w :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:St[0] _R <()>_R))]\n-f8c7a7188dd1cd771a8a0d0e0c2d099e\n+36354272de65bd67a3bfe3abfd8a1782\n tell1 :: GHC.Base.Monoid w => w -> w -> ((), w)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n \\ @w\n ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid w)\n (w1['GHC.Types.Many] :: w)[OneShot] ->\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies/Internal.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies/Internal.p_hi", "comments": ["Files 90% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies.Internal 9066\n- interface hash: 861136e48a3da53077659ba7c9439468\n- ABI hash: eb1d471d85b961ab0f72ec53b0bd013d\n- export-list hash: e21d45eed1f7572d3abe8921c4fdafd0\n+ interface hash: f30d63f466cab51a8334cdfab69536ec\n+ ABI hash: 2695bfaeaa79c10eeba8c914496700f7\n+ export-list hash: 15fd64280f5731a22d1f0855242ccf58\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 36f2984720aa96d19b1a2558624fef80\n sig of: Nothing\n@@ -101,32 +101,32 @@\n GHC.Generics.UChar\n GHC.Generics.UDouble\n GHC.Generics.UFloat\n GHC.Generics.UInt\n GHC.Generics.URec{GHC.Generics.UAddr GHC.Generics.UChar GHC.Generics.UDouble GHC.Generics.UFloat GHC.Generics.UInt GHC.Generics.UWord uAddr# uChar# uDouble# uFloat# uInt# uWord#}\n GHC.Generics.UWord\n GHC.Generics.V1\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.BareB\n Barbies.Internal.ConstraintsB Barbies.Internal.ConstraintsT\n Barbies.Internal.DistributiveB Barbies.Internal.DistributiveT\n@@ -145,135 +145,135 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Applicative f7fe06bbc86fe9884b13a256898eadd7\n- exports: f40c4fca68d431a2e25a33b0ebf2670a\n- GApplicative 8265f05837c79915d0fdba71843c3b9a\n- gprod 7cf879a44333e2fb97407129639e2918\n- gpure b37eba7ec6f871e9461567cf3e8aa090\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Bare 09933975369d3f88a687502395401290\n- exports: 5efe914a4cb0ec7fc6958e082b874fad\n- GBare 945b4ea07a87e7d0224aa958b95612ad\n- gcover 3073112efbf8ff7c6c912014adcb5096\n- gstrip e04ebf4c99787b2d169affe5b0575068\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints d745d9d282b4b8b1e7a00feaec72f736\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll a97385b661b56e3be3899c1ab3c9b2ee\n- GConstraints 18ae239fe2e28b351bd84011ef359ae0\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- SelfOrOther e8303c93bae99168155f7ca174ff8b67\n- X 171ce71086eece1d472adc01f3a98af1\n- Y ba6a1ba68e95cb981888219d3edc670b\n- gaddDicts 0fd53bed8de376636929f15bc941e39d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Distributive 182d125d0a54c88bdc9bb4ac5562d23f\n- exports: 01bd0bf3c69d9ed41b89304dabe8f1bc\n- GDistributive 3159f20af5067fbbf12f2d1e0a767bd5\n- gdistribute e171f037c4637cf535aaf1fe433ebefc\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Functor bfe9ee105ade1417e5f83268a25c6c68\n- exports: 5181bc237f1b5142ba8064be4536aca8\n- GFunctor c55eefcbafb68adae4442799562f802f\n- gmap 265f473a7200ebd296da064e8ee59d66\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Traversable 78ba5b8127485172bcdfb5f1a7a2be9f\n- exports: e191cdaf49853917f8b7debdfa6d86ad\n- GTraversable 07978d60099125b7617e0fdd0bfa9d0e\n- gtraverse 479847134d0fca5201cb163e7c365d6d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- exports: 97f76e0a31067bdc9623d74dfb179978\n- CanDeriveApplicativeB 00ca77d067532d0e89a62e371fe84810\n- gbprodDefault 03c2fc30b415a7ef7b04e0bd51a5c5a8\n- gbpureDefault 17a8dea292c06b6cc0ccb9532409fc6c\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT 37b9828a73911edc65682677beef0b01\n- exports: 326dd8ed771f20a8bb5ea77e676eb73c\n- CanDeriveApplicativeT 00ecaa286a305ab235b84972179aee06\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 7033f6c2e9cc418f2345679854cf259e\n- exports: 057ad1cac855b28dfd0964ea6392b49c\n- CanDeriveBareB b8a5ffbae33709a543685f4c2d3aeb53\n- gbcoverDefault 25585011fddb8745f4b609947dfa020c\n- gbstripDefault 95ee297556e8e0bf8eb4c463546cfb62\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB c915225ce12dec07b484cb0e6c8bc95f\n- exports: 62d29be84a756dd8aa3183dad2a1d146\n- CanDeriveConstraintsB f931576f2ea4246945237e059a0faf6b\n- GAllRepB 277cdc2c0f11943cec79057ddef744d4\n- TagSelf0 4285e3ff55e5e10fe45a26bd4fcfaca7\n- TagSelf0' bcb76155453544693ac844834859f364\n- gbaddDictsDefault 64e262a5347fef431698cc01cca73377\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b740860c90bc5069368a1402d8ba35ea\n- exports: ff64c12f85a58ce210c289bc5f38b4b0\n- CanDeriveConstraintsT bea6cbec129f88280a48b822c3dd34b3\n- GAllRepT 37486621ffdc8a5e5fddae6bb1235fca\n- TagSelf1 22ba16a9ac95b3720fe3805cbd2dedef\n- TagSelf1' 762c8c64fd4d6e5552beb8cbb5b63857\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 80d56ad2686884e1a31fedb7de368c13\n- exports: 67f047624c17612bc49b9fde883b9428\n- CanDeriveDistributiveB 6d411704fae64df03f8cddbc8aee46df\n- gbdistributeDefault 262beff7b1bd67aab0cb6c6becf6789e\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT ec0109aac7f95a0f49e357c4692172b6\n- exports: e4bb445090ae9da31a739b0e3da69c11\n- CanDeriveDistributiveT 481119e21d542aabf6a6b847a4c11114\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- CanDeriveFunctorB a33c546469572fd3f95a04ba9b747b5a\n- gbmapDefault e71f2f31d9bcf3e7045639bfbdb6d365\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- exports: f80df9d1a671828401e57ca77039e65f\n- CanDeriveFunctorT 24f80aeaed8a04f8758f9910125fd871\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- exports: a8196cc20ebeb66df453e15c78d677c9\n- CanDeriveTraversableB c0fcb3f91d286c4e24aa9ba938f58a0b\n- gbtraverseDefault 10c8101760dc1adeb285607f85e35b38\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 6d9f71dcdc22d5d3261927c7c3f0afd5\n- exports: 24f5ff092cfd60d1c33d22f7bfc60097\n- CanDeriveTraversableT 873ed5c7b58f38175ac5870e02a86816\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- FilterIndex 28629d2d100254e316c2e2006644bb35\n- GenericN 1b4266d07741206f7b8cba4fa8905e56\n- GenericP a69a411bf0015ec405253821470b1398\n- Indexed 6d9d16f1708cc593b81a9519125d5cd4\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepN ecc6da1ae57d58d707db7b6fe2471abc\n- RepP 10d40de9142ff659e16b9d3d6d0e80b0\n- Zip 78f93d71df1aa24b758da222fa746749\n- fromN b5acbe8e27cbdbce5393ad91401fd07d\n- fromP 0aa65fcab0bb146e47bf2d447cf7b472\n- toN c48b8696dd67a7208550e7d178002838\n- toP 1c04f23335bb942f8b39a9f75761181c\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Applicative e6ea3755d60aca77b8b3debd1a2e908f\n+ exports: 8877b8886ac9c53ac49919a9e0e9312a\n+ GApplicative a3ad5abf6940b654f465b24e4d5dfd50\n+ gprod 7e94421018041d5aa4b77514edf80363\n+ gpure ed4392f5b804dde97786aaf051945c4c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Bare 9eaf074fbaf6c299ad8370fdfcb75057\n+ exports: f2d1301649e8e0815e7e8a010693dc83\n+ GBare e05c32af4d05b0e8d79b7a6ffd5a83ea\n+ gcover eeb348f6365a0ac17a9cc2dca443d45c\n+ gstrip 549b7484240c3ce77d2612090c77d27c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 39afe276e15aa255e48d08c5ba712f59\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll a7ee244c89fc411256c161efeeeaa7f7\n+ GConstraints 6ccfe857f29008381ec19da46c2e9db1\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ SelfOrOther 34dc852d178b4c8bad9ddef602d60e81\n+ X ef8817b68c20d7aa4653a1809b97c873\n+ Y d1ab14839ebc0a3f1df64062aa572cc4\n+ gaddDicts 0b704e4ee989184ba8fe720d1fd6be92\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Distributive b3b3f8e5e21335496ae8f387d71e93b4\n+ exports: 041ee6c38192ef6dc7d80eda56c4e985\n+ GDistributive b2b99c933ab6f3406ac9b5e18cde4454\n+ gdistribute cf13d51cf58359bcfc62724d72240f25\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Functor bfd180435702e8aa8caeea441416de49\n+ exports: eb91949418fe63f3a6a9b6b4db686fbf\n+ GFunctor c171ebf8be4099e43d49f60c5018274b\n+ gmap ffd843e5ac4282689a6c4f73a7e4657c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Traversable 24c2969b48d69b5d87bd0015edc00ed7\n+ exports: 689c061279ca4cd1721cb64d922cf03b\n+ GTraversable 6bc69f1d03cbd1e58f9a67d23d07f501\n+ gtraverse 70ec7cdfe89035cca9af3957b43ff6c2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ exports: 5b192dab08a0491faf09373600f4b2cd\n+ CanDeriveApplicativeB a3c09ed643d9e6b0b5f7775f164531c4\n+ gbprodDefault f34d0098388fb323b1de6440ab9f2f36\n+ gbpureDefault 43d7b125fc47cf609fb07348b0b3434f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT a4b6dde0959b1b6fc0980131174b93d9\n+ exports: fb4057e5f657bcf51e84559f4e82a422\n+ CanDeriveApplicativeT 862bd5012a274f82194439bb3bb2412c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB c3913e480fb368dab5a321a730bc1175\n+ exports: 1dfc9c56dc6f274967e32628736d7d2f\n+ CanDeriveBareB 6dbb7b64c5ac0fc4b933b1ddc3b02238\n+ gbcoverDefault 3fc83f42bfec4e5f9e249d1b666043ea\n+ gbstripDefault 21a538133dc5a786cc3243a78b9ec772\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB cb077425686d4bb620c4f51549182b9f\n+ exports: 805180e0c2ac5e4eb5bae7572cee9a36\n+ CanDeriveConstraintsB 5011a4fbb768bb0b28841f32170e943a\n+ GAllRepB 4b3474a88e083762e3a70813269e0f11\n+ TagSelf0 34e42843412c077b2903b8c02bf24b3a\n+ TagSelf0' d94c1a5683b7a21f1a8f39c49da78cb7\n+ gbaddDictsDefault 836cf3c4d2a75f54b7f52bc803358105\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT d1df5ef962f0b55196afb59b42e0f1da\n+ exports: ed62ac4a4eb5e94b8facce81e2b4a838\n+ CanDeriveConstraintsT 7b853f64819e42fcab37285301c567ff\n+ GAllRepT 159ad2e3d46e2baa3e58574dc39c6d5c\n+ TagSelf1 737bcec52eaf6196ebcabcbbf27ee685\n+ TagSelf1' d2b6192f520cecb36027297c416ea5b2\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 86907d3a2f9542c8a7e9eb0c9e39c2e1\n+ exports: 35baad0665225d23105900c3f9071c68\n+ CanDeriveDistributiveB c0dff2dd84d30d6064e5715809259ca8\n+ gbdistributeDefault a977933744a01884d0f598c3de1b859f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT e2516ba32392922786c305c30d832725\n+ exports: ed1c5309290b8a2cf9319bed55a63450\n+ CanDeriveDistributiveT d67949891645cd06851c82920fbec931\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ CanDeriveFunctorB 9a1d36244895d161a160d150ec7d8d6f\n+ gbmapDefault eaf162e2a00e1e55e8e68c63a115552f\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ exports: e02f5d493ca75ffd2f01042546f54905\n+ CanDeriveFunctorT b1bd7a710ee8f1124c448f9c98f78a7e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ exports: 6564e0103587f68d905c5ccbec42ca55\n+ CanDeriveTraversableB d7d392b1c7fc8b91ce9dfad4efc2b6d3\n+ gbtraverseDefault dae0a772e88ff6f604743bb5d4a0e092\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 70a0f6bb8ee700f78b9077b3af018bc8\n+ exports: e6c541e77f859c5116aa0273fe952d3a\n+ CanDeriveTraversableT aeee038023f8749871204a191e3682cf\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ FilterIndex d25400e43e9b658f703ceff2ac3de284\n+ GenericN 3d9f2f2677a23aa95c2fa5da9877e31f\n+ GenericP e8f0d81c6baece2774d787f7a39d65a5\n+ Indexed a088e1d15833f960906b057a9fbfae7d\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepN e96c33128fc679fb69061e7d0ebf0dc0\n+ RepP f08ff5a57833ea265cbda5ae27d540dc\n+ Zip d86c23e87aa7cf6ff0da40771f7e9b4d\n+ fromN a5637766ae3ff5f72edb992d534ba56a\n+ fromP 72ffc94674b3e476d13de9c16ec8dda6\n+ toN 78f9321b8015bdafeadc556b0d4f5810\n+ toP 149f1948c4edb2cb60e7f2920a198c95\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-5ae6f8a567c62cbb0d22bf30c09f9e0e\n+162d076582e0af914e4898e12f44ce4f\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-c51048a59c72a955707293f7a6e779d9\n+328fb7d799a45f4fba6e37a0d7cba862\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-1ab51a97421b3ac646295f28364ab5d7\n+9f283c64f5170967c774a0a8a688aab8\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies.Internal\"#]\n-8e2bf4842895f315d89fe663ddc39d95\n+994e8ea07633d81e5b6a29cef4484047\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-a0a1ec936ae66f2ab7c65bd5f3ce7bb1\n+f4d2e70321a756617e576e2981c542d1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Barbies.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Barbies.p_hi", "comments": ["Files 81% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Barbies 9066\n- interface hash: 2624d1f6916b314b5f09a65a37363352\n- ABI hash: 764603965b2062a68af77509e722815d\n- export-list hash: c191f8f5e7f02f01e81d46a1f9edf489\n+ interface hash: a11bd2f4bb9425328b6acb6f60a98df1\n+ ABI hash: 0e0d145bb0f276ce05fa6163877e382c\n+ export-list hash: bc518f4336f22e0dcaa74f6d4ef39a4f\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: b7958cd53bafcaeea8a242dfdd7454f1\n sig of: Nothing\n@@ -82,20 +82,20 @@\n Barbies.Internal.MonadT.MonadT{Barbies.Internal.MonadT.tembed Barbies.Internal.MonadT.tjoin Barbies.Internal.MonadT.tlift}\n Barbies.Internal.TraversableB.TraversableB{Barbies.Internal.TraversableB.btraverse}\n Barbies.Internal.TraversableT.TraversableT{Barbies.Internal.TraversableT.ttraverse}\n Barbies.Internal.Trivial.Unit{Barbies.Internal.Trivial.Unit}\n Barbies.Internal.Trivial.Void\n Barbies.Internal.Wrappers.Barbie{Barbies.Internal.Wrappers.Barbie getBarbie}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bi\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Containers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bi\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Containers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ApplicativeT Barbies.Internal.ConstraintsB\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveB\n Barbies.Internal.DistributiveT Barbies.Internal.FunctorB\n@@ -115,156 +115,156 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bi 339af8ed4a38d13013d3d70b478e9974\n- exports: bb915f9caec98f0ae0a35fe20ca8d48b\n- Flip 68d53f9b0f2e10923a5eeab15c0ca5be\n- Flip 976acd20df94e35ea6836655dc0e8462\n- btfoldMap 4d89d78a3af0dffd5ff98fc3cbda3e09\n- btmap 4b407b996daeaf30d0dd64f73e61d320\n- btmap1 76fead2fae4f7b11dc3883aa7479424f\n- btprod 8e151b209f8c4d24693fa67c7756fc1a\n- btpure c78cfd201a544dee1fe9b66d7bece086\n- btpure1 b63a6b318e71e55473d656694724442f\n- bttraverse 4b273fe86019dc2f8d567eb5d4f326ca\n- bttraverse1 0358e15971363044a2e776950b7c4dc4\n- bttraverse_ 474418008c9e13b61045d1451faaa8ab\n- runFlip aa6ea7ed8240516e12411c849c1f3dcd\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- ApplicativeB e831de0bd01221227318ff01f360d4cb\n- bprod faa80cda7d5ebacb4d59ff2581e950e5\n- bpure 8f62c3bd94a72cb3e7cb88067b7fc1f0\n- bunzip 34622e94b56e176a2b34b8a67a6855a4\n- bzip 8ed828546c59d721d6faa4464ad47750\n- bzipWith 4533dac19f2e4b44be72c581c4090d1e\n- bzipWith3 b2544b9a4f69672e9990c4248d54ad9c\n- bzipWith4 63a87badbbf671305bc877f7886035a2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT 37b9828a73911edc65682677beef0b01\n- ApplicativeT ac75f9c1033a1a0fa3ed421b0aa1a6ff\n- tprod 836c430f592da5bade76b63a1cf2dc58\n- tpure d70eae245e3327d8eee46b48631b6e4c\n- tunzip d7f86ef8dc97dee17e1bd03b659eecdc\n- tzip 86a7545983d440ce260903a9a0e1494e\n- tzipWith f350595e933c3e2883cd0c875f9ac195\n- tzipWith3 feb1601bb3b05f01c12569756a080f90\n- tzipWith4 9bc7aa1049fe89605e44d126cdee52a8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB c915225ce12dec07b484cb0e6c8bc95f\n- AllB 742934a1aef6759c559e39d90cf8ee7d\n- AllBF 2852bbf285ab6932b0e4764b71b81856\n- ConstraintsB dc18dd2fb15b81c31fdce03ebb848f0f\n- baddDicts 9e213c6aa1b780911ccc0eff66d247dd\n- bdicts eb562e059c0b85eb1b87b13a0dd3252a\n- bfoldMapC 8fdb140fabce3bf6ad1f2739646317d8\n- bmapC bdd35a7e14d54b9b1575987d0382e090\n- bmempty 463212406bd01ecda8db986af75227fd\n- bpureC d87a8a078ca1bb1cba753e8896b062dc\n- btraverseC 0c7fa01290302656c2c2336197cde099\n- bzipWith3C 4bbaa65bed1c3a8013ead5fd1cfae5a8\n- bzipWith4C 74930d6ff6579d7f049bebed51131c30\n- bzipWithC c8bd0d3ffccf02d14b0e98a2ac4957c1\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b740860c90bc5069368a1402d8ba35ea\n- AllT 051a1647fb7cdb81b6c12726eebecf9e\n- AllTF dff074ee18166a22f4f8f47ecb3e6f9e\n- ConstraintsT 63bcc668eaa4de0e771fce96e43c496c\n- taddDicts 5152b4bb5c5fe309890636bc41f05b3b\n- tmapC c7ff11490dec8c0395bb3c7f9f149f34\n- ttraverseC 10f64217cafad49e723398b33079651f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Containers c5fab473bbad9979597074043620626d\n- exports: 4fa8423d55bf9a8386196177440beaeb\n- Container 1c7330649765f5706b55296698a63339\n- Container 699f6cf3964a151e54d2903fd8c234e3\n- ErrorContainer 438ed536c5a5a29d675f2417b404d783\n- ErrorContainer 8cb182814fc009809a5b496c9366bbfc\n- getContainer a8f965de8a77585eb604c7f0d477e492\n- getErrorContainer fa34dbd2e0df8819f2b92894f076b637\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 80d56ad2686884e1a31fedb7de368c13\n- DistributiveB abc18a05f635f61b778ca554da2cea91\n- bcotraverse 5b137986834428d60f93c388b01f2dfd\n- bdecompose 09b00b94e8b880130b026e824bcbf703\n- bdistribute 929c6e7742bbab510e6a6048e74a3699\n- bdistribute' 896f1efd92130f4e15b5ad9acc0dae93\n- brecompose 62de9518f265581b2d8bc112fc936ade\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT ec0109aac7f95a0f49e357c4692172b6\n- DistributiveT bf60a4b70526597f9806abfbda792bc4\n- tcotraverse 2dc7e6fe6bf1f4e02803c5fcccf833b7\n- tdecompose 5bcdca0f2e664d1fc81634f7cd2be293\n- tdistribute e3628f1c954601a3a1e88b8b2e9621cf\n- tdistribute' b01def03abeebe4cc399564d96dac8a8\n- trecompose f413036664271a59346594cae1034ca2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- FunctorT 8eecefeea9b4af10c28c6418beb8e35f\n- tmap 7daf6eec37127197117907af82691fc2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT 2e45532830ced35fcf64ea307ca3f5c2\n- MonadT 97dbe0e46fe68cde416cece814284e6f\n- tembed 7ae9c4aceb95e9425a19532a1a5cf606\n- tjoin f2e80dfc8accb232f79dc76260b35361\n- tlift bcd9b7abc90632e71082fc74bfa6d889\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- TraversableB 276504176defd37fdae4e05d479e9cc6\n- bfoldMap 14d33185bc8e0b9d6617de4794d0b153\n- bsequence c342788bd922f3596acc43592b92d6ee\n- bsequence' ddba99e0a036e38514b81b4420ddd569\n- btraverse 44638623568081a176cfc6fcc0804dca\n- btraverse_ db6a81411d9b3d9f573baa0f326e7828\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 6d9f71dcdc22d5d3261927c7c3f0afd5\n- TraversableT e7c67190d7e0b7e757119c341317ca7c\n- tfoldMap 89aba6788a37742a350980fb20f7fd7d\n- tsequence f3a225e91845d5e7470e50de6f7eea6f\n- tsequence' 32ebe38fec21ca397a0ee3ba29d55bec\n- ttraverse 52a07542ffc301896e358aebbb2830d3\n- ttraverse_ d0d74b1d03ca0a1d47af8dee84b6ed90\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial e8e840d58a71f36f08cf907351677909\n- exports: f2b3ffa6928a822bd57073425bf0c21d\n- Unit 7dad192333f9ffba2f7db338141645a6\n- Unit c1936e142e7230f25a3d66e4ed000254\n- Void 5d92e28d57b6d96e3f5a3ac3e40a4208\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 7958e4aadfb4871559a27df0095b994b\n- exports: 9f5517e3ff8f369efce374339dce99ad\n- Barbie 5b007c31a64e58d86f5c6e69c899c0fd\n- Barbie 543cc7d88fba5fd7fa94489181729f3d\n- getBarbie 6d368f21fe7c0589f6250535ac3d10f7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Barbie 9dafd74b326111f9ee0b678e4b56d097\n- exports: 776dd022e7184a3e3960ac8208304d11\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Transformer b6c50927a72e994c449237c5015937c7\n- exports: 856a31e58112ee4a1740bc4f8a0a5850\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bi 3f8d2466e4841ed8aebbd9a394ea662a\n+ exports: 00ad898e1dde8bc31b80c34429001348\n+ Flip 36e538699a9f3268ac097d74bb69b40c\n+ Flip aaa59f3f08d6ea3be0b48aea1d9fc908\n+ btfoldMap 8eb3f32fd82e61ce0d68546934004233\n+ btmap 9a06e04464318737a9bf04e355e4db65\n+ btmap1 69eb59328bfa28ca40f9caa5ec6a534c\n+ btprod d54e4157a573f40b1016582a6db04b44\n+ btpure 2e7358a7b3ffb03be6e4e5f7cc6f9abb\n+ btpure1 2cb37e36541b8efea4dc699a5589f6a3\n+ bttraverse 3f80e4ba552e8d95c47b112e9e3d8ac1\n+ bttraverse1 de3258355b4c538abee1273a87c48252\n+ bttraverse_ 03a03ccc120fd2d084a40eb4e911c89e\n+ runFlip f2a9e90f3dda500a33431479b301171a\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ ApplicativeB 16deedde4d173b65d0723755e5a93713\n+ bprod 8e131e15a5f98601851c0b27ac4241c0\n+ bpure e8e39b317ff94f27399a39d7e16b86a9\n+ bunzip 11c04082ef1f526743411828ff5e3b0b\n+ bzip 38f3994007ee30a57645303749d60354\n+ bzipWith bca3958211a37a502853b653649238a6\n+ bzipWith3 0af74d4e86fd92f65a95f59ae545d30a\n+ bzipWith4 6fbf99b5bb16c09aedd72b44a835d3de\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT a4b6dde0959b1b6fc0980131174b93d9\n+ ApplicativeT 8c4c465730cad783db66cced9f6ad1cd\n+ tprod f7a3c13f2f2048c22a31a51a529488c9\n+ tpure 18e1079f018128459a0a8b55ce7b774e\n+ tunzip 19c9841b082e8c9d41dd4d6ca7eb20eb\n+ tzip 243b199bba526517ade86985eff9e9ab\n+ tzipWith 654badf19e125b627d365af82896f5ce\n+ tzipWith3 c787f5f67a26ab8a5b01d080e8d50a1c\n+ tzipWith4 14a75411752014d3e5c59acd446735af\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB cb077425686d4bb620c4f51549182b9f\n+ AllB 1b4f9a291ec9d45a18d31df601e0aeeb\n+ AllBF 63bb86e4a6c471b3a0fb28f25103dd36\n+ ConstraintsB 0e5c16bae977600323d72f12d780df0a\n+ baddDicts 45de3f1644ad793bfa156162f97dcda3\n+ bdicts e07f5a7ebb838629173d9923292efbda\n+ bfoldMapC 10664cc3bb59672088e1f9e7b5901501\n+ bmapC e9b37dcfce08040e31146f6b7b8674d2\n+ bmempty 67368e786413af9677c05a4fe1067921\n+ bpureC a370fb71249c97e99513b1f6d3e55713\n+ btraverseC ed469f93d8768c1e1efcc0e74f86d74e\n+ bzipWith3C fb97dfb54d0e016efc07adbe405ebdc6\n+ bzipWith4C 93646da27a6ecb575b9979eba8a98445\n+ bzipWithC 882709786427a2557e9b9ec6b5f9f691\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT d1df5ef962f0b55196afb59b42e0f1da\n+ AllT c4a1138038b732a439b85a866b14c054\n+ AllTF c91b40bc5df4557bc150947824e6d65b\n+ ConstraintsT d50d1d4be2b903724d6bf2baa5481d3f\n+ taddDicts 8cc5a26652c1789f051ee21b00594b19\n+ tmapC 1bf040f27f0c14d38d137b7a60d57d93\n+ ttraverseC 5f64d3e2e8c919dd82131024647bdfb8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Containers 1802c15850fcd61796b047337556cfe7\n+ exports: 44d9d9e490c993955cc49d53d406e44b\n+ Container 418f08e36355119df0e71d040c4bb53a\n+ Container 4cd9cdbdd275a14dd33079c199d840a5\n+ ErrorContainer 4b0ac7454aef3bc9f421e01e8da88940\n+ ErrorContainer 318f6a4f8293b61fe472ac68cd957013\n+ getContainer 5d6c7cdb9410697c1699d3288d4ba3d6\n+ getErrorContainer ad439623074019e6bb1562905220f407\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 86907d3a2f9542c8a7e9eb0c9e39c2e1\n+ DistributiveB e760f6db15922c1a6bf57e10ddec6cce\n+ bcotraverse a8a061943b1c3b24388fd821cae4be7b\n+ bdecompose 0142f5300f444349da9d515d163638ab\n+ bdistribute f52af13b3c0cdea06e2fe6da23fac44c\n+ bdistribute' 63900afaf615a8e78a6f402034631215\n+ brecompose 110986f7d420332c06f6d3ded0bdc876\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT e2516ba32392922786c305c30d832725\n+ DistributiveT 3287b4f0ba90375696b0ae382def28bc\n+ tcotraverse 016be32a0da9662c14df822159e8726b\n+ tdecompose 4f5723c8ae8da00ff81fa74a410ea794\n+ tdistribute 50e04509af645581a3b094a3f3168944\n+ tdistribute' 28eae7229d2fc317892c749d705ea543\n+ trecompose 722eedbd64f0646c25e42b9733b9f082\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ FunctorT ae5ec0f7570f82aca6f5f14b2f49b24c\n+ tmap d0b4955d5dbd43342b986bfbb6d3da5d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT a5e6475ab282416ed2d4778ea69017b2\n+ MonadT 901f738abac3be5c36af79b68794e7ff\n+ tembed eb8a2a11f55d29837f11cc6f18f79ff2\n+ tjoin 0980482f7cbb9f3136a3337d0a9fe837\n+ tlift ac7a8e24b8f93dcdff0a91a51878c639\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ TraversableB b16eda90a135f995e76c64fdf076422a\n+ bfoldMap 0c258f5bfc94ec71636a457f0c538881\n+ bsequence 0ae024feb9303d386ddf012477d382bb\n+ bsequence' 76f2a385900fef20091423a0bc93fc51\n+ btraverse 2d1803bee429e065a9d4f13a0e12ab46\n+ btraverse_ 60242f95eece2e38ab3dfa24ebca6d72\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 70a0f6bb8ee700f78b9077b3af018bc8\n+ TraversableT 0d4893fb3ceb3c7a5413bd1c7de7657c\n+ tfoldMap 1f6b797c47fe546509e6e115aa72cc9a\n+ tsequence 9248ca66fed49993685fa174b2adebf3\n+ tsequence' b909f470cf0600c6d7e5c98ae4f39532\n+ ttraverse 0b7ab5f0b9eafcdfa92c0611d78a7459\n+ ttraverse_ 78999db991d8975be40c74b1d6d967dc\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial dc4e1c7b489ece1d00e77086237aaa82\n+ exports: d538e05bfbbc0ea212ae5ceedcab88a8\n+ Unit a88e573f0bca8af4d81862878a7ee1dc\n+ Unit a654d0e651ca97ead2ab39e18faca7f6\n+ Void 72c7639709c23990593c7129be2962f0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 43d6d92d6f288625dea9f42a20c3850f\n+ exports: def7f398dd21c52b4a641939c81ad0d7\n+ Barbie b9a68eb4646738b9f4518cc946e66ed9\n+ Barbie 7d2a0f885d17d9961202bcfe87e12623\n+ getBarbie 77076a16715a82e7b992fa0a9eb6f20c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Barbie cb89b258eede167b2d361dbcd693e5c2\n+ exports: 2d9e067c321d67b0eec7598e2173b9ef\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Transformer eda82e6579172c14a44bb087490ee99a\n+ exports: 385f1ce47f803f58a1667bba336930e6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-9ad0107e1b398d2784f83bac29f7a05f\n+e88d4e39ad3cf74b6f3bb7af38d0499b\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-87a037a3e7924b83b358b5ee3789d134\n+54f0550ff7308a6f93b18155b7e6b828\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-e9a160ac159d00902bf3e13801a95d17\n+322af340a03fcca97265743d23ab8ac8\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Barbies\"#]\n-889ea1e017fbe8bbcbf63c60c7b912f3\n+6c1da2fb9e21587294d213a64d2a5940\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-9bcf48fc436bd76af855a7e690836a40\n+2dfe7f8ea716d1c1cea912322cd688a1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Bare.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Bare.p_hi", "comments": ["Files 77% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Data.Barbie.Bare 9066\n- interface hash: b5222004376c33149f03fc41405a84e9\n- ABI hash: f2f23d7da16f84622a6172d6d01912d6\n- export-list hash: b70a8e2b3e1738caa9c5701422ac8da6\n+ interface hash: dfb46e600ecffdcdf5debba96ebd2ee0\n+ ABI hash: 30fca0564cddd5035234712c4a3351d1\n+ export-list hash: 76ec208bf8f2e5392703b10d7ee27ecb\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: c19c41c22601f1058e68a60efe5ae63d\n sig of: Nothing\n@@ -20,62 +20,62 @@\n exports:\n Barbies.Internal.BareB.bcoverWith\n Barbies.Internal.BareB.bstripFrom\n Barbies.Internal.BareB.BareB{Barbies.Internal.BareB.bcover Barbies.Internal.BareB.bstrip}\n Barbies.Internal.Wear.Bare\n Barbies.Internal.Wear.Covered\n Barbies.Internal.Wear.Wear\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bare\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bare\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.BareB Barbies.Internal.FunctorB GHC.Base\n GHC.Float GHC.Prim.Ext\n family instance modules: Data.Generics.GenericN Control.Applicative\n Control.Arrow Data.Complex Data.Functor.Compose Data.Functor.Const\n Data.Functor.Identity Data.Functor.Product Data.Functor.Sum\n Data.Monoid Data.Semigroup.Internal Data.Type.Ord Data.Version\n GHC.Generics GHC.IO.Exception GHC.RTS.Flags Data.Functor.Constant\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Bare 3092576b5610ad7f7c79df37331fc9da\n- exports: 721cfc3fe3da0e009b49303645fe431b\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.BareB 7033f6c2e9cc418f2345679854cf259e\n- BareB e892f1bf62bb0f1de4c6900a9e397063\n- bcover ee3e8172705eeb19cb26b0a386210685\n- bcoverWith 457d04fa95b40feadc0d03c1a6be16bc\n- bstrip 4abad9192e0bad22fcce259ce56985ff\n- bstripFrom e4a248fbf92dcb57cc8e7de7b59fafbe\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wear e7f22eb15cb784a998456b5140cf200d\n- Bare 2c0b113e3f5ede6fc221c55203ab8fd8\n- Covered 80eea34d14e8600810c9ab377badacc1\n- Wear bc12aa8c9f74907821f2b32c6dbbc3ed\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Bare d308329d336770b68c7a204def4f52ba\n+ exports: 3e0e03a30fb89f6dafec8315b72e72e0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.BareB c3913e480fb368dab5a321a730bc1175\n+ BareB f15e63f5136f8d2c169b41a4366e7229\n+ bcover 3c05da0a69ac4c253e8361c5f1bbb4eb\n+ bcoverWith 82d8091afcde3f046554d1a3aa013ac7\n+ bstrip d878bc27230338f5bfca2b82fdefc2cc\n+ bstripFrom 834713909fe7cf3a343b98d754fc398d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wear 14f242eb3d2574da8af91a6231554daf\n+ Bare fa36594200f27a69b52f2f7a64b80fab\n+ Covered eeaf328cbe4a57c6e3233af96bb554e7\n+ Wear 1612dc273c345679bd612935358ae645\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-c29af2e32593c60dcc85664c79cbd97c\n+4b75ec5d1322d0fa68009e1dda5411cc\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-fcc64bfbe03c64ebc1db89ac1b56982f\n+c04b07156a2f4fbc8c4ed26ac09ab7e7\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-5db6c92df0449d4ace59c0b4eb407c2e\n+f8af26d0a33467998da2e63afd7f3015\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Bare\"#]\n-1fca237f2e1901c5368dacd35972a6f7\n+ffb9eb81bbfda329e8d65ed140f893b0\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-fccc36d8797d831941dd8b85108e7058\n+7b9584cb5099f0f9f3607d2e761a16ad\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n Warn all {-# DEPRECATED \"Use Barbies.Bare\" #-}\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/Product.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/Product.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,37 +1,37 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Data.Barbie.Internal.Product [orphan module] 9066\n- interface hash: 30e284647bc2206132bd40a19565bcf5\n- ABI hash: 5e5dbf1be237d0122682147891fd427a\n- export-list hash: b3bfa95a17c0f8b277ed3b23015a2153\n- orphan hash: d5748e335098383324f459659ea68d75\n+ interface hash: 7eb27d0b9ba477004658663af3922f95\n+ ABI hash: bc6e15bf1ecbbc6595bdaffefaf80615\n+ export-list hash: f0b0ed3fda32adae110638adb35a2d40\n+ orphan hash: bd066df895a8364190399d9a0615264b\n flag hash: 47902a655b5a8eeeeb64c2b66e53464a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 25d3c0149114a684ec83fbdc768fa22c\n sig of: Nothing\n used TH splices: False\n where\n exports:\n gbprodDefault\n gbuniqDefault\n CanDeriveProductB\n GProductB{gbprod gbuniq}\n ProductB{bprod buniq}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -42,58 +42,58 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- exports: 97f76e0a31067bdc9623d74dfb179978\n- ApplicativeB e831de0bd01221227318ff01f360d4cb\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial e8e840d58a71f36f08cf907351677909\n- exports: f2b3ffa6928a822bd57073425bf0c21d\n- Unit c1936e142e7230f25a3d66e4ed000254\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 7958e4aadfb4871559a27df0095b994b\n- exports: 9f5517e3ff8f369efce374339dce99ad\n- Barbie 5b007c31a64e58d86f5c6e69c899c0fd\n- Barbie 543cc7d88fba5fd7fa94489181729f3d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN 1b4266d07741206f7b8cba4fa8905e56\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepN ecc6da1ae57d58d707db7b6fe2471abc\n- fromN b5acbe8e27cbdbce5393ad91401fd07d\n- toN c48b8696dd67a7208550e7d178002838\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ exports: 5b192dab08a0491faf09373600f4b2cd\n+ ApplicativeB 16deedde4d173b65d0723755e5a93713\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial dc4e1c7b489ece1d00e77086237aaa82\n+ exports: d538e05bfbbc0ea212ae5ceedcab88a8\n+ Unit a654d0e651ca97ead2ab39e18faca7f6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 43d6d92d6f288625dea9f42a20c3850f\n+ exports: def7f398dd21c52b4a641939c81ad0d7\n+ Barbie b9a68eb4646738b9f4518cc946e66ed9\n+ Barbie 7d2a0f885d17d9961202bcfe87e12623\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3d9f2f2677a23aa95c2fa5da9877e31f\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepN e96c33128fc679fb69061e7d0ebf0dc0\n+ fromN a5637766ae3ff5f72edb992d534ba56a\n+ toN 78f9321b8015bdafeadc556b0d4f5810\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-f414a868bd9678a42dac5b458d7c59e0\n+577283c1809a0b1790aee41259d97c97\n $dmbprod ::\n forall k (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n (ProductB b, CanDeriveProductB b f g) =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n \\ @k\n @b :: (k -> *) -> *\n ($dProductB['GHC.Types.Many] :: ProductB b)\n @f :: k -> *\n @g :: k -> *\n ($d(%,,,%)['GHC.Types.Many] :: CanDeriveProductB b f g) ->\n gbprodDefault @k @b @f @g $d(%,,,%)]\n-6cd984b55be915979d0022c50c350794\n+7b1480754173b9e5bc903a4f72b0b5c7\n $dmbuniq ::\n forall k (b :: (k -> *) -> *) (f :: k -> *).\n (ProductB b, CanDeriveProductB b f f) =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: Compulsory <0,TrueTrue>\n@@ -264,15 +264,15 @@\n (Sym (Add0L (<1>_N)))\n _N)_N\n ; Sym (Data.Generics.GenericN.D:R:Indexed[0]\n *>_N <*>_N _N _N <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N)]\n-a78b4933d663d8a783645fa37817a7e9\n+22b46f77a58d94317099ffd53b07a486\n $fApplicativeBkb ::\n forall k (b :: (k -> *) -> *).\n (ProductB b, Barbies.Internal.FunctorB.FunctorB b) =>\n Barbies.Internal.ApplicativeB.ApplicativeB b\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n@@ -282,15 +282,15 @@\n (v1['GHC.Types.Many] :: Barbies.Internal.FunctorB.FunctorB b).\n @k\n @b\n v1\n (\\ @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n buniq @k @b v @f ds)\n (\\ @f :: k -> * @g :: k -> * -> bprod @k @b v @f @g)]\n-12d2e3c315a6318571c1e1ead1692d88\n+37b1f98412618fe4e246d8a01b85692e\n $fGProductBkkfg:*::*::*: ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg) =>\n GProductB\n f\n@@ -344,15 +344,15 @@\n @lg\n @lfg\n @rf\n @rg\n @rfg\n v\n v1)]\n-3ef65c5d1af9a074163cfe7dc48b1097\n+6da935ff168a55472cac840cd7e1c097\n $fGProductBkkfg:*::*::*:_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *) (x :: k2).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -386,15 +386,15 @@\n GHC.Generics.:*:\n @k1\n @lfg\n @rfg\n @x\n (gbprod @k1 @k @f @g @lf @lg @lfg $dGProductB @x pf pg l1 r1)\n (gbprod @k1 @k @f @g @rf @rg @rfg $dGProductB1 @x pf pg l2 r2) } }]\n-7acb6b9d24837c8fd5385582cc670f1a\n+02e462b4a335979984e1ae630df3f2a8\n $fGProductBkkfg:*::*::*:_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (lf :: k2 -> *)\n (lg :: k2 -> *) (lfg :: k2 -> *) (rf :: k2 -> *) (rg :: k2 -> *)\n (rfg :: k2 -> *) (x :: k2).\n (GProductB f g lf lg lfg, GProductB f g rf rg rfg, f GHC.Types.~ g,\n (lf GHC.Generics.:*: rf) GHC.Types.~ (lg GHC.Generics.:*: rg)) =>\n Data.Proxy.Proxy f\n@@ -476,15 +476,15 @@\n (GHC.Types.Eq# @(k1 -> *) @rg @rg @~_N)\n `cast`\n ((GHC.Types.~) *>_N (SelCo:Tc(2) (Sym co)) _N)_R\n eta\n (Data.Proxy.Proxy @(k1 -> *) @rf)\n (Data.Proxy.Proxy @(k1 -> *) @rfg)\n eta3) } }]\n-890d266c4fb525ee4d1dbb3f7d5a2396\n+ba137877826a5b9e18b24219b2157cd5\n $fGProductBkkfgM1M1M1 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta).\n GProductB f g repf repg repfg =>\n GProductB\n f\n g\n@@ -531,15 +531,15 @@\n @g\n @repf\n @repg\n @repfg\n @i\n @c\n v)]\n-e0fd5ff7f015b1199aafdfc96a6e592f\n+14ca49fdce77900f69830fb51d5f8a13\n $fGProductBkkfgM1M1M1_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n GProductB f g repf repg repfg =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n@@ -594,15 +594,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-af04c3a2ce768fffe200a93da6d68a6e\n+37a3781ac4a7855c0dab10aae83e3b35\n $fGProductBkkfgM1M1M1_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (repf :: k2 -> *)\n (repg :: k2 -> *) (repfg :: k2 -> *) i (c :: GHC.Generics.Meta)\n (x :: k2).\n (GProductB f g repf repg repfg, f GHC.Types.~ g,\n GHC.Generics.M1 i c repf GHC.Types.~ GHC.Generics.M1 i c repg) =>\n Data.Proxy.Proxy f\n@@ -658,15 +658,15 @@\n ((GHC.Types.~) *>_N (SelCo:Tc(3) (Sym co)) _N)_R\n eta\n (Data.Proxy.Proxy @(k1 -> *) @repf)\n (Data.Proxy.Proxy @(k1 -> *) @repfg)\n eta3)\n `cast`\n (Sym (GHC.Generics.N:M1[0] _N _P _P _R) _N) } }]\n-745c39de51f5ef9fc0f44b322c93d1ae\n+0be9b307fb88420284f25edb4c8d1c68\n $fGProductBkkfgRecRecRec ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *).\n ProductB b =>\n GProductB\n f\n g\n@@ -693,15 +693,15 @@\n @(Data.Generics.GenericN.Rec (b' (P0 f)) (b f))\n @(Data.Generics.GenericN.Rec (b' (P0 g)) (b g))\n @(Data.Generics.GenericN.Rec\n (b' (P0 (Data.Functor.Product.Product f g)))\n (b (Data.Functor.Product.Product f g)))\n ($fGProductBkkfgRecRecRec_$cgbprod @k @k1 @b @f @g @b' v)\n ($fGProductBkkfgRecRecRec_$cgbuniq @k @k1 @b @f @g @b' v)]\n-e18638e59e5b07f8c812f6a136187339\n+09d6b52720ebac7507b8f4c181d2192b\n $fGProductBkkfgRecRecRec0 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1).\n GProductB\n f\n g\n (Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a))\n@@ -725,15 +725,15 @@\n @(Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a))\n @(Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a))\n @(Data.Generics.GenericN.Rec\n (P0 (Data.Functor.Product.Product f g) a_or_pma)\n (Data.Functor.Product.Product f g a))\n ($fGProductBkkfgRecRecRec0_$cgbprod @k @k1 @f @g @a_or_pma @a)\n ($fGProductBkkfgRecRecRec0_$cgbuniq @k @k1 @f @g @a_or_pma @a)]\n-3bf0d554324160d0693b0c5ae4a2eed2\n+16e1c268bdeb0642502e9f91fe8b9788\n $fGProductBkkfgRecRecRec0_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1) (x :: k2).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a) x\n -> Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a) x\n@@ -788,15 +788,15 @@\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-9dfa482c56ee42d7f0ee3afbe609ecbd\n+52cac8f97d60eaacea3c1c774b620d48\n $fGProductBkkfgRecRecRec0_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (a_or_pma :: k1)\n (a :: k1) (x :: k2).\n (f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (P0 f a_or_pma) (f a)\n GHC.Types.~ Data.Generics.GenericN.Rec (P0 g a_or_pma) (g a)) =>\n Data.Proxy.Proxy f\n@@ -848,15 +848,15 @@\n (P0 (Data.Functor.Product.Product f g) a_or_pma)\n (Data.Functor.Product.Product f g a))>_R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:K1[0]\n _N _P _R _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N _P) _N _N)]\n-31fb00e1f2a4d331d4e75528113d5710\n+2aa90285ee4fa24235e70296be7aa9bb\n $fGProductBkkfgRecRecRec_$cgbprod ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *) (x :: k2).\n ProductB b =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Generics.GenericN.Rec (b' (P0 f)) (b f) x\n@@ -922,15 +922,15 @@\n _P) _N _N)]\n-d1fe6f425b35298cfab32a9d94e4bb3c\n+8cf595b1ff7d4ac7473fc68037f7f6cd\n $fGProductBkkfgRecRecRec_$cgbuniq ::\n forall k1 k2 (b :: (k1 -> *) -> *) (f :: k1 -> *) (g :: k1 -> *)\n (b' :: (k1 -> *) -> *) (x :: k2).\n (ProductB b, f GHC.Types.~ g,\n Data.Generics.GenericN.Rec (b' (P0 f)) (b f)\n GHC.Types.~ Data.Generics.GenericN.Rec (b' (P0 g)) (b g)) =>\n Data.Proxy.Proxy f\n@@ -999,15 +999,15 @@\n _R\n _P)\n ; Sym (Data.Generics.GenericN.N:Rec[0]\n _N\n _P) _N _N)]\n-3800e647124c5caeba2269d34d291af0\n+745f442defeffc5de5924ad978bfe707\n $fGProductBkkfgU1U1U1 ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *).\n GProductB f g GHC.Generics.U1 GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:GProductB], Inline: CONLIKE,\n Unfolding: DFun: @k @k1 @f :: k -> * @g :: k -> *.\n@@ -1016,15 +1016,15 @@\n @f\n @g\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n ($fGProductBkkfgU1U1U1_$cgbprod @k @k1 @f @g)\n ($fGProductBkkfgU1U1U1_$cgbuniq @k @k1 @f @g)]\n-246dcf1bb3a6b29ba82fb1fd915dc320\n+65c28f3166e2408a4639223dfbe84f24\n $fGProductBkkfgU1U1U1_$cgbprod ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (x :: k2).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n -> GHC.Generics.U1 x\n@@ -1037,15 +1037,15 @@\n @g :: k -> *\n @x :: k1\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g)\n (ds2['GHC.Types.Many] :: GHC.Generics.U1 x)\n (ds3['GHC.Types.Many] :: GHC.Generics.U1 x) ->\n case ds2 of wild { GHC.Generics.U1 -> ds3 }]\n-f7f68d4da77412ad34b1de4f7f7977ec\n+c7e98a66349e7e97c704f596fe42074f\n $fGProductBkkfgU1U1U1_$cgbuniq ::\n forall k1 k2 (f :: k1 -> *) (g :: k1 -> *) (x :: k2).\n (f GHC.Types.~ g, GHC.Generics.U1 GHC.Types.~ GHC.Generics.U1) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> Data.Proxy.Proxy GHC.Generics.U1\n -> (forall (a :: k1). f a)\n@@ -1063,15 +1063,15 @@\n ($d~1['GHC.Types.Many] :: GHC.Generics.U1\n GHC.Types.~ GHC.Generics.U1)\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds2['GHC.Types.Many] :: Data.Proxy.Proxy GHC.Generics.U1)\n (ds3['GHC.Types.Many] :: forall (a :: k). f a) ->\n GHC.Generics.U1 @k1 @x]\n-41e07f5c563e178b69a364fc1d926510\n+e8c679940721d047d6d37c20dbde4c02\n $fProductBkBarbie ::\n forall k (b :: (k -> *) -> *).\n ProductB b =>\n ProductB (Barbies.Internal.Wrappers.Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -1107,15 +1107,15 @@\n (\\ @f :: k -> * (x['GHC.Types.Many] :: forall (a :: k). f a) ->\n buniq @k @b v @f x)\n `cast`\n (forall (f :: *>_N).\n _R\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.Wrappers.N:Barbie[0]\n _N _R) _N)]\n-3c09a4955ebf9bc6013f996261b08d67\n+d61f38f2a9b363a313236fbadddf793d\n $fProductBkBarbie_$cp1ProductB ::\n forall k (b :: (k -> *) -> *).\n ProductB b =>\n Barbies.Internal.ApplicativeB.ApplicativeB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -1123,15 +1123,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductB['GHC.Types.Many] :: ProductB b) ->\n Barbies.Internal.Wrappers.$fApplicativeBkBarbie\n @k\n @b\n ($p1ProductB @k @b $dProductB)]\n-ddc98db3202e8a7724da7008467e13e9\n+8abc0ada38f25c1ce950a5ab31dcbd5f\n $fProductBkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductB a, ProductB b) =>\n ProductB (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -1143,15 +1143,15 @@\n (v['GHC.Types.Many] :: ProductB a)\n (v1['GHC.Types.Many] :: ProductB b).\n @k\n @(Data.Functor.Product.Product a b)\n ($fProductBkProduct_$cp1ProductB @k @a @b v v1)\n ($fProductBkProduct_$cbprod @k @a @b v v1)\n ($fProductBkProduct_$cbuniq @k @a @b v v1)]\n-14e3bcea6f41a442fe7fb34d4d02f4ba\n+79dc6c8331418c968a3bc427ed88d1d8\n $fProductBkProduct_$cbprod ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *)\n (g :: k -> *).\n (ProductB a, ProductB b) =>\n Data.Functor.Product.Product a b f\n -> Data.Functor.Product.Product a b g\n -> Data.Functor.Product.Product\n@@ -1175,15 +1175,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @(Data.Functor.Product.Product f g)\n (bprod @k @a $dProductB @f @g ll rl)\n (bprod @k @b $dProductB1 @f @g lr rr) } }]\n-f9d3b3f2e796ccb30f144fbda721388f\n+d090c7694a84c39056c53e5047e2b73b\n $fProductBkProduct_$cbuniq ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *) (f :: k -> *).\n (ProductB a, ProductB b) =>\n (forall (a1 :: k). f a1) -> Data.Functor.Product.Product a b f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: ,\n CPR: 1, Inline: (sat-args=1),\n@@ -1198,15 +1198,15 @@\n Data.Functor.Product.Pair\n @(k -> *)\n @a\n @b\n @f\n (buniq @k @a $dProductB @f x)\n (buniq @k @b $dProductB1 @f x)]\n-4f6a524c249a34b62ab977b658c337fc\n+3e8d424ad997d1f14d5d3c6f8a63b1d0\n $fProductBkProduct_$cp1ProductB ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductB a, ProductB b) =>\n Barbies.Internal.ApplicativeB.ApplicativeB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -1219,147 +1219,147 @@\n ($dProductB1['GHC.Types.Many] :: ProductB b) ->\n Barbies.Internal.ApplicativeB.$fApplicativeBkProduct\n @k\n @a\n @b\n ($p1ProductB @k @a $dProductB)\n ($p1ProductB @k @b $dProductB1)]\n-b3ded279d68234c205bf428b25af3bfb\n+616592dfab4fddfc22f2a9cba9268f17\n $fProductBkProxy :: ProductB Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ProductB], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.ApplicativeB.$fApplicativeBkProxy @k)\n ($fProductBkProxy_$cbprod @k)\n ($fProductBkProxy_$cbuniq @k)]\n-a245fe3ab8d21f96cbc55e963c218ec6\n+3bd653cb8ce551ce83b69db72dd71a65\n $fProductBkProxy_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy g\n -> Data.Proxy.Proxy (Data.Functor.Product.Product f g)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @k\n @f :: k -> *\n @g :: k -> *\n (ds['GHC.Types.Many] :: Data.Proxy.Proxy f)\n (ds1['GHC.Types.Many] :: Data.Proxy.Proxy g) ->\n Data.Proxy.Proxy @(k -> *) @(Data.Functor.Product.Product f g)]\n-1a67ca7656f15cf1cfaf86356c525d55\n+238ffc82d894183f1d4dcbe1832506bb\n $fProductBkProxy_$cbuniq ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Data.Proxy.Proxy f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Data.Proxy.Proxy @(k -> *) @f]\n-196e0c95cdbf448ea0169f66758c1b4a\n+57687f952deb6525905153ef6ecf9925\n $fProductBkUnit :: ProductB Barbies.Internal.Trivial.Unit\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:ProductB],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Barbies.Internal.Trivial.Unit\n (Barbies.Internal.Trivial.$fApplicativeBkUnit @k)\n ($fProductBkUnit_$cbprod @k)\n ($fProductBkUnit_$cbuniq @k)]\n-9138db5335924a90f5db8ada01a5a021\n+3d9fdb973a98b57090083f840fb1e6c0\n $fProductBkUnit1 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n (Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit f),\n Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit g),\n Data.Generics.GenericN.GenericN\n (Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g)),\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)))\n [TagSig: , LambdaFormInfo: LFCon[(%,,,%)],\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n ($fProductBkUnit6 @k @f, $fProductBkUnit6 @k @g,\n $fProductBkUnit4 @k @f @g, $fProductBkUnit2 @k @f @g)]\n-9cdf16caa573fd5618115a4a3fc9c335\n+c903859c774e1267fcf69b7881cb7111\n $fProductBkUnit2 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n@@ -1385,18 +1385,18 @@\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1)\n @GHC.Generics.D\n @('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n ($fProductBkUnit3 @k @f @g)]\n-cb11c65c211ab6cbe37aeae0b6c94aa9\n+7d76f9fbe392e8a40e1cebc534e7332c\n $fProductBkUnit3 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n GProductB\n f\n g\n (GHC.Generics.M1\n GHC.Generics.C\n@@ -1424,15 +1424,15 @@\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.U1\n @GHC.Generics.C\n @('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n ($fGProductBkkfgU1U1U1 @k @(*) @f @g)]\n-d5c6a8220210d5bcd55cdaec8a04d2a0\n+dca49c85bda005a861a1c8ab030841bc\n $fProductBkUnit4 ::\n forall {k} {f :: k -> *} {g :: k -> *}.\n Data.Generics.GenericN.GenericN\n (Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @f :: k -> * @g :: k -> * ->\n@@ -1446,15 +1446,15 @@\n _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1465,15 +1465,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))))_R\n (Barbies.Internal.Trivial.$fGenericUnit\n @k\n @(Data.Functor.Product.Product f g))]\n-69c96d14c027c9119099d80713f08c05\n+3e5b33ee9793201a8e7c72c923ae9ded\n $fProductBkUnit5 ::\n GHC.Types.Coercible\n (GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n (GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n [HasNoCafRefs, TagSig: ,\n@@ -1538,45 +1538,45 @@\n Unfolding: Core: \n GHC.Types.MkCoercible\n @(* -> *)\n @(GHC.Generics.D1\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.C1\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @(GHC.Generics.M1\n GHC.Generics.D\n ('GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False)\n (GHC.Generics.M1\n GHC.Generics.C\n ('GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False)\n GHC.Generics.U1))\n @~_R]\n-054cd0022cad448518bcc8d4dd2a21cf\n+cef42437c5b8aa19548d9d34bb6672d6\n $fProductBkUnit6 ::\n forall {k} {g :: k -> *}.\n Data.Generics.GenericN.GenericN (Barbies.Internal.Trivial.Unit g)\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @k @g :: k -> * ->\n Data.Generics.GenericN.$fGenericNa\n@@ -1588,15 +1588,15 @@\n (Sub (Sym (Barbies.Internal.Trivial.Rep_Unit[0] _N _N)))\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_P\n ((GHC.Generics.M1\n <*>_N\n _P\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_P\n (Sub (Sym (Data.Generics.GenericN.D:R:Zip[4]))))_R\n@@ -1607,15 +1607,15 @@\n _N\n _N))))_R\n ; Sub (Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n _N\n <0>_N)))_N)\n (Sym (Barbies.Internal.Trivial.Rep_Unit[0] _N _N)))_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))))_R\n (Barbies.Internal.Trivial.$fGenericUnit @k @g)]\n-ab30529d81d8c2939f67133628644de4\n+c71740166eb3672f18b1cad418bf6d50\n $fProductBkUnit_$cbprod ::\n forall k (f :: k -> *) (g :: k -> *).\n Barbies.Internal.Trivial.Unit f\n -> Barbies.Internal.Trivial.Unit g\n -> Barbies.Internal.Trivial.Unit (Data.Functor.Product.Product f g)\n [LambdaFormInfo: LFReEntrant 2, Arity: 2, Strictness: ,\n Unfolding: Core: \n@@ -1673,15 +1673,15 @@\n _N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1692,15 +1692,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1747,15 +1747,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N))\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n ((GHC.Generics.M1\n <*>_N\n _N\n <'GHC.Generics.MetaCons\n \"Unit\" 'GHC.Generics.PrefixI 'GHC.Types.False>_N\n (Sym (Data.Generics.GenericN.D:R:Zip[4])))_N\n@@ -1802,15 +1802,15 @@\n _N\n _N)))_N\n ; Sym (Data.Generics.GenericN.D:R:Zip[0]\n _N\n <'GHC.Generics.MetaData\n \"Unit\"\n \"Barbies.Internal.Trivial\"\n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"\n 'GHC.Types.False>_N\n _N\n _N\n <0>_N)))_N)\n (Sym (Barbies.Internal.Trivial.Rep_Unit[0]\n _N _N)))_N\n ; Sym (Data.Generics.GenericN.R:RepNa[0]\n _N)))_N)_R]\n-462d3f134728f8bc8fc23d962bb48478\n+bbb472e0c725c546df5670fc30c20225\n $fProductBkUnit_$cbuniq ::\n forall k (f :: k -> *).\n (forall (a :: k). f a) -> Barbies.Internal.Trivial.Unit f\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k @f :: k -> * (ds['GHC.Types.Many] :: forall (a :: k). f a) ->\n Barbies.Internal.Trivial.Unit @k @f]\n-8d239728a4ba7985b57a6f5819f971c8\n+684a93ad077194cc10d2d0846b2970be\n $tcGProductB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 1667332789958806794#Word64\n- 4613459615711773077#Word64\n+ 6419954504256367931#Word64\n+ 8483069447274487861#Word64\n $trModule\n $tcGProductB2\n 2#\n $tcGProductB1]\n-fb4bf787b355a7395c5b85475f7a38b1\n+c4f0d2130cb7dc2c84f925d592c5a9b4\n $tcGProductB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-12fee82fe89bf1faac0bace6407358fd\n+30ade253f285773b8adb960aa2bc0509\n $tcGProductB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGProductB3]\n-00437b06e8a8fa24142fa30cfcd443ed\n+b5835aa294e6b16743d6c9ae237d8d78\n $tcGProductB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GProductB\"#]\n-2be7b2b353c6a95811c789193e6d9c4b\n+fc36176be099b7a5d7dca050f1346285\n $tcProductB :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 8362087174471471218#Word64\n- 5543274390772100721#Word64\n+ 10066923484651618271#Word64\n+ 6842141617440004383#Word64\n $trModule\n $tcProductB2\n 1#\n $tcProductB1]\n-b40124850e7254ec98d25730e8676207\n+751be54dc200afac3e6b7d9d627a51e2\n $tcProductB1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-86723feb3422e173beb56299ecacd1fa\n+763e0a6c967cae0dbbb45e461574701c\n $tcProductB2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProductB3]\n-6c6e3eeef9775bfa0da27c9d1a13f378\n+2653ce19c872dfac29f7f83842ea70e0\n $tcProductB3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ProductB\"#]\n-7cad2cdbcd26ce2a4a0ab74e5cc2c6ec\n+1d5a663f62e3fa7b71f568f42046e940\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-b49434b17c408269428704647975258a\n+d3dcc5ae679a995bcbbe5ad7f62d67aa\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-fbbcd5bdc83f5a422664ca006e53b53f\n+88920a03577622e718905f489d07baa5\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Internal.Product\"#]\n-e386a12b5327aef49ab790158bad1d39\n+fb2fdedbc4df7bba95e7164b854c26bb\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-e5c73cb20e22e2339d90951f21136782\n+e332ebcf6da874ae3d53980adb2c2f46\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-edd1b7310e7e53a3ccd4a0885be96b23\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+845de4ab1cbeb9dbb37711d2ac7a7857\n type CanDeriveProductB :: forall {k}.\n ((k -> *) -> *) -> (k -> *) -> (k -> *) -> GHC.Types.Constraint\n type CanDeriveProductB b f g =\n (Data.Generics.GenericN.GenericN (b f),\n Data.Generics.GenericN.GenericN (b g),\n Data.Generics.GenericN.GenericN\n (b (Data.Functor.Product.Product f g)),\n@@ -1937,15 +1937,15 @@\n f\n g\n (Data.Generics.GenericN.RepN (b f))\n (Data.Generics.GenericN.RepN (b g))\n (Data.Generics.GenericN.RepN\n (b (Data.Functor.Product.Product f g))))\n :: GHC.Types.Constraint\n-e66eb7bb9eb76ca38e2e7d6fb1df5f74\n+5042a458bc3ca5e22a02a501ade6dba9\n type GProductB :: forall {k} k1.\n (k1 -> *)\n -> (k1 -> *)\n -> (k -> *)\n -> (k -> *)\n -> (k -> *)\n -> GHC.Types.Constraint\n@@ -1957,31 +1957,31 @@\n (f GHC.Types.~ g, repbf GHC.Types.~ repbg) =>\n Data.Proxy.Proxy f\n -> Data.Proxy.Proxy repbf\n -> Data.Proxy.Proxy repbfg\n -> (forall (a :: k1). f a)\n -> repbf x\n {-# MINIMAL gbprod, gbuniq #-}\n-9a3d7e6e47a131526f197419b882faf8\n+c30efe7349e0a1b84ed738fc8e2a7b75\n type P0 :: forall {k}. k -> k\n type P0 = Data.Generics.GenericN.Param 0 :: k -> k\n-af99b4f9ab3ced46f9535839b62e919e\n+d39e0a5b1e3c8e26d5a23aeef55d72fc\n type ProductB :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class Barbies.Internal.ApplicativeB.ApplicativeB b =>\n ProductB b where\n bprod :: forall (f :: k -> *) (g :: k -> *).\n b f -> b g -> b (Data.Functor.Product.Product f g)\n default bprod :: forall (f :: k -> *) (g :: k -> *).\n CanDeriveProductB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n buniq :: forall (f :: k -> *). (forall (a :: k). f a) -> b f\n default buniq :: forall (f :: k -> *).\n CanDeriveProductB b f f =>\n (forall (a :: k). f a) -> b f\n-cb7ebeedc836ded56f44cdf02e39eb93\n+9d21d3364ad96f176623ba08875c0a0d\n gbprodDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *) (g :: k -> *).\n CanDeriveProductB b f g =>\n b f -> b g -> b (Data.Functor.Product.Product f g)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline: (sat-args=2),\n@@ -2165,15 +2165,15 @@\n <*>_N\n _N\n _N\n <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N)]\n-a08dffcd2f8aa1b0967a29c0488688db\n+27f7df029376bc2505c3d22ab86d71e7\n gbuniqDefault ::\n forall {k} (b :: (k -> *) -> *) (f :: k -> *).\n CanDeriveProductB b f f =>\n (forall (a :: k). f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=1),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie/Internal/ProductC.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie/Internal/ProductC.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Data.Barbie.Internal.ProductC 9066\n- interface hash: 759086ff4c31c8a32a19349f9e4fe6e1\n- ABI hash: 9c45b22b47427a7c2e2ba34330e53e75\n- export-list hash: 495c8cdfd60ed954baa7ebb7f5479191\n+ interface hash: be0767d4e36b8b01e5ace43773431a8a\n+ ABI hash: 71a40bfeed43f69ea58d65e38995e3da\n+ export-list hash: def6729fa1fe0da7b2508be3a8a7afa6\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 47902a655b5a8eeeeb64c2b66e53464a\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 272c6cfcf77d2a8065ca7a71d5c1e893\n sig of: Nothing\n@@ -20,22 +20,22 @@\n exports:\n buniqC\n gbdictsDefault\n Barbies.Generics.Constraints.GAll\n CanDeriveProductBC\n GProductBC{gbdicts}\n ProductBC{bdicts}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB\n Data.Barbie.Internal.Product GHC.Base GHC.Float Data.Orphans\n@@ -47,59 +47,59 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Generics.Constraints d745d9d282b4b8b1e7a00feaec72f736\n- exports: f5759178cdbb617493eee5630131ae28\n- GAll a97385b661b56e3be3899c1ab3c9b2ee\n- Other 37a7ae0c37bbbef9abad416d6d0959ff\n- Self 2f79d5b19b60d934525cb7f68041b9a3\n- X 171ce71086eece1d472adc01f3a98af1\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB c915225ce12dec07b484cb0e6c8bc95f\n- exports: 62d29be84a756dd8aa3183dad2a1d146\n- AllB 742934a1aef6759c559e39d90cf8ee7d\n- ConstraintsB dc18dd2fb15b81c31fdce03ebb848f0f\n- GAllRepB 277cdc2c0f11943cec79057ddef744d4\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Dicts 11d9cab4807894b2baa78a0cba8e7494\n- exports: 9f8c69c553b186c41f515294f9b7135a\n- Dict adad19ff9d0f2524fe5fa4bd0c2b10cc\n- Dict ec60591113f8a2b0cd5ff8ded40ccb22\n- requiringDict 1ef5ac9bdc38d1886b55376c71cb27fa\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial e8e840d58a71f36f08cf907351677909\n- exports: f2b3ffa6928a822bd57073425bf0c21d\n- Unit 7dad192333f9ffba2f7db338141645a6\n- Unit c1936e142e7230f25a3d66e4ed000254\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 7958e4aadfb4871559a27df0095b994b\n- exports: 9f5517e3ff8f369efce374339dce99ad\n- Barbie 5b007c31a64e58d86f5c6e69c899c0fd\n- Barbie 543cc7d88fba5fd7fa94489181729f3d\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product 5e5dbf1be237d0122682147891fd427a\n- exports: b3bfa95a17c0f8b277ed3b23015a2153\n- ProductB af99b4f9ab3ced46f9535839b62e919e\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- GenericN 1b4266d07741206f7b8cba4fa8905e56\n- Param 64ce4f405ce19c0ac06589973a57c10d\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- RepN ecc6da1ae57d58d707db7b6fe2471abc\n- toN c48b8696dd67a7208550e7d178002838\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Generics.Constraints 39afe276e15aa255e48d08c5ba712f59\n+ exports: cc7aef2f5c488676d297ae83c45ee82c\n+ GAll a7ee244c89fc411256c161efeeeaa7f7\n+ Other 8bb50890c54679a66314c7386cc22c84\n+ Self fad44513c200d092a9b1df1339ad21e6\n+ X ef8817b68c20d7aa4653a1809b97c873\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB cb077425686d4bb620c4f51549182b9f\n+ exports: 805180e0c2ac5e4eb5bae7572cee9a36\n+ AllB 1b4f9a291ec9d45a18d31df601e0aeeb\n+ ConstraintsB 0e5c16bae977600323d72f12d780df0a\n+ GAllRepB 4b3474a88e083762e3a70813269e0f11\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Dicts 0c882df337c0ddb4b93d319e9df15dee\n+ exports: aef70c927dc71262ae11a005378b77ba\n+ Dict bff0b142b8aff4e8f3cceef6652e36ab\n+ Dict dd2349f8d9e28b14c434ca84ff9690b6\n+ requiringDict 501619b73143cb187d749df6455ffe8e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial dc4e1c7b489ece1d00e77086237aaa82\n+ exports: d538e05bfbbc0ea212ae5ceedcab88a8\n+ Unit a88e573f0bca8af4d81862878a7ee1dc\n+ Unit a654d0e651ca97ead2ab39e18faca7f6\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 43d6d92d6f288625dea9f42a20c3850f\n+ exports: def7f398dd21c52b4a641939c81ad0d7\n+ Barbie b9a68eb4646738b9f4518cc946e66ed9\n+ Barbie 7d2a0f885d17d9961202bcfe87e12623\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product bc6e15bf1ecbbc6595bdaffefaf80615\n+ exports: f0b0ed3fda32adae110638adb35a2d40\n+ ProductB d39e0a5b1e3c8e26d5a23aeef55d72fc\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ GenericN 3d9f2f2677a23aa95c2fa5da9877e31f\n+ Param 8a772f1a47d87e197f6034a33fad91b6\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ RepN e96c33128fc679fb69061e7d0ebf0dc0\n+ toN 78f9321b8015bdafeadc556b0d4f5810\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-532b22c98d7901de5cd25a7c1c82b8ed\n+8b4dd10054580bdf0f804d27c5dce30b\n $dmbdicts ::\n forall k (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n (ProductBC b, CanDeriveProductBC c b,\n Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -203,15 +203,15 @@\n <*>_N\n _N\n _N\n <0>_N)))_N\n _N)_R\n ; Sub (Sym (Data.Generics.GenericN.R:RepNa[0]\n _N))) _N) } }]\n-8224ebf0ac624b6e883bae08f9dc0cde\n+8110127645e785db46677cfbc0bb55ab\n $fGProductBCkkc:*::*: ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (lx :: * -> *)\n (ld :: k2 -> *) (rx :: * -> *) (rd :: k2 -> *).\n (GProductBC c lx ld, GProductBC c rx rd) =>\n GProductBC c (lx GHC.Generics.:*: rx) (ld GHC.Generics.:*: rd)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -230,15 +230,15 @@\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Sym (N:GProductBC[0]\n _N\n _N\n _N\n _N\n _N))]\n-c4eecc815c9e5f4d8dc1b9bebdece594\n+7663acc4e76863a8bbe8764f4d83ded6\n $fGProductBCkkc:*::*:_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (lx :: * -> *)\n (ld :: k2 -> *) (rx :: * -> *) (rd :: k2 -> *) (x :: k2).\n (GProductBC c lx ld, GProductBC c rx rd,\n Barbies.Generics.Constraints.GAll 0 c (lx GHC.Generics.:*: rx)) =>\n (GHC.Generics.:*:) ld rd x\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n@@ -280,15 +280,15 @@\n (GHC.Classes.$p1(%,%)\n @(Barbies.Generics.Constraints.GAll 0 c lx)\n @(Barbies.Generics.Constraints.GAll 0 c rx)\n irred\n `cast`\n (Sub (Barbies.Generics.Constraints.D:R:GAllknc:*:[0]\n _N <0>_N _N _N _N))))]\n-980f48cc361a6cb259b833d65e466d84\n+4bcb3d12dd8e77be5eb0ca6102affbe4\n $fGProductBCkkcM1M1 ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (repbx :: * -> *)\n (repbd :: k2 -> *) i (k3 :: GHC.Generics.Meta).\n GProductBC c repbx repbd =>\n GProductBC\n c (GHC.Generics.M1 i k3 repbx) (GHC.Generics.M1 i k3 repbd)\n DFunId\n@@ -304,15 +304,15 @@\n _R\n %<'GHC.Types.Many>_N ->_R Sym (N:GProductBC[0]\n _N\n _N\n _N\n _N\n _N))]\n-cf99ef82dd68da2e75e3f95bc9400007\n+5678c54baaa2c3716dbc18ed67b2ed65\n $fGProductBCkkcM1M1_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (repbx :: * -> *)\n (repbd :: k2 -> *) i (k3 :: GHC.Generics.Meta) (x :: k2).\n (GProductBC c repbx repbd,\n Barbies.Generics.Constraints.GAll\n 0 c (GHC.Generics.M1 i k3 repbx)) =>\n GHC.Generics.M1 i k3 repbd x\n@@ -337,15 +337,15 @@\n Sub (Sym (Barbies.Generics.Constraints.D:R:GAllk1ncM1[0]\n _N <0>_N _N _N _N _N))\n %<'GHC.Types.Many>_N ->_R Sym (GHC.Generics.N:M1[0]\n _N\n _P\n _P\n _R) _N)]\n-083f9bcc4efbb9c3d346644a37b33260\n+2e24d35b68e824abcb67646f2e6bc52d\n $fGProductBCkkcOtherRec ::\n forall k1 k2 (b :: (k1 -> *) -> *)\n (c :: k1 -> GHC.Types.Constraint) (b' :: (k1 -> *) -> *).\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b) =>\n GProductBC\n c\n (Barbies.Generics.Constraints.Other\n@@ -394,15 +394,15 @@\n _N\n _N\n _N))]\n-400dbae00b13d949e0f39aae63471b5e\n+4de64e986e6cadf66aef175a85d11067\n $fGProductBCkkcOtherRec1 ::\n forall {k1} {k2} {b :: (k1 -> *) -> *}\n {c :: k1 -> GHC.Types.Constraint} {b' :: (k1 -> *) -> *} {x :: k2}.\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -424,15 +424,15 @@\n (irred1['GHC.Types.Many] :: Barbies.Generics.Constraints.GAll\n 0\n c\n (Barbies.Generics.Constraints.Other\n (b' (P0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))) ->\n bdicts @k @b $dProductBC @c irred]\n-846bf2fdaf5e881b0bd76ae8af60726e\n+2c6983ef6715cb50b3cebbc6c3d53b31\n $fGProductBCkkcRecRec ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (a :: k1)\n (a_or_pma :: k1).\n c a =>\n GProductBC\n c\n (Data.Generics.GenericN.Rec\n@@ -456,15 +456,15 @@\n _N\n _N\n _N))]\n-322a59cd018eb21253e97ae7ad08af43\n+d2b7b66cbf44f801689c0f6d31224571\n $fGProductBCkkcRecRec_$cgbdicts ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint) (a :: k1)\n (a_or_pma :: k1) (x :: k2).\n (c a,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -513,15 +513,15 @@\n _N\n _P) _N _N)]\n-8a0aa242d82c81f18eb96313a409701b\n+a44176c46bc1ff872d9232a52c1b66e2\n $fGProductBCkkcSelfRec ::\n forall k1 k2 (b :: (k1 -> *) -> *)\n (c :: k1 -> GHC.Types.Constraint) (b' :: (k1 -> *) -> *).\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b) =>\n GProductBC\n c\n (Barbies.Generics.Constraints.Self\n@@ -570,15 +570,15 @@\n _N\n _N\n _N))]\n-eb2417093fd471b105ea9aa3734169b0\n+3196f14054fd3841774570589feae723\n $fGProductBCkkcSelfRec1 ::\n forall {k1} {k2} {b :: (k1 -> *) -> *}\n {c :: k1 -> GHC.Types.Constraint} {b' :: (k1 -> *) -> *} {x :: k2}.\n (ProductBC b, Barbies.Internal.ConstraintsB.AllB c b,\n Barbies.Generics.Constraints.GAll\n 0\n c\n@@ -600,15 +600,15 @@\n (irred1['GHC.Types.Many] :: Barbies.Generics.Constraints.GAll\n 0\n c\n (Barbies.Generics.Constraints.Self\n (b' (P0 Barbies.Generics.Constraints.X))\n (b Barbies.Generics.Constraints.X))) ->\n bdicts @k @b $dProductBC @c irred]\n-3a148debadd487ab5b280b2e8a694590\n+7543556b07c5fde1bb08bec938fc1ec9\n $fGProductBCkkcU1U1 ::\n forall k1 k2 (c :: k1 -> GHC.Types.Constraint).\n GProductBC c GHC.Generics.U1 GHC.Generics.U1\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: (sat-args=0),\n Unfolding: Core: StableUser <0,FalseTrue>\n@@ -620,15 +620,15 @@\n 0 c GHC.Generics.U1) ->\n GHC.Generics.U1 @k1 @x)\n `cast`\n (forall (k :: <*>_N) (k1 :: <*>_N) (c :: GHC.Types.Constraint>_N).\n Sym (N:GProductBC[0]\n _N _N _N _N _N))]\n-5ddfdc01d8ebcf54f74238c6b0bf4e67\n+5fff3022bd976bfa5a208e01dad6b1fe\n $fProductBCkBarbie ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n ProductBC (Barbies.Internal.Wrappers.Barbie b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -644,15 +644,15 @@\n (bdicts @k @b v)\n `cast`\n (forall (c :: GHC.Types.Constraint>_N).\n Sub (Sym (Barbies.Internal.Wrappers.D:R:AllBkcBarbie[0]\n _N _N _N))\n %<'GHC.Types.Many>_N ->_R Sym (Barbies.Internal.Wrappers.N:Barbie[0]\n _N _R) _N)]\n-da985e01da78b43f5363f4e941f94a5b\n+f49be33feb32280626e155fa2dbe95bf\n $fProductBCkBarbie_$cp1ProductBC ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n Barbies.Internal.ConstraintsB.ConstraintsB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n@@ -660,15 +660,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductBC['GHC.Types.Many] :: ProductBC b) ->\n Barbies.Internal.Wrappers.$fConstraintsBkBarbie\n @k\n @b\n ($p1ProductBC @k @b $dProductBC)]\n-f214eb4668e7d6af0f295fe49e45bb4e\n+098398eaddea31f42f5826d9e3a1ac4f\n $fProductBCkBarbie_$cp2ProductBC ::\n forall k (b :: (k -> *) -> *).\n ProductBC b =>\n Data.Barbie.Internal.Product.ProductB\n (Barbies.Internal.Wrappers.Barbie b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1,\n@@ -677,15 +677,15 @@\n \\ @k\n @b :: (k -> *) -> *\n ($dProductBC['GHC.Types.Many] :: ProductBC b) ->\n Data.Barbie.Internal.Product.$fProductBkBarbie\n @k\n @b\n ($p2ProductBC @k @b $dProductBC)]\n-7a8fc37ce9d0a5239db2b4c52a9d47ac\n+936e7256356bb7bdf8ed5c2a7316dfd4\n $fProductBCkProduct ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n ProductBC (Data.Functor.Product.Product a b)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -697,15 +697,15 @@\n (v['GHC.Types.Many] :: ProductBC a)\n (v1['GHC.Types.Many] :: ProductBC b).\n @k\n @(Data.Functor.Product.Product a b)\n ($fProductBCkProduct_$cp1ProductBC @k @a @b v v1)\n ($fProductBCkProduct_$cp2ProductBC @k @a @b v v1)\n ($fProductBCkProduct_$cbdicts @k @a @b v v1)]\n-c0bf193f8f0208f73af4a110cc05a1d0\n+49fc3b78be1b3d86d826838fd12beb02\n $fProductBCkProduct_$cbdicts ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *)\n (c :: k -> GHC.Types.Constraint).\n (ProductBC a, ProductBC b,\n Barbies.Internal.ConstraintsB.AllB\n c (Data.Functor.Product.Product a b)) =>\n Data.Functor.Product.Product a b (Barbies.Internal.Dicts.Dict c)\n@@ -747,15 +747,15 @@\n (GHC.Classes.$p1(%,%)\n @(Barbies.Internal.ConstraintsB.AllB c a)\n @(Barbies.Internal.ConstraintsB.AllB c b)\n irred\n `cast`\n (Sub (Barbies.Internal.ConstraintsB.D:R:AllBkcProduct[0]\n _N _N _N _N))))]\n-c21b332a79dbf00a746aad6bb616d38f\n+7d44aa5d5a6fcd917fcd17148b49abaa\n $fProductBCkProduct_$cp1ProductBC ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n Barbies.Internal.ConstraintsB.ConstraintsB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -768,15 +768,15 @@\n ($dProductBC1['GHC.Types.Many] :: ProductBC b) ->\n Barbies.Internal.ConstraintsB.$fConstraintsBkProduct\n @k\n @a\n @b\n ($p1ProductBC @k @a $dProductBC)\n ($p1ProductBC @k @b $dProductBC1)]\n-4f6e744311395f49f24f086fec65fa85\n+c335ccfbf2acbc2058ff4868f22c5fde\n $fProductBCkProduct_$cp2ProductBC ::\n forall k (a :: (k -> *) -> *) (b :: (k -> *) -> *).\n (ProductBC a, ProductBC b) =>\n Data.Barbie.Internal.Product.ProductB\n (Data.Functor.Product.Product a b)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -789,166 +789,166 @@\n ($dProductBC1['GHC.Types.Many] :: ProductBC b) ->\n Data.Barbie.Internal.Product.$fProductBkProduct\n @k\n @a\n @b\n ($p2ProductBC @k @a $dProductBC)\n ($p2ProductBC @k @b $dProductBC1)]\n-34c48a3e9c7875f30319ac80cd001de9\n+8778b1e5cbd17d49600bdf0ac0d555b2\n $fProductBCkProxy :: ProductBC Data.Proxy.Proxy\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[C:ProductBC], Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Data.Proxy.Proxy\n (Barbies.Internal.ConstraintsB.$fConstraintsBkProxy @k)\n (Data.Barbie.Internal.Product.$fProductBkProxy @k)\n (\\ @c :: k -> GHC.Types.Constraint\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllB\n c Data.Proxy.Proxy) ->\n Data.Proxy.Proxy @(k -> *) @(Barbies.Internal.Dicts.Dict c))]\n-1719207a8b6d9599f01d4734dd33b3ba\n+31bc1a9fb389b8d84478af55c3f04ee2\n $fProductBCkUnit :: ProductBC Barbies.Internal.Trivial.Unit\n DFunId\n [TagSig: , LambdaFormInfo: LFCon[C:ProductBC],\n Inline: CONLIKE,\n Unfolding: DFun: @k.\n @k\n @Barbies.Internal.Trivial.Unit\n (Barbies.Internal.Trivial.$fConstraintsBkUnit @k)\n (Data.Barbie.Internal.Product.$fProductBkUnit @k)\n ($fProductBCkUnit_$cbdicts @k)]\n-a2f791d442a1e1695f12a3bdeedfb843\n+de58a7872f2a3b3fc15e7590e9f5e569\n $fProductBCkUnit_$cbdicts ::\n forall k (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB\n c Barbies.Internal.Trivial.Unit =>\n Barbies.Internal.Trivial.Unit (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @k\n @c :: k -> GHC.Types.Constraint\n (irred['GHC.Types.Many] :: Barbies.Internal.ConstraintsB.AllB\n c Barbies.Internal.Trivial.Unit) ->\n Barbies.Internal.Trivial.Unit @k @(Barbies.Internal.Dicts.Dict c)]\n-36fc3b6695f882e8d9ebecf09c028c3f\n+61aad8b07bfa6dffea61eb062c32d2df\n $tcGProductBC :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 358719258876205018#Word64\n- 14902744305322923390#Word64\n+ 17749737320706283794#Word64\n+ 7125474000560163475#Word64\n $trModule\n $tcGProductBC2\n 2#\n $tcGProductBC1]\n-c9095807c7408c5ee332b34f7b51ae26\n+30b224621b0f29bc972930e11a20da07\n $tcGProductBC1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-8e2356d9832e8729b05a39101b0a79f5\n+b7138183d4ee25f6e8b30653134ea371\n $tcGProductBC2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGProductBC3]\n-a492b7431c7a8b81610001ad39df6b74\n+b63da4fd910950b2281484a490de23ef\n $tcGProductBC3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GProductBC\"#]\n-13df3db9baa995660116ed3a0c3f6f20\n+cb27c6b824e6ae4cfc4d2333003baae7\n $tcProductBC :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 6190022483737620753#Word64\n- 13634340348264869686#Word64\n+ 14678023398112272288#Word64\n+ 14107705968917854123#Word64\n $trModule\n $tcProductBC2\n 1#\n $tcProductBC1]\n-f4e94c88f892e9932c29db3c4c7d608d\n+4ba1c18db373ace3e3be6ccbb5b5d595\n $tcProductBC1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-63e9f4d0237085b113c9f7af7c919607\n+52bc87c217e8f20de031932d70313c65\n $tcProductBC2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProductBC3]\n-8f566d8c4ec3619ee212d5e8d291f79a\n+db7d638d4f06af6c8c0c64db99bb0c94\n $tcProductBC3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"ProductBC\"#]\n-693cf10882f166bd8b557f266353bbe3\n+ff41f475e2184bbee24f272162fb0540\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-f81924760c1760816c71c5ff2c74656c\n+b1d808cd52a98118ca99d2ba06258af5\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-41bd1a9ab7ebb6bf12f3ee9da30a63b4\n+9e87af948156be29ca1fe3778c7c477d\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie.Internal.ProductC\"#]\n-56a4ef516dab9161a1d5134223518c24\n+f994d5062abea8be7f13de103b38cc76\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-b093a32f2917829b1265662b845c4741\n+32e66ec646b3976a234fce1abead6841\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-11db5eeb41bce3f45a8dd0b5d0651ec6\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+ec80d6fa3a7d2c0c33bdfa2208e1e3d0\n type CanDeriveProductBC :: forall {k}.\n (k -> GHC.Types.Constraint)\n -> ((k -> *) -> *) -> GHC.Types.Constraint\n type CanDeriveProductBC c b =\n (Data.Generics.GenericN.GenericN\n (b (Barbies.Internal.Dicts.Dict c)),\n Barbies.Internal.ConstraintsB.AllB c b\n GHC.Types.~ Barbies.Generics.Constraints.GAll\n 0 c (Barbies.Internal.ConstraintsB.GAllRepB b),\n GProductBC\n c\n (Barbies.Internal.ConstraintsB.GAllRepB b)\n (Data.Generics.GenericN.RepN (b (Barbies.Internal.Dicts.Dict c))))\n :: GHC.Types.Constraint\n-b7f6551b932973c12941b8b37206ab2a\n+162da2078952637dbe9e1bcb8e9f1865\n type GProductBC :: forall {k} {k1}.\n (k -> GHC.Types.Constraint)\n -> (* -> *) -> (k1 -> *) -> GHC.Types.Constraint\n class GProductBC c repbx repbd where\n gbdicts :: forall (x :: k1).\n Barbies.Generics.Constraints.GAll 0 c repbx =>\n repbd x\n {-# MINIMAL gbdicts #-}\n-ca8ea277d7c65c36558c64a3b5a35880\n+1bfcacd35f8e9409bb195eea36b3889d\n type P0 :: forall {k}. k -> k\n type P0 = Data.Generics.GenericN.Param 0 :: k -> k\n-2e32d626c3ad4b9d08b8baf41457da27\n+19ae595e08df4c786445ee3f1c666a9a\n type ProductBC :: forall k. ((k -> *) -> *) -> GHC.Types.Constraint\n class (Barbies.Internal.ConstraintsB.ConstraintsB b,\n Data.Barbie.Internal.Product.ProductB b) =>\n ProductBC b where\n bdicts :: forall (c :: k -> GHC.Types.Constraint).\n Barbies.Internal.ConstraintsB.AllB c b =>\n b (Barbies.Internal.Dicts.Dict c)\n default bdicts :: forall (c :: k -> GHC.Types.Constraint).\n (CanDeriveProductBC c b, Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n-f593d3b66be3e7314629e11fbe3669e7\n+1fa34479252669ba572bda3ee8d2132e\n buniqC ::\n forall {k} (c :: k -> GHC.Types.Constraint) (f :: k -> *)\n (b :: (k -> *) -> *).\n (Barbies.Internal.ConstraintsB.AllB c b, ProductBC b) =>\n (forall (a :: k). c a => f a) -> b f\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -980,15 +980,15 @@\n (eta @a))\n (bdicts\n @k\n @b\n $dProductBC\n @c\n irred) }]\n-cc9d29175f03061d2537769763e9e4c2\n+b92dfc86eb04e8bc0e21cc0cecdfca12\n gbdictsDefault ::\n forall {k} (b :: (k -> *) -> *) (c :: k -> GHC.Types.Constraint).\n (CanDeriveProductBC c b, Barbies.Internal.ConstraintsB.AllB c b) =>\n b (Barbies.Internal.Dicts.Dict c)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: (sat-args=0),\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Barbie.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Barbie.p_hi", "comments": ["Files 96% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Data.Barbie 9066\n- interface hash: eceea448ca027d72602bc67bc41e45dd\n- ABI hash: 34f5f95bc3e82c12893c12f6adbd2746\n- export-list hash: 73d6481d423f0ede573529668905cd57\n+ interface hash: 6de15836f41b599e86d3ad951b83a9cd\n+ ABI hash: e696a9d9ba23baed837dd48e7c51e720\n+ export-list hash: f4a9cbef665ed9a6341aa61a33d21189\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: be5b1789a06c57e83254dd212f889ed3\n sig of: Nothing\n@@ -43,24 +43,24 @@\n Data.Barbie.Internal.Product.CanDeriveProductB\n Data.Barbie.Internal.Product.GProductB{Data.Barbie.Internal.Product.gbprod Data.Barbie.Internal.Product.gbuniq}\n Data.Barbie.Internal.Product.ProductB{Data.Barbie.Internal.Product.bprod Data.Barbie.Internal.Product.buniq}\n Data.Barbie.Internal.ProductC.CanDeriveProductBC\n Data.Barbie.Internal.ProductC.GProductBC{Data.Barbie.Internal.ProductC.gbdicts}\n Data.Barbie.Internal.ProductC.ProductBC{Data.Barbie.Internal.ProductC.bdicts}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Prod\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Prod\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB\n Data.Barbie.Internal.Product GHC.Base GHC.Float Data.Orphans\n@@ -72,109 +72,109 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- exports: 97f76e0a31067bdc9623d74dfb179978\n- bunzip 34622e94b56e176a2b34b8a67a6855a4\n- bzip 8ed828546c59d721d6faa4464ad47750\n- bzipWith 4533dac19f2e4b44be72c581c4090d1e\n- bzipWith3 b2544b9a4f69672e9990c4248d54ad9c\n- bzipWith4 63a87badbbf671305bc877f7886035a2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB c915225ce12dec07b484cb0e6c8bc95f\n- exports: 62d29be84a756dd8aa3183dad2a1d146\n- AllB 742934a1aef6759c559e39d90cf8ee7d\n- AllBF 2852bbf285ab6932b0e4764b71b81856\n- ConstraintsB dc18dd2fb15b81c31fdce03ebb848f0f\n- baddDicts 9e213c6aa1b780911ccc0eff66d247dd\n- bmapC bdd35a7e14d54b9b1575987d0382e090\n- bmempty 463212406bd01ecda8db986af75227fd\n- btraverseC 0c7fa01290302656c2c2336197cde099\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- exports: a8196cc20ebeb66df453e15c78d677c9\n- TraversableB 276504176defd37fdae4e05d479e9cc6\n- bfoldMap 14d33185bc8e0b9d6617de4794d0b153\n- bsequence c342788bd922f3596acc43592b92d6ee\n- bsequence' ddba99e0a036e38514b81b4420ddd569\n- btraverse 44638623568081a176cfc6fcc0804dca\n- btraverse_ db6a81411d9b3d9f573baa0f326e7828\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Trivial e8e840d58a71f36f08cf907351677909\n- exports: f2b3ffa6928a822bd57073425bf0c21d\n- Unit 7dad192333f9ffba2f7db338141645a6\n- Unit c1936e142e7230f25a3d66e4ed000254\n- Void 5d92e28d57b6d96e3f5a3ac3e40a4208\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.Wrappers 7958e4aadfb4871559a27df0095b994b\n- exports: 9f5517e3ff8f369efce374339dce99ad\n- Barbie 5b007c31a64e58d86f5c6e69c899c0fd\n- Barbie 543cc7d88fba5fd7fa94489181729f3d\n- getBarbie 6d368f21fe7c0589f6250535ac3d10f7\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.Product 5e5dbf1be237d0122682147891fd427a\n- exports: b3bfa95a17c0f8b277ed3b23015a2153\n- CanDeriveProductB edd1b7310e7e53a3ccd4a0885be96b23\n- GProductB e66eb7bb9eb76ca38e2e7d6fb1df5f74\n- ProductB af99b4f9ab3ced46f9535839b62e919e\n- bprod 4c6a77d799148ca8c6f0108df6a57c89\n- buniq 1d207b4610a72b40ff741fa9aa3a0d9c\n- gbprod 3a423f95b9e20b3f3ec07d9863b93b06\n- gbuniq c7a3608f5aaf1666ca70519b70322c84\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Barbie.Internal.ProductC 9c45b22b47427a7c2e2ba34330e53e75\n- exports: 495c8cdfd60ed954baa7ebb7f5479191\n- CanDeriveProductBC 11db5eeb41bce3f45a8dd0b5d0651ec6\n- GProductBC b7f6551b932973c12941b8b37206ab2a\n- ProductBC 2e32d626c3ad4b9d08b8baf41457da27\n- bdicts 3fb38e2b617286df5448f825c807ec06\n- buniqC f593d3b66be3e7314629e11fbe3669e7\n- gbdicts 3d2edaca452e19c0d90845bfe3d74f77\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Functor.Prod 6960c59919354e78018463de9f95428d\n- exports: 44e655eaed14db1b6bce59ab0030a93c\n- Cons 5fa8aa12acf8c50978bcedc1def15f38\n- Prod 46923a6801bbd445e7f64b45bc2641db\n- Unit 954870f5e4fb7b14f642adc0d8fed081\n- oneTuple 15047fbbfd70729b34ce5eef9c39ff10\n- prod ce6744d0fed199a0f3297258e8b39d71\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ exports: 5b192dab08a0491faf09373600f4b2cd\n+ bunzip 11c04082ef1f526743411828ff5e3b0b\n+ bzip 38f3994007ee30a57645303749d60354\n+ bzipWith bca3958211a37a502853b653649238a6\n+ bzipWith3 0af74d4e86fd92f65a95f59ae545d30a\n+ bzipWith4 6fbf99b5bb16c09aedd72b44a835d3de\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB cb077425686d4bb620c4f51549182b9f\n+ exports: 805180e0c2ac5e4eb5bae7572cee9a36\n+ AllB 1b4f9a291ec9d45a18d31df601e0aeeb\n+ AllBF 63bb86e4a6c471b3a0fb28f25103dd36\n+ ConstraintsB 0e5c16bae977600323d72f12d780df0a\n+ baddDicts 45de3f1644ad793bfa156162f97dcda3\n+ bmapC e9b37dcfce08040e31146f6b7b8674d2\n+ bmempty 67368e786413af9677c05a4fe1067921\n+ btraverseC ed469f93d8768c1e1efcc0e74f86d74e\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ exports: 6564e0103587f68d905c5ccbec42ca55\n+ TraversableB b16eda90a135f995e76c64fdf076422a\n+ bfoldMap 0c258f5bfc94ec71636a457f0c538881\n+ bsequence 0ae024feb9303d386ddf012477d382bb\n+ bsequence' 76f2a385900fef20091423a0bc93fc51\n+ btraverse 2d1803bee429e065a9d4f13a0e12ab46\n+ btraverse_ 60242f95eece2e38ab3dfa24ebca6d72\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Trivial dc4e1c7b489ece1d00e77086237aaa82\n+ exports: d538e05bfbbc0ea212ae5ceedcab88a8\n+ Unit a88e573f0bca8af4d81862878a7ee1dc\n+ Unit a654d0e651ca97ead2ab39e18faca7f6\n+ Void 72c7639709c23990593c7129be2962f0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.Wrappers 43d6d92d6f288625dea9f42a20c3850f\n+ exports: def7f398dd21c52b4a641939c81ad0d7\n+ Barbie b9a68eb4646738b9f4518cc946e66ed9\n+ Barbie 7d2a0f885d17d9961202bcfe87e12623\n+ getBarbie 77076a16715a82e7b992fa0a9eb6f20c\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.Product bc6e15bf1ecbbc6595bdaffefaf80615\n+ exports: f0b0ed3fda32adae110638adb35a2d40\n+ CanDeriveProductB 845de4ab1cbeb9dbb37711d2ac7a7857\n+ GProductB 5042a458bc3ca5e22a02a501ade6dba9\n+ ProductB d39e0a5b1e3c8e26d5a23aeef55d72fc\n+ bprod b85756c801e9d859eb3ed8df8807317e\n+ buniq 261261a4ea38c28e9648955343b224c2\n+ gbprod d511745f35ab00c0cae8cd361a2cc072\n+ gbuniq e71d4902b084f0fc24cd546db6380027\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Barbie.Internal.ProductC 71a40bfeed43f69ea58d65e38995e3da\n+ exports: def6729fa1fe0da7b2508be3a8a7afa6\n+ CanDeriveProductBC ec80d6fa3a7d2c0c33bdfa2208e1e3d0\n+ GProductBC 162da2078952637dbe9e1bcb8e9f1865\n+ ProductBC 19ae595e08df4c786445ee3f1c666a9a\n+ bdicts 601ed286d92f89cc95203fca204673ea\n+ buniqC 1fa34479252669ba572bda3ee8d2132e\n+ gbdicts 585f601f689bc4b48a089d1051e55aa0\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Functor.Prod 40f1c61399630f2acc341720d65ecf92\n+ exports: d97a11b09cefc2c69fafc6efc9af992b\n+ Cons 32ea6779cc7bdf3089a5d8e8eddb9abd\n+ Prod 72871df9eab61fc1dcceb25a27d59350\n+ Unit f8f34641358cb09bf8b4c2ba0ef3bf82\n+ oneTuple 55a3a2e4834f161b6addddb24b107f58\n+ prod 783ee96f7bfd3c24f11aaa471e0ddbde\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Data.Functor.Product 66ae7073fd58f9095ab547fd84d79a73\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n fixities infixr 4 /*, infixr 4 /*/\n-4ad1bb931e91833247afe8e888b033d3\n+5989f7e354528710027ec00cb4b696b6\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-bdb90fe3370f0468e5621d78db6cbd15\n+70b3e593a736396988ffc106521e8006\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-4f6bfec93a652fafb0dd7b79df035554\n+08200cfb6b7a457241ce714bf1b85b79\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Barbie\"#]\n-f7efbc111f784ec50ac2e7cc3d3a3a5a\n+a953f70c9264224b6bbdc3a58d6e0a08\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-aa9e5b0633fa1c6845a922aaa675a36b\n+5b6bc81ea0f8ca992ee5817ae2f84533\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-c0a2ef32d6e72a27bccd4756d3fa7861\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+f005734f14f1a2f7e91077e9026b6820\n (/*) ::\n Data.Barbie.Internal.Product.ProductB b =>\n b f\n -> b (Data.Functor.Prod.Prod fs)\n -> b (Data.Functor.Prod.Prod (f : fs))\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n@@ -202,15 +202,15 @@\n @(*)\n @b\n $dProductB\n @f\n @(Data.Functor.Prod.Prod fs)\n eta\n eta1) }]\n-66fc81db3af4be289241892856422afc\n+ec0a3b7e6eecd320fd7a4a212a2264b7\n (/*/) ::\n Data.Barbie.Internal.Product.ProductB b =>\n b f -> b g -> b (Data.Functor.Prod.Prod '[f, g])\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @b :: (* -> *) -> *\n@@ -235,15 +235,15 @@\n @(*)\n @b\n $dProductB\n @f\n @g\n eta\n eta1) }]\n-3e9a45ed4f97a9cedc72ad8770033644\n+61c0bbec30da61595990fb59a5265cd0\n /*/1 ::\n Data.Functor.Product.Product f g a\n -> Data.Functor.Prod.Prod '[f, g] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(L,L)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @f :: * -> *\n@@ -264,15 +264,15 @@\n @'[g]\n @a\n @g\n @'[]\n @~<'[g]>_N\n g1\n (Data.Functor.Prod.$WUnit @(*) @a)) }]\n-9967ea4715806cd7499671cd694bcb05\n+9fe6da202cd6dbce9b58e55de6e405aa\n /*1 ::\n Data.Functor.Product.Product f (Data.Functor.Prod.Prod fs) a\n -> Data.Functor.Prod.Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1!P(L,ML)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @fs :: [* -> *]\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Barbie.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Barbie.p_hi", "comments": ["Files 76% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Data.Functor.Barbie 9066\n- interface hash: 2632caa1cb2d0df83b4e0121bcbfdfc9\n- ABI hash: 9dafd74b326111f9ee0b678e4b56d097\n- export-list hash: 776dd022e7184a3e3960ac8208304d11\n+ interface hash: 9d2d7e6f96da5a266ef3961d233d9108\n+ ABI hash: cb89b258eede167b2d361dbcd693e5c2\n+ export-list hash: 2d9e067c321d67b0eec7598e2173b9ef\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: a7aa8c351bd48d6391be317daa6f74bf\n sig of: Nothing\n@@ -43,20 +43,20 @@\n Barbies.Internal.ApplicativeB.ApplicativeB{Barbies.Internal.ApplicativeB.bprod Barbies.Internal.ApplicativeB.bpure}\n Barbies.Internal.ConstraintsB.AllBF\n Barbies.Internal.ConstraintsB.ConstraintsB{Barbies.Internal.ConstraintsB.AllB Barbies.Internal.ConstraintsB.baddDicts}\n Barbies.Internal.DistributiveB.DistributiveB{Barbies.Internal.DistributiveB.bdistribute}\n Barbies.Internal.FunctorB.FunctorB{Barbies.Internal.FunctorB.bmap}\n Barbies.Internal.TraversableB.TraversableB{Barbies.Internal.TraversableB.btraverse}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeB\n Barbies.Internal.ConstraintsB Barbies.Internal.DistributiveB\n Barbies.Internal.FunctorB Barbies.Internal.TraversableB GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -66,88 +66,88 @@\n Data.Functor.Compose Data.Functor.Const Data.Functor.Identity\n Data.Functor.Product Data.Functor.Sum Data.Monoid Data.Semigroup\n Data.Semigroup.Internal Data.Type.Ord Data.Version GHC.Generics\n GHC.IO.Exception GHC.IsList GHC.RTS.Flags GHC.Stats Control.DeepSeq\n Data.Tagged Control.Applicative.Backwards\n Control.Monad.Trans.Identity Control.Monad.Trans.Reader\n Data.Functor.Constant Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeB 27b00dfc91c1741bfb2d3c42684e7344\n- exports: 97f76e0a31067bdc9623d74dfb179978\n- ApplicativeB e831de0bd01221227318ff01f360d4cb\n- bprod faa80cda7d5ebacb4d59ff2581e950e5\n- bpure 8f62c3bd94a72cb3e7cb88067b7fc1f0\n- bunzip 34622e94b56e176a2b34b8a67a6855a4\n- bzip 8ed828546c59d721d6faa4464ad47750\n- bzipWith 4533dac19f2e4b44be72c581c4090d1e\n- bzipWith3 b2544b9a4f69672e9990c4248d54ad9c\n- bzipWith4 63a87badbbf671305bc877f7886035a2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsB c915225ce12dec07b484cb0e6c8bc95f\n- exports: 62d29be84a756dd8aa3183dad2a1d146\n- AllB 742934a1aef6759c559e39d90cf8ee7d\n- AllBF 2852bbf285ab6932b0e4764b71b81856\n- ConstraintsB dc18dd2fb15b81c31fdce03ebb848f0f\n- baddDicts 9e213c6aa1b780911ccc0eff66d247dd\n- bdicts eb562e059c0b85eb1b87b13a0dd3252a\n- bfoldMapC 8fdb140fabce3bf6ad1f2739646317d8\n- bmapC bdd35a7e14d54b9b1575987d0382e090\n- bmempty 463212406bd01ecda8db986af75227fd\n- bpureC d87a8a078ca1bb1cba753e8896b062dc\n- btraverseC 0c7fa01290302656c2c2336197cde099\n- bzipWith3C 4bbaa65bed1c3a8013ead5fd1cfae5a8\n- bzipWith4C 74930d6ff6579d7f049bebed51131c30\n- bzipWithC c8bd0d3ffccf02d14b0e98a2ac4957c1\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveB 80d56ad2686884e1a31fedb7de368c13\n- exports: 67f047624c17612bc49b9fde883b9428\n- DistributiveB abc18a05f635f61b778ca554da2cea91\n- bcotraverse 5b137986834428d60f93c388b01f2dfd\n- bdecompose 09b00b94e8b880130b026e824bcbf703\n- bdistribute 929c6e7742bbab510e6a6048e74a3699\n- bdistribute' 896f1efd92130f4e15b5ad9acc0dae93\n- brecompose 62de9518f265581b2d8bc112fc936ade\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorB 5215c73425d0f8767ce576b78637b89c\n- exports: ae757957079040973e48be398804a0fe\n- FunctorB 2039eedef490295ecfb676fcb2520788\n- bmap 353efbf15cb6b4e2b1722efe83fb4018\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableB b69366efe3ba5e39658c918b8401e4c9\n- exports: a8196cc20ebeb66df453e15c78d677c9\n- TraversableB 276504176defd37fdae4e05d479e9cc6\n- bfoldMap 14d33185bc8e0b9d6617de4794d0b153\n- bsequence c342788bd922f3596acc43592b92d6ee\n- bsequence' ddba99e0a036e38514b81b4420ddd569\n- btraverse 44638623568081a176cfc6fcc0804dca\n- btraverse_ db6a81411d9b3d9f573baa0f326e7828\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeB 32ce9f9db11093baaf3db99a633f6b50\n+ exports: 5b192dab08a0491faf09373600f4b2cd\n+ ApplicativeB 16deedde4d173b65d0723755e5a93713\n+ bprod 8e131e15a5f98601851c0b27ac4241c0\n+ bpure e8e39b317ff94f27399a39d7e16b86a9\n+ bunzip 11c04082ef1f526743411828ff5e3b0b\n+ bzip 38f3994007ee30a57645303749d60354\n+ bzipWith bca3958211a37a502853b653649238a6\n+ bzipWith3 0af74d4e86fd92f65a95f59ae545d30a\n+ bzipWith4 6fbf99b5bb16c09aedd72b44a835d3de\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsB cb077425686d4bb620c4f51549182b9f\n+ exports: 805180e0c2ac5e4eb5bae7572cee9a36\n+ AllB 1b4f9a291ec9d45a18d31df601e0aeeb\n+ AllBF 63bb86e4a6c471b3a0fb28f25103dd36\n+ ConstraintsB 0e5c16bae977600323d72f12d780df0a\n+ baddDicts 45de3f1644ad793bfa156162f97dcda3\n+ bdicts e07f5a7ebb838629173d9923292efbda\n+ bfoldMapC 10664cc3bb59672088e1f9e7b5901501\n+ bmapC e9b37dcfce08040e31146f6b7b8674d2\n+ bmempty 67368e786413af9677c05a4fe1067921\n+ bpureC a370fb71249c97e99513b1f6d3e55713\n+ btraverseC ed469f93d8768c1e1efcc0e74f86d74e\n+ bzipWith3C fb97dfb54d0e016efc07adbe405ebdc6\n+ bzipWith4C 93646da27a6ecb575b9979eba8a98445\n+ bzipWithC 882709786427a2557e9b9ec6b5f9f691\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveB 86907d3a2f9542c8a7e9eb0c9e39c2e1\n+ exports: 35baad0665225d23105900c3f9071c68\n+ DistributiveB e760f6db15922c1a6bf57e10ddec6cce\n+ bcotraverse a8a061943b1c3b24388fd821cae4be7b\n+ bdecompose 0142f5300f444349da9d515d163638ab\n+ bdistribute f52af13b3c0cdea06e2fe6da23fac44c\n+ bdistribute' 63900afaf615a8e78a6f402034631215\n+ brecompose 110986f7d420332c06f6d3ded0bdc876\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorB 33fac1937871e3c31a09713b2ed12108\n+ exports: 72737807c29b596e79548733975e0291\n+ FunctorB 0846d81162bf82239d06a8cc310f49f3\n+ bmap 2ae314fd6462df0765e64900c0d8fc90\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableB b9e873dc2abb3de19a48edc0b46ae5d1\n+ exports: 6564e0103587f68d905c5ccbec42ca55\n+ TraversableB b16eda90a135f995e76c64fdf076422a\n+ bfoldMap 0c258f5bfc94ec71636a457f0c538881\n+ bsequence 0ae024feb9303d386ddf012477d382bb\n+ bsequence' 76f2a385900fef20091423a0bc93fc51\n+ btraverse 2d1803bee429e065a9d4f13a0e12ab46\n+ btraverse_ 60242f95eece2e38ab3dfa24ebca6d72\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-65873122537c2ba57cc2b8d4dae76dfb\n+681805e536789381d8151f57ce937fd4\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2776e7abe605101a7a149d35badd9ed3\n+14e5ab0977132b50cbb52e9ab3df1bb7\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-6400a01644fdbf90a755c4458560116f\n+bf0ae37cb18471a8d83e7df10195f534\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Barbie\"#]\n-3aa1711702c227bb02b0e0e7cd543db4\n+14eff0f6b0b48853f03f3f252ab0e410\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-76734505e2524cdf94c4645cb12993f8\n+31bf146df172e8cf03988dcc816f6320\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Prod.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Prod.p_hi", "comments": ["Files 99% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Data.Functor.Prod 9066\n- interface hash: 79fba61ec847792b5192c84a57632a7f\n- ABI hash: 6960c59919354e78018463de9f95428d\n- export-list hash: 44e655eaed14db1b6bce59ab0030a93c\n+ interface hash: 58aba9af48649d03526d4e96ef637e02\n+ ABI hash: 40f1c61399630f2acc341720d65ecf92\n+ export-list hash: d97a11b09cefc2c69fafc6efc9af992b\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: 2247f669944f894b7306728dde65e832\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 610d6ae8793d64642444a356c490f3f6\n sig of: Nothing\n@@ -46,15 +46,15 @@\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Traversable b38661fca93ceff246503f73c10b2c46\n import -/ GHC.Base 5a01ca574e3fc3196c3612cbcf5879b9\n import -/ GHC.Show 43ee6873466de083d2b7ce9578f828dc\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n import -/ GHC.Classes 448b501d99f99154cdcc210e9f32fa08\n import -/ GHC.Types 40ada155ed73681c14b0e90149f6df94\n-d2fd1c9756964a29b2ee94b3b2d3a8d1\n+9e5b604faf999f984c0010faa01877fa\n $fAlternativeProd ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n GHC.Base.Alternative (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -65,55 +65,55 @@\n (v1['GHC.Types.Many] :: GHC.Base.Alternative (Prod fs)).\n @(Prod (f : fs))\n ($fAlternativeProd_$cp1Alternative @f @fs v v1)\n ($fAlternativeProd_$cempty @f @fs v v1)\n ($fAlternativeProd_$c<|> @f @fs v v1)\n ($fAlternativeProd_$csome @f @fs v v1)\n ($fAlternativeProd_$cmany @f @fs v v1)]\n-d02581099c849866f55aa480524e8a96\n+fa429d594544ef712e8e060fd6a80cf7\n $fAlternativeProd0 :: GHC.Base.Alternative (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Alternative], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fApplicativeProd0\n ($WUnit @(*))\n $fAlternativeProd0_$c<|>\n $fAlternativeProd0_$csome\n $fAlternativeProd0_$csome]\n-13f5908478052ee580fec37db6f59384\n+df7680338eb427a0b502569ba37456d4\n $fAlternativeProd0_$c<|> :: Prod '[] a -> Prod '[] a -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n (ds['GHC.Types.Many] :: Prod '[] a)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds of wild { Unit co ->\n case ds1 of wild1 { Unit co1 -> $WUnit @(*) @a } }]\n-ff0e65bc81800fc3326131c448bf596b\n+dce3f3e15890b9f9fee5d62734f89d87\n $fAlternativeProd0_$csome :: Prod '[] a -> Prod '[] [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: b, CPR: b,\n Unfolding: Core: \n \\ @a (eta['GHC.Types.Many] :: Prod '[] a) ->\n letrec {\n some_v :: Prod '[] [a] [Strictness: b]\n = case eta of wild { Unit co -> some_v }\n } in\n some_v]\n-6329adb01fd614abfd3ace22bbfc44cd\n+25f9f30acf295953126da599d4028013\n $fAlternativeProd1 :: a -> [a] -> [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @a (ds['GHC.Types.Many] :: a) (ds1['GHC.Types.Many] :: [a]) ->\n GHC.Types.: @a ds ds1]\n-41f3c22637694426d2cc91dead1fc938\n+057c3a8dab52f1bdd80aeadf61f226ec\n $fAlternativeProd_$c<|> ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -141,15 +141,15 @@\n g `cast` (Sub (SelCo:Tc(1) (Sym co1)) _N))\n (GHC.Base.<|>\n @(Prod fs)\n $dAlternative1\n @a\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R\n gs `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-6471fe23deedd8d1b22e4f00f7813e72\n+fa90253c3ed2200f0af3a2ff8f29cb40\n $fAlternativeProd_$cempty ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -162,15 +162,15 @@\n @(f : fs)\n @a\n @f\n @fs\n @~_N\n (GHC.Base.empty @f $dAlternative @a)\n (GHC.Base.empty @(Prod fs) $dAlternative1 @a)]\n-cacde4105edec44237bc9dd83c22665a\n+8fbefc93d518e57219dc4ccbbecace18\n $fAlternativeProd_$cliftA2 ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n (a -> b -> c)\n -> Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n@@ -228,15 +228,15 @@\n (GHC.Base.<*>\n @(Prod fs)\n $dApplicative1\n @b\n @c\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) c>_N)_R\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-ea5cc9cccb5debbc5c10e89931d88159\n+c76c11cd66018a4318aea9108ddd9ad1\n $fAlternativeProd_$cmany ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -283,15 +283,15 @@\n @(Prod fs)\n $dAlternative1\n @[a]\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) <[a]>_N)_R\n (GHC.Base.pure @(Prod fs) $dApplicative @[a] (GHC.Types.[] @a))) }\n } in\n many_v]\n-6492e8474ca8ddbc4745194a2e5af1f4\n+22b7644fcc820ec3a80ce8657829f865\n $fAlternativeProd_$cp1Alternative ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n GHC.Base.Applicative (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -301,15 +301,15 @@\n ($dAlternative1['GHC.Types.Many] :: GHC.Base.Alternative\n (Prod fs)) ->\n $fApplicativeProd\n @f\n @fs\n (GHC.Base.$p1Alternative @f $dAlternative)\n (GHC.Base.$p1Alternative @(Prod fs) $dAlternative1)]\n-3baacf93c1323f6a2c9eff2e23203638\n+747352584abb6207422d7a2c399f09aa\n $fAlternativeProd_$csome ::\n (GHC.Base.Alternative f, GHC.Base.Alternative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) [a]\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -356,15 +356,15 @@\n @(Prod fs)\n $dAlternative1\n @[a]\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) <[a]>_N)_R\n (GHC.Base.pure @(Prod fs) $dApplicative @[a] (GHC.Types.[] @a))) })\n } in\n some_v]\n-b997f4e382374bd39c075e108939782e\n+314d4404ca633c8ec99a53b4e8b36164\n $fApplicativeProd ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n GHC.Base.Applicative (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -376,88 +376,88 @@\n @(Prod (f : fs))\n ($fApplicativeProd_$cp1Applicative @f @fs v v1)\n ($fApplicativeProd_$cpure @f @fs v v1)\n ($fApplicativeProd_$c<*> @f @fs v v1)\n ($fAlternativeProd_$cliftA2 @f @fs v v1)\n ($fApplicativeProd_$c*> @f @fs v v1)\n ($fApplicativeProd_$c<* @f @fs v v1)]\n-f69d0eaef85d2bd573083a5ccbcbf39e\n+d11faec4ca4e067a66222af646040f2a\n $fApplicativeProd0 :: GHC.Base.Applicative (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Applicative], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fFunctorProd0\n $fApplicativeProd0_$cpure\n $fApplicativeProd0_$c<*>\n $fApplicativeProd0_$cliftA2\n $fApplicativeProd0_$c*>\n $fApplicativeProd0_$c<*]\n-33f5901fec4a528e1eb494ddf21b0788\n+9cc97fda22e013683967150d38775350\n $fApplicativeProd0_$c*> :: Prod '[] a -> Prod '[] b -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] b) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> $WUnit @(*) @b } }]\n-4a2e24b42db02957c1d40c78d3c67fbc\n+44a251d9a818bf6433ac3a8d914e97e0\n $fApplicativeProd0_$c<* :: Prod '[] a -> Prod '[] b -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (eta1['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: Prod '[] b) ->\n case eta1 of wild { Unit co ->\n case eta of wild1 { Unit co1 -> $WUnit @(*) @a } }]\n-7f9d8b436c1275a9df6e8948dd40ca7b\n+216119fcf2d25984791bffeef7393760\n $fApplicativeProd0_$c<*> ::\n Prod '[] (a -> b) -> Prod '[] a -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: \n \\ @a\n @b\n (ds['GHC.Types.Many] :: Prod '[] (a -> b))\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds of wild { Unit co ->\n case ds1 of wild1 { Unit co1 -> $WUnit @(*) @b } }]\n-55f199bcf83653f621c3318b0674474f\n+4be90ac3927f3977af4c21cf7c84116d\n $fApplicativeProd0_$cliftA2 ::\n (a -> b -> c) -> Prod '[] a -> Prod '[] b -> Prod '[] c\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L><1L>, CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n @c\n (eta['GHC.Types.Many] :: a -> b -> c)\n (eta1['GHC.Types.Many] :: Prod '[] a)\n (eta2['GHC.Types.Many] :: Prod '[] b) ->\n case eta1 of wild { Unit co ->\n case eta2 of wild1 { Unit co1 -> $WUnit @(*) @c } }]\n-f2d03e93c518ae12d9655d152b906d1e\n+adfafd399935fc76bf42eeccba70dae3\n $fApplicativeProd0_$cpure :: a -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (ds['GHC.Types.Many] :: a) -> $WUnit @(*) @a]\n-14852efd869d910610875b74edaede4c\n+8964c0af7ce9a43f005e692ebc663333\n $fApplicativeProd1 :: a -> b -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @b @a (ds['GHC.Types.Many] :: a) -> GHC.Base.id @b]\n-3d4e348ea5b1d5aa90f23572adee0f73\n+9c844ab571f9df1093e4074f81d0950b\n $fApplicativeProd_$c*> ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -500,15 +500,15 @@\n @(Prod fs)\n (GHC.Base.$p1Applicative @(Prod fs) $dApplicative1)\n @a\n @(b -> b)\n ($fApplicativeProd1 @b @a)\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R)\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-9c6b8f987c83e71a3fc8f8558a73261c\n+af4b35e446ae837f0fc01dfcf15688de\n $fApplicativeProd_$c<* ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) b -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -522,15 +522,15 @@\n @fs\n $dApplicative\n $dApplicative1\n @a\n @b\n @a\n (GHC.Base.const @a @b)]\n-7fc39635cb6fc0e80a45f5a43afa2d15\n+2e153d96e8e3990ca8bae318c372ccd2\n $fApplicativeProd_$c<*> ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n Prod (f : fs) (a -> b) -> Prod (f : fs) a -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L><1L>,\n Unfolding: Core: \n@@ -561,15 +561,15 @@\n (GHC.Base.<*>\n @(Prod fs)\n $dApplicative1\n @a\n @b\n fs2 `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) b>_N)_R\n as `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co1)) _N)_R) } }]\n-dd73fc4a106bfd43337f6b09ce313e89\n+cb047149d84b05af2ae0e4ffa3806f0e\n $fApplicativeProd_$cp1Applicative ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -579,15 +579,15 @@\n ($dApplicative1['GHC.Types.Many] :: GHC.Base.Applicative\n (Prod fs)) ->\n $fFunctorProd\n @f\n @fs\n (GHC.Base.$p1Applicative @f $dApplicative)\n (GHC.Base.$p1Applicative @(Prod fs) $dApplicative1)]\n-ba0d9a29dffdfa9980d4612bb430edf8\n+bb68754d97d8827522d362b222fb2675\n $fApplicativeProd_$cpure ::\n (GHC.Base.Applicative f, GHC.Base.Applicative (Prod fs)) =>\n a -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n Strictness: ,\n Unfolding: Core: \n@@ -602,15 +602,15 @@\n @(f : fs)\n @a\n @f\n @fs\n @~_N\n (GHC.Base.pure @f $dApplicative @a a1)\n (GHC.Base.pure @(Prod fs) $dApplicative1 @a a1)]\n-6dd69adcce3c61218ec7aa1af0711c65\n+a1dd5987beccf763a1af208d06cdb17c\n $fEq1Prod ::\n (Data.Functor.Classes.Eq1 f, Data.Functor.Classes.Eq1 (Prod fs)) =>\n Data.Functor.Classes.Eq1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -619,35 +619,35 @@\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: Data.Functor.Classes.Eq1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs)).\n @(Prod (f : fs))\n (\\ @a ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a) ->\n $fEqProd @f @a @fs v $dEq v1)\n ($fEq1Prod_$cliftEq @f @fs v v1)]\n-9370d8c58c16f2958fba21167c797359\n+4d2c63d7dab9a32e0e4699934e186152\n $fEq1Prod0 :: Data.Functor.Classes.Eq1 (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Eq1], Inline: CONLIKE,\n Unfolding: DFun:. @(Prod '[]) $fEqProd0 $fEq1Prod0_$cliftEq]\n-438ec1b6f47422dd779cce9d2575830b\n+23fda07af6dc5ed8bed088d43eb9f066\n $fEq1Prod0_$cliftEq ::\n (a -> b -> GHC.Types.Bool)\n -> Prod '[] a -> Prod '[] b -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 2,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b -> GHC.Types.Bool)\n (ds1['GHC.Types.Many] :: Prod '[] a)\n (ds2['GHC.Types.Many] :: Prod '[] b) ->\n case ds1 of wild { Unit co ->\n case ds2 of wild1 { Unit co1 -> GHC.Types.True } }]\n-6e10b4c6db834ec39995ee3ffae32009\n+3f660676da91732acf4ea101ad173244\n $fEq1Prod_$cliftEq ::\n (Data.Functor.Classes.Eq1 f, Data.Functor.Classes.Eq1 (Prod fs)) =>\n (a -> b -> GHC.Types.Bool)\n -> Prod (f : fs) a -> Prod (f : fs) b -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -687,15 +687,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-43ff39f0993415f8a586f2fc954ee895\n+6cf535b83250a530f96262560462b970\n $fEqProd ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n GHC.Classes.Eq (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -706,39 +706,39 @@\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: Data.Functor.Classes.Eq1 f)\n (v1['GHC.Types.Many] :: GHC.Classes.Eq a)\n (v2['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs)).\n @(Prod (f : fs) a)\n ($fEqProd_$c== @f @a @fs v v1 v2)\n ($fEqProd_$c/= @f @a @fs v v1 v2)]\n-c266d889a997fb68e60f0ed941b6ab54\n+9d907fd95f97d766fdc07255e10c6979\n $fEqProd0 :: GHC.Classes.Eq a => GHC.Classes.Eq (Prod '[] a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Classes.Eq a).\n @(Prod '[] a)\n (\\ (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> GHC.Types.True } })\n ($fEqProd0_$c/= @a v)]\n-86d3d480d2c796247409b334ff27a87c\n+7978c22d50c26e7867cf690528f5b0fd\n $fEqProd0_$c/= ::\n GHC.Classes.Eq a => Prod '[] a -> Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 1, Inline: (sat-args=2),\n Unfolding: Core: StableUser <3,FalseFalse>\n \\ @a\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n (eta['GHC.Types.Many] :: Prod '[] a)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n case eta of wild { Unit co ->\n case eta1 of wild1 { Unit co1 -> GHC.Types.False } }]\n-aad81c946173d0e01751b5098db884d2\n+27fd6f940559c088c0c3ea20d6b19c8a\n $fEqProd_$c/= ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -751,15 +751,15 @@\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n ($dEq2['GHC.Types.Many] :: Data.Functor.Classes.Eq1 (Prod fs))\n (eta['GHC.Types.Many] :: Prod (f : fs) a)\n (eta1['GHC.Types.Many] :: Prod (f : fs) a) ->\n case $fEqProd_$c== @f @a @fs $dEq1 $dEq $dEq2 eta eta1 of wild {\n GHC.Types.False -> GHC.Types.True\n GHC.Types.True -> GHC.Types.False }]\n-8ec3a91b57e879a609b808fe8e9b496e\n+70c4b9ecaa95a9d1da9dab20d81807a1\n $fEqProd_$c== ::\n (Data.Functor.Classes.Eq1 f, GHC.Classes.Eq a,\n Data.Functor.Classes.Eq1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -801,15 +801,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-bfcb7958d9a8a9e77d014080c0649dd3\n+85575f0393e3257d05b2e23b457eeb64\n $fFoldableProd ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Data.Foldable.Foldable (Prod (f : fs))\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Inline: CONLIKE,\n@@ -848,15 +848,15 @@\n ($fFoldableProd1 @f @fs v v1)\n `cast`\n (forall (a :: <*>_N).\n _R\n %<'GHC.Types.Many>_N ->_R _R\n %<'GHC.Types.Many>_N ->_R Data.Semigroup.Internal.N:Product[0]\n _R)]\n-5393a153cd897d447754507c4a0f4270\n+867d462d11a900de8c45de298120b4b5\n $fFoldableProd0 :: Data.Foldable.Foldable (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Foldable.C:Foldable], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n (\\ @m\n@@ -875,126 +875,126 @@\n $fFoldableProd0_$cnull\n $fFoldableProd0_$clength\n $fFoldableProd13\n $fFoldableProd0_$cmaximum\n $fFoldableProd0_$cminimum\n $fFoldableProd12\n $fFoldableProd11]\n-355aaececf7508647d44df73b85a14ac\n+f207818c3c93de324b34b97402b2ce9c\n $fFoldableProd0_$cfoldMap' ::\n GHC.Base.Monoid m => (a -> m) -> Prod '[] a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1L,A,A)>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @m\n @a\n ($dMonoid['GHC.Types.Many] :: GHC.Base.Monoid m)\n (eta['GHC.Types.Many] :: a -> m)\n (eta1['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Base.mempty @m $dMonoid]\n-2715300049605b01223e1780ed749e9e\n+2929aefd9752ff8217b56ffc04be00ea\n $fFoldableProd0_$cfoldl :: (b -> a -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @b\n @a\n (eta['GHC.Types.Many] :: b -> a -> b)\n (eta1['GHC.Types.Many] :: b)\n (eta2['GHC.Types.Many] :: Prod '[] a) ->\n eta1]\n-bf33179345a11366fd8ef96705dff558\n+4a86f3e2d463a377064e43a54ce93285\n $fFoldableProd0_$cfoldl' :: (b -> a -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>, Inline: (sat-args=2),\n Unfolding: Core: StableUser <2,FalseTrue>\n \\ @b\n @a\n (f['GHC.Types.Many] :: b -> a -> b)\n (z0['GHC.Types.Many] :: b)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n z0]\n-2d614392730a859cceb436ca373f488d\n+c445b2092fe1d483c43b7cc522582a76\n $fFoldableProd0_$cfoldl1 :: (a -> a -> a) -> Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (f['GHC.Types.Many] :: a -> a -> a)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n $fFoldableProd14]\n-0a6c7d3fff9ba675e6afd0807a3d4864\n+719f5909da9f60f9702b17879fec5ee0\n $fFoldableProd0_$cfoldr :: (a -> b -> b) -> b -> Prod '[] a -> b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (f['GHC.Types.Many] :: a -> b -> b)\n (z['GHC.Types.Many] :: b)\n (t1['GHC.Types.Many] :: Prod '[] a) ->\n z]\n-2acc293bf731da6b9d899cccb9739b2c\n+e4a6425a70493d398490af226d0914bd\n $fFoldableProd0_$cfoldr1 :: (a -> a -> a) -> Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (f['GHC.Types.Many] :: a -> a -> a)\n (xs['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n $fFoldableProd16]\n-1591727ab229b813a359974a7183da34\n+1aa741a05c694b1959ba7ac9ca06e641\n $fFoldableProd0_$clength :: Prod '[] a -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (xs['GHC.Types.Many] :: Prod '[] a) -> $fFoldableProd4]\n-10fc8dfa3773d3c6d061e1100f258c90\n+9c74c99068f20a79943e2ca9f2eb9b5e\n $fFoldableProd0_$cmaximum :: GHC.Classes.Ord a => Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a)\n (eta['GHC.Types.Many] :: Prod '[] a)[OneShot] ->\n $w$cmaximum @a GHC.Prim.(##)]\n-85cf510a5bd7eb3f1336b2b9b818f9d1\n+e4c276c4a6a621dc76427c5f52cb46fa\n $fFoldableProd0_$cminimum :: GHC.Classes.Ord a => Prod '[] a -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a)\n (eta['GHC.Types.Many] :: Prod '[] a)[OneShot] ->\n $w$cminimum @a GHC.Prim.(##)]\n-29c59c3873629bc4bdfc7d535b880248\n+96fafd1ad9f8976556c8c02c751fc29a\n $fFoldableProd0_$cnull :: Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 2,\n Unfolding: Core: StableSystem <1,TrueTrue>\n \\ @a (t1['GHC.Types.Many] :: Prod '[] a) -> GHC.Types.True]\n-769affa520f9e6770a820fb318aeb5b5\n+5e1feb3afa748286912f7071327ea099\n $fFoldableProd0_$ctoList :: Prod '[] a -> [a]\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , CPR: 1, Inline: (sat-args=1),\n Unfolding: Core: StableUser <1,FalseFalse>\n \\ @a (t1['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Base.build\n @a\n (\\ @b\n (c['GHC.Types.Many] :: a -> b -> b)[OneShot]\n (n['GHC.Types.Many] :: b)[OneShot] ->\n n)]\n-69b29e34cf709f795dbc2e597f7a462f\n+765fe706e04a4fb01ae513edcbdcf033\n $fFoldableProd1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Num.Num a) =>\n Prod (f : fs) a -> Data.Semigroup.Internal.Product a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1014,73 +1014,73 @@\n @a\n (Data.Semigroup.Internal.$fMonoidProduct @a $dNum)\n (\\ (ds['GHC.Types.Many] :: a) -> ds)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Product[0]\n _R))]\n-ad24b9d4ac30d2c50640b17fbb8d4d75\n+7a6372e0a9d6e03916dba89989f787aa\n $fFoldableProd10 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual\n (Data.Semigroup.Internal.Endo (b -> b)))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @b ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo (b -> b))\n (Data.Semigroup.Internal.$fMonoidEndo @(b -> b))]\n-89d36385e10d4f5d924b90e4bd1640b3\n+cedd79bc640d88db2ceba030d761105a\n $fFoldableProd11 :: GHC.Num.Num a => Prod '[] a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,A,A,A,A,A,1C(1,L))>, Inline:,\n Unfolding: Core: StableUser <2,TrueTrue>\n \\ @a\n ($dNum['GHC.Types.Many] :: GHC.Num.Num a)\n (eta['GHC.Types.Many] :: Prod '[] a) ->\n Data.Semigroup.Internal.$fMonoidProduct1 @a $dNum]\n-42c00bfbbaf64624f904614eb84b6820\n+6db7715f3267c45d0926239d6abe2140\n $fFoldableProd12 :: GHC.Num.Num a => Prod '[] a -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(A,A,A,A,A,A,1C(1,L))>, Inline:,\n Unfolding: Core: StableUser <2,TrueTrue>\n \\ @a\n ($dNum['GHC.Types.Many] :: GHC.Num.Num a)\n (eta['GHC.Types.Many] :: Prod '[] a) ->\n Data.Semigroup.Internal.$fMonoidSum1 @a $dNum]\n-f9d87cf560ac5b8530148e5f8bc9158b\n+3decceff816a13d9e7dc8c34201b29c5\n $fFoldableProd13 ::\n GHC.Classes.Eq a => a -> Prod '[] a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n ($dEq['GHC.Types.Many] :: GHC.Classes.Eq a)\n (eta['GHC.Types.Many] :: a)\n (ds['GHC.Types.Many] :: Prod '[] a) ->\n GHC.Types.False]\n-9f00bdabdfd557a90df2bad65da614fc\n+51ec32caffcafe7597f19776378746d8\n $fFoldableProd14 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fFoldableProd15]\n-4ab699c5ac50fe447440a7987f00ac88\n+59b361a663e88805ba2ef85570091c8a\n $fFoldableProd15 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"foldl1: empty structure\"#]\n-410adac3e3d87107a8f8d4979a3f6cda\n+e32b6e6033da1df547da2a1e120ce447\n $fFoldableProd16 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n GHC.CString.unpackCString# $fFoldableProd17]\n-07818e51b50aed348fd6087f05dda326\n+5739d43836f5ced5902da684dc0ef4a1\n $fFoldableProd17 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"foldr1: empty structure\"#]\n-8a8b693e17b0290381c048d2bc343487\n+44cb7b7201b1b3c108c903f02ea08d0e\n $fFoldableProd2 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Num.Num a) =>\n Prod (f : fs) a -> Data.Semigroup.Internal.Sum a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1100,15 +1100,15 @@\n @a\n (Data.Semigroup.Internal.$fMonoidSum @a $dNum)\n (\\ (ds['GHC.Types.Many] :: a) -> ds)\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Sum[0]\n _R))]\n-7c438b1e20419f602e10d632ca4b7e52\n+95f99c2213bedeaf7d797b23ffd89bc6\n $fFoldableProd3 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Eq a) =>\n a -> Prod (f : fs) a -> Data.Semigroup.Internal.Any\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: ,\n Unfolding: Core: \n@@ -1151,62 +1151,62 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Any[0]))\n fas\n GHC.Types.True\n -> GHC.Types.True\n `cast`\n (Sym (Data.Semigroup.Internal.N:Any[0])) } }]\n-37e9309f30cb45328d558446a6daf322\n+a549b2161882e426e07e659a56e5c344\n $fFoldableProd4 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 0#]\n-bfae15141012ec47c4a1e3edd96c59c9\n+e1f7d6a6051795d2b104411a70a4c58d\n $fFoldableProd5 ::\n a\n -> (GHC.Types.Int -> GHC.Types.Int)\n -> GHC.Types.Int\n -> GHC.Types.Int\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1C(1,L)><1!P(L)>,\n Unfolding: Core: StableSystem <3,TrueFalse>\n \\ @a\n (ds['GHC.Types.Many] :: a)\n (ds1['GHC.Types.Many] :: GHC.Types.Int -> GHC.Types.Int)\n (v['GHC.Types.Many] :: GHC.Types.Int)[OneShot] ->\n case v of z { GHC.Types.I# ipv ->\n ds1 (GHC.Types.I# (GHC.Prim.+# ipv 1#)) }]\n-14b3a2210c21d1e47b3e4e64162fdced\n+399f423a741887f8be30fd1fd27ca6bd\n $fFoldableProd6 :: a -> GHC.Types.Bool -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n (ds['GHC.Types.Many] :: a)\n (ds1['GHC.Types.Many] :: GHC.Types.Bool) ->\n GHC.Types.False]\n-9495725131453ae9e7c4b89050543ce8\n+ac813c197874437c1bd8357625ba630a\n $fFoldableProd7 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-523abbb1357c93d65129c97baf25a784\n+92d0da61c41b14a6cdb188bd2a5ac594\n $fFoldableProd8 ::\n GHC.Base.Monoid\n (Data.Semigroup.Internal.Dual (Data.Semigroup.Internal.Endo b))\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n \\ @b ->\n Data.Semigroup.Internal.$fMonoidDual\n @(Data.Semigroup.Internal.Endo b)\n (Data.Semigroup.Internal.$fMonoidEndo @b)]\n-b10ad345472c2f7de668d5abf15a2014\n+2f7220d401861305a7345264266bb6e6\n $fFoldableProd9 :: a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= True),\n Strictness: b, CPR: b]\n-7a2daa71eb24c3fa6f403d580074d49f\n+52400307f6657f0905b41c5f0e1950d0\n $fFoldableProd_$cfold ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n Prod (f : fs) m -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Inline: (sat-args=0),\n@@ -1222,15 +1222,15 @@\n @fs\n $dFoldable\n $dFoldable1\n @m\n @m\n $dMonoid\n (GHC.Base.id @m)]\n-9c7a6c18410b8b69f59de3e8d5b21445\n+1bad42d1c01dc31b88fef922777cc24f\n $fFoldableProd_$cfoldMap ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n (a -> m) -> Prod (f : fs) a -> m\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -1261,15 +1261,15 @@\n `cast`\n (Data.Foldable.Foldable (Prod <*>_N (SelCo:Tc(2) co))_N)_R\n @m\n @a\n $dMonoid\n f1\n fas) }]\n-e6f0e846083131ce27f102ba9d664984\n+9897affe8611cfc875edd507c7c0d4a3\n $fFoldableProd_$cfoldMap' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Base.Monoid m) =>\n (a -> m) -> Prod (f : fs) a -> m\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n@@ -1324,15 +1324,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n m>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] m>_R)\n (GHC.Base.id @m))\n (GHC.Base.mempty @m $dMonoid) }]\n-c81fead342660d96465ad3c1d8c7ec85\n+f8f387fc03fcea2da63b220a9a631ab0\n $fFoldableProd_$cfoldl ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (b -> a -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1378,15 +1378,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n eta1) }]\n-e67c040fe7ae4af11fbe19a665b6352d\n+86afe4723a0280d0bc3fbfa44d5e24c3\n $fFoldableProd_$cfoldl' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (b -> a -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Inline: (sat-args=2),\n Unfolding: Core: StableUser <4,FalseFalse>\n@@ -1435,15 +1435,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n b>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] b>_R)\n (GHC.Base.id @b))\n eta1 }]\n-41b9f905adcf3b7feb642ab8048848a1\n+33056f671e30dbc17c4bbb9e076ba24d\n $fFoldableProd_$cfoldl1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> a -> a) -> Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1505,15 +1505,15 @@\n _R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] _R))\n (GHC.Maybe.Nothing @a)) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableProd7 @a GHC.Maybe.Just v -> v } }]\n-bed74a1e6b0ec6649d3c06f58913643a\n+866060a25988499dd9950a4c055cb694\n $fFoldableProd_$cfoldr ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> b -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1553,15 +1553,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n z) }]\n-966bc21e360f05be6894a34302550d54\n+a7174f510cee4f89446fb2d47f09b211\n $fFoldableProd_$cfoldr' ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> b -> b) -> b -> Prod (f : fs) a -> b\n [LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1616,15 +1616,15 @@\n b>_R)))\n fa)\n `cast`\n (Data.Semigroup.Internal.N:Dual[0]\n (Data.Semigroup.Internal.N:Endo[0] b>_R))\n (GHC.Base.id @b))\n z0 }]\n-c9e7752608f923dcf22c91b580eea6ca\n+91a24477778e5bcd291cc5286c04c46d\n $fFoldableProd_$cfoldr1 ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n (a -> a -> a) -> Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1680,15 +1680,15 @@\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n (GHC.Maybe.Nothing @a)) of wild1 {\n GHC.Maybe.Nothing -> $fFoldableProd9 @a GHC.Maybe.Just v -> v } }]\n-0c69fe78bad62d3a571fc4737f5fdb9a\n+9c8b168dbf86d2a74e86dc1bdc408b0f\n $fFoldableProd_$clength ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> GHC.Types.Int\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1730,15 +1730,15 @@\n GHC.Types.Int>_R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0]\n GHC.Types.Int>_R)\n (GHC.Base.id @GHC.Types.Int))\n $fFoldableProd4 }]\n-4abbbbc447849cf2869b793fb89ef1c1\n+094ae9182e95e0d6c7af50658dabc920\n $fFoldableProd_$cmaximum ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Ord a) =>\n Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1780,15 +1780,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Max[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Max[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-7af86c89dcdadae12687fd02ebd24462\n+86e2a903127a1ebaf8e6fe2a2e126249\n $fFoldableProd_$cminimum ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs),\n GHC.Classes.Ord a) =>\n Prod (f : fs) a -> a\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: ,\n Inline:,\n@@ -1830,15 +1830,15 @@\n `cast`\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Functor.Utils.N:Min[0]) _N)\n x)\n `cast`\n (Data.Functor.Utils.N:Min[0] _N) of wild {\n GHC.Maybe.Nothing -> d GHC.Maybe.Just v -> v }]\n-0ef7d28a63bdb1be5d07be845a2d4b58\n+1f96dee9c1b6b81212fa314a261dc1a7\n $fFoldableProd_$cnull ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> GHC.Types.Bool\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Unfolding: Core: \n \\ @f :: * -> *\n@@ -1875,15 +1875,15 @@\n (_R\n %<'GHC.Types.Many>_N ->_R Sym (Data.Semigroup.Internal.N:Endo[0]\n _R))\n fas)\n `cast`\n (Data.Semigroup.Internal.N:Endo[0] _R)\n GHC.Types.True) }]\n-185aac1c6c98e1e378803c57c75f2332\n+af8de4008f99eb32566d678c4db224c0\n $fFoldableProd_$ctoList ::\n (Data.Foldable.Foldable f, Data.Foldable.Foldable (Prod fs)) =>\n Prod (f : fs) a -> [a]\n [LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,C(1,C(1,L))),A,A,A,A,A,A,A,A,A,A,A,A,A,A,A)><1L>,\n Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -1904,57 +1904,57 @@\n $dFoldable\n $dFoldable1\n @a\n @b\n c\n n\n eta)]\n-5d2e63ce77f9188ebdf94a3bd8f35300\n+18f198a37ab610a3f8d0dde3bf7834a9\n $fFunctorProd ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Inline: CONLIKE,\n Unfolding: DFun: @f :: * -> *\n @fs :: [* -> *]\n (v['GHC.Types.Many] :: GHC.Base.Functor f)\n (v1['GHC.Types.Many] :: GHC.Base.Functor (Prod fs)).\n @(Prod (f : fs))\n ($fFunctorProd_$cfmap @f @fs v v1)\n ($fFunctorProd_$c<$ @f @fs v v1)]\n-e1fe0c10ead2c678d0f3f43dc96350fc\n+1c3b7dbd069b5284f1b8ff32f800351d\n $fFunctorProd0 :: GHC.Base.Functor (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Base.C:Functor], Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[]) $fFunctorProd0_$cfmap $fFunctorProd0_$c<$]\n-35b5ef16cbe85df775d864190017609a\n+9a9ede9301c0a4b28161fdf6e442967f\n $fFunctorProd0_$c<$ :: a -> Prod '[] b -> Prod '[] a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n (eta['GHC.Types.Many] :: a)\n (ds['GHC.Types.Many] :: Prod '[] b) ->\n case ds of wild { Unit co -> $WUnit @(*) @a }]\n-b20b2a557c3cd33480f5669b22e9b8be\n+155874005133452af3c6215c6b590a5a\n $fFunctorProd0_$cfmap :: (a -> b) -> Prod '[] a -> Prod '[] b\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <2,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds1 of wild { Unit co -> $WUnit @(*) @b }]\n-1d7785d49c8dff8e008999971775e57e\n+014b20d58cf574724f554e6b632fe03b\n $fFunctorProd_$c<$ ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n a -> Prod (f : fs) b -> Prod (f : fs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -1991,15 +1991,15 @@\n (GHC.Base.fmap\n @(Prod fs)\n $dFunctor1\n @b\n @a\n f2\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-3d9f0a6a736618a6f46129420b75208d\n+271bf5e9bb09d8ffdbe5238f7f99c683\n $fFunctorProd_$cfmap ::\n (GHC.Base.Functor f, GHC.Base.Functor (Prod fs)) =>\n (a -> b) -> Prod (f : fs) a -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 4,\n Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2029,15 +2029,15 @@\n (GHC.Base.fmap\n @(Prod fs)\n $dFunctor1\n @a\n @b\n f1\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-1d91a558e7f9aedecd7e1a8c8fc4e726\n+7d9c2a120967dea7271a883bcc6ecbba\n $fOrd1Prod ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Data.Functor.Classes.Ord1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -2048,37 +2048,37 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Ord1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Ord1 (Prod fs)).\n @(Prod (f : fs))\n ($fOrd1Prod_$cp1Ord1 @f @fs v v1)\n (\\ @a ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a) ->\n $fOrdProd @f @a @fs v $dOrd v1)\n ($fOrd1Prod_$cliftCompare @f @fs v v1)]\n-37747232bce33190765d838c1402dbf3\n+35593db33cd3272ad62b0f0947b26a8f\n $fOrd1Prod0 :: Data.Functor.Classes.Ord1 (Prod '[])\n DFunId\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Ord1],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[]) $fEq1Prod0 $fOrdProd0 $fOrd1Prod0_$cliftCompare]\n-6db24e3fb0c1c5bbe44532cc91141661\n+69c4c43d0f231d705977313e1b5948cc\n $fOrd1Prod0_$cliftCompare ::\n (a -> b -> GHC.Types.Ordering)\n -> Prod '[] a -> Prod '[] b -> GHC.Types.Ordering\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3, Strictness: <1L><1L>, CPR: 2,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @a\n @b\n (ds['GHC.Types.Many] :: a -> b -> GHC.Types.Ordering)\n (ds1['GHC.Types.Many] :: Prod '[] a)\n (ds2['GHC.Types.Many] :: Prod '[] b) ->\n case ds1 of wild { Unit co ->\n case ds2 of wild1 { Unit co1 -> GHC.Types.EQ } }]\n-c3534ae34b59171382b1f6a68c48f2ab\n+85696df2593a70554e26f85b80ac754e\n $fOrd1Prod_$cliftCompare ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n (a -> b -> GHC.Types.Ordering)\n -> Prod (f : fs) a -> Prod (f : fs) b -> GHC.Types.Ordering\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2119,15 +2119,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-94d0c4a86a3a12f76fb902dbe33047eb\n+3d538142cfcf7f7b549bac1972aaa8d5\n $fOrd1Prod_$cp1Ord1 ::\n (Data.Functor.Classes.Ord1 f,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Data.Functor.Classes.Eq1 (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -2137,15 +2137,15 @@\n ($dOrd1['GHC.Types.Many] :: Data.Functor.Classes.Ord1 f)\n ($dOrd2['GHC.Types.Many] :: Data.Functor.Classes.Ord1 (Prod fs)) ->\n $fEq1Prod\n @f\n @fs\n (Data.Functor.Classes.$p1Ord1 @f $dOrd1)\n (Data.Functor.Classes.$p1Ord1 @(Prod fs) $dOrd2)]\n-ad8a0e96f0f266b21f585654b2ed1c31\n+c185a99c98584402b5f9e95300f61f3d\n $fOrdProd ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n GHC.Classes.Ord (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -2164,15 +2164,15 @@\n ($fOrdProd_$c<= @f @a @fs v v1 v2)\n ($fOrdProd_$c> @f @a @fs v v1 v2)\n (\\ (x['GHC.Types.Many] :: Prod (f : fs) a)\n (y['GHC.Types.Many] :: Prod (f : fs) a) ->\n $fOrdProd_$c<= @f @a @fs v v1 v2 y x)\n ($fOrdProd_$cmax @f @a @fs v v1 v2)\n ($fOrdProd_$cmin @f @a @fs v v1 v2)]\n-212a0c7b281a9d2f24dc9f9630309a38\n+376bab956c471d789ca3b3881dbed599\n $fOrdProd0 :: GHC.Classes.Ord a => GHC.Classes.Ord (Prod '[] a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Classes.Ord a).\n @(Prod '[] a)\n ($fOrdProd0_$cp1Ord @a v)\n@@ -2199,23 +2199,23 @@\n (\\ (x['GHC.Types.Many] :: Prod '[] a)\n (y['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co -> y })\n (\\ (x['GHC.Types.Many] :: Prod '[] a)\n (y['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co ->\n case y of wild1 { Unit co1 -> wild } })]\n-f03453389d0fd75c712fb52f361bdbb0\n+c01cfa0552fc0c9670078ca323bc14d8\n $fOrdProd0_$cp1Ord ::\n GHC.Classes.Ord a => GHC.Classes.Eq (Prod '[] a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @a ($dOrd['GHC.Types.Many] :: GHC.Classes.Ord a) ->\n $fEqProd0 @a (GHC.Classes.$p1Ord @a $dOrd)]\n-657138cfe492ce1444bcf8290136cd5d\n+202e5fa07c7ebcd92d7f465a7f7b4ce3\n $fOrdProd_$c< ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2234,15 +2234,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n y\n x of wild {\n DEFAULT -> GHC.Types.False GHC.Types.GT -> GHC.Types.True }]\n-5c8a507e84a41cced986357db14b8631\n+70e91e87fcdea1710bc7b36ff3301f64\n $fOrdProd_$c<= ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2261,15 +2261,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> GHC.Types.True GHC.Types.GT -> GHC.Types.False }]\n-d70f34cff32f5e3756c5de0cc60bf7b5\n+1109e667665fb308c19da61929f84b9a\n $fOrdProd_$c> ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Bool\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 5,\n Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n@@ -2288,15 +2288,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> GHC.Types.False GHC.Types.GT -> GHC.Types.True }]\n-869dd2c75cbd28c3b9b2f3114a8faa3d\n+ebe33d07ec27c49b8d0151f4112f4e41\n $fOrdProd_$ccompare ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> GHC.Types.Ordering\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))><1L><1L>,\n Unfolding: Core: \n@@ -2339,15 +2339,15 @@\n `cast`\n (Prod\n <*>_N\n (SelCo:Tc(2)\n (Sym co1\n ; co))\n _N)_R } } }]\n-664e3fec4d78c7e237e9cb3b498b865e\n+745990ba2877b119ee4369d82e2fbb05\n $fOrdProd_$cmax ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -2365,15 +2365,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> y GHC.Types.GT -> x }]\n-a24e3d36ec26b1a8d0a90fdcad9d42f1\n+2a1f6d36ab3e9ca40b3f7ee02e9eb44d\n $fOrdProd_$cmin ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n Prod (f : fs) a -> Prod (f : fs) a -> Prod (f : fs) a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(A,A,1C(1,C(1,C(1,L))))>,\n Unfolding: Core: \n@@ -2391,15 +2391,15 @@\n @fs\n $dOrd1\n $dOrd\n $dOrd2\n x\n y of wild {\n DEFAULT -> x GHC.Types.GT -> y }]\n-07f196658fec8f28504840008a125d4b\n+dd2b034c8b83f190dd81d5949cf2cd14\n $fOrdProd_$cp1Ord ::\n (Data.Functor.Classes.Ord1 f, GHC.Classes.Ord a,\n Data.Functor.Classes.Ord1 (Prod fs)) =>\n GHC.Classes.Eq (Prod (f : fs) a)\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n Strictness: ,\n@@ -2413,15 +2413,15 @@\n $fEqProd\n @f\n @a\n @fs\n (Data.Functor.Classes.$p1Ord1 @f $dOrd1)\n (GHC.Classes.$p1Ord @a $dOrd)\n (Data.Functor.Classes.$p1Ord1 @(Prod fs) $dOrd2)]\n-855c50fbfe417001be74014a7c530ffd\n+f72a05ac87f7d4b0db3e99f2ee86c395\n $fShow1Prod ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n Data.Functor.Classes.Show1 (Prod (f : fs))\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n@@ -2432,39 +2432,39 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Show1 f)\n (v1['GHC.Types.Many] :: Data.Functor.Classes.Show1 (Prod fs)).\n @(Prod (f : fs))\n (\\ @a ($dShow['GHC.Types.Many] :: GHC.Show.Show a) ->\n $fShowProd @f @a @fs v $dShow v1)\n ($fShow1Prod_$cliftShowsPrec @f @fs v v1)\n ($fShow1Prod_$cliftShowList @f @fs v v1)]\n-8f5cc8b096172543b66beca898319072\n+121fa5b2932af052532e2e0fb362af80\n $fShow1Prod0 :: Data.Functor.Classes.Show1 (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Functor.Classes.C:Show1],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n $fShowProd0\n $fShow1Prod0_$cliftShowsPrec\n $fShow1Prod0_$cliftShowList]\n-c9ebf33bdc7a7e5cd781bb4c1ef11a55\n+1325d4d4099c4571fd1d73d670e65a7e\n $fShow1Prod0_$cliftShowList ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Prod '[] a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: StableSystem <4,TrueTrue>\n \\ @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (eta['GHC.Types.Many] :: [Prod '[] a])\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Prod '[] a) ($fShow1Prod4 @a) eta eta1]\n-23bfdbd365bb687d11bca0d85ce97dfe\n+f713e90558045931c878017715a6cd65\n $fShow1Prod0_$cliftShowsPrec ::\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Prod '[] a\n -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n@@ -2474,42 +2474,42 @@\n (ds['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (ds1['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (ds2['GHC.Types.Many] :: GHC.Types.Int)\n (ds3['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds3 of wild { Unit co ->\n GHC.CString.unpackAppendCString# $fShow1Prod5 eta }]\n-6040d85b280aabe26013b2318d960dd0\n+45bb9021211fd05db5f3037acd00857f\n $fShow1Prod1 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \" `prod` \"#]\n-a70703d856884be94901f961f53d37e6\n+f4fd576d1c98509a1f9deca9794d9594\n $fShow1Prod2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"oneTuple \"#]\n-05737f14b94806046c763016b9a844c4\n+c17f436ecd12c6353c34d5ed596ef09f\n $fShow1Prod3 :: GHC.Types.Int\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.I#],\n Unfolding: Core: GHC.Types.I# 11#]\n-86560ed452101d6d6bbe9ba21459b910\n+c6dcd855108e1f62f9dd244112d61e46\n $fShow1Prod4 :: Prod '[] a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @a\n (ds['GHC.Types.Many] :: Prod '[] a)\n (eta['GHC.Types.Many] :: GHC.Base.String) ->\n case ds of wild { Unit co ->\n GHC.CString.unpackAppendCString# $fShow1Prod5 eta }]\n-02ed72b02291748ad4f9755ad1e4b0ab\n+a78cfa2e8dd0e61bcdb32448e2956256\n $fShow1Prod5 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"zeroTuple\"#]\n-8fbbd769fb63ad94ff7e2158a9169335\n+a59e0576e735270e51b50ed7a9fe3dbb\n $fShow1Prod_$cliftShowList ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS) -> [Prod (f : fs) a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 6, Arity: 6,\n Strictness: <1L>,\n@@ -2525,15 +2525,15 @@\n (eta1['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__\n @(Prod (f : fs) a)\n (\\ (ds['GHC.Types.Many] :: Prod (f : fs) a) ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a sp sl 0# ds)\n eta\n eta1]\n-df35a415834cbb48a2d441ed1ff9cd85\n+a24aae26efd62d5f14dea9eb23e7a6d4\n $fShow1Prod_$cliftShowsPrec ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Types.Int\n -> Prod (f : fs) a\n@@ -2549,15 +2549,15 @@\n @a\n (sp['GHC.Types.Many] :: GHC.Types.Int -> a -> GHC.Show.ShowS)\n (sl['GHC.Types.Many] :: [a] -> GHC.Show.ShowS)\n (d['GHC.Types.Many] :: GHC.Types.Int)\n (ds['GHC.Types.Many] :: Prod (f : fs) a) ->\n case d of wild { GHC.Types.I# ww ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a sp sl ww ds }]\n-6b704d95bf5d0c4eb0754dc654620af0\n+25fefadfe8f55d5fe94229734a3f80da\n $fShowProd ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n GHC.Show.Show (Prod (f : fs) a)\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 3,\n Arity: 3,\n@@ -2569,15 +2569,15 @@\n (v['GHC.Types.Many] :: Data.Functor.Classes.Show1 f)\n (v1['GHC.Types.Many] :: GHC.Show.Show a)\n (v2['GHC.Types.Many] :: Data.Functor.Classes.Show1 (Prod fs)).\n @(Prod (f : fs) a)\n ($fShowProd_$cshowsPrec @f @a @fs v v1 v2)\n ($fShowProd_$cshow @f @a @fs v v1 v2)\n ($fShowProd_$cshowList @f @a @fs v v1 v2)]\n-36bd69d638d84b0c9011e25b94927f37\n+d892891347dd580c41fdb87d355863c1\n $fShowProd0 :: GHC.Show.Show a => GHC.Show.Show (Prod '[] a)\n DFunId\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: ,\n Inline: CONLIKE,\n Unfolding: DFun: @a (v['GHC.Types.Many] :: GHC.Show.Show a).\n @(Prod '[] a)\n (\\ (ds['GHC.Types.Many] :: GHC.Types.Int)\n@@ -2592,19 +2592,19 @@\n GHC.Base.foldr @GHC.Types.Char @b c n $fShowProd1)\n eta })\n (\\ (x['GHC.Types.Many] :: Prod '[] a) ->\n case x of wild { Unit co -> $fShowProd1 })\n (\\ (ls['GHC.Types.Many] :: [Prod '[] a])\n (s['GHC.Types.Many] :: GHC.Base.String) ->\n GHC.Show.showList__ @(Prod '[] a) ($fShow1Prod4 @a) ls s)]\n-9eb66a1c818504181fb9f574e7cd1720\n+8be78c6edde4fb30d49351c8a3284352\n $fShowProd1 :: [GHC.Types.Char]\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: GHC.CString.unpackCString# $fShow1Prod5]\n-a053013a0790033e466a5c562de2b535\n+f7839d77d2b79b4dcfb4fdb8437bf1fc\n $fShowProd_$cshow ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n Prod (f : fs) a -> GHC.Base.String\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2622,15 +2622,15 @@\n $dShow2\n @a\n (GHC.Show.showsPrec @a $dShow)\n (GHC.Show.showList @a $dShow)\n 0#\n x\n (GHC.Types.[] @GHC.Types.Char)]\n-76d3ff93dc37bbf06c2927969ecf3e30\n+ea5904abaa531119e6ded79598aaaf4a\n $fShowProd_$cshowList ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n [Prod (f : fs) a] -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2651,15 +2651,15 @@\n } in\n GHC.Show.showList__\n @(Prod (f : fs) a)\n (\\ (eta['GHC.Types.Many] :: Prod (f : fs) a) ->\n $w$cliftShowsPrec @f @fs $dShow1 $dShow2 @a lvl17 lvl18 0# eta)\n ls\n s]\n-1cd08022144c792cd4843c9be57b0294\n+6d3b3f1144defe2af062303cf273429e\n $fShowProd_$cshowsPrec ::\n (Data.Functor.Classes.Show1 f, GHC.Show.Show a,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n GHC.Types.Int -> Prod (f : fs) a -> GHC.Show.ShowS\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1!P(L)><1L>,\n Unfolding: Core: StableSystem <5,TrueFalse>\n@@ -2677,15 +2677,15 @@\n $dShow1\n $dShow2\n @a\n (GHC.Show.showsPrec @a $dShow)\n (GHC.Show.showList @a $dShow)\n eta\n eta1]\n-5d01825ab33355d311525636fee8f738\n+d5bd819362f59b1688758c98ac50ea3b\n $fTraversableProd ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n Data.Traversable.Traversable (Prod (f : fs))\n DFunId\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n@@ -2697,15 +2697,15 @@\n @(Prod (f : fs))\n ($fTraversableProd_$cp1Traversable @f @fs v v1)\n ($fTraversableProd_$cp2Traversable @f @fs v v1)\n ($fTraversableProd_$ctraverse @f @fs v v1)\n ($fTraversableProd_$csequenceA @f @fs v v1)\n ($fTraversableProd_$cmapM @f @fs v v1)\n ($fTraversableProd_$csequence @f @fs v v1)]\n-3b2a3b73f7dd70b63122c555207ed317\n+7a6baf078396f6ad5b96ceb718b1172d\n $fTraversableProd0 :: Data.Traversable.Traversable (Prod '[])\n DFunId\n [TagSig: ,\n LambdaFormInfo: LFCon[Data.Traversable.C:Traversable],\n Inline: CONLIKE,\n Unfolding: DFun:.\n @(Prod '[])\n@@ -2736,41 +2736,41 @@\n (eta['GHC.Types.Many] :: Prod '[] (m a)) ->\n case eta of wild { Unit co ->\n GHC.Base.pure\n @m\n (GHC.Base.$p1Monad @m $dMonad)\n @(Prod '[] a)\n ($WUnit @(*) @a) })]\n-c3867ecf5efe7ba588428ce298e53978\n+d2d78e1dc58e2b3245c590ce6a0cb850\n $fTraversableProd0_$ctraverse ::\n GHC.Base.Applicative f =>\n (a -> f b) -> Prod '[] a -> f (Prod '[] b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(A,1C(1,L),A,A,A,A)><1L>,\n Unfolding: Core: StableSystem <3,TrueTrue>\n \\ @f :: * -> *\n @a\n @b\n ($dApplicative['GHC.Types.Many] :: GHC.Base.Applicative f)\n (ds['GHC.Types.Many] :: a -> f b)\n (ds1['GHC.Types.Many] :: Prod '[] a) ->\n case ds1 of wild { Unit co ->\n GHC.Base.pure @f $dApplicative @(Prod '[] b) ($WUnit @(*) @b) }]\n-994d310e65b43d87d3863ae3a69c83c3\n+6fb1faa8a386a2f758a3d9fabb3e0958\n $fTraversableProd1 :: f b -> Prod fs b -> Prod (f : fs) b\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: ,\n Unfolding: Core: \n \\ @fs :: [* -> *]\n @b\n @f :: * -> *\n (ds['GHC.Types.Many] :: f b)\n (ds1['GHC.Types.Many] :: Prod fs b) ->\n $WCons @(*) @f @b @fs ds ds1]\n-6a78ef91de97b175be1f2b03b10facfe\n+e3b6b0917be90d9232a0a43cf86155c8\n $fTraversableProd_$cmapM ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Monad m) =>\n (a -> m b) -> Prod (f : fs) a -> m (Prod (f : fs) b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1P(1P(L,L,SC(S,L),L,L,L),A,A,A)><1L>,\n Inline: (sat-args=0),\n@@ -2793,15 +2793,15 @@\n $dTraversable1\n @m\n @a\n @b\n (GHC.Base.$p1Monad @m $dMonad)\n eta\n eta1]\n-0a0327f95920457020c038ffe7dd5aab\n+781f34f21daaaeb91fc4ce3c170eabbd\n $fTraversableProd_$cp1Traversable ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n GHC.Base.Functor (Prod (f : fs))\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2,\n Strictness: ,\n@@ -2812,15 +2812,15 @@\n ($dTraversable1['GHC.Types.Many] :: Data.Traversable.Traversable\n (Prod fs)) ->\n $fFunctorProd\n @f\n @fs\n (Data.Traversable.$p1Traversable @f $dTraversable)\n (Data.Traversable.$p1Traversable @(Prod fs) $dTraversable1)]\n-1f8f48676092672bd6a4378512a1d413\n+4894af1253c0757e5ab63b02b975e612\n $fTraversableProd_$cp2Traversable ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs)) =>\n Data.Foldable.Foldable (Prod (f : fs))\n [TagSig: , LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: ,\n Unfolding: Core: \n@@ -2830,15 +2830,15 @@\n ($dTraversable1['GHC.Types.Many] :: Data.Traversable.Traversable\n (Prod fs)) ->\n $fFoldableProd\n @f\n @fs\n (Data.Traversable.$p2Traversable @f $dTraversable)\n (Data.Traversable.$p2Traversable @(Prod fs) $dTraversable1)]\n-a5b4473cc8d08cef8c0902d6550b09f8\n+339ce2a42d32bf48ab37c0bc3c672971\n $fTraversableProd_$csequence ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Monad m) =>\n Prod (f : fs) (m a) -> m (Prod (f : fs) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1P(1P(L,L,SC(S,L),L,L,L),A,A,A)><1L>,\n Inline: (sat-args=0),\n@@ -2859,15 +2859,15 @@\n $dTraversable1\n @m\n @(m a)\n @a\n (GHC.Base.$p1Monad @m $dMonad)\n (GHC.Base.id @(m a))\n eta]\n-9548a0e69b208274d90a8c7dc15518c7\n+df050f680bf221b38bcf0f8dbf7dbcca\n $fTraversableProd_$csequenceA ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Applicative f1) =>\n Prod (f : fs) (f1 a) -> f1 (Prod (f : fs) a)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 4, Arity: 4,\n Strictness: <1L>,\n Inline: (sat-args=0),\n@@ -2886,15 +2886,15 @@\n $dTraversable\n $dTraversable1\n @f1\n @(f1 a)\n @a\n $dApplicative\n (GHC.Base.id @(f1 a))]\n-0343881b4a56387c10c2a90640c35e57\n+a5a048310f0dae1c8a44b9b9675c0016\n $fTraversableProd_$ctraverse ::\n (Data.Traversable.Traversable f,\n Data.Traversable.Traversable (Prod fs), GHC.Base.Applicative f1) =>\n (a -> f1 b) -> Prod (f : fs) a -> f1 (Prod (f : fs) b)\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 5, Arity: 5,\n Strictness: <1L>,\n Unfolding: Core: \n@@ -2935,114 +2935,114 @@\n $dTraversable1\n @f1\n @a\n @b\n $dApplicative\n eta\n fas `cast` (Prod <*>_N (SelCo:Tc(2) (Sym co)) _N)_R) }]\n-3a7e9dbd4e89ac8fd507b72fa2111de7\n+4782daeefb209cc6e70ef18754396e57\n $tc'Cons :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 11681214518383820212#Word64\n- 2262654514700322604#Word64\n+ 18095855829200529283#Word64\n+ 9349079441430715829#Word64\n $trModule\n $tc'Cons2\n 4#\n $tc'Cons1]\n-2d30aab6bb6c9f3ccc2dd62a32a8a4e7\n+f490e18cf82ec30f624196fb2d39a6f8\n $tc'Cons1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-08b2ad063a71ee45a7a8536f65c5f05e\n+ac2fac9d90fc111a15d4c4e1f0373958\n $tc'Cons2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Cons3]\n-e3a9582364945a3fdad675ea10bdcc1f\n+673b81b4c9c40dc2d20878f9ec48ef25\n $tc'Cons3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Cons\"#]\n-23c432102357c63bee6ce1d940488243\n+8789339d671dda0e1838d22e1becb0b9\n $tc'Unit :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2737625517741220644#Word64\n- 14927981062871196765#Word64\n+ 15781974758605816177#Word64\n+ 16358358308405845360#Word64\n $trModule\n $tc'Unit2\n 2#\n $tc'Unit1]\n-2429097e1acb268ce9793d5db542e0a0\n+418bfb310cc853e69fb766e32e83d141\n $tc'Unit1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepTyConApp], Inline: [~]]\n-ef7f66f0388ec3705825a2b11d93dfc1\n+04f400db1544e18727e6796980fb30bf\n $tc'Unit2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Unit3]\n-ddaeada3f0566f7815c9e05b7300032e\n+2c734cda52aa5fe049c2bfcf7cfc3840\n $tc'Unit3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Unit\"#]\n-0e492da99a3933300f7b3e0d015148c0\n+2ed43a4576836a463acca268b71b8a3d\n $tcProd :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 14117411816903489973#Word64\n- 14719450260367156357#Word64\n+ 3702848797303664329#Word64\n+ 10218302260542951913#Word64\n $trModule\n $tcProd2\n 1#\n $tcProd1]\n-2de61373d3d737f58856631f27dceee2\n+f54ab60f1ab8f6a112c7fbfe92586cc8\n $tcProd1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-a97e04b764d396aa8167339adaadef46\n+e3e0086e5a1912106894ddb48ff470c0\n $tcProd2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcProd3]\n-00e226dbe680d3c6ac85038ff4d4c99a\n+9923d18a971c1c15108c89fd1447c454\n $tcProd3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Prod\"#]\n-96413630781f30772b6c77bfceb7b732\n+906c64d92ef88a476b272f9edc5a91ea\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-73cc961c32c4a687204c0957a65feeb0\n+17f845fc0196fa3ce77813ba405a6638\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-87213e996837faaa8a48f4019e90aa67\n+c20d6e6345b74f747bf755752914420e\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Prod\"#]\n-9d88598cebc62d018fc3a21bcf4fc75a\n+5bfdf37dfd9aa57f39882f24a094c609\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-3dd39a97079e5daf4ad26745a000cb24\n+b28fc42724998d51c11e83bd2397d601\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-e7c758d61272018c6faaf4f73d3ffe58\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+5b7d769a077d6ef1675a22ac50823268\n $w$cliftShowsPrec ::\n (Data.Functor.Classes.Show1 f,\n Data.Functor.Classes.Show1 (Prod fs)) =>\n (GHC.Types.Int -> a -> GHC.Show.ShowS)\n -> ([a] -> GHC.Show.ShowS)\n -> GHC.Prim.Int#\n -> Prod (f : fs) a\n@@ -3125,76 +3125,76 @@\n GHC.Show.$fShow(,)3\n (GHC.CString.unpackAppendCString#\n $fShow1Prod2\n (f2\n (GHC.CString.unpackAppendCString#\n $fShow1Prod1\n (g (GHC.Types.: @GHC.Types.Char GHC.Show.$fShow(,)1 x))))) } } }]\n-0b067dc8d1998b2bb8488e3bb8a8fcc6\n+7ed7e132d60bf3187c2f5785260bf37d\n $w$cmaximum :: (# #) -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableUser\n \\ @a (void['GHC.Types.Many] :: (# #)) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString# @b \"maximum: empty structure\"#))]\n-4629527230dd254a906d75e3508133d9\n+47e711ca318660bfa85409cb439f1aa5\n $w$cminimum :: (# #) -> a\n [TagSig: , LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: b, CPR: b, Inline: [2],\n Unfolding: Core: StableUser\n \\ @a (void['GHC.Types.Many] :: (# #)) ->\n GHC.Err.errorWithoutStackTrace\n @GHC.Types.LiftedRep\n @a\n (GHC.Base.build\n @GHC.Types.Char\n (\\ @b ->\n GHC.CString.unpackFoldrCString# @b \"minimum: empty structure\"#))]\n-8fdd6a3df6caa085c48f6e4cd62d707f\n+9e1a347b81f82e99eae15e6701e5fdc9\n type (++) :: forall k. [k] -> [k] -> [k]\n type family (++) l r where\n forall k (ys :: [k]). (++) '[] ys = ys\n forall k (x :: k) (xs :: [k]) (ys :: [k]).\n (++) (x : xs) ys = x : (xs ++ ys)\n axiom D:R:++\n-81aef0e416fe3eced281ba9e3418f8e5\n+b9e832e839646ad593d0f98d996de215\n type Curried :: * -> *\n type family Curried t where\n forall k (a :: k) (r :: k -> *). Curried (Prod '[] a -> r a) = r a\n forall k (t :: GHC.Types.RuntimeRep) (f :: k -> *) (fs :: [k -> *])\n (a :: k) (r :: k -> GHC.Prim.TYPE t).\n Curried (Prod (f : fs) a -> r a)\n = f a -> Curried (Prod fs a -> r a)\n axiom D:R:Curried\n-c942a9be1f9dd46c9c4c3c3efa39164b\n+2eb68f31ecc22041f9172906f1ef8c19\n axiom D:R:++ ::\n forall k (ys :: [k]). ++ '[] ys = ys\n forall k (x :: k) (xs :: [k]) (ys :: [k]).\n ++ (x : xs) ys = x : (xs ++ ys)\n-215dbd0d8d46680c2d0c3eab2a27a8df\n+48d63156e2c4beaa2ae9d29c8f291fd6\n axiom D:R:Curried ::\n forall k (a :: k) (r :: k -> *). Curried (Prod '[] a -> r a) = r a\n forall k (t :: GHC.Types.RuntimeRep) (f :: k -> *) (fs :: [k -> *])\n (a :: k) (r :: k -> GHC.Prim.TYPE t).\n Curried (Prod (f : fs) a -> r a)\n = f a -> Curried (Prod fs a -> r a)\n-46923a6801bbd445e7f64b45bc2641db\n+72871df9eab61fc1dcceb25a27d59350\n type role Prod nominal nominal\n type Prod :: forall k. [k -> *] -> k -> *\n data Prod a b where\n Unit :: forall {k} (b :: k). Prod '[] b\n Cons :: forall {k} (f :: k -> *) (b :: k) (fs :: [k -> *]).\n f b -> Prod fs b -> Prod (f : fs) b\n-739d73e440f15f399d4ee7da6da91e88\n+bce2c9b88cd2644b7931a74d742a3b46\n fromProduct ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Data.Functor.Product.Product f g a -> Prod '[f, g] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: <1!P(L,L)>,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n@@ -3216,36 +3216,36 @@\n @'[g]\n @a\n @g\n @'[]\n @~<'[g]>_N\n ga\n ($WUnit @k @a)) }]\n-15047fbbfd70729b34ce5eef9c39ff10\n+55a3a2e4834f161b6addddb24b107f58\n oneTuple :: forall {k} (f :: k -> *) (a :: k). f a -> Prod '[f] a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ,\n Unfolding: Core: \n \\ @k @f :: k -> * @a :: k (fa['GHC.Types.Many] :: f a) ->\n {__scc {Data.Functor.Prod.oneTuple} True False} Cons\n @k\n @'[f]\n @a\n @f\n @'[]\n @~<'[f]>_N\n fa\n ($WUnit @k @a)]\n-ce6744d0fed199a0f3297258e8b39d71\n+783ee96f7bfd3c24f11aaa471e0ddbde\n prod ::\n forall {k} (ls :: [k -> *]) (a :: k) (rs :: [k -> *]).\n Prod ls a -> Prod rs a -> Prod (ls ++ rs) a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: <1L>]\n-df6e31002780874726558fa3ecbc6bf5\n+4d084936658366cba098aeaca12a73a5\n toProduct ::\n forall {k} (f :: k -> *) (g :: k -> *) (a :: k).\n Prod '[f, g] a -> Data.Functor.Product.Product f g a\n [LambdaFormInfo: LFReEntrant 1, Arity: 1, Strictness: <1L>, CPR: 1,\n Unfolding: Core: StableSystem <1,TrueFalse>\n \\ @k\n @f :: k -> *\n@@ -3275,27 +3275,27 @@\n (Sym co))) _N)\n Cons ipv ipv1 ipv2 ipv3 ipv4\n -> toProduct1\n @k\n @f\n @g\n @a } } }]\n-d3aadb0a37bb59155db55af33446469a\n+5d07bd02252cbe2363bc3e6bad5ff146\n toProduct1 ::\n forall {k} {f :: k -> *} {g :: k -> *} {a :: k}.\n Data.Functor.Product.Product f g a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Strictness: b, CPR: b]\n-26018d13d7720f78f0313310b6a6120d\n+dd9c29db8d478aa3c48653ebf9da1a21\n uncurryn ::\n forall {k} (fs :: [k -> *]) (a :: k) (r :: k -> *).\n Curried (Prod fs a -> r a) -> Prod fs a -> r a\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 1,\n Arity: 1, Strictness: ]\n-e460784530b25f09f35dca96ca9f5474\n+eebabdbe44b8aa4b48e1e41ccbd9baec\n zeroTuple :: forall {k} (a :: k). Prod '[] a\n [LambdaFormInfo: LFThunk (updatable=True might_be_function= False),\n Unfolding: Core: \n {__scc {Data.Functor.Prod.zeroTuple} True False} $WUnit]\n instance [safe] GHC.Base.Alternative [Prod] = $fAlternativeProd\n instance [safe] GHC.Base.Alternative [Prod] = $fAlternativeProd0\n instance [safe] GHC.Base.Applicative [Prod] = $fApplicativeProd\n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Functor/Transformer.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Functor/Transformer.p_hi", "comments": ["Files 88% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Data.Functor.Transformer 9066\n- interface hash: 5102af2ca924928a5ff1f38a3a37f260\n- ABI hash: b6c50927a72e994c449237c5015937c7\n- export-list hash: 856a31e58112ee4a1740bc4f8a0a5850\n+ interface hash: 0eeecfeb9f6a7233ae7c6af553094a58\n+ ABI hash: eda82e6579172c14a44bb087490ee99a\n+ export-list hash: 385f1ce47f803f58a1667bba336930e6\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: f5e2cce413adc89c5e3d9edbdd58cf81\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: d83995bc8e7444810caab212b91324c0\n sig of: Nothing\n@@ -37,21 +37,21 @@\n Barbies.Internal.ConstraintsT.AllTF\n Barbies.Internal.ConstraintsT.ConstraintsT{Barbies.Internal.ConstraintsT.AllT Barbies.Internal.ConstraintsT.taddDicts}\n Barbies.Internal.DistributiveT.DistributiveT{Barbies.Internal.DistributiveT.tdistribute}\n Barbies.Internal.FunctorT.FunctorT{Barbies.Internal.FunctorT.tmap}\n Barbies.Internal.MonadT.MonadT{Barbies.Internal.MonadT.tembed Barbies.Internal.MonadT.tjoin Barbies.Internal.MonadT.tlift}\n Barbies.Internal.TraversableT.TraversableT{Barbies.Internal.TraversableT.ttraverse}\n Data.Generics.GenericN.Rec{Data.Generics.GenericN.Rec unRec}\n-direct module dependencies: barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT\n- barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN\n+direct module dependencies: barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT\n+ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN\n boot module dependencies:\n direct package dependencies: base-4.18.2.1\n plugin package dependencies:\n orphans: Barbies.Internal.ApplicativeT\n Barbies.Internal.ConstraintsT Barbies.Internal.DistributiveT\n Barbies.Internal.FunctorT Barbies.Internal.TraversableT GHC.Base\n GHC.Float Data.Orphans GHC.Prim.Ext\n@@ -66,87 +66,87 @@\n Control.Monad.Trans.Accum Control.Monad.Trans.Except\n Control.Monad.Trans.Identity Control.Monad.Trans.Maybe\n Control.Monad.Trans.RWS.Lazy Control.Monad.Trans.RWS.Strict\n Control.Monad.Trans.Reader Control.Monad.Trans.State.Lazy\n Control.Monad.Trans.State.Strict Control.Monad.Trans.Writer.Lazy\n Control.Monad.Trans.Writer.Strict Data.Functor.Constant\n Data.Functor.Reverse\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ApplicativeT 37b9828a73911edc65682677beef0b01\n- exports: 326dd8ed771f20a8bb5ea77e676eb73c\n- ApplicativeT ac75f9c1033a1a0fa3ed421b0aa1a6ff\n- tprod 836c430f592da5bade76b63a1cf2dc58\n- tpure d70eae245e3327d8eee46b48631b6e4c\n- tunzip d7f86ef8dc97dee17e1bd03b659eecdc\n- tzip 86a7545983d440ce260903a9a0e1494e\n- tzipWith f350595e933c3e2883cd0c875f9ac195\n- tzipWith3 feb1601bb3b05f01c12569756a080f90\n- tzipWith4 9bc7aa1049fe89605e44d126cdee52a8\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.ConstraintsT b740860c90bc5069368a1402d8ba35ea\n- exports: ff64c12f85a58ce210c289bc5f38b4b0\n- AllT 051a1647fb7cdb81b6c12726eebecf9e\n- AllTF dff074ee18166a22f4f8f47ecb3e6f9e\n- ConstraintsT 63bcc668eaa4de0e771fce96e43c496c\n- taddDicts 5152b4bb5c5fe309890636bc41f05b3b\n- tmapC c7ff11490dec8c0395bb3c7f9f149f34\n- ttraverseC 10f64217cafad49e723398b33079651f\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.DistributiveT ec0109aac7f95a0f49e357c4692172b6\n- exports: e4bb445090ae9da31a739b0e3da69c11\n- DistributiveT bf60a4b70526597f9806abfbda792bc4\n- tcotraverse 2dc7e6fe6bf1f4e02803c5fcccf833b7\n- tdecompose 5bcdca0f2e664d1fc81634f7cd2be293\n- tdistribute e3628f1c954601a3a1e88b8b2e9621cf\n- tdistribute' b01def03abeebe4cc399564d96dac8a8\n- trecompose f413036664271a59346594cae1034ca2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.FunctorT 740b571b183b6fedf549dc7d55b49ebc\n- exports: f80df9d1a671828401e57ca77039e65f\n- FunctorT 8eecefeea9b4af10c28c6418beb8e35f\n- tmap 7daf6eec37127197117907af82691fc2\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.MonadT 2e45532830ced35fcf64ea307ca3f5c2\n- exports: 34162405ec478d3f9aacb5beb1bd0be5\n- MonadT 97dbe0e46fe68cde416cece814284e6f\n- tembed 7ae9c4aceb95e9425a19532a1a5cf606\n- tjoin f2e80dfc8accb232f79dc76260b35361\n- tlift bcd9b7abc90632e71082fc74bfa6d889\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Barbies.Internal.TraversableT 6d9f71dcdc22d5d3261927c7c3f0afd5\n- exports: 24f5ff092cfd60d1c33d22f7bfc60097\n- TraversableT e7c67190d7e0b7e757119c341317ca7c\n- tfoldMap 89aba6788a37742a350980fb20f7fd7d\n- tsequence f3a225e91845d5e7470e50de6f7eea6f\n- tsequence' 32ebe38fec21ca397a0ee3ba29d55bec\n- ttraverse 52a07542ffc301896e358aebbb2830d3\n- ttraverse_ d0d74b1d03ca0a1d47af8dee84b6ed90\n-import -/ barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe:Data.Generics.GenericN 5ab7f4dc94ce0f41f48853dd931d0499\n- exports: 307a2e68cbb21a03a7dd871748641b06\n- Rec d8ffa08834c4c62062cbf33b3a6a8e7d\n- Rec 9017a94ecd3f60378299e9682a29a339\n- unRec 6cdf989c26100469a6285cb308ea82fb\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ApplicativeT a4b6dde0959b1b6fc0980131174b93d9\n+ exports: fb4057e5f657bcf51e84559f4e82a422\n+ ApplicativeT 8c4c465730cad783db66cced9f6ad1cd\n+ tprod f7a3c13f2f2048c22a31a51a529488c9\n+ tpure 18e1079f018128459a0a8b55ce7b774e\n+ tunzip 19c9841b082e8c9d41dd4d6ca7eb20eb\n+ tzip 243b199bba526517ade86985eff9e9ab\n+ tzipWith 654badf19e125b627d365af82896f5ce\n+ tzipWith3 c787f5f67a26ab8a5b01d080e8d50a1c\n+ tzipWith4 14a75411752014d3e5c59acd446735af\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.ConstraintsT d1df5ef962f0b55196afb59b42e0f1da\n+ exports: ed62ac4a4eb5e94b8facce81e2b4a838\n+ AllT c4a1138038b732a439b85a866b14c054\n+ AllTF c91b40bc5df4557bc150947824e6d65b\n+ ConstraintsT d50d1d4be2b903724d6bf2baa5481d3f\n+ taddDicts 8cc5a26652c1789f051ee21b00594b19\n+ tmapC 1bf040f27f0c14d38d137b7a60d57d93\n+ ttraverseC 5f64d3e2e8c919dd82131024647bdfb8\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.DistributiveT e2516ba32392922786c305c30d832725\n+ exports: ed1c5309290b8a2cf9319bed55a63450\n+ DistributiveT 3287b4f0ba90375696b0ae382def28bc\n+ tcotraverse 016be32a0da9662c14df822159e8726b\n+ tdecompose 4f5723c8ae8da00ff81fa74a410ea794\n+ tdistribute 50e04509af645581a3b094a3f3168944\n+ tdistribute' 28eae7229d2fc317892c749d705ea543\n+ trecompose 722eedbd64f0646c25e42b9733b9f082\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.FunctorT 385628ba6df11d9bcfdcefda46278ea8\n+ exports: e02f5d493ca75ffd2f01042546f54905\n+ FunctorT ae5ec0f7570f82aca6f5f14b2f49b24c\n+ tmap d0b4955d5dbd43342b986bfbb6d3da5d\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.MonadT a5e6475ab282416ed2d4778ea69017b2\n+ exports: 847c759e05e334128713d431e8407f6d\n+ MonadT 901f738abac3be5c36af79b68794e7ff\n+ tembed eb8a2a11f55d29837f11cc6f18f79ff2\n+ tjoin 0980482f7cbb9f3136a3337d0a9fe837\n+ tlift ac7a8e24b8f93dcdff0a91a51878c639\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Barbies.Internal.TraversableT 70a0f6bb8ee700f78b9077b3af018bc8\n+ exports: e6c541e77f859c5116aa0273fe952d3a\n+ TraversableT 0d4893fb3ceb3c7a5413bd1c7de7657c\n+ tfoldMap 1f6b797c47fe546509e6e115aa72cc9a\n+ tsequence 9248ca66fed49993685fa174b2adebf3\n+ tsequence' b909f470cf0600c6d7e5c98ae4f39532\n+ ttraverse 0b7ab5f0b9eafcdfa92c0611d78a7459\n+ ttraverse_ 78999db991d8975be40c74b1d6d967dc\n+import -/ barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U:Data.Generics.GenericN 2cb3626d76281764d745593efa3ddaa0\n+ exports: ddd229d354fb4e9da43735622f139811\n+ Rec f9ff074807dea74d44999b8224bfaf68\n+ Rec fe113cdf6189cb36af37422ecdf6cf32\n+ unRec b9b567a7055424321315c3c0c33e934c\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-e8d0846ab6bf10afedc2e173ebee2a3e\n+81e9870506964534fb6560cfdf6b4f6e\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-9c0ae710990cf2f44cb403ad7a173fdf\n+1837800a82c2d6f9714d291344aac372\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-56eafa756bfcad879e9c49db741ced56\n+4573d0735f1ab159832a5bd8b03802a2\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Functor.Transformer\"#]\n-eda8bc7060567a1084238d5b9170deaf\n+2668df7ff3d645f0f5a39520985511de\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-1e4007c12d00dd493ea12fb4c5831fe4\n+7fd2e44b7d254ec246cc77b48184f6b1\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n trusted: none\n require own pkg trusted: False\n docs:\n Nothing\n extensible fields:\n \n"}]}, {"source1": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe/Data/Generics/GenericN.p_hi", "source2": "./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.6.6/barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U/Data/Generics/GenericN.p_hi", "comments": ["Files 98% similar despite different names"], "unified_diff": null, "details": [{"source1": "ghc --show-iface {}", "source2": "ghc --show-iface {}", "unified_diff": "@@ -1,17 +1,17 @@\n Magic: Wanted 33214052,\n got 33214052\n Version: Wanted 9066,\n got 9066\n Way: Wanted ,\n got p\n interface Data.Generics.GenericN [family instance module] 9066\n- interface hash: 5248e526c9e0f7a1fc6ad8e601680f2f\n- ABI hash: 5ab7f4dc94ce0f41f48853dd931d0499\n- export-list hash: 307a2e68cbb21a03a7dd871748641b06\n+ interface hash: 6bf7e3b3011b5dcf62daf9d83ba5076d\n+ ABI hash: 2cb3626d76281764d745593efa3ddaa0\n+ export-list hash: ddd229d354fb4e9da43735622f139811\n orphan hash: 693e9af84d3dfcc71e640e005bdc5e2e\n flag hash: d11bf6e00943ba13b6605308f5601ef0\n opt_hash: 6c7aa9c86a88606ea9feb346b37abe02\n hpc_hash: 93b885adfe0da089cdf634904fd59f71\n plugin_hash: ad164012d6b1e14942349d58b1132007\n src_hash: 20c4705bc3e8084b4769b462455c7608\n sig of: Nothing\n@@ -78,28 +78,28 @@\n import -/ Data.Coerce 3269ee8ad04da065068a7a50d58e6cd3\n import -/ Data.Kind fd15bc9fb2724f55aa3b09ea17d3960c\n import -/ Data.Proxy b583d2225e4e4bef1d89cafe24a40e62\n import -/ GHC.Generics 21d7c8a26992a4e12ea7708ed53b9dfc\n import -/ GHC.TypeLits f23e4e26ee7d5b9bc41b0d7e088545e9\n import -/ GHC.TypeNats d69020e5722c2743fec6a0f72e8ea24f\n import -/ Prelude a1ae76d73d35cc0683dc06ee0b1f4dc2\n-c00f0d8e8cd0302362f6b1fc6880cefb\n+ee62af8408a55d98688762973ff08d82\n $fGenericNa ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n GenericN a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n Unfolding: DFun: @a\n (v['GHC.Types.Many] :: GHC.Types.Coercible\n (GHC.Generics.Rep a) (RepN a))\n (v1['GHC.Types.Many] :: GHC.Generics.Generic a).\n @a v v1 ($fGenericNa_$ctoN @a v v1) ($fGenericNa_$cfromN @a v v1)]\n-e9dae078157b4bb19e62fc84e6709067\n+14b24a35e15b94714436a18d174a6719\n $fGenericNa_$cfromN ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n a -> RepN a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(1L)><1P(1L,A)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -111,15 +111,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepN a)\n $dCoercible of co { DEFAULT ->\n (\\ @x -> GHC.Generics.from @a $dGeneric @x)\n `cast`\n (forall (x :: <*>_N). _R %<'GHC.Types.Many>_N ->_R co _N) }]\n-975c2442247f008e7806528ecc966fd6\n+703617345b4c9e21a8d44a33c6d2914c\n $fGenericNa_$ctoN ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n RepN a x -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 2, Arity: 2,\n Strictness: <1P(1L)><1P(A,1L)>, Inline: (sat-args=0),\n Unfolding: Core: StableUser <2,FalseFalse>\n@@ -131,15 +131,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepN a)\n $dCoercible of co { DEFAULT ->\n (\\ @x -> GHC.Generics.to @a $dGeneric @x)\n `cast`\n (forall (x :: <*>_N). co _N %<'GHC.Types.Many>_N ->_R _R) }]\n-ebcd25237270c6fae894191744cd4a32\n+7973c2f86471ebcdaeabdff41f2d75ea\n $fGenericPna ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n GenericP n a\n DFunId\n [HasNoCafRefs, TagSig: , LambdaFormInfo: LFReEntrant 2,\n Arity: 2, Strictness: , Inline: CONLIKE,\n@@ -150,15 +150,15 @@\n (v1['GHC.Types.Many] :: GHC.Generics.Generic a).\n @n\n @a\n v\n v1\n ($fGenericPna_$ctoP @a @n v v1)\n ($fGenericPna_$cfromP @a @n v v1)]\n-ce8bd8b024ac4082283a4038b8520de5\n+54d6d89464b7961e902e63f73fea34f3\n $fGenericPna_$cfromP ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n Data.Proxy.Proxy n -> a -> RepP n a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1L)><1P(1L,A)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -173,15 +173,15 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepP n a)\n $dCoercible of co { DEFAULT ->\n (GHC.Generics.from @a $dGeneric @x)\n `cast`\n (_R %<'GHC.Types.Many>_N ->_R co _N) }]\n-456d8618d5913b5d50e138066057e65d\n+985db640f01270a0094a7710d184cca0\n $fGenericPna_$ctoP ::\n (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n Data.Proxy.Proxy n -> RepP n a x -> a\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 3, Arity: 3,\n Strictness: <1P(1L)><1P(A,1L)>, Inline: (sat-args=1),\n Unfolding: Core: StableUser <3,FalseFalse>\n@@ -196,272 +196,272 @@\n @(* -> *)\n @(GHC.Generics.Rep a)\n @(RepP n a)\n $dCoercible of co { DEFAULT ->\n (GHC.Generics.to @a $dGeneric @x)\n `cast`\n (co _N %<'GHC.Types.Many>_N ->_R _R) }]\n-042d1cc01cc554e4884d8b73df668064\n+1ce19a72b58a0e1a7465a8a8f00dd687\n $tc'Rec :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 2010739128158471245#Word64\n- 13967947080697914728#Word64\n+ 3641965112030500663#Word64\n+ 17228817449347045139#Word64\n $trModule\n $tc'Rec2\n 4#\n $tc'Rec1]\n-4a7527726447d1acd2fc9625d9e742aa\n+0ab194d6e23144f60a518a0248d8e242\n $tc'Rec1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-31c16267b28d71d76a362cdbff5b6581\n+4651b5ae438aa5170e60a689cbbd356c\n $tc'Rec2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tc'Rec3]\n-41cafd84bd7d6ec0ea94a25fde216ea9\n+0bad259247e68351a7b5e610c2a16a9b\n $tc'Rec3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"'Rec\"#]\n-b60c60bc0815f57e5deed1742557986f\n+1eaeaf8e84eb4bcc99588bd1558c7745\n $tcGenericN :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 13366642642489202528#Word64\n- 16533088930544678980#Word64\n+ 8431548670426927589#Word64\n+ 8276686068605313302#Word64\n $trModule\n $tcGenericN2\n 0#\n $tcGenericN1]\n-86fc687e4119a7168fe328fe3c58cfbc\n+b46b24512d4fb0e6131c0fb5cb02d34a\n $tcGenericN1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-f126c1fe640754bb787fd8b7e9b17434\n+245b849b4bf43ea00d8cd2734d3cce9b\n $tcGenericN2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGenericN3]\n-5f3a6a6d699cdbfb51ad634392bfbb3e\n+9c08e0cf76b7d1833000ce77f2a97b4a\n $tcGenericN3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GenericN\"#]\n-22b93de4eaf9a83429e5d5169d9d289f\n+3528bb653433f29d062a7c08e2202cb7\n $tcGenericP :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7746456970720547853#Word64\n- 7869983480876816926#Word64\n+ 10546502919063957716#Word64\n+ 4403573475803759602#Word64\n $trModule\n $tcGenericP2\n 0#\n $tcGenericP1]\n-7841065602a8387f35d0834beb53d35d\n+098a1c8a4da0eafbf0bc46915bdc3cc2\n $tcGenericP1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-819ea323ad6a4f449e3140ecd3edb497\n+17ac0303a08e0f22b2857af4a7b0a424\n $tcGenericP2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcGenericP3]\n-a736ebd9bb38bb16eb5234dd49c60986\n+a94442cbc3877b2176ba132254968986\n $tcGenericP3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"GenericP\"#]\n-2de73bd748e080c8ba90f2f4c2321a31\n+ec97bcaf2e023750dd1bacfe29de2595\n $tcParam :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 3873479314949231875#Word64\n- 3287949389011015102#Word64\n+ 3708105176982407385#Word64\n+ 855080426625777784#Word64\n $trModule\n $tcParam2\n 1#\n $tcParam1]\n-c9d8d518ac2b5bc4e1b23a819e45ed4f\n+d3d520a16e26c3cf8ebc4264dcc10018\n $tcParam1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-7cd22a64393d7d34a18a83cc4d95339d\n+52d05bff125e28f665fac6c34c538178\n $tcParam2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcParam3]\n-e63f5e84ef414935fbe13542a4d11b6b\n+8a5e35570356d9a3cfeb97314c7d1af8\n $tcParam3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Param\"#]\n-6305562a7e44617fc81acbc6ddf568a2\n+5245bea0f94bfffdddad0e205a3e583e\n $tcRec :: GHC.Types.TyCon\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TyCon],\n Unfolding: Core: \n GHC.Types.TyCon\n- 7366229076863813425#Word64\n- 17893782013242789224#Word64\n+ 4496317617164788358#Word64\n+ 9240627540514957836#Word64\n $trModule\n $tcRec2\n 1#\n $tcRec1]\n-61ba17b60e0e30efb231f16276df5b3e\n+b23877eca59ea9c909b636baac151f29\n $tcRec1 :: GHC.Types.KindRep\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.KindRepFun], Inline: [~]]\n-802a30c38651e14ac92093b8acc4cf71\n+3dc736b817667ca788cb338ec25c38b5\n $tcRec2 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $tcRec3]\n-b1f13471981b749c3de7d07d9631d7be\n+add2b530503730e66daaf1895998822b\n $tcRec3 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Rec\"#]\n-4b558a5a0166b0221acfe75cc8c60029\n+4672c8d772df915ea2576b915fa3c27a\n $trModule :: GHC.Types.Module\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.Module],\n Unfolding: Core: GHC.Types.Module $trModule3 $trModule1]\n-2928f797403af6c3f5938d73352d2076\n+7e93adc921c872c514fa153e5387b2b4\n $trModule1 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule2]\n-31e202f6d8534b24bf51f4b7532a83c3\n+9fafeb5d57c048cdd1f67aa75ab2f0f3\n $trModule2 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \"Data.Generics.GenericN\"#]\n-d4c12a6817ba80afc664a6226d54a9e2\n+85d6b64d2b0f3bf79292f3f3049c015e\n $trModule3 :: GHC.Types.TrName\n [HasNoCafRefs, TagSig: ,\n LambdaFormInfo: LFCon[GHC.Types.TrNameS],\n Unfolding: Core: GHC.Types.TrNameS $trModule4]\n-4363a9c789de4e96245188639ed3abd8\n+8627082b9155637d4e5b4181b6be3bea\n $trModule4 :: GHC.Prim.Addr#\n [HasNoCafRefs, LambdaFormInfo: LFUnlifted,\n Unfolding: Core: \n- \"barbies-2.0.5.0-3PTNBcsybn4FHwibT0wWBe\"#]\n-4d032684fe99eec242cff5c60828727f\n+ \"barbies-2.0.5.0-9SJ5MlDALgM62G0wlRTJ2U\"#]\n+8383e02d5e99ada2c0c42f50a0b2e7d0\n axiom D:R:FilterIndex ::\n forall k1 k2 (n :: GHC.TypeNats.Nat) (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param n a)) = FilterIndex n t (Param n a)\n forall k1 k2 (_1 :: GHC.TypeNats.Nat) (n :: GHC.TypeNats.Nat)\n (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param _1 a)) = FilterIndex n t a\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). FilterIndex _1 t = t\n-73e21b2157370f5cd1328cde0971d6b0\n+4c33e6968806153750deddb6d613d962\n axiom D:R:Indexed ::\n forall k1 k2 (t :: k1 -> k2) (a :: k1) (i :: GHC.TypeNats.Nat).\n Indexed (t a) i = Indexed t (i GHC.TypeNats.+ 1) (Param i a)\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). Indexed t _1 = t\n-c6aac925e2d3444bb9b319baddac2faf\n+6ce5d72ad7ee8026c44a94d2c259a0ab\n axiom D:R:Zip ::\n Zip (GHC.Generics.M1 mt m s) (GHC.Generics.M1 mt m t)\n = GHC.Generics.M1 mt m (Zip s t)\n Zip (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n = Zip l l' GHC.Generics.:+: Zip r r'\n Zip (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n = Zip l l' GHC.Generics.:*: Zip r r'\n Zip (GHC.Generics.Rec0 p) (GHC.Generics.Rec0 a) = Rec p a\n Zip GHC.Generics.U1 GHC.Generics.U1 = GHC.Generics.U1\n Zip GHC.Generics.V1 GHC.Generics.V1 = GHC.Generics.V1\n-28629d2d100254e316c2e2006644bb35\n+d25400e43e9b658f703ceff2ac3de284\n type FilterIndex :: forall k. GHC.TypeNats.Nat -> k -> k\n type family FilterIndex n t where\n forall k1 k2 (n :: GHC.TypeNats.Nat) (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param n a)) = FilterIndex n t (Param n a)\n forall k1 k2 (_1 :: GHC.TypeNats.Nat) (n :: GHC.TypeNats.Nat)\n (t :: k1 -> k2) (a :: k1).\n FilterIndex n (t (Param _1 a)) = FilterIndex n t a\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). FilterIndex _1 t = t\n axiom D:R:FilterIndex\n-1b4266d07741206f7b8cba4fa8905e56\n+3d9f2f2677a23aa95c2fa5da9877e31f\n type GenericN :: * -> GHC.Types.Constraint\n class (GHC.Types.Coercible (GHC.Generics.Rep a) (RepN a),\n GHC.Generics.Generic a) =>\n GenericN a where\n type RepN :: * -> * -> *\n type family RepN a open\n Default: Zip (GHC.Generics.Rep (Indexed a 0)) (GHC.Generics.Rep a)\n toN :: RepN a x -> a\n fromN :: a -> RepN a x\n {-# MINIMAL toN, fromN #-}\n-a69a411bf0015ec405253821470b1398\n+e8f0d81c6baece2774d787f7a39d65a5\n type GenericP :: GHC.TypeNats.Nat -> * -> GHC.Types.Constraint\n class (GHC.Types.Coercible (GHC.Generics.Rep a) (RepP n a),\n GHC.Generics.Generic a) =>\n GenericP n a where\n type RepP :: GHC.TypeNats.Nat -> * -> * -> *\n type family RepP n a open\n Default: Zip\n (GHC.Generics.Rep (FilterIndex n (Indexed a 0)))\n (GHC.Generics.Rep a)\n toP :: Data.Proxy.Proxy n -> RepP n a x -> a\n fromP :: Data.Proxy.Proxy n -> a -> RepP n a x\n {-# MINIMAL toP, fromP #-}\n-6d9d16f1708cc593b81a9519125d5cd4\n+a088e1d15833f960906b057a9fbfae7d\n type Indexed :: forall k. k -> GHC.TypeNats.Nat -> k\n type family Indexed t i where\n forall k1 k2 (t :: k1 -> k2) (a :: k1) (i :: GHC.TypeNats.Nat).\n Indexed (t a) i = Indexed t (i GHC.TypeNats.+ 1) (Param i a)\n forall k (_1 :: GHC.TypeNats.Nat) (t :: k). Indexed t _1 = t\n axiom D:R:Indexed\n-64ce4f405ce19c0ac06589973a57c10d\n+8a772f1a47d87e197f6034a33fad91b6\n type Param :: forall k. GHC.TypeNats.Nat -> k -> k\n data family Param n a\n-cc6870322967061e3e294fa941207578\n+b64e9767791c7646e7de5444a8baea95\n axiom R:RepNa ::\n RepN a = Zip (GHC.Generics.Rep (Indexed a 0)) (GHC.Generics.Rep a)\n-4c9068d6fd9becaa03bfc415a516caa2\n+de699670ea6e0d4bef29c9935f8c1166\n axiom R:RepPna ::\n RepP n a\n = Zip\n (GHC.Generics.Rep (FilterIndex n (Indexed a 0)))\n (GHC.Generics.Rep a)\n-9017a94ecd3f60378299e9682a29a339\n+fe113cdf6189cb36af37422ecdf6cf32\n type role Rec phantom representational phantom\n type Rec :: forall {k}. * -> * -> k -> *\n newtype Rec p a x\n = Rec {unRec :: GHC.Generics.K1 GHC.Generics.R a x}\n-78f93d71df1aa24b758da222fa746749\n+d86c23e87aa7cf6ff0da40771f7e9b4d\n type Zip :: (* -> *) -> (* -> *) -> * -> *\n type family Zip a b where\n Zip (GHC.Generics.M1 mt m s) (GHC.Generics.M1 mt m t)\n = GHC.Generics.M1 mt m (Zip s t)\n Zip (l GHC.Generics.:+: r) (l' GHC.Generics.:+: r')\n = Zip l l' GHC.Generics.:+: Zip r r'\n Zip (l GHC.Generics.:*: r) (l' GHC.Generics.:*: r')\n = Zip l l' GHC.Generics.:*: Zip r r'\n Zip (GHC.Generics.Rec0 p) (GHC.Generics.Rec0 a) = Rec p a\n Zip GHC.Generics.U1 GHC.Generics.U1 = GHC.Generics.U1\n Zip GHC.Generics.V1 GHC.Generics.V1 = GHC.Generics.V1\n axiom D:R:Zip\n-6cdf989c26100469a6285cb308ea82fb\n+b9b567a7055424321315c3c0c33e934c\n unRec ::\n forall {k} p a (x :: k).\n Rec p a x -> GHC.Generics.K1 GHC.Generics.R a x\n RecSel Left Rec\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n unRec1\n `cast`\n (forall (k :: <*>_N) (p :: <*>_N) (a :: <*>_N) (x :: _N).\n _R\n %<'GHC.Types.Many>_N ->_R N:Rec[0] _N

_P _N _N)]\n-ade1d758a053ec828622b1ee6c667f57\n+c4533f4984b827d71f1ca8da30aa3f9b\n unRec1 :: forall {k} {p} {a} {x :: k}. Rec p a x -> Rec p a x\n [HasNoCafRefs, LambdaFormInfo: LFReEntrant 1, Arity: 1,\n Strictness: <1L>,\n Unfolding: Core: \n \\ @k @p @a @x :: k (ds['GHC.Types.Many] :: Rec p a x) ->\n {__scc {Data.Generics.GenericN.unRec} True False} ds]\n instance GenericN [.] = $fGenericNa\n"}]}]}]}]}]}